Ctrl+K
- claim-1-do-shapley-values-can-be-computed-exactly-in-o-r-d-e-t-time-where-r-is-the-number-of-irreducible-sets-d-the-number-of-dimensions-e-the-number-of-edges-and-t-the-value-function-evaluation-time-versus-the-naive-2-d-complexity-section-3
- claim-2-theorem-5-1-shows-the-do-shapley-value-phi-i-is-identifiable-if-and-only-if-nu-j-is-identifiable-for-all-j-in-d-reducing-identifiability-checks-from-r-coalitions-to-just-d-singleton-coalitions-theorem-5-1
- claim-3-lemma-3-1-establishes-that-for-any-closed-set-with-a-basis-removing-any-basis-element-yields-another-closed-set-enabling-efficient-lattice-traversal-via-algorithm-2-lemma-3-1-algorithm-2
- claim-4-algorithm-3-boundary-sampling-guarantees-discovery-of-min-m-r-distinct-equivalence-classes-using-m-queries-running-in-o-m-d-d-e-time-section-on-estimator-performance-algorithm-3
- claim-5-the-doregressionmsr-estimator-consistently-outperforms-baseline-variants-and-exhibits-a-phase-transition-at-m-r-where-error-vanishes-to-machine-precision-while-structure-agnostic-methods-retain-variance-figure-5
- claim-6-real-world-causal-structures-tend-to-be-sparse-so-the-number-of-irreducible-sets-r-scales-between-the-exponential-worst-case-2-d-and-the-linear-lower-bound-d-figure-4
- conclusion
- executive-summary
- 1.75 kB