Papers
Topics
Authors
Recent
2000 character limit reached

Aumann and Fréchet Means Overview

Updated 18 November 2025
  • Aumann and Fréchet means are expectation operators for set-valued random variables, defined respectively via Minkowski summation of selections and minimization of expected squared distances.
  • Their equivalence under suitable regularity conditions provides a unified framework that ensures unique, robust means and facilitates inference in regression and econometric models.
  • By leveraging Hilbert space embeddings and support function metrics, this approach enhances convergence analysis and extends to partial identification in econometric applications.

Aumann and Fréchet means are two fundamental approaches to defining expectation operators for set-valued random variables (SVRVs) arising in probability theory, statistics, and econometrics. The Aumann mean is the classical notion for SVRVs with convex values, grounded in the structure of selections and Minkowski summation, while the Fréchet mean extends the concept of “mean” to more general metric spaces by minimizing expected squared distance. Recent results establish their equivalence under suitable regularity conditions, which provides a unified framework for inference, regression, and identification analysis involving random sets (Kurisu et al., 17 Nov 2025).

1. Definitions: Aumann Mean and Fréchet Mean

Let (Ω,A,μ)(\Omega, \mathcal{A}, \mu) denote a probability space and Kkc(Rd)K_{kc}(\mathbb{R}^d) the collection of all nonempty compact convex subsets of Rd\mathbb{R}^d. An SVRV is a measurable function F:ΩKkc(Rd)F: \Omega \to K_{kc}(\mathbb{R}^d). The selection set is

S(F)={f:ΩRd measurable:f(ω)F(ω) a.s.},S1(F)=S(F)L1(Ω,Rd).S(F) = \{f: \Omega \to \mathbb{R}^d \text{ measurable}: f(\omega) \in F(\omega) \text{ a.s.} \},\quad S^1(F) = S(F) \cap L^1(\Omega, \mathbb{R}^d).

If FF is integrably bounded (that is, supxF(ω)xL1\sup_{x \in F(\omega)} \|x\| \in L^1), the Aumann mean is

E[F]={E[f]:fS1(F)}Rd,\mathbb{E}[F] = \{ \mathbb{E}[f] : f \in S^1(F) \} \subset \mathbb{R}^d,

which is a convex set. For more general random objects in complete separable metric spaces (M,d)(M,d), the Fréchet mean is any minimizer

E+[Y]argminνME[d2(Y,ν)].\mathbb{E}_+[Y] \in \operatorname*{argmin}_{\nu \in M} \mathbb{E}[d^2(Y, \nu)].

The conditional Fréchet mean is analogously defined when conditioning on auxiliary variables.

2. Metric Structure and Support Functions

The support function of FKkc(Rd)F \in K_{kc}(\mathbb{R}^d) is

s(p,F)=supxFp,x,pSd1,s(p, F) = \sup_{x \in F} \langle p, x \rangle, \quad p \in S^{d-1},

with Sd1S^{d-1} the unit sphere. The support-function metric between F,GKkc(Rd)F, G \in K_{kc}(\mathbb{R}^d) is given by

dkc(F,G)=(Sd1[s(p,F)s(p,G)]2dp)1/2,d_{kc}(F,G) = \left( \int_{S^{d-1}} [s(p, F) - s(p, G)]^2 dp \right)^{1/2},

which metrizes Kkc(Rd)K_{kc}(\mathbb{R}^d). The bounded family KkcB(Rd)={FKkc(Rd):supxFxB}K_{kc}^B(\mathbb{R}^d) = \{F \in K_{kc}(\mathbb{R}^d): \sup_{x \in F} \|x\| \leq B\} is closed, convex, bounded, and complete under dkcd_{kc}.

Convergence in the Hausdorff metric is equivalent, for uniformly bounded sets, to convergence in the L2L^2 sense of support functions. This endows the space of compact convex sets with a robust metric geometry, enabling the use of Hilbert space embeddings in subsequent analysis.

3. Isometric Embedding and Characterization of Fréchet Means

A Hilbert space representation is central: suppose there exists an injective, continuous map Ψ:MH\Psi: M \to H into a Hilbert space (H,,)(H, \langle \cdot, \cdot \rangle) such that

d(α,β)=Ψ(α)Ψ(β)H,Ψ(M) closed and convex,d(\alpha, \beta) = \|\Psi(\alpha) - \Psi(\beta)\|_H, \quad \Psi(M) \text{ closed and convex},

then for YMY \in M with E[Ψ(Y)H]<\mathbb{E}[\|\Psi(Y)\|_H] < \infty,

Ψ(E+[Y])=E[Ψ(Y)],E+[Y]=Ψ1(E[Ψ(Y)]).\Psi(\mathbb{E}_+[Y]) = \mathbb{E}[\Psi(Y)],\quad \mathbb{E}_+[Y] = \Psi^{-1}( \mathbb{E}[\Psi(Y)] ).

