Source author record

Fabrice Gamboa

Fabrice Gamboa 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

34works
13topics
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

34 published item(s)

preprint2026arXiv

Generalized Functional ANOVA in Closed-Form: A Unified View of Additive Explanations

The functional ANOVA, or Hoeffding decomposition, provides a principled framework for interpretability by decomposing a model prediction into main effects and higher-order interactions. For independent inputs, this classical decomposition is explicit. It is closely connected to SHAP values, generalized additive models, and orthogonal polynomial expansions, and therefore constitutes a fundamental tool for additive explainability. In the more general and realistic dependent setting, however, obtaining a tractable representation and estimating the decomposition from data remain challenging. In this work, we address this problem for continuous inputs. By combining Hilbert space methods with the generalized functional ANOVA, we build an explicit decomposition Riesz Basis allowing to easily compute the decomposition. Our formulation recovers the classical independent case and its associated orthogonal decomposition. Building on this representation, we propose a simple but mighty algorithm to estimate the decomposition from a data sample in a model-agnostic setting and we compare it empirically with several state-of-the-art explanation methods, demonstrating the power of the approach.

preprint2026arXiv

Training More Robust Classification Model via Discriminative Loss and Gaussian Noise Injection

Robustness of deep neural networks to input noise remains a critical challenge, as naive noise injection often degrades accuracy on clean (uncorrupted) data. We propose a novel training framework that addresses this trade-off through two complementary objectives. First, we introduce a loss function applied at the penultimate layer that explicitly enforces intra-class compactness and increases the margin to analytically defined decision boundaries. This enhances feature discriminativeness and class separability for clean data. Second, we propose a class-wise feature alignment mechanism that brings noisy data clusters closer to their clean counterparts. Furthermore, we provide a theoretical analysis demonstrating that improving feature stability under additive Gaussian noise implicitly reduces the curvature of the softmax loss landscape in input space, as measured by Hessian eigenvalues.This thus naturally enhances robustness without explicit curvature penalties. Conversely, we also theoretically show that lower curvatures lead to more robust models. We validate the effectiveness of our method on standard benchmarks and our custom dataset. Our approach significantly reinforces model robustness to various perturbations while maintaining high accuracy on clean data, advancing the understanding and practice of noise-robust deep learning.

preprint2023arXiv

On the coalitional decomposition of parameters of interest

Understanding the behavior of a black-box model with probabilistic inputs can be based on the decomposition of a parameter of interest (e.g., its variance) into contributions attributed to each coalition of inputs (i.e., subsets of inputs). In this paper, we produce conditions for obtaining unambiguous and interpretable decompositions of very general parameters of interest. This allows to recover known decompositions, holding under weaker assumptions than stated in the literature.

preprint2022arXiv

Bayesian quadrature for $H^1(μ)$ with Poincaré inequality on a compact interval

Motivated by uncertainty quantification of complex systems, we aim at finding quadrature formulas of the form $\int_a^b f(x) dμ(x) = \sum_{i=1}^n w_i f(x_i)$ where $f$ belongs to $H^1(μ)$. Here, $μ$ belongs to a class of continuous probability distributions on $[a, b] \subset \mathbb{R}$ and $\sum_{i=1}^n w_i δ_{x_i}$ is a discrete probability distribution on $[a, b]$. We show that $H^1(μ)$ is a reproducing kernel Hilbert space with a continuous kernel $K$, which allows to reformulate the quadrature question as a Bayesian (or kernel) quadrature problem. Although $K$ has not an easy closed form in general, we establish a correspondence between its spectral decomposition and the one associated to Poincaré inequalities, whose common eigenfunctions form a $T$-system (Karlin and Studden, 1966). The quadrature problem can then be solved in the finite-dimensional proxy space spanned by the first eigenfunctions. The solution is given by a generalized Gaussian quadrature, which we call Poincaré quadrature. We derive several results for the Poincaré quadrature weights and the associated worst-case error. When $μ$ is the uniform distribution, the results are explicit: the Poincaré quadrature is equivalent to the midpoint (rectangle) quadrature rule. Its nodes coincide with the zeros of an eigenfunction and the worst-case error scales as $\frac{b-a}{2\sqrt{3}}n^{-1}$ for large $n$. By comparison with known results for $H^1(0,1)$, this shows that the Poincaré quadrature is asymptotically optimal. For a general $μ$, we provide an efficient numerical procedure, based on finite elements and linear programming. Numerical experiments provide useful insights: nodes are nearly evenly spaced, weights are close to the probability density at nodes, and the worst-case error is approximately $O(n^{-1})$ for large $n$.

