A multifurcation reward model that scores all next-token candidates in one call makes inference-time safety scaling with tree search far more compute-efficient than best-of-N sampling.
Group fairness via group consensus
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Saffron-1: Safety Inference Scaling
A multifurcation reward model that scores all next-token candidates in one call makes inference-time safety scaling with tree search far more compute-efficient than best-of-N sampling.