Nonlinear Multiple Response Regression and Learning of Latent Spaces
Not on the map. Why?
Abstract (arXiv)
Identifying low-dimensional latent structures within high-dimensional data has long been a central topic in the machine learning community, driven by the need for data compression, storage, transmission, and deeper data understanding. Traditional methods, such as principal component analysis (PCA) and autoencoders (AE), operate in an unsupervised manner, ignoring label information even when it is available. In this work, we introduce a unified method capable of learning latent spaces in both unsupervised and supervised settings. We formulate the problem as a nonlinear multiple-response regression within an index model context. By applying the generalized Stein's lemma, the latent space can be estimated without knowing the nonlinear link functions. Our method can be viewed as a nonlinear generalization of PCA. Moreover, unlike AE and other neural network methods that operate as "black boxes", our approach not only offers better interpretability but also reduces computational complexity while providing strong theoretical guarantees. Comprehensive numerical experiments and real data analyses demonstrate the superior performance of our method.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 14 of its 45 references that are in the map. First posted on arXiv 27 Mar 2025.
Builds on
14 of 45 references.
References · 14
- 2019Generative Modeling by Estimating Gradients of the Data Distributioncited by 4,067
- 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 381
- 2013k-Sparse Autoencoderscited by 209
- 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
- 2021Estimating High Order Gradients of the Data Distribution by Denoisingcited by 63
- 2022Neural Networks Efficiently Learn Low-Dimensional Representations with SGDcited by 61
- 2017Gradient Estimators for Implicit Modelscited by 58
- 2018A Spectral Approach to Gradient Estimation for Implicit Distributionscited by 45
- 2020Nonparametric Score Estimatorscited by 22
- 2015Gradient-free Hamiltonian Monte Carlo with Efficient Kernel Exponential Familiescited by 15
- 2013A Blockwise Descent Algorithm for Group-penalized Multiresponse and Multinomial Regressioncited by 8
- 2014Score Function Features for Discriminative Learning: Matrix and Tensor Frameworkcited by 7
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026Multi-Source Transfer Learning of Sparse Single-Index Models28 Jun 2026