Search Results for author:
Found 10 papers, 2 papers with code
Optimal vintage factor analysis with deflation varimax
Vintage factor analysis is one important type of factor analysis that aims to first find a low-dimensional representation of the original data, and then to seek a rotation such that the rotated low-dimensional representation is scientifically meaningful.
Interpolating Discriminant Functions in High-Dimensional Gaussian Latent Mixtures
A generalized least squares estimator is used to estimate the direction of the optimal separating hyperplane.
Optimal Discriminant Analysis in High-Dimensional Latent Factor Models
In high-dimensional classification problems, a commonly used approach is to first project the high-dimensional features into a lower dimensional space, and base the classification on the resulting lower dimensional projections.
Estimation and inference for the Wasserstein distance between mixing measures in topic models
Our results establish this metric to be a canonical choice.
Likelihood estimation of sparse topic distributions in topic models and its applications to Wasserstein document distance calculations
When $A$ is unknown, we estimate $T$ by optimizing the likelihood function corresponding to a plug in, generic, estimator $\hat{A}$ of $A$.
Unique sparse decomposition of low rank matrices
In this paper, we study the problem of seeking a unique decomposition of a low rank matrix $Y\in \mathbb{R}^{p\times n}$ that admits a sparse representation.
Prediction in latent factor regression: Adaptive PCR and beyond
Our primary contribution is in establishing finite sample risk bounds for prediction with the ubiquitous Principal Component Regression (PCR) method, under the factor regression model, with the number of principal components adaptively selected from the data -- a form of theoretical guarantee that is surprisingly lacking from the PCR literature.
Optimal estimation of sparse topic models
We derive a finite sample upper bound for our estimator, and show that it matches the minimax lower bound in many scenarios.
A fast algorithm with minimax optimal guarantees for topic models with an unknown number of topics
We propose a new method of estimation in topic models, that is not a variation on the existing simplex finding algorithms, and that estimates the number of topics K from the observed data.
Adaptive Estimation in Structured Factor Models with Applications to Overlapping Clustering
This work introduces a novel estimation method, called LOVE, of the entries and structure of a loading matrix A in a sparse latent factor model X = AZ + E, for an observable random vector X in Rp, with correlated unobservable factors Z \in RK, with K unknown, and independent noise E. Each row of A is scaled and sparse.
