Skip to main content
Search

Chunxi Ji

1 related articles

Subscribe to updates
  1. Random forest decisions get formal explanations: compile the forest into circuits, then compute complete reasons and shortest flips in linear time

    A random forest's majority-vote decision can now be compiled into class formulas in circuit form and then into tractable decision graphs, so the complete reason and general reason for a decision are computed in time linear in the graph size. Previously, converting a forest into a symbolic encoding and querying a SAT or MAX-SAT solver produced encodings full of auxiliary variables that do not correspond to class formulas, so complete reasons were not directly available. On datasets from UCI and the Penn Machine Learning Benchmarks, the compiled NNF circuits are smaller than existing ADD and ORD decision graphs on most datasets, and the largest compilation took 323.9 seconds.

You’re all caught up