University of Cambridge > Talks.cam > Statistics > Variable clustering: optimal bounds and a convex approach

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Variable clustering: optimal bounds and a convex approach

Download to your calendar using vCal

If you have a question about this talk, please contact Quentin Berthet .

The problem of variable clustering is that of grouping similar components of a p-dimensional vector X = (X_1 , ... , X_p), and estimating these groups from n independent copies of X. Although K-means is a natural strategy for this problem, I will explain why it cannot lead to perfect cluster recovery. Then, I will introduce a correction that can be viewed as a penalized convex relaxation of K-means. The clusters estimated by this method are shown to recover the partition G at a minimax optimal cluster separation rate.

This talk is part of the Statistics series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Dorothy & Thomas Room, Strangeways Research Lab Panton Arms pub, Panton Street The Bradfield Centre, 184 Cambridge Science Park Road, Cambridge, CB4 0GA

Other talks

Title to be confirmed Online Causal Inference Seminar The uplift and erosion history of the Gamburtsev Subglacial Mountains and their role in the formation of the East Antarctic Ice Sheet Title to be confirmed Spectral theory for Dirac operators with singular potentials The Importance of Teaching about Science and Religion in a Time of Global Uncertainty
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity