Skip to content
conftrace_

regret minimization

353 papers

Papers

Top-k eXtreme Contextual Bandits with Arm Hierarchy ICML 2021 Towards Reducing Biases in Combining Multiple Experts Online IJCAI 2021 Adaptive Sampling for Stochastic Risk-Averse Learning NeurIPS 2020 A Duality Approach for Regret Minimization in Average-Award Ergodic Markov Decision Processes L4DC 2020 An adaptive stochastic optimization algorithm for resource allocation ALT 2020 An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems AAAI 2020 Constrained Upper Confidence Reinforcement Learning L4DC 2020 Distance-Based Equilibria in Normal-Form Games AAAI 2020 Distributed Bandit Learning: Near-Optimal Regret with Efficient Communication ICLR 2020 From Chaos to Order: Symmetry and Conservation Laws in Game Dynamics ICML 2020 Geometric Exploration for Online Control NeurIPS 2020 Improper Learning for Non-Stochastic Control COLT 2020 Knowing The What But Not The Where in Bayesian Optimization ICML 2020 Meta-learning with Stochastic Linear Bandits ICML 2020 Model-Based Reinforcement Learning with Value-Targeted Regression ICML 2020 Near-optimal Regret Bounds for Stochastic Shortest Path ICML 2020 No-Regret Exploration in Goal-Oriented Reinforcement Learning ICML 2020 Online Agnostic Boosting via Regret Minimization NeurIPS 2020 Online mirror descent and dual averaging: keeping pace in the dynamic case ICML 2020 Online Non-Convex Optimization with Imperfect Feedback NeurIPS 2020 Online Pricing with Offline Data: Phase Transition and Inverse Square Law ICML 2020 On Regret with Multiple Best Arms NeurIPS 2020 OSOM: A simultaneously optimal algorithm for multi-armed and linear contextual bandits AISTATS 2020 Revisiting Online Quantum State Learning AAAI 2020 Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimization NeurIPS 2020