preprint2022arXiv

Explaining Machine Learning Models using Entropic Variable Projection

In this paper, we present a new explainability formalism designed to shed light on how each input variable of a test set impacts the predictions of machine learning models. Hence, we propose a group explainability formalism for trained machine learning decision rules, based on their response to the variability of the input variables distribution. In order to emphasize the impact of each input variable, this formalism uses an information theory framework that quantifies the influence of all input-output observations based on entropic projections. This is thus the first unified and model agnostic formalism enabling data scientists to interpret the dependence between the input variables, their impact on the prediction errors, and their influence on the output predictions. Convergence rates of the entropic projections are provided in the large sample case. Most importantly, we prove that computing an explanation in our framework has a low algorithmic complexity, making it scalable to real-life large datasets. We illustrate our strategy by explaining complex decision rules learned by using XGBoost, Random Forest or Deep Neural Network classifiers on various datasets such as Adult Income, MNIST, CelebA, Boston Housing, Iris, as well as synthetic ones. We finally make clear its differences with the explainability strategies LIME and SHAP, that are based on single observations. Results can be reproduced by using the freely distributed Python toolbox https://gems-ai.aniti.fr/.

preprint2021arXiv

Sensitivity analysis in general metric spaces

In this paper, we introduce new indices adapted to outputs valued in general metric spaces. This new class of indices encompasses the classical ones; in particular, the so-called Sobol indices and the Cram{é}r-von-Mises indices. Furthermore, we provide asymptotically Gaussian estimators of these indices based on U-statistics. Surprisingly, we prove the asymp-totic normality straightforwardly. Finally, we illustrate this new procedure on a toy model and on two real-data examples.

preprint2020arXiv

Gaussian Processes indexed on the symmetric group: prediction and learning

In the framework of the supervised learning of a real function defined on a space X , the so called Kriging method stands on a real Gaussian field defined on X. The Euclidean case is well known and has been widely studied. In this paper, we explore the less classical case where X is the non commutative finite group of permutations. In this setting, we propose and study an harmonic analysis of the covariance operators that enables to consider Gaussian processes models and forecasting issues. Our theory is motivated by statistical ranking problems.

preprint2020arXiv

Sum rules via large deviations: extension to polynomial potentials and the multi-cut regime

A sum rule is an identity connecting the entropy of a measure with coefficients involved in the construction of its orthogonal polynomials (Jacobi coefficients). Our paper is an extension of Gamboa, Nagel and Rouault (2016), where we have showed sum rules by using only probabilistic tools (namely the large deviations theory). Here, we prove large deviation principles for the weighted spectral measure of unitarily invariant random matrices in two general situations: firstly, when the equilibrium measure is not necessarily supported by a single interval and secondly, when the potential is a nonnegative polynomial. The rate functions can be expressed as functions of the Jacobi coefficients. These new large deviation results lead to original sum rules both for the one and the multi-cut regime and also answer a conjecture stated in Gamboa, Nagel and Rouault (2016) concerning general sum rules.

preprint2016arXiv

Bregman superquantiles. Estimation methods and applications

