Adaptive Estimation and Learning under Temporal Distribution Shift
Not on the map. Why?
Abstract (arXiv)
In this paper, we study the problem of estimation and learning under temporal distribution shift. Consider an observation sequence of length n, which is a noisy realization of a time-varying groundtruth sequence. Our focus is to develop methods to estimate the groundtruth at the final time-step while providing sharp point-wise estimation error rates. We show that, without prior knowledge on the level of temporal shift, a wavelet soft-thresholding estimator provides an optimal estimation error bound for the groundtruth. Our proposed estimation method generalizes existing researches Mazzetto and Upfal (2023) by establishing a connection between the sequence's non-stationarity level and the sparsity in the wavelet-transformed domain. Our theoretical findings are validated by numerical experiments. Additionally, we applied the estimator to derive sparsity-aware excess risk bounds for binary classification under distribution shift and to develop computationally efficient training objectives. As a final contribution, we draw parallels between our results and the classical signal processing problem of total-variation denoising (Mammen and van de Geer,1997; Tibshirani, 2014), uncovering novel optimal algorithms for such task.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 29 of its 55 references that are in the map. First posted on arXiv 21 May 2025.
Builds on
29 of 55 references.
References · 29
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2019Introduction to Online Convex Optimizationcited by 803
- 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 215
- 2013Non-stationary Stochastic Optimizationcited by 175
- 2018Adaptive Online Learning in Dynamic Environmentscited by 133
- 2015Strongly Adaptive Online Learningcited by 107
- 2015Online Optimization : Competing with Dynamic Comparatorscited by 99
- 2020Dynamic Regret of Convex and Smooth Functionscited by 90
- 2016Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradientcited by 66
- 2016Improved Strongly Adaptive Online Learning using Coin Bettingcited by 50
- 2013Adaptive piecewise polynomial estimation via trend filteringcited by 47
- 2014Trend Filtering on Graphscited by 45
17 more
- 2021Optimal Dynamic Regret in Exp-Concave Online Learningcited by 40
- 2023Diagnosing Model Performance Under Distribution Shiftcited by 39
- 2020Improving Generalization by Controlling Label-Noise Information in Neural Network Weightscited by 35
- 2019Online Forecasting of Total-Variation-bounded Sequencescited by 31
- 2022Optimal Dynamic Regret in Proper Online Learning with Strongly Convex Losses and Beyondcited by 28
- 2021An Information-theoretic Approach to Distribution Shiftscited by 25
- 2022"Why did the Model Fail?": Attributing Model Performance Changes to Distribution Shiftscited by 18
- 2023An Adaptive Algorithm for Learning with Unknown Distribution Driftcited by 16
- 2022Information-Theoretic Analysis of Unsupervised Domain Adaptationcited by 15
- 2015Statistical Learning under Nonstationary Mixing Processescited by 12
- 2024Model Assessment and Selection under Temporal Distribution Shiftcited by 12
- 2020Adaptive Online Estimation of Piecewise Polynomial Trendscited by 11
- 2023Online Label Shift: Optimal Dynamic Regret meets Practical Algorithmscited by 11
- 2015Learning with a Drifting Target Conceptcited by 10
- 2021An Optimal Reduction of TV-Denoising to Adaptive Online Learningcited by 9
- 2022Second Order Path Variationals in Non-Stationary Online Learningcited by 7
- 2025Adapting to Online Distribution Shifts in Deep Learning: A Black-Box Approachcited by 2
Built on by
Citing papers per year: 2026: 2.
2 papers.