Guy Blanc Neha Gupta Jane Lange Li-Yang Tan
π¦ ! x f(x) 000010101 -1 π¦ " π¦ # 011011010 1 100100111 1 101001000 1 π¦ " -1 1 1 001010010 -1 β1 1 ID3, C4.5, CART
1) Choose a good root π¦ $ [variable influence, information gain, Gini impurity] 2) Recurse on subtrees πΆπ£πππ(π π¦ $ < 0 ) πΆπ£πππ(π π¦ $ β₯ 0 ) βGoodβ root = relevant, important, influential
Heuristics do poorly Monotone Noise-stable functions [already well-known] functions [new in BLT20] [new in BGLT20] Heuristics do well New algorithm: provable guarantees for all functions [BGLT20]
π¦ ! Stochastic node 1 π π π π π π π π π π $2 $0 $5 $1200 $45 -1 1 Query cost vector Randomized DT
Recommend
More recommend