conftrace_

optimal algorithm

26 papers

Explore in graph

Co-occurring keywords

multi-armed bandit (1098) regret bound (1926) stochastic bandit (98) decentralized optimization (113) communication complexity (99) sample complexity (1169) convex optimization (1321) online learning (1777) stochastic optimization (1060) dueling bandit (57)

Papers

MGCBS: An Optimal and Efficient Algorithm for Solving Multi-Goal Multi-Agent Path Finding Problem IJCAI 2024
Optimal Makespan in a Minute Timespan! A Scalable Multi-Robot Goal Assignment Algorithm for Minimizing Mission Time AAAI 2024
A Novel Demand Response Model and Method for Peak Reduction in Smart Grids -- PowerTAC IJCAI 2023
Posterior Tracking Algorithm for Classification Bandits AISTATS 2023
Near-Optimal Algorithms for Gaussians with Huber Contamination: Mean Estimation and Linear Regression NIPS 2023
Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and Optimal Algorithms NIPS 2023
The First Optimal Algorithm for Smooth and Strongly-Convex-Strongly-Concave Minimax Optimization NIPS 2022
A Theory of PAC Learnability under Transformation Invariances NIPS 2022
Optimal Algorithms for Decentralized Stochastic Variational Inequalities NIPS 2022
Jointly Efficient and Optimal Algorithms for Logistic Bandits AISTATS 2022
An Optimal Algorithm for Strongly Convex Minimization under Affine Constraints AISTATS 2022
Asymptotically Optimal Information-Directed Sampling COLT 2021
Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks NIPS 2021
ImpatientCapsAndRuns: Approximately Optimal Algorithm Configuration from an Infinite Pool NIPS 2020
Optimal and Practical Algorithms for Smooth and Strongly Convex Decentralized Optimization NIPS 2020
Optimal Posted-Price Mechanism in Microtask Crowdsourcing IJCAI 2017
Anytime optimal algorithms in stochastic multi-armed bandits ICML 2016
An optimal algorithm for the Thresholding Bandit Problem ICML 2016
Copeland Dueling Bandit Problem: Regret Lower Bound, Optimal Algorithm, and Computationally Efficient Algorithm ICML 2016
Regret Lower Bound and Optimal Algorithm in Dueling Bandit Problem COLT 2015
On Top-k Selection in Multi-Armed Bandits and Hidden Bipartite Graphs NIPS 2015
Lipschitz Bandits: Regret Lower Bound and Optimal Algorithms COLT 2014
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NIPS 2013
Query Complexity of Derivative-Free Optimization NIPS 2012
Adapting to a Market Shock: Optimal Sequential Market-Making NIPS 2008