Understanding Deep Learning

The project aims to establish a solid theoretical foundation for deep learning by investigating optimization, statistical complexity, and representation, enhancing understanding and algorithm development.

Subsidie
€ 1.499.750
2022

Projectdetails

Introduction

While extremely successful, deep learning (DL) still lacks a solid theoretical foundation.

Recent Achievements

In the last 5 years, the PI focused almost entirely on DL theory, yielding a strong publication record with:

  1. 7 papers at NeurIPS (the leading ML conference), including:
    • 2 spotlights (top 3% of submitted papers)
    • 1 oral (top 1%)
  2. 2 papers at ICLR (the leading DL conference)
  3. 1 paper at COLT (the leading ML theory conference)

These results are amongst the first that break a 20-year hiatus in NN theory, thereby giving some hope for a solid deep learning theory. Key contributions include:

  1. The first poly-time learnability result for non-trivial function class by SGD on NN.
  2. The first such result with near optimal rate.
  3. New methodology to bound the sample complexity of NN, establishing the first sample complexity bound that is sublinear in the number of parameters, under norm constraints that are valid in practice.
  4. An explanation for the phenomena of adversarial examples.

Future Plans

We plan to go far beyond these and other results, and to build a coherent theory for DL, addressing all three pillars of learning theory:

Optimization

We plan to investigate the success of SGD in finding a good model, arguably the greatest mystery of modern deep learning. Specifically, our goal is to understand what models are learnable by SGD on neural networks. To this end, we plan to come up with a new class of models that can potentially lead to new deep learning algorithms, with a solid theory behind them.

Statistical Complexity

We plan to crack the second great mystery of modern deep learning, which is their ability to generalize with fewer examples than parameters. Our plan is to investigate the sample complexity of classes of neural networks that are defined by bounds on the weights’ magnitude.

Representation

We plan to investigate functions that can be realized by NN. This includes classical questions such as the benefits of depth, as well as more modern aspects such as adversarial examples.

Financiële details & Tijdlijn

Financiële details

Subsidiebedrag€ 1.499.750
Totale projectbegroting€ 1.499.750

Tijdlijn

Startdatum1-9-2022
Einddatum31-8-2027
Subsidiejaar2022

Partners & Locaties

Projectpartners

  • THE HEBREW UNIVERSITY OF JERUSALEMpenvoerder

Land(en)

Israel

Vergelijkbare projecten binnen European Research Council

ERC STG

MANUNKIND: Determinants and Dynamics of Collaborative Exploitation

This project aims to develop a game theoretic framework to analyze the psychological and strategic dynamics of collaborative exploitation, informing policies to combat modern slavery.

€ 1.497.749
ERC STG

Elucidating the phenotypic convergence of proliferation reduction under growth-induced pressure

The UnderPressure project aims to investigate how mechanical constraints from 3D crowding affect cell proliferation and signaling in various organisms, with potential applications in reducing cancer chemoresistance.

€ 1.498.280
ERC STG

Uncovering the mechanisms of action of an antiviral bacterium

This project aims to uncover the mechanisms behind Wolbachia's antiviral protection in insects and develop tools for studying symbiont gene function.

€ 1.500.000
ERC STG

The Ethics of Loneliness and Sociability

This project aims to develop a normative theory of loneliness by analyzing ethical responsibilities of individuals and societies to prevent and alleviate loneliness, establishing a new philosophical sub-field.

€ 1.025.860

Vergelijkbare projecten uit andere regelingen

ERC ADG

Control for Deep and Federated Learning

CoDeFeL aims to enhance machine learning methods through control theory, developing efficient ResNet architectures and federated learning techniques for applications in digital medicine and recommendations.

€ 2.499.224
ERC COG

Theoretical Understanding of Classic Learning Algorithms

The TUCLA project aims to enhance classic machine learning algorithms, particularly Bagging and Boosting, to achieve faster, data-efficient learning and improve their theoretical foundations.

€ 1.999.288