Searcharxiv⌕ Search

arXiv subjects

Giovanni Pistone

Publications and source records attributed to Giovanni Pistone.

36 records · Page 2Linked to original sources

Projection based dimensionality reduction for measure valued evolution equations in statistical manifolds

We propose a dimensionality reduction method for infinite-dimensional measure-valued evolution equations such as the Fokker-Planck partial differential equation or the Kushner-Stratonovich resp. Duncan-Mortensen-Zakai stochastic partial differential equations of nonlinear filtering, with potential applications to signal processing, quantitative finance, heat flows and quantum theory among many other areas. Our method is based on the projection coming from a duality argument built in the exponential statistical manifold structure developed by G. Pistone and co-authors. The choice of the finite dimensional manifold on which one should project the infinite dimensional equation is crucial, and we propose finite dimensional exponential and mixture families. This same problem had been studied, especially in the context of nonlinear filtering, by D. Brigo and co-authors but the $L^2$ structure on the space of square roots of densities or of densities themselves was used, without taking an infinite dimensional manifold environment space for the equation to be projected. Here we re-examine such works from the exponential statistical manifold point of view, which allows for a deeper geometric understanding of the manifold structures at play. We also show that the projection in the exponential manifold structure is consistent with the Fisher Rao metric and, in case of finite dimensional exponential families, with the assumed density approximation. Further, we show that if the sufficient statistics of the finite dimensional exponential family are chosen among the eigenfunctions of the backward diffusion operator then the statistical-manifold or Fisher-Rao projection provides the maximum likelihood estimator for the Fokker Planck equation solution. We finally try to clarify how the finite dimensional and infinite dimensional terminology for exponential and mixture spaces are related.

math.PR↗

Information Geometry Formalism for the Spatially Homogeneous Boltzmann Equation

Information Geometry generalizes to infinite dimension by modeling the tangent space of the relevant manifold of probability densities with exponential Orlicz spaces. We review here several properties of the exponential manifold on a suitable set $\mathcal E$ of mutually absolutely continuous densities. We study in particular the fine properties of the Kullback-Liebler divergence in this context. We also show that this setting is well-suited for the study of the spatially homogeneous Boltzmann equation if $\mathcal E$ is a set of positive densities with finite relative entropy with respect to the Maxwell density. More precisely, we analyse the Boltzmann operator in the geometric setting from the point of its Maxwell's weak form as a composition of elementary operations in the exponential manifold, namely tensor product, conditioning, marginalization and we prove in a geometric way the basic facts i.e., the H-theorem. We also illustrate the robustness of our method by discussing, besides the Kullback-Leibler divergence, also the property of Hyvärinen divergence. This requires to generalise our approach to Orlicz-Sobolev spaces to include derivatives.%

math.ST↗

The gradient flow of the polarization measure. With an appendix

The polarization measure is the probability that among 3 individuals chosen at random from a finite population exactly 2 come from the same class. This index is maximum at the midpoints of the edges of the probability simplex. We compute the gradient flow of this index that is the differential equation whose solutions are the curves of steepest ascent. Tools from Information Geometry are extensively used. In a time series, a comparison of the estimated velocity of variation with the direction of the gradient field should be a better index than the simple variation of the index.

math.ST↗

Optimization via Information Geometry

Information Geometry has been used to inspire efficient algorithms for stochastic optimization, both in the combinatorial and the continuous case. We give an overview of the authors' research program and some specific contributions to the underlying theory.

math.ST↗

Examples of Application of Nonparametric Information Geometry to Statistical Physics

We review a nonparametric version of Amari's Information Geometry in which the set of positive probability densities on a given sample space is endowed with an atlas of charts to form a differentiable manifold modeled on Orlicz Banach spaces. This nonparametric setting is used to discuss the setting of typical problems in Machine Learning and Statistical Physics, such as relaxed optimization, Kullback-Leibler divergence, Boltzmann entropy, Boltzmann equation

