{"total":130,"rows":[{"id":"2302.12022","title":"DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedule","created":"2023-02-08","cited_by_count":85,"area":null},{"id":"2302.07869","title":"Improved Online Conformal Prediction via Strongly Adaptive Online Learning","created":"2023-02-15","cited_by_count":78,"area":null},{"id":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50,"area":null},{"id":"2110.14099","title":"Tight Concentrations and Confidence Sequences from the Regret of Universal Portfolio","created":"2021-10-27","cited_by_count":43,"area":null},{"id":"2310.07831","title":"Optimal Linear Decay Learning Rate Schedules and Further Refinements","created":"2023-10-11","cited_by_count":43,"area":null},{"id":"2305.16284","title":"DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method","created":"2023-05-25","cited_by_count":35,"area":null},{"id":"2302.08783","title":"SGD with AdaGrad Stepsizes: Full Adaptivity with High Probability to Unknown Parameters, Unbounded Gradients and Affine Variance","created":"2023-02-17","cited_by_count":30,"area":null},{"id":"2311.03252","title":"Parameter-Agnostic Optimization under Relaxed Smoothness","created":"2023-11-06","cited_by_count":29,"area":null},{"id":"2210.14355","title":"Parameter-free Regret in High Probability with Heavy Tails","created":"2022-10-25","cited_by_count":28,"area":null},{"id":"2102.00236","title":"Parameter-free Stochastic Optimization of Variationally Coherent Functions","created":"2021-01-30","cited_by_count":27,"area":null},{"id":"2201.07877","title":"PDE-Based Optimal Strategy for Unconstrained Online Learning","created":"2022-01-19","cited_by_count":27,"area":null},{"id":"2202.09312","title":"Learning Predictions for Algorithms with Predictions","created":"2022-02-18","cited_by_count":25,"area":null},{"id":"2210.16913","title":"Revisiting Simple Regret: Fast Rates for Returning a Good Arm","created":"2022-10-30","cited_by_count":25,"area":null},{"id":"2305.17570","title":"Auditing Fairness by Betting","created":"2023-05-27","cited_by_count":25,"area":null},{"id":"2306.04923","title":"Unconstrained Online Learning with Unbounded Losses","created":"2023-06-08","cited_by_count":25,"area":null},{"id":"2408.07511","title":"Protected Test-Time Adaptation via Online Entropy Matching: A Betting Approach","created":"2024-08-14","cited_by_count":23,"area":null},{"id":"2303.12277","title":"Stochastic Nonsmooth Convex Optimization with Heavy-Tailed Noises: High-Probability Bound, In-Expectation Rate and Initial Distance Adaptation","created":"2023-03-22","cited_by_count":20,"area":null},{"id":"2306.00144","title":"Mechanic: A Learning Rate Tuner","created":"2023-05-31","cited_by_count":20,"area":null},{"id":"2308.05621","title":"Normalized Gradients for All","created":"2023-08-10","cited_by_count":20,"area":null},{"id":"2201.11921","title":"Adaptive Best-of-Both-Worlds Algorithm for Heavy-Tailed Multi-Armed Bandits","created":"2022-01-28","cited_by_count":18,"area":null},{"id":"2310.10082","title":"A simple uniformly optimal method without line search for convex optimization","created":"2023-10-16","cited_by_count":18,"area":null},{"id":"2102.09540","title":"Off-policy Confidence Sequences","created":"2021-02-18","cited_by_count":15,"area":null},{"id":"2108.08770","title":"Learning-to-learn non-convex piecewise-Lipschitz functions","created":"2021-08-19","cited_by_count":15,"area":null},{"id":"2102.01623","title":"Adversarial Tracking Control via Strongly Adaptive Online Learning with Memory","created":"2021-02-02","cited_by_count":14,"area":null},{"id":"2102.06593","title":"Pareto Optimal Model Selection in Linear Bandits","created":"2021-02-12","cited_by_count":14,"area":null},{"id":"2305.19674","title":"Online-to-PAC Conversions: Generalization Bounds via Regret Analysis","created":"2023-05-31","cited_by_count":14,"area":null},{"id":"2403.15146","title":"On the Convergence of Adam under Non-uniform Smoothness: Separability from SGDM and Beyond","created":"2024-03-22","cited_by_count":14,"area":null},{"id":"2302.05829","title":"Tighter PAC-Bayes Bounds Through Coin-Betting","created":"2023-02-12","cited_by_count":13,"area":null},{"id":"2402.07793","title":"Tuning-Free Stochastic Optimization","created":"2024-02-12","cited_by_count":13,"area":null},{"id":"2402.02720","title":"Discounted Adaptive Online Learning: Towards Better Regularization","created":"2024-02-05","cited_by_count":12,"area":null},{"id":"2402.03126","title":"How Free is Parameter-Free Stochastic Optimization?","created":"2024-02-05","cited_by_count":12,"area":null},{"id":"2502.00818","title":"Error-quantified Conformal Inference for Time Series","created":"2025-02-02","cited_by_count":12,"area":null},{"id":"2301.13349","title":"Unconstrained Dynamic Regret via Sparse Coding","created":"2023-01-31","cited_by_count":11,"area":null},{"id":"2305.14916","title":"Tuning-Free Maximum Likelihood Training of Latent Variable Models via Coin Betting","created":"2023-05-24","cited_by_count":11,"area":null},{"id":"2402.10898","title":"The Price of Adaptivity in Stochastic Convex Optimization","created":"2024-02-16","cited_by_count":11,"area":null},{"id":"2403.00715","title":"Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds","created":"2024-03-01","cited_by_count":11,"area":null},{"id":"2410.22318","title":"Online Detection of LLM-Generated Texts via Sequential Hypothesis Testing by Betting","created":"2024-10-29","cited_by_count":11,"area":null},{"id":"2205.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"area":null},{"id":"2405.20540","title":"Fully Unconstrained Online Learning","created":"2024-05-30","cited_by_count":10,"area":null},{"id":"2407.04358","title":"An Adaptive Stochastic Gradient Method with Non-negative Gauss-Newton Stepsizes","created":"2024-07-05","cited_by_count":10,"area":null},{"id":"2205.06846","title":"Optimal Comparator Adaptive Online Learning with Switching Cost","created":"2022-05-13","cited_by_count":9,"area":null},{"id":"2306.02527","title":"Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking","created":"2023-06-05","cited_by_count":9,"area":null},{"id":"2406.01577","title":"An Equivalence Between Static and Dynamic Regret Minimization","created":"2024-06-03","cited_by_count":9,"area":null},{"id":"2107.07322","title":"A unified framework for bandit multiple testing","created":"2021-07-15","cited_by_count":8,"area":null},{"id":"2110.14804","title":"Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers","created":"2021-10-27","cited_by_count":8,"area":null},{"id":"2203.10327","title":"Implicit Parameter-free Online Learning with Truncated Linear Models","created":"2022-03-19","cited_by_count":8,"area":null},{"id":"2204.05176","title":"Towards Painless Policy Optimization for Constrained MDPs","created":"2022-04-11","cited_by_count":8,"area":null},{"id":"2301.11294","title":"Coin Sampling: Gradient-Based Bayesian Inference without Learning Rates","created":"2023-01-26","cited_by_count":8,"area":null},{"id":"2309.16044","title":"Improving Adaptive Online Learning Using Refined Discretization","created":"2023-09-27","cited_by_count":8,"area":null},{"id":"2206.00236","title":"Continuous Prediction with Experts' Advice","created":"2022-06-01","cited_by_count":7,"area":null},{"id":"2303.04845","title":"Smoothed Analysis of Sequential Probability Assignment","created":"2023-03-08","cited_by_count":7,"area":null},{"id":"2306.11201","title":"Adaptive Federated Learning with Auto-Tuned Clients","created":"2023-06-19","cited_by_count":7,"area":null},{"id":"2205.00741","title":"Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor","created":"2022-05-02","cited_by_count":6,"area":null},{"id":"2210.09371","title":"On Accelerated Perceptrons and Beyond","created":"2022-10-17","cited_by_count":6,"area":null},{"id":"2310.14085","title":"Adaptive, Doubly Optimal No-Regret Learning in Strongly Monotone and Exp-Concave Games with Gradient Feedback","created":"2023-10-21","cited_by_count":6,"area":null},{"id":"2405.19705","title":"Universal Online Convex Optimization with $1$ Projection per Round","created":"2024-05-30","cited_by_count":6,"area":null},{"id":"2412.14291","title":"Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes","created":"2024-12-18","cited_by_count":6,"area":null},{"id":"2607.00871","title":"Self-Evolving Agents with Anytime-Valid Certificates","created":"2026-07-01","cited_by_count":6,"area":null},{"id":"2102.07521","title":"Distributed Online Learning for Joint Regret with Communication Constraints","created":"2021-02-15","cited_by_count":5,"area":null},{"id":"2210.06593","title":"Differentially Private Online-to-Batch for Smooth Losses","created":"2022-10-12","cited_by_count":5,"area":null},{"id":"2312.17369","title":"SANIA: Polyak-type Optimization Framework Leads to Scale Invariant Stochastic Algorithms","created":"2023-12-28","cited_by_count":5,"area":null},{"id":"2402.02342","title":"MetaOptimize: A Framework for Optimizing Step Sizes and Other Meta-parameters","created":"2024-02-04","cited_by_count":5,"area":null},{"id":"2502.11229","title":"Provable and Practical Online Learning Rate Adaptation with Hypergradient Descent","created":"2025-02-16","cited_by_count":5,"area":null},{"id":"2504.01898","title":"Analysis of an Idealized Stochastic Polyak Method and its Application to Black-Box Model Distillation","created":"2025-04-02","cited_by_count":5,"area":null},{"id":"2507.05478","title":"Dynamic Regret Reduces to Kernelized Static Regret","created":"2025-07-07","cited_by_count":5,"area":null},{"id":"2103.00284","title":"On the Initialization for Convex-Concave Min-max Problems","created":"2021-02-27","cited_by_count":4,"area":null},{"id":"2105.03681","title":"Universal Online Convex Optimization Meets Second-order Bounds","created":"2021-05-08","cited_by_count":4,"area":null},{"id":"2111.11550","title":"Dynamic Regret for Strongly Adaptive Methods and Optimality of Online KRR","created":"2021-11-22","cited_by_count":4,"area":null},{"id":"2207.08956","title":"Online Learning with Off-Policy Feedback","created":"2022-07-18","cited_by_count":4,"area":null},{"id":"2402.09201","title":"Better-than-KL PAC-Bayes Bounds","created":"2024-02-14","cited_by_count":4,"area":null},{"id":"2502.07774","title":"Optimistic Interior Point Methods for Sequential Hypothesis Testing by Betting","created":"2025-02-11","cited_by_count":4,"area":null},{"id":"2602.24207","title":"The Stability of Online Algorithms in Performative Prediction","created":"2026-02-27","cited_by_count":4,"area":null},{"id":"2106.04815","title":"ChaCha for Online AutoML","created":"2021-06-09","cited_by_count":3,"area":null},{"id":"2305.14943","title":"Learning Rate Free Sampling in Constrained Domains","created":"2023-05-24","cited_by_count":3,"area":null},{"id":"2306.00201","title":"Generalized Implicit Follow-The-Regularized-Leader","created":"2023-05-31","cited_by_count":3,"area":null},{"id":"2501.10258","title":"DADA: Dual Averaging with Distance Adaptation","created":"2025-01-17","cited_by_count":3,"area":null},{"id":"2502.04543","title":"Sparsity-Based Interpolation of External, Internal and Swap Regret","created":"2025-02-06","cited_by_count":3,"area":null},{"id":"2505.23081","title":"Gradient Methods with Online Scaling Part I. Theoretical Foundations","created":"2025-05-29","cited_by_count":3,"area":null},{"id":"2505.24399","title":"LightSAM: Parameter-Agnostic Sharpness-Aware Minimization","created":"2025-05-30","cited_by_count":3,"area":null},{"id":"2510.04685","title":"Parameter-free Algorithms for the Stochastically Extended Adversarial Model","created":"2025-10-06","cited_by_count":3,"area":null},{"id":"2207.00646","title":"On the Computational Efficiency of Adaptive and Dynamic Regret Minimization","created":"2022-07-01","cited_by_count":2,"area":null},{"id":"2305.19605","title":"Parameter-free projected gradient descent","created":"2023-05-31","cited_by_count":2,"area":null},{"id":"2410.08977","title":"Online-to-PAC generalization bounds under graph-mixing dependencies","created":"2024-10-11","cited_by_count":2,"area":null},{"id":"2502.11673","title":"Best of Both Worlds: Regret Minimization versus Minimax Play","created":"2025-02-17","cited_by_count":2,"area":null},{"id":"2510.17067","title":"Convergence of Regret Matching in Potential Games and Constrained Optimization","created":"2025-10-20","cited_by_count":2,"area":null},{"id":"2512.12325","title":"Eventually LIL Regret: Almost Sure $\\ln\\ln T$ Regret for a sub-Gaussian Mixture on Unbounded Data","created":"2025-12-13","cited_by_count":2,"area":null},{"id":"2602.06902","title":"Parameter-free Dynamic Regret: Time-varying Movement Costs, Delayed Feedback, and Memory","created":"2026-02-06","cited_by_count":2,"area":null},{"id":"2603.25916","title":"Parameter-Free Dynamic Regret for Unconstrained Linear Bandits","created":"2026-03-26","cited_by_count":2,"area":null},{"id":"2606.03831","title":"Online Learning with Gradient-Variation Interval Regret","created":"2026-06-02","cited_by_count":2,"area":null},{"id":"2609.27206","title":"Prediction with Expert Advice: Anytime Regret with Many Experts Matches the Fixed-Time Constant","created":"2026-09-23","cited_by_count":2,"area":null},{"id":"2101.12113","title":"Low Complexity Approximate Bayesian Logistic Regression for Sparse Online Learning","created":"2021-01-28","cited_by_count":1,"area":null},{"id":"2105.04129","title":"Parameter-free Gradient Temporal Difference Learning","created":"2021-05-10","cited_by_count":1,"area":null},{"id":"2401.09278","title":"Adaptive Regret for Bandits Made Possible: Two Queries Suffice","created":"2024-01-17","cited_by_count":1,"area":null},{"id":"2405.04376","title":"Towards Stability of Parameter-Free Optimization","created":"2024-05-07","cited_by_count":1,"area":null},{"id":"2406.02296","title":"Learning-Rate-Free Stochastic Optimization over Riemannian Manifolds","created":"2024-06-04","cited_by_count":1,"area":null},{"id":"2410.03363","title":"Minimax-optimal and Locally-adaptive Online Nonparametric Regression","created":"2024-10-04","cited_by_count":1,"area":null},{"id":"2505.19741","title":"Minimax Adaptive Online Nonparametric Regression over Besov Spaces","created":"2025-05-26","cited_by_count":1,"area":null},{"id":"2505.22422","title":"STaR-Bets: Sequential Target-Recalculating Bets for Tighter Confidence Intervals","created":"2025-05-28","cited_by_count":1,"area":null},{"id":"2509.08911","title":"Instance-Optimal Matrix Multiplicative Weight Update and Its Quantum Applications","created":"2025-09-10","cited_by_count":1,"area":null},{"id":"2510.15644","title":"Decentralized Parameter-Free Online Learning","created":"2025-10-17","cited_by_count":1,"area":null}],"next_cursor":"100"}