Projection onto the probability simplex: An efficient algorithm with a simple proof, and an application

Code

• github.com/zitengsun/hadamard_response
  none★ 16
• github.com/mehdisebbar/clustering-models
  none★ 0
• github.com/jlyx417353617/hadamard_response
  none★ 0

Abstract

We provide an elementary proof of a simple, efficient algorithm for computing the Euclidean projection of a point onto the probability simplex. We also show an application in Laplacian K-modes clustering.

Tasks

Reproductions