mlsanityData to 7 Oct 2026

Deep Actor-Critics with Tight Risk Certificates

arXiv 2505.19682 ↗First posted 26 May 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Deep actor-critic algorithms have reached a level where they influence everyday life. They are a driving force behind continual improvement of large language models through user feedback. However, their deployment in physical systems is not yet widely adopted, mainly because no validation scheme fully quantifies their risk of malfunction. We demonstrate that it is possible to develop tight risk certificates for deep actor-critic algorithms that predict generalization performance from validation-time observations. Our key insight centers on the effectiveness of minimal evaluation data. A small feasible set of evaluation roll-outs collected from a pretrained policy suffices to produce accurate risk certificates when combined with a simple adaptation of PAC-Bayes theory. Specifically, we adopt a recently introduced recursive PAC-Bayes approach, which splits validation data into portions and recursively builds PAC-Bayes bounds on the excess loss of each portion's predictor, using the predictor from the previous portion as a data-informed prior. Our empirical results across multiple locomotion tasks, actor-critic methods, and policy expertise levels demonstrate risk certificates tight enough to be considered for practical use.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 43 of its 67 references that are in the map. First posted on arXiv 26 May 2025.

Builds on

43 of 67 references.

References · 43

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2017Proximal Policy Optimization Algorithmscited by 14,441
  4. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,635
  5. 2017Deep reinforcement learning from human preferencescited by 3,846
  6. 2015Continuous control with deep reinforcement learningcited by 3,279
  7. 2018Addressing Function Approximation Error in Actor-Critic Methodscited by 2,302
  8. 2019Fine-Tuning Language Models from Human Preferencescited by 2,124
  9. 2016OpenAI Gymcited by 1,684
  10. 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
  11. 2019Meta-World: A Benchmark and Evaluation for Multi-Task and Meta Reinforcement Learningcited by 1,168
  12. 2018DeepMind Control Suitecited by 935
31 more
  1. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
  2. 2017Minimax Regret Bounds for Reinforcement Learningcited by 500
  3. 2015Variational Dropout and the Local Reparameterization Trickcited by 489
  4. 2023Efficient Online Reinforcement Learning with Offline Datacited by 332
  5. 2021Randomized Ensembled Double Q-Learning: Learning Fast Without a Modelcited by 278
  6. 2021User-friendly introduction to PAC-Bayes boundscited by 234
  7. 2013(More) Efficient Reinforcement Learning via Posterior Samplingcited by 233
  8. 2017Unifying PAC and Regret: Uniform PAC Bounds for Episodic Reinforcement Learningcited by 175
  9. 2020Tighter risk certificates for neural networkscited by 112
  10. 2023STORM: Efficient Stochastic Transformer based World Models for Reinforcement Learningcited by 88
  11. 2016PAC-Bayesian Theory Meets Bayesian Inferencecited by 87
  12. 2016Understanding and Improving Convolutional Neural Networks via Concatenated Rectified Linear Unitscited by 86
  13. 2017Entropy-SGD optimizes the prior of a PAC-Bayes bound: Generalization properties of Entropy-SGD and data-dependent priorscited by 81
  14. 2022PAC-Bayes Compression Bounds So Tight That They Can Explain Generalizationcited by 75
  15. 2020On the role of data in PAC-Bayes boundscited by 64
  16. 2016A Strongly Quasiconvex PAC-Bayesian Boundcited by 54
  17. 2019PAC-Bayes Un-Expected Bernstein Inequalitycited by 36
  18. 2019PAC-Bayes with Backpropcited by 36
  19. 2018Learning Gaussian Processes by Minimizing PAC-Bayesian Generalization Boundscited by 24
  20. 2021How Tight Can PAC-Bayes be in the Small Data Regime?cited by 24
  21. 2022Sim-to-Lab-to-Real: Safe Reinforcement Learning with Shielding and Generalization Guaranteescited by 24
  22. 2022From Dirichlet to Rubin: Optimistic Exploration in RL without Bonusescited by 22
  23. 2019PAC-Bayesian Contrastive Unsupervised Representation Learningcited by 20
  24. 2023Statistical Guarantees for Variational Autoencoders using PAC-Bayesian Theorycited by 16
  25. 2023PAC-Bayesian Generalization Bounds for Adversarial Generative Modelscited by 13
  26. 2022Optimistic Posterior Sampling for Reinforcement Learning with Few Samples and Tight Guaranteescited by 12
  27. 2022Split-kl and PAC-Bayes-split-kl Inequalities for Ternary Random Variablescited by 11
  28. 2022A Note on the Chernoff Bound for Random Variables in the Unit Intervalcited by 7
  29. 2024Deep Exploration with PAC-Bayescited by 4
  30. 2024Recursive PAC-Bayes: A Frequentist Approach to Sequential Prior Updates with No Information Losscited by 4
  31. 2023PAC-Bayesian Soft Actor-Critic Learningcited by 3

Built on by

Not cited yet.