paper-with-me

Papers

Riemannian optimization on the simplex of positive definite matrices

2019-06-25 · Bamdev Mishra, Hiroyuki Kasai, Pratik Jawanpuria

In this work, we generalize the probability simplex constraint to matrices, i.e., $\mathbf{X}_1 + \mathbf{X}_2 + \ldots + \mathbf{X}_K = \mathbf{I}$, where $\mathbf{X}_i \succeq 0$ is a symmetric positive semidefinite matrix of size $n\times n$ for all $i = \{1,\ldots,K \}$. By assuming positive definiteness of the matrices, we show that the constraint set arising from the matrix simplex has the structure of a smooth Riemannian submanifold. We discuss a novel Riemannian geometry for the matrix simplex manifold and show the derivation of first- and second-order optimization related ingredients.

📄 PDF Abstract BibTeX arXiv:1906.10436

Code (0)

등록된 구현이 없습니다.

Tasks

Riemannian optimization

Similar Papers 제목 키워드 기반

Positive definite matrices and the S-divergence

2011-10-08 · Suvrit Sra

Positive definite matrices abound in a dazzling variety of applications. This ubiquity can be in part attributed to their rich geometric structure: positive definite matrices form a self-dual convex cone whose strict int…

On Riemannian Optimization over Positive Definite Matrices with the Bures-Wasserstein Geometry

2021-06-01 · NeurIPS 2021 12 · Andi Han, Bamdev Mishra, Pratik Jawanpuria, Junbin Gao

In this paper, we comparatively analyze the Bures-Wasserstein (BW) geometry with the popular Affine-Invariant (AI) geometry for Riemannian optimization on the symmetric positive definite (SPD) matrix manifold. Our study …

Riemannian optimization

Low-Rank Riemannian Optimization on Positive Semidefinite Stochastic Matrices with Applications to Graph Clustering

2018-07-01 · ICML 2018 7 · Ahmed Douik, Babak Hassibi

This paper develops a Riemannian optimization framework for solving optimization problems on the set of symmetric positive semidefinite stochastic matrices. The paper first reformulates the problem by factorizing th…

ClusteringGraph ClusteringRiemannian optimization

Riemannian Dictionary Learning and Sparse Coding for Positive Definite Matrices

2015-07-10 · Anoop Cherian, Suvrit Sra

Data encoded as symmetric positive definite (SPD) matrices frequently arise in many areas of computer vision and machine learning. While these matrices form an open subset of the Euclidean space of symmetric matrices, vi…

BIG-bench Machine LearningDictionary LearningRetrievalRiemannian optimization

Kernel Methods on the Riemannian Manifold of Symmetric Positive Definite Matrices

2014-12-13 · CVPR 2013 6 · Sadeep Jayasumana, Richard Hartley, Mathieu Salzmann, Hongdong Li 외

Symmetric Positive Definite (SPD) matrices have become popular to encode image information. Accounting for the geometry of the Riemannian manifold of SPD matrices has proven key to the success of many algorithms. However…

Motion SegmentationPedestrian DetectionSegmentationTexture Classification