Co-occurring keywords · papers mentioning both
Papers
Dueling Convex Optimization with General Preferences
ICML 2025
Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
ICML 2024
Lower Bounds and Optimal Algorithms for Smooth and Strongly Convex Decentralized Optimization Over Time-Varying Networks
NeurIPS 2021
Quartz: Randomized Dual Coordinate Ascent with Arbitrary Sampling
NeurIPS 2015
Improved Regret Guarantees for Online Smooth Convex Optimization with Bandit Feedback
AISTATS 2011