paper-with-me

홈 › Papers

CHASE: Competing Hypotheses for Ambiguity-Aware Selective Prediction

2026-05-02 · Kartik Jhawar, Yuhao Geng, Atul N. Parikh, Lipo Wang arxiv

Standard selective prediction methods typically estimate uncertainty from the output of a single predictive branch. While effective for general uncertainty estimation, these approaches often struggle under partial observability, where local temporal evidence can be contradictory and standard confidence scores become misleading. We introduce CHASE (Competing Hypotheses for Ambiguity-Aware Selective Prediction), a selective prediction framework that explicitly compares structured temporal explanations to determine whether to commit to a decision or abstain. Because genuine ambiguity causes the score gap between competing hypotheses to collapse, CHASE optimizes a ranking-aware selector over these hypothesis margins to globally separate safe commitments from fundamentally uncertain ones. We evaluate this framework on the problem of hidden connectivity inference, utilizing a controlled, physically grounded simulator inspired by the dynamics of giant unilamellar vesicles (GUVs), alongside zero-shot qualitative transfer (without retraining or fine tuning) to representative real GUV videos. Our experiments demonstrate that explicitly reasoning over competing hypotheses provides a superior balance of metrics. Compared to canonical uncertainty baselines, CHASE achieves statistically significant gains in overall no-abstain accuracy, three-way accuracy, and overall ambiguity-aligned abstention (at 80% coverage). Specifically, it yields up to an 11.0% relative mean improvement in overall alignment, alongside up to an 8.8% relative boost in three-way accuracy in the very-high ambiguity regime. By maintaining a selective risk boundary strictly at par with the best baselines at 80% coverage, and reducing overall risk by 9.9% at 90% coverage, this framework offers a more reliable approach to decision-making under structured ambiguity.

📄 PDF Abstract BibTeX arXiv:2605.01346

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Competition over data: how does data purchase affect users?

2022-01-26 · Yongchan Kwon, Antonio Ginart, James Zou

As machine learning (ML) is deployed by many competing service providers, the underlying ML predictors also compete against each other, and it is increasingly important to understand the impacts and biases from such comp…

Active Learning

SAVTrack: Selective Vote Aggregation for Reliability-Aware Point Cloud Tracking

2026-09-15 · Sifan Zhou, Linyue Tan, Qiwei Wang, Ziyu Zhao 외 arxiv

3D single object tracking (SOT) in LiDAR point clouds is essential for autonomous systems, but remains challenging under sparse and incomplete observations. In such cases, different target points provide highly uneven co…

Object TrackingPoint Clouds

Entropic Claim Resolution: Uncertainty-Driven Evidence Selection for RAG

2026-03-30 · Davide Di Gioia arxiv

Current Retrieval-Augmented Generation (RAG) systems predominantly rely on relevance-based dense retrieval, sequentially fetching documents to maximize semantic similarity with the query. However, in knowledge-intensive …

Semantic Similarity

Extracting Important Tokens in E-Commerce Queries with a Tag Interaction-Aware Transformer Model

2025-07-14 · Md. Ahsanul Kabir, Mohammad Al Hasan, Aritra Mandal, Liyang Hao 외 arxiv

The major task of any e-commerce search engine is to retrieve the most relevant inventory items, which best match the user intent reflected in a query. This task is non-trivial due to many reasons, including ambiguous qu…

Tracing Facts or just Copies? A critical investigation of the Competitions of Mechanisms in Large Language Models

2025-07-16 · Dante Campregher, Yanxu Chen, Sander Hoffman, Maria Heuss arxiv

This paper presents a reproducibility study examining how Large Language Models (LLMs) manage competing factual and counterfactual information, focusing on the role of attention heads in this process. We attempt to repro…