Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimal computational and statistical rates of convergence for sparse nonconvex learning problems |
scientific article; zbMATH DE number 6383648
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal computational and statistical rates of convergence for sparse nonconvex learning problems |
scientific article; zbMATH DE number 6383648 |
Statements
Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (English)
0 references
6 January 2015
0 references
nonconvex regularized \(M\)-estimation
0 references
path-following method
0 references
geometric computational rate
0 references
optimal statistical rate
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.91889036
0 references
0.9059204
0 references
0.9014917
0 references
0.8949741
0 references
0.8949532
0 references
0.89419377
0 references
0.88691473
0 references
0.8860613
0 references
0.8858365
0 references
