REVIEW 3 cited by
Deep ReLU network approximation of functions on a manifold
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Whereas recovery of the manifold from data is a well-studied topic, approximation rates for functions defined on manifolds are less known. In this work, we study a regression problem with inputs on a $d^*$-dimensional manifold that is embedded into a space with potentially much larger ambient dimension. It is shown that sparsely connected deep ReLU networks can approximate a H\"older function with smoothness index $\beta$ up to error $\epsilon$ using of the order of $\epsilon^{-d^*/\beta}\log(1/\epsilon)$ many non-zero network parameters. As an application, we derive statistical convergence rates for the estimator minimizing the empirical risk over all possible choices of bounded network parameters.
Forward citations
Cited by 3 Pith papers
-
Geometry of Neural Reinforcement Learning in Continuous State and Action Spaces
For wide two-layer linearized neural policies in deterministic continuous RL, the locally attainable states concentrate on a manifold of dimension at most 2da+1, independent of the state dimension.
-
Phase Transition in Nonparametric Minimax Rates for Covariate Shifts on Approximate Manifolds
Under covariate shift with target data near a smooth d-dimensional manifold in D dimensions, the minimax regression rate switches between a manifold-dominated and a noise-dominated regime at a threshold set by source ...
-
Weak Physics Informed Neural Networks for Geometry Compatible Hyperbolic Conservation Laws on Manifolds
Proves an n^{-1/(d+2)}-type convergence rate for weak PINNs approximating entropy solutions of geometry-compatible conservation laws on d-dimensional manifolds, with network complexity independent of the ambient dimension.
Discussion (0). Sign in to comment.