This work investigates how large language models acquire metacognitive monitoring, the ability to know what one knows, by training 10 open-weight LLMs to predict their own accuracy on factual multiple-choice questions before answering them and finds that trained confidence reflects two distinct signals.
Nicolas Yax, Stefano Palminteri, P. Oudeyer· 0 citations
These findings motivate a state-action controller that starts from the base model action and selectively edits it using structural readouts, without requiring a complete predicted belief state as an intermediate representation.
This work studies two forms of demonstration, collated and interleaved demonstration, across six encoder-decoder models, spanning conventional cross-attention-based and LLM-based architectures and suggests that in-context adaptation for ASR is not unique to specific architectures, training, or demonstration approaches.
LA-CPD is proposed, a structured method that transforms noisy sentence-level score sequences into coherent authorship segments and outperforms WCP+AIC, increasing sentence-level accuracy from 0.747 to 0.796 while improving boundary localization and LLM-span delineation.
Qing Yang, Zhen-Yun Mao, Zi-Xiang Luo et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Large language models are increasingly used as interactive writing tools, where users develop stories, revise ideas, and introduce new requirements across multiple turns rather than specifying a complete brief upfront. Yet most evidence on multi-turn instruction degradation comes from tasks with objectively verifiable...
Anshuman Singh, Abrar Eyasir, Haseeb Yaqoob et al.· 0 citations
This paper identifies Unicode's NFC normalization stability policy as the structural constraint that prevents a straightforward fix, arguing for direct intervention of the Consortium in solving the active problem, and proposing a formal encoding request for the four core Yor\`ub\'a characters as the most durable path t...
CoCal is introduced, which trains a lightweight companion from rollout hidden states and verifier-derived correctness supervision while leaving task optimization unchanged, and shows that CoCal improves confidence estimation without sacrificing task performance, outperforming both RL-based concurrent methods and matche...
Shi-Yu Ni, Ke-Ping Bi, Jia-Feng Guo et al.· 0 citations
Generative workflows improve structural reliability and reduce judged defects on short passages, while their large recovery advantage on long documents disappears after chunking, suggesting that reference recovery alone understates alignment quality.
Grounded language models are usually evaluated by adding relevant context, but multiturn dialogue also contains unsupported user claims that may contaminate later factual answers. We study post-pressure recoverability: whether a model returns to clean-context behavior after a user repeatedly advocates a wrong answer an...
This work argues that the fix is to change the generation target: instead of asking an LLM to emit dialect-specific SQL, it has it emit a dialect-agnostic relational algebra query plan, which a deterministic compiler then renders into SQL for any supported backend.
Corentin Royer, Robin Oester, Yotam Perlitz et al.· 0 citations
Human communication on the internet is shaped by diverse perspectives, most visibly expressed in online comment spaces. As large language model (LLM)based AI agents begin to inhabit these spaces, a key question arises: whether synthetic comment threads can capture the diversity inherent in human discourse. This concern...
Nafis Irtiza Tripto, Delvin Ce Zhang, Mahjabin Nahar et al.· 0 citations
A speech neuroprosthesis decodes attempted speech from brain activity and ends by rescoring the decoder's candidate sentences with a language model of several billion parameters, the only component that needs a GPU. Replacing that model with a cheaper one is hard: general language models asked to pick one sentence from...
A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.
Microsoft Research Blog· microsoft.comOct 15, 2026
Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduSep 24, 2026
A new method, called CW-Net, translates the reasoning process of an autonomous vehicle’s AI system into understandable concepts that explain its behavior.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.