Frank-Wolfe Optimization for Dominant Set Clustering

07/22/2020
by   Carl Johnell, et al.
0

We study Frank-Wolfe algorithms – standard, pairwise, and away-steps – for efficient optimization of Dominant Set Clustering. We present a unified and computationally efficient framework to employ the different variants of Frank-Wolfe methods, and we investigate its effectiveness via several experimental studies. In addition, we provide explicit convergence rates for the algorithms in terms of the so-called Frank-Wolfe gap. The theoretical analysis has been specialized to the problem of Dominant Set Clustering and is thus more easily accessible compared to prior work.

READ FULL TEXT
research
05/21/2018

Speaker Clustering Using Dominant Sets

Speaker clustering is the task of forming speaker-specific groups based ...
research
02/19/2020

A Unified Framework for Gaussian Mixture Reduction with Composite Transportation Distance

Gaussian mixture reduction (GMR) is the problem of approximating a finit...
research
02/21/2017

A Unified Optimization View on Generalized Matching Pursuit and Frank-Wolfe

Two of the most fundamental prototypes of greedy optimization are the ma...
research
06/06/2017

Hyperplane Clustering Via Dual Principal Component Pursuit

We extend the theoretical analysis of a recently proposed single subspac...
research
06/19/2017

Multi-Target Tracking in Multiple Non-Overlapping Cameras using Constrained Dominant Sets

In this paper, a unified three-layer hierarchical approach for solving t...
research
04/11/2018

Derivative free optimization via repeated classification

We develop an algorithm for minimizing a function using n batched functi...
research
09/26/2022

Clustering by Direct Optimization of the Medoid Silhouette

The evaluation of clustering results is difficult, highly dependent on t...

Please sign up or login with your details

Forgot password? Click here to reset