Approximation by finite mixtures of continuous density functions that vanish at infinity
T Tin Nguyen, Hien D Nguyen, Faicel Chamroukhi, Geoffrey J, McLachlan

TL;DR
This paper rigorously demonstrates that finite mixtures of continuous density functions vanishing at infinity can approximate a wide range of functions and densities in various modes, clarifying the scope of their approximation capabilities.
Contribution
It provides formal proofs that finite mixtures of densities in can approximate functions in multiple classes and modes, extending understanding of their approximation power.
Findings
Finite mixtures can uniformly approximate functions in .
Finite mixtures can approximate functions in on compact sets.
Finite mixtures can approximate functions in in the sense.
Abstract
Given sufficiently many components, it is often cited that finite mixture models can approximate any other probability density function (pdf) to an arbitrary degree of accuracy. Unfortunately, the nature of this approximation result is often left unclear. We prove that finite mixture models constructed from pdfs in can be used to conduct approximation of various classes of approximands in a number of different modes. That is, we prove approximands in can be uniformly approximated, approximands in can be uniformly approximated on compact sets, and approximands in can be approximated with respect to the , for . Furthermore, we also prove that measurable functions can be approximated, almost everywhere.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
\setbtxfallbacklanguage
english
Approximation by Finite Mixtures of Continuous Density Functions That Vanish at Infinity
T. Tin Nguyen, Hien D. Nguyen†, Faicel Chamroukhi,
and Geoffrey J. McLachlan T. Tin Nguyen and Faicel Chamroukhi are with department of Mathematics and Computer Science, Normandie University, UNICAEN, UMR CNRS LMNO, Caen, France. Hien D. Nguyen is with Department of Mathematics and Statistics, La Trobe University, Melbourne, Victoria, Australia. Geoffrey J. McLachlan is with School of Mathematics and Physics, University of Queensland, St. Lucia, Brisbane, Australia. E-mail: [email protected], [email protected], [email protected], [email protected]. †Corresponding author.
Abstract
Given sufficiently many components, it is often cited that finite mixture models can approximate any other probability density function (pdf) to an arbitrary degree of accuracy. Unfortunately, the nature of this approximation result is often left unclear. We prove that finite mixture models constructed from pdfs in can be used to conduct approximation of various classes of approximands in a number of different modes. That is, we prove approximands in can be uniformly approximated, approximands in can be uniformly approximated on compact sets, and approximands in can be approximated with respect to the , for . Furthermore, we also prove that measurable functions can be approximated, almost everywhere.
Keywords— Approximation theory, probability density functions, finite mixture models, Riemann summation, uniform approximation.
1 Introduction
Let be an element in the Euclidean space, defined by and the norm , for some . Let be a function, such that , everywhere, and , where is the Lesbegue measure. We say that is a probability density function (pdf) on the domain (an expression that we will drop, from hereon in). Let be another pdf, and for each , define the functional class:
[TABLE]
where , ,
[TABLE]
, and is the matrix transposition operator. We say that any is a location-scale finite mixture of the pdf .
The study of pdfs in the class is an evergreen area of applied and technical research, in statistics. We point the interested reader to the many comprehensive books on the topic, such as [10],[35], [22], [20], [23], [14], [33], [24], and [15].
Much of the popularity of finite mixture models stem from the folk theorem, which states that for any density , there exists an , for some sufficiently large number of components , such that approximates arbitrarily closely, in some sense. Examples of this folk theorem come in statements such as: “provided the number of component densities is not bounded above, certain forms of mixture can be used to provide arbitrarily close approximation to a given probability distribution” [35, p. 50], “the [mixture] model forms can fit any distribution and significantly increase model fit” [37, p. 173], and “a mixture model can approximate almost any distribution” [39, p. 500]. Other statements conveying the same sentiment are reported in [28]. There is a sense of vagary in the reported statements, and little is ever made clear regarding the technical nature of the folk theorem.
In order to proceed, we require the following definitions. We say that is compactly supported on , if is compact and if , where is the indicator function that takes value 1 when and [math], elsewhere, and is the set complement operator (i.e., ). Here, is a generic subset of . Furthermore, we say that for any , if
[TABLE]
and for , if
[TABLE]
where we call the on . When , we shall write . In addition, we define the so-called Kullback-Leibler divergence, see [17], between any two pdfs and on as
[TABLE]
In [28], the approximation of pdfs by the class was explored in a restrictive setting. Let be a sequence of functions that draw elements from the nested sequence of sets (i.e., ). The following result of [40] was presented in [28], along with a collection of its implications, such as the results of from [19] and [30].
Theorem 1** (Zeevi and Meir, 1997).**
If
[TABLE]
and are pdfs and is compact, then there exists a sequence such that
[TABLE]
Although powerful, this result is restrictive in the sense that it only permits approximation in the norm on compact sets , and that the result only allows for approximation of functions that are strictly positive on . In general, other modes of approximation are desirable, in particular approximation in for or are of interest, where the latter case is generally referred to as uniform approximation. Furthermore, the strict-positivity assumption, and the restriction on compact sets limits the scope of applicability of Theorem 1. An example of an interesting application of extensions beyond Theorem 1 is within the approximation framework of [8].
Let again be a pdf. Then, for each , we define
[TABLE]
which we call the set of location-scale linear combinations of the pdf . In the past, results regarding approximations of pdfs via functions have been more forthcoming. For example, in the case of , where
[TABLE]
is the standard normal pdf. Denoting the class of continuous functions with support on by . We have the result that for every pdf , compact set , and , there exists an and , such that [32, Lem. 1]. Furthermore, upon defining the set of continuous functions that vanish at infinity by
[TABLE]
we also have the result: for every pdf and , there exists an and , such that [32, Thm. 2]. Both of the results from [32] are simple implications of the famous Stone-Weierstrass theorem (cf. [34] and [7]).
To the best of our knowledge, the strongest available claim that is made regarding the folk theorem, within a probabilistic or statistical context, is that of [6, Thm. 33.2]. Let be a sequence of functions that draw elements from the nested sequence of sets , in the same manner as . We paraphrase the claim without loss of fidelity, as follows.
Claim 1*.*
If are pdfs and is compact, then there exists a sequence , such that
[TABLE]
Unfortunately, the proof of Claim 1 is not provided within [6]. The only reference of the result is to an undisclosed location in [4], which, upon investigation, can be inferred to be Theorem 5 of [4, Ch. 20]. It is further notable that there is no proof provided for the theorem. Instead, it is stated that the proof is similar to that of Theorem 1 in [4, Ch. 24], which is a reproduction of the proof for [38, Lem. 3.1].
There is a major problem in applying the proof technique of [38, Lem. 3.1] in order to prove Claim 1. The proof of [38, Lem. 3.1] critically depends upon the statement that “there is no loss of generality in assuming that for ”. Here, for , . The assumption is necessary in order to write any convolution with and an arbitrary continuous function as an integral over a compact domain, and then to use a Riemann sum to approximate such an integral. Subsequently, such a proof technique does not work outside the class of continuous functions that are compactly supported on . Thus, one cannot verify Claim 1 from the materials of [38], [4], and [6], alone.
Some recent results in the spirit of Claim 1 have been obtained by [27] and [26], using methods from the study of universal series (see for example in [25]).
Let
[TABLE]
denote the so-called Wiener’s algebra (see, e.g., [11]) and let
[TABLE]
be a class of functions with tails decaying at a faster rate than . In [26], it is noted that . Further, let
[TABLE]
denote the set of compactly supported continuous functions. The following theorem was proved in [27].
Theorem 2** (Nestoridis and Stefanopoulos, 2007, Thm. 3.2).**
If , then the following statements hold.
- (a)
For any , there exists a sequence (), such that
[TABLE]
- (b)
For any , there exists a sequence (), such that
[TABLE]
- (c)
For any and , there exists a sequence (), such that
[TABLE]
- (d)
For any measurable , there exists a sequence (), such that
[TABLE]
- (e)
If is a Borel measure on , then for any , there exists a sequence (), such that
[TABLE]
almost everywhere, with respect to .
The result was then improved upon, in [26], whereupon the more general space was taken as a replacement for , in Theorem 2. Denote the class of bounded continuous functions by . The following theorem was proved in [26].
Theorem 3** (Nestoridis et al., 2011, Thm. 3.2).**
If , then the following statements are true.
- (a)
The conclusion of Theorem 2(a) holds, with replaced by .
- (b)
The conclusions of Theorem 2(b)–(e) hold.
- (c)
For any and compact , there exists a sequence , such that
[TABLE]
Utilizing the techniques from [27], [1] proved a similar set of results to Theorem 2, under the restriction that is a non-negative function with support , using (i.e. has form (1), where ) and taking as the approximating sequence, instead of . That is, the following result is obtained.
Theorem 4** (Bacharoglou, 2010, Cor. 2.5).**
If , then the following statements are true.
- (a)
For any pdf , there exists a sequence (), such that
[TABLE]
- (b)
For any , such that , there exists a sequence (), such that
[TABLE]
- (c)
For any and , such that , there exists a sequence (), such that
[TABLE]
- (d)
For any measurable , there exists a sequence (), such that
[TABLE]
- (e)
For any pdf , there exists a sequence (), such that
[TABLE]
To the best of our knowledge, Theorem 4 is the most complete characterization of the approximating capabilities of the mixture of normal distributions. However, it is restrictive in two ways. First, it does not permit characterization of approximation via the class for any except the normal pdf . Although is traditionally the most common choice for in practice, the modern mixture model literature has seen the use of many more exotic component pdfs, such as the student-t pdf and its skew and modified variants (see, e.g., [29], [13], and [18]). Thus, its use is somewhat limited in the modern context. Furthermore, modern applications tend to call for , further restricting the impact of the result as a theoretical bulwark for finite mixture modeling in practice. A remark in [1] states that the result can generalized to the case where instead of . However, no suggestions were proposed, regarding the generalization of Theorem 4 to the case of .
In this article, we prove a novel set of results that largely generalize Theorem 4. Using techniques inspired by [9] and [4], we are able to obtain a set of results regarding the approximation capability of the class of mixture models , when or , and for any . By definition of , the majority of our results extend beyond the proposed possible generalizations of Theorem 4.
The article proceeds as follows. Our main theorem is stated and its seperate parts are proved in the Section 2. Comments and discussion are provided in Section 3. Necessary technical lemmas and results are also included, for reference, in the Appendix.
2 Main result
The remainder of the article is devoted to proving the following theorem.
Theorem 5** (Main result).**
If we assume that and are pdfs and that , then the following statements are true.
- (a)
For any , there exists a sequence (), such that
[TABLE]
- (b)
For any and compact , there exists a sequence (), such that
[TABLE]
- (c)
For any and , there exists a sequence (), such that
[TABLE]
- (d)
For any measurable , there exists a sequence (), such that
[TABLE]
- (e)
If is a Borel measure on , then for any , there exists a sequence (), such that
[TABLE]
almost everywhere, with respect to .
If we assume instead that , then the following statement is also true.
- (f)
For any , there exists a sequence (), such that
[TABLE]
2.1 Technical preliminaries
Before we begin to prove the main theorem, we establish some technical results regarding our class of component densities . Let and denote the convolution of and by . Further, we denote the sequence of dilates of by The following result is an alternative to Lemma 5 and Corollary 1. Here, we replace a boundedness assumption on the approximand, in the aforementioned theorem by a vanishing at infinity assumption, instead.
Lemma 1**.**
Let be a pdf and , such that . Then,
[TABLE]
Proof.
It suffices to show that for any , there exists a , such that , for all . By Lemma 6, , and thus . By making the substitution , we obtain for each
[TABLE]
By Corollary 1, we obtain and thus we can choose a , such that
[TABLE]
Since is a pdf, we have
[TABLE]
By uniform continuity, for any , there exists a such that , for any , such that (Lemma 6). Thus, on the one hand, for any , we can pick a such that
[TABLE]
and on the other hand
[TABLE]
The proof is completed by summing (2) and (3). ∎
Lemma 2**.**
If is such that , and , then there exists a , such that , and
[TABLE]
Proof.
Since , there exists a compact such that . By Lemma 7, there exists some , such that and . Let , which implies that and . Furthermore, notice that and , by construction. The proof is completed by observing that
[TABLE]
∎
For any , uniformly continuous function , let
[TABLE]
denote the modulus of continuity of . Furthermore, define the diameter of a set by and denote an open ball, centered at with radius by .
Notice that the class can be parameterized as
[TABLE]
where and . The following result is the primary mechanism that permits us to construct finite mixture approximations for convolutions of form . The argument motivated by the approaches taken in Theorem 1 in [4, Ch. 24], [27, Lem. 3.1], and [26, Thm. 3.1].
Lemma 3**.**
Let and be pdfs. Furthermore, let be compact and , where and . Then for any , there exists a sequence , such that
[TABLE]
Proof.
It suffices to show that for any and , there exists a sufficiently large enough so that for all such that
[TABLE]
For any , we can write
[TABLE]
Here, is continuous image of a compact set, and hence is compact (cf. [31, Thm. 4.14]). By Lemma 8, for any , there exists (, ), such that . Further, if , then we have . We can obtain a disjoint covering of by taking and () and noting that , by construction (cf. [4, Ch. 24]). Furthermore, each is a Borel set and .
For convenience, let denote the disjoint covering, or partition, of . We seek to show that there exists an and , such that
[TABLE]
where ,
[TABLE]
and , for .
Further, and , with chosen as follows. By Lemma 6, for some positive . Then, . We may choose so that , so that
[TABLE]
Since , the sum of () satisfies the inequality
[TABLE]
Thus, , and our construction implies that where
[TABLE]
We can bound the left-hand side of (4) as follows:
[TABLE]
Since
[TABLE]
we have , for each . Since (cf. [21, Thm. 4.7.3]), we may choose a so that . We may proceed from (2.1) as follows:
[TABLE]
To conclude the proof, it suffices to choose an appropriate sequence of partitions , for some large but finite , so that (2.1) and (6) hold, which is possible by Lemma 8. ∎
For any , let be a closed ball of radius , centered at the origin.
Lemma 4**.**
If , such that , then
[TABLE]
Proof.
By construction, each element of the sequence () is measurable, , and
[TABLE]
point-wise. We obtain our conclusion via the Lesbegue dominated convergence theorem. ∎
2.2 Proof of Theorem 5(a)
We now proceed to prove each of the parts of Theorem 5. To prove Theorem 5(a) it suffices to show that for every , there exists a , such that
Start by applying Lemma 2 to obtain , such that and . Then, we have
[TABLE]
The goal is to find a , such that . Since , we may find a compact such that . Apply Lemma 1 to show the existence of a , such that
[TABLE]
for all . With a fixed , apply Lemma 3 to show that there exists a , such that
[TABLE]
By the triangle inequality, we have
[TABLE]
The proof is complete by substitution of (8) into (7).
2.3 Proof of Theorem 5(b)
For any and compact , it suffices to show that there exists a sufficiently large enough so that for all such that .
By Lemma 5, we can find a , such that
[TABLE]
for every . Since , for some positive , by Lemma 6. For any , via Young’s convolution inequality:
[TABLE]
For fixed , we may choose , using Lemma 4, so that and thus the final term of (10) is bounded from above by for all . Thus, for and,
[TABLE]
Using Lemma 3, with approximand , component density , compact set , , and with fixed, we have the existence of a density such that
[TABLE]
We obtain the desired result by combining (9), (11), and (12), via the triangle inequality.
2.4 Proof of Theorem 5(c)
The technique used to prove Theorem 5(c) is different to those used in the previous sections. Here, we use a result of [9] that generalizes the classic Barron-Jones Hilbert space approximation result (cf. [16] and [2]) to Banach spaces.
To prove Theorem 5(c), it suffices to show that for every , there exists a sufficiently large enough so that for all such that . Begin by applying Corollary 1 to obtain a , such that
[TABLE]
for all .
For some pdf and fixed , let us define the class
[TABLE]
write the convex hull of as
[TABLE]
and call the convex hull of . We further say that is the closure of .
Because is a pdf, , and , we observe that . Thus, , for any , by Lemma 9. Since is a pdf and , we have the existence of and the fact that is finite.
Furthermore, for any , since and by definition of , we have Thus, we have
[TABLE]
by choosing .
Following [36], we can write the closure of as
[TABLE]
and thus we immediately have . Combined with (14), we can apply Lemma 11 to obtain the conclusion that there exists a function , such that
[TABLE]
where and is a finite constant. Since , is strictly increasing, and hence we can choose an , such that for all ,
[TABLE]
The proof is then completed by combining (13) and (15) via the triangle inequality.
2.5 Proof of Theorem 5(d) and Theorem 5(e)
By Theorem 5(a), there exists a sequence that uniformly converges to , as . Thus, by Lemma 12, almost uniformly converges to and also converges almost everywhere, to , with respect to any measure . We prove Theorem 5(d) by setting and we prove Theorem 5(e) by not specifying .
2.6 Proof of Theorem 5(f)
It suffices to show that for any , there exists a sufficiently large enough so that for all , where , such that . Begin by applying Lemma 4 in order to find a , for any , such that for all ,
[TABLE]
where , and with compact support .
Let and apply the triangle inequality to obtain
[TABLE]
Hence we need to show that there exists a function , such that
[TABLE]
Since and , by substitution, we have
[TABLE]
where are independent of . By Lemma 5 and Corollary 1, we can obtain a , such that for all ,
[TABLE]
Suppose that and let
[TABLE]
where
[TABLE]
By construction, and thus there exists a such that , for any .
For any , we can show that
[TABLE]
To do so, firstly, for any ,
[TABLE]
To obtain a Riemann sum approximation of , we use an argument analogous to that of Lemma 3. That is, we partition into disjoint Borel sets , and we approximate by a , where for each , , , and
[TABLE]
Define , , and , where
[TABLE]
by (16). Then, by a similar argument to Lemma 3, for all and . Thus, we may define an element via the parameters above.
For sufficiently large , we use Lemma 3 to show that
[TABLE]
which implies
[TABLE]
and thus (19) is proved. Using (19), we write
[TABLE]
where since is a pdf. The aim is now to prove that
[TABLE]
Using polar coordinates and (17), we have
[TABLE]
where is the surface area of a unit sphere embedded in . We then have
[TABLE]
which implies that we can choose a , such that for all ,
[TABLE]
Lastly, we write
[TABLE]
which implies that we can choose the same as above to obtain the bound
[TABLE]
for any .
Thus, we obtain the bound , for all , by combining (18), (19), (20), (21), (22), and (23), via the triangle inequality. The result is proved by combing the bound above, with (16), for an appropriately large .
3 Comments and discussion
3.1 Relationship to Theorem 1
In the proof of Theorem 1, the famous Hilbert space approximation result of [16] and [2] was used to bound the norm between any approximand and a convex combination of bounded functions in . This approximation theorem is exactly the case of the more general theorem of [9], as presented in Lemma 11. Thus, one can view Theorem 5(c) as the generalization of Theorem 1.
3.2 The class is a proper subset of the class
Here, we comment on the nature of class , which was investigated by [1] and [26]. We recall that [1] conjectured that Theorem 4 generalizes from to . In Theorem 5(a)–(e), we assume that . We can demonstrate that is a strictly weaker condition than or .
For example, consider the function in such that if and
[TABLE]
and note that
[TABLE]
Since , . Furthermore, is continuous since all stationary points of are continuous. In , if
[TABLE]
For , we observe that and thus the left limit is satisfied. On the right, for any , we have , so that , for all , where is the ceiling operator. Therefore, .
Within each interval , we observe that is locally maximized at . The local maximum corresponding to each of these points is . Thus , since
[TABLE]
where . Furthermore, since .
3.3 Convergence in measure
Along with the conclusions of Theorem 5(d) and (e), Lemma 12 also implies convergence in measure. That is, if is a Borel measure on , then for any , there exists a sequence , such that for any ,
[TABLE]
Appendix A Technical results
Throughout the main text, we utilize a number of established technical results. For the convenience of the reader, we append these results within this Appendix. Sources from which we draw the unproved results are provided at the end of the section.
Lemma 5**.**
Let be a sequence of pdfs in and for every
[TABLE]
Then, for all and ,
[TABLE]
Furthermore, for all and any compact ,
[TABLE]
The sequences from Lemma 5 are often called approximate identities or approximations of the identity. A simple construction of approximate identities is by taking dilations , which yields the following corollary.
Corollary 1**.**
Let be a pdf. Then the sequence of dilations , satisfies the hypothesis of Lemma 5 and hence permits its conclusion.
Lemma 6**.**
The class is a subset of . Furthermore, if , then is uniformly continuous.
Lemma 7** (Urysohn’s Lemma).**
If is compact, then there exists some , such that and .
Lemma 8**.**
If is bounded, then for any , can be covered by for some finite , where and .
Lemma 9**.**
If , then .
Let be the usual gamma function, defined as .
Lemma 10**.**
If and , for , then exists and we have .
Lemma 11**.**
Let , for some , and let . For any , such that , for all , there exists a , such that
[TABLE]
where , and
[TABLE]
Lemma 12**.**
In any measure , uniform convergence implies almost uniform convergence, and almost uniform convergence implies almost everywhere convergence and convergence in measure, with respect to .
Appendix B Sources of results
Lemma 5 is reported as Theorem 9.3.3 in [21] (see also Theorem 2 of [4, Ch. 20]). The proof of Corollary 1 can be taken from that of Theorem 4 of [4, Ch. 20]. Lemma 6 appears in [5], as Proposition 1.4.5. Lemma 7 is taken from Corollary 1.2.9 of [5]. Lemma 8 appears as Theorem 1.2.2 in [5]. Lemma 9 can be found in [12, Prop. 6.10]. Lemma 10 can be found in [21, Thm. 9.3.1]. Lemma 11 appears as Corollary 2.6 in [9]. Lemma 12 can be obtained from the definition of almost uniform convergence, Lemma 7.10, and Theorem 7.11 of [3].
Acknowledgment
HDN is personally funded by Australian Research Council (ARC) grant DE170101134. HDN and GJM are supported by ARC grant DP180101192. FC is supported by Agence Nationale de la Recherche (ANR) grant SMILES ANR-18-CE40-0014 and by Région Normandie grant RIN AStERiCs.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A G Bacharoglou. Approximation of probability distributions by convex mixtures of Gaussian measures. Proceedings of the American Mathematical Society , 138:2619–2628, 2010.
- 2[2] A R Barron. Universal approximation bound for superpositions of a sigmoidal function. IEEE Transactions on Information Theory , 39:930–945, 1993.
- 3[3] R G Bartle. The Elements of Integration and Lesbegue Measure . Wiley, New York, 1995.
- 4[4] W Cheney and W Light. A Course in Approximation Theory . Brooks/Cole, Pacific Grove, 2000.
- 5[5] J B Conway. A Course in Abstract Analysis . American Mathematical Society, Providence, 2012.
- 6[6] A Das Gupta. Asymptotic Theory Of Statistics And Probability . Springer, New York, 2008.
- 7[7] L De Branges. The Stone-Weierstrass theorem. Proceedings of the American Mathematical Society , 10:822–824, 1959.
- 8[8] L Devroye and G Lugosi. Combinatorial Methods in Density Estimation . Springer, New York, 2000.
