mlsanityData to 7 Oct 2026

Model Predictive Task Sampling for Efficient and Robust Adaptation

arXiv 2501.11039 ↗First posted 19 Jan 2025cs.LGcited by 20

Not on the map. Why?

Abstract (arXiv)

Foundation models have revolutionized general-purpose problem-solving, offering rapid task adaptation through pretraining, meta-training, and finetuning. Recent crucial advances in these paradigms reveal the importance of challenging task prioritized sampling to enhance adaptation robustness under distribution shifts. However, ranking task difficulties over iteration as a preliminary step typically requires exhaustive task evaluation, which is practically unaffordable in computation and data-annotation. This study provides a novel perspective to illuminate the possibility of leveraging the dual importance of adaptation robustness and learning efficiency, particularly in scenarios where task evaluation is risky or costly, such as iterative agent-environment interactions for robotic policy evaluation or computationally intensive inference steps for finetuning foundation models. Firstly, we introduce Model Predictive Task Sampling (MPTS), a framework that bridges the task space and adaptation risk distributions, providing a theoretical foundation for robust active task sampling. MPTS employs a generative model to characterize the episodic optimization process and predicts task-specific adaptation risk via posterior inference. The resulting risk predictive model amortizes the costly evaluation of task adaptation performance and provably approximates task difficulty rankings. MPTS seamlessly integrates into zero-shot, few-shot, and supervised finetuning settings. Empirically, we conduct extensive experiments in pattern recognition using foundation models and sequential decision-making. Our results demonstrate that MPTS significantly enhances adaptation robustness for tail risk or out-of-distribution (OOD) tasks and improves learning efficiency compared to state-of-the-art (SoTA) methods. The code is available at the project site https://github.com/thu-rllab/MPTS.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). Builds on 76 of its 113 references that are in the map. First posted on arXiv 19 Jan 2025.

Builds on

76 of 113 references.

References · 76

  1. 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2023GPT-4 Technical Reportcited by 18,132
  4. 2022Training language models to follow instructions with human feedbackcited by 15,712
  5. 2024The Llama 3 Herd of Modelscited by 14,192
  6. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
  7. 2023Segment Anythingcited by 8,158
  8. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
  9. 2022Flamingo: a Visual Language Model for Few-Shot Learningcited by 4,337
  10. 2017Prototypical Networks for Few-shot Learningcited by 3,001
  11. 2019Benchmarking Neural Network Robustness to Common Corruptions and Perturbationscited by 2,857
  12. 2021CLIPScore: A Reference-free Evaluation Metric for Image Captioningcited by 2,388
38 more
  1. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  2. 2021Learning to Prompt for Vision-Language Modelscited by 2,269
  3. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  4. 2019Do ImageNet Classifiers Generalize to ImageNet?cited by 1,507
  5. 2022Conditional Prompt Learning for Vision-Language Modelscited by 1,427
  6. 2017Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real Worldcited by 1,401
  7. 2019Natural Adversarial Examplescited by 1,401
  8. 2017Deep Setscited by 1,394
  9. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,366
  10. 2019Learning Robust Global Representations by Penalizing Local Predictive Powercited by 1,010
  11. 2016HyperNetworkscited by 1,003
  12. 2018On First-Order Meta-Learning Algorithmscited by 1,003
  13. 2020Meta-Learning in Neural Networks: A Surveycited by 944
  14. 2019Solving Rubik's Cube with a Robot Handcited by 699
  15. 2022MaPLe: Multi-modal Prompt Learningcited by 685
  16. 2021Deep Learning on a Data Diet: Finding Important Examples Early in Trainingcited by 529
  17. 2019Meta-Learning with Implicit Gradientscited by 523
  18. 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
  19. 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 490
  20. 2018Conditional Neural Processescited by 421
  21. 2023DoReMi: Optimizing Data Mixtures Speeds Up Language Model Pretrainingcited by 385
  22. 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 372
  23. 2017Variational Continual Learningcited by 335
  24. 2018Neural Processescited by 307
  25. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
  26. 2019Attentive Neural Processescited by 280
  27. 2017Feature Generating Networks for Zero-Shot Learningcited by 257
  28. 2018Probabilistic Model-Agnostic Meta-Learningcited by 254
  29. 2018Generalized Zero- and Few-Shot Learning via Aligned Variational Autoencoderscited by 206
  30. 2019Active Domain Randomizationcited by 161
  31. 2019Distributionally Robust Language Modelingcited by 142
  32. 2019Convolutional Conditional Neural Processescited by 139
  33. 2016EPOpt: Learning Robust Neural Network Policies Using Model Ensemblescited by 136
  34. 2021Generating Useful Accident-Prone Driving Scenarios via a Learned Traffic Priorcited by 136
  35. 2018Maximizing acquisition functions for Bayesian optimizationcited by 113
  36. 2019Infinite Mixture Prototypes for Few-Shot Learningcited by 99
  37. 2020Meta-Learning Stationary Stochastic Process Prediction with Convolutional Neural Processescited by 74
  38. 2023Evaluating the Zero-shot Robustness of Instruction-tuned Language Modelscited by 63

50 most cited of 76 All 76 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 15; 2026: 5.

20 papers.

Sort:

By area:

  1. 2025Can Prompt Difficulty be Online Predicted for Accelerating RL Finetuning of Reasoning Models?cited by 48
  2. 2025Prompt Curriculum Learning for Efficient LLM Post-Trainingcited by 40
  3. 2025FlyLoRA: Boosting Task Decoupling and Parameter Efficiency via Implicit Rank-Wise Mixture-of-Expertscited by 34
  4. 2025CurES: From Gradient Analysis to Efficient Curriculum Learning for Reasoning LLMscited by 16
  5. 2025Utility-Diversity Aware Online Batch Selection for LLM Supervised Fine-tuningcited by 14
  6. 2025BOTS: A Unified Framework for Bayesian Online Task Selection in LLM Reinforcement Finetuningcited by 12
  7. 2025Fast and Robust: Task Sampling with Posterior and Diversity Synergies for Adaptive Decision-Makers in Randomized Environmentscited by 11
  8. 2026Small Generalizable Prompt Predictive Models Can Steer Efficient RL Post-Training of Large Reasoning Modelscited by 11
  9. 2025Fly-CL: A Fly-Inspired Framework for Enhancing Efficient Decorrelation and Reduced Training Time in Pre-trained Model-based Continual Representation Learningcited by 10
  10. 2025Selective Learning for Deep Time Series Forecastingcited by 8
  11. 2026Dynamics-Predictive Sampling for Active RL Finetuning of Large Reasoning Modelscited by 8
  12. 2025InspireDebate: Multi-Dimensional Subjective-Objective Evaluation-Guided Reasoning and Optimization for Debatingcited by 4
8 more
  1. 2025Kuramoto Orientation Diffusion Modelscited by 4
  2. 2025Transformer-Based Spatial-Temporal Counterfactual Outcomes Estimationcited by 3
  3. 2026Limited Reasoning Space: The cage of long-horizon reasoning in LLMscited by 3
  4. 2025DTop-p MoE: Sparsity-Controlled Dynamic Top-p MoE for Foundation Model Pre-trainingcited by 2
  5. 2025SpidR-Adapt: A Universal Speech Representation Model for Few-Shot Adaptationcited by 1
  6. 2025Gains: Fine-grained Federated Domain Adaptation in Open Setcited by 0
  7. 2026PERO: Efficient Robust Post-Training Foundation Models for Encrypted Traffic Classificationcited by 0
  8. 2026You Only Edit Once: Incentivizing In-Context Capability of LLMs via Local Demonstration Refinementcited by 0