Table of Contents
Fetching ...

Blessing of Dimensionality for Approximating Sobolev Classes on Manifolds

Hong Ye Tan, Subhadip Mukherjee, Junqi Tang, Carola-Bibiane Schönlieb

TL;DR

This work proves ambient-dimension-free lower bounds for approximating bounded Sobolev function classes on compact Riemannian manifolds by finite-pseudo-dimension function classes. The main result shows ρ_n(W^{1,p}(1), L^q(M)) ≥ C(d,g,K,vol(M),p,q) (n + log n)^{-1/d}, with constants depending only on intrinsic geometric quantities such as curvature, volume, and injectivity radius, not on any ambient embedding. The authors develop a geometric packing-based construction and leverage Bishop–Gromov volume comparison and metric-entropy arguments to establish the lower bound, while situating it alongside existing upper-bound results for ReLU networks and Hölder approximations on manifolds. Practically, this implies a fundamental, ambient-dimension-free limit on generalization and approximation for manifold-supported data, guiding expectations for learning models operating under the manifold hypothesis.

Abstract

The manifold hypothesis says that natural high-dimensional data lie on or around a low-dimensional manifold. The recent success of statistical and learning-based methods in very high dimensions empirically supports this hypothesis, suggesting that typical worst-case analysis does not provide practical guarantees. A natural step for analysis is thus to assume the manifold hypothesis and derive bounds that are independent of any ambient dimensions that the data may be embedded in. Theoretical implications in this direction have recently been explored in terms of generalization of ReLU networks and convergence of Langevin methods. In this work, we consider optimal uniform approximations with functions of finite statistical complexity. While upper bounds on uniform approximation exist in the literature using ReLU neural networks, we consider the opposite: lower bounds to quantify the fundamental difficulty of approximation on manifolds. In particular, we demonstrate that the statistical complexity required to approximate a class of bounded Sobolev functions on a compact manifold is bounded from below, and moreover that this bound is dependent only on the intrinsic properties of the manifold, such as curvature, volume, and injectivity radius.

Blessing of Dimensionality for Approximating Sobolev Classes on Manifolds

TL;DR

This work proves ambient-dimension-free lower bounds for approximating bounded Sobolev function classes on compact Riemannian manifolds by finite-pseudo-dimension function classes. The main result shows ρ_n(W^{1,p}(1), L^q(M)) ≥ C(d,g,K,vol(M),p,q) (n + log n)^{-1/d}, with constants depending only on intrinsic geometric quantities such as curvature, volume, and injectivity radius, not on any ambient embedding. The authors develop a geometric packing-based construction and leverage Bishop–Gromov volume comparison and metric-entropy arguments to establish the lower bound, while situating it alongside existing upper-bound results for ReLU networks and Hölder approximations on manifolds. Practically, this implies a fundamental, ambient-dimension-free limit on generalization and approximation for manifold-supported data, guiding expectations for learning models operating under the manifold hypothesis.

Abstract

The manifold hypothesis says that natural high-dimensional data lie on or around a low-dimensional manifold. The recent success of statistical and learning-based methods in very high dimensions empirically supports this hypothesis, suggesting that typical worst-case analysis does not provide practical guarantees. A natural step for analysis is thus to assume the manifold hypothesis and derive bounds that are independent of any ambient dimensions that the data may be embedded in. Theoretical implications in this direction have recently been explored in terms of generalization of ReLU networks and convergence of Langevin methods. In this work, we consider optimal uniform approximations with functions of finite statistical complexity. While upper bounds on uniform approximation exist in the literature using ReLU neural networks, we consider the opposite: lower bounds to quantify the fundamental difficulty of approximation on manifolds. In particular, we demonstrate that the statistical complexity required to approximate a class of bounded Sobolev functions on a compact manifold is bounded from below, and moreover that this bound is dependent only on the intrinsic properties of the manifold, such as curvature, volume, and injectivity radius.
Paper Structure (17 sections, 15 theorems, 88 equations, 1 figure)

This paper contains 17 sections, 15 theorems, 88 equations, 1 figure.

Key Result

Proposition 2

If ${\mathcal{H}}'$ is an $\mathbb{R}$-vector space of real-valued functions, then $\dim_p({\mathcal{H}}') = \dim({\mathcal{H}}')$ as a vector space. In particular, if ${\mathcal{H}}$ is a subset of a vector space ${\mathcal{H}}'$ of real-valued functions, then $\dim_p({\mathcal{H}}) \le \dim({\math

Figures (1)

  • Figure 1: For the class of affine 1D functions $\{x \mapsto ax+b \mid a, b \in \mathbb{R}\}$, this choice of $\{x_1, x_2\} \subset \mathbb{R}$ and $s_1, s_2 \in \mathbb{R}$ on the left is P-shattered by the affine functions $f_{\pm \pm}$. However, there is no arrangement of three points that is P-shattered by affine functions, e.g. the arrangement on the right would not have a function that goes below the left and right points but above the middle point. Therefore, the pseudo-dimension of affine 1D functions is 2.

Theorems & Definitions (27)

  • Definition 1
  • Proposition 2: anthony1999neural
  • Proposition 3: anthony1999neural
  • Definition 4: Nonlinear $n$-width
  • Theorem 5: Bishop--Gromov
  • Corollary 6: block2020fastohta2014ricci
  • Definition 7: Packing number
  • Definition 8: hebey2000nonlinear
  • Definition 9
  • Theorem 10
  • ...and 17 more