{"total":44,"rows":[{"id":"2306.06101","title":"Prodigy: An Expeditiously Adaptive Parameter-Free Learner","created":"2023-06-09","cited_by_count":133,"area":null},{"id":"2301.07733","title":"Learning-Rate-Free Learning by D-Adaptation","created":"2023-01-18","cited_by_count":113,"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":"2305.16284","title":"DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Method","created":"2023-05-25","cited_by_count":35,"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.06151","title":"Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits","created":"2022-02-12","cited_by_count":22,"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":"2308.05621","title":"Normalized Gradients for All","created":"2023-08-10","cited_by_count":20,"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":"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":"2301.13349","title":"Unconstrained Dynamic Regret via Sparse Coding","created":"2023-01-31","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":"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":"2205.06846","title":"Optimal Comparator Adaptive Online Learning with Switching Cost","created":"2022-05-13","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":"2203.10327","title":"Implicit Parameter-free Online Learning with Truncated Linear Models","created":"2022-03-19","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":"2102.07521","title":"Distributed Online Learning for Joint Regret with Communication Constraints","created":"2021-02-15","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":"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":"2502.04543","title":"Sparsity-Based Interpolation of External, Internal and Swap Regret","created":"2025-02-06","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":"2305.19605","title":"Parameter-free projected gradient descent","created":"2023-05-31","cited_by_count":2,"area":null},{"id":"2406.12366","title":"Structured Prediction in Online Learning","created":"2024-06-18","cited_by_count":2,"area":null},{"id":"2511.07604","title":"Infinite-Dimensional Operator/Block Kaczmarz Algorithms: Regret Bounds and $\\lambda$-Effectiveness","created":"2025-11-10","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":"2105.04129","title":"Parameter-free Gradient Temporal Difference Learning","created":"2021-05-10","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":"2506.11336","title":"The Sample Complexity of Parameter-Free Stochastic Convex Optimization","created":"2025-06-12","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},{"id":"2605.18999","title":"Distance-Aware Muon: Adaptive Step Scaling for Normalized Optimization","created":"2026-05-18","cited_by_count":1,"area":null},{"id":"2606.14929","title":"Policy Regret for Embedding Model Routing: Contextual Bandits with Low-Rank Experts","created":"2026-06-12","cited_by_count":1,"area":null},{"id":"2202.02406","title":"Parameter-free Online Linear Optimization with Side Information via Universal Coin Betting","created":"2022-02-04","cited_by_count":0,"area":null},{"id":"2509.21653","title":"A regret minimization approach to fixed-point iterations","created":"2025-09-25","cited_by_count":0,"area":null},{"id":"2602.06545","title":"Operationalizing Stein's Method for Online Linear Optimization: CLT-Based Optimal Tradeoffs","created":"2026-02-06","cited_by_count":0,"area":null},{"id":"2603.28201","title":"A Perturbation Approach to Unconstrained Linear Bandits","created":"2026-03-30","cited_by_count":0,"area":null},{"id":"2605.27831","title":"Decentralized Parameter-Free Online Learning with Compressed Gossip","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2606.14970","title":"Zero-order Parameter-free Optimization for LMO-based Methods: Novel Approach for Efficient Fine-tuning","created":"2026-06-12","cited_by_count":0,"area":null}],"next_cursor":null}