Skip to content
conftrace_

online mirror descent

47 papers

OMD

Papers

Policy Optimization for Adversarial Linear Mixture MDPs with Unknown Transitions and Bandit Feedback UAI 2026 Robust and Computationally Efficient Linear Contextual Bandits under Adversarial Corruption and Heavy-Tailed Noise UAI 2026 The Hidden Cost of Approximation in Online Mirror Descent COLT 2026 Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update ICML 2025 Online Episodic Convex Reinforcement Learning ICML 2025 Extensive-Form Game Solving via Blackwell Approachability on Treeplexes NeurIPS 2024 Learning ε-Nash equilibrium stationary policies in stochastic games with unknown independent chains using online mirror descent L4DC 2024 Local and Adaptive Mirror Descents in Extensive-Form Games NeurIPS 2024 Minimizing Weighted Counterfactual Regret with Optimistic Online Mirror Descent IJCAI 2024 On the Optimality of Dilated Entropy and Lower Bounds for Online Learning in Extensive-Form Games NeurIPS 2024 Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization JMLR 2024 Banker Online Mirror Descent: A Universal Approach for Delayed Online Bandit Learning ICML 2023 Improved High-Probability Regret for Adversarial Bandits with Time-Varying Feedback Graphs ALT 2023 Learning Sparse Graphon Mean Field Games AISTATS 2023 Meta-Learning Adversarial Bandit Algorithms NeurIPS 2023 Multi-Objective Online Learning ICLR 2023 No-Regret Learning with Unbounded Losses: The Case of Logarithmic Pooling NeurIPS 2023 Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization ICML 2023 Efficient Phi-Regret Minimization in Extensive-Form Games via Online Mirror Descent NeurIPS 2022 Equivalence Analysis between Counterfactual Regret Minimization and Online Mirror Descent ICML 2022 Follow-the-Perturbed-Leader for Adversarial Markov Decision Processes with Bandit Feedback NeurIPS 2022 Improving Dynamic Regret in Distributed Online Mirror Descent Using Primal and Dual Information L4DC 2022 Online Mirror Descent and Dual Averaging: Keeping Pace in the Dynamic Case JMLR 2022 Scalable Deep Reinforcement Learning Algorithms for Mean Field Games ICML 2022 Faster Game Solving via Predictive Blackwell Approachability: Connecting Regret Matching and Mirror Descent AAAI 2021