English
Related papers

Related papers: The Confidence Gate Theorem: When Should Ranked De…

200 papers

Safety benchmark scores provide incomplete evidence of deployment readiness: aligned language models often adhere to rigid rules even when a situational update flips which action is safe. We term this failure brittle safety. To diagnose it,…

Artificial Intelligence · Computer Science 2026-05-28 Dasol Choi , Alex Kwon

Rankings are central to decision-making in fields ranging from education to online platforms, yet classical deterministic methods such as the Borda count method or Copeland-type pairwise methods ignore uncertainty due to sampling noise or…

Methodology · Statistics 2026-05-20 Shunpu Zhang

We investigate the challenge of establishing stochastic-like guarantees when sequentially learning from a stream of i.i.d. data that includes an unknown quantity of clean-label adversarial samples. We permit the learner to abstain from…

Machine Learning · Computer Science 2025-04-22 Carolin Heinzler

Abstaining classifiers have the option to refrain from providing a prediction for instances that are difficult to classify. The abstention mechanism is designed to trade off the classifier's performance on the accepted data while ensuring a…

Machine Learning · Computer Science 2025-04-15 Daphne Lenders , Andrea Pugnana , Roberto Pellungrini , Toon Calders , Dino Pedreschi , Fosca Giannotti

An agent must act on the situation before it, learn what it cannot yet represent, and model other agents well enough to coordinate. These faculties are usually realized by separate mechanisms, yet they share a failure mode: the situation…

Neurons and Cognition · Quantitative Biology 2026-05-26 Chainarong Amornbunchornvej

Rankings derived from pairwise comparisons are central to many economic and computational systems. In the context of large language models (LLMs), rankings are typically constructed from human preference data and presented as leaderboards…

Computation and Language · Computer Science 2026-03-05 Angel Rodrigo Avelar Menendez , Yufeng Liu , Xiaowu Dai

We explore the problem of binary classification in machine learning, with a twist - the classifier is allowed to abstain on any datum, professing ignorance about the true class label without committing to any prediction. This is directly…

Machine Learning · Computer Science 2015-12-29 Akshay Balsubramani

Sequential decision-making systems routinely operate with missing or incomplete data. Classical reinforcement learning theory, which is commonly used to solve sequential decision problems, assumes Markovian observability, which may not hold…

Machine Learning · Computer Science 2025-08-07 MaryLena Bleile , Minh-Nhat Phung , Minh-Binh Tran

Reinforcement learning post-training has substantially improved the reasoning accuracy of vision-language models, yet the resulting policies remain poorly calibrated. Terminal correctness rewards provide no gradient that penalizes confident…

Machine Learning · Computer Science 2026-05-19 Peng Cui , Boyao Yang , Jun Zhu

Architecture Decision Records (ADRs) play a critical role in preserving the rationale behind system design, yet their creation and maintenance are often neglected due to the associated authoring overhead. This paper investigates whether…

Software Engineering · Computer Science 2026-04-16 Aviral Gupta , Rudra Dhar , Daniel Feitosa , Karthik Vaidhyanathan

Integrating Chain-of-Thought (CoT) reasoning into Semantic ID-based recommendation foundation models (such as OpenOneRec) often paradoxically degrades recommendation performance. We identify the root cause as textual inertia from the…

Information Retrieval · Computer Science 2026-02-19 Luankang Zhang , Yonghao Huang , Hang Lv , Mingjia Yin , Liangyue Li , Zulong Chen , Hao Wang , Enhong Chen

We develop confidence bounds that hold uniformly over time for off-policy evaluation in the contextual bandit setting. These confidence sequences are based on recent ideas from martingale analysis and are non-asymptotic, non-parametric, and…

Machine Learning · Computer Science 2021-02-19 Nikos Karampatziakis , Paul Mineiro , Aaditya Ramdas

This work introduces a novel framework for evaluating LLMs' capacity to balance instruction-following with critical reasoning when presented with multiple-choice questions containing no valid answers. Through systematic evaluation across…

Computation and Language · Computer Science 2025-06-03 Gracjan Góral , Emilia Wiśnios , Piotr Sankowski , Paweł Budzianowski

The ability to uncover preferences from choices is fundamental for both positive economics and welfare analysis. Overwhelming evidence shows that choice is stochastic, which has given rise to random utility models as the dominant paradigm…

General Economics · Economics 2018-11-07 Carlos Alos-Ferrer , Ernst Fehr , Nick Netzer

In this work, we consider a binary classification problem and cast it into a binary hypothesis testing framework, where the observations can be perturbed by an adversary. To improve the adversarial robustness of a classifier, we include an…

Machine Learning · Computer Science 2021-10-01 Abed AlRahman Al Makdah , Vaibhav Katewa , Fabio Pasqualetti

This paper studies how violations of structural assumptions like expected utility and exponential discounting can be connected to basic rationality violations, even though these assumptions are typically regarded as independent building…

Theoretical Economics · Economics 2024-02-20 Xi Zhi Lim

Retrieval Augmented Generation (RAG) enhances language model performance by incorporating external knowledge retrieved from large corpora, which makes it highly suitable for tasks such as open domain question answering. Standard RAG systems…

Information Retrieval · Computer Science 2025-12-17 Malika Iratni , Mohand Boughanem , Taoufiq Dkaki

We construct a binary mixed-regime process with one deterministic textual regime and one random regime governed by an unobserved latent state. Even an ideal infinite-capacity sequence predictor that exactly recovers the text-only marginal…

Computation and Language · Computer Science 2026-05-27 Francesco Corielli

We study the key framework of learning with abstention in the multi-class classification setting. In this setting, the learner can choose to abstain from making a prediction with some pre-defined cost. We present a series of new theoretical…

Machine Learning · Computer Science 2024-04-02 Anqi Mao , Mehryar Mohri , Yutao Zhong

Today, data analysts largely rely on intuition to determine whether missing or withheld rows of a dataset significantly affect their analyses. We propose a framework that can produce automatic contingency analysis, i.e., the range of values…

Databases · Computer Science 2020-04-09 Xi Liang , Zechao Shang , Aaron J. Elmore , Sanjay Krishnan , Michael J. Franklin