An Adaptive Algorithm for Learning with Unknown Distribution Drift
Not on the map. Why?
Abstract (arXiv)
We develop and analyze a general technique for learning with an unknown distribution drift. Given a sequence of independent observations from the last T steps of a drifting distribution, our algorithm agnostically learns a family of functions with respect to the current distribution at time T. Unlike previous work, our technique does not require prior knowledge about the magnitude of the drift. Instead, the algorithm adapts to the sample data. Without explicitly estimating the drift, the algorithm learns a family of functions with almost the same error as a learning algorithm that knows the magnitude of the drift in advance. Furthermore, since our algorithm adapts to the data, it can guarantee a better learning error than an algorithm that relies on loose bounds on the drift. We demonstrate the application of our technique in two fundamental learning scenarios: binary classification and linear regression.
Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 5 of its 29 references that are in the map. First posted on arXiv 3 May 2023.
Builds on
5 of 29 references.
References · 5
- 2020On the Rademacher Complexity of Linear Hypothesis Setscited by 17
- 2014The Sample Complexity of Learning Linear Predictors with the Squared Losscited by 16
- 2015Statistical Learning under Nonstationary Mixing Processescited by 11
- 2015Learning with a Drifting Target Conceptcited by 10
- 2023Nonparametric Density Estimation under Distribution Driftcited by 5
Built on by
Citing papers per year: 2023: 2; 2024: 4; 2025: 5; 2026: 3.
14 papers.
Sort:
- 2024Model Assessment and Selection under Temporal Distribution Shiftcited by 10
- 2023A Stability Principle for Learning under Non-Stationaritycited by 9
- 2024Adaptive Smooth Non-Stationary Banditscited by 4
- 2024An Improved Algorithm for Learning Drifting Discrete Distributionscited by 2
- 2025Adapting to Online Distribution Shifts in Deep Learning: A Black-Box Approachcited by 2
- 2025RCCDA: Adaptive Model Updates in the Presence of Concept Drift under a Constrained Resource Budgetcited by 2
- 2025Online Learning in the Random Order Modelcited by 2
- 2023An Adaptive Method for Weak Supervision with Drifting Datacited by 1
- 2025Adaptive Estimation and Learning under Temporal Distribution Shiftcited by 1
- 2025Optimal Empirical Risk Minimization under Temporal Distribution Shiftscited by 1
- 2024Distribution-Free Predictive Inference under Unknown Temporal Driftcited by 0
- 2026Fast Rates for Nonstationary Weighted Risk Minimizationcited by 0
- 2026When Can Old Evaluations Certify a New Model? Label-Efficient Release Decisions under Evaluator Drift26 Sep 2026
- 2026Efficiently Learning Drifting Halfspaces with Massart Noise9 Jun 2026
- 2026Fast Rates for Nonstationary Weighted Risk Minimization5 Feb 2026
- 2025Online Learning in the Random Order Model3 Oct 2025
- 2025Optimal Empirical Risk Minimization under Temporal Distribution Shifts17 Jul 2025
- 2025RCCDA: Adaptive Model Updates in the Presence of Concept Drift under a Constrained Resource Budget30 May 2025
- 2025Adaptive Estimation and Learning under Temporal Distribution Shift21 May 2025
- 2025Adapting to Online Distribution Shifts in Deep Learning: A Black-Box Approach9 Apr 2025
- 2024Adaptive Smooth Non-Stationary Bandits11 Jul 2024
- 2024Distribution-Free Predictive Inference under Unknown Temporal Drift10 Jun 2024
- 2024An Improved Algorithm for Learning Drifting Discrete Distributions8 Mar 2024
- 2024Model Assessment and Selection under Temporal Distribution Shift13 Feb 2024
2 more
- 2023A Stability Principle for Learning under Non-Stationarity27 Oct 2023
- 2023An Adaptive Method for Weak Supervision with Drifting Data2 Jun 2023
- 2024Model Assessment and Selection under Temporal Distribution Shiftcited by 10
- 2023A Stability Principle for Learning under Non-Stationaritycited by 9
- 2024Adaptive Smooth Non-Stationary Banditscited by 4
- 2024An Improved Algorithm for Learning Drifting Discrete Distributionscited by 2
- 2025Adapting to Online Distribution Shifts in Deep Learning: A Black-Box Approachcited by 2
- 2025RCCDA: Adaptive Model Updates in the Presence of Concept Drift under a Constrained Resource Budgetcited by 2
- 2025Online Learning in the Random Order Modelcited by 2
- 2023An Adaptive Method for Weak Supervision with Drifting Datacited by 1
- 2025Adaptive Estimation and Learning under Temporal Distribution Shiftcited by 1
- 2025Optimal Empirical Risk Minimization under Temporal Distribution Shiftscited by 1
- 2024Distribution-Free Predictive Inference under Unknown Temporal Driftcited by 0
- 2026Fast Rates for Nonstationary Weighted Risk Minimizationcited by 0
12 most cited of 14 All 14 (JSON)
- 2026When Can Old Evaluations Certify a New Model? Label-Efficient Release Decisions under Evaluator Drift26 Sep 2026
- 2026Efficiently Learning Drifting Halfspaces with Massart Noise9 Jun 2026
- 2026Fast Rates for Nonstationary Weighted Risk Minimization5 Feb 2026
- 2025Online Learning in the Random Order Model3 Oct 2025
- 2025Optimal Empirical Risk Minimization under Temporal Distribution Shifts17 Jul 2025
- 2025RCCDA: Adaptive Model Updates in the Presence of Concept Drift under a Constrained Resource Budget30 May 2025
- 2025Adaptive Estimation and Learning under Temporal Distribution Shift21 May 2025
- 2025Adapting to Online Distribution Shifts in Deep Learning: A Black-Box Approach9 Apr 2025
- 2024Adaptive Smooth Non-Stationary Bandits11 Jul 2024
- 2024Distribution-Free Predictive Inference under Unknown Temporal Drift10 Jun 2024
- 2024An Improved Algorithm for Learning Drifting Discrete Distributions8 Mar 2024
- 2024Model Assessment and Selection under Temporal Distribution Shift13 Feb 2024
12 newest of 14 All 14 (JSON)