EPIG-Tree: Compute-Optimal Branching for Gradient-Efficient Reinforcement Learning

A technical machine-learning paper proposing a more compute-efficient branching method for reinforcement learning, with no direct safety or governance implications.

Auto-scored: An incremental efficiency improvement in RL methods, not a documented risk event or safety mitigation.