arXiv (All)
open access
Interval-valued SHAP in Tree-Based Models
Shapley values are among the most popular feature-attribution explanations. Efficient approaches for computing/estimating Shapley values for tree-based models, which are state-of-the-art for tabular data sets, have been developed. However, it is known that Shapley values can be (highly) unrobust due
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Extremely randomized trees#7004
- The Advantages of Using Bayesian Statistics for Fairness Assessments in Artificial Intelligence Audits#446643
- Nonparametric Regression on Fixed-Cardinality Subsets:Minimax Risk and Random-Design Effects#1109580
- Confidence Is Detection-Like in High-Dimensional Spaces.#1134464
- A Sub-4 Approximation for Fair $k$-Means#985378
Record · ID 1249233
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive