Why might PDP recursion and brute-force computation not be interchangeable for every estimator or configuration?
Classic MLLevel: AdvancedBrute-force versus recursion
Why might PDP recursion and brute-force computation not be interchangeable for every estimator or configuration?
Hints
- An optimized structural algorithm has assumptions.
- The reference population can differ.
Answer
This answer is part of mentoring
Advanced questions come with a full breakdown and a mock interview with a working quant researcher. The first call is free.
Source and licence: scikit-learn 1.7.2 — partial dependence · BSD-3-Clause · answer: Quantoros editorial