Source author record

Jeremie Houssineau

Jeremie Houssineau appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

15works
12topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

15 published item(s)

preprint2026arXiv

Possibilistic Predictive Uncertainty for Deep Learning

Deep neural networks achieve impressive results across diverse applications, yet their overconfidence on unseen inputs necessitates reliable epistemic uncertainty modelling. Existing methods for uncertainty modelling face a fundamental dilemma: Bayesian approaches provide principled estimates but remain computationally prohibitive, while efficient second-order predictors lack rigorous derivations connecting their specific objectives to epistemic uncertainty quantification. To resolve this dilemma, we introduce Dirichlet-approximated possibilistic posterior predictions (DAPPr), a principled framework leveraging possibility theory. We define a possibilistic posterior over parameters, projects this posterior to the prediction space via supremum operators, and approximates the projected posterior using learnable Dirichlet possibility functions. This projection-and-approximation strategy yields a simple training objective with closed-form solutions. Extensive experiments across diverse benchmarks demonstrate that our approach achieves competitive or superior uncertainty quantification performance compared to state-of-the-art evidential deep learning methods while maintaining both principled derivation and computational efficiency. Code will be available at https://github.com/MaxwellYaoNi/DAPPr.

preprint2022arXiv

Robust Bayesian inference in complex models with possibility theory

We propose a general solution to the problem of robust Bayesian inference in complex settings where outliers may be present. In practice, the automation of robust Bayesian analyses is important in the many applications involving large and complex datasets. The proposed solution relies on a reformulation of Bayesian inference based on possibility theory, and leverages the observation that, in this context, the marginal likelihood of the data assesses the consistency between prior and likelihood rather than model fitness. Our approach does not require additional parameters in its simplest form and has a limited impact on the computational complexity when compared to non-robust solutions. The generality of our solution is demonstrated via applications on simulated and real data including matrix estimation and change-point detection.

preprint2021arXiv

A linear algorithm for multi-target tracking in the context of possibility theory

We present a modelling framework for multi-target tracking based on possibility theory and illustrate its ability to account for the general lack of knowledge that the target-tracking practitioner must deal with when working with real data. We also introduce and study variants of the notions of point process and intensity function, which lead to the derivation of an analogue of the probability hypothesis density (PHD) filter. The gains provided by the considered modelling framework in terms of flexibility lead to the loss of some of the abilities that the PHD filter possesses; in particular the estimation of the number of targets by integration of the intensity function. Yet, the proposed recursion displays a number of advantages such as facilitating the introduction of observation-driven birth schemes and the modelling the absence of information on the initial number of targets in the scene. The performance of the proposed approach is demonstrated on simulated data.

preprint2020arXiv

Elements of asymptotic theory with outer probability measures

Outer measures can be used for statistical inference in place of probability measures to bring flexibility in terms of model specification. The corresponding statistical procedures such as Bayesian inference, estimators or hypothesis testing need to be analysed in order to understand their behaviour, and motivate their use. In this article, we consider a class of outer measures based on the supremum of particular functions that we refer to as possibility functions. We then characterise the asymptotic behaviour of the corresponding Bayesian posterior uncertainties, from which the properties of the corresponding maximum a posteriori estimators can be deduced. These results are largely based on versions of both the law of large numbers and the central limit theorem that are adapted to possibility functions. Our motivation with outer measures is through the notion of uncertainty quantification, where verification of these procedures is of crucial importance. These introduced concepts shed a new light on some standard concepts such as the Fisher information and sufficient statistics and naturally strengthen the link between the frequentist and Bayesian approaches.

preprint2020arXiv

Parameter estimation with a class of outer probability measures

We explore the interplay between random and deterministic phenomena using a representation of uncertainty based on the measure-theoretic concept of outer measure. The meaning of the analogues of different probabilistic concepts is investigated and examples of application are given. The novelty of this article lies mainly in the suitability of the tools introduced for jointly representing random and deterministic uncertainty. These tools are shown to yield intuitive results in simple situations and to generalise easily to more complex cases. Connections with Dempster-Shafer theory, the empirical Bayes methods and generalised Bayesian inference are also highlighted.

preprint2020arXiv

Uncertainty modelling and computational aspects of data association

