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.

Many applications, e.g. in content recommendation, sports, or recruitment, leverage the comparisons of alternatives to score those alternatives. The classical Bradley-Terry model and its variants have been widely used to do so. The historical model conside ...

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 ...

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 ...

Advances in computing have enabled widespread access to pose estimation, creating new sources of data streams. Unlike mock set-ups for data collection, tapping into these data streams through on-device active learning allows us to directly sample from the ...

Image noise can often be accurately fitted to a Poisson-Gaussian distribution. However, estimating the distribution parameters from a noisy image only is a challenging task. Here, we study the case when paired noisy and noise-free samples are accessible. N ...

We discuss the use of likelihood asymptotics for inference on risk measures in univariate extreme value problems, focusing on estimation of high quantiles and similar summaries of risk for uncertainty quantification. We study whether higher-order approxima ...

Many robotics problems are formulated as optimization problems. However, most optimization solvers in robotics are locally optimal and the performance depends a lot on the initial guess. For challenging problems, the solver will often get stuck at poor loc ...

Crossing properties of soil saturation, defined as the duration and excursion of soil saturation below and above certain thresholds, are key variables to ecosystem functioning and evolution by primarily influencing the plant and soil microbes physiological ...

Statistical models for extreme values are generally derived from non-degenerate probabilistic limits that can be used to approximate the distribution of events that exceed a selected high threshold. If convergence to the limit distribution is slow, then th ...

The increasing integration of intermittent renewable generation, especially at the distribution level, necessitates advanced planning and optimisation methodologies contingent on the knowledge of the admittance matrix, capturing the topology and line param ...

Spatial count data models are used to explain and predict the frequency of phenomena such as traffic accidents in geographically distinct entities such as census tracts or road segments. These models are typically estimated using Bayesian Markov chain Mont ...

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 ...

We introduce a distributionally robust maximum likelihood estimation model with a Wasserstein ambiguity set to infer the inverse covariance matrix of a p-dimensional Gaussian random vector from n independent samples. The proposed model minimizes the worst ...

Many decision problems in science, engineering, and economics are affected by uncertainty, which is typically modeled by a random variable governed by an unknown probability distribution. For many practical applications, the probability distribution is onl ...

It is well known and readily seen that the maximum of n independent and uniformly on [0, 1] distributed random variables, suitably standardised, converges in total variation distance, as n increases, to the standard negative exponential distribution. We ex ...

We derive generalization and excess risk bounds for neural networks using a family of complexity measures based on a multilevel relative entropy. The bounds are obtained by introducing the notion of generated hierarchical coverings of neural networks and b ...

The maximal achievable advantage of a (computationally unbounded) distinguisher to determine whether a source

Z

is distributed according to distribution

P_0

P_1

, when given access to one sample of

Z

, is characterized by the statistical distance ...

Mechanism design theory examines the design of allocation mechanisms or incentive systems involving multiple rational but self-interested agents and plays a central role in many societally important problems in economics. In mechanism design problems, agen ...

The classical multivariate extreme-value theory concerns the modeling of extremes in a multivariate random sample, suggesting the use of max-stable distributions. In this work, the classical theory is extended to the case where aggregated data, such as max ...

In distributionally robust optimization the probability distribution of the uncertain problem parameters is itself uncertain, and a fictitious adversary, e.g., nature, chooses the worst distribution from within a known ambiguity set. A common shortcoming o ...

Double-Loop Unadjusted Langevin Algorithm

Chat with Graph Search

Generalized Bradley-Terry Models for Score Estimation from Paired Comparisons

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

Learning Robust and Adaptive Representations: from Interactions, for Interactions

VL4Pose: Active Learning Through Out-Of-Distribution Detection For Pose Estimation

PoGaIN: Poisson-Gaussian Image Noise Modeling From Paired Samples

Improved Inference On Risk Measures For Univariate Extremes

Memory of Motion for Initializing Optimization in Robotics

Improved framework to estimate travel time and derived distributions in hydrological control volumes

Sub‐asymptotic motivation for new conditional multivariate extreme models

Bayesian Methods for the Identification of Distribution Networks

Fast Bayesian estimation of spatial count data models

Gaussian Process Regression for Maximum Entropy Distribution

Distributionally Robust Inverse Covariance Estimation: The Wasserstein Shrinkage Estimator

Wasserstein Distributionally Robust Learning

Strong convergence of multivariate maxima

Chaining Meets Chain Rule: Multilevel Entropic Regularization and Training of Neural Networks

Sublinear Bounds on the Distinguishing Advantage for Multiple Samples

Distributional Robustness in Mechanism Design

Multivariate extremes over a random number of observations

Distributionally Robust Optimization with Polynomial Densities: Theory, Models and Algorithms