ProtoDash - Fast Interpretable Prototype Selection by Karthik Gurumoorthy
International Centre for Theoretical Sciences via YouTube
Overview
Syllabus
ProtoDash: Fast Interpretable Prototype Selection
Objective: Extract compact synapses of large data sets
Prototypes and Criticisms
Some applications:
Causal reasoning
Metric to quantify best for prototype selection
Reformulation as maximizing a set function
Properties of set function: Submodularity
Weak submodularity
ProtoDash algorithm: Greedily build the set based on gradients
ProtoGreedy algorithm: Greedily build the set based on maximum function increment
ProtoDash Vs ProtoGreedy
Classification accuracy Vs sparsity
Classification accuracy Vs skew
Prototype selection quality
Computation time
Visualizing selected prototypes
Visualizing selected prototypes from the same data set
Theoretical guarantees
Set function value Vs sparsity
Criticism selection
Greedy algorithm for choosing criticisms
Visualizing selected criticisms
Application 2: Finding relationships between data sets
Approach to identify relationships
Visualizing relationships
Human expert based evaluation
Application 3: Improving prediction accuracy by training data selection
Training data selection
Prediction accuracy
Interpreting selected prototype
Interpreting selected prototypes
Thank You
Q&A
Taught by
International Centre for Theoretical Sciences