all AI news
SHAP for XGBoost: From NP-completeness to polynomial time
Jan. 3, 2022, 3:57 p.m. | Saupin Guillaume
Towards Data Science - Medium towardsdatascience.com
Computing Shapley values is an np complete problem. How is that possible that we get them almost instantly for XGBoost ?
Continue reading on Towards Data Science »
data science explainable ai machine learning shap shapley-values time xgboost
More from towardsdatascience.com / Towards Data Science - Medium
Jobs in AI, ML, Big Data
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
Program Control Data Analyst
@ Ford Motor Company | Mexico
Vice President, Business Intelligence / Data & Analytics
@ AlphaSense | Remote - United States