An Efficient Sampling Algorithm for Non-smooth Composite Potentials

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.

We present a novel pipeline that uses a convolutional neural network (CNN) to improve the detection capability of near-Earth asteroids (NEAs) in the context of planetary defense. Our work aims to minimize the dependency on human intervention of the current ...

In this thesis we study stability from several viewpoints. After covering the practical importance, the rich history and the ever-growing list of manifestations of stability, we study the following. (i) (Statistical identification of stable dynamical syste ...

In this paper, we study sampling from a posterior derived from a neural network. We propose a new probabilistic model consisting of adding noise at every pre- and post-activation in the network, arguing that the resulting posterior can be sampled using an ...

Modern optimization is tasked with handling applications of increasingly large scale, chiefly due to the massive amounts of widely available data and the ever-growing reach of Machine Learning. Consequently, this area of research is under steady pressure t ...

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

The function that maps a family of probability measures to the solution of the dual entropic optimal transport problem is known as the Schr center dot odinger map. We prove that when the cost function is Ck+1 with k is an element of N* then this map is Lip ...

The objective of this study is to address the difficulty of simplifying the geometric model in which a differential problem is formulated, also called defeaturing, while simultaneously ensuring that the accuracy of the solution is maintained under control. ...

We study mixing and diffusion properties of passive scalars driven by generic rough shear flows. Genericity is here understood in the sense of prevalence, and (ir)regularity is measured in the Besov-Nikolskii scale B\alpha 1,\infty, \alpha \in (0,1). We pr ...

In this work, we present, analyze, and implement a class of multilevel Markov chain Monte Carlo(ML-MCMC) algorithms based on independent Metropolis--Hastings proposals for Bayesian inverse problems. In this context, the likelihood function involves solving ...

Two prominent categories for achieving coordinated multirobot displacement are flocking and navigation in formation. Both categories have their own body of literature and characteristics, including their respective advantages and disadvantages. While typic ...

Byzantine machine learning (ML) aims to ensure the resilience of distributed learning algorithms to misbehaving (or Byzantine) machines. Although this problem received significant attention, prior works often assume the data held by the machines to be homo ...

One of the main goal of Artificial Intelligence is to develop models capable of providing valuable predictions in real-world environments. In particular, Machine Learning (ML) seeks to design such models by learning from examples coming from this same envi ...

Finding cycles in directed graphs enables important applications in various domains such as finance, biology, chemistry, and network science. However, as the size of graph datasets continues to grow, it becomes increasingly difficult to discover cycles wit ...

We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...

This paper focuses on over-parameterized deep neural networks (DNNs) with ReLU activation functions and proves that when the data distribution is well-separated, DNNs can achieve Bayesoptimal test error for classification while obtaining (nearly) zero-trai ...

This thesis is devoted to the construction, analysis, and implementation of two types of hierarchical Markov Chain Monte Carlo (MCMC) methods for the solution of large-scale Bayesian Inverse Problems (BIP). The first hierarchical method we present is base ...

Accurate simulations of molecular quantum dynamics are crucial for understanding numerous natural processes and experimental results. Yet, such high-accuracy simulations are challenging even for relatively simple systems where the Born-Oppenheimer approxim ...

We study a stochastic program where the probability distribution of the uncertain problem parameters is unknown and only indirectly observed via finitely many correlated samples generated by an unknown Markov chain with d states. We propose a data-driven d ...

Cyber-physical systems (CPSs) integrate heterogeneous systems and process sensor data using digital services. As the complexity of CPS increases, it becomes more challenging to efficiently formalize the integrated multidomain views with flexible automated ...

We present a novel framework for the reconstruction of 1D composite signals assumed to be a mixture of two additive components, one sparse and the other smooth, given a finite number of linear measurements. We formulate the reconstruction problem as a cont ...

An Efficient Sampling Algorithm for Non-smooth Composite Potentials

Chat with Graph Search

Deep Learning to Improve the Discovery of Near-earth Asteroids in the Zwicky Transient Facility

Stability: a search for structure

Gibbs sampling the posterior of neural networks

Scalable constrained optimization

A ride time-oriented scheduling algorithm for dial-a-ride problems

Displacement smoothness of entropic optimal transport

A Shape Derivative Approach to Domain Simplification

MIXING FOR GENERIC ROUGH SHEAR FLOWS

Analysis of a Class of Multilevel Markov Chain Monte Carlo Algorithms Based on Independent Metropolis–Hastings

Hybrid Flock - Formation Control Algorithms

Fixing by Mixing: A Recipe for Optimal Byzantine ML under Heterogeneity

Predicting in Uncertain Environments: Methods for Robust Machine Learning

Fast Parallel Algorithms for Enumeration of Simple, Temporal, and Hop-Constrained Cycles

Equivalence Checking for Orthocomplemented Bisemilattices in Log-Linear Time

Benign Overfitting in Deep Neural Networks under Lazy Training

HIERARCHICAL MARKOV CHAIN MONTE CARLO METHODS FOR BAYESIAN INVERSE PROBLEMS

High-order geometric integrators for nonadiabatic molecular quantum dynamics and their applications to explore conical intersections

Distributionally Robust Optimization with Markovian Data

Model-Based Systems Engineering Tool-Chain for Automated Parameter Value Selection

Continuous-Domain Formulation of Inverse Problems for Composite Sparse-Plus-Smooth Signals