On the convergence of maximum variance unfolding

08/31/2012
by   Ery Arias-Castro, et al.
0

Maximum Variance Unfolding is one of the main methods for (nonlinear) dimensionality reduction. We study its large sample limit, providing specific rates of convergence under standard assumptions. We find that it is consistent when the underlying submanifold is isometric to a convex subset, and we provide some simple examples where it fails to be consistent.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2020

Sharpe Ratio in High Dimensions: Cases of Maximum Out of Sample, Constrained Maximum, and Optimal Portfolio Choice

In this paper, we analyze maximum Sharpe ratio when the number of assets...
research
12/26/2020

Variance Reduction on Adaptive Stochastic Mirror Descent

We study the idea of variance reduction applied to adaptive stochastic m...
research
10/22/2010

A Unifying Probabilistic Perspective for Spectral Dimensionality Reduction: Insights and New Models

We introduce a new perspective on spectral dimensionality reduction whic...
research
12/13/2017

Variance reduction via empirical variance minimization: convergence and complexity

In this paper we propose and study a generic variance reduction approach...
research
05/22/2023

SignSVRG: fixing SignSGD via variance reduction

We consider the problem of unconstrained minimization of finite sums of ...
research
03/24/2020

A universal approach to estimate the conditional variance in semimartingale limit theorems

The typical central limit theorems in high-frequency asymptotics for sem...

Please sign up or login with your details

Forgot password? Click here to reset