Efficient, Certifiably Optimal High-Dimensional Clustering

by   Carson Eisenach, et al.

We consider SDP relaxation methods for data and variable clustering problems, which have been shown in the literature to have good statistical properties in a variety of settings, but remain intractable to solve in practice. In particular, we propose FORCE, a new algorithm to solve the Peng-Wei K-means SDP. Compared to the naive interior point method, our method reduces the computational complexity of solving the SDP from Õ(d^7ϵ^-1) to Õ(d^6K^-2ϵ^-1). Our method combines a primal first-order method with a dual optimality certificate search, which when successful, allows for early termination of the primal method. We show under certain data generating distributions that, with high probability, FORCE is guaranteed to find the optimal solution to the SDP relaxation and provide a certificate of exact optimality. As verified by our numerical experiments, this allows FORCE to solve the Peng-Wei SDP with dimensions in the hundreds in only tens of seconds. We also consider a variation of the Peng-Wei SDP for the case when K is not known a priori and show that a slight modification of FORCE reduces the computational complexity of solving this problem as well: from Õ(d^7ϵ^-1) using a standard SDP solver to Õ(d^4ϵ^-1).


page 1

page 2

page 3

page 4


Lifted Primal-Dual Method for Bilinearly Coupled Smooth Minimax Optimization

We study the bilinearly coupled minimax problem: min_xmax_y f(x) + y^⊤ A...

Large-scale Binary Quadratic Optimization Using Semidefinite Relaxation and Applications

In computer vision, many problems such as image segmentation, pixel labe...

Improved Rate of First Order Algorithms for Entropic Optimal Transport

This paper improves the state-of-the-art rate of a first-order algorithm...

Sketch-and-solve approaches to k-means clustering by semidefinite programming

We introduce a sketch-and-solve approach to speed up the Peng-Wei semide...

An Optimal-Storage Approach to Semidefinite Programming using Approximate Complementarity

This paper develops a new storage-optimal algorithm that provably solves...

Reliable Force Aggregation Using a Refined Evidence Specification from Dempster-Shafer Clustering

In this paper we develop methods for selection of templates and use thes...

One-Time Pads from the Digits of Pi

I present a method for generating one-time pads from the digits of pi. C...

Please sign up or login with your details

Forgot password? Click here to reset