{"total":18,"rows":[{"id":"2111.12306","title":"Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability","created":"2021-11-24","cited_by_count":44,"area":null},{"id":"2302.08982","title":"(S)GD over Diagonal Linear Networks: Implicit Regularisation, Large Stepsizes and Edge of Stability","created":"2023-02-17","cited_by_count":36,"area":null},{"id":"2102.06622","title":"MetaGrad: Adaptation using Multiple Learning Rates in Online Learning","created":"2021-02-12","cited_by_count":26,"area":null},{"id":"2209.03880","title":"Learning Sparse Graphon Mean Field Games","created":"2022-09-08","cited_by_count":14,"area":null},{"id":"2202.05630","title":"Scale-free Unconstrained Online Learning for Curved Losses","created":"2022-02-11","cited_by_count":13,"area":null},{"id":"2308.07588","title":"High-Probability Risk Bounds via Sequential Predictors","created":"2023-08-15","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":"2305.19036","title":"Delayed Bandits: When Do Intermediate Observations Help?","created":"2023-05-30","cited_by_count":8,"area":null},{"id":"2403.02648","title":"Remove that Square Root: A New Efficient Scale-Invariant Version of AdaGrad","created":"2024-03-05","cited_by_count":8,"area":null},{"id":"2106.04982","title":"Cooperative Online Learning with Feedback Graphs","created":"2021-06-09","cited_by_count":4,"area":null},{"id":"2208.04065","title":"Optimistic Optimisation of Composite Objective with Exponentiated Update","created":"2022-08-08","cited_by_count":3,"area":null},{"id":"2204.11793","title":"Online Deep Learning from Doubly-Streaming Data","created":"2022-04-25","cited_by_count":2,"area":null},{"id":"2107.05328","title":"Structured Directional Pruning via Perturbation Orthogonal Projection","created":"2021-07-12","cited_by_count":1,"area":null},{"id":"2208.04579","title":"Adaptive Zeroth-Order Optimisation of Nonconvex Composite Objectives","created":"2022-08-09","cited_by_count":1,"area":null},{"id":"2211.11710","title":"Adaptive Stochastic Optimisation of Nonconvex Composite Objectives","created":"2022-11-21","cited_by_count":0,"area":null},{"id":"2510.21202","title":"Online AUC Optimization Based on Second-order Surrogate Loss","created":"2025-10-24","cited_by_count":0,"area":null},{"id":"2605.04364","title":"Online Nonstochastic Prediction: Logarithmic Regret via Predictive Online Least Squares","created":"2026-05-06","cited_by_count":0,"area":null},{"id":"2606.22326","title":"Adam Converges in Nonsmooth Nonconvex Optimization","created":"2026-06-21","cited_by_count":0,"area":null}],"next_cursor":null}