Co-occurring keywords · papers mentioning both
Papers
A Single Stepsize Suffices for Unprojected Linear TD(0): Simultaneous Robust and Fast Rates via Polyak–Ruppert Averaging
COLT 2026
Variance Reduction and Low Sample Complexity in Stochastic Optimization via Proximal Point Method
ALT 2026
Statistical Significance of Feature Importance Rankings
UAI 2025
Accelerated Parameter-Free Stochastic Optimization
COLT 2024
High Probability and Risk-Averse Guarantees for a Stochastic Accelerated Primal-Dual Method
JMLR 2024
High-probability complexity bounds for stochastic non-convex minimax optimization
NeurIPS 2024
Making SGD Parameter-Free
COLT 2022
Stochastic linear optimization never overfits with quadratically-bounded losses on general data
COLT 2022
Stochastic optimization under time drift: iterate averaging, step-decay schedules, and high probability guarantees
NeurIPS 2021
High probability guarantees for stochastic convex optimization
COLT 2020
Online learning over a finite action set with limited switching
COLT 2018
Explore no more: Improved high-probability regret bounds for non-stochastic bandits
NeurIPS 2015