Pages that link to "Item:Q2313284"
From MaRDI portal
The following pages link to Spectral method and regularized MLE are both optimal for top-\(K\) ranking (Q2313284):
Displayed 26 items.
- Subspace estimation from unbalanced and incomplete data matrices: \({\ell_{2,\infty}}\) statistical guarantees (Q2039795) (← links)
- Community detection on mixture multilayer networks via regularized tensor decomposition (Q2073701) (← links)
- An \({\ell_p}\) theory of PCA and spectral clustering (Q2091846) (← links)
- Partial recovery for top-\(k\) ranking: optimality of MLE and suboptimality of the spectral method (Q2148993) (← links)
- Optimal full ranking from pairwise comparisons (Q2148998) (← links)
- Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods (Q2155796) (← links)
- Implicit regularization in nonconvex statistical estimation: gradient descent converges linearly for phase retrieval, matrix completion, and blind deconvolution (Q2189396) (← links)
- Entrywise eigenvector analysis of random matrices with low expected rank (Q2196228) (← links)
- Spectral method and regularized MLE are both optimal for top-\(K\) ranking (Q2313284) (← links)
- Antithetic and Monte Carlo kernel estimators for partial rankings (Q2329828) (← links)
- Gradient descent with random initialization: fast global convergence for nonconvex phase retrieval (Q2425162) (← links)
- Asymmetry helps: eigenvalue and eigenvector analyses of asymmetrically perturbed low-rank matrices (Q2656603) (← links)
- A low-rank spectral method for learning Markov models (Q2679005) (← links)
- PALM: patient-centered treatment ranking via large-scale multivariate network meta-analysis (Q2686079) (← links)
- Iterative Collaborative Filtering for Sparse Matrix Estimation (Q5060494) (← links)
- Nonconvex Low-Rank Tensor Completion from Noisy Data (Q5080674) (← links)
- Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method (Q5081100) (← links)
- Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimization (Q5131966) (← links)
- Time-homogeneous top-<i>K</i> ranking using tensor decompositions (Q5858998) (← links)
- Partition–Mallows Model and Its Inference for Rank Aggregation (Q6107212) (← links)
- Convex and Nonconvex Optimization Are Both Minimax-Optimal for Noisy Blind Deconvolution Under Random Designs (Q6109969) (← links)
- Optimal permutation estimation in crowdsourcing problems (Q6136577) (← links)
- A General Pairwise Comparison Model for Extremely Sparse Networks (Q6144758) (← links)
- A Spectral Method for Joint Community Detection and Orthogonal Group Synchronization (Q6166053) (← links)
- Top-\(k\) list aggregation: mathematical formulations and polyhedral comparisons (Q6166889) (← links)
- Localization in 1D non-parametric latent space models from pairwise affinities (Q6170608) (← links)