Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
سال
: 2014شناسه الکترونیک: 10.1214/14-AOS1238
کلیدواژه(گان): Nonconvex regularized $M$,path,geometric computational rate,optimal statistical rate
کالکشن
:
-
آمار بازدید
Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
Show full item record
| contributor author | Wang, Zhaoran - Liu, Han - Zhang, Tong | |
| date accessioned | 2020-03-12T11:01:01Z | |
| date available | 2020-03-12T11:01:01Z | |
| date issued | 2014 | |
| identifier issn | 0090-5364 | |
| identifier other | 10.1214.14-AOS1238.pdf | |
| identifier uri | https://libsearch.um.ac.ir:443/fum/handle/fum/843926 | |
| format | general | |
| language | English | |
| publisher | The Institute of Mathematical Statistics | |
| title | Optimal computational and statistical rates of convergence for sparse nonconvex learning problems | |
| type | Journal Paper | |
| contenttype | Metadata Only | |
| identifier padid | 6670383 | |
| subject keywords | Nonconvex regularized $M$ | |
| subject keywords | path | |
| subject keywords | geometric computational rate | |
| subject keywords | optimal statistical rate | |
| identifier doi | 10.1214/14-AOS1238 | |
| journal title | The Annals of Statistics | |
| journal volume | 42 | |
| journal issue | 6 | |
| filesize | 662463 | |
| citations | 0 |