← Search

Weida Li

7 accepted papers

2026

TreeGrad-Ranker: Feature Ranking via $O(L)$-Time Gradients for Decision Trees

ICLR 2026poster

We revisit the use of probabilistic values, which include the well-known Shapley and Banzhaf values, to rank features for explaining the local predicted values of decision trees. The quality of feature rankings is typically assessed with the insertion and deletion metrics. Empirically, we observe t…

Cited by 0SourcecodeScholar
2025

Scaling Value Iteration Networks to 5000 Layers for Extreme Long-Term Planning

ICML 2025poster

The Value Iteration Network (VIN) is an end-to-end differentiable neural network architecture for planning. It exhibits strong generalization to unseen domains by incorporating a differentiable planning module that operates on a latent Markov Decision Process (MDP). However, VINs struggle to scale t…

Cited by 1SourcePDFScholar
2024

One Sample Fits All: Approximating All Probabilistic Values Simultaneously and Efficiently

NeurIPS 2024poster

The concept of probabilistic values, such as Beta Shapley values and weighted Banzhaf values, has gained recent attention in applications like feature attribution and data valuation. However, exact computation of these values is often exponentially expensive, necessitating approximation techniques.…