Publication

The Metropolized Partial Importance Sampling MCMC mixes slowly on minimal reversal rearrangement paths

Related publications (27)

Predictive user-based relocation through incentives in one-way car-sharing systems

Nikolaos Geroliminis, Patrick Stefan Adriaan Stokkink

Car-sharing systems are an attractive alternative to private vehicles due to their benefits in terms of mobility and sustainability. However, the distribution of vehicles throughout the network in one-way systems is disturbed due to asymmetry and stochasti ...

2021

Discrete-Choice Mining of Social Processes

Victor Kristof

Poor decisions and selfish behaviors give rise to seemingly intractable global problems, such as the lack of transparency in democratic processes, the spread of conspiracy theories, and the rise in greenhouse gas emissions. However, people are more predict ...

EPFL2021

Learning Self-Exciting Temporal Point Processes Under Noisy Observations

William Trouleau

Understanding the diffusion patterns of sequences of interdependent events is a central question for a variety of disciplines. Temporal point processes are a class of elegant and powerful models of such sequences; these processes have become popular across ...

EPFL2021

A Variational Inference Approach to Learning Multivariate Wold Processes

Patrick Thiran, Matthias Grossglauser, Seyed Jalal Etesami, William Trouleau, Negar Kiyavash

Temporal point-processes are often used for mathematical modeling of sequences of discrete events with asynchronous timestamps. We focus on a class of temporal point-process models called multivariate Wold processes (MWP). These processes are well suited t ...

MICROTOME PUBLISHING2021

Adaptive Path Interpolation Method for Sparse Systems: Application to a Censored Block Model

Nicolas Macris, Chun Lam Chan, Jean François Emmanuel Barbier

Recently, a new adaptive path interpolation method has been developed as a simple and versatile scheme to calculate exactly the asymptotic mutual information of Bayesian inference problems defined on dense factor graphs. These include random linear and gen ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

Distributionally Robust Optimization with Markovian Data

Daniel Kuhn, Tobias Sutter, Mengmeng Li

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

JMLR-JOURNAL MACHINE LEARNING RESEARCH2021

Product of experts for robot learning from demonstration

Emmanuel Pignat

Adaptability and ease of programming are key features necessary for a wider spread of robotics in factories and everyday assistance. Learning from demonstration (LfD) is an approach to address this problem. It aims to develop algorithms and interfaces such ...

EPFL2021