Covariance-engaged Classification of Sets via Linear Programming
Zhao Ren, Sungkyu Jung, Xingye Qiao

TL;DR
This paper introduces a novel set classification method called CLIPS that leverages empirical covariance and linear programming, demonstrating improved convergence rates and effectiveness in real-world image data analysis.
Contribution
The paper proposes a new covariance-engaged linear programming approach for set classification, with theoretical analysis and practical validation.
Findings
Faster convergence rates with multiple observations per set.
Effective classification in dependent and independent data structures.
Superior performance demonstrated in simulation and histopathology data.
Abstract
Set classification aims to classify a set of observations as a whole, as opposed to classifying individual observations separately. To formally understand the unfamiliar concept of binary set classification, we first investigate the optimal decision rule under the normal distribution, which utilizes the empirical covariance of the set to be classified. We show that the number of observations in the set plays a critical role in bounding the Bayes risk. Under this framework, we further propose new methods of set classification. For the case where only a few parameters of the model drive the difference between two classes, we propose a computationally-efficient approach to parameter estimation using linear programming, leading to the Covariance-engaged LInear Programming Set (CLIPS) classifier. Its theoretical properties are investigated for both independent case and various (short-range…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Bayesian Modeling and Causal Inference · Artificial Intelligence in Healthcare