math.ST↗

Nonparametric Information Geometry

The differential-geometric structure of the set of positive densities on a given measure space has raised the interest of many mathematicians after the discovery by C.R. Rao of the geometric meaning of the Fisher information. Most of the research is focused on parametric statistical models. In series of papers by author and coworkers a particular version of the nonparametric case has been discussed. It consists of a minimalistic structure modeled according the theory of exponential families: given a reference density other densities are represented by the centered log likelihood which is an element of an Orlicz space. This mappings give a system of charts of a Banach manifold. It has been observed that, while the construction is natural, the practical applicability is limited by the technical difficulty to deal with such a class of Banach spaces. It has been suggested recently to replace the exponential function with other functions with similar behavior but polynomial growth at infinity in order to obtain more tractable Banach spaces, e.g. Hilbert spaces. We give first a review of our theory with special emphasis on the specific issues of the infinite dimensional setting. In a second part we discuss two specific topics, differential equations and the metric connection. The position of this line of research with respect to other approaches is briefly discussed.

math.ST↗

The algebra of interpolatory cubature formulae for generic nodes

We consider the classical problem of computing the expected value of a real function $f$ of the $d$-variate random variable $X$ using cubature formulæ. We use in synergy tools from Commutative Algebra for cubature rulæ, from elementary orthogonal polynomial theory and from Probability.

math.ST↗

Marginal Polytope of a Deformed Exponential Family

A deformed logarithm function called $q$-logarithm has received considerable attention by physicist after its introduction by C. Tsallis. J. Naudts has proposed a generalization called $ϕ$-logarithm and he has derived the basic properties of $ϕ$-exponential families. In this paper we study the related notion of marginal polytope in the case of a finite state space.

math.ST↗

Toric Statistical Models: Ising and Markov

This is a review of current research in Markov chains as toric statistical models. Its content is mixture of background information, results from the relevant recent literature, new results, and work in progress.

math.ST↗

The Algebra of Reversible Markov Chains

For a Markov chain both the detailed balance condition and the cycle Kolmogorov condition are algebraic binomials. This remark suggests to study reversible Markov chains with the tool of Algebraic Statistics, such as toric statistical models. One of the results of this study in an algebraic parameterization of reversible Markov transitions and their invariant probability.

math.ST↗

A note on the border of an exponential family

Limits of densities belonging to an exponential family appear in many applications, {e.g.} Gibbs models in Statistical Physics, relaxed combinatorial optimization, coding theory, critical likelihood computations, Bayes priors with singular support, random generation of factorial designs. We discuss the problem from the methodological point of view in the case of a finite state space. We prove two characterizations of the limit distributions, both based on a suitable description of the marginal polytope (convex hull of canonical statistics' values). First, the set of limit densities is equal to the set of conditional densities given a face of the marginal polytope. Second, in the lattice case there exists a parametric presentation, in monomial form, of the closure of the statistical model.

math.ST↗

Generation of Fractional Factorial Designs

The joint use of counting functions, Hilbert basis and Markov basis allows to define a procedure to generate all the fractions that satisfy a given set of constraints in terms of orthogonality. The general case of mixed level designs, without restrictions on the number of levels of each factor (like primes or power of primes) is studied. This new methodology has been experimented on some significant classes of fractional factorial designs, including mixed level orthogonal arrays.

stat.ME↗

$κ$-exponential models from the geometrical viewpoint

We discuss the use of Kaniadakis' $κ$-exponential in the construction of a statistical manifold modelled on Lebesgue spaces of real random variables. Some algebraic features of the deformed exponential models are considered. A chart is defined for each strictly positive densities; every other strictly positive density in a suitable neighborhood of the reference probability is represented by the centered $\Kln$ likelihood

math.ST↗

Projecting the Fokker-Planck Equation onto a finite dimensional exponential family

In the present paper we discuss problems concerning evolutions of densities related to Ito diffusions in the framework of the statistical exponential manifold. We develop a rigorous approach to the problem, and we particularize it to the orthogonal projection of the evolution of the density of a diffusion process onto a finite dimensional exponential manifold. It has been shown by D. Brigo (1996) that the projected evolution can always be interpreted as the evolution of the density of a different diffusion process. We give also a compactness result when the dimension of the exponential family increases, as a first step towards a convergence result to be investigated in the future. The infinite dimensional exponential manifold structure introduced by G. Pistone and C. Sempi is used and some examples are given.

math.PR↗

2-level fractional factorial designs which are the union of non trivial regular designs

Every fraction is a union of points, which are trivial regular fractions. To characterize non trivial decomposition, we derive a condition for the inclusion of a regular fraction as follows. Let $F = \sum_αb_αX^α$ be the indicator polynomial of a generic fraction, see Fontana et al, JSPI 2000, 149-172. Regular fractions are characterized by $R = \frac 1l \sum_{α\in \mathcal L} e_αX^α$, where $α\mapsto e_α$ is an group homeomorphism from $\mathcal L \subset \mathbb Z_2^d$ into $\{-1,+1\}$. The regular $R$ is a subset of the fraction $F$ if $FR = R$, which in turn is equivalent to $\sum_t F(t)R(t) = \sum_t R(t)$. If $\mathcal H = \{α_1 >... α_k\}$ is a generating set of $\mathcal L$, and $R = \frac1{2^k}(1 + e_1X^{α_1}) ... (1 + e_kX^{α_k})$, $e_j = \pm 1$, $j=1 ... k$, the inclusion condition in term of the $b_α$'s is % \begin{equation}b_0 + e_1 b_{α_1} + >... + e_1 ... e_k b_{α_1 + ... + α_k} = 1. \tag{*}\end{equation} % The last part of the paper will discuss some examples to investigate the practical applicability of the previous condition (*). This paper is an offspring of the Alcotra 158 EU research contract on the planning of sequential designs for sample surveys in tourism statistics.

stat.ME↗

Indicator function and complex coding for mixed fractional factorial designs

In a general fractional factorial design, the $n$-levels of a factor are coded by the $n$-th roots of the unity. This device allows a full generalization to mixed-level designs of the theory of the polynomial indicator function which has already been introduced for two level designs by Fontana and the Authors (2000). the properties of orthogonal arrays and regular fractions are discussed.

math.ST↗

Algebraic Bayesian analysis of contingency tables with possibly zero-probability cells

In this paper we consider a Bayesian analysis of contingency tables allowing for the possibility that cells may have probability zero. In this sense we depart from standard log-linear modeling that implicitly assumes a positivity constraint. Our approach leads us to consider mixture models for contingency tables, where the components of the mixture, which we call model-instances, have distinct support. We rely on ideas from polynomial algebra in order to identify the various model instances. We also provide a method to assign prior probabilities to each instance of the model, as well as describing methods for constructing priors on the parameter space of each instance. We illustrate our methodology through a $5 \times 2$ table involving two structural zeros, as well as a zero count. The results we obtain show that our analysis may lead to conclusions that are substantively different from those that would obtain in a standard framework, wherein the possibility of zero-probability cells is not explicitly accounted for.

math.ST↗

Hilbert Bases for Orthogonal Arrays

In this paper, we relate the problem of generating all 2-level orthogonal arrays of given dimension and force, i.e. elements in OA$(n,m)$, where $n$ is the number of factors and $m$ the force, to the solution of an Integer Programming problem involving rational convex cones. We do not restrict the number of points in the array, i.e. we admit any number of replications. This problem can be theoretically solved by means of Hilbert bases which form a finite generating set for all the elements in in the infinite set OA$(n,m)$. We discuss some examples which are explicitly solved with a software performing Hilbert bases computation.

math.ST↗