Quasi-Monte Carlo Initialization for Meta-Reinforcement Learning

arXiv:2607.21637v1 Announce Type: new Abstract: This paper explores the efficacy of quasi-Monte Carlo (QMC) weight initialization for meta-reinforcement learning within modern benchmark environments. Various sampling methods are used to bound a population-based search and aggregate an optimal prior from a baseline set of tasks. The QMC meta-priors show improvements in training convergence compared to modern orthogonal (SB3) defaults when extrapolated to similar unseen continuous control environments. In dissimilar tasks, the orthogonal orientation was globally superior for an unbiased search.

Related

• A Self-Attentive Meta-Optimizer with Group-Adaptive Learning Rates and Weight Decay
• RANDPOL: Parameter-Efficient End-to-End Quadruped Locomotion via Randomized Policy Learning
• Does Weight Decay Enhance Training Stability?
• Beyond Backpropagation: Monte Carlo Method Can Train Deep Neural Networks

Source: arXiv cs.LG | 2026-07-27