Venkatesh Raman

Learning with Structure: Computing Consistent Subsets on Structurally-Regular Graphs

The Minimum Consistent Subset (MCS) problem arises naturally in the context of supervised clustering and instance selection. In supervised clustering, one aims to infer a meaningful partitioning of data using a small labeled subset. However, the sheer volume of training data in modern applications p