Optimal Regularization Can Mitigate Double Descent. Nakkiran, P., Venkat, P., Kakade, S. M., & Ma, T. CoRR, 2020. Paper bibtex @article{DBLP:journals/corr/abs-2003-01897,
author = {Preetum Nakkiran and
Prayaag Venkat and
Sham M. Kakade and
Tengyu Ma},
title = {Optimal Regularization Can Mitigate Double Descent},
journal = {CoRR},
volume = {abs/2003.01897},
year = {2020},
url = {https://arxiv.org/abs/2003.01897},
archivePrefix = {arXiv},
eprint = {2003.01897},
timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2003-01897.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
Downloads: 0
{"_id":"hRMavCWWYyPqj5cZD","bibbaseid":"nakkiran-venkat-kakade-ma-optimalregularizationcanmitigatedoubledescent-2020","authorIDs":["Qs85rjgnWg6CruLc4"],"author_short":["Nakkiran, P.","Venkat, P.","Kakade, S. M.","Ma, T."],"bibdata":{"bibtype":"article","type":"article","author":[{"firstnames":["Preetum"],"propositions":[],"lastnames":["Nakkiran"],"suffixes":[]},{"firstnames":["Prayaag"],"propositions":[],"lastnames":["Venkat"],"suffixes":[]},{"firstnames":["Sham","M."],"propositions":[],"lastnames":["Kakade"],"suffixes":[]},{"firstnames":["Tengyu"],"propositions":[],"lastnames":["Ma"],"suffixes":[]}],"title":"Optimal Regularization Can Mitigate Double Descent","journal":"CoRR","volume":"abs/2003.01897","year":"2020","url":"https://arxiv.org/abs/2003.01897","archiveprefix":"arXiv","eprint":"2003.01897","timestamp":"Tue, 10 Mar 2020 00:00:00 +0100","biburl":"https://dblp.org/rec/journals/corr/abs-2003-01897.bib","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@article{DBLP:journals/corr/abs-2003-01897,\n author = {Preetum Nakkiran and\n Prayaag Venkat and\n Sham M. Kakade and\n Tengyu Ma},\n title = {Optimal Regularization Can Mitigate Double Descent},\n journal = {CoRR},\n volume = {abs/2003.01897},\n year = {2020},\n url = {https://arxiv.org/abs/2003.01897},\n archivePrefix = {arXiv},\n eprint = {2003.01897},\n timestamp = {Tue, 10 Mar 2020 00:00:00 +0100},\n biburl = {https://dblp.org/rec/journals/corr/abs-2003-01897.bib},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Nakkiran, P.","Venkat, P.","Kakade, S. M.","Ma, T."],"key":"DBLP:journals/corr/abs-2003-01897","id":"DBLP:journals/corr/abs-2003-01897","bibbaseid":"nakkiran-venkat-kakade-ma-optimalregularizationcanmitigatedoubledescent-2020","role":"author","urls":{"Paper":"https://arxiv.org/abs/2003.01897"},"metadata":{"authorlinks":{"nakkiran, p":"https://bibbase.org/show?bib=http%3A%2F%2Fpreetum.nakkiran.org%2Fpubs%2Fpubs.bib&fullnames=1"}}},"bibtype":"article","biburl":"http://preetum.nakkiran.org/pubs/pubs.bib","creationDate":"2020-11-29T22:03:02.718Z","downloads":0,"keywords":[],"search_terms":["optimal","regularization","mitigate","double","descent","nakkiran","venkat","kakade","ma"],"title":"Optimal Regularization Can Mitigate Double Descent","year":2020,"dataSources":["mYRuxxL9PCiJjf4nA"]}