Concept

Polynôme d'Hermite

Publications associées (136)

Nonlinear simulation of plasma turbulence using a gyrokinetic moment-based approach

Plasma turbulence plays a fundamental role in determining the performances of magnetic confinement fusion devices, such as tokamaks. Advances in computer science, combined with the development of efficient physical models, have significantly improved our u ...

EPFL2024

TIC-TAC: A Framework for Improved Covariance Estimation in Deep Heteroscedastic Regression

Mathieu Salzmann, Alexandre Massoud Alahi, Megh Hiren Shukla

Deep heteroscedastic regression involves jointly optimizing the mean and covariance of the predicted distribution using the negative log-likelihood. However, recent works show that this may result in sub-optimal convergence due to the challenges associated ...

2024

Gyrokinetic moment-based simulations of the Dimits shift

Paolo Ricci, Baptiste Jimmy Frei, Antoine Cyril David Hoffmann

We present a convergence study of the gyromoment (GM) approach, which is based on projecting the gyrokinetic distribution function onto a Hermite–Laguerre polynomial basis, focused on the cyclone base case (CBC) (Lin et al., Phys. Rev. Lett., vol. 83, no. ...

2023

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

Lp-regularity theory for the stochastic reaction-diffusion equation with super-linear multiplicative noise and strong dissipativity

Jaeyun Yi

We study the existence, uniqueness, and regularity of the solution to the stochastic reaction-diffusion equation (SRDE) with colored noise F-center dot:partial derivative(t)u = aijuxixj +biuxi + cu - bu1+beta +xi u1+gamma F-center dot, (t, x) is ...

San Diego2023

Finite free convolutions of polynomials

Adam Wade Marcus

We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices. The symmetric addi ...

SPRINGER HEIDELBERG2022

A PCP Theorem for Interactive Proofs and Applications

Alessandro Chiesa

The celebrated PCP Theorem states that any language in NP can be decided via a verifier that reads O(1) bits from a polynomially long proof. Interactive oracle proofs (IOP), a generalization of PCPs, allow the verifier to interact with the prover for multi ...

SPRINGER INTERNATIONAL PUBLISHING AG2022

The spectral bias of polynomial neural networks

Volkan Cevher, Grigorios Chrysos, Leello Tadesse Dadi, Moulik Choraria

Polynomial neural networks (PNNs) have been recently shown to be particularly effective at image generation and face recognition, where high-frequency information is critical. Previous studies have revealed that neural networks demonstrate a spectral bias ...

2022

Hidden-nucleons neural-network quantum states for the nuclear many-body problem

Giuseppe Carleo

We generalize the hidden-fermion family of neural network quantum states to encompass both continuous and discrete degrees of freedom and solve the nuclear many-body Schrodinger equation in a systematically improvable fashion. We demonstrate that adding hi ...

AMER PHYSICAL SOC2022

Horizontal stiffness of multi-storey timber buildings

This thesis evaluates the effects of the position of the concrete core and its stiffness on the horizontal deformation of a multi-storey timber-concrete hybrid building. As part of the evaluation a calculation method with polynomial functions was derived t ...

2021

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