Cover Image

No-Regret Learning of Nash Equilibrium for Black-Box Games via Gaussian Processes

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Han, Minbiao, Zhang, Fengxue, Chen, Yuxin
Format:	Preprint
Published:	2024
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Direct Regret Optimization in Bayesian Optimization
by: Zhang, Fengxue, et al.
Published: (2025)

Horizon-Free Regret for Linear Markov Decision Processes
by: Zhang, Zihan, et al.
Published: (2024)

Constrained Multi-objective Bayesian Optimization through Optimistic Constraints Estimation
by: Li, Diantong, et al.
Published: (2024)

Online Learning for Uninformed Markov Games: Empirical Nash-Value Regret and Non-Stationarity Adaptation
by: Liu, Junyan, et al.
Published: (2026)

Near-Optimal Regret for Distributed Adversarial Bandits: A Black-Box Approach
by: Qiu, Hao, et al.
Published: (2026)

Asymptotically Optimal Regret for Black-Box Predict-then-Optimize
by: Tan, Samuel, et al.
Published: (2024)

Learning in Online Principal-Agent Interactions: The Power of Menus
by: Han, Minbiao, et al.
Published: (2023)

Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
by: Dong, Jing, 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)

On the Limitations and Possibilities of Nash Regret Minimization in Zero-Sum Matrix Games under Noisy Feedback
by: Maiti, Arnab, et al.
Published: (2023)

An Exponentially Converging Particle Method for the Mixed Nash Equilibrium of Continuous Games
by: Wang, Guillaume, et al.
Published: (2022)

Regret Analysis for Randomized Gaussian Process Upper Confidence Bound
by: Takeno, Shion, et al.
Published: (2024)

No-Regret Thompson Sampling for Finite-Horizon Markov Decision Processes with Gaussian Processes
by: Bayrooti, Jasmine, et al.
Published: (2025)

Safety Game: Inference-Time Alignment of Black-Box LLMs via Constrained Optimization
by: Nguyen, Tuan, et al.
Published: (2025)

Data Poisoning to Fake a Nash Equilibrium in Markov Games
by: Wu, Young, et al.
Published: (2023)

No-Regret Gaussian Process Optimization of Time-Varying Functions
by: Mauduit, Eliabelle, et al.
Published: (2025)

Gaussian Process Upper Confidence Bound Achieves Nearly-Optimal Regret in Noise-Free Gaussian Process Bandits
by: Iwazaki, Shogo
Published: (2025)

Iterative Nash Policy Optimization: Aligning LLMs with General Preferences via No-Regret Learning
by: Zhang, Yuheng, et al.
Published: (2024)

Safe Multi-Agent Reinforcement Learning with Convergence to Generalized Nash Equilibrium
by: Li, Zeyang, et al.
Published: (2024)

AlphaExploitem: Going Beyond the Nash Equilibrium in Poker by Learning to Exploit Suboptimal Play
by: Murgoci, Vlad, et al.
Published: (2026)

Adaptive Exponential Integration for Stable Gaussian Mixture Black-Box Variational Inference
by: Che, Baojun, et al.
Published: (2026)

Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games
by: Zaman, Muhammad Aneeq uz, et al.
Published: (2024)

Improved Regret Bounds for Gaussian Process Upper Confidence Bound in Bayesian Optimization
by: Iwazaki, Shogo
Published: (2025)

Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors
by: Roy, Somjit, et al.
Published: (2026)

An Efficient Black-Box Reduction from Online Learning to Multicalibration, and a New Route to $Φ$-Regret Minimization
by: Farina, Gabriele, et al.
Published: (2026)

Approximating Nash Equilibria in General-Sum Games via Meta-Learning
by: Sychrovský, David, et al.
Published: (2025)

Regret Analysis of Guided Diffusion for Black-Box Optimization over Structured Inputs
by: Adachi, Masaki, et al.
Published: (2026)

Posterior Sampling Reinforcement Learning with Gaussian Processes for Continuous Control: Sublinear Regret Bounds for Unbounded State Spaces
by: Flynn, Hamish, et al.
Published: (2026)

An Online Feasible Point Method for Benign Generalized Nash Equilibrium Problems
by: Sachs, Sarah, et al.
Published: (2024)

Data-Free Black-Box Federated Learning via Zeroth-Order Gradient Estimation
by: Ma, Xinge, et al.
Published: (2025)

Adapting to Online Distribution Shifts in Deep Learning: A Black-Box Approach
by: Baby, Dheeraj, et al.
Published: (2025)

Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
by: Tran-The, Hung, et al.
Published: (2022)

Tighter Regret Lower Bound for Gaussian Process Bandits with Squared Exponential Kernel in Hypersphere
by: Iwazaki, Shogo
Published: (2026)

Group Fairness Meets the Black Box: Enabling Fair Algorithms on Closed LLMs via Post-Processing
by: Xian, Ruicheng, et al.
Published: (2025)

Mixed Strategy Nash Equilibrium for Crowd Navigation
by: Sun, Max Muchen, et al.
Published: (2024)

Fairness-Aware Meta-Learning via Nash Bargaining
by: Zeng, Yi, et al.
Published: (2024)

Black Box Meta-Learning Intrinsic Rewards
by: Pappalardo, Octavio, et al.
Published: (2024)

Constraint Learning in Multi-Agent Dynamic Games from Demonstrations of Local Nash Interactions
by: Zhang, Zhouyu, et al.
Published: (2025)

Prior Diffusiveness and Regret in the Linear-Gaussian Bandit
by: Zhu, Yifan, et al.
Published: (2026)

Nash CoT: Multi-Path Inference with Preference Equilibrium
by: Zhang, Ziqi, et al.
Published: (2024)