Researcher profile

Jeremie Houssineau

Jeremie Houssineau contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
6works
0followers
7topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

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

Published work

6 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.