Optimal computational and statistical rates of convergence for sparse nonconvex learning problems (Q482875): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q43079370, #quickstatements; #temporary_batch_1704736726153 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 04:53, 30 January 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
