Cover Image

Provably Adaptive Linear Approximation for the Shapley Value and Beyond

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Weida, Yu, Yaoliang, Low, Bryan Kian Hsiang
Format:	Preprint
Published:	2026
Subjects:	Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

TreeGrad-Ranker: Feature Ranking via $O(L)$-Time Gradients for Decision Trees
by: Li, Weida, et al.
Published: (2026)

One Sample Fits All: Approximating All Probabilistic Values Simultaneously and Efficiently
by: Li, Weida, et al.
Published: (2024)

Self-Interested Agents in Collaborative Machine Learning: An Incentivized Adaptive Data-Centric Framework
by: Vijayan, Nithia, et al.
Published: (2024)

Decentralized Sum-of-Nonconvex Optimization
by: Liu, Zhuanghua, et al.
Published: (2024)

Helpful or Harmful Data? Fine-tuning-free Shapley Attribution for Explaining Language Model Predictions
by: Wang, Jingtan, et al.
Published: (2024)

Understanding Domain Generalization: A Noise Robustness Perspective
by: Qiao, Rui, et al.
Published: (2024)

PC-MoE: Memory-Efficient and Privacy-Preserving Collaborative Training for Mixture-of-Experts LLMs
by: Zhang, Ze Yu, et al.
Published: (2025)

Is Data Shapley Not Better than Random in Data Selection? Ask NASH
by: Tian, Xiao, et al.
Published: (2026)

Global-to-Local Support Spectrums for Language Model Explainability
by: Agussurja, Lucas, et al.
Published: (2024)

Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates
by: Liu, Zhuanghua, et al.
Published: (2024)

Robustifying and Boosting Training-Free Neural Architecture Search
by: He, Zhenfeng, et al.
Published: (2024)

BILBO: BILevel Bayesian Optimization
by: Chew, Ruth Wan Theng, et al.
Published: (2025)

Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies
by: Verma, Arun, et al.
Published: (2024)

COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agents
by: Verma, Arun, et al.
Published: (2025)

SIM-Shapley: A Stable and Computationally Efficient Approach to Shapley Value Approximation
by: Fan, Wangxuan, et al.
Published: (2025)

Understanding the Relationship between Prompts and Response Uncertainty in Large Language Models
by: Zhang, Ze Yu, et al.
Published: (2024)

Active Human Feedback Collection via Neural Contextual Dueling Bandits
by: Verma, Arun, et al.
Published: (2025)

Data value estimation on private gradients
by: Zhou, Zijian, et al.
Published: (2024)

TRACE: TRansformer-based Attribution using Contrastive Embeddings in LLMs
by: Wang, Cheng, et al.
Published: (2024)

Dependency Structure Search Bayesian Optimization for Decision Making Models
by: Rajpal, Mohit, et al.
Published: (2023)

Fine-tuning Language Models with Generative Adversarial Reward Modelling
by: Yu, Zhang Ze, et al.
Published: (2023)

Provably Accurate Shapley Value Estimation via Leverage Score Sampling
by: Musco, Christopher, et al.
Published: (2024)

PINNACLE: PINN Adaptive ColLocation and Experimental points selection
by: Lau, Gregory Kang Ruey, et al.
Published: (2024)

Data Distribution Valuation
by: Xu, Xinyi, et al.
Published: (2024)

Shapley Values: Paired-Sampling Approximations
by: Mayer, Michael, et al.
Published: (2025)

BoLT: A Benchmark to Democratize Black-box Optimization Research for Expensive LLM Tasks
by: Chew, Ruth Wan Theng, et al.
Published: (2026)

INO-SGD: Addressing Utility Imbalance under Individualized Differential Privacy
by: Tian, Xiao, et al.
Published: (2026)

Neural Dueling Bandits: Preference-Based Optimization with Human Feedback
by: Verma, Arun, et al.
Published: (2024)

DeRDaVa: Deletion-Robust Data Valuation for Machine Learning
by: Tian, Xiao, et al.
Published: (2023)

Ferret: Federated Full-Parameter Tuning at Scale for Large Language Models
by: Shu, Yao, et al.
Published: (2024)

Paid with Models: Optimal Contract Design for Collaborative Machine Learning
by: Wang, Bingchen, et al.
Published: (2024)

DUET: Optimizing Training Data Mixtures via Feedback from Unseen Evaluation Tasks
by: Chen, Zhiliang, et al.
Published: (2025)

Adjusted Expected Improvement for Cumulative Regret Minimization in Noisy Bayesian Optimization
by: Hu, Shouri, et al.
Published: (2022)

Approximating the Shapley Value without Marginal Contributions
by: Kolpaczki, Patrick, et al.
Published: (2023)

Verified SHAP: Provable Bounds for Exact Shapley Values of Neural Networks
by: Boetius, David, et al.
Published: (2026)

REFRAG: Rethinking RAG based Decoding
by: Lin, Xiaoqiang, et al.
Published: (2025)

A Unified Framework for Provably Efficient Algorithms to Estimate Shapley Values
by: Chen, Tyler, et al.
Published: (2025)

Weight-Informed Self-Explaining Clustering for Mixed-Type Tabular Data
by: Li, Lehao, et al.
Published: (2026)

Provably Efficient Offline-to-Online Value Adaptation with General Function Approximation
by: Li, Shangzhe, et al.
Published: (2026)

Shapley Value Approximation Based on k-Additive Games
by: Pelegrina, Guilherme Dean, et al.
Published: (2025)