A novel solution to the smoothing problem for multi-object dynamical systems is proposed and evaluated. The systems of interest contain an unknown and varying number of dynamical objects that are partially observed under noisy and corrupted observations. An alternative representation of uncertainty is considered in order to account for the lack of information about the different aspects of this type of complex system. The corresponding statistical model can be formulated as a hierarchical model consisting of conditionally-independent hidden Markov models. This particular structure is leveraged to propose an efficient method in the context of Markov chain Monte Carlo (MCMC) by relying on an approximate solution to the corresponding filtering problem, in a similar fashion to particle MCMC. This approach is shown to outperform existing algorithms in a range of scenarios.

preprint2016arXiv

Bayesian data assimilation based on a family of outer measures

A flexible representation of uncertainty that remains within the standard framework of probabilistic measure theory is presented along with a study of its properties. This representation relies on a specific type of outer measure that is based on the measure of a supremum, hence combining additive and highly sub-additive components. It is shown that this type of outer measure enables the introduction of intuitive concepts such as pullback and general data assimilation operations.

preprint2016arXiv

Multi-object filtering with stochastic populations

While the design of automated knowledge-based sensor scheduling is relevant to many multi-target detection and tracking problems, tracking algorithms are rarely built for this purpose and their outputs provide little flexibility for the design of sensor policies. In this paper, we present an estimation framework for stochastic populations in the context of multi-target estimation problems. Fully probabilistic in nature, it allows for the evaluation of the population of targets through statistical moments, as well as the assessment of sensor observations through information-theoretical gain functions. We present a principled solution derived from this framework addressing challenging multi-target scenarios involving missed detections and false alarms, the filter for Distinguishable and Independent Stochastic Populations, which propagates information on previously-detected targets as well as yet-to-be-detected targets while maintaining track continuity.

preprint2015arXiv

Spawning Models for the CPHD Filter

In its classical form, the Cardinalized Probability Hypothesis Density (CPHD) filter does not model the appearance of new targets through spawning, yet there are applications for which spawning models more appropriately account for newborn objects when compared to spontaneous birth models. In this paper, we propose a principled derivation of the CPHD filter with spawning from the Finite Set Statistics framework. A Gaussian Mixture implementation of the CPHD filter with spawning is then presented, illustrated with three applicable spawning models on a simulated scenario involving two parent targets spawning a total of five objects. Results show that filter implementations with spawn models provide more accurate results when compared to a birth model implementation.

preprint2014arXiv

A unified approach for multi-object triangulation, tracking and camera calibration

Object triangulation, 3-D object tracking, feature correspondence, and camera calibration are key problems for estimation from camera networks. This paper addresses these problems within a unified Bayesian framework for joint multi-object tracking and sensor registration. Given that using standard filtering approaches for state estimation from cameras is problematic, an alternative parametrisation is exploited, called disparity space. The disparity space-based approach for triangulation and object tracking is shown to be more effective than non-linear versions of the Kalman filter and particle filtering for non-rectified cameras. The approach for feature correspondence is based on the Probability Hypothesis Density (PHD) filter, and hence inherits the ability to update without explicit measurement association, to initiate new targets, and to discriminate between target and clutter. The PHD filtering approach then forms the basis of a camera calibration method from static or moving objects. Results are shown on simulated data.

preprint2013arXiv

Regional variance for multi-object filtering

Recent progress in multi-object filtering has led to algorithms that compute the first-order moment of multi-object distributions based on sensor measurements. The number of targets in arbitrarily selected regions can be estimated using the first-order moment. In this work, we introduce explicit formulae for the computation of the second-order statistic on the target number. The proposed concept of regional variance quantifies the level of confidence on target number estimates in arbitrary regions and facilitates information-based decisions. We provide algorithms for its computation for the Probability Hypothesis Density (PHD) and the Cardinalized Probability Hypothesis Density (CPHD) filters. We demonstrate the behaviour of the regional statistics through simulation examples.

preprint2012arXiv

Faa di Bruno's formula for Gateaux differentials and interacting stochastic population processes

The problem of estimating interacting systems of multiple objects is important to a number of different fields of mathematics, physics, and engineering. Drawing from a range of disciplines, including statistical physics, variational calculus, point process theory, and statistical sensor fusion, we develop a unified probabilistic framework for modelling systems of this nature. In order to do this, we derive a new result in variational calculus, Faa di Bruno's formula for Gateaux differentials. Using this result, we derive the Chapman-Kolmogorov equation and Bayes' rule for stochastic population processes with interactions and hierarchies. We illustrate the general approach through case studies in multi-target tracking, branching processes and renormalization.