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 (5 downloads)
Average Time 1 hrs, 48 mins, 26 secs
Average Speed 0.05kB/s
Best Time 4 mins, 25 secs
Best Speed 1.19kB/s
Worst Time 8 hrs, 44 mins, 27 secs
Worst Speed 0.01kB/s

Send Feedback