mlsanityData to 7 Oct 2026

Time-Varying Propensity Score to Bridge the Gap between the Past and Present

arXiv 2210.01422 ↗First posted 4 Oct 2022cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Real-world deployment of machine learning models is challenging because data evolves over time. While no model can work when data evolves in an arbitrary fashion, if there is some pattern to these changes, we might be able to design methods to address it. This paper addresses situations when data evolves gradually. We introduce a time-varying propensity score that can detect gradual shifts in the distribution of data which allows us to selectively sample past data to update the model -- not just similar data from the past like that of a standard propensity score but also data that evolved in a similar fashion in the past. The time-varying propensity score is quite general: we demonstrate different ways of implementing it and evaluate it on a variety of problems ranging from supervised learning (e.g., image classification problems) where data undergoes a sequence of gradual shifts, to reinforcement learning tasks (e.g., robotic manipulation and continuous control) where data shifts as the policy or the task changes.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 26 of its 65 references that are in the map. First posted on arXiv 4 Oct 2022.

Builds on

26 of 65 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  3. 2015Trust Region Policy Optimizationcited by 2,503
  4. 2018Deep Visual Domain Adaptation: A Surveycited by 634
  5. 2019Conformal Prediction Under Covariate Shiftcited by 511
  6. 2020Learning under Concept Drift: A Reviewcited by 470
  7. 2018Detecting and Correcting for Label Shift with Black Box Predictorscited by 364
  8. 2018Task-Free Continual Learningcited by 219
  9. 2019Task2Vec: Task Embedding for Meta-Learningcited by 197
  10. 2016Sample Efficient Actor-Critic with Experience Replaycited by 185
  11. 2019Online Meta-Learningcited by 137
  12. 2020A Unified View of Label Shift Estimationcited by 119
14 more
  1. 2021Recurrent Model-Free RL Can Be a Strong Baseline for Many POMDPscited by 115
  2. 2022The CLEAR Benchmark: Continual LEArning on Real-World Imagerycited by 92
  3. 2019ROBEL: Robotics Benchmarks for Learning with Low-Cost Robotscited by 70
  4. 2019Meta-Q-Learningcited by 62
  5. 2020Challenges in Benchmarking Stream Learning Algorithms with Real-world Datacited by 57
  6. 2019Task Agnostic Continual Learning via Meta Learningcited by 53
  7. 2019Continuous Meta-Learning without Taskscited by 50
  8. 2021Online Adaptation to Label Distribution Shiftcited by 44
  9. 2020Deep Reinforcement Learning amidst Lifelong Non-Stationaritycited by 42
  10. 2019P3O: Policy-on Policy-off Policy Optimizationcited by 37
  11. 2021Continuous Doubly Constrained Batch Reinforcement Learningcited by 27
  12. 2020An Information-Geometric Distance on the Space of Taskscited by 15
  13. 2021Rethinking Importance Weighting for Transfer Learningcited by 11
  14. 2020DDPG++: Striving for Simplicity in Continuous-control Off-Policy Reinforcement Learningcited by 5

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 1; 2024: 2; 2025: 0; 2026: 2.

5 papers.