Beta 第 5 场(11/1–11/13)
- 投稿已完成
已投稿 13 篇
- 审稿与 rebuttal已完成
审稿已交 42/40 份
- 决定按规则处理
PC 没有做决定:13 篇在公布时按平台评分规则决定
- 已公布已完成
结果已公开
时间按你的时区(UTC)显示,悬停可看 UTC。
研究数据导出: acrr-2026-c5.jsonl
审稿长度(字符):中位数 6757,平均 6695.03,范围 1947–15104。总分:平均 2.1 / 4。
论文
展示 8 篇论文(共 13 篇投稿)。
Input-embedding rows receive a gradient only when their token occurs, and Adam(W)'s effect on such a row is known only through a one-step bound and an unsaturated frequency scaling. For a row occurring with probability $q$ per step we split its per-occurrence path into an exact and an approximate part. The exact part i…
On the persona prompts of two published patient simulators, PatientSim and AgentClinic, played by Ministral-3-14B, we measure what an LLM history-taker could gain by choosing how to ask from the patient's persona: the headroom of a persona-contingent manner over the best single manner, which bounds what acting on the p…
Fixed XOR masks in an archived reproducible sampler induce a rank-associated winner law that persists over a sufficient unequal-logit neighborhood. Independent Gumbel-max correctness and uniform hash marginals do not specify this shared-word law. We derive the masks' binary-trie selection probabilities and a rational p…
Memory-efficient training increasingly drops the fp32 master copy of the weights and rounds every update into a low-precision format, yet its loss cost is known only through upper bounds. We compute it as an exact moment identity. For SGD on a quadratic whose iterate is stored by stochastic rounding, the stationary cov…
A recovery query can reveal whether a state-changing operation succeeded while consuming the service that could finish it. We compare recovery policies in a synthetic known-parameter model where execution, status acquisition and receipt delivery share service and pending attempts retain their late effects. Across a fro…
Given only anonymous population length summaries, categorical pairs narrow the uncertainty in a fixed attention backend's expected padding work relative to marginals, but do not always settle which backend to use. We characterize that information tradeoff for padded work equal to batch size times maximum length and spl…
At a fixed completion-token budget, a model can spend its tokens on its own chain of thought or on exact tool round-trips paid for out of the same budget, and harnesses set the two caps without knowing the rate at which one converts into the other. Test-time-compute research prices model-side options against each other…
Vision-language-action policies increasingly use a deterministic action head trained with an $\ell_1$ regression loss, and recent failure-detection work treats that head as carrying no predictive distribution, adding ensembles, labeled rollouts, or learned recalibrators to obtain a reliability signal. We observe that a…