conftrace_

regret minimization

315 papers

Explore in graph

Co-occurring keywords

online learning (1777) multi-armed bandit (1098) regret bound (1926) stochastic optimization (1060) game theory (854) online algorithm (445) reinforcement learning (4352) markov decision process (790) nash equilibrium (398) extensive-form game (86)

Papers

Beyond the Lower Bound: Bridging Regret Minimization and Best Arm Identification in Lexicographic Bandits AAAI 2026
Marginal Benefit Driven RL Teacher for Unsupervised Environment Design AAAI 2025
p-Mean Regret for Stochastic Bandits AAAI 2025
Beyond Numeric Rewards: In-Context Dueling Bandits with LLM Agents ACL 2025
Reinforced In-Context Black-Box Optimization IJCAI 2025
Optimization Over a Probability Simplex JMLR 2025
Linear Streaming Bandit: Regret Minimization and Fixed-Budget Epsilon-Best Arm Identification AAAI 2025
A Simple and Optimal Approach for Universal Online Learning with Gradient Variations NIPS 2024
Efficient Learning in Polyhedral Games via Best-Response Oracles AAAI 2024
Regret Minimization in Stackelberg Games with Side Information NIPS 2024
Robust Losses for Decision-Focused Learning IJCAI 2024
Communication-Efficient Collaborative Regret Minimization in Multi-Armed Bandits AAAI 2024
Autoregressive Bandits AISTATS 2024
Beyond Primal-Dual Methods in Bandits with Stochastic and Adversarial Constraints NIPS 2024
Convergence of No-Swap-Regret Dynamics in Self-Play NIPS 2024
Meta Learning in Bandits within shared affine Subspaces AISTATS 2024
Online Stackelberg Optimization via Nonlinear Control COLT 2024
Directional Optimism for Safe Linear Bandits AISTATS 2024
Extensive-Form Game Solving via Blackwell Approachability on Treeplexes NIPS 2024
Adversarial Environment Design via Regret-Guided Diffusion Models NIPS 2024
Learning in Markov Games with Adaptive Adversaries: Policy Regret, Fundamental Barriers, and Efficient Algorithms NIPS 2024
Dynamic Budget Throttling in Repeated Second-Price Auctions AAAI 2024
A Doubly Robust Approach to Sparse Reinforcement Learning AISTATS 2024
Open Problem: Black-Box Reductions and Adaptive Gradient Methods for Nonconvex Optimization COLT 2024
Learning Not to Regret AAAI 2024