Saved in:
| Main Authors: | Sachs, Sarah, Hadiji, Hedi, van Erven, Tim, Staudigl, Mathias |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2410.02400 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
by: Sachs, Sarah, et al.
Published: (2023)
by: Sachs, Sarah, et al.
Published: (2023)
Tracking solutions of time-varying variational inequalities
by: Hadiji, Hédi, et al.
Published: (2024)
by: Hadiji, Hédi, et al.
Published: (2024)
Tractable Instances of Bilinear Maximization: Implementing LinUCB on Ellipsoids
by: Zhang, Raymond, et al.
Published: (2025)
by: Zhang, Raymond, et al.
Published: (2025)
Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
by: Zhang, Raymond, et al.
Published: (2025)
by: Zhang, Raymond, et al.
Published: (2025)
Diversity-Preserving K-Armed Bandits, Revisited
by: Hadiji, Hédi, et al.
Published: (2020)
by: Hadiji, Hédi, et al.
Published: (2020)
Sample-efficient Learning of Concepts with Theoretical Guarantees: from Data to Concepts without Interventions
by: Fokkema, Hidde, et al.
Published: (2025)
by: Fokkema, Hidde, et al.
Published: (2025)
The Risks of Recourse in Binary Classification
by: Fokkema, Hidde, et al.
Published: (2023)
by: Fokkema, Hidde, et al.
Published: (2023)
Nearly Minimax Discrete Distribution Estimation in Kullback-Leibler Divergence with High Probability
by: van der Hoeven, Dirk, et al.
Published: (2025)
by: van der Hoeven, Dirk, et al.
Published: (2025)
An Improved Algorithm for Adversarial Linear Contextual Bandits via Reduction
by: van Erven, Tim, et al.
Published: (2025)
by: van Erven, Tim, et al.
Published: (2025)
Proximal Point Method for Online Saddle Point Problem
by: Meng, Qing-xin, et al.
Published: (2024)
by: Meng, Qing-xin, et al.
Published: (2024)
A conditional gradient homotopy method with applications to Semidefinite Programming
by: Dvurechensky, Pavel, et al.
Published: (2022)
by: Dvurechensky, Pavel, et al.
Published: (2022)
Safe Multi-Agent Reinforcement Learning with Convergence to Generalized Nash Equilibrium
by: Li, Zeyang, et al.
Published: (2024)
by: Li, Zeyang, et al.
Published: (2024)
Towards General Preference Alignment: Diffusion Models at Nash Equilibrium
by: Hu, Jiaming, et al.
Published: (2026)
by: Hu, Jiaming, et al.
Published: (2026)
An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
by: Wang, Guillaume, et al.
Published: (2022)
by: Wang, Guillaume, et al.
Published: (2022)
Mixed Strategy Nash Equilibrium for Crowd Navigation
by: Sun, Max Muchen, et al.
Published: (2024)
by: Sun, Max Muchen, et al.
Published: (2024)
Stochastic variance reduced extragradient methods for solving hierarchical variational inequalities
by: Dvurechensky, Pavel, et al.
Published: (2026)
by: Dvurechensky, Pavel, et al.
Published: (2026)
No-Regret Learning of Nash Equilibrium for Black-Box Games via Gaussian Processes
by: Han, Minbiao, et al.
Published: (2024)
by: Han, Minbiao, et al.
Published: (2024)
From Debate to Equilibrium: Belief-Driven Multi-Agent LLM Reasoning via Bayesian Nash Equilibrium
by: Yi, Xie, et al.
Published: (2025)
by: Yi, Xie, et al.
Published: (2025)
Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
by: Dong, Jing, et al.
Published: (2024)
by: Dong, Jing, et al.
Published: (2024)
Large-Scale Auto-bidding with Nash Equilibrium Constraints
by: Mou, Zhiyu, et al.
Published: (2025)
by: Mou, Zhiyu, et al.
Published: (2025)
AlphaExploitem: Going Beyond the Nash Equilibrium in Poker by Learning to Exploit Suboptimal Play
by: Murgoci, Vlad, et al.
Published: (2026)
by: Murgoci, Vlad, et al.
Published: (2026)
Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games
by: Zaman, Muhammad Aneeq uz, et al.
Published: (2024)
by: Zaman, Muhammad Aneeq uz, et al.
Published: (2024)
Proximal Point Nash Learning from Human Feedback
by: Tiapkin, Daniil, et al.
Published: (2025)
by: Tiapkin, Daniil, et al.
Published: (2025)
Nash CoT: Multi-Path Inference with Preference Equilibrium
by: Zhang, Ziqi, et al.
Published: (2024)
by: Zhang, Ziqi, et al.
Published: (2024)
On the Equilibrium between Feasible Zone and Uncertain Model in Safe Exploration
by: Yang, Yujie, et al.
Published: (2026)
by: Yang, Yujie, et al.
Published: (2026)
Provable Weak-to-Strong Generalization via Benign Overfitting
by: Wu, David X., et al.
Published: (2024)
by: Wu, David X., et al.
Published: (2024)
Benign Overfitting in Out-of-Distribution Generalization of Linear Models
by: Tang, Shange, et al.
Published: (2024)
by: Tang, Shange, et al.
Published: (2024)
Wasserstein Distributionally Robust Nash Equilibrium Seeking with Heterogeneous Data: A Lagrangian Approach
by: Wang, Zifan, et al.
Published: (2025)
by: Wang, Zifan, et al.
Published: (2025)
Data Poisoning to Fake a Nash Equilibrium in Markov Games
by: Wu, Young, et al.
Published: (2023)
by: Wu, Young, et al.
Published: (2023)
Trained Transformer Classifiers Generalize and Exhibit Benign Overfitting In-Context
by: Frei, Spencer, et al.
Published: (2024)
by: Frei, Spencer, et al.
Published: (2024)
PAPAL: A Provable PArticle-based Primal-Dual ALgorithm for Mixed Nash Equilibrium
by: Ding, Shihong, et al.
Published: (2023)
by: Ding, Shihong, et al.
Published: (2023)
NashPG: A Policy Gradient Method with Iteratively Refined Regularization for Finding Nash Equilibria
by: Yu, Eason, et al.
Published: (2025)
by: Yu, Eason, et al.
Published: (2025)
Nash Equilibrium Between Consumer Electronic Devices and DoS Attacker for Distributed IoT-enabled RSE Systems
by: Chen, Gengcan, et al.
Published: (2025)
by: Chen, Gengcan, et al.
Published: (2025)
Layerwise Proximal Replay: A Proximal Point Method for Online Continual Learning
by: Yoo, Jason, et al.
Published: (2024)
by: Yoo, Jason, et al.
Published: (2024)
Benign Overfitting in Single-Head Attention
by: Magen, Roey, et al.
Published: (2024)
by: Magen, Roey, et al.
Published: (2024)
Gradient Equilibrium in Online Learning: Theory and Applications
by: Angelopoulos, Anastasios N., et al.
Published: (2025)
by: Angelopoulos, Anastasios N., et al.
Published: (2025)
Benign Samples Matter! Fine-tuning On Outlier Benign Samples Severely Breaks Safety
by: Guan, Zihan, et al.
Published: (2025)
by: Guan, Zihan, et al.
Published: (2025)
Accelerating Nash Equilibrium Convergence in Monte Carlo Settings Through Counterfactual Value Based Fictitious Play
by: Qi, Ju, et al.
Published: (2023)
by: Qi, Ju, et al.
Published: (2023)
Constrained Online Convex Optimization with Polyak Feasibility Steps
by: Hutchinson, Spencer, et al.
Published: (2025)
by: Hutchinson, Spencer, et al.
Published: (2025)
Adaptive Pruning with Module Robustness Sensitivity: Balancing Compression and Robustness
by: Bai, Lincen, et al.
Published: (2024)
by: Bai, Lincen, et al.
Published: (2024)
Similar Items
-
Accelerated Rates between Stochastic and Adversarial Online Convex Optimization
by: Sachs, Sarah, et al.
Published: (2023) -
Tracking solutions of time-varying variational inequalities
by: Hadiji, Hédi, et al.
Published: (2024) -
Tractable Instances of Bilinear Maximization: Implementing LinUCB on Ellipsoids
by: Zhang, Raymond, et al.
Published: (2025) -
Linear Bandits on Ellipsoids: Minimax Optimal Algorithms
by: Zhang, Raymond, et al.
Published: (2025) -
Diversity-Preserving K-Armed Bandits, Revisited
by: Hadiji, Hédi, et al.
Published: (2020)