Double-Loop Unadjusted Langevin Algorithm

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.

For many environmental processes, recent studies have shown that the dependence strength is decreasing when quantile levels increase. This implies that the popular max-stable models are inadequate to capture the rate of joint tail decay, and to estimate jo ...

We study stochastic programs where the decision-maker cannot observe the distribution of the exogenous uncertainties but has access to a finite set of independent samples from this distribution. In this setting, the goal is to find a procedure that transfo ...

Maximum-Entropy Distributions offer an attractive family of probability densities suitable for moment closure problems. Yet finding the Lagrange multipliers which parametrize these distributions, turns out to be a computational bottleneck for practical clo ...

xtreme value analysis is concerned with the modelling of extreme events such as floods and heatwaves, which can have large impacts. Statistical modelling can be useful to better assess risks even if, due to scarcity of measurements, there is inherently ver ...

Real-time plasma electron density profile estimation and control are essential in the operation of future tokamaks. In particular, the robustness against diagnostics failure and disturbances is important for long pulse operation. ...

The efficiency of stochastic particle schemes for large scale simulations relies on the ability to preserve a uniform distribution of particles in the whole physical domain. While simple particle split and merge algorithms have been considered previously, ...

This work studies the robustness certification problem of neural network models, which aims to find certified adversary-free regions as large as possible around data points. In contrast to the existing approaches that seek regions bounded uniformly along a ...

Two characteristics that make convex decomposition algorithms attractive are simplicity of operations and generation of parallelizable structures. In principle, these schemes require that all coordinates update at the same time, i.e., they are synchronous ...

Probabilistic parameter estimation in model fitting runs the gamut from maximum likelihood or maximum a posteriori point estimates from optimization to Markov Chain Monte Carlo (MCMC) sampling. The latter, while more computationally intensive, generally pr ...

Adversarial learning is an emergent technique that provides better security to machine learning systems by deliberately protecting them against specific vulnerabilities of the learning algorithms. Many adversarial learning problems can be cast equivalently ...

Double-Loop Unadjusted Langevin Algorithm

Chat with Graph Search

Max-infinitely divisible models and inference for spatial extremes

From Data to Decisions: Distributionally Robust Optimization is Optimal

Gaussian Process Regression for Maximum Entropy Distribution

Contributions to Likelihood-Based Modelling of Extreme Values

Model-based real-time plasma electron density profile estimation and control on ASDEX Upgrade and TCV

Particle number control for direct simulation Monte-Carlo methodology using kernel estimates

On Certifying Non-Uniform Bounds against Adversarial Attacks

An Inertial Parallel and Asynchronous Forward-Backward Iteration for Distributed Convex Optimization

Robust Biophysical Parameter Estimation with a Neural Network Enhanced Hamiltonian Markov Chain Monte Carlo Sampler

Adversarial Analytics