Implicit regularization in AI meets generalized hardness of approximation in optimization -- Sharp results for diagonal linear networks

arXiv2307.07410MaRDI QIDQ6443802FDOQ6443802

Authors: Johan S. Wind, Vegard Antun, Anders C. Hansen 

Publication date: 13 July 2023

Has companion code repository: https://github.com/johanwind/which_l1_minimizer

Mathematics Subject Classification ID

Convex programming (90C25) Artificial neural networks and deep learning (68T07) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Robustness in mathematical programming (90C17)

This page was built for publication: Implicit regularization in AI meets generalized hardness of approximation in optimization -- Sharp results for diagonal linear networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6443802)