Search Results for author: Florent Bouchard

Found 7 papers, 1 papers with code

Random matrix theory improved Fréchet mean of symmetric positive definite matrices

no code implementations10 May 2024 Florent Bouchard, Ammar Mian, Malik Tiomoko, Guillaume Ginolhac, Frédéric Pascal

In this study, we consider the realm of covariance matrices in machine learning, particularly focusing on computing Fr\'echet means on the manifold of symmetric positive definite matrices, commonly referred to as Karcher or geometric means.

Intrinsic Bayesian Cramér-Rao Bound with an Application to Covariance Matrix Estimation

no code implementations8 Nov 2023 Florent Bouchard, Alexandre Renaux, Guillaume Ginolhac, Arnaud Breloy

In this setup, the chosen Riemannian metric induces a geometry for the parameter manifold, as well as an intrinsic notion of the estimation error measure.

The Fisher-Rao geometry of CES distributions

no code implementations2 Oct 2023 Florent Bouchard, Arnaud Breloy, Antoine Collas, Alexandre Renaux, Guillaume Ginolhac

When dealing with a parametric statistical model, a Riemannian manifold can naturally appear by endowing the parameter space with the Fisher information metric.

Riemannian optimization

Riemannian classification of EEG signals with missing values

no code implementations19 Oct 2021 Alexandre Hippert-Ferrer, Ammar Mian, Florent Bouchard, Frédéric Pascal

This paper proposes a strategy to handle missing data for the classification of electroencephalograms using covariance matrices.

Classification EEG

Random Matrix Improved Covariance Estimation for a Large Class of Metrics

no code implementations7 Feb 2019 Malik Tiomoko, Florent Bouchard, Guillaume Ginholac, Romain Couillet

Relying on recent advances in statistical estimation of covariance distances based on random matrix theory, this article proposes an improved covariance and precision matrix estimation for a wide family of metrics.

BIG-bench Machine Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.