Pages that link to "Item:Q2338924"
From MaRDI portal
The following pages link to Matrix estimation by universal singular value thresholding (Q2338924):
Displaying 50 items.
- Optimal change point detection and localization in sparse dynamic networks (Q97726) (← links)
- Variational Inference for Stochastic Block Models From Sampled Data (Q99254) (← links)
- Network Cross-Validation for Determining the Number of Communities in Network Data (Q159626) (← links)
- Rate-optimal graphon estimation (Q159635) (← links)
- Adaptive shrinkage of singular values (Q294253) (← links)
- Geometric inference for general high-dimensional linear inverse problems (Q309721) (← links)
- A graphical approach to the analysis of matrix completion (Q335673) (← links)
- Variational Bayes model averaging for graphon functions and motif frequencies inference in \(W\)-graph models (Q341136) (← links)
- Universally consistent vertex classification for latent positions graphs (Q366983) (← links)
- Asymptotic normality of maximum likelihood and its variational approximation for stochastic blockmodels (Q385773) (← links)
- Matrix completion by singular value thresholding: sharp bounds (Q887273) (← links)
- 1-bit matrix completion: PAC-Bayesian analysis of a variational approximation (Q1640399) (← links)
- Asymptotic performance of PCA for high-dimensional heteroscedastic data (Q1661372) (← links)
- A spectral algorithm with additive clustering for the recovery of overlapping communities in networks (Q1663638) (← links)
- Random perturbation of low rank matrices: improving classical bounds (Q1688904) (← links)
- Adaptive confidence sets for matrix completion (Q1708972) (← links)
- Optimal rates of statistical seriation (Q1715546) (← links)
- Rate-optimal perturbation bounds for singular subspaces with applications to high-dimensional statistics (Q1747733) (← links)
- Towards optimal estimation of bivariate isotonic matrices with unknown permutations (Q1996765) (← links)
- Adaptive estimation of nonparametric geometric graphs (Q2035746) (← links)
- Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing (Q2038283) (← links)
- Network representation using graph root distributions (Q2039784) (← links)
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
- Consistent nonparametric estimation for heavy-tailed sparse graphs (Q2054468) (← links)
- Optimal adaptivity of signed-polygon statistics for network testing (Q2073714) (← links)
- Random graph asymptotics for treatment effect estimation under network interference (Q2091844) (← links)
- Heteroskedastic PCA: algorithm, optimality, and applications (Q2119219) (← links)
- Isotonic regression with unknown permutations: statistics, computation and adaptation (Q2119231) (← links)
- Reconstruction of line-embeddings of graphons (Q2136610) (← links)
- Asymptotically efficient estimators for stochastic blockmodels: the naive MLE, the rank-constrained MLE, and the spectral estimator (Q2137006) (← links)
- Central limit theorems for classical multidimensional scaling (Q2192306) (← links)
- Worst-case versus average-case design for estimation from partial pairwise comparisons (Q2196209) (← links)
- Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
- Vertex nomination, consistent estimation, and adversarial modification (Q2199707) (← links)
- Estimation of Monge matrices (Q2203631) (← links)
- Posterior contraction rates for stochastic block models (Q2206755) (← links)
- Bayesian estimation of the latent dimension and communities in stochastic blockmodels (Q2209705) (← links)
- Consistency and asymptotic normality of stochastic block models estimators from sampled data (Q2209826) (← links)
- A singular value thresholding with diagonal-update algorithm for low-rank matrix completion (Q2217856) (← links)
- A note on exploratory item factor analysis by singular value decomposition (Q2220369) (← links)
- Maximum likelihood estimation of sparse networks with missing observations (Q2242863) (← links)
- Vertex nomination: the canonical sampling and the extended spectral nomination schemes (Q2305315) (← links)
- Optimal graphon estimation in cut distance (Q2312687) (← links)
- Structured matrix estimation and completion (Q2325396) (← links)
- Nonparametric estimation of low rank matrix valued function (Q2326073) (← links)
- Low-rank matrix completion via preconditioned optimization on the Grassmann manifold (Q2347362) (← links)
- Co-clustering separately exchangeable network data (Q2448722) (← links)
- Optimal singular value shrinkage for operator norm loss: extending to non-square matrices (Q2670774) (← links)
- Matrix means and a novel high-dimensional shrinkage phenomenon (Q2676932) (← links)
- Low-Rank Approximation and Completion of Positive Tensors (Q2827064) (← links)
