Safe decision-making under uncertainty requires two things simultaneously: learning about the world (exploration) and avoiding catastrophic outcomes (safety constraints). Standard online learning algorithms optimize regret — the gap between your cumulative performance and the best fixed action in hindsight. But regret minimization alone doesn't prevent dangerous actions along the way.
The authors (arXiv:2603.22348) develop COMPASS-Hedge, a hedging-based algorithm that maintains safety guarantees without knowing the world model in advance. The algorithm maintains a portfolio of experts (potential policies) and adjusts weights based on observed outcomes, but with an additional constraint: the weighted combination must satisfy safety requirements at every step, not just on average.
The “hedge” is literal — the portfolio diversification provides game-theoretic guarantees. No matter what sequence of outcomes the environment produces, the algorithm's cumulative performance is bounded relative to the best safe expert. The safety constraint isn't an aspiration; it's a hard bound enforced by the portfolio structure.
The through-claim: safe learning isn't a modified version of regret minimization — it's a constrained portfolio problem. The hedge doesn't just learn which actions are good; it maintains feasibility of the safety constraint at every step. The safety comes from diversification across experts, not from accurate prediction of any single outcome.