{"total":25,"rows":[{"id":"2111.05818","title":"Efficient Projection-Free Online Convex Optimization with Membership Oracle","created":"2021-11-10","cited_by_count":30,"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":"2305.11726","title":"Non-stationary Projection-free Online Learning with Dynamic and Adaptive Regret Guarantees","created":"2023-05-19","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":"2206.06900","title":"Grad-GradaGrad? A Non-Monotone Adaptive Stochastic Gradient Method","created":"2022-06-14","cited_by_count":9,"area":null},{"id":"2301.10090","title":"Adaptive Probabilistic Forecasting of Electricity (Net-)Load","created":"2023-01-24","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":"2206.02656","title":"A Regret-Variance Trade-Off in Online Learning","created":"2022-06-06","cited_by_count":7,"area":null},{"id":"2303.03272","title":"Accelerated Rates between Stochastic and Adversarial Online Convex Optimization","created":"2023-03-06","cited_by_count":7,"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":"2102.07521","title":"Distributed Online Learning for Joint Regret with Communication Constraints","created":"2021-02-15","cited_by_count":5,"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":"2405.14273","title":"Exact Solution to Data-Driven Inverse Optimization of MILPs in Finite Time via Gradient-Based Methods","created":"2024-05-23","cited_by_count":4,"area":null},{"id":"2305.12131","title":"Non-stationary Delayed Online Convex Optimization: From Full-information to Bandit Setting","created":"2023-05-20","cited_by_count":3,"area":null},{"id":"2306.17151","title":"Local Risk Bounds for Statistical Aggregation","created":"2023-06-29","cited_by_count":3,"area":null},{"id":"2512.05271","title":"Robust forecast aggregation via additional queries","created":"2025-12-04","cited_by_count":3,"area":null},{"id":"2607.22263","title":"Explicit Iteration Complexity of Exact Data-Driven Inverse Optimization for Integer Linear Programs","created":"2026-07-24","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":"2402.12868","title":"Fast Rates in Stochastic Online Convex Optimization by Exploiting the Curvature of Feasible Sets","created":"2024-02-20","cited_by_count":1,"area":null},{"id":"2406.14059","title":"Tracking solutions of time-varying variational inequalities","created":"2024-06-20","cited_by_count":1,"area":null},{"id":"2506.02980","title":"Non-stationary Bandit Convex Optimization: A Comprehensive Study","created":"2025-06-03","cited_by_count":1,"area":null},{"id":"2402.05145","title":"Online Learning Approach for Survival Analysis","created":"2024-02-07","cited_by_count":0,"area":null},{"id":"2408.14073","title":"Score-based change point detection via tracking the best of infinitely many experts","created":"2024-08-26","cited_by_count":0,"area":null},{"id":"2505.21095","title":"Improved Impossible Tuning and Lipschitz-Adaptive Universal Online Learning with Gradient Variations","created":"2025-05-27","cited_by_count":0,"area":null},{"id":"2605.21263","title":"Nonparametric Learning and Earning with One-Point Feedback under Nonstationarity","created":"2026-05-20","cited_by_count":0,"area":null}],"next_cursor":null}