AI Paper Atlas

Research map / Learning theory and algorithms / Prediction and decision losses

Unifying and Optimizing Data Values for Selection via Sequential Decision-Making

Hongliang Chi, Qiong Wu, Zhengyi Zhou, Jonathan Light, Emily Dodwell, Yao Ma

ICML 2026 · Learning theory and algorithms › Prediction and decision losses · approach: Adaptive testing and experiments · 0 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
rank by existing game-theoretic data values instead of optimal sequential selection (DP)Best existing data value per dataset · 8 OpenML datasetsrelative performance drop vs optimal: 8.39% to 23.76% below optimalHurt
increase within-class feature averaging to raise substitutability (curvature proxy) (ablation)Shapley, BetaShapley, Banzhaf · Synthetic message-passing datamean accuracy: Shapley 0.738 -> 0.595; BetaShapley 0.706 -> 0.597; Banzhaf 0.720 -> 0.590Hurt
replace linear surrogate with bipartite coverage surrogate for utility approximationData selection utility model · Utility approximation (test)MSE: 0.089 -> 0.019Improved
use bipartite graph greedy selection instead of game-theoretic valuesOpenML data selection · Budget 500, average over 8 datasetsaverage accuracy: 0.821 -> 0.828 vs BetaShapImproved
larger selection budget (500) narrows gap between methodsBipartite vs game-theoretic values · Budget 500accuracyNo clear effect
use coverage-prioritized BipCov selection instead of similarity-only RDS+Llama-3.1-8B LoRA fine-tuning · DATE-LM (MMLU/GSM8K/BBH average)average accuracy (%): 62.88 -> 63.89Improved
BipCov versus random selection on DATE-LMLlama-3.1-8B LoRA fine-tuning · DATE-LM averageaverage accuracy (%): 62.82 -> 63.89Improved
ranking by semi-values on highly redundant datasetsShapley, Banzhaf, Beta Shapley · Highly redundant dataselection optimality guarantee: U(S_k) >= (1-c)^2 U(OPT_k)Hurt

Earlier methods this paper compares with

Named baselines from earlier accepted papers in this paper's results tables: better than 0 of 1 on most shared results.

Matched by method name in results tables read by AI. Authors' own tables tend to favour the newer method, and a comparison can be missed when a method is renamed.

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy