{"total":381,"rows":[{"id":"2110.11216","title":"User-friendly introduction to PAC-Bayes bounds","created":"2021-10-21","cited_by_count":239,"area":null},{"id":"2405.15682","title":"The Road Less Scheduled","created":"2024-05-24","cited_by_count":163,"area":null},{"id":"2301.07733","title":"Learning-Rate-Free Learning by D-Adaptation","created":"2023-01-18","cited_by_count":113,"area":null},{"id":"2203.15046","title":"AUC Maximization in the Era of Big Data and AI: A Survey","created":"2022-03-28","cited_by_count":100,"area":null},{"id":"2108.06325","title":"Continual Backprop: Stochastic Gradient Descent with Persistent Randomness","created":"2021-08-13","cited_by_count":80,"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":"2112.14368","title":"Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimization","created":"2021-12-29","cited_by_count":66,"area":null},{"id":"2404.07544","title":"From Words to Numbers: Your Large Language Model Is Secretly A Capable Regressor When Given In-Context Examples","created":"2024-04-11","cited_by_count":57,"area":null},{"id":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50,"area":null},{"id":"2203.00444","title":"Parameter-free Mirror Descent","created":"2022-02-26","cited_by_count":45,"area":null},{"id":"2302.03775","title":"Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion","created":"2023-02-07","cited_by_count":45,"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":"2302.13406","title":"GNNDelete: A General Strategy for Unlearning in Graph Neural Networks","created":"2023-02-26","cited_by_count":43,"area":null},{"id":"2107.08285","title":"Greedification Operators for Policy Optimization: Investigating Forward and Reverse KL Divergences","created":"2021-07-17","cited_by_count":41,"area":null},{"id":"2310.18955","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2023-10-29","cited_by_count":34,"area":null},{"id":"2106.06885","title":"Online Learning with Optimism and Delay","created":"2021-06-13","cited_by_count":33,"area":null},{"id":"2301.13139","title":"A Novel Framework for Policy Mirror Descent with General Parameterization and Linear Convergence","created":"2023-01-30","cited_by_count":30,"area":null},{"id":"2302.06606","title":"Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation","created":"2023-02-13","cited_by_count":30,"area":null},{"id":"2102.06924","title":"Online Apprenticeship Learning","created":"2021-02-13","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.04985","title":"Generalization Bounds via Convex Analysis","created":"2022-02-10","cited_by_count":27,"area":null},{"id":"2402.01567","title":"Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise","created":"2024-02-02","cited_by_count":26,"area":null},{"id":"2306.04923","title":"Unconstrained Online Learning with Unbounded Losses","created":"2023-06-08","cited_by_count":25,"area":null},{"id":"2305.07583","title":"MoMo: Momentum Models for Adaptive Learning Rates","created":"2023-05-12","cited_by_count":24,"area":null},{"id":"2206.14906","title":"A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback","created":"2022-06-29","cited_by_count":23,"area":null},{"id":"2110.15412","title":"Stochastic Mirror Descent: Convergence Analysis and Adaptive Variants via the Mirror Stochastic Polyak Stepsize","created":"2021-10-28","cited_by_count":22,"area":null},{"id":"2302.04552","title":"Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization","created":"2023-02-09","cited_by_count":22,"area":null},{"id":"2406.15244","title":"AdaGrad under Anisotropic Smoothness","created":"2024-06-21","cited_by_count":22,"area":null},{"id":"2506.02285","title":"Why Gradients Rapidly Increase Near the End of Training","created":"2025-06-02","cited_by_count":22,"area":null},{"id":"2202.07554","title":"Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness","created":"2022-02-15","cited_by_count":21,"area":null},{"id":"2209.09298","title":"Stability and Generalization Analysis of Gradient Methods for Shallow Neural Networks","created":"2022-09-19","cited_by_count":21,"area":null},{"id":"2111.11309","title":"No-Regret Dynamics in the Fenchel Game: A Unified Framework for Algorithmic Convex Optimization","created":"2021-11-22","cited_by_count":20,"area":null},{"id":"2111.12050","title":"Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning","created":"2021-11-23","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":"2405.09831","title":"Nearly Minimax Optimal Regret for Multinomial Logistic Bandit","created":"2024-05-16","cited_by_count":20,"area":null},{"id":"2212.13556","title":"Limitations of Information-Theoretic Generalization Bounds for Gradient Descent Methods in Stochastic Convex Optimization","created":"2022-12-27","cited_by_count":19,"area":null},{"id":"2405.09742","title":"Random Scaling and Momentum for Non-smooth Non-convex Optimization","created":"2024-05-16","cited_by_count":19,"area":null},{"id":"2202.05100","title":"Adaptively Exploiting d-Separators with Causal Bandits","created":"2022-02-10","cited_by_count":18,"area":null},{"id":"2202.12328","title":"Cutting Some Slack for SGD with Adaptive Polyak Stepsizes","created":"2022-02-24","cited_by_count":18,"area":null},{"id":"2206.00557","title":"A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs","created":"2022-06-01","cited_by_count":17,"area":null},{"id":"2212.13669","title":"Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond","created":"2022-12-28","cited_by_count":17,"area":null},{"id":"2402.13903","title":"Dealing with unbounded gradients in stochastic saddle-point optimization","created":"2024-02-21","cited_by_count":16,"area":null},{"id":"2406.04592","title":"Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization","created":"2024-06-07","cited_by_count":16,"area":null},{"id":"2507.11847","title":"Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update","created":"2025-07-16","cited_by_count":16,"area":null},{"id":"2305.08629","title":"A Unified Analysis of Nonstochastic Delayed Feedback for Combinatorial Semi-Bandits, Linear Bandits, and MDPs","created":"2023-05-15","cited_by_count":15,"area":null},{"id":"2305.17301","title":"Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds","created":"2023-05-26","cited_by_count":15,"area":null},{"id":"2309.08911","title":"Efficient Methods for Non-stationary Online Learning","created":"2023-09-16","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.07567","title":"Learning Accurate Decision Trees with Bandit Feedback via Quantized Gradient Descent","created":"2021-02-15","cited_by_count":14,"area":null},{"id":"2105.14260","title":"Understanding Bandits with Graph Feedback","created":"2021-05-29","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":"2102.07666","title":"A closer look at temporal variability in dynamic online learning","created":"2021-02-15","cited_by_count":13,"area":null},{"id":"2110.15590","title":"Adaptive Importance Sampling meets Mirror Descent: a Bias-variance tradeoff","created":"2021-10-29","cited_by_count":13,"area":null},{"id":"2112.10935","title":"Nearly Optimal Policy Optimization with Stable at Any Time Guarantee","created":"2021-12-21","cited_by_count":13,"area":null},{"id":"2302.05829","title":"Tighter PAC-Bayes Bounds Through Coin-Betting","created":"2023-02-12","cited_by_count":13,"area":null},{"id":"2405.19374","title":"Optimal Multiclass U-Calibration Error and Beyond","created":"2024-05-28","cited_by_count":13,"area":null},{"id":"2106.04700","title":"Scale Free Adversarial Multi Armed Bandits","created":"2021-06-08","cited_by_count":12,"area":null},{"id":"2111.01479","title":"Dealing With Misspecification In Fixed-Confidence Linear Top-m Identification","created":"2021-11-02","cited_by_count":12,"area":null},{"id":"2402.02720","title":"Discounted Adaptive Online Learning: Towards Better Regularization","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":"2305.13946","title":"Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness","created":"2023-05-23","cited_by_count":11,"area":null},{"id":"2305.19570","title":"Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms","created":"2023-05-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":"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":"2408.09074","title":"Gradient-Variation Online Learning under Generalized Smoothness","created":"2024-08-17","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":"2411.01803","title":"Gradient Methods with Online Scaling","created":"2024-11-04","cited_by_count":11,"area":null},{"id":"2412.08060","title":"An Optimistic Algorithm for Online Convex Optimization with Adversarial Constraints","created":"2024-12-11","cited_by_count":11,"area":null},{"id":"2102.07002","title":"On the Last Iterate Convergence of Momentum Methods","created":"2021-02-13","cited_by_count":10,"area":null},{"id":"2206.01880","title":"Learning in Congestion Games with Bandit Feedback","created":"2022-06-04","cited_by_count":10,"area":null},{"id":"2208.06414","title":"Optimistic No-regret Algorithms for Discrete Caching","created":"2022-08-15","cited_by_count":10,"area":null},{"id":"2305.07730","title":"Learning in Inverse Optimization: Incenter Cost, Augmented Suboptimality Loss, and Algorithms","created":"2023-05-12","cited_by_count":10,"area":null},{"id":"2311.04402","title":"Likelihood Ratio Confidence Sets for Sequential Decision Making","created":"2023-11-08","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":"2503.24340","title":"Faster Rates for No-Regret Learning in General Games via Cautious Optimism","created":"2025-03-31","cited_by_count":10,"area":null},{"id":"2202.11133","title":"Continual Auxiliary Task Learning","created":"2022-02-22","cited_by_count":9,"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":"2303.06396","title":"No-regret Algorithms for Fair Resource Allocation","created":"2023-03-11","cited_by_count":9,"area":null},{"id":"2304.14326","title":"A Best-of-Both-Worlds Algorithm for Constrained MDPs with Long-Term Constraints","created":"2023-04-27","cited_by_count":9,"area":null},{"id":"2307.08360","title":"Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach","created":"2023-07-17","cited_by_count":9,"area":null},{"id":"2402.19437","title":"Differentially Private Worst-group Risk Minimization","created":"2024-02-29","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":"2406.12600","title":"Generalization bounds for mixing processes via delayed online-to-PAC conversions","created":"2024-06-18","cited_by_count":9,"area":null},{"id":"2501.14349","title":"Online Inverse Linear Optimization: Efficient Logarithmic-Regret Algorithm, Robustness to Suboptimality, and Lower Bound","created":"2025-01-24","cited_by_count":9,"area":null},{"id":"2105.04816","title":"Spectral risk-based learning using unbounded losses","created":"2021-05-11","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":"2205.09589","title":"Learning Energy Networks with Generalized Fenchel-Young Losses","created":"2022-05-19","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":"2305.15383","title":"On the Minimax Regret for Online Learning with Feedback Graphs","created":"2023-05-24","cited_by_count":8,"area":null},{"id":"2307.14528","title":"Function Value Learning: Adaptive Learning Rates Based on the Polyak Stepsize and Function Splitting in ERM","created":"2023-07-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":"2402.03077","title":"Markov Persuasion Processes: Learning to Persuade from Scratch","created":"2024-02-05","cited_by_count":8,"area":null},{"id":"2406.02016","title":"Adaptive and Optimal Second-order Optimistic Methods for Minimax Optimization","created":"2024-06-04","cited_by_count":8,"area":null},{"id":"2406.17830","title":"Treatment of Statistical Estimation Problems in Randomized Smoothing for Adversarial Robustness","created":"2024-06-25","cited_by_count":8,"area":null},{"id":"2406.19579","title":"Private Zeroth-Order Nonsmooth Nonconvex Optimization","created":"2024-06-27","cited_by_count":8,"area":null}],"next_cursor":"100"}