Going Off the Grid: Iterative Model Selection for Biclustered Matrix Completion
From MaRDI portal
Publication:3391180
DOI10.1080/10618600.2018.1482763OpenAlexW2539017716WikidataQ129726421 ScholiaQ129726421MaRDI QIDQ3391180
Eric C. Chi, Liuyi Hu, Arvind K. Saibaba, Arvind Rao
Publication date: 28 March 2022
Published in: Journal of Computational and Graphical Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.05400
convex optimizationpenalizationsparse linear systemsinformation criteriondegrees of freedomHutchinson estimator
Uses Software
Cites Work
- A Stochastic Quasi-Newton Method for Large-Scale Optimization
- Improved bounds on sample size for implicit matrix trace estimators
- Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
- Estimating the dimension of a model
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Matrix completion discriminant analysis
- Exact matrix completion via convex optimization
- A Matrix-free Approach for Solving the Parametric Gaussian Process Maximum Likelihood Problem
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- Generalised information criteria in model selection
- Unbiased Risk Estimates for Singular Value Thresholding and Spectral Estimators
- Efficient Regularization Parameter Selection Via Information Criteria
- Convex biclustering
- Nested Dissection of a Regular Finite Element Mesh
- The Estimation of Prediction Error
- Unnamed Item
- Unnamed Item
This page was built for publication: Going Off the Grid: Iterative Model Selection for Biclustered Matrix Completion
