中文
相关论文

相关论文: Solomonoff-Inspired Hypothesis Ranking with LLMs f…

200 篇论文

Benchmarking the capabilities of AI systems, including Large Language Models (LLMs) and Vision Models, typically ignores the impact of uncertainty in the underlying ground truth answers from experts. This ambiguity is not just limited to…

Owing to the capability of in-context learning, large language models (LLMs) have shown impressive performance across diverse mathematical reasoning benchmarks. However, we find that few-shot demonstrations can sometimes bring negative…

计算与语言 · 计算机科学 2024-12-18 Jiayu Liu , Zhenya Huang , Chaokun Wang , Xunpeng Huang , Chengxiang Zhai , Enhong Chen

Can the relative performance of a pre-trained large multimodal model (LMM) be predicted without access to labels? As LMMs proliferate, it becomes increasingly important to develop efficient ways to choose between them when faced with new…

计算机视觉与模式识别 · 计算机科学 2025-10-06 Weijie Tu , Weijian Deng , Dylan Campbell , Yu Yao , Jiyang Zheng , Tom Gedeon , Tongliang Liu

Although demonstrating remarkable performance on reasoning tasks, Large Language Models (LLMs) still tend to fabricate unreliable responses when confronted with problems that are unsolvable or beyond their capability, severely undermining…

计算与语言 · 计算机科学 2025-11-13 Boyang Xue , Qi Zhu , Rui Wang , Sheng Wang , Hongru Wang , Minda Hu , Fei Mi , Yasheng Wang , Lifeng Shang , Qun Liu , Kam-Fai Wong

Despite the outstanding performance of large language models (LLMs) across various NLP tasks, hallucinations in LLMs--where LLMs generate inaccurate responses--remains as a critical problem as it can be directly connected to a crisis of…

计算与语言 · 计算机科学 2025-07-22 Minsuh Joo , Hyunsoo Cho

The limited reasoning capabilities of small language models (SLMs) cast doubt on their suitability for tasks demanding deep, multi-step logical deduction. This paper introduces a framework called Small Reasons, Large Hints (SMART), which…

计算与语言 · 计算机科学 2025-06-03 Yujin Kim , Euiin Yi , Minu Kim , Se-Young Yun , Taehyeon Kim

Large language models (LLMs) with reasoning capabilities have fueled a compelling narrative that reasoning universally improves performance across language tasks. We test this claim through a comprehensive evaluation of 504 configurations…

计算与语言 · 计算机科学 2026-03-02 Donghao Huang , Zhaoxia Wang

Bayesian reasoning in linear mixed-effects models (LMMs) is challenging and often requires advanced sampling techniques like Markov chain Monte Carlo (MCMC). A common approach is to write the model in a probabilistic programming language…

机器学习 · 计算机科学 2025-03-25 Jinlin Lai , Justin Domke , Daniel Sheldon

Supervised Fine-Tuning (SFT) on response demonstrations combined with Reinforcement Learning from Human Feedback (RLHF) constitutes a powerful paradigm for aligning LLM-based AI agents. However, a significant limitation of such an approach…

计算与语言 · 计算机科学 2024-04-11 Zhiqing Sun , Yikang Shen , Hongxin Zhang , Qinhong Zhou , Zhenfang Chen , David Cox , Yiming Yang , Chuang Gan

The recent success of generative AI highlights the crucial role of high-quality human feedback in building trustworthy AI systems. However, the increasing use of large language models (LLMs) by crowdsourcing workers poses a significant…

人工智能 · 计算机科学 2025-11-07 Yichi Zhang , Jinlong Pang , Zhaowei Zhu , Yang Liu

Uncertainty decomposition refers to the task of decomposing the total uncertainty of a predictive model into aleatoric (data) uncertainty, resulting from inherent randomness in the data-generating process, and epistemic (model) uncertainty,…

计算与语言 · 计算机科学 2024-06-12 Bairu Hou , Yujian Liu , Kaizhi Qian , Jacob Andreas , Shiyu Chang , Yang Zhang

Partially Observable Markov Decision Processes (POMDPs) model decision making under uncertainty. While there are many approaches to approximately solving POMDPs, we aim to address the problem of learning such models. In particular, we are…

Large Language Models (LLMs) have demonstrated amazing capabilities in language generation, text comprehension, and knowledge reasoning. While a single powerful model can already handle multiple tasks, relying on a single perspective can…

计算与语言 · 计算机科学 2024-06-12 Zining Qin , Chenhao Wang , Huiling Qin , Weijia Jia

Thompson sampling is an efficient algorithm for sequential decision making, which exploits the posterior uncertainty to address the exploration-exploitation dilemma. There has been significant recent interest in integrating Bayesian neural…

机器学习 · 统计学 2020-08-07 Zhendong Wang , Mingyuan Zhou

Large language models (LLMs) are increasingly deployed in settings where the available context is incomplete or degraded. We argue that an LLM generating answers under incomplete context can be viewed as an implicit imputer, and evaluated…

机器学习 · 统计学 2026-05-14 Stef van Buuren

Large language models (LLMs) exhibit advanced reasoning skills, enabling robots to comprehend natural language instructions and strategically plan high-level actions through proper grounding. However, LLM hallucination may result in robots…

人工智能 · 计算机科学 2025-02-12 Kaiqu Liang , Zixu Zhang , Jaime Fernández Fisac

Consider the following prediction problem. Assume that there is a block box that produces bits according to some unknown computable distribution on the binary tree. We know first $n$ bits $x_1 x_2 \ldots x_n$. We want to know the…

信息论 · 计算机科学 2023-08-25 Alexey Milovanov

Large language models (LLMs) could be valuable personal AI agents across various domains, provided they can precisely follow user instructions. However, recent studies have shown significant limitations in LLMs' instruction-following…

人工智能 · 计算机科学 2025-03-31 Juyeon Heo , Miao Xiong , Christina Heinze-Deml , Jaya Narain

While LLMs have seen substantial improvement in reasoning capabilities, they also sometimes overthink, generating unnecessary reasoning steps, particularly under uncertainty, given ill-posed or ambiguous queries. We introduce statistically…

人工智能 · 计算机科学 2026-02-17 Yangxinyu Xie , Tao Wang , Soham Mallick , Yan Sun , Georgy Noarov , Mengxin Yu , Tanwi Mallick , Weijie J. Su , Edgar Dobriban

We bound the future loss when predicting any (computably) stochastic sequence online. Solomonoff finitely bounded the total deviation of his universal predictor M from the true distribution m by the algorithmic complexity of m. Here we…

机器学习 · 计算机科学 2007-07-16 Alexey Chernov , Marcus Hutter