English
Related papers

Related papers: Deterministic Sampling on the Circle using Project…

200 papers

This paper is concerned with the optimal approximation of a given multivariate Dirac mixture, i.e., a density comprising weighted Dirac distributions on a continuous domain, by an equally weighted Dirac mixture with a reduced number of…

Systems and Control · Computer Science 2014-11-18 Uwe D. Hanebeck

In this paper, we propose a robust Kalman filtering framework for systems with probabilistic uncertainty in system parameters. We consider two cases, namely discrete time systems, and continuous time systems with discrete measurements. The…

Systems and Control · Electrical Eng. & Systems 2020-07-09 Sunsoo Kim , Vedang M. Deshpande , Raktim Bhattacharya

In this paper, we propose a general methodology for sampling from un-normalized densities defined on Riemannian manifolds, with a particular focus on multi-modal targets that remain challenging for existing sampling methods. Inspired by the…

Machine Learning · Statistics 2026-02-03 Alain Durmus , Maxence Noble , Thibaut Pellerin

A determinantal point process is a stochastic point process that is commonly used to capture negative correlations. It has become increasingly popular in machine learning in recent years. Sampling a determinantal point process however…

Numerical Analysis · Mathematics 2020-09-02 Lexing Ying

Many dynamical systems are subjected to stochastic influences, such as random excitations, noise, and unmodeled behavior. Tracking the system's state and parameters based on a physical model is a common task for which filtering algorithms,…

Signal Processing · Electrical Eng. & Systems 2024-07-03 Jan Grashorn , Matteo Broggi , Ludovic Chamoin , Michael Beer

In this paper, we propose a novel class of Piecewise Deterministic Markov Processes (PDMPs) that are designed to sample from probability distributions $\pi$ supported on a convex set $\mathcal{M}$. This class of PDMPs adapts the concept of…

Computation · Statistics 2026-05-01 Joël Tatang Demano , Paul Dobson , Konstantinos Zygalakis

The committor functions are central to investigating rare but important events in molecular simulations. It is known that computing the committor function suffers from the curse of dimensionality. Recently, using neural networks to estimate…

Machine Learning · Statistics 2025-01-28 Yueyang Wang , Kejun Tang , Xili Wang , Xiaoliang Wan , Weiqing Ren , Chao Yang

In this paper, we study the problem of estimating the state of a dynamic state-space system where the output is subject to quantization. We compare some classical approaches and a new development in the literature to obtain the filtering…

Systems and Control · Electrical Eng. & Systems 2021-12-16 Angel L. Cedeño , Ricardo Albornoz , Boris I. Godoy , Rodrigo Carvajal , Juan C. Agüero

A parametric method similar to autoregressive spectral estimators is proposed to determine the probability density function (pdf) of a random set. The method proceeds by maximizing the likelihood of the pdf, yielding estimates that perform…

Data Analysis, Statistics and Probability · Physics 2009-10-31 T. Dudok de Wit , E. Floriani

Estimating the density of a continuous random variable X has been studied extensively in statistics, in the setting where n independent observations of X are given a priori and one wishes to estimate the density from that. Popular methods…

Computation · Statistics 2021-09-09 Pierre L'Ecuyer , Florian Puchhammer

A random set is a generalisation of a random variable, i.e. a set-valued random variable. The random set theory allows a unification of other uncertainty descriptions such as interval variable, mass belief function in Dempster-Shafer theory…

Numerical Analysis · Mathematics 2018-11-27 Truong-Vinh Hoang , Hermann G. Matthies

A new methodology is proposed for generating realizations of a random vector with values in a finite-dimensional Euclidean space that are statistically consistent with a data set of observations of this vector. The probability distribution…

Probability · Mathematics 2016-08-24 Christian Soize , Roger Ghanem

We provide new convergence guarantees in Wasserstein distance for diffusion-based generative models, covering both stochastic (DDPM-like) and deterministic (DDIM-like) sampling methods. We introduce a simple framework to analyze…

Machine Learning · Computer Science 2025-11-14 Eliot Beyler , Francis Bach

Normalizing flows model a complex target distribution in terms of a bijective transform operating on a simple base distribution. As such, they enable tractable computation of a number of important statistical quantities, particularly…

Machine Learning · Computer Science 2022-09-01 Chandramouli Shama Sastry , Andreas Lehrmann , Marcus Brubaker , Alexander Radovic

Sampling from circular distributions is a fundamental task in directional statistics. A key challenge in acceptance-rejection methods lies in selecting an efficient envelope density, as poor choices can lead to low acceptance rates and…

Methodology · Statistics 2025-06-17 Surojit Biswas , Buddhananda Banerjee

In panel experiments, we randomly assign units to different interventions, measuring their outcomes, and repeating the procedure in several periods. Using the potential outcomes framework, we define finite population dynamic causal effects…

Methodology · Statistics 2021-05-28 Iavor Bojinov , Ashesh Rambachan , Neil Shephard

We propose a deterministic sampling framework using Score-Based Transport Modeling for sampling an unnormalized target density $\pi$ given only its score $\nabla \log \pi$. Our method approximates the Wasserstein gradient flow on…

Machine Learning · Computer Science 2025-10-21 Vasily Ilin , Peter Sushko , Jingwei Hu

A new approach of obtaining stratified random samples from statistically dependent random variables is described. The proposed method can be used to obtain samples from the input space of a computer forward model in estimating expectations…

Methodology · Statistics 2019-11-25 Anirban Mondal , Abhijit Mandal

We propose the tensorizing flow method for estimating high-dimensional probability density functions from the observed data. The method is based on tensor-train and flow-based generative modeling. Our method first efficiently constructs an…

Machine Learning · Computer Science 2022-12-02 Yinuo Ren , Hongli Zhao , Yuehaw Khoo , Lexing Ying

Random column sampling is not guaranteed to yield data sketches that preserve the underlying structures of the data and may not sample sufficiently from less-populated data clusters. Also, adaptive sampling can often provide accurate low…

Machine Learning · Computer Science 2017-10-11 Mostafa Rahmani , George Atia