In this work, we extend some quantities introduced in "Optimization of conditional value-at-risk" of R.T Rockafellar and S. Uryasev to the case where the proximity between real numbers is measured by using a Bregman divergence. This leads to the definition of the Bregman superquantile. Axioms of a coherent measure of risk discussed in "Coherent approches to risk in optimization under uncertainty" of R.T Rockafellar are studied in the case of Bregman superquantile. Furthermore, we deal with asymptotic properties of a Monte Carlo estimator of the Bregman superquantile.

preprint2016arXiv

Sum rules and large deviations for spectral matrix measures

A sum rule relative to a reference measure on R is a relationship between the reversed Kullback-Leibler divergence of a positive measure on R and some non-linear functional built on spectral elements related to this measure (see for example Killip and Simon 2003). In this paper, using only probabilistic tools of large deviations, we extend the sum rules obtained in Gamboa, Nagel and Rouault (2015) to the case of Hermitian matrix-valued measures. We recover the earlier result of Damanik, Killip and Simon (2010) when the reference measure is the (matrix-valued) semicircle law and obtain a new sum rule when the reference measure is the (matrix-valued) Marchenko-Pastur law.

preprint2015arXiv

Sum rules via large deviations

In this paper, a sum rule means a relationship between a functional defined on a subset of all probability measures on $\mathbb{R}$ involving the reverse Kullback-Leibler divergence with respect to a particular distribution and recursion coefficients related to the orthogonal polynomial construction. The first sum rule is the Szegő-Verblunsky theorem (see Simon (2011) Theorem 1.8.6 p. 29) and concerns the case of trigonometrical polynomials on the torus. More recently, Killip and Simon (2003) have given a revival interest to this subject by showing a quite surprising sum rule for measures dominating the semicircular distribution. Indeed, this sum rule includes a contribution of the atomic part of the measure away from the support of the circular law. In this paper, we recover this sum rules by using only large deviations tools on random matrices. Furthermore, we obtain new (up to our knowledge) magic sum rules for the reverse Kullback-Leibler divergence with respect to the Pastur-Marchenko or Kesten-McKay distributions. As in the semicircular case, these formulas generally include a contribution of the atomic part appearing away from the support of the reference measure. From the point of view of large deviations, we obtain these formulas by showing a large deviation principle for the point mass measure concentrated on random eigenvalues of classical ensembles and combine it with a large deviation principle due to Gamboa Rouault (2011) for the recursion coefficients.

preprint2014arXiv

A unified framework for the study of the PLS estimator's properties

In this paper we propose a new approach to study the properties of the Partial Least Squares (PLS) estimator. This approach relies on the link between PLS and discrete orthogonal polynomials. Indeed many important PLS objects can be expressed in terms of some specific discrete orthogonal polynomials, called the residual polynomials. Based on the explicit analytical expression we have stated for these polynomials in terms of signal and noise, we provide a new framework for the study of PLS. Furthermore, we show that this new approach allows to simplify and retreive independent proofs of many classical results (proved earlier by different authors using various approaches and tools). This general and unifying approach also sheds new light on PLS and helps to gain insight on its properties.

preprint2014arXiv

Density modification based reliability sensitivity analysis

Sensitivity analysis of a numerical model, for instance simulating physical phenomena, is useful to quantify the influence of the inputs on the model responses. This paper proposes a new sensitivity index, based upon the modification of the probability density function (pdf) of the random inputs, when the quantity of interest is a failure probability (probability that a model output exceeds a given threshold). An input is considered influential if the input pdf modification leads to a broad change in the failure probability. These sensitivity indices can be computed using the sole set of simulations that has already been used to estimate the failure probability, thus limiting the number of calls to the numerical model. In the case of a Monte Carlo sample, asymptotical properties of the indices are derived. Based on Kullback-Leibler divergence, several types of input perturbations are introduced. The relevance of this new sensitivity analysis method is analysed through three case studies.

preprint2014arXiv

Generalized Sobol sensitivity indices for dependent variables: numerical methods

