Publication

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

Publications associées (110)

Generalization of Scaled Deep ResNets in the Mean-Field Regime

Volkan Cevher, Grigorios Chrysos, Fanghui Liu

Despite the widespread empirical success of ResNet, the generalization properties of deep ResNet are rarely explored beyond the lazy training regime. In this work, we investigate scaled ResNet in the limit of infinitely deep and wide neural networks, of wh ...

2024

Gibbs sampling the posterior of neural networks

Lenka Zdeborová, Giovanni Piccioli, Emanuele Troiani

In this paper, we study sampling from a posterior derived from a neural network. We propose a new probabilistic model consisting of adding noise at every pre- and post-activation in the network, arguing that the resulting posterior can be sampled using an ...

Bristol2024

ZigZag: Universal Sampling-free Uncertainty Estimation Through Two-Step Inference

Nikita Durasov, Minh Hieu Lê, Nik Joel Dorndorf

Whereas the ability of deep networks to produce useful predictions on many kinds of data has been amply demonstrated, estimating the reliability of these predictions remains challenging. Sampling approaches such as MC-Dropout and Deep Ensembles have emerge ...

2024

Valence can control the nonexponential viscoelastic relaxation of multivalent reversible gels

Hugo Camille Valentin Le Roy

Gels made of telechelic polymers connected by reversible cross-linkers are a versatile design platform for biocompatible viscoelastic materials. Their linear response to a step strain displays a fast, near-exponential relaxation when using low-valence cros ...

Amer Assoc Advancement Science2024

Polynomial-time universality and limitations of deep learning

Emmanuel Abbé

The goal of this paper is to characterize function distributions that general neural networks trained by descent algorithms (GD/SGD), can or cannot learn in polytime. The results are: (1) The paradigm of general neural networks trained by SGD is poly-time ...

WILEY2023

Learning Robust and Adaptive Representations: from Interactions, for Interactions

Yuejiang Liu

Interactions are ubiquitous in our world, spanning from social interactions between human individuals to physical interactions between robots and objects to mechanistic interactions among different components of an intelligent system. Despite their prevale ...

EPFL2023

Robust discrete choice models with t-distributed kernel errors

Michel Bierlaire, Thomas Gasos, Prateek Bansal

Outliers in discrete choice response data may result from misclassification and misreporting of the response variable and from choice behaviour that is inconsistent with modelling assumptions (e.g. random utility maximisation). In the presence of outliers, ...

2023

Divergent X-ray tomography reconstruction and optimisation

Youssef Haouchat

In diverse fields such as medical imaging, astrophysics, geophysics, or material study, a common challenge exists: reconstructing the internal volume of an object using only physical measurements taken from its exterior or surface. This scientific approach ...

2023

On double-descent in uncertainty quantification in overparametrized models

Florent Gérard Krzakala, Lenka Zdeborová, Lucas Andry Clarte, Bruno Loureiro, Bruno Loureiro

Uncertainty quantification is a central challenge in reliable and trustworthy machine learning. Naive measures such as last-layer scores are well-known to yield overconfident estimates in the context of overparametrized neural networks. Several methods, ra ...

PMLR Proceedings of Machine Learning Research2023

Explicit representations for Banach subspaces of Lizorkin distributions

Michaël Unser, Sebastian Jonas Neumayer

The Lizorkin space is well suited to the study of operators like fractional Laplacians and the Radon transform. In this paper, we show that the space is unfortunately not complemented in the Schwartz space. In return, we show that it is dense in C0(Double- ...

WORLD SCIENTIFIC PUBL CO PTE LTD2023

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search