Truncation Dimension for Linear Problems on Multivariate Function Spaces
Aicke Hinrichs, Peter Kritzer, Friedrich Pillichshammer, G.W., Wasilkowski

TL;DR
This paper investigates the truncation dimension in multivariate function spaces, determining when solutions can be approximated by functions with fewer variables, and finds that the necessary number of variables can be surprisingly small.
Contribution
It introduces the concept of truncation dimension for linear problems on weighted multivariate spaces and analyzes conditions under which high-dimensional problems can be effectively approximated.
Findings
Truncation dimension can be very small even with modest weight decay.
Approximation error can be controlled by truncating to a small number of variables.
The results provide insights into high-dimensional problem simplification.
Abstract
The paper considers linear problems on weighted spaces of multivariate functions of many variables. The main questions addressed are: When is it possible to approximate the solution for the original function of very many variables by the solution for the same function; however with all but the first variables set to zero, so that the corresponding error is small? What is the truncation dimension, i.e., the smallest number such that the corresponding error is bounded by a given error demand ? Surprisingly, could be very small even for weights with a modest speed of convergence to zero.
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.
Taxonomy
TopicsMathematical Approximation and Integration · Mathematical functions and polynomials · Matrix Theory and Algorithms
Truncation Dimension for Linear Problems on Multivariate Function Spaces
Aicke Hinrichs, Peter Kritzer, Friedrich Pillichshammer, G.W. Wasilkowski A. Hinrichs, P. Kritzer, and F. Pillichshammer gratefully acknowledge the support of the Erwin Schrödinger International Institute for Mathematics and Physics (ESI) in Vienna under the thematic programme “Tractability of High Dimensional Problems and Discrepancy”.P. Kritzer is supported by the Austrian Science Fund (FWF), Project F5506-N26.F. Pillichshammer is supported by the Austrian Science Fund (FWF) Project F5509-N26. Both projects are parts of the Special Research Program ”Quasi-Monte Carlo Methods: Theory and Applications”.
Abstract
The paper considers linear problems on weighted spaces of multivariate functions of many variables. The main questions addressed are: When is it possible to approximate the solution for the original function of very many variables by the solution for the same function; however with all but the first variables set to zero, so that the corresponding error is small? What is the truncation dimension, i.e., the smallest number such that the corresponding error is bounded by a given error demand ? Surprisingly, could be very small even for weights with a modest speed of convergence to zero.
1 Introduction
This paper is a continuation of our study initiated in [5, 7] on the truncation dimension for functions with a huge (or even infinite) number of variables. In [5] the problem of numerical integration and in [7] function approximation is studied, but in both cases only anchored Sobolev spaces are considered. Here our focus is on more general linear problems and function spaces.
We start by providing the definition of the truncation dimension. Let be a normed linear space of -variate functions defined on . Here is very large or even infinite. We assume that is a possibly unbounded interval of such that . Let
[TABLE]
be a continuous linear operator acting from to another normed linear space . Consider the problem of approximating for . Suppose that for any and any the function obtained from by setting all the variables with to be zero,
[TABLE]
also belongs to . It is natural to ask whether approximations of , where (here indicates in an informal way that is “much” smaller than ), are good enough to approximate . This leads to the following notion of truncation error and truncation dimension.
For given , by the * truncation error* we mean
[TABLE]
Definition 1
For a given error demand , the -truncation dimension for approximating (or truncation dimension for short) is defined as
[TABLE]
It is the main aim of this work to relate the truncation dimension to the error of approximation of . We prove such a relation in Theorem 3.
We stress that the truncation dimension is a property of the problem. In particular, it depends on the spaces , the operator , and the error demand . This is in contrast with the truncation dimension concept in statistical literature (see e.g. [1, 10, 11, 13]), which depends on the particular function under consideration. Moreover, it is defined via ANOVA decomposition which is hard to approximate directly using only a finite number of function values.
In the rest of the paper we estimate the truncation dimension for a special, yet important, class of -weighted spaces with anchored decomposition and having a tensor product form.
Roughly speaking (see Section 2 for details), functions from have a unique decomposition
[TABLE]
where the sum is with respect to finite subsets (or if ), and each function depends only on the variables listed in . Moreover, each belongs to a normed space , and we define the norm in by
[TABLE]
for some and positive numbers called weights. Of course when .
For , these spaces include spaces of special functions of the form
[TABLE]
where is the value of the stochastic process at time . Here the ’s are i.i.d. random variables and the base functions converge to zero sufficiently fast. Clearly
[TABLE]
Functions of the form
[TABLE]
appear in a number of applications including partial differential with random coefficients and stochastic differential equation. The spaces considered in the paper are more complex and, hence, our positive results are even more important.
Assume that the weights can be written as product weights of the form
[TABLE]
for some . We prove that then (cf. Theorem 2) the truncation dimension can be bounded from above by the smallest integer such that
[TABLE]
Here and elsewhere, is the conjugate of (i.e., ), is a number such that and is the norm of the operator restricted to the space of functions depending only on one variable. (One has to apply the usual adaptions if , cf. Theorem 2 again.) From this result it can be seen that faster decay of the leads to smaller truncation dimension.
We illustrate this for different values of , , and . We use product weights of the form for . For simplicity, we assume that . For we have:
[TABLE]
In particular, for the error demand it is enough to work with only variables when , only variables when , and with or when or , respectively.
For we have , which leads to even better results. The following table already appeared in [7]:
[TABLE]
The content of the paper is as follows. In Section 2, we provide basic definitions and the main result. In Section 3, we propose spaces that are generalizations of anchored Sobolev spaces with bounded mixed derivatives of order one, that have been considered extensively in the literature. We next apply the general results to these special spaces. In Section 4, we study some unanchored spaces and show when they are equivalent to their anchored counterparts. Note that the equivalence implies that algorithms with small errors for anchored spaces also have small errors for the corresponding unanchored spaces. The results in Section 4 are extensions of results in [2, 3, 4, 6] since they pertain to general spaces of this paper and more general decompositions than the ANOVA one.
2 Weighted Anchored Spaces of Multivariate Functions
We begin by introducing the notation used throughout the paper. For and
[TABLE]
we will use to denote subsets of , i.e., . If , then and denote finite subsets of .
We assume that the functions have a unique decomposition of the form
[TABLE]
where each belongs to a normed linear space such that if , depends only on , and
[TABLE]
Here is the space of constant functions with the absolute value as its norm. In the case , the convergence of the series (2) is with respect to the norm in defined below in (5). In some cases the series (2) need not converge pointwise; then we treat it as a sequence and is a sequence space. We refer to Remark 2 for a further discussion of the case . Clearly, the property (3) yields that for any and ,
[TABLE]
where is defined in (1).
We assume that for given positive weights , the norm in is given by
[TABLE]
Let be restricted to , and let be its operator norm,
[TABLE]
We have the following simple proposition.
Proposition 1
For every we have
[TABLE]
where here and throughout this paper means summation over all with . Hence
[TABLE]
Of course, for , we have
[TABLE]
Proof.
We have
[TABLE]
where, in the last step, we used together with Hölder’s inequality. From this the result follows. ∎
In this paper we mainly concentrate on product weights, introduced in [12], that have the form
[TABLE]
for a nonincreasing sequence of positive numbers for .
Theorem 2
Suppose that the weights are product weights and that there exists a constant such that
[TABLE]
For and every we have
[TABLE]
Hence is bounded from above by
[TABLE]
For and every we have
[TABLE]
and if additionally then .
Proof.
We have
[TABLE]
since for all . From this the result follows. ∎
Remark 1
It is well known that (6) holds if is a Hilbert space and, for every , the spaces are -fold tensor products of and also are -fold tensor products of , i.e.,
[TABLE]
Actually then we have
[TABLE]
However, (6) also holds with inequality for Banach spaces and operators that we consider in the next sections.
We introduce some further notation. For and , denotes the -dimensional vector with all for replaced by zero, i.e.,
[TABLE]
As shown in [5] for the integration problem, the importance of the -truncation dimension lies in the fact that when approximating for functions it is sufficient to approximate only for -variate functions
[TABLE]
with since and, therefore,
[TABLE]
For , let
[TABLE]
be the subspace of consisting of -variate functions , and let be an algorithm for approximating for functions from that uses function values. The worst case error of with respect to the space is
[TABLE]
Now let
[TABLE]
be an algorithm for approximating functions from the whole space . The worst case error of is defined as
[TABLE]
This yields the following theorem.
Theorem 3
For given and we have
[TABLE]
Proof.
The spaces are subspaces of . Moreover any belongs to and
[TABLE]
Therefore, for any we have
[TABLE]
with the last inequality due to Hölder’s inequality. ∎
In the following section we consider anchored Sobolev spaces of multivariate functions and show that the assumptions above are justified. As examples for the linear approximation problem we consider function approximation and integration.
3 Anchored Spaces of Multivariate Functions
In this section, we begin by recalling the definitions and basic properties of weighted anchored Sobolev spaces of -variate functions with mixed partial derivatives of order one bounded in -norm. More detailed information can be found in [3, 4, 14]. Such spaces have often been assumed in the context of quasi-Monte Carlo methods. However, for us they serve as a motivation to consider more general classes of anchored spaces.
3.1 Anchored Sobolev Spaces
Here we follow [3]. We use the notations , and as above. We also write to denote the -dimensional vector and
[TABLE]
For a family of weights , which are non-negative numbers, and for the corresponding -weighted anchored space is the Banach space of functions defined on with the norm
[TABLE]
For , the norm reduces to
[TABLE]
As shown in [3] the functions from have the unique decomposition
[TABLE]
where each , although formally a function of , depends only on the variables , and is an element of a space given by
[TABLE]
Here, for and
[TABLE]
where if and otherwise, and
[TABLE]
Recall that for , is the space of constant functions with the absolute value as its norm.
An important property of these spaces is that they are anchored at [math], i.e., for any and any ,
[TABLE]
This implies that
[TABLE]
3.2 More General Anchored Spaces
In this section we extend the definition of from the previous section to spaces of functions
[TABLE]
with the components given by
[TABLE]
where could be more general than , and could be from a more general -weighted space.
More specifically, let be an interval in that, without any loss of generality, contains [math]. This includes both bounded intervals like from the previous subsection, as well as unbounded ones, e.g., or .
Let
[TABLE]
be a measurable and (a.e.) positive weight function. For , by we denote the space of scalar functions with the norm
[TABLE]
For non-empty , is the space of -variate functions with the norm given by
[TABLE]
Let
[TABLE]
be a given measurable function. For non-empty , define
[TABLE]
and
[TABLE]
We assume that
[TABLE]
Of course, for , for all . Then
[TABLE]
are well defined functions since
[TABLE]
We also assume that is an injective operator, i.e.,
[TABLE]
We define the following Banach spaces
[TABLE]
We assume also that
[TABLE]
Then the spaces are anchored at zero since for every we have
[TABLE]
As in the previous section, is the space of constant functions.
Finally, for , consider the Banach space
[TABLE]
with the norm given by
[TABLE]
Remark 2
For functions with infinitely many variables, is the completion of with respect to the norm (10). In general, it is a space of sequences since may not exist when has infinitely many non-zero ’s. Of course, it exists for . However, is a function space if
[TABLE]
since then
[TABLE]
shows that is well defined for every .
Here and elsewhere we use to denote the conjugate of , i.e., .
We end this section with the following examples.
Example 1
As in Section 3.1, , and . Then the assumptions (7)–(9) are satisfied and
[TABLE]
Moreover, for product weights and , (11) holds iff (or if ) since
[TABLE]
Example 2
Let , for , and for given . Recall that . For , the space is a sequence space. Hence we consider here only finite .
For , . For or , the maximum above is attained at . Otherwise, it is attained at . Hence
[TABLE]
For , and . Hence
[TABLE]
If , then
[TABLE]
If , then
[TABLE]
and
[TABLE]
Hence, for ,
[TABLE]
For this example, . Our result also holds for functions of the form with the norm changed to .
For and , one can get exact values
[TABLE]
Example 3
Consider and
[TABLE]
for a smooth function with and for all . Then the functions
[TABLE]
with have all derivatives continuous given by
[TABLE]
provided that
[TABLE]
and , e.g., for or .
Indeed, consider first . Then
[TABLE]
The last equality holds due to the dominated convergence theorem because
[TABLE]
[TABLE]
and is integrable, since by Hölder’s inequality and (12)
[TABLE]
The proof for an arbitrary is by induction. Since the inductive step is very similar to te basic one for , we omit it.
Assume additionally that for all and that there exists such that
[TABLE]
Then (8) holds. Indeed, consider such that
[TABLE]
Then
[TABLE]
i.e., is orthogonal to all polynomials for , i.e., is constant. However then, due to (13), .
For some special functions , (8) holds under weaker conditions like e.g.
[TABLE]
We illustrate this for and . It is enough to consider in (8), i.e. to show that the operator given by
[TABLE]
satisfies almost everywhere whenever and .
Indeed, using Hölder’s inequality and (14), we get that . Hence it is enough to show that for some implies in .
For , i.e.
[TABLE]
this follows from the properties of the Laplace transform . Indeed, observe that with , we have
[TABLE]
Hence is a constant, which is only possible if this constant is . But then , and almost everywhere follows from the injectivity property of the Laplace transform.
For , i.e.
[TABLE]
we can argue similarly with the Fourier transform instead of the Laplace transform by extending to an even function on .
3.3 The Function Approximation Problem
We follow [14]. Let be a probability density on and let . For non-empty , let be the space of functions with finite semi-norm
[TABLE]
For , the corresponding space is , the space of constant functions.
Consider next the embedding operators
[TABLE]
For them to be well defined, we assume that
[TABLE]
Then for any we have
[TABLE]
This means that (6) holds with
[TABLE]
Of course, depends also on .
Let be a space containing and endowed with a semi-norm such that for every and
[TABLE]
Finally, let be the embedding operator
[TABLE]
Of course, it depends on all the parameters, , and the weights . We assume that these parameters satisfy the following condition
[TABLE]
since then
[TABLE]
Note that for product weights the embedding operator is of tensor product form.
We illustrate the assumptions above for the examples from the previous section.
Example 4
We continue Example 1 here. Consider . This case was studied in [7]. We have
[TABLE]
Example 5
We return to Example 2 and assume that for some . In what follows and some other places we use the well known fact that
[TABLE]
We begin with the case of . It is easy to see that
[TABLE]
for . For , if or . Otherwise, for ,
[TABLE]
We now consider the case of . For and any we have
[TABLE]
Therefore, for the rest of this example, we consider .
If , then
[TABLE]
Consider next . Since
[TABLE]
we conclude that
[TABLE]
If , then is bounded from above by
[TABLE]
and
[TABLE]
Let the assumptions from the previous section be satisfied.
Remark 3
In this setting the -truncation dimension from Definition 1 is the smallest natural number such that
[TABLE]
We obtain the following corollary of Proposition 1 and Theorem 2.
Corollary 4
We have
[TABLE]
which reduces to for .
For product weights, is bounded from above by
[TABLE]
For let
[TABLE]
be the subspace of consisting of -variate functions , and let be an algorithm for approximating functions from that uses function values. The worst case error of with respect to the space is
[TABLE]
Now let
[TABLE]
be an algorithm for approximating functions from the whole space . The worst case error of is defined as
[TABLE]
This yields the following corollary of Theorem 3.
Corollary 5
For given and we have
[TABLE]
which reduces to for .
3.4 The Integration Problem
In this subsection we assume that (11) is satisfied. We consider the problem of numerically approximating the integral
[TABLE]
where , where is a probability density function on , and for .
We require in this section that , defined by
[TABLE]
is such that .
Let now . For non-empty , let be such that (as outlined in Section 3.2). We then have
[TABLE]
Since Hölder’s inequality is sharp we conclude that
[TABLE]
where is the restriction of to . This means that (6) hold with equality for
[TABLE]
Example 6
Let us once more return to Example 2 with . Then the -norm of is given by
[TABLE]
The inner integral, after the change of variables , is equal to
[TABLE]
and, therefore,
[TABLE]
with the convention that for .
Let the assumptions from the previous section be satisfied.
Remark 4
In this setting the -truncation dimension from Definition 1 is the smallest natural number such that
[TABLE]
We obtain the following corollary of Proposition 1 and Theorem 2.
Corollary 6
We have
[TABLE]
which reduces to for .
For product weights is bounded from above by the smallest for which
[TABLE]
For let be an algorithm for integrating functions from that uses function values. The worst case error of with respect to the space is
[TABLE]
Now let
[TABLE]
be an algorithm for integrating functions from the whole space . The worst case error of is defined as
[TABLE]
This yields the following corollary of Theorem 3.
Corollary 7
For given and we have
[TABLE]
which reduces to for .
4 Unanchored Spaces of Multivariate Functions
Let , , and be as in the previous section. Also here we assume that . In what follows we use to denote the -weighted integral operator for univariate functions,
[TABLE]
Of course .
Consider
[TABLE]
and
[TABLE]
and the corresponding space of functions
[TABLE]
such that
[TABLE]
Instead of being anchored, the functions satisfy the following property
[TABLE]
As in [3], one can show that the spaces and as sets of functions are equal if and only if
[TABLE]
From now on, we assume that (18) is satisfied. Of course (18) always holds true for product weights.
Let be the embedding
[TABLE]
and let be its inverse. As in [6], see also [2], one can check that
[TABLE]
Moreover, following the approach in [2], one can provide exact formulas for the norms of the embeddings for and next, using interpolation theory (as in [4], see also [2]), derive upper bounds for arbitrary values of and .
More precisely, we have the following proposition.
Proposition 8
Suppose that for . Then
[TABLE]
To give a flavor of the proof, we prove the proposition for .
Proof.
For we have
[TABLE]
Therefore
[TABLE]
where , which implies that with
[TABLE]
Clearly
[TABLE]
and using we get
[TABLE]
This proves the bound on . Since the Hölder inequality is sharp, we actually have equality. The proof for is identical. ∎
For product weights the expressions in the proposition above reduce to
[TABLE]
and to
[TABLE]
Applying interpolation theory we get, as in [2]:
Corollary 9
Suppose that for any . If then
[TABLE]
and if then
[TABLE]
For product weights we have
[TABLE]
It was shown in [4] for product weights and in [6] for a number of different types of weights that the upper bounds in Corollary 9 are sharp.
Suppose now that . Then the norms of the embeddings are uniformly bounded,
[TABLE]
for any including . Hence the results of previous sections are applicable for unanchored spaces considered in this section.
Remark 5
It is possible to consider even more general unanchored spaces. Indeed, consider a linear functional that is continuous for the space of univariate functions, i.e., with
[TABLE]
Suppose also that
[TABLE]
For nonempty , define
[TABLE]
Then the corresponding functions satisfy
[TABLE]
Here denotes the functional acting on functions with respect to the variable. More formally,
[TABLE]
where is an identity operator. For instance for ,
[TABLE]
Let be the Banach space of functions with the norm
[TABLE]
It is easy to extend all the results of this section provided that is finite for all . In particular, Proposition 8 and Corollary 9 hold with replaced by .
Acknowledgment.
The authors would like to thank two anonymous referees for their suggestions for improving the paper.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. E. Caflisch, W. Morokoff, and A. B. Owen: Valuation of mortgage backed securities using Brownian bridges to reduce the effective dimension. Journal of Computational Finance 1: 27–46, 1997.
- 2[2] M. Gnewuch, M. Hefter, A. Hinrichs, K. Ritter, and G. W. Wasilkowski: Equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in L p subscript 𝐿 𝑝 L_{p} ; J. Complexity 40: 78–99, 2017.
- 3[3] M. Hefter, K. Ritter, and G. W. Wasilkowski: On equivalence of weighted anchored and ANOVA spaces of functions with mixed smoothness of order one in L 1 subscript 𝐿 1 L_{1} and L ∞ subscript 𝐿 L_{\infty} norms. J. Complexity 32: 1–19, 2016.
- 4[4] A. Hinrichs and J. Schneider: Equivalence of anchored and ANOVA spaces via interpolation. J. Complexity 33: 190–198, 2016.
- 5[5] P. Kritzer, F. Pillichshammer, and G. W. Wasilkowski: Very low truncation dimension for high dimensional integration under modest error demand. J. Complexity 35: 63–85, 2016.
- 6[6] P. Kritzer, F. Pillichshammer, and G. W. Wasilkowski: A note on equivalence of anchored and ANOVA spaces: lower bounds. J. Complexity 38: 31–38, 2017.
- 7[7] P. Kritzer, F. Pillichshammer, and G. W. Wasilkowski: Truncation dimension for function approximation. To appear in: Festschrift for the 80th Birthday of Ian Sloan (J. Dick, F.Y. Kuo, H. Woźniakowski, eds.), Springer, 2017.
- 8[8] F. Y. Kuo, I. H. Sloan, G. W. Wasilkowski, and B. J. Waterhouse: Randomly shifted lattice rules with the optimal rate of convergence for unbounded integrands. J. Complexity 26: 135–160, 2010.