The hierarchically orthogonal functional decomposition of any measurable function f of a random vector X=(X_1,...,X_p) consists in decomposing f(X) into a sum of increasing dimension functions depending only on a subvector of X. Even when X_1,..., X_p are assumed to be dependent, this decomposition is unique if components are hierarchically orthogonal. That is, two of the components are orthogonal whenever all the variables involved in one of the summands are a subset of the variables involved in the other. Setting Y=f(X), this decomposition leads to the definition of generalized sensitivity indices able to quantify the uncertainty of Y with respect to the dependent inputs X. In this paper, a numerical method is developed to identify the component functions of the decomposition using the hierarchical orthogonality property. Furthermore, the asymptotic properties of the components estimation is studied, as well as the numerical estimation of the generalized sensitivity indices of a toy model. Lastly, the method is applied to a model arising from a real-world problem.

preprint2014arXiv

Group Lasso for generalized linear models in high dimension

Nowadays an increasing amount of data is available and we have to deal with models in high dimension (number of covariates much larger than the sample size). Under sparsity assumption it is reasonable to hope that we can make a good estimation of the regression parameter. This sparsity assumption as well as a block structuration of the covariates into groups with similar modes of behavior is for example quite natural in genomics. A huge amount of scientific literature exists for Gaussian linear models including the Lasso estimator and also the Group Lasso estimator which promotes group sparsity under an a priori knowledge of the groups. We extend this Group Lasso procedure to generalized linear models and we study the properties of this estimator for sparse high-dimensional generalized linear models to find convergence rates. We provide oracle inequalities for the prediction and estimation error under assumptions on the covariables and under a condition on the design matrix. We show the ability of this estimator to recover good sparse approximation of the true model. At last we extend these results to the case of an Elastic net penalty and we apply them to the so-called Poisson regression case which has not been studied in this context contrary to the logistic regression.

preprint2014arXiv

PLS: a new statistical insight through the prism of orthogonal polynomials

Partial Least Square (PLS) is a dimension reduction method used to remove multicollinearities in a regression model. However contrary to Principal Components Analysis (PCA) the PLS components are also choosen to be optimal for predicting the response $Y$. In this paper we provide a new and explicit formula for the residuals. We show that the residuals are completely determined by the spectrum of the design matrix and by the noise on the observations. Because few are known on the behaviour of the PLS components we also investigate their statistical properties in a regression context. New results on regression and prediction error for PLS are stated under the assumption of a low variance of the noise.

preprint2013arXiv

From variable density sampling to continuous sampling using Markov chains

Since its discovery over the last decade, Compressed Sensing (CS) has been successfully applied to Magnetic Reso- nance Imaging (MRI). It has been shown to be a powerful way to reduce scanning time without sacrificing image quality. MR images are actually strongly compressible in a wavelet basis, the latter being largely incoherent with the k-space or spatial Fourier domain where acquisition is performed. Nevertheless, since its first application to MRI [1], the theoretical justification of actual k-space sampling strategies is questionable. Indeed, the vast majority of k-space sampling distributions have been heuris- tically designed (e.g., variable density) or driven by experimental feasibility considerations (e.g., random radial or spiral sampling to achieve smoothness k-space trajectory). In this paper, we try to reconcile very recent CS results with the MRI specificities (mag- netic field gradients) by enforcing the measurements, i.e. samples of k-space, to fit continuous trajectories. To this end, we propose random walk continuous sampling based on Markov chains and we compare the reconstruction quality of this scheme to the state- of-the art.

preprint2013arXiv

Functional calibration estimation by the maximum entropy on the mean principle

We extend the problem of obtaining an estimator for the finite population mean parameter incorporating complete auxiliary information through calibration estimation in survey sampling but considering a functional data framework. The functional calibration sampling weights of the estimator are obtained by matching the calibration estimation problem with the maximum entropy on the mean principle. In particular, the calibration estimation is viewed as an infinite dimensional linear inverse problem following the structure of the maximum entropy on the mean approach. We give a precise theoretical setting and estimate the functional calibration weights assuming, as prior measures, the centered Gaussian and compound Poisson random measures. Additionally, through a simple simulation study, we show that our functional calibration estimator improves its accuracy compared with the Horvitz-Thompson estimator.

