Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875): Difference between revisions
From MaRDI portal
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: FPC_AS / rank | |||
Normal rank | |||
Revision as of 21:35, 29 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal computational and statistical rates of convergence for sparse nonconvex learning problems |
scientific article |
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