The law of iterated expectation also holds in the image: Ψ(E+[E+[YX]])=E[Ψ(Y)]\Psi(\mathbb{E}_+[\mathbb{E}_+[Y|X]]) = \mathbb{E}[\Psi(Y)].

For random sets, take M=KkcB(Rd)M = K_{kc}^B(\mathbb{R}^d), H=L2(Sd1)H = L^2(S^{d-1}), and Ψ(F)=s(,F)\Psi(F) = s(\cdot, F). Then Ψ\Psi is an isometry onto a closed convex subset of L2L^2.

4. Equivalence of Aumann and Fréchet Means

Via Artstein’s theorem, for integrably bounded SVRV FF,

E[s(p,F)]=s(p,E[F]),p,\mathbb{E}[s(p, F)] = s(p, \mathbb{E}[F]), \quad \forall p,

so the mean of support functions equals the support function of the Aumann mean. Consequently,

E+[F]=Ψ1(E[Ψ(F)])=E[F].\mathbb{E}_+[F] = \Psi^{-1}(\mathbb{E}[\Psi(F)]) = \mathbb{E}[F].

This equivalence holds both unconditionally and conditionally (on a covariate XX), and ensures uniqueness of both means under integrability and boundedness:

  • Both Aumann and Fréchet means (and their conditional analogues) under dkcd_{kc} exist and are unique.
  • The law of iterated Fréchet expectation coincides with the Aumann law.

For i.i.d. random sets F1,,FnF_1, \ldots, F_n in KkcB(Rd)K_{kc}^B(\mathbb{R}^d), the unique sample Fréchet mean is

μn=argminν1ni=1ndkc2(ν,Fi)=(1/n)i=1nFi,\mu_n = \operatorname*{argmin}_\nu \frac{1}{n} \sum_{i=1}^n d_{kc}^2(\nu, F_i) = (1/n) \bigoplus_{i=1}^n F_i,

coinciding with the Minkowski average.

5. Explicit Examples and Regression with Random Sets

In the one-dimensional case (d=1d=1), every FKkc(R)F \in K_{kc}(\mathbb{R}) is an interval [L,U][L, U], with support function s(1,F)=Us(1, F) = U, s(1,F)=Ls(-1, F) = -L. Hence,

E[F]=[E[L],E[U]],\mathbb{E}[F] = [\mathbb{E}[L], \mathbb{E}[U]],

which also coincides with the Fréchet mean under dkcd_{kc}.

In global Fréchet regression, the criterion is weighted by a function w(x,X)w(x,X), for which

m+(x)=argminνE[w(x,X)d2(ν,F)].m_+(x) = \operatorname*{argmin}_\nu \mathbb{E}[w(x,X) d^2(\nu, F)].

Through the embedding, if w(x,)1w(x, \cdot) \geq 1,

m+(x)=E[w(x,X)F]=E[F](xμ)Σ1E[(Xμ)F],m_+(x) = \mathbb{E}[w(x, X) F] = \mathbb{E}[F] \oplus (x - \mu)^\top \Sigma^{-1} \mathbb{E}[ (X-\mu)F ],

aligning with the set-valued best linear predictor of Beresteanu–Molinari (2008). If ww may dip below $1$, a Hilbert projection step is required, but the characterization remains explicit.

6. Applications in Econometrics: Partial Identification and Missing Data

In partially identified econometric models, the Aumann mean frequently appears as the identified set for a parameter modeled as a random set; the sample analog is the Minkowski average. By recognizing the equivalence to Fréchet means, metric-statistical techniques become available, such as:

  • Global Fréchet regression for set-valued predictors
  • Inverse-probability-weighted Fréchet means for “missing at random” SVRV data
  • Errors-in-variables and instrumental-variable frameworks via general weighting w(x,)w(x,\cdot)

Convergence rates for these estimators are provided under covering-number assumptions, with near-parametric rates achievable when d4d \leq 4 in low-dimensional settings.

7. Historical Context and Foundational Results

The notion of the Aumann mean was introduced in Aumann (1965), building on the concept of selections for set-valued mappings. Fréchet (1948) proposed the mean as a minimizer of expected squared distance in metric spaces. Artstein (1974) proved the support function expectation result foundational for the equivalence. The set-valued best linear predictor and regression frameworks were established in Beresteanu–Molinari (2008). The unification of these notions via metric statistics and Hilbert embeddings is detailed in Kurisu–Okamoto–Otsu (Kurisu et al., 17 Nov 2025). The framework systematically connects random sets, their metric geometry, and applications in partially identified econometric models.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (1)
Forward Email Streamline Icon: https://streamlinehq.com

Follow Topic

Get notified by email when new papers are published related to Aumann and Fréchet Means.