MATHICSE Technical Report : Convergence of quasi-optimal stochastic Galerkin methods for a class of PDES with random coefficients
Publications associées (32)
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.
We consider the idealized setting of gradient flow on the population risk for infinitely wide two-layer ReLU neural networks (without bias), and study the effect of symmetries on the learned parameters and predictors. We first describe a general class of s ...
Population equations for infinitely large networks of spiking neurons have a long tradition in theoret-ical neuroscience. In this work, we analyze a recent generalization of these equations to populations of finite size, which takes the form of a nonlinear ...
We initiate the study of neural network quantum state algorithms for analyzing continuous-variable quantum systems in which the quantum degrees of freedom correspond to coordinates on a smooth manifold. A simple family of continuous-variable trial wavefunc ...
In this paper, we set the mathematical foundations of the Dynamical Low Rank Approximation (DLRA) method for high-dimensional stochastic differential equations. DLRA aims at approximating the solution as a linear combination of a small number of basis vect ...
Model-based reinforcement learning for robot control offers the advantages of overcoming concerns on data collection and iterative processes for policy improvement in model-free methods. However, both methods use exploration strategy relying on heuristics ...
The Internodes method is a general purpose method to deal with non-conforming discretizations of partial differential equations on 2D and 3D regions partitioned into disjoint subdomains. In this paper we are interested in measuring how much the Internodes ...
Removing geometrical details from a complex domain is a classical operation in computer aided design for simulation and manufacturing. This procedure simplifies the meshing process, and it enables faster simulations with less memory requirements. But depen ...
Tensor trains are a versatile tool to compress and work with high-dimensional data and functions. In this work we introduce the streaming tensor train approximation (STTA), a new class of algorithms for approximating a given tensor ' in the tensor train fo ...
Predictive models based on machine learning (ML) offer a compelling promise: bringing clarity and structure to complex natural and social environments. However, the use of ML poses substantial risks related to the privacy of their training data as well as ...
In this work, we tackle the problem of minimising the Conditional-Value-at-Risk (CVaR) of output quantities of complex differential models with random input data, using gradient-based approaches in combination with the Multi-Level Monte Carlo (MLMC) method ...