This work demonstrates a concrete failure mode where frontier models exhibit invisible reasoning by leveraging semantically irrelevant filler tokens to improve performance on synthetic reasoning tasks and indicates that frontier models already perform consequential computation with no interpretable trace in their output tokens.
Vatsal Baherwani, Tom Goldstein, Ashwinee Panda· arXiv.org· 4 citations· ⚡2
LM-X is introduced, which organizes prediction across task, event, and motor scales without claiming anatomical correspondence and shows that explicit multi-timescale predictive state can strengthen control while exposing interpretable internal estimates.
Jin Lou, Zhi Jing, Xu-Peng Wang et al.· 0 citations
A unified framework, KENDO (Kernel ENsemble Disagreement-aware Operator), is proposed that integrates Ensemble Gaussian Processes (EGP) with disagreement-aware acquisition strategies and extends the approach to multi-objective optimization via random scalarization that preserves the single-optimizer conditioning structure.
Heng Zhang, Hao-Tian Xiang, Konstantinos D. Polyzos et al.· 1 citation
These results establish a world-model design for QAS whose value lies in decision-useful feedback rather than exact energy prediction, and establish a world-model design for QAS whose value lies in decision-useful feedback rather than exact energy prediction.
Jiayang Niu, Yan Wang, Jie Li et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Adaptive Confidence-weighted Expansion (ACE), a novel framework to enhance the trustworthiness of multimodal fusion models, provides a more stable and robust data fusion method that facilitates the use of multimodal learning in addressing high-stakes problems.
Mohammad Raahemi, Ali Sekhavati, Alireza Maleki et al.· International Conference on...· 0 citations
A no-go theorem is used to separate four versions of neural network field theory, according to whether the defining object is the finite width ensemble or its infinite width limit, and whether the target the authors want to compute is a quantum or an effective field theory.
A novel formulation of a Wasserstein-2 metric that uses the Bures-Wasserstein (BW) metric over probability measures with finite second moments is developed, which allows the worst-case distribution to endogenously determine both how many mixture components receive mass and where their means and covariances lie within a continuous support.
Sampling from discrete Markov random fields (MRFs) is a hard problem and amplitude-encoded i.i.d. sampling for small MRFs where $2^n$ target probabilities are precomputed classically is studied to allow a clean comparison against classical MCMC based on independent circuit samples.
Semantic caching cuts LLM inference costs by serving a cached response to semantically similar queries. Standard practice evaluates these systems using PR-AUC, a metric that only measures how well scores rank and ignores whether they are usable at a fixed threshold. We show this mismatch leads to systematically poor deployment choices, as models with the highest PR-AUC are often the worst in operation. We introduce Precision--Cache Hit Ratio (P-CHR) AUC, a cache-aware metric that measures precision across cache utilization levels, and Operational Retention Rate (ORR), which captures how much offline ranking quality survives at deployment. We decompose the operational gap between offline and deployed quality into a recoverable threshold-utility component and an irreducible structural component fixed by the dataset's positive rate. Our experiments show that the threshold-utility gap is governed by the training objective rather than data scale, and yields only to re-normalizing scores over the candidate pool or changing the training objective. Ultimately, model selection for semantic caching is a threshold-utility problem, not a ranking one, and measuring it is the first step to closing the gap.
Numerical benchmarks show substantial accuracy of WINO together with total training times of about 15%-70% of those of supervised $\varphi$-FEM-FNO across all cases, without requiring reference-solution generation.
An online multiclass L2D algorithm that combines queried-action bandit feedback with a dynamically varying pool of experts is introduced that achieves expected true-deferral regret under a concentrated-score condition.
Duy Hoang Dang, Yannis Montreuil, Maxime Meyer et al.· arXiv.org· 5 citations
DiffAnon is proposed, a diffusion-based anonymization method with classifier-free guidance (CFG) that provides explicit, continuous inference-time control over prosody preservation, and is the first voice anonymization framework to provide structured, interpolatable inference-time prosody control.
Ismail Rasim Ulgen, Zexin Cai, Nicholas Andrews et al.· arXiv.org· 0 citations
A weeklong summer workshop brought higher education faculty to campus to explore how AI and machine learning materials can be adapted for their classrooms.
Adaptive AI agents can help make BIM data more machine-readable by navigating IFC models, interpreting inconsistent information, and mapping it to defined standards. In this blog, Alok Rawat shares findings from a real-world pilot in construction workflows. The post Adaptive AI Agents in Construction Workflows appeared first on GPT-Lab.
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
