Bigeometric Organization of Deep Nets

In this paper, we build an organization of high-dimensional datasets that cannot be cleanly embedded into a low-dimensional representation due to missing entries and a subset of the features being irrelevant to modeling functions of interest. Our algorithm begins by defining coarse neighborhoods of the points and defining an expected empirical function value on these neighborhoods. We then generate new non-linear features with deep net representations tuned to model the approximate function, and re-organize the geometry of the points with respect to the new representation. Finally, the points are locally z-scored to create an intrinsic geometric organization which is independent of the parameters of the deep net, a geometry designed to assure smoothness with respect to the empirical function. We examine this approach on data from the Center for Medicare and Medicaid Services Hospital Quality Initiative, and generate an intrinsic low-dimensional organization of the hospitals that is smooth with respect to an expert driven function of quality.

[1]  Klaus-Robert Müller,et al.  Kernel Analysis of Deep Networks , 2011, J. Mach. Learn. Res..

[2]  L. Saul,et al.  Think globally, fit locally: unsupervised l earning of non-linear manifolds , 2002 .

[3]  Harlan M Krumholz,et al.  Relationship between hospital readmission and mortality rates for patients hospitalized with acute myocardial infarction, heart failure, or pneumonia. , 2013, JAMA.

[4]  Mikhail Belkin,et al.  Laplacian Eigenmaps for Dimensionality Reduction and Data Representation , 2003, Neural Computation.

[5]  Lawrence K. Saul,et al.  Kernel Methods for Deep Learning , 2009, NIPS.

[6]  Ronald R. Coifman,et al.  Harmonic Analysis of Digital Data Bases , 2011 .

[7]  Harlan M Krumholz,et al.  Hospital quality for acute myocardial infarction: correlation among process measures and relationship with short-term mortality. , 2006, JAMA.

[8]  Nicolas Le Roux,et al.  Out-of-Sample Extensions for LLE, Isomap, MDS, Eigenmaps, and Spectral Clustering , 2003, NIPS.

[9]  Raúl Rojas,et al.  Neural Networks - A Systematic Introduction , 1996 .

[10]  R. Coifman,et al.  Non-linear independent component analysis with diffusion maps , 2008 .

[11]  Yoshua Bengio,et al.  Deep Learning of Representations: Looking Forward , 2013, SLSP.

[12]  Ronald R. Coifman,et al.  Diffusion maps for changing data , 2012, ArXiv.

[13]  Ronald R. Coifman,et al.  Texture separation via a reference set , 2014 .

[14]  Lawrence K. Saul,et al.  Think Globally, Fit Locally: Unsupervised Learning of Low Dimensional Manifold , 2003, J. Mach. Learn. Res..

[15]  P. Mahalanobis On the generalized distance in statistics , 1936 .

[16]  R. Coifman,et al.  Earth Mover ’ s Distance and Equivalent Metrics for Spaces with Hierarchical Partition trees , 2013 .