{"total":739,"rows":[{"id":"2106.00170","title":"Adaptive Conformal Inference Under Distribution Shift","created":"2021-06-01","cited_by_count":375,"area":null},{"id":"2103.00039","title":"Practical and Private (Deep) Learning without Sampling or Shuffling","created":"2021-02-26","cited_by_count":170,"area":null},{"id":"2405.15682","title":"The Road Less Scheduled","created":"2024-05-24","cited_by_count":163,"area":null},{"id":"2202.07282","title":"Adaptive Conformal Predictions for Time Series","created":"2022-02-15","cited_by_count":161,"area":null},{"id":"2208.08401","title":"Conformal Inference for Online Prediction with Arbitrary Distribution Shifts","created":"2022-08-17","cited_by_count":128,"area":null},{"id":"2304.13960","title":"Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Be","created":"2023-04-27","cited_by_count":114,"area":null},{"id":"2203.15046","title":"AUC Maximization in the Era of Big Data and AI: A Survey","created":"2022-03-28","cited_by_count":100,"area":null},{"id":"2102.04074","title":"Learning Curve Theory","created":"2021-02-08","cited_by_count":85,"area":null},{"id":"2106.00661","title":"Reward is enough for convex MDPs","created":"2021-06-01","cited_by_count":84,"area":null},{"id":"2302.07869","title":"Improved Online Conformal Prediction via Strongly Adaptive Online Learning","created":"2023-02-15","cited_by_count":78,"area":null},{"id":"2108.09020","title":"Online Continual Learning with Natural Distribution Shifts: An Empirical Study with Visual Data","created":"2021-08-20","cited_by_count":69,"area":null},{"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":"2504.13173","title":"It's All Connected: A Journey Through Test-Time Memorization, Attentional Bias, Retention, and Online Optimization","created":"2025-04-17","cited_by_count":64,"area":null},{"id":"2205.02160","title":"Making SGD Parameter-Free","created":"2022-05-04","cited_by_count":50,"area":null},{"id":"2310.05921","title":"Conformal Decision Theory: Safe Autonomous Decisions from Imperfect Predictions","created":"2023-10-09","cited_by_count":50,"area":null},{"id":"2112.00193","title":"Public Data-Assisted Mirror Descent for Private Model Training","created":"2021-12-01","cited_by_count":49,"area":null},{"id":"2202.11672","title":"Learning Fast and Slow for Online Time Series Forecasting","created":"2022-02-23","cited_by_count":45,"area":null},{"id":"2203.00444","title":"Parameter-free Mirror Descent","created":"2022-02-26","cited_by_count":45,"area":null},{"id":"2302.03775","title":"Optimal Stochastic Non-smooth Non-convex Optimization through Online-to-Non-convex Conversion","created":"2023-02-07","cited_by_count":45,"area":null},{"id":"2108.08993","title":"Distributionally Robust Learning","created":"2021-08-20","cited_by_count":44,"area":null},{"id":"2201.01985","title":"Jointly Efficient and Optimal Algorithms for Logistic Bandits","created":"2022-01-06","cited_by_count":41,"area":null},{"id":"2209.07454","title":"A Unifying Framework for Online Optimization with Long-Term Constraints","created":"2022-09-15","cited_by_count":41,"area":null},{"id":"2308.00788","title":"An Introduction to Bi-level Optimization: Foundations and Applications in Signal Processing and Machine Learning","created":"2023-08-01","cited_by_count":41,"area":null},{"id":"2405.15116","title":"Quantifying the Gain in Weak-to-Strong Generalization","created":"2024-05-24","cited_by_count":41,"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.01117","title":"SGD Generalizes Better Than GD (And Regularization Doesn't Help)","created":"2021-02-01","cited_by_count":38,"area":null},{"id":"2112.00885","title":"DOPE: Doubly Optimistic and Pessimistic Exploration for Safe Reinforcement Learning","created":"2021-12-01","cited_by_count":35,"area":null},{"id":"2310.18955","title":"Optimal Algorithms for Online Convex Optimization with Adversarial Constraints","created":"2023-10-29","cited_by_count":34,"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":"2410.20625","title":"LoRA Done RITE: Robust Invariant Transformation Equilibration for LoRA Optimization","created":"2024-10-27","cited_by_count":32,"area":null},{"id":"2102.06589","title":"Generalization Bounds for Meta-Learning via PAC-Bayes and Uniform Stability","created":"2021-02-12","cited_by_count":30,"area":null},{"id":"2102.13128","title":"An Online Learning Approach to Interpolation and Extrapolation in Domain Generalization","created":"2021-02-25","cited_by_count":30,"area":null},{"id":"2111.05818","title":"Efficient Projection-Free Online Convex Optimization with Membership Oracle","created":"2021-11-10","cited_by_count":30,"area":null},{"id":"2211.07484","title":"Contextual Bandits with Packing and Covering Constraints: A Modular Lagrangian Approach via Regression","created":"2022-11-14","cited_by_count":30,"area":null},{"id":"2302.06606","title":"Breaking the Curse of Multiagency: Provably Efficient Decentralized Multi-Agent RL with Function Approximation","created":"2023-02-13","cited_by_count":30,"area":null},{"id":"2102.06924","title":"Online Apprenticeship Learning","created":"2021-02-13","cited_by_count":29,"area":null},{"id":"2202.00150","title":"Learning Infinite-Horizon Average-Reward Markov Decision Processes with Constraints","created":"2022-01-31","cited_by_count":29,"area":null},{"id":"2502.19148","title":"Amulet: ReAlignment During Test Time for Personalized Preference Adaptation of LLMs","created":"2025-02-26","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":"2210.14355","title":"Parameter-free Regret in High Probability with Heavy Tails","created":"2022-10-25","cited_by_count":28,"area":null},{"id":"2201.07877","title":"PDE-Based Optimal Strategy for Unconstrained Online Learning","created":"2022-01-19","cited_by_count":27,"area":null},{"id":"2202.04985","title":"Generalization Bounds via Convex Analysis","created":"2022-02-10","cited_by_count":27,"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":"2202.04721","title":"New Projection-free Algorithms for Online Convex Optimization with Adaptive Regret Guarantees","created":"2022-02-09","cited_by_count":26,"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":"2211.05006","title":"Almost Tight Error Bounds on Differentially Private Continual Counting","created":"2022-11-09","cited_by_count":26,"area":null},{"id":"2206.07082","title":"Stability and Generalization of Stochastic Optimization with Nonconvex and Nonsmooth Problems","created":"2022-06-14","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":"2402.02009","title":"Robust Multi-Task Learning with Excess Risks","created":"2024-02-03","cited_by_count":24,"area":null},{"id":"2106.06098","title":"Meta-Adaptive Nonlinear Control: Theory and Algorithms","created":"2021-06-11","cited_by_count":23,"area":null},{"id":"2102.10221","title":"Logarithmic Regret in Feature-based Dynamic Pricing","created":"2021-02-20","cited_by_count":22,"area":null},{"id":"2201.13172","title":"Near-Optimal Regret for Adversarial MDP with Delayed Bandit Feedback","created":"2022-01-31","cited_by_count":22,"area":null},{"id":"2206.00024","title":"Online PAC-Bayes Learning","created":"2022-05-31","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":"2105.00321","title":"Regret and Cumulative Constraint Violation Analysis for Distributed Online Constrained Convex Optimization","created":"2021-05-01","cited_by_count":21,"area":null},{"id":"2201.00703","title":"Stochastic Continuous Submodular Maximization: Boosting via Non-oblivious Function","created":"2022-01-03","cited_by_count":21,"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":"2401.15866","title":"Stochastic Amortization: A Unified Approach to Accelerate Feature and Data Attribution","created":"2024-01-29","cited_by_count":21,"area":null},{"id":"2107.00894","title":"Online Multi-Agent Forecasting with Interpretable Collaborative Graph Neural Network","created":"2021-07-02","cited_by_count":20,"area":null},{"id":"2111.11309","title":"No-Regret Dynamics in the Fenchel Game: A Unified Framework for Algorithmic Convex Optimization","created":"2021-11-22","cited_by_count":20,"area":null},{"id":"2111.12050","title":"Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning","created":"2021-11-23","cited_by_count":20,"area":null},{"id":"2111.14737","title":"Beyond Time-Average Convergence: Near-Optimal Uncoupled Online Learning via Clairvoyant Multiplicative Weights Update","created":"2021-11-29","cited_by_count":20,"area":null},{"id":"2204.09837","title":"Memory Bounds for the Experts Problem","created":"2022-04-21","cited_by_count":20,"area":null},{"id":"2301.13306","title":"Autobidders with Budget and ROI Constraints: Efficiency, Regret, and Pacing Dynamics","created":"2023-01-30","cited_by_count":20,"area":null},{"id":"2306.00144","title":"Mechanic: A Learning Rate Tuner","created":"2023-05-31","cited_by_count":20,"area":null},{"id":"2405.09831","title":"Nearly Minimax Optimal Regret for Multinomial Logistic Bandit","created":"2024-05-16","cited_by_count":20,"area":null},{"id":"2510.19178","title":"Imbalanced Gradients in RL Post-Training of Multi-Task LLMs","created":"2025-10-22","cited_by_count":20,"area":null},{"id":"2202.13361","title":"Benign Underfitting of Stochastic Gradient Descent","created":"2022-02-27","cited_by_count":19,"area":null},{"id":"2405.09742","title":"Random Scaling and Momentum for Non-smooth Non-convex Optimization","created":"2024-05-16","cited_by_count":19,"area":null},{"id":"2410.23042","title":"Toward Understanding In-context vs. In-weight Learning","created":"2024-10-30","cited_by_count":19,"area":null},{"id":"2302.13849","title":"Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension","created":"2023-02-27","cited_by_count":18,"area":null},{"id":"2206.06015","title":"No-Regret Learning in Games with Noisy Feedback: Faster Rates and Adaptivity via Learning Rate Separation","created":"2022-06-13","cited_by_count":17,"area":null},{"id":"2208.03635","title":"Federated Adversarial Learning: A Framework with Convergence Analysis","created":"2022-08-07","cited_by_count":17,"area":null},{"id":"2212.13669","title":"Near-Optimal Algorithms for Group Distributionally Robust Optimization and Beyond","created":"2022-12-28","cited_by_count":17,"area":null},{"id":"2301.00457","title":"ReSQueing Parallel and Private Stochastic Convex Optimization","created":"2023-01-01","cited_by_count":17,"area":null},{"id":"2301.13087","title":"Improved Regret for Efficient Online Reinforcement Learning with Linear Function Approximation","created":"2023-01-30","cited_by_count":17,"area":null},{"id":"2302.03764","title":"Sketchy: Memory-efficient Adaptive Regularization with Frequent Directions","created":"2023-02-07","cited_by_count":17,"area":null},{"id":"2302.04925","title":"Information Theoretic Lower Bounds for Information Theoretic Upper Bounds","created":"2023-02-09","cited_by_count":17,"area":null},{"id":"2508.07473","title":"Online Convex Optimization with Heavy Tails: Old Algorithms, New Regrets, and Applications","created":"2025-08-10","cited_by_count":17,"area":null},{"id":"2112.02866","title":"Nonstochastic Bandits with Composite Anonymous Feedback","created":"2021-12-06","cited_by_count":16,"area":null},{"id":"2207.07974","title":"Online Prediction in Sub-linear Space","created":"2022-07-16","cited_by_count":16,"area":null},{"id":"2210.06846","title":"An $\\alpha$-regret analysis of Adversarial Bilateral Trade","created":"2022-10-13","cited_by_count":16,"area":null},{"id":"2301.01542","title":"Federated Learning for Data Streams","created":"2023-01-04","cited_by_count":16,"area":null},{"id":"2303.15383","title":"List Online Classification","created":"2023-03-27","cited_by_count":16,"area":null},{"id":"2308.09543","title":"Latent State Models of Training Dynamics","created":"2023-08-18","cited_by_count":16,"area":null},{"id":"2406.04592","title":"Provable Complexity Improvement of AdaGrad over SGD: Upper and Lower Bounds in Stochastic Non-Convex Optimization","created":"2024-06-07","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":"2110.06777","title":"Incremental Ensemble Gaussian Processes","created":"2021-10-13","cited_by_count":15,"area":null},{"id":"2112.02856","title":"Doubly Optimal No-Regret Online Learning in Strongly Monotone Games with Bandit Feedback","created":"2021-12-06","cited_by_count":15,"area":null},{"id":"2112.04467","title":"CoMPS: Continual Meta Policy Search","created":"2021-12-08","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":"2303.01673","title":"Near Optimal Memory-Regret Tradeoff for Online Learning","created":"2023-03-03","cited_by_count":15,"area":null},{"id":"2306.08448","title":"Kalman Filter for Online Classification of Non-Stationary Data","created":"2023-06-14","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":"2502.10020","title":"Improved Online Confidence Bounds for Multinomial Logistic Bandits","created":"2025-02-14","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":"2102.03803","title":"Lazy OCO: Online Convex Optimization on a Switching Budget","created":"2021-02-07","cited_by_count":14,"area":null},{"id":"2205.06491","title":"Tighter Regret Analysis and Optimization of Online Federated Learning","created":"2022-05-13","cited_by_count":14,"area":null}],"next_cursor":"100"}