{"total":95,"rows":[{"id":"2202.07282","title":"Adaptive Conformal Predictions for Time Series","created":"2022-02-15","cited_by_count":161,"area":null},{"id":"2102.01046","title":"Impossible Tuning Made Possible: A New Expert Algorithm and Its Applications","created":"2021-02-01","cited_by_count":52,"area":null},{"id":"2302.09739","title":"A Blackbox Approach to Best of Both Worlds in Bandits and Beyond","created":"2023-02-20","cited_by_count":30,"area":null},{"id":"2302.10863","title":"A Unifying Perspective on Multi-Calibration: Game Dynamics for Multi-Objective Learning","created":"2023-02-21","cited_by_count":30,"area":null},{"id":"2112.12181","title":"Simple and near-optimal algorithms for hidden stratification and multi-group learning","created":"2021-12-22","cited_by_count":28,"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":"2206.00873","title":"Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs","created":"2022-06-02","cited_by_count":26,"area":null},{"id":"2102.00968","title":"CRPS Learning","created":"2021-02-01","cited_by_count":21,"area":null},{"id":"2109.10963","title":"On Optimal Robustness to Adversarial Corruption in Online Decision Problems","created":"2021-09-22","cited_by_count":21,"area":null},{"id":"2207.14550","title":"Best-of-Both-Worlds Algorithms for Partial Monitoring","created":"2022-07-29","cited_by_count":19,"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":"2302.02552","title":"Adapting to Continuous Covariate Shift via Online Density Ratio Estimation","created":"2023-02-06","cited_by_count":15,"area":null},{"id":"2305.17301","title":"Stability-penalty-adaptive follow-the-regularized-leader: Sparsity, game-dependency, and best-of-both-worlds","created":"2023-05-26","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":"2305.19674","title":"Online-to-PAC Conversions: Generalization Bounds via Regret Analysis","created":"2023-05-31","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":"2206.06810","title":"Adversarially Robust Multi-Armed Bandit Algorithm with Variance-Dependent Regret Bounds","created":"2022-06-14","cited_by_count":12,"area":null},{"id":"2210.04229","title":"Learning on the Edge: Online Learning with Stochastic Feedback Graphs","created":"2022-10-09","cited_by_count":12,"area":null},{"id":"2303.06825","title":"Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithm","created":"2023-03-13","cited_by_count":12,"area":null},{"id":"2103.11354","title":"Online Strongly Convex Optimization with Unknown Delays","created":"2021-03-21","cited_by_count":11,"area":null},{"id":"2403.00715","title":"Adaptive Learning Rate for Follow-the-Regularized-Leader: Competitive Analysis and Best-of-Both-Worlds","created":"2024-03-01","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":"1901.02230","title":"Soft-Bayes: Prod for Mixtures of Experts with Log-Loss","created":"2019-01-08","cited_by_count":10,"area":"moe"},{"id":"2102.07002","title":"On the Last Iterate Convergence of Momentum Methods","created":"2021-02-13","cited_by_count":10,"area":null},{"id":"2205.11470","title":"Exploiting the Curvature of Feasible Sets for Faster Projection-Free Online Learning","created":"2022-05-23","cited_by_count":10,"area":null},{"id":"2202.07574","title":"Damped Online Newton Step for Portfolio Selection","created":"2022-02-15","cited_by_count":9,"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.05287","title":"Group-wise oracle-efficient algorithms for online multi-group learning","created":"2024-06-07","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":"2110.14804","title":"Minimax Optimal Quantile and Semi-Adversarial Regret via Root-Logarithmic Regularizers","created":"2021-10-27","cited_by_count":8,"area":null},{"id":"2410.03284","title":"uniINF: Best-of-Both-Worlds Algorithm for Parameter-Free Heavy-Tailed MABs","created":"2024-10-04","cited_by_count":8,"area":null},{"id":"2501.13648","title":"Revisiting Online Learning Approach to Inverse Linear Optimization: A Fenchel$-$Young Loss Perspective and Gap-Dependent Regret Analysis","created":"2025-01-23","cited_by_count":8,"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":"2210.09385","title":"Adaptive Oracle-Efficient Online Learning","created":"2022-10-17","cited_by_count":7,"area":null},{"id":"2103.11370","title":"Online Convex Optimization with Continuous Switching Constraint","created":"2021-03-21","cited_by_count":6,"area":null},{"id":"2405.19705","title":"Universal Online Convex Optimization with $1$ Projection per Round","created":"2024-05-30","cited_by_count":6,"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":"2105.03681","title":"Universal Online Convex Optimization Meets Second-order Bounds","created":"2021-05-08","cited_by_count":4,"area":null},{"id":"2107.08011","title":"Adaptive first-order methods revisited: Convex optimization without Lipschitz requirements","created":"2021-07-16","cited_by_count":4,"area":null},{"id":"2111.08512","title":"Hierarchical transfer learning with applications for electricity load forecasting","created":"2021-11-16","cited_by_count":4,"area":null},{"id":"2112.14586","title":"Isotuning With Applications To Scale-Free Online Learning","created":"2021-12-29","cited_by_count":4,"area":null},{"id":"2207.08956","title":"Online Learning with Off-Policy Feedback","created":"2022-07-18","cited_by_count":4,"area":null},{"id":"2303.10019","title":"Multivariate Probabilistic CRPS Learning with an Application to Day-Ahead Electricity Prices","created":"2023-03-17","cited_by_count":4,"area":null},{"id":"2508.01681","title":"Generalized Kernelized Bandits: A Novel Self-Normalized Bernstein-Like Dimension-Free Inequality and Regret Bounds","created":"2025-08-03","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":"2104.02822","title":"Low-Regret Active learning","created":"2021-04-06","cited_by_count":3,"area":null},{"id":"2104.06050","title":"Sequential Ski Rental Problem","created":"2021-04-13","cited_by_count":3,"area":null},{"id":"2109.14309","title":"Online Aggregation of Probability Forecasts with Confidence","created":"2021-09-29","cited_by_count":3,"area":null},{"id":"2111.15365","title":"Expert Aggregation for Financial Forecasting","created":"2021-11-25","cited_by_count":3,"area":null},{"id":"2210.14998","title":"One Arrow, Two Kills: An Unified Framework for Achieving Optimal Regret Guarantees in Sleeping Bandits","created":"2022-10-26","cited_by_count":3,"area":null},{"id":"2302.08397","title":"Adaptive Selective Sampling for Online Prediction with Experts","created":"2023-02-16","cited_by_count":3,"area":null},{"id":"2306.06142","title":"Forecasting Electric Vehicle Charging Station Occupancy: Smarter Mobility Data Challenge","created":"2023-06-09","cited_by_count":3,"area":null},{"id":"2402.08321","title":"Exploration by Optimization with Hybrid Regularizers: Logarithmic Regret with Adversarial Robustness in Partial Monitoring","created":"2024-02-13","cited_by_count":3,"area":null},{"id":"2402.14585","title":"Bandits with Abstention under Expert Advice","created":"2024-02-22","cited_by_count":3,"area":null},{"id":"2403.01315","title":"Near-optimal Per-Action Regret Bounds for Sleeping Bandits","created":"2024-03-02","cited_by_count":3,"area":null},{"id":"2405.20028","title":"A Simple and Adaptive Learning Rate for FTRL in Online Learning with Minimax Regret of $\\Theta(T^{2/3})$ and its Application to Best-of-Both-Worlds","created":"2024-05-30","cited_by_count":3,"area":null},{"id":"2110.00334","title":"State-Space Models Win the IEEE DataPort Competition on Post-covid Day-ahead Electricity Load Forecasting","created":"2021-10-01","cited_by_count":2,"area":null},{"id":"2210.02256","title":"Constant regret for sequence prediction with limited advice","created":"2022-10-05","cited_by_count":2,"area":null},{"id":"2310.16473","title":"Policy Optimization via Adv2: Adversarial Learning on Advantage Functions","created":"2023-10-25","cited_by_count":2,"area":null},{"id":"2406.12366","title":"Structured Prediction in Online Learning","created":"2024-06-18","cited_by_count":2,"area":null},{"id":"2408.17366","title":"Leveraging Graph Neural Networks to Forecast Electricity Consumption","created":"2024-08-30","cited_by_count":2,"area":null},{"id":"2502.10485","title":"Forecasting time series with constraints","created":"2025-02-14","cited_by_count":2,"area":null},{"id":"2504.07307","title":"Follow-the-Perturbed-Leader Approaches Best-of-Both-Worlds for the m-Set Semi-Bandit Problems","created":"2025-04-09","cited_by_count":2,"area":null},{"id":"2506.01722","title":"When Lower-Order Terms Dominate: Adaptive Expert Algorithms for Heavy-Tailed Losses","created":"2025-06-02","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":"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":"2202.03621","title":"Bandit Sampling for Multiplex Networks","created":"2022-02-08","cited_by_count":1,"area":null},{"id":"2302.08192","title":"Frugal day-ahead forecasting of multiple local electricity loads by aggregating adaptive models","created":"2023-02-16","cited_by_count":1,"area":null},{"id":"2410.03363","title":"Minimax-optimal and Locally-adaptive Online Nonparametric Regression","created":"2024-10-04","cited_by_count":1,"area":null},{"id":"2503.20087","title":"Random feature-based double Vovk-Azoury-Warmuth algorithm for online multi-kernel learning","created":"2025-03-25","cited_by_count":1,"area":null},{"id":"2505.19741","title":"Minimax Adaptive Online Nonparametric Regression over Besov Spaces","created":"2025-05-26","cited_by_count":1,"area":null},{"id":"2507.03690","title":"Graph Neural Networks for Electricity Load Forecasting","created":"2025-07-04","cited_by_count":1,"area":null},{"id":"2605.05497","title":"Online Localized Conformal Prediction","created":"2026-05-06","cited_by_count":1,"area":null},{"id":"2606.06043","title":"Adaptive Learning Rates with Surrogate Probability for Follow-the-Perturbed-Leader","created":"2026-06-04","cited_by_count":1,"area":null},{"id":"2311.02610","title":"An adaptive standardisation methodology for Day-Ahead electricity price forecasting","created":"2023-11-05","cited_by_count":0,"area":null},{"id":"2402.17720","title":"The SMART approach to instance-optimal online learning","created":"2024-02-27","cited_by_count":0,"area":null},{"id":"2404.05155","title":"On the price of exact truthfulness in incentive-compatible online learning with bandit feedback: A regret lower bound for WSU-UX","created":"2024-04-08","cited_by_count":0,"area":null},{"id":"2406.14904","title":"Enhancing reliability in prediction intervals using point forecasters: Heteroscedastic Quantile Regression and Width-Adaptive Conformal Inference","created":"2024-06-21","cited_by_count":0,"area":null},{"id":"2407.05704","title":"Narrowing the Gap between Adversarial and Stochastic MDPs via Policy Optimization","created":"2024-07-08","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":"2512.21794","title":"Multi-agent Adaptive Mechanism Design","created":"2025-12-25","cited_by_count":0,"area":null},{"id":"2602.11747","title":"High-Probability Minimax Adaptive Estimation in Besov Spaces via Online-to-Batch","created":"2026-02-12","cited_by_count":0,"area":null},{"id":"2603.22348","title":"Learning Safely Without Knowing the World:COMPASS-Hedge","created":"2026-03-22","cited_by_count":0,"area":null},{"id":"2605.06541","title":"Hedging Memory Horizons for Non-Stationary Prediction via Online Aggregation","created":"2026-05-07","cited_by_count":0,"area":null},{"id":"2605.19768","title":"Minimax Optimal Variance-Aware Regret Bounds for Multinomial Logistic MDPs","created":"2026-05-19","cited_by_count":0,"area":"deeprl"},{"id":"2605.26919","title":"Agile Online Model Selection: Resolving Adaptation Lag via Safeguarded Large Learning Rates","created":"2026-05-26","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.14640","title":"Online Convex Optimization with Sublinear Noisy Probes","created":"2026-06-12","cited_by_count":0,"area":null},{"id":"2608.13554","title":"Defensive Boosting for Online Probabilistic Forecasting","created":"2026-08-13","cited_by_count":0,"area":null},{"id":"2609.24609","title":"GraphToolbox: A Configurable Python Framework for Graph Neural Network Forecasting","created":"2026-09-21","cited_by_count":0,"area":null},{"id":"2609.38058","title":"Latent Inference-Time Guidance of Time Series Foundation Models","created":"2026-09-29","cited_by_count":0,"area":null},{"id":"2610.02258","title":"Parameter-Free Interval-Dynamic Regret under Heavy-Tailed Noise","created":"2026-09-30","cited_by_count":0,"area":null},{"id":"2610.05450","title":"Groupwise Distortion Guarantees for Preference-Based Alignment","created":"2026-10-04","cited_by_count":0,"area":"alignment"},{"id":"2610.14904","title":"Prediction with Expert Advice under Heavy-Tailed Losses","created":"2026-10-10","cited_by_count":0,"area":null},{"id":"2610.15916","title":"Sample-Optimal Multi-Group Learning with an ERM Oracle","created":"2026-10-11","cited_by_count":0,"area":null}],"next_cursor":null}