mlsanityData to 14 Oct 2026

Fast and Robust: Task Sampling with Posterior and Diversity Synergies for Adaptive Decision-Makers in Randomized Environments

arXiv 2504.19139 ↗First posted 27 Apr 2025cs.LG cs.AI stat.MLcited by 12

Not on the map. Why?

Abstract (arXiv)

Task robust adaptation is a long-standing pursuit in sequential decision-making. Some risk-averse strategies, e.g., the conditional value-at-risk principle, are incorporated in domain randomization or meta reinforcement learning to prioritize difficult tasks in optimization, which demand costly intensive evaluations. The efficiency issue prompts the development of robust active task sampling to train adaptive policies, where risk-predictive models are used to surrogate policy evaluation. This work characterizes the optimization pipeline of robust active task sampling as a Markov decision process, posits theoretical and practical insights, and constitutes robustness concepts in risk-averse scenarios. Importantly, we propose an easy-to-implement method, referred to as Posterior and Diversity Synergized Task Sampling (PDTS), to accommodate fast and robust sequential decision-making. Extensive experiments show that PDTS unlocks the potential of robust active task sampling, significantly improves the zero-shot and few-shot adaptation robustness in challenging tasks, and even accelerates the learning process under certain scenarios. Our project website is at https://thu-rllab.github.io/PDTS_project_page.

Key facts. Cited by 12 papers in the map (data through 14 Oct 2026). Builds on 63 of its 100 references that are in the map. First posted on arXiv 27 Apr 2025.

Builds on

63 of 100 references.

References · 63

  1. 2017Proximal Policy Optimization Algorithmscited by 15,215
  2. 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,897
  3. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,417
  4. 2020Offline Reinforcement Learning: Tutorial, Review, and Perspectives on Open Problemscited by 1,920
  5. 2017Domain Randomization for Transferring Deep Neural Networks from Simulation to the Real Worldcited by 1,498
  6. 2020WILDS: A Benchmark of in-the-Wild Distribution Shiftscited by 1,375
  7. 2020Meta-Learning in Neural Networks: A Surveycited by 950
  8. 2017Deep Bayesian Active Learning with Image Datacited by 819
  9. 2020A Survey of Deep Active Learningcited by 554
  10. 2019Meta-Learning with Implicit Gradientscited by 525
  11. 2016RL2: Fast Reinforcement Learning via Slow Reinforcement Learningcited by 503
  12. 2019On Evaluating Adversarial Robustnesscited by 447
38 more
  1. 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 432
  2. 2019Efficient Off-Policy Meta-Reinforcement Learning via Probabilistic Context Variablescited by 389
  3. 2017Variational Continual Learningcited by 339
  4. 2015Risk-Constrained Reinforcement Learning with Percentile Risk Criteriacited by 337
  5. 2018Neural Processescited by 311
  6. 2020Emergent Complexity and Zero-shot Transfer via Unsupervised Environment Designcited by 275
  7. 2013Learning to Optimize Via Posterior Samplingcited by 256
  8. 2018Probabilistic Model-Agnostic Meta-Learningcited by 256
  9. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  10. 2024ManiSkill3: GPU Parallelized Robotics Simulation and Rendering for Generalizable Embodied AIcited by 229
  11. 2019VariBAD: A Very Good Method for Bayes-Adaptive Deep RL via Meta-Learningcited by 217
  12. 2021Deep Deterministic Uncertainty: A Simple Baselinecited by 200
  13. 2018Bayesian Model-Agnostic Meta-Learningcited by 194
  14. 2015Risk-Sensitive and Robust Decision-Making: a CVaR Optimization Approachcited by 170
  15. 2019Active Domain Randomizationcited by 170
  16. 2021Generating Useful Accident-Prone Driving Scenarios via a Learned Traffic Priorcited by 139
  17. 2018Meta-Reinforcement Learning of Structured Exploration Strategiescited by 130
  18. 2021Replay-Guided Adversarial Environment Designcited by 111
  19. 2023A Tutorial on Meta-Reinforcement Learningcited by 108
  20. 2024DrEureka: Language Model Guided Sim-To-Real Transfercited by 83
  21. 2015Policy Gradient for Coherent Risk Measurescited by 76
  22. 2022Sharp-MAML: Sharpness-Aware Model-Agnostic Meta Learningcited by 58
  23. 2019Risk Averse Robust Adversarial Reinforcement Learningcited by 57
  24. 2022Entropy-based Active Learning for Object Detection with Progressive Diversity Constraintcited by 53
  25. 2013Streaming Variational Bayescited by 48
  26. 2020Data-efficient Domain Randomization with Bayesian Optimizationcited by 47
  27. 2022Efficient Risk-Averse Reinforcement Learningcited by 43
  28. 2015Simple regret for infinitely many armed banditscited by 39
  29. 2020Doubly Stochastic Variational Inference for Neural Processes with Hierarchical Latent Variablescited by 33
  30. 2021Risk-Averse Bayes-Adaptive Reinforcement Learningcited by 29
  31. 2024LLM-Empowered State Representation for Reinforcement Learningcited by 28
  32. 2018Been There, Done That: Meta-Learning with Episodic Recallcited by 26
  33. 2023Beyond Uniform Sampling: Offline Reinforcement Learning with Imbalanced Datasetscited by 24
  34. 2024Latent Reward: LLM-Empowered Credit Assignment in Episodic Reinforcement Learningcited by 23
  35. 2024Doubly Mild Generalization for Offline Reinforcement Learningcited by 21
  36. 2025Model Predictive Task Sampling for Efficient and Robust Adaptationcited by 21
  37. 2023Supported Trust Region Optimization for Offline Reinforcement Learningcited by 20
  38. 2023Domain Randomization via Entropy Maximizationcited by 19

50 most cited of 63 All 63 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

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

12 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Distributionally Robust Multi-Task Reinforcement Learning via Adaptive Task Sampling
  2. 2024Safe and Robust Reinforcement Learning: Principles and Practice
  3. 2024Distributionally Robust Reinforcement Learning with Interactive Data Collection: Fundamental Hardness and Near-Optimal Algorithms
  4. 2025Prompt-Tuning Bandits: Enabling Few-Shot Generalization for Efficient Multi-Task Offline RL
  5. 2025Adversarial Diffusion for Robust Reinforcement Learning
  6. 2025Robust Bayesian Dynamic Programming for On-policy Risk-sensitive Reinforcement Learning
  7. 2025Coreset-Based Task Selection for Sample-Efficient Meta-Reinforcement Learning
  8. 2024Pessimism Meets Risk: Risk-Sensitive Offline Reinforcement Learning