Publication

Controlling the Complexity and Lipschitz Constant improves Polynomial Nets

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.

Publications related to Controlling the Complexity and Lipschitz Constant improves Polynomial Nets | EPFL Graph Search

Controlling the Complexity and Lipschitz Constant improves Polynomial Nets

Graph Chatbot

Chat with Graph Search

Deep learning approach for identification of H II regions during reionization in 21-cm observations - II. Foreground contamination

Sparse autoregressive neural networks for classical spin systems

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

Machine Learning for Modeling Stock Returns

Incorporating Projective Geometry into Deep Learning

A graph convolutional autoencoder approach to model order reduction for parametrized PDEs

Gibbs sampling the posterior of neural networks

Optimizing Dynamic Aperture Studies with Active Learning

Explainable Fault Diagnosis of Oil-Immersed Transformers: A Glass-Box Model

Mitigating Object Dependencies: Improving Point Cloud Self-Supervised Learning through Object Exchange