Regression on fixed-rank positive semidefinite matrices: a Riemannian approach

Details Regression on fixed-rank positive semidefinite matrices: a Riemannian approach Regression on fixed-rank positive semidefinite matrices: a Riemannian approach

2010-06-07

arxiv.org/abs/1006.1288v2

Computer Science

Learning

Scientific paper

The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space and on scalability to high-dimensional problems. The mathematical developments rely on the theory of gradient descent algorithms adapted to the Riemannian geometry that underlies the set of fixed-rank positive semidefinite matrices. In contrast with previous contributions in the literature, no restrictions are imposed on the range space of the learned matrix. The resulting algorithms maintain a linear complexity in the problem size and enjoy important invariance properties. We apply the proposed algorithms to the problem of learning a distance function parameterized by a positive semidefinite matrix. Good performance is observed on classical benchmarks.

Affiliated with

Also associated with

No associations

Rating

Regression on fixed-rank positive semidefinite matrices: a Riemannian approach does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Regression on fixed-rank positive semidefinite matrices: a Riemannian approach, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Regression on fixed-rank positive semidefinite matrices: a Riemannian approach will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-367295