preprint2013arXiv

Sensitivity analysis for multidimensional and functional outputs

Let $X:=(X_1, \ldots, X_p)$ be random objects (the inputs), defined on some probability space $(Ω,{\mathcal{F}}, \mathbb P)$ and valued in some measurable space $E=E_1\times\ldots \times E_p$. Further, let $Y:=Y = f(X_1, \ldots, X_p)$ be the output. Here, $f$ is a measurable function from $E$ to some Hilbert space $\mathbb{H}$ ($\mathbb{H}$ could be either of finite or infinite dimension). In this work, we give a natural generalization of the Sobol indices (that are classically defined when $Y\in\mathbb R$ ), when the output belongs to $\mathbb{H}$. These indices have very nice properties. First, they are invariant. under isometry and scaling. Further they can be, as in dimension $1$, easily estimated by using the so-called Pick and Freeze method. We investigate the asymptotic behaviour of such estimation scheme.

preprint2013arXiv

Statistical inference for Sobol pick freeze Monte Carlo method

Many mathematical models involve input parameters, which are not precisely known. Global sensitivity analysis aims to identify the parameters whose uncertainty has the largest impact on the variability of a quantity of interest (output of the model). One of the statistical tools used to quantify the influence of each input variable on the output is the Sobol sensitivity index. We consider the statistical estimation of this index from a finite sample of model outputs. We study asymptotic and non-asymptotic properties of two estimators of Sobol indices. These properties are applied to significance tests and estimation by confidence intervals.

preprint2012arXiv

Derivative-based global sensitivity measures: general links with Sobol' indices and numerical tests

