{"id":{"repo_id":"houston","oai_identifier":"oai:uh-ir.tdl.org:10657/19915"},"canonical_url":"https://search.dev.ndltd.org/etd/houston/oai:uh-ir.tdl.org:10657/19915","repository":{"repo_id":"houston","name":"University of Houston","base_url":"https://uh-ir.tdl.org/server/oai/request"},"display":{"title":"Optimal Approximation of High-dimensional Functions on Smooth Manifolds Using Deep ReLU Neural Networks","abstract":"The expressive power of deep neural networks is manifested by their remarkable ability to approximate multivariate functions in a way that appears to overcome the curse of dimensionality. This ability is exemplified by their success in solving high-dimensional problems where traditional numerical solvers fail due to their limitations in accurately representing high-dimensional structures. In this dissertation, we focus on the approximation theory of neural networks to explain this phenomenon. First, we construct a version of the Johnson-Lindenstrass Lemma on the smooth manifold to analyze the approximation of $\\beta$-smooth H\\&quot;older functions defined on a $d$-dimensional smooth manifold $\\mathcal{M}$ embedded in $\\mathbb{R}^D$, with $d \\ll D$, using deep neural networks. We prove that the uniform convergence estimates of the approximation and generalization errors by deep neural networks with ReLU activation functions do not depend on the ambient dimension $D$ of the function but only on its lower manifold dimension $d$, in a precise sense. Our result improves existing results from the literature where approximation and generalization errors were shown to depend weakly on $D$. Since the aforementioned method is not constructive and does not provide explicit knowledge on the structure of the deep neural networks involved, we next introduce a constructive approach to achieve a similar approximation error. For this analysis, we consider the approximation of $s$ times continuously differentiable functions defined on a $d$-dimensional smooth manifold $\\mathcal{M}$ embedded in $\\mathbb{R}^D$, with $d \\ll D$. We prove that a deep ReLU neural network with fixed width depending polynomially on $D$ and depth $L_0$ can approximate an $s$ times continuously differentiable function with approximation rate $C(s,d) L_0^{-2s/d}$ which is completely independent of the ambient dimension $D$. This result improves previous approximation estimates where the constant of the approximation rate depends on $D$. This dissertation also derives the theoretical optimal approximation rate of deep ReLU neural networks for $\\beta$-smooth Hölder functions with $\\beta \\in (0,1]$ and for $s$ times continuously differentiable functions with $s\\in\\mathbb N$ defined on $[0,1]^D$.","abstract_html":"The expressive power of deep neural networks is manifested by their remarkable ability to approximate multivariate functions in a way that appears to overcome the curse of dimensionality. This ability is exemplified by their success in solving high-dimensional problems where traditional numerical solvers fail due to their limitations in accurately representing high-dimensional structures. In this dissertation, we focus on the approximation theory of neural networks to explain this phenomenon. First, we construct a version of the Johnson-Lindenstrass Lemma on the smooth manifold to analyze the approximation of <span class=\"etd-inline-math\">&beta;</span>-smooth H\\&amp;quot;older functions defined on a $d$-dimensional smooth manifold $\\mathcal{M}$ embedded in <span class=\"etd-inline-math\">\\mathbb{R}<sup>D</sup></span>, with $d \\ll D$, using deep neural networks. We prove that the uniform convergence estimates of the approximation and generalization errors by deep neural networks with ReLU activation functions do not depend on the ambient dimension $D$ of the function but only on its lower manifold dimension $d$, in a precise sense. Our result improves existing results from the literature where approximation and generalization errors were shown to depend weakly on $D$. Since the aforementioned method is not constructive and does not provide explicit knowledge on the structure of the deep neural networks involved, we next introduce a constructive approach to achieve a similar approximation error. For this analysis, we consider the approximation of $s$ times continuously differentiable functions defined on a $d$-dimensional smooth manifold $\\mathcal{M}$ embedded in <span class=\"etd-inline-math\">\\mathbb{R}<sup>D</sup></span>, with $d \\ll D$. We prove that a deep ReLU neural network with fixed width depending polynomially on $D$ and depth <span class=\"etd-inline-math\">L<sub>0</sub></span> can approximate an $s$ times continuously differentiable function with approximation rate <span class=\"etd-inline-math\">C(s,d) L<sub>0</sub><sup>-2s/d</sup></span> which is completely independent of the ambient dimension $D$. This result improves previous approximation estimates where the constant of the approximation rate depends on $D$. This dissertation also derives the theoretical optimal approximation rate of deep ReLU neural networks for <span class=\"etd-inline-math\">&beta;</span>-smooth Hölder functions with <span class=\"etd-inline-math\">&beta; \\in (0,1]</span> and for $s$ times continuously differentiable functions with $s\\in\\mathbb N$ defined on <span class=\"etd-inline-math\">[0,1]<sup>D</sup></span>.","abstract_has_math":true,"creators":["Shi, Ji"],"institution":"University of Houston","degree_name":"Doctor of Philosophy","degree_level":null,"degree_discipline":"Mathematics","degree_department":null,"school":null,"contributors":[],"advisors":["Labate, Demetrio"],"committee_chairs":[],"committee_members":["Kakadiaris, Ioannis","Azencott, Robert","Mang, Andreas"],"year":2024,"date_issued":"2024-08","date_published":"2024-08","updated_at":"2026-07-24T02:32:12Z","subjects":["Mathematics"],"languages":["en"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10657/19915","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Labate, Demetrio"]},{"key":"dc:contributor.committeemember","label":"Committee Member","values":["Kakadiaris, Ioannis","Azencott, Robert","Mang, Andreas"]},{"key":"dc:creator","label":"Author","values":["Shi, Ji"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2025-07-28T19:52:50Z"]},{"key":"dc:date.issued","label":"Date","values":["2024-08"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Mathematics"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Doctor of Philosophy"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Houston"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Mathematics"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10657/19915"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The expressive power of deep neural networks is manifested by their remarkable ability to approximate multivariate functions in a way that appears to overcome the curse of dimensionality. This ability is exemplified by their success in solving high-dimensional problems where traditional numerical solvers fail due to their limitations in accurately representing high-dimensional structures. In this dissertation, we focus on the approximation theory of neural networks to explain this phenomenon. First, we construct a version of the Johnson-Lindenstrass Lemma on the smooth manifold to analyze the approximation of $\\beta$-smooth H\\&quot;older functions defined on a $d$-dimensional smooth manifold $\\mathcal{M}$ embedded in $\\mathbb{R}^D$, with $d \\ll D$, using deep neural networks. We prove that the uniform convergence estimates of the approximation and generalization errors by deep neural networks with ReLU activation functions do not depend on the ambient dimension $D$ of the function but only on its lower manifold dimension $d$, in a precise sense. Our result improves existing results from the literature where approximation and generalization errors were shown to depend weakly on $D$. Since the aforementioned method is not constructive and does not provide explicit knowledge on the structure of the deep neural networks involved, we next introduce a constructive approach to achieve a similar approximation error. For this analysis, we consider the approximation of $s$ times continuously differentiable functions defined on a $d$-dimensional smooth manifold $\\mathcal{M}$ embedded in $\\mathbb{R}^D$, with $d \\ll D$. We prove that a deep ReLU neural network with fixed width depending polynomially on $D$ and depth $L_0$ can approximate an $s$ times continuously differentiable function with approximation rate $C(s,d) L_0^{-2s/d}$ which is completely independent of the ambient dimension $D$. This result improves previous approximation estimates where the constant of the approximation rate depends on $D$. This dissertation also derives the theoretical optimal approximation rate of deep ReLU neural networks for $\\beta$-smooth Hölder functions with $\\beta \\in (0,1]$ and for $s$ times continuously differentiable functions with $s\\in\\mathbb N$ defined on $[0,1]^D$."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Optimal Approximation of High-dimensional Functions on Smooth Manifolds Using Deep ReLU Neural Networks"]}]}],"canonical_facts":{"dc:contributor.advisor":["Labate, Demetrio"],"dc:contributor.committeemember":["Kakadiaris, Ioannis","Azencott, Robert","Mang, Andreas"],"dc:creator":["Shi, Ji"],"dc:date.accessioned":["2025-07-28T19:52:50Z"],"dc:date.issued":["2024-08"],"dc:description.abstract":["The expressive power of deep neural networks is manifested by their remarkable ability to approximate multivariate functions in a way that appears to overcome the curse of dimensionality. This ability is exemplified by their success in solving high-dimensional problems where traditional numerical solvers fail due to their limitations in accurately representing high-dimensional structures. In this dissertation, we focus on the approximation theory of neural networks to explain this phenomenon. First, we construct a version of the Johnson-Lindenstrass Lemma on the smooth manifold to analyze the approximation of $\\beta$-smooth H\\&quot;older functions defined on a $d$-dimensional smooth manifold $\\mathcal{M}$ embedded in $\\mathbb{R}^D$, with $d \\ll D$, using deep neural networks. We prove that the uniform convergence estimates of the approximation and generalization errors by deep neural networks with ReLU activation functions do not depend on the ambient dimension $D$ of the function but only on its lower manifold dimension $d$, in a precise sense. Our result improves existing results from the literature where approximation and generalization errors were shown to depend weakly on $D$. Since the aforementioned method is not constructive and does not provide explicit knowledge on the structure of the deep neural networks involved, we next introduce a constructive approach to achieve a similar approximation error. For this analysis, we consider the approximation of $s$ times continuously differentiable functions defined on a $d$-dimensional smooth manifold $\\mathcal{M}$ embedded in $\\mathbb{R}^D$, with $d \\ll D$. We prove that a deep ReLU neural network with fixed width depending polynomially on $D$ and depth $L_0$ can approximate an $s$ times continuously differentiable function with approximation rate $C(s,d) L_0^{-2s/d}$ which is completely independent of the ambient dimension $D$. This result improves previous approximation estimates where the constant of the approximation rate depends on $D$. This dissertation also derives the theoretical optimal approximation rate of deep ReLU neural networks for $\\beta$-smooth Hölder functions with $\\beta \\in (0,1]$ and for $s$ times continuously differentiable functions with $s\\in\\mathbb N$ defined on $[0,1]^D$."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["https://hdl.handle.net/10657/19915"],"dc:language.iso":["en"],"dc:subject":["Mathematics"],"dc:title":["Optimal Approximation of High-dimensional Functions on Smooth Manifolds Using Deep ReLU Neural Networks"],"dc:type":["Thesis"],"thesis:degree_discipline":["Mathematics"],"thesis:degree_name":["Doctor of Philosophy"],"thesis:institution_name":["University of Houston"]},"updated_at":"2026-07-24T02:32:12Z"}