mlsanityData to 7 Oct 2026

Adapting to Continuous Covariate Shift via Online Density Ratio Estimation

arXiv 2302.02552 ↗First posted 6 Feb 2023cs.LG stat.MLcited by 15

Not on the map. Why?

Abstract (arXiv)

Dealing with distribution shifts is one of the central challenges for modern machine learning. One fundamental situation is the covariate shift, where the input distributions of data change from training to testing stages while the input-conditional output distribution remains unchanged. In this paper, we initiate the study of a more challenging scenario -- continuous covariate shift -- in which the test data appear sequentially, and their distributions can shift continuously. Our goal is to adaptively train the predictor such that its prediction risk accumulated over time can be minimized. Starting with the importance-weighted learning, we show the method works effectively if the time-varying density ratios of test and train inputs can be accurately estimated. However, existing density ratio estimation methods would fail due to data scarcity at each time step. To this end, we propose an online method that can appropriately reuse historical information. Our density ratio estimation method is proven to perform well by enjoying a dynamic regret bound, which finally leads to an excess risk guarantee for the predictor. Empirical results also validate the effectiveness.

Key facts. Cited by 15 papers in the map (data through 7 Oct 2026). Builds on 46 of its 97 references that are in the map. First posted on arXiv 6 Feb 2023.

Builds on

46 of 97 references.

References · 46

  1. 2015Domain-Adversarial Training of Neural Networkscited by 3,023
  2. 2021Convex optimizationcited by 2,479
  3. 2019Introduction to Online Convex Optimizationcited by 793
  4. 2015An Introduction to Matrix Concentration Inequalitiescited by 391
  5. 2018Detecting and Correcting for Label Shift with Black Box Predictorscited by 364
  6. 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 195
  7. 2013Non-stationary Stochastic Optimizationcited by 173
  8. 2018Adaptive Online Learning in Dynamic Environmentscited by 130
  9. 2020A Unified View of Label Shift Estimationcited by 119
  10. 2015Online Optimization : Competing with Dynamic Comparatorscited by 99
  11. 2021Non-stationary Reinforcement Learning without Prior Knowledge: An Optimal Black-box Approachcited by 98
  12. 2020Rethinking Importance Weighting for Deep Learning under Distribution Shiftcited by 92
34 more
  1. 2014A Second-order Bound with Excess Lossescited by 91
  2. 2020Dynamic Regret of Convex and Smooth Functionscited by 90
  3. 2022Wild-Time: A Benchmark of in-the-Wild Distribution Shift over Timecited by 85
  4. 2021Adaptivity and Non-stationarity: Problem-dependent Dynamic Regret for Online Convex Optimizationcited by 66
  5. 2016Tracking Slowly Moving Clairvoyant: Optimal Dynamic Regret of Online Learning with True and Noisy Gradientcited by 65
  6. 2018Marginal Singularity, and the Benefits of Labels in Covariate-Shiftcited by 65
  7. 2015A Century of Portraits: A Visual Historical Record of American High School Yearbookscited by 54
  8. 2021A Simple Approach for Non-stationary Linear Banditscited by 54
  9. 2016Improved Strongly Adaptive Online Learning using Coin Bettingcited by 48
  10. 2022Open-environment Machine Learningcited by 48
  11. 2021Online Adaptation to Label Distribution Shiftcited by 44
  12. 2020Non-Negative Bregman Divergence Minimization for Deep Direct Density Ratio Estimationcited by 43
  13. 2013Dynamical Models and Tracking Regret in Online Convex Programmingcited by 42
  14. 2019Bandit Convex Optimization in Non-stationary Environmentscited by 41
  15. 2017Active Learning for Cost-Sensitive Classificationcited by 40
  16. 2021Near-Optimal Linear Regression under Distribution Shiftcited by 40
  17. 2021Optimal Dynamic Regret in Exp-Concave Online Learningcited by 39
  18. 2022No-Regret Learning in Time-Varying Zero-Sum Gamescited by 36
  19. 2017Tracking the Best Expert in Non-stationary Stochastic Environmentscited by 35
  20. 2020Improved Analysis for Dynamic Regret of Strongly Convex and Smooth Functionscited by 33
  21. 2021Non-stationary Online Learning with Memory and Non-stochastic Controlcited by 33
  22. 2019Online Forecasting of Total-Variation-bounded Sequencescited by 30
  23. 2020Minimizing Dynamic Regret and Adaptive Regret Simultaneouslycited by 30
  24. 2021Revisiting Smoothed Online Learningcited by 29
  25. 2022Adapting to Online Label Shift with Provable Guaranteescited by 26
  26. 2022Corralling a Larger Band of Bandits: A Case Study on Switching Regret for Linear Banditscited by 22
  27. 2020A One-step Approach to Covariate Shift Adaptationcited by 20
  28. 2022Estimating and Explaining Model Performance When Both Covariates and Labels Shiftcited by 19
  29. 2022Dynamic Regret of Online Markov Decision Processescited by 13
  30. 2020Adaptive Online Estimation of Piecewise Polynomial Trendscited by 11
  31. 2023Unconstrained Dynamic Regret via Sparse Codingcited by 11
  32. 2022Optimal Dynamic Regret in LQR Controlcited by 6
  33. 2022Time-Varying Propensity Score to Bridge the Gap between the Past and Presentcited by 5
  34. 2021Continual Density Ratio Estimation in an Online Settingcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 4; 2025: 7; 2026: 4.

15 papers.

Sort: