搜索结果: 1-6 共查到“统计学 relaxation”相关记录6条 . 查询时间(0.218 秒)
A spatio-spectral hybridization for edge preservation and noisy image restoration via local parametric mixtures and Lagrangian relaxation
Edge preserving smoother Semiparametric mixture model Partition of unity MISE Variational optimization Thin Plate Splines Spectral embedding Local template mod-els Multiple hypothesis testing.
2012/11/22
This paper investigates a fully unsupervised statistical method for edge preserving image restoration and compression using a spatial decomposition scheme. Smoothed maximum likelihood is used for loca...
The LASSO for generic design matrices as a function of the relaxation parameter
linear regression LASSO relaxation parameter
2011/6/16
The LASSO is a variable subset selection procedure in statistical
linear regression based on ℓ1 penalization of the least-squares
operator. Its behavior crucially depends, both in practice and...
Multi-stage Convex Relaxation for Feature Selection
Multi-stage Convex Relaxation Feature Selection
2011/7/5
A number of recent work studied the effectiveness of feature selection using Lasso. It is known that under the restricted isometry properties (RIP), Lasso does not generally lead to the exact recovery...
Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions
Noisy matrix decomposition via convex relaxation high dimensions
2011/3/24
We analyze a class of estimators based on convex relaxation for solving high-dimensional matrix decomposition problems. The observations are the noisy realizations of the sum of an (appproximately) lo...
Relaxation Penalties and Priors for Plausible Modeling of Nonidentified Bias Sources
Bias biostatistics causality epidemiology measurement error misclassification observational studies odds ratio relative risk
2010/3/9
In designed experiments and surveys, known laws or de-
sign feat ures provide checks on the most relevant aspects of a model
and identify the target parameters. In contrast, in most observational
s...
Using the Eigenvalue Relaxation for Binary Least-Squares Estimation Problems
Eigenvalue Relaxation Binary Least-Squares Estimation Problems
2010/3/18
The goal of this paper is to survey the properties of the eigenvalue relaxation for least squares binary problems. This relaxation is a convex program which is obtained as the Lagrangian dual of the o...
