Bruno Pelletier

Learn More
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.
We study the approximation of a continuous function field over a compact set T , by a continuous field of ridge ap-proximants over T , named ridge function fields. We first give general density results about function fields, and show how they apply to ridge function fields. We next discuss the parametrization of sets of ridge function fields, and give(More)
Following Hartigan [1975], a cluster is defined as a connected component of the t-level set of the underlying density, i.e., the set of points for which the density is greater than t. A clustering algorithm which combines a density estimate with spectral clustering techniques is proposed. Our algorithm is composed of two steps. First, a nonparametric(More)
  • 1