The estimation of variance-based importance measures (called Sobol' indices) of the input variables of a numerical model can require a large number of model evaluations. It turns to be unacceptable for high-dimensional model involving a large number of input variables (typically more than ten). Recently, Sobol and Kucherenko have proposed the Derivative-based Global Sensitivity Measures (DGSM), defined as the integral of the squared derivatives of the model output, showing that it can help to solve the problem of dimensionality in some cases. We provide a general inequality link between DGSM and total Sobol' indices for input variables belonging to the class of Boltzmann probability measures, thus extending the previous results of Sobol and Kucherenko for uniform and normal measures. The special case of log-concave measures is also described. This link provides a DGSM-based maximal bound for the total Sobol indices. Numerical tests show the performance of the bound and its usefulness in practice.

preprint2012arXiv

Efficient Estimation of Sensitivity Indices

In this paper we address the problem of efficient estimation of Sobol sensitivy indices. First, we focus on general functional integrals of conditional moments of the form $\E(ψ(\E(φ(Y)|X)))$ where $(X,Y)$ is a random vector with joint density $f$ and $ψ$ and $φ$ are functions that are differentiable enough. In particular, we show that asymptotical efficient estimation of this functional boils down to the estimation of crossed quadratic functionals. An efficient estimate of first-order sensitivity indices is then derived as a special case. We investigate its properties on several analytical functions and illustrate its interest on a reservoir engineering case.

preprint2012arXiv

Exact Reconstruction using Beurling Minimal Extrapolation

We show that measures with finite support on the real line are the unique solution to an algorithm, named generalized minimal extrapolation, involving only a finite number of generalized moments (which encompass the standard moments, the Laplace transform, the Stieltjes transformation, etc). Generalized minimal extrapolation shares related geometric properties with basis pursuit of Chen, Donoho and Saunders [CDS98]. Indeed we also extend some standard results of compressed sensing (the dual polynomial, the nullspace property) to the signed measure framework. We express exact reconstruction in terms of a simple interpolation problem. We prove that every nonnegative measure, supported by a set containing s points,can be exactly recovered from only 2s + 1 generalized moments. This result leads to a new construction of deterministic sensing matrices for compressed sensing.

preprint2012arXiv

Generalized Hoeffding-Sobol Decomposition for Dependent Variables -Application to Sensitivity Analysis

In this paper, we consider a regression model built on dependent variables. This regression modelizes an input output relationship. Under boundedness assumptions on the joint distribution function of the input variables, we show that a generalized Hoeffding-Sobol decomposition is available. This leads to new indices measuring the sensitivity of the output with respect to the input variables. We also study and discuss the estimation of these new indices.

preprint2012arXiv

Modeling Weather Conditions Consequences on Road Trafficking Behaviors

We provide a model to understand how adverse weather conditions modify traffic flow dynamic. We first prove that the microscopic Free Flow Speed of the vehicles is changed and then provide a rule to model this change. For this, we consider a thresholded linear model, corresponding to an application of a MARS model to road trafficking. This model adapts itself locally to the whole road network and provides accurate unbiased forecasted speed using live or short term forecasted weather data information.

preprint2011arXiv

LAN property for some fractional type Brownian motion

We study asymptotic expansion of the likelihood of a certain class of Gaussian processes characterized by their spectral density $f_θ$. We consider the case where $f_θ\PAR{x} \sim_{x\to 0} \ABS{x}^{-\al(θ)}L_θ(x)$ with $L_θ$ a slowly varying function and $\al\PARθ\in (-\infty,1)$. We prove LAN property for these models which include in particular fractional Brownian motion %$B^α_t,\: α\geq 1/2$ or ARFIMA processes.

preprint2011arXiv

Large Deviations for Random Matricial Moment Problems

We consider the moment space $\mathcal{M}_n^{K}$ corresponding to $p \times p$ complex matrix measures defined on $K$ ($K=[0,1]$ or $K=\D$). We endow this set with the uniform law. We are mainly interested in large deviations principles (LDP) when $n \rightarrow \infty$. First we fix an integer $k$ and study the vector of the first $k$ components of a random element of $\mathcal{M}_n^{K}$. We obtain a LDP in the set of $k$-arrays of $p\times p$ matrices. Then we lift a random element of $\mathcal{M}_n^{K}$ into a random measure and prove a LDP at the level of random measures. We end with a LDP on Carthéodory and Schur random functions. These last functions are well connected to the above random measure. In all these problems, we take advantage of the so-called canonical moments technique by introducing new (matricial) random variables that are independent and have explicit distributions.

preprint2011arXiv

Large Deviations for Random Spectral Measures and Sum Rules

We prove a Large Deviation Principle for the random spec- tral measure associated to the pair $(H_N; e)$ where $H_N$ is sampled in the GUE(N) and e is a fixed unit vector (and more generally in the $β$- extension of this model). The rate function consists of two parts. The contribution of the absolutely continuous part of the measure is the reversed Kullback information with respect to the semicircle distribution and the contribution of the singular part is connected to the rate function of the extreme eigenvalue in the GUE. This method is also applied to the Laguerre and Jacobi ensembles, but in thoses cases the expression of the rate function is not so explicit.

preprint2010arXiv

Generalized Dirichlet distributions on the ball and moments

The geometry of unit $N$-dimensional $\ell_{p}$ balls has been intensively investigated in the past decades. A particular topic of interest has been the study of the asymptotics of their projections. Apart from their intrinsic interest, such questions have applications in several probabilistic and geometric contexts (Barthe et al. 2005). In this paper, our aim is to revisit some known results of this flavour with a new point of view. Roughly speaking, we will endow the ball with some kind of Dirichlet distribution that generalizes the uniform one and will follow the method developed in Skibinsky (1967), Chang et al. (1993) in the context of the randomized moment space. The main idea is to build a suitable coordinate change involving independent random variables. Moreover, we will shed light on a nice connection between the randomized balls and the randomized moment space.