Semi-Discrete Optimal Transport: Hardness, Regularization and Numerical Solution
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.
Let r : S x S -> R+ be the jump rates of an irreducible random walk on a finite set S, reversible with respect to some probability measure m. For alpha > 1, let g : N -> R+ be given by g(0) = 0, g(1) = 1, g(k) = (k/k - 1)(alpha), k >= 2. Consider a zero ra ...
We consider backward stochastic differential equations (BSDEs) with a particular quadratic generator and study the behaviour of their solutions when the probability measure is changed, the filtration is shrunk, or the underlying probability space is transf ...
Several computational challenges arise when evaluating the failure probability of a given system in the context of risk prediction or reliability analysis. When the dimension of the uncertainties becomes high, well established direct numerical methods can ...
Trajectories of objects are estimated by determining the optimal solution(s) of a tracking model on the basis of an occupancy probability distribution. The occupancy probability distribution is the probability of presence of objects over a set of discrete ...
Attention can be stimulus-driven and bottom-up or goal-driven and top-down. Bottom-up attention and, particularly, attentional capture are often thought to be strongly automatic, i.e., not modulable. For example, in visual search, it has been shown that sa ...
Association for Research in Vision and Ophthalmology2010
One of the oldest problems in the study of dynamical systems is the calculation of an optimal control. Though the determination of a numerical solution for the general non-convex optimal control problem for hybrid systems has been pursued relentlessly to d ...
We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe networks of biochemical reactions and play an important role in the stochastic modeling of biological systems. Our approach is based on the const ...
The objective of uncertainty quantification is to certify that a given physical, engineering or economic system satisfies multiple safety conditions with high probability. A more ambitious goal is to actively influence the system so as to guarantee and mai ...
We present new counterexamples, which provide stronger limitations to sums-differences statements than were previously known. The main idea to improve over the original counterexamples by Ruzsa is to consider non-uniform probability measures. ...
Solving optimal control problems for many different scenarios obtained by varying a set of parameters in the state system is a computationally extensive task. In this paper we present a new reduced framework for the formulation, the analysis and the numeri ...
