Time-Varying Propensity Score to Bridge the Gap between the Past and Present
Rasool Fakoor, Jonas Mueller, Zachary Chase Lipton, Pratik Chaudhari, Alex Smola
摘要
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.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- Adapting to Continuous Covariate Shift via Online Density Ratio EstimationYu-Jie Zhang, Zhen-Yu Zhang, Peng Zhao, Masashi SugiyamaNeurIPS 2023 · 被引用 25 次
- Prospective Learning: Learning for a Dynamic FutureAshwin De Silva, Rahul Ramesh, Rubing Yang, Siyu Yu 等NeurIPS 2024 · 被引用 5 次
它引用的顶会 Paper10
- Task2Vec: Task Embedding for Meta-LearningAlessandro Achille, Michael Lam, Rahul Tewari, Avinash Ravichandran 等ICCV 2019 · 被引用 359 次
- A Unified View of Label Shift EstimationSaurabh Garg, Yifan Wu, Sivaraman Balakrishnan, Zachary C. LiptonNeurIPS 2020 · 被引用 186 次
- Meta-Q-LearningRasool Fakoor, Pratik Chaudhari, Stefano Soatto, Alexander J. SmolaICLR 2020 · 被引用 162 次
- Recurrent Model-Free RL Can Be a Strong Baseline for Many POMDPsTianwei Ni, Benjamin Eysenbach, Ruslan SalakhutdinovICML 2022 · 被引用 162 次
- Maximum Likelihood with Bias-Corrected Calibration is Hard-To-Beat at Label Shift AdaptationAmr Alexandari, Anshul Kundaje, Avanti ShrikumarICML 2020 · 被引用 123 次
相关 Paper
- When to retrain a machine learning modelFlorence Regol, Leo Schwinn, Kyle Sprague, Mark Coates 等ICML 2025
- Training for the Future: A Simple Gradient Interpolation Loss to Generalize Along TimeAnshul Nasery, Soumyadeep Thakur, Vihari Piratla, Abir De 等NeurIPS 2021 · 被引用 42 次
- Predictor-corrector algorithms for stochastic optimization under gradual distribution shiftSubha Maity, Debarghya Mukherjee, Moulinath Banerjee, Yuekai SunICLR 2023 · 被引用 1 次
- Evolving Standardization for Continual Domain Generalization over Temporal DriftMixue Xie, Shuang Li, Longhui Yuan, Chi Harold Liu 等NeurIPS 2023 · 被引用 21 次
- CODA: Temporal Domain Generalization via Concept Drift SimulatorChia-Yuan Chang, Yu-Neng Chuang, Zhimeng Jiang, Kwei-Herng Lai 等KDD 2025
