Publication

Lipschitz constant estimation for Neural Networks via sparse polynomial optimization

Related publications (33)

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.

Lipschitz constant estimation for Neural Networks via sparse polynomial optimization

Graph Chatbot

Chat with Graph Search

Task-driven neural network models predict neural dynamics of proprioception: Experimental data, activations and predictions of neural network models

Stable parameterization of continuous and piecewise-linear functions

Probabilistic methods for neural combinatorial optimization

Benign Overfitting in Deep Neural Networks under Lazy Training

Robust Training and Verification of Deep Neural Networks

Deep Learning Generalization with Limited and Noisy Labels

End-to-End Learning for Stochastic Optimization: A Bayesian Perspective

Hamiltonian Deep Neural Networks Guaranteeing Non-Vanishing Gradients by Design

Predicting in Uncertain Environments: Methods for Robust Machine Learning

Controlling the Complexity and Lipschitz Constant improves Polynomial Nets