{"total":92,"rows":[{"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":"2203.00444","title":"Parameter-free Mirror Descent","created":"2022-02-26","cited_by_count":45,"area":null},{"id":"2104.11824","title":"Optimal Dynamic Regret in Exp-Concave Online Learning","created":"2021-04-23","cited_by_count":40,"area":null},{"id":"2106.05135","title":"Regret and Cumulative Constraint Violation Analysis for Online Convex Optimization with Long Term Constraints","created":"2021-06-09","cited_by_count":39,"area":null},{"id":"2102.03758","title":"Non-stationary Online Learning with Memory and Non-stochastic Control","created":"2021-02-07","cited_by_count":33,"area":null},{"id":"2102.06933","title":"Revisiting Smoothed Online Learning","created":"2021-02-13","cited_by_count":29,"area":null},{"id":"2201.08905","title":"Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyond","created":"2022-01-21","cited_by_count":28,"area":null},{"id":"2207.02121","title":"Adapting to Online Label Shift with Provable Guarantees","created":"2022-07-05","cited_by_count":26,"area":null},{"id":"2202.09312","title":"Learning Predictions for Algorithms with Predictions","created":"2022-02-18","cited_by_count":25,"area":null},{"id":"2306.04923","title":"Unconstrained Online Learning with Unbounded Losses","created":"2023-06-08","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":"2110.08984","title":"Optimistic Policy Optimization is Provably Efficient in Non-stationary MDPs","created":"2021-10-18","cited_by_count":16,"area":null},{"id":"2502.12920","title":"Lightweight Online Adaption for Time Series Foundation Model Forecasts","created":"2025-02-18","cited_by_count":16,"area":null},{"id":"2108.07356","title":"Stochastic Optimization under Distributional Drift","created":"2021-08-16","cited_by_count":15,"area":null},{"id":"2207.02829","title":"Online Bilevel Optimization: Regret Analysis of Online Alternating Gradient Methods","created":"2022-07-06","cited_by_count":15,"area":null},{"id":"2302.02552","title":"Adapting to Continuous Covariate Shift via Online Density Ratio Estimation","created":"2023-02-06","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":"2301.11241","title":"On the Convergence of No-Regret Learning Dynamics in Time-Varying Games","created":"2023-01-26","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":"2208.12483","title":"Dynamic Regret of Online Markov Decision Processes","created":"2022-08-26","cited_by_count":13,"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":"2402.08672","title":"Model Assessment and Selection under Temporal Distribution Shift","created":"2024-02-13","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.19570","title":"Online Label Shift: Optimal Dynamic Regret meets Practical Algorithms","created":"2023-05-31","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":"2106.12097","title":"Regret-optimal Estimation and Control","created":"2021-06-22","cited_by_count":10,"area":null},{"id":"2211.12578","title":"Online Federated Learning via Non-Stationary Detection and Adaptation amidst Concept Drift","created":"2022-11-22","cited_by_count":10,"area":null},{"id":"2310.18304","title":"A Stability Principle for Learning under Non-Stationarity","created":"2023-10-27","cited_by_count":10,"area":null},{"id":"2101.09438","title":"An Optimal Reduction of TV-Denoising to Adaptive Online Learning","created":"2021-01-23","cited_by_count":9,"area":null},{"id":"2102.05018","title":"Robust Bandit Learning with Imperfect Context","created":"2021-02-09","cited_by_count":8,"area":null},{"id":"2106.06526","title":"Online Continual Adaptation with Active Self-Training","created":"2021-06-11","cited_by_count":8,"area":null},{"id":"2307.02295","title":"Meta-Learning Adversarial Bandit Algorithms","created":"2023-07-05","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":"2210.00997","title":"Online Self-Concordant and Relatively Smooth Minimization, With Applications to Online Portfolio Selection and Learning Quantum States","created":"2022-10-03","cited_by_count":7,"area":null},{"id":"2303.15634","title":"Learning Rate Schedules in the Presence of Distribution Shift","created":"2023-03-27","cited_by_count":7,"area":null},{"id":"2105.13383","title":"An Online Learning Approach to Optimizing Time-Varying Costs of AoI","created":"2021-05-27","cited_by_count":6,"area":null},{"id":"2205.00446","title":"Adaptive Composite Online Optimization: Predictions in Static and Dynamic Environments","created":"2022-05-01","cited_by_count":6,"area":null},{"id":"2205.00741","title":"Smoothed Online Convex Optimization Based on Discounted-Normal-Predictor","created":"2022-05-02","cited_by_count":6,"area":null},{"id":"2206.09257","title":"Optimal Dynamic Regret in LQR Control","created":"2022-06-18","cited_by_count":6,"area":null},{"id":"2302.08652","title":"Minimizing Dynamic Regret on Geodesic Metric Spaces","created":"2023-02-17","cited_by_count":6,"area":null},{"id":"2309.04339","title":"Online Submodular Maximization via Online Convex Optimization","created":"2023-09-08","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":"2408.02208","title":"Multi-level Traffic-Responsive Tilt Camera Surveillance through Predictive Correlated Online Learning","created":"2024-08-05","cited_by_count":6,"area":null},{"id":"2501.13358","title":"Learning to Bid in Non-Stationary Repeated First-Price Auctions","created":"2025-01-23","cited_by_count":5,"area":null},{"id":"2505.22899","title":"On the Dynamic Regret of Following the Regularized Leader: Optimism with History Pruning","created":"2025-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":"2302.12320","title":"Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problems","created":"2023-02-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":"2310.11880","title":"Online Convex Optimization with Switching Cost and Delayed Gradients","created":"2023-10-18","cited_by_count":3,"area":null},{"id":"2105.04005","title":"Delay-Tolerant Constrained OCO with Application to Network Resource Allocation","created":"2021-05-09","cited_by_count":2,"area":null},{"id":"2202.12843","title":"Dynamic Regret of Online Mirror Descent for Relatively Smooth Convex Cost Functions","created":"2022-02-25","cited_by_count":2,"area":null},{"id":"2205.04860","title":"Universal Caching","created":"2022-05-10","cited_by_count":2,"area":null},{"id":"2412.10703","title":"Doubly-Bounded Queue for Constrained Online Learning: Keeping Pace with Dynamics of Both Loss and Constraint","created":"2024-12-14","cited_by_count":2,"area":null},{"id":"2502.15345","title":"Efficiently Solving Discounted MDPs with Predictions on Transition Matrices","created":"2025-02-21","cited_by_count":2,"area":null},{"id":"2505.15803","title":"Adaptive Estimation and Learning under Temporal Distribution Shift","created":"2025-05-21","cited_by_count":2,"area":null},{"id":"2606.03831","title":"Online Learning with Gradient-Variation Interval Regret","created":"2026-06-02","cited_by_count":2,"area":null},{"id":"2606.07890","title":"Partially Performative Prediction","created":"2026-06-05","cited_by_count":2,"area":null},{"id":"2105.13271","title":"OpReg-Boost: Learning to Accelerate Online Algorithms with Operator Regression","created":"2021-05-27","cited_by_count":1,"area":null},{"id":"2112.12134","title":"A Unified Analysis Method for Online Optimization in Normed Vector Space","created":"2021-12-22","cited_by_count":1,"area":null},{"id":"2203.12948","title":"Personalized incentives as feedback design in generalized Nash equilibrium problems","created":"2022-03-24","cited_by_count":1,"area":null},{"id":"2204.04722","title":"Regret Analysis of Online Gradient Descent-based Iterative Learning Control with Model Mismatch","created":"2022-04-10","cited_by_count":1,"area":null},{"id":"2205.00473","title":"A Survey on Distributed Online Optimization and Game","created":"2022-05-01","cited_by_count":1,"area":null},{"id":"2205.14232","title":"Competitive Gradient Optimization","created":"2022-05-27","cited_by_count":1,"area":null},{"id":"2302.04182","title":"Online Resource Allocation: Bandits feedback and Advice on Time-varying Demands","created":"2023-02-08","cited_by_count":1,"area":null},{"id":"2308.03142","title":"Self-Directed Linear Classification","created":"2023-08-06","cited_by_count":1,"area":null},{"id":"2308.10101","title":"An Online Multiple Kernel Parallelizable Learning Scheme","created":"2023-08-19","cited_by_count":1,"area":null},{"id":"2405.11397","title":"Preparing for Black Swans: The Antifragility Imperative for Machine Learning","created":"2024-05-18","cited_by_count":1,"area":null},{"id":"2503.23600","title":"Online Convex Optimization and Integral Quadratic Constraints: An automated approach to regret analysis","created":"2025-03-30","cited_by_count":1,"area":null},{"id":"2505.00398","title":"Safety in the Face of Adversity: Achieving Zero Constraint Violation in Online Learning with Slowly Changing Constraints","created":"2025-05-01","cited_by_count":1,"area":null},{"id":"2505.22997","title":"Deep Copula Classifier: Theory, Consistency, and Empirical Evaluation","created":"2025-05-29","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":"2602.06457","title":"Achieving Better Local Regret Bound for Online Non-Convex Bilevel Optimization","created":"2026-02-06","cited_by_count":1,"area":null},{"id":"2607.20316","title":"Decentralized Online Riemannian Optimization for Strongly Geodesically Convex Functions","created":"2026-07-22","cited_by_count":1,"area":null},{"id":"2609.20968","title":"From Switching to Dynamic Regret: A Simple Reduction via Unbiased Random Sequences","created":"2026-09-17","cited_by_count":1,"area":null},{"id":"2102.09111","title":"Online Optimization and Ambiguity-based Learning of Distributionally Uncertain Dynamic Systems","created":"2021-02-18","cited_by_count":0,"area":null},{"id":"2203.14520","title":"Optimistic Online Convex Optimization in Dynamic Environments","created":"2022-03-28","cited_by_count":0,"area":null},{"id":"2302.00997","title":"Constrained Online Two-stage Stochastic Optimization: Near Optimal Algorithms via Adversarial Learning","created":"2023-02-02","cited_by_count":0,"area":null},{"id":"2302.06066","title":"Universal Online Optimization in Dynamic Environments via Uniclass Prediction","created":"2023-02-13","cited_by_count":0,"area":null},{"id":"2302.10411","title":"Regret Analysis of Online LQR Control via Trajectory Prediction and Tracking: Extended Version","created":"2023-02-21","cited_by_count":0,"area":null},{"id":"2303.15652","title":"Structured Dynamic Pricing: Optimal Regret in a Global Shrinkage Model","created":"2023-03-28","cited_by_count":0,"area":null},{"id":"2312.06957","title":"Online Saddle Point Problem and Online Convex-Concave Optimization","created":"2023-12-12","cited_by_count":0,"area":null},{"id":"2405.06902","title":"Causal Inference from Slowly Varying Nonstationary Processes","created":"2024-05-11","cited_by_count":0,"area":null},{"id":"2410.23574","title":"Online Convex Optimization with Memory and Limited Predictions","created":"2024-10-31","cited_by_count":0,"area":null},{"id":"2411.03925","title":"Quantum Algorithm for Sparse Online Learning with Truncated Gradient Descent","created":"2024-11-06","cited_by_count":0,"area":null},{"id":"2506.15817","title":"Optimizing Bidding Strategies in First-Price Auctions in Binary Feedback Setting with Predictions","created":"2025-06-18","cited_by_count":0,"area":null},{"id":"2601.19867","title":"Bandits in Flux: Adversarial Constraints in Dynamic Environments","created":"2026-01-27","cited_by_count":0,"area":null},{"id":"2602.11406","title":"The Cost of Learning Under Multiple Change Points","created":"2026-02-11","cited_by_count":0,"area":null},{"id":"2606.01325","title":"SEArch: Optimistic Policy Selection Between Scene Noise and Drift for UAV Radar Search","created":"2026-05-31","cited_by_count":0,"area":null},{"id":"2606.02663","title":"AdaWeather: Adaptively Mixing Probabilistic Weather Forecasts with Logarithmic Regret","created":"2026-06-01","cited_by_count":0,"area":null},{"id":"2606.17489","title":"Online LLM Selection via Constrained Bandits with Time-Varying Demand","created":"2026-06-16","cited_by_count":0,"area":null},{"id":"2606.29092","title":"Priced Motion Through Optimal Faces: A Normal-Fan Geometry for Non-Stationary Adversarial MDPs","created":"2026-06-27","cited_by_count":0,"area":null},{"id":"2608.09565","title":"Distributed Optimization with Streaming Data: A Temporal Weighting Perspective","created":"2026-08-10","cited_by_count":0,"area":null}],"next_cursor":null}