conftrace_

adaptive algorithm

114 papers

Explore in graph

Co-occurring keywords

online learning (1777) regret bound (1926) stochastic optimization (1060) multi-armed bandit (1098) online algorithm (445) gradient descent (1144) sample complexity (1169) convex optimization (1321) convergence rate (607) regret minimization (315)

Papers

Better Bounds on the Adaptivity Gap of Influence Maximization under Full-adoption Feedback AAAI 2021
The FAST Algorithm for Submodular Maximization ICML 2020
Adaptive Greedy versus Non-Adaptive Greedy for Influence Maximization AAAI 2020
An adaptive stochastic optimization algorithm for resource allocation ALT 2020
A General System of Differential Equations to Model First-Order Adaptive Algorithms JMLR 2020
On Regret with Multiple Best Arms NIPS 2020
Adaptive Online Estimation of Piecewise Polynomial Trends NIPS 2020
Familywise Error Rate Control by Interactive Unmasking ICML 2020
Learning What to Defer for Maximum Independent Sets ICML 2020
Locally Private Gaussian Estimation NIPS 2019
Riemannian adaptive stochastic gradient algorithms on matrix manifolds ICML 2019
UniXGrad: A Universal, Adaptive Algorithm with Optimal Guarantees for Constrained Optimization NIPS 2019
Deep Metric Learning: The Generalization Analysis and an Adaptive Algorithm IJCAI 2019
Classification with unknown class-conditional label noise on non-compact feature spaces COLT 2019
A New Perspective on Pool-Based Active Classification and False-Discovery Control NIPS 2019
On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons NIPS 2019
Lipschitz Adaptivity with Multiple Learning Rates in Online Learning COLT 2019
A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise COLT 2019
Contextual bandits with continuous actions: Smoothing, zooming, and adapting COLT 2019
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes COLT 2019
An adaptive nearest neighbor rule for classification NIPS 2019
Stochastic Submodular Maximization with Performance-Dependent Item Costs AAAI 2019
Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration NIPS 2019
Finite-Time Performance Bounds and Adaptive Learning Rate Selection for Two Time-Scale Reinforcement Learning NIPS 2019
Anytime Online-to-Batch, Optimism and Acceleration ICML 2019