The hypothesis that stateful retrieval may be easier to learn than stateless retrieval is motivated, which motivates the hypothesis that stateful retrieval may be easier to learn than stateless.
It is argued for a benchmarking protocol that fixes the model, data, and sampling parameters and that reports relative-error metrics alongside absolute ones, confirming that system error dominates model error.
Hao-Wen Shi, Xu-Zhe Yan, Fa-Hao Chen et al.· 0 citations
Scalable oversight asks how a weak verifier can check the outputs of computations performed by more powerful AI systems. One proposed approach uses relativizing interactive proofs, in which a weak verifier checks the output of a complex oracle-aided computation by interacting with one or more powerful provers. A promin...
Zi-Yi Guan, Y. Kalai, Ron D. Rothblum et al.· 0 citations
AI has made remarkable progress in mathematics, solving challenging problems with machine-checkable proofs in Lean, yet typically relying on predefined mathematical definitions and formal specifications. This raises a natural question: can it reason rigorously about an unknown world? We introduce the Algebraic World Mo...
Guan-Cheng Pan, Qi-Xin Tan, Yang Yuan et al.· 0 citations
Reach audiences
Advertise in front of researchers, engineers, and readers.
Financial AI workflows that reuse investor knowledge need persistent memory that integrates observations across sources and periods without losing identity or provenance. In a knowledge graph, recurring observations may use different surface forms, fragmenting relationship histories and preventing evidence from accumul...
In psychiatric practice, the clinical intake interview remains a primary diagnostic instrument, requiring the clinician to establish rapport while disentangling complex, overlapping presentations. Here, we show that multi-turn reinforcement learning (RL) in simulation environments improves language model performance on...
Samuel Schmidgall, Tim Strother, Alex Bijamov et al.· 0 citations
Tool-use benchmarks often score agents by final task success, but terminal outcomes can obscure whether the intermediate tool-call trajectory was executable. We propose prefix executability as a trajectory-level evaluation protocol for tool-using agents. The protocol measures whether every prefix of a predicted tool-ca...
Amir H. Rezaeian, Weiyi Sun, Yassine Benajiba et al.· 0 citations
On-policy state training, which trains the encoder on the states it reaches itself, which retrieves complete evidence more often than teacher-forced training and the systems the authors compare, and it transfers without further training to harder long-chain variants of HotpotQA and 2WikiMultiHopQA that are constructed.
Chen-Jie Qiu, Zi-Xuan Zeng, Shao-Bin Shi et al.· 0 citations
The last year has seen a shift in AI-assisted mathematics, with frontier language models producing proofs of and counterexamples to long-standing open conjectures. However, studying only the current set of major breakthroughs provides an incomplete picture of LLM capabilities and the computational resources needed to a...
Helen Jenne, Davis Brown, Jesse He et al.· 0 citations
As the effects of climate change become increasingly apparent, the demand for renewable energy sources such as wind power continues to grow. However, renewables' variable and intermittent nature presents significant challenges in their integration into energy grids. Artificial intelligence (AI) has emerged as a powerfu...
Large language models (LLMs) are increasingly capable, yet they produce wrong answers indistinguishable from correct ones. In question answering (QA), such an error propagates unnoticed into downstream tasks. Perturbation-based uncertainty quantification (UQ) addresses this by probing a model over a set of input rewrit...
Mesut Ceylan, Arda Baris Basaran, Elgar Fleisch et al.· 0 citations
We revisit advantage estimation in Group Relative Policy Optimization (GRPO) and observe that any token-level advantage admits a two-stage factorization: a \emph{sample-level baselining} step that converts scalar verifier rewards into a comparable sequence-level signal, and a \emph{token-level credit assignment} step t...
Lang Chen, Zong-Xin Xu, Bo-Rui Wang et al.· 0 citations