{"total":32,"rows":[{"id":"2102.06622","title":"MetaGrad: Adaptation using Multiple Learning Rates in Online Learning","created":"2021-02-12","cited_by_count":26,"area":null},{"id":"2102.05320","title":"An Adaptive Stochastic Sequential Quadratic Programming with Differentiable Exact Augmented Lagrangians","created":"2021-02-10","cited_by_count":25,"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":"2109.11502","title":"Inequality Constrained Stochastic Nonlinear Optimization via Active-Set Sequential Quadratic Programming","created":"2021-09-23","cited_by_count":17,"area":null},{"id":"2302.03764","title":"Sketchy: Memory-efficient Adaptive Regularization with Frequent Directions","created":"2023-02-07","cited_by_count":17,"area":null},{"id":"2204.09266","title":"Hessian Averaging in Stochastic Newton Methods Achieves Superlinear Convergence","created":"2022-04-20","cited_by_count":14,"area":null},{"id":"2211.01357","title":"Quasi-Newton Steps for Efficient Online Exp-Concave Optimization","created":"2022-11-02","cited_by_count":10,"area":null},{"id":"2302.04859","title":"Projection-free Online Exp-concave Optimization","created":"2023-02-09","cited_by_count":10,"area":null},{"id":"2405.19175","title":"Online Linear Regression in Dynamic Environments via Discounting","created":"2024-05-29","cited_by_count":10,"area":null},{"id":"2407.02772","title":"Gradient descent with generalized Newton's method","created":"2024-07-03","cited_by_count":9,"area":null},{"id":"2305.19036","title":"Delayed Bandits: When Do Intermediate Observations Help?","created":"2023-05-30","cited_by_count":8,"area":null},{"id":"2205.01921","title":"Second Order Path Variationals in Non-Stationary Online Learning","created":"2022-05-04","cited_by_count":7,"area":null},{"id":"2202.03070","title":"Addressing modern and practical challenges in machine learning: A survey of online federated and transfer learning","created":"2022-02-07","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":"2603.20826","title":"Simple Projection-Free Algorithm for Contextual Recommendation with Logarithmic Regret and Robustness","created":"2026-03-21","cited_by_count":6,"area":null},{"id":"2305.18379","title":"Constrained Optimization via Exact Augmented Lagrangian and Randomized Iterative Sketching","created":"2023-05-28","cited_by_count":5,"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":"2410.10258","title":"Revisiting Matrix Sketching in Linear Bandits: Achieving Sublinear Regret via Dyadic Block Sketching","created":"2024-10-14","cited_by_count":4,"area":null},{"id":"2305.13082","title":"Sketch-and-Project Meets Newton Method: Global $\\mathcal O(k^{-2})$ Convergence with Low-Rank Updates","created":"2023-05-22","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":"2512.23190","title":"A Simple, Optimal and Efficient Algorithm for Online Exp-Concave Optimization","created":"2025-12-29","cited_by_count":3,"area":null},{"id":"2211.05727","title":"A Randomised Subspace Gauss-Newton Method for Nonlinear Least-Squares","created":"2022-11-10","cited_by_count":2,"area":null},{"id":"2507.06125","title":"Subspace-based Approximate Hessian Method for Zeroth-Order Optimization","created":"2025-07-08","cited_by_count":2,"area":null},{"id":"2109.11703","title":"An Improved Frequent Directions Algorithm for Low-Rank Approximation via Block Krylov Iteration","created":"2021-09-24","cited_by_count":1,"area":null},{"id":"2104.12949","title":"Discriminative Bayesian filtering lends momentum to the stochastic Newton method for minimizing log-convex functions","created":"2021-04-27","cited_by_count":0,"area":null},{"id":"2306.08320","title":"Nearly Optimal Algorithms with Sublinear Computational Complexity for Online Kernel Regression","created":"2023-06-14","cited_by_count":0,"area":null},{"id":"2311.10085","title":"A Computationally Efficient Sparsified Online Newton Method","created":"2023-11-16","cited_by_count":0,"area":null},{"id":"2410.11188","title":"Fast Second-Order Online Kernel Learning through Incremental Matrix Sketching and Decomposition","created":"2024-10-15","cited_by_count":0,"area":null},{"id":"2505.18327","title":"Online Statistical Inference of Constrained Stochastic Optimization via Random Scaling","created":"2025-05-23","cited_by_count":0,"area":null},{"id":"2510.27177","title":"A Polynomial-time Algorithm for Online Sparse Linear Regression with Improved Regret Bound under Weaker Conditions","created":"2025-10-31","cited_by_count":0,"area":null},{"id":"2606.11968","title":"Efficient Multinomial Logistic Bandit via Frequent Directions","created":"2026-06-10","cited_by_count":0,"area":null},{"id":"2606.17805","title":"QueryMarket: Cost-Aware Online Active Learning in Data Markets","created":"2026-06-16","cited_by_count":0,"area":null}],"next_cursor":null}