Coarsened-consistent panel operators with a closed-form Dirichlet-multinomial realization, learned completion, and rater-count transfer are defined, with modest and corpus-dependent gains, with several small or null partial-revelation differences.
Abstract
We study partial-revelation panel forecasting: given $k$ of $n$ annotator votes on the previous dialogue turn, predict the full count distribution of the next turn's panel. This cross-turn predictive information differs from same-item annotation value. Under any nested revelation mechanism, the population decrement satisfies $V(k)-V(k+1)=I(Y;R_{k+1}\mid X_k)$; a fitted model also contributes adjacent excess-risk differences. Coarsened-completely-at-random (CCAR) masking supplies the exchangeable random-rater interpretation used in our operators. We define coarsening-consistent panel operators with a closed-form Dirichlet-multinomial realization, learned completion, and rater-count transfer. Against per-level lookup, cold-start count negative log-likelihood differences are -0.422/-0.166/-0.014 nats on IEMOCAP/M3ED/EmoWOZ. A held-out rater experiment measures same-item value: first and second additional votes reduce NLL by 0.583/0.221, 0.578/0.184, and 0.180/0.069 nats, respectively. Cross-turn and same-item gains are not interchangeable, and CCAR masks are controlled interventions rather than observed arrival processes. Consistency is auditable but does not guarantee predictive improvement; per-level marginalization can outperform a shared table. Target-free allocation beats uniform only where row-level signal is predictable: at budget one it recovers 83--93% of retrospective feature class headroom on IEMOCAP/M3ED but does not improve EmoWOZ. Gains are modest and corpus-dependent, with several small or null partial-revelation differences. Code and aggregate result artifacts accompany the preprint.
The Brier risk summarizes probability-prediction error but does not explain why two prediction rules differ. We develop Brier-UDAM, a framework for paired binary prediction-rule comparisons that separates the Brier-risk difference into mean-bias, dispersion, and Brier-scale alignment contributions. Although the observa...
: Sequential elimination ranking systems decide outcomes by combining expert scores with crowd votes, yet the crowd-vote signal is rarely recorded and must be estimated from observed eliminations. This paper presents a Monte Carlo inverse framework that recovers the latent signal under temporal-smoothing priors and his...
A Bayesian replay framework for latent fan-vote estimation and voting-rule bias analysis is developed and indicates that the estimated latent fan signal is predictive and calibrated, with overall Hit@3 close to 0.69 and expected calibration error near 0.0047.
Stationarity rewards memory, but after a change the same history can mislead. We ask when forgetting should be permitted. E-process-authorized Thompson sampling (e-ATS) gives each arm full-history and discounted Beta states. An anytime-valid e-process first authorizes the discounted state, then a reversible relevance s...
On-policy distillation (OPD) provides token-level teacher feedback, yet common sampled-token updates assign credit locally and omit the effects of earlier actions on subsequent feedback. We introduce \method{} (Group-Relative On-Policy Distillation), which decouples feedback computation from credit assignment by aggreg...
Yu-Shu Wang, Ren-Kai Yang, Jing-Cao Xu et al.· 0 citations
GenCAR is proposed, which couples preference-grounded counterfactual supervision with calibrated set selection with calibrated set selection, and theoretically bound conditional counterfactual approximation error and prove finite-sample, distribution-free control of proxy-label FDR under exchangeability and positive re...
Qianqian Wang, Yun-Shan Li, Jian Zeng et al.· 0 citations
Research Manager Mike Walker reflects on a career spanning hacker culture, cybersecurity, and AI, sharing lessons about trust, teamwork, leadership, and why solving difficult problems requires curiosity, judgment, agility—and an understanding of the rules. The post Learn the rules: The hacker mindset appeared first on Microsoft Research.
Learn how Google Antigravity and our Cheminformatics Skills accelerate drug discovery workflows, search compounds, and propose novel rigidified macrocycles.
MIT News · Artificial Intelligence· news.mit.eduOct 28, 2026
Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.