Dominik Prossel

dblp:303/6024 · DBLP profile ↗
← Back
3ranked-venue papers in the field
3as first author
3since 2021 · last 2025
—ORCID · none

Domains — venue-derived; a paper can count in several

Other / Interdisciplinary · 3 (3 first)
YearPublicationVenuePosition
2025 Deterministic Proposal Sampling Using Projected Cumulative Distributions
abstract
Particle filters are an important class of algorithms for Bayesian estimation. One of their drawbacks is the socalled particle degeneration where only very few particles with a meaningful weight remain after the filter step. This effect is typically remedied by regularly resampling the particles, yielding a set of equally weighted particles. This paper investigates an approach to deterministically sample particles from the proposal distribution in such a way to automatically have equally weighted particles at the end of the filter step. The proposed method is first motivated and presented for the one-dimensional case. Using the Radon transform and projected cumulative distributions, the one-dimensional algorithm is extended to multivariate problems. Some examples of the usefulness of the proposed algorithm are also shown.
Dominik Prossel, Uwe D. Hanebeck
FUSION1
2024 Spline-Based Density Estimation Minimizing Fisher Information
abstract
The construction of a continuous probability density function (pdf) that fits a set of samples is a frequently occurring task in statistics. This is an inherently underdetermined problem, that can only be solved by making some assumptions about the samples or the distribution to be estimated. This paper proposes a density estimation method based on the premise that each sample represents the same amount of probability mass of the underlying density. The estimated pdf is parameterized as the square of a polynomial spline, which makes further processing of the estimated density very efficient. This pdf is inherently nonnegative, ensuring a monotone cumulative distribution function, which makes it easy to generate samples from it through inverse transform sampling. Furthermore, it is cheap to evaluate and easy to integrate, making moment calculations fast. To find the coefficients of the polynomials that make up the spline, an optimization problem is derived. The Fisher information is used as a regularizer in this problem to select the solution that contains the least amount of information. The method is shown to work on samples from a variety of different one-dimensional probability distributions.
Dominik Prossel, Uwe D. Hanebeck
FUSION1
2022 Dirac Mixture Reduction Using Wasserstein Distances on Projected Cumulative Distributions
Dominik Prossel, Uwe D. Hanebeck
FUSION1