Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming
Martin J. Wainwright and Bin Yu and Garvesh Raskutti

Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming.pdf 316.40kB
Type: Paper
Tags:

Bibtex:
@article{13:13,author={Garvesh Raskutti and Martin J. Wainwright and Bin Yu}, Title={Minimax-Optimal Rates For Sparse Additive Models Over Kernel Classes Via Convex Programming},journal={Journal of Machine Learning Research},volume={13}, url={http://www.jmlr.org/papers/volume13/raskutti12a/raskutti12a.pdf}}
Hosted by users
10 day statistics (4 downloads)
Average Time 4 mins, 26 secs
Average Speed 1.19kB/s
Best Time 4 mins, 25 secs
Best Speed 1.19kB/s
Worst Time 4 mins, 28 secs
Worst Speed 1.18kB/s

Send Feedback Start
   0.000008
DB Connect
   0.000450
Lookup hash in DB
   0.000394
Get torrent details
   0.000112
Get torrent details, finished
   0.000200
Get authors
   0.000000
Select authors
   0.000166
Parse bibtex
   0.000026
Write header
   0.000169
get stars
   0.000106
home tab
   0.000107
render right panel
   0.000007
render ads
   0.000321
fetch current hosters
   0.000239
Start get stats
   0.000365
End get stats
   0.000001
related datasets
   0.001147
Done