{"total":23,"rows":[{"id":"2202.04690","title":"Smoothed Online Learning is as Easy as Statistical Learning","created":"2022-02-09","cited_by_count":52,"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":"2209.03997","title":"Online Low Rank Matrix Completion","created":"2022-09-08","cited_by_count":9,"area":null},{"id":"2301.11187","title":"Smoothed Online Learning for Prediction in Piecewise Affine Systems","created":"2023-01-26","cited_by_count":9,"area":null},{"id":"2308.03811","title":"Non-Convex Bilevel Optimization with Time-Varying Objective Functions","created":"2023-08-07","cited_by_count":8,"area":null},{"id":"2109.05829","title":"Zeroth-order non-convex learning via hierarchical dual averaging","created":"2021-09-13","cited_by_count":6,"area":null},{"id":"2302.05430","title":"Oracle-Efficient Smoothed Online Learning for Piecewise Continuous Decision Making","created":"2023-02-10","cited_by_count":5,"area":null},{"id":"2505.13564","title":"Online Decision-Focused Learning","created":"2025-05-19","cited_by_count":4,"area":null},{"id":"2609.33760","title":"Oracle-Efficient Online Classification with Stochastic Inputs and Adversarial Outputs","created":"2026-09-27","cited_by_count":3,"area":null},{"id":"2209.10105","title":"Distributed Online Non-convex Optimization with Composite Regret","created":"2022-09-21","cited_by_count":2,"area":null},{"id":"2505.20734","title":"Adversarial bandit optimization for approximately linear functions","created":"2025-05-27","cited_by_count":2,"area":null},{"id":"2403.05786","title":"Optimistic Safety for Online Convex Optimization with Unknown Linear Constraints","created":"2024-03-09","cited_by_count":1,"area":null},{"id":"2508.16992","title":"Online Learning for Approximately-Convex Functions with Long-term Adversarial Constraints","created":"2025-08-23","cited_by_count":1,"area":null},{"id":"2603.26066","title":"Adversarial Bandit Optimization with Globally Bounded Perturbations to Linear Losses","created":"2026-03-27","cited_by_count":1,"area":null},{"id":"2604.28186","title":"Computing Equilibrium beyond Unilateral Deviation","created":"2026-04-30","cited_by_count":1,"area":null},{"id":"2206.05576","title":"Optimal Solutions for Joint Beamforming and Antenna Selection: From Branch and Bound to Graph Neural Imitation Learning","created":"2022-06-11","cited_by_count":0,"area":null},{"id":"2301.07530","title":"Online (Non-)Convex Learning via Tempered Optimism","created":"2023-01-18","cited_by_count":0,"area":null},{"id":"2310.05179","title":"DRL-ORA: Distributional Reinforcement Learning with Online Risk Adaption","created":"2023-10-08","cited_by_count":0,"area":null},{"id":"2311.02426","title":"Online Non-convex Optimization with Long-term Non-convex Constraints","created":"2023-11-04","cited_by_count":0,"area":null},{"id":"2506.14911","title":"Event-Driven Online Vertical Federated Learning","created":"2025-06-17","cited_by_count":0,"area":null},{"id":"2510.03845","title":"The Hidden Game Problem","created":"2025-10-04","cited_by_count":0,"area":null},{"id":"2605.26373","title":"Online Learning on Hidden-Convex Losses via Algorithmic Equivalence: Optimal Regret, Geometric Barrier, and Bandit Feedback","created":"2026-05-25","cited_by_count":0,"area":null},{"id":"2606.02948","title":"From Non-Convex to Strongly Convex: Curvature-Adaptive FTPL for Online Optimization","created":"2026-06-01","cited_by_count":0,"area":null}],"next_cursor":null}