conftrace_

online linear regression

15 papers

Explore in graph

Co-occurring keywords · papers mentioning both

regret bound (9) online learning (3) stochastic optimization (3) concentration inequality (2) linear bandit (2) exponential weighting (2) individual sequence (2) dynamic regret (2) ridge regression (2) model-based reinforcement learning (1)

Papers

Self-Normalized Martingales and Uniform Regret Bounds for Linear Regression COLT 2026 Vector-valued self-normalized concentration inequalities beyond sub-Gaussianity ALT 2026 Sparsity-Based Interpolation of External, Internal and Swap Regret COLT 2025 Time-Uniform Self-Normalized Concentration for Vector-Valued Processes (Extended Abstract) COLT 2025 Online Linear Regression in Dynamic Environments via Discounting ICML 2024 Oracle Efficient Algorithms for Groupwise Regret ICLR 2024 Learning Rate Schedules in the Presence of Distribution Shift ICML 2023 The Gain from Ordering in Online Learning NeurIPS 2023 Optimal Dynamic Regret in LQR Control NeurIPS 2022 Stochastic Online Linear Regression: the Forward Algorithm to Replace Ridge NeurIPS 2021 Uniform regret bounds over R^d for the sequential linear regression problem with the square loss ALT 2019 Horizon-Independent Minimax Linear Regression NeurIPS 2018 Sparsity Regret Bounds for Individual Sequences in Online Linear Regression JMLR 2013 Sparsity Regret Bounds for Individual Sequences in Online Linear Regression COLT 2011 Online Linear Regression and Its Application to Model-Based Reinforcement Learning NeurIPS 2007