Publication

Computational complexity of deep learning: fundamental limitations and empirical phenomena

Ludovic Théo Stephan, Alessandro Favero
2024

Abstract

This manuscript is the lecture notes of B. Barak’s course in the Les Houches ‘Statistical Physics and Machine Learning’ summer school in 2022. It surveys various proxies for computational hardness in random planted problems, from the low-degree likelihood ratio to statistical query complexity and the Franz–Parisi criterion, as well as the various relationships between those criteria. We also present a few aspects of the study of deep learning, from both a theoretical and empirical point of view.

Official source

https://infoscience.epfl.ch/entities/publication/7dc41ed0-f4dd-415f-a56f-c7fe12a4f2bc

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Computational complexity of deep learning: fundamental limitations and empirical phenomena

Chat with Graph Search

Extending Capabilities of Attention-based Models

Uncertainty quantification for a deep learning models for image-based crack segmentation

FSscore: A Personalized Machine Learning-Based Synthetic Feasibility Score