Publication

Polynomial-time universality and limitations of deep learning

Related publications (79)

About
Privacy
Disclaimer

Graph Chatbot

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.

Polynomial-time universality and limitations of deep learning

Graph Chatbot

Chat with Graph Search

Moment approach of the multi-species non-linear Coulomb collision operator adapted to particle-in-cell codes

Trainable Preprocessing for Reduced Precision Neural Networks

A t-distribution based operator for enhancing out of distribution robustness of neural network classifiers

Crowding and the Architecture of the Visual System

On Vacuous and Non-Vacuous Generalization Bounds for Deep Neural Networks.

The Unstoppable Rise of Computational Linguistics in Deep Learning

Optimization and Generalization of Shallow Neural Networks with Quadratic Activation Functions

ESSOP: Efficient and Scalable Stochastic Outer Product Architecture for Deep Learning

Learning approaches to high-fidelity optical diffraction tomography

Deep Neural Networks With Trainable Activations and Controlled Lipschitz Constant