{"total":66,"rows":[{"id":"2601.07568","title":"d3LLM: Ultra-Fast Diffusion LLM using Pseudo-Trajectory Distillation","created":"2026-01-12","cited_by_count":37,"area":"inference"},{"id":"2201.12736","title":"No-Regret Learning in Time-Varying Zero-Sum Games","created":"2022-01-30","cited_by_count":36,"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.06151","title":"Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Bandits","created":"2022-02-12","cited_by_count":22,"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":"2202.07554","title":"Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness","created":"2022-02-15","cited_by_count":21,"area":null},{"id":"2507.11847","title":"Generalized Linear Bandits: Almost Optimal Regret with One-Pass Update","created":"2025-07-16","cited_by_count":16,"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":"2309.08911","title":"Efficient Methods for Non-stationary Online Learning","created":"2023-09-16","cited_by_count":15,"area":null},{"id":"2406.00345","title":"DeCoOp: Robust Prompt Tuning with Out-of-Distribution Detection","created":"2024-06-01","cited_by_count":14,"area":"mllm"},{"id":"2208.12483","title":"Dynamic Regret of Online Markov Decision Processes","created":"2022-08-26","cited_by_count":13,"area":null},{"id":"2301.13349","title":"Unconstrained Dynamic Regret via Sparse Coding","created":"2023-01-31","cited_by_count":11,"area":null},{"id":"2305.13946","title":"Data-Dependent Bounds for Online Portfolio Selection Without Lipschitzness and Smoothness","created":"2023-05-23","cited_by_count":11,"area":null},{"id":"2408.09074","title":"Gradient-Variation Online Learning under Generalized Smoothness","created":"2024-08-17","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":"2405.17061","title":"Provably Efficient Reinforcement Learning with Multinomial Logit Function Approximation","created":"2024-05-27","cited_by_count":10,"area":"deeprl"},{"id":"2405.19175","title":"Online Linear Regression in Dynamic Environments via Discounting","created":"2024-05-29","cited_by_count":10,"area":null},{"id":"2307.08360","title":"Universal Online Learning with Gradient Variations: A Multi-layer Online Ensemble Approach","created":"2023-07-17","cited_by_count":9,"area":null},{"id":"2406.01577","title":"An Equivalence Between Static and Dynamic Regret Minimization","created":"2024-06-03","cited_by_count":9,"area":null},{"id":"2406.12550","title":"Offline Imitation Learning with Model-based Reverse Augmentation","created":"2024-06-18","cited_by_count":8,"area":"offlinerl"},{"id":"2412.18256","title":"Robust Semi-Supervised Learning in Open Environments","created":"2024-12-24","cited_by_count":8,"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":"2506.10616","title":"Non-stationary Online Learning for Curved Losses: Improved Dynamic Regret via Mixability","created":"2025-06-12","cited_by_count":7,"area":null},{"id":"2403.04568","title":"Improved Algorithm for Adversarial Linear Mixture MDPs with Bandit Feedback and Unknown Transition","created":"2024-03-07","cited_by_count":6,"area":"deeprl"},{"id":"2405.19705","title":"Universal Online Convex Optimization with $1$ Projection per Round","created":"2024-05-30","cited_by_count":6,"area":null},{"id":"2411.03107","title":"Near-Optimal Dynamic Regret for Adversarial Linear Mixture MDPs","created":"2024-11-05","cited_by_count":5,"area":null},{"id":"2503.00419","title":"Heavy-Tailed Linear Bandits: Huber Regression with One-Pass Update","created":"2025-03-01","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":"2507.05478","title":"Dynamic Regret Reduces to Kernelized Static Regret","created":"2025-07-07","cited_by_count":5,"area":null},{"id":"2511.02276","title":"Gradient-Variation Online Adaptivity for Accelerated Optimization with H\\\"older Smoothness","created":"2025-11-04","cited_by_count":5,"area":null},{"id":"2601.01069","title":"Revisiting Weighted Strategy for Non-stationary Parametric Bandits and MDPs","created":"2026-01-03","cited_by_count":5,"area":null},{"id":"2602.04761","title":"Improved Dimension Dependence for Bandit Convex Optimization with Gradient Variations","created":"2026-02-04","cited_by_count":5,"area":null},{"id":"2408.02936","title":"Achieving More with Less: A Tensor-Optimization-Powered Ensemble Method","created":"2024-08-06","cited_by_count":4,"area":null},{"id":"2510.01867","title":"Universal Dynamic Regret and Constraint Violation Bounds for Constrained Online Convex Optimization","created":"2025-10-02","cited_by_count":4,"area":null},{"id":"2602.08372","title":"Dynamic Regret via Discounted-to-Dynamic Reduction with Applications to Curved Losses and Adam Optimizer","created":"2026-02-09","cited_by_count":4,"area":null},{"id":"2208.08626","title":"CP-PINNs: Data-Driven Changepoints Detection in PDEs Using Online Optimized Physics-Informed Neural Networks","created":"2022-08-18","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":"2505.17277","title":"Comparator-Adaptive $\\Phi$-Regret: Improved Bounds, Simpler Algorithms, and Applications to Games","created":"2025-05-22","cited_by_count":2,"area":null},{"id":"2512.07770","title":"Distribution-informed Online Conformal Prediction","created":"2025-12-08","cited_by_count":2,"area":null},{"id":"2601.15984","title":"Partially Lazy Gradient Descent for Smoothed Online Learning","created":"2026-01-22","cited_by_count":2,"area":null},{"id":"2603.25916","title":"Parameter-Free Dynamic Regret for Unconstrained Linear Bandits","created":"2026-03-26","cited_by_count":2,"area":null},{"id":"2605.28057","title":"On the Learnability of Test-Time Adaptation: A Recovery Complexity Perspective","created":"2026-05-27","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":"2402.03545","title":"Online Feature Updates Improve Online (Generalized) Label Shift Adaptation","created":"2024-02-05","cited_by_count":1,"area":null},{"id":"2509.07901","title":"A Modular Algorithm for Non-Stationary Online Convex-Concave Optimization","created":"2025-09-09","cited_by_count":1,"area":null},{"id":"2511.06597","title":"Optimistic Online-to-Batch Conversions for Accelerated Convergence and Universality","created":"2025-11-10","cited_by_count":1,"area":null},{"id":"2602.10971","title":"A Jointly Efficient and Optimal Algorithm for Heteroskedastic Generalized Linear Bandits with Adversarial Corruptions","created":"2026-02-11","cited_by_count":1,"area":null},{"id":"2604.11151","title":"Gradient-Variation Regret Bounds for Unconstrained Online Learning","created":"2026-04-13","cited_by_count":1,"area":null},{"id":"2605.04269","title":"Adapt or Forget: Provable Tradeoffs Between Adam and SGD in Nonstationary Optimization","created":"2026-05-05","cited_by_count":1,"area":null},{"id":"2605.22191","title":"Bandit Convex Optimization with Gradient Prediction Adaptivity","created":"2026-05-21","cited_by_count":1,"area":null},{"id":"2605.28517","title":"Stochastic Gradient Descent with Momentum is Algorithmically Stable","created":"2026-05-27","cited_by_count":1,"area":null},{"id":"2607.27073","title":"Parameter-Free Dynamic Regret under Heavy-Tailed Noise","created":"2026-07-29","cited_by_count":1,"area":null},{"id":"2609.34423","title":"On the Relation Between Interval Regret and Dynamic Regret","created":"2026-09-28","cited_by_count":1,"area":null},{"id":"2303.02691","title":"Revisiting Weighted Strategy for Non-stationary Parametric Bandits","created":"2023-03-05","cited_by_count":0,"area":null},{"id":"2410.15009","title":"Time-Varying Convex Optimization with $O(n)$ Computational Complexity","created":"2024-10-19","cited_by_count":0,"area":null},{"id":"2502.19325","title":"Partition Tree Weighting for Non-Stationary Stochastic Bandits","created":"2025-02-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":"2509.05930","title":"Smoothed Online Optimization for Target Tracking: Robust and Learning-Augmented Algorithms","created":"2025-09-07","cited_by_count":0,"area":null},{"id":"2510.07086","title":"Non-Stationary Online Structured Prediction with Surrogate Losses","created":"2025-10-08","cited_by_count":0,"area":null},{"id":"2512.13506","title":"Learning under Distributional Drift: Prequential Reproducibility as an Intrinsic Statistical Resource","created":"2025-12-15","cited_by_count":0,"area":null},{"id":"2601.13519","title":"Small Gradient Norm Regret for Online Convex Optimization","created":"2026-01-20","cited_by_count":0,"area":null},{"id":"2602.09457","title":"From Average Sensitivity to Small-Loss Regret Bounds under Random-Order Model","created":"2026-02-10","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":"2605.26585","title":"Near-Optimal Regret in Adversarial Kernel Bandits","created":"2026-05-26","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}],"next_cursor":null}