An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems
Fuente:
arXiv
Guardado en:
| Autores principales: | Sachs, Sarah, Hadiji, Hedi, van Erven, Tim, Staudigl, Mathias |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
por: Sachs, Sarah, et al.
Publicado: (2023)
por: Sachs, Sarah, et al.
Publicado: (2023)
Tracking solutions of time-varying variational inequalities
por: Hadiji, Hédi, et al.
Publicado: (2024)
por: Hadiji, Hédi, et al.
Publicado: (2024)
Tractable Instances of Bilinear Maximization: Implementing LinUCB on Ellipsoids
por: Zhang, Raymond, et al.
Publicado: (2025)
por: Zhang, Raymond, et al.
Publicado: (2025)
Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
por: Zhang, Raymond, et al.
Publicado: (2025)
por: Zhang, Raymond, et al.
Publicado: (2025)
Diversity-Preserving K-Armed Bandits, Revisited
por: Hadiji, Hédi, et al.
Publicado: (2020)
por: Hadiji, Hédi, et al.
Publicado: (2020)
Sample-efficient Learning of Concepts with Theoretical Guarantees: from Data to Concepts without Interventions
por: Fokkema, Hidde, et al.
Publicado: (2025)
por: Fokkema, Hidde, et al.
Publicado: (2025)
The Risks of Recourse in Binary Classification
por: Fokkema, Hidde, et al.
Publicado: (2023)
por: Fokkema, Hidde, et al.
Publicado: (2023)
Nearly Minimax Discrete Distribution Estimation in Kullback-Leibler Divergence with High Probability
por: van der Hoeven, Dirk, et al.
Publicado: (2025)
por: van der Hoeven, Dirk, et al.
Publicado: (2025)
An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
por: van Erven, Tim, et al.
Publicado: (2025)
por: van Erven, Tim, et al.
Publicado: (2025)
Proximal Point Method for Online Saddle Point Problem
por: Meng, Qing-xin, et al.
Publicado: (2024)
por: Meng, Qing-xin, et al.
Publicado: (2024)
Safe Multi-Agent Reinforcement Learning with Convergence to Generalized Nash Equilibrium
por: Li, Zeyang, et al.
Publicado: (2024)
por: Li, Zeyang, et al.
Publicado: (2024)
Towards General Preference Alignment: Diffusion Models at Nash Equilibrium
por: Hu, Jiaming, et al.
Publicado: (2026)
por: Hu, Jiaming, et al.
Publicado: (2026)
An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
por: Wang, Guillaume, et al.
Publicado: (2022)
por: Wang, Guillaume, et al.
Publicado: (2022)
A conditional gradient homotopy method with applications to Semidefinite Programming
por: Dvurechensky, Pavel, et al.
Publicado: (2022)
por: Dvurechensky, Pavel, et al.
Publicado: (2022)
Mixed Strategy Nash Equilibrium for Crowd Navigation
por: Sun, Max Muchen, et al.
Publicado: (2024)
por: Sun, Max Muchen, et al.
Publicado: (2024)
No-Regret Learning of Nash Equilibrium for Black-Box Games via Gaussian Processes
por: Han, Minbiao, et al.
Publicado: (2024)
por: Han, Minbiao, et al.
Publicado: (2024)
From Debate to Equilibrium: Belief-Driven Multi-Agent LLM Reasoning via Bayesian Nash Equilibrium
por: Yi, Xie, et al.
Publicado: (2025)
por: Yi, Xie, et al.
Publicado: (2025)
AlphaExploitem: Going Beyond the Nash Equilibrium in Poker by Learning to Exploit Suboptimal Play
por: Murgoci, Vlad, et al.
Publicado: (2026)
por: Murgoci, Vlad, et al.
Publicado: (2026)
Proximal Point Nash Learning from Human Feedback
por: Tiapkin, Daniil, et al.
Publicado: (2025)
por: Tiapkin, Daniil, et al.
Publicado: (2025)
Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
por: Dong, Jing, et al.
Publicado: (2024)
por: Dong, Jing, et al.
Publicado: (2024)
Large-Scale Auto-bidding with Nash Equilibrium Constraints
por: Mou, Zhiyu, et al.
Publicado: (2025)
por: Mou, Zhiyu, et al.
Publicado: (2025)
Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games
por: Zaman, Muhammad Aneeq uz, et al.
Publicado: (2024)
por: Zaman, Muhammad Aneeq uz, et al.
Publicado: (2024)
Stochastic variance reduced extragradient methods for solving hierarchical variational inequalities
por: Dvurechensky, Pavel, et al.
Publicado: (2026)
por: Dvurechensky, Pavel, et al.
Publicado: (2026)
Nash CoT: Multi-Path Inference with Preference Equilibrium
por: Zhang, Ziqi, et al.
Publicado: (2024)
por: Zhang, Ziqi, et al.
Publicado: (2024)
On the Equilibrium between Feasible Zone and Uncertain Model in Safe Exploration
por: Yang, Yujie, et al.
Publicado: (2026)
por: Yang, Yujie, et al.
Publicado: (2026)
Provable Weak-to-Strong Generalization via Benign Overfitting
por: Wu, David X., et al.
Publicado: (2024)
por: Wu, David X., et al.
Publicado: (2024)
Benign Overfitting in Out-of-Distribution Generalization of Linear Models
por: Tang, Shange, et al.
Publicado: (2024)
por: Tang, Shange, et al.
Publicado: (2024)
Trained Transformer Classifiers Generalize and Exhibit Benign Overfitting In-Context
por: Frei, Spencer, et al.
Publicado: (2024)
por: Frei, Spencer, et al.
Publicado: (2024)
Wasserstein Distributionally Robust Nash Equilibrium Seeking with Heterogeneous Data: A Lagrangian Approach
por: Wang, Zifan, et al.
Publicado: (2025)
por: Wang, Zifan, et al.
Publicado: (2025)
Layerwise Proximal Replay: A Proximal Point Method for Online Continual Learning
por: Yoo, Jason, et al.
Publicado: (2024)
por: Yoo, Jason, et al.
Publicado: (2024)
Data Poisoning to Fake a Nash Equilibrium in Markov Games
por: Wu, Young, et al.
Publicado: (2023)
por: Wu, Young, et al.
Publicado: (2023)
NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria
por: Yu, Eason, et al.
Publicado: (2025)
por: Yu, Eason, et al.
Publicado: (2025)
PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium
por: Ding, Shihong, et al.
Publicado: (2023)
por: Ding, Shihong, et al.
Publicado: (2023)
Nash Equilibrium Between Consumer Electronic Devices and DoS Attacker for Distributed IoT-enabled RSE Systems
por: Chen, Gengcan, et al.
Publicado: (2025)
por: Chen, Gengcan, et al.
Publicado: (2025)
Benign Overfitting in Single-Head Attention
por: Magen, Roey, et al.
Publicado: (2024)
por: Magen, Roey, et al.
Publicado: (2024)
RIO-CPD: A Riemannian Geometric Method for Correlation-aware Online Change Point Detection
por: Deng, Chengyuan, et al.
Publicado: (2024)
por: Deng, Chengyuan, et al.
Publicado: (2024)
TripleWin: Fixed-Point Equilibrium Pricing for Data-Model Coupled Markets
por: Ren, Hongrun, et al.
Publicado: (2025)
por: Ren, Hongrun, et al.
Publicado: (2025)
Understanding Generalization in Transformers: Error Bounds and Training Dynamics Under Benign and Harmful Overfitting
por: Zhang, Yingying, et al.
Publicado: (2025)
por: Zhang, Yingying, et al.
Publicado: (2025)
Gradient Equilibrium in Online Learning: Theory and Applications
por: Angelopoulos, Anastasios N., et al.
Publicado: (2025)
por: Angelopoulos, Anastasios N., et al.
Publicado: (2025)
Benign Samples Matter! Fine-tuning On Outlier Benign Samples Severely Breaks Safety
por: Guan, Zihan, et al.
Publicado: (2025)
por: Guan, Zihan, et al.
Publicado: (2025)
Ejemplares similares
-
Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
por: Sachs, Sarah, et al.
Publicado: (2023) -
Tracking solutions of time-varying variational inequalities
por: Hadiji, Hédi, et al.
Publicado: (2024) -
Tractable Instances of Bilinear Maximization: Implementing LinUCB on Ellipsoids
por: Zhang, Raymond, et al.
Publicado: (2025) -
Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
por: Zhang, Raymond, et al.
Publicado: (2025) -
Diversity-Preserving K-Armed Bandits, Revisited
por: Hadiji, Hédi, et al.
Publicado: (2020)