Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/uai/LiJHA0HZ19
%A Li, Xingguo
%A Jiang, Haoming
%A Haupt, Jarvis D.
%A Arora, Raman
%A Liu, Han
%A Hong, Mingyi
%A Zhao, Tuo
%B UAI
%D 2019
%E Globerson, Amir
%E Silva, Ricardo
%I AUAI Press
%K dblp
%P 49-59
%T On Fast Convergence of Proximal Algorithms for SQRT-Lasso Optimization: Don't Worry About its Nonsmooth Loss Function.
%U http://dblp.uni-trier.de/db/conf/uai/uai2019.html#LiJHA0HZ19
%V 115
@inproceedings{conf/uai/LiJHA0HZ19,
added-at = {2020-12-15T00:00:00.000+0100},
author = {Li, Xingguo and Jiang, Haoming and Haupt, Jarvis D. and Arora, Raman and Liu, Han and Hong, Mingyi and Zhao, Tuo},
biburl = {https://www.bibsonomy.org/bibtex/255ed32eff0343636c7bd1bf15db7268a/dblp},
booktitle = {UAI},
crossref = {conf/uai/2019},
editor = {Globerson, Amir and Silva, Ricardo},
ee = {http://auai.org/uai2019/proceedings/papers/13.pdf},
interhash = {e18e1c0f5751d23bbb35c4b617b18555},
intrahash = {55ed32eff0343636c7bd1bf15db7268a},
keywords = {dblp},
pages = {49-59},
publisher = {AUAI Press},
series = {Proceedings of Machine Learning Research},
timestamp = {2024-04-09T13:31:22.000+0200},
title = {On Fast Convergence of Proximal Algorithms for SQRT-Lasso Optimization: Don't Worry About its Nonsmooth Loss Function.},
url = {http://dblp.uni-trier.de/db/conf/uai/uai2019.html#LiJHA0HZ19},
volume = 115,
year = 2019
}