Stable high-order randomized cubature formulae in arbitrary dimension
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 analyze the accuracy of the discrete least-squares approximation of a function u in multivariate polynomial spaces PΛ:=span{y↦yν:ν∈Λ} with Λ⊂N0d over the domain Γ:=[−1,1]d, based on the s ...
In this article, we present a new linear model (3LP) for bipedal locomotion which can describe swing and torso dynamics as well as falling. Compared to traditional inverted-pendulum based models, 3LP produces more human-like center of mass trajectory and s ...
Wasserstein distances are metrics on probability distributions inspired by the problem of optimal mass transportation. Roughly speaking, they measure the minimal effort required to reconfigure the probability mass of one distribution in order to recover th ...
In this paper we develop and analyze a multilevel weighted reduced basis method for solving stochastic optimal control problems constrained by Stokes equations. We prove the analytic regularity of the optimal solution in the probability space under certain ...
Two subsets A,B of an n-element ground set X are said to be crossing, if none of the four sets AB, A\B, B\A and X(AB) are empty. It was conjectured by Karzanov and Lomonosov forty years ago that if a family F of subsets of X does not contain k pairwise cr ...
Let F 2 C[x; y; z] be a constant-degree polynomial, and let A; B; C subset of C be finite sets of size n. We show that F vanishes on at most O(n(11/6))points of the Cartesian product A X B X C, unless F has a special group-related form. This improves a the ...
We introduce the first passage set (FPS) of constant level -a of the two-dimensional continuum Gaussian free field (GFF) on finitely connected domains. Informally, it is the set of points in the domain that can be connected to the boundary by a path on whi ...
The likelihood function is a fundamental component in Bayesian statistics. However, evaluating the likelihood of an observation is computationally intractable in many applications. In this paper, we propose a non-parametric approximation of the likelihood ...
Path integrals play a crucial role in describing the dynamics of physical systems subject to classical or quantum noise. In fact, when correctly normalized, they express the probability of transition between two states of the system. In this work, we show ...
A novel probabilistic numerical method for quantifying the uncertainty induced by the time integration of ordinary differential equations (ODEs) is introduced. Departing from the classical strategy to randomize ODE solvers by adding a random forcing term, ...
