Going Off the Grid: Iterative Model Selection for Biclustered Matrix Completion
From MaRDI portal
Cites work
- A matrix-free approach for solving the parametric Gaussian process maximum likelihood problem
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A Singular Value Thresholding Algorithm for Matrix Completion
- A Stochastic Estimator of the Trace of the Influence Matrix for Laplacian Smoothing Splines
- A stochastic quasi-Newton method for large-scale optimization
- Convex biclustering
- Efficient regularization parameter selection via information criteria
- Estimating the dimension of a model
- Exact matrix completion via convex optimization
- Generalised information criteria in model selection
- Generalized Cross-Validation as a Method for Choosing a Good Ridge Parameter
- ggplot2. Elegant graphics for data analysis
- Improved bounds on sample size for implicit matrix trace estimators
- Matrix completion discriminant analysis
- Nested Dissection of a Regular Finite Element Mesh
- Randomized algorithms for estimating the trace of an implicit symmetric positive semi-definite matrix
- Smoothing noisy data with spline functions: Estimating the correct degree of smoothing by the method of generalized cross-validation
- Spectral regularization algorithms for learning large incomplete matrices
- The Estimation of Prediction Error
- Unbiased Risk Estimates for Singular Value Thresholding and Spectral Estimators
This page was built for publication: Going Off the Grid: Iterative Model Selection for Biclustered Matrix Completion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391180)
