Implicit regularization in AI meets generalized hardness of approximation in optimization -- Sharp results for diagonal linear networks (Q6443802)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Implicit regularization in AI meets generalized hardness of approximation in optimization -- Sharp results for diagonal linear networks |
preprint article from arXiv
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implicit regularization in AI meets generalized hardness of approximation in optimization -- Sharp results for diagonal linear networks |
preprint article from arXiv |
Statements
13 July 2023
0 references
cs.LG
0 references
math.OC
0 references
stat.ML
0 references
Johan S. Wind
0 references
Vegard Antun
0 references
Anders C. Hansen
0 references
