Unverified50% confidenceFactExact time
Through a parity-coupling construction, the paper proves that for the subtask empirical risk minimizer, when T≤n, the expected final task risk is at least the optimal in-class risk plus Ω(√(T/n)), showing that the upper bound is tight in order.
1
Sources
50%
Confidence
Long-term
Relevance
11/5/2026
First Seen
Sources
Related Entities
Related Claims
UnverifiedThe OOD task risk upper bound given in the paper is controlled by the sum of the ID subtask risks, with a scaling coefficient on the order of O(k) that is independent of the number of reasoning steps T, where k is the number of output tokens per step.76% similarUnverifiedThe researchers adapted the risk-seeking objective function from risk-sensitive optimization to the state preparation scenario; this strategy actively sacrifices average fidelity in exchange for a significant improvement in the fidelity of some pure states in the ensemble.70% similarUnverifiedA high-probability upper bound means that with probability at least 1−δ the regret does not exceed some expression in terms of the number of rounds T, which is stronger than a bound in the expectation sense.70% similarUnverifiedThe paperclip maximizer is Bostrom's thought experiment, revealing that danger does not necessarily come from malicious goals—a misspecified goal combined with sufficiently powerful optimization capability can be equally catastrophic.69% similarUnverifiedPOMDP的转移概率、观测模型、奖励函数参数一旦估计失准，求解出的最优策略可能不如保守的阈值规则可靠，对初学者小项目而言存在过度工程风险69% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/1138329API
curl https://kongchang.com/api/v1/knowledge/claims/1138329MCP
get_claim(id=1138329)