April 8, 2022, 1:12 a.m. | Tianhao Wang, Yu Yang, Ruoxi Jia

cs.LG updates on arXiv.org arxiv.org

The Shapley value (SV) and Least core (LC) are classic methods in cooperative
game theory for cost/profit sharing problems. Both methods have recently been
proposed as a principled solution for data valuation tasks, i.e., quantifying
the contribution of individual datum in machine learning. However, both SV and
LC suffer computational challenges due to the need for retraining models on
combinatorially many data subsets. In this work, we propose to boost the
efficiency in computing Shapley value or Least core by …

arxiv data game game theory learning theory

Data Architect

@ University of Texas at Austin | Austin, TX

Data ETL Engineer

@ University of Texas at Austin | Austin, TX

Lead GNSS Data Scientist

@ Lurra Systems | Melbourne

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

Senior ML Engineer

@ Carousell Group | Ho Chi Minh City, Vietnam

Data and Insight Analyst

@ Cotiviti | Remote, United States