Epistemic Uncertainty for Test-Time Discovery

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Riaz, Kainat, Mohsin, Muhammad Ahmed, Bilal, Ahsan, Umer, Muhammad, Mohsin, Ayesha, Riaz, Aqib, Subhan, Ali, Cioffi, John M.
Format: Preprint
Publié: 2026
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866911672820563968
author Riaz, Kainat
Mohsin, Muhammad Ahmed
Bilal, Ahsan
Umer, Muhammad
Mohsin, Ayesha
Riaz, Aqib
Subhan, Ali
Cioffi, John M.
author_facet Riaz, Kainat
Mohsin, Muhammad Ahmed
Bilal, Ahsan
Umer, Muhammad
Mohsin, Ayesha
Riaz, Aqib
Subhan, Ali
Cioffi, John M.
contents Automated scientific discovery using large language models relies on identifying genuinely novel solutions. Standard reinforcement learning penalizes high-variance mutations, which leads the policy to prioritize familiar patterns. As a result, the maximum reward plateaus even as the average reward increases. Overcoming this limitation requires a signal that distinguishes unexplored regions from intrinsically difficult problems. This necessitates measuring disagreement across independently adapted weight hypotheses rather than relying on a single network's confidence. UG-TTT addresses this challenge by maintaining a small ensemble of low-rank adapters over a frozen base model. The per-token disagreement, quantified as the mutual information between ensemble predictions and weight hypotheses, isolates epistemic uncertainty and identifies positions where insufficient coverage leads to adapter divergence rather than intrinsic problem difficulty. This measure is incorporated as an exploration bonus into the policy gradient, directing the policy toward positions where persistent adapter disagreement signals low training coverage, the same frontier where genuine discovery is possible. A nuclear norm regularizer ensures the adapters remain distinct from one another, thereby preserving the exploration signal throughout training. Across four scientific discovery benchmarks, UG-TTT increases the maximum reward on three tasks, maintains substantially higher solution diversity, and an ablation study confirms that the regularizer is essential for sustaining this behavior.
format Preprint
id arxiv_https___arxiv_org_abs_2605_11328
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Epistemic Uncertainty for Test-Time Discovery
Riaz, Kainat
Mohsin, Muhammad Ahmed
Bilal, Ahsan
Umer, Muhammad
Mohsin, Ayesha
Riaz, Aqib
Subhan, Ali
Cioffi, John M.
Machine Learning
Artificial Intelligence
Automated scientific discovery using large language models relies on identifying genuinely novel solutions. Standard reinforcement learning penalizes high-variance mutations, which leads the policy to prioritize familiar patterns. As a result, the maximum reward plateaus even as the average reward increases. Overcoming this limitation requires a signal that distinguishes unexplored regions from intrinsically difficult problems. This necessitates measuring disagreement across independently adapted weight hypotheses rather than relying on a single network's confidence. UG-TTT addresses this challenge by maintaining a small ensemble of low-rank adapters over a frozen base model. The per-token disagreement, quantified as the mutual information between ensemble predictions and weight hypotheses, isolates epistemic uncertainty and identifies positions where insufficient coverage leads to adapter divergence rather than intrinsic problem difficulty. This measure is incorporated as an exploration bonus into the policy gradient, directing the policy toward positions where persistent adapter disagreement signals low training coverage, the same frontier where genuine discovery is possible. A nuclear norm regularizer ensures the adapters remain distinct from one another, thereby preserving the exploration signal throughout training. Across four scientific discovery benchmarks, UG-TTT increases the maximum reward on three tasks, maintains substantially higher solution diversity, and an ablation study confirms that the regularizer is essential for sustaining this behavior.
title Epistemic Uncertainty for Test-Time Discovery
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2605.11328