Publication

Mixing of Hamiltonian Monte Carlo on strongly log-concave distributions 2: Numerical integrators

Related publications (33)

Graph Chatbot

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.

A Modular Timber Structure

Yves Weinand, Seyed Sina Nabaei

The presented reciprocal frame structure is a modular composition of timber folded panels. The overall geometry is driven from a folded plate base module which is then spartially multiplied in using Euclidean isometries. The intersection of consecutive mod ...

2012

Integration of Urban Structures in Point Process Analysis

Loïc Gasser

Traditionally, spatial analysis of point pattern has been mostly focused on Euclidean space. As many human related phenomena take place on a network, the assumption of a continuous isotropic space fails to describe events which actually occur on a one-dime ...

2011

Isogeometric analysis in electromagnetics: B-splines approximation

Annalisa Buffa, Rafael Vazquez Hernandez

We introduce a new discretization scheme for Maxwell equations in two space dimension. Inspired by the new paradigm of Isogeometric analysis introduced in Hughes et al. (2005) [16], we propose an algorithm based on the use of bivariate B-splines spaces sui ...

2010

Convolution on the n-Sphere With Application to PDF Modeling

Ivan Dokmanic

In this paper, we derive an explicit form of the convolution theorem for functions on an n-sphere. Our motivation comes from the design of a probability density estimator for n-dimensional random vectors. We propose a probability density function (pdf) est ...

Institute of Electrical and Electronics Engineers2010

Points surrounding the origin

János Pach, Andreas Fukami Holmsen

Suppose d > 2, n > d+1, and we have a set P of n points in d-dimensional Euclidean space. Then P contains a subset Q of d points such that for any p ∈ P, the convex hull of Q∪{p} does not contain the origin in its interior. We also show that for non-emp ...

2008

3-D Shape Estimation of DNA Molecules from Stereo Cryo-Electron Micro-Graphs Using a Projection-Steerable Snake

Michaël Unser, Thierry Blu, Mathews Jacob

We introduce a three-dimensional (3-D) parametric active contour algorithm for the shape estimation of DNA molecules from stereo cryo-electron micrographs. We estimate the shape by matching the projections of a 3-D global shape model with the micrographs; ...

IEEE2006

Computation of Observability Regions for Piecewise Affine Systems: A Projection-Based Algorithm

Giancarlo Ferrari Trecate

In this paper we consider the problem of computing sets of observable states for discrete-time, piecewise affine systems. When the maximal set of observable states is full-dimensional, we provide an algorithm for reconstructing it up to a zero measure set. ...

2005

The lexico-smallest representation of convex polyhedra

Stefano Picozzi

Every convex polyhedron in the Euclidean space

R^d

admits both H- and V-representation. For both formats, a representation is canonical if it is minimal and unique up to some elementary operations. In this paper, we extend the usual definition of canonic ...

2003

How to choose the number of taps in a DFE?

Christina Fragouli

In this paper, we address the following problem. Given a fixed total number of feedforward and feedback filter taps in a decision feedback equalizer, what is the optimum number of taps of each filter and what is the optimum delay setting? We propose a simp ...

2002

Error-energy bounds for adaptive gradient algorithms

Ali H. Sayed

The paper establishes robustness, optimality, and convergence properties of the widely used class of instantaneous-gradient adaptive algorithms. The analysis is carried out in a purely deterministic framework and assumes no a priori statistical information ...

IEEE1996

The lexico-smallest representation of convex polyhedra

Stefano Picozzi

Every convex polyhedron in the Euclidean space

R^d

2003