Study approximates unknown function levels with queries.
problem Approximating unknown function levels through sequential queries.
method Introduce Bisect and Approximate algorithms to reduce to local function approximation.
result Rate-optimal sample complexity guarantees for H{ö}lder functions.
We approximate derivatives of functions on manifolds by embedding them and applying vector-valued operators.
problem Derivatives of manifold-valued functions are harder to approximate than vector-valued functions.
method Embed the manifold into a higher space, approximate the derivative of the vector-valued function, and project back.
result We provide error bounds for the approximation of manifold-valued function derivatives.
Sharp bounds for approximating Sobolev functions by ridge functions and networks.
problem Approximating Sobolev functions with multivariate ridge functions and networks.
method Proving sharp upper and lower bounds for approximation order.
result Order of approximation asymptotically behaves as n − r / ( d − ℓ ) n^{-r/(d-\ell)} n − r / ( d − ℓ ) . Improved neural network approximates analytic and L^p functions efficiently.
problem Efficiently approximating analytic and L^p functions using neural networks.
method Three-dimensional ReLU network architecture for sawtooth functions, improving approximation rates.
result Substantially improved exponential approximation rates for analytic functions and general L^p functions.
Study approximates nonlinear functionals using deep ReLU networks.
problem Approximating nonlinear continuous functionals with neural networks.
method Constructs continuous piecewise linear interpolation under simple triangulation, analyzes rates of approximation.
result Established rates of approximation for functional deep ReLU networks.
We developed safe and ranged approximations for ReLU, tanh, and sigmoid functions to reduce neural network training time.
problem Expensive computation of hyperbolic tangent and sigmoid functions in neural networks.
method Function approximation techniques to create safe and ranged approximations.
result 10% to 37% improvement in training times on CPU and 20% to 53% improvement in ranged cases.
Transformers struggle to approximate smooth functions, relying on piecewise constant approximations.
problem Understanding the expressivity of Transformers for function approximation.
method Theoretical analysis and experimental validation of Transformer's ability to approximate smooth functions.
result Transformers cannot reliably approximate smooth functions, relying on piecewise constant approximations.
Method uses DNNs to approximate functions with specific asymptotic behavior.
problem Approximating functions with given asymptotic behavior.
method Specifically constructed terms combined with unconstrained DNN.
result Enforcing asymptotic behavior leads to better approximation and faster convergence.
Smooth approximations for continuous functions on orbit spaces.
problem Approximating continuous functions on orbit spaces.
method Study of subcartesian spaces and proper Lie group actions.
result Continuous functions can be approximated by smooth functions.
In this paper, we propose a generic framework for devising an adaptive approximation scheme for value function approximation in reinforcement learning, which introduces multiscale approximation. The two basic ingredients are multiresolution analysis as well as tree approximation. Starting from simple refinable function…
Due to the intractable partition function, the exact likelihood function for a Markov random field (MRF), in many situations, can only be approximated. Major approximation approaches include pseudolikelihood and Laplace approximation. In this paper, we propose a novel way of approximating the likelihood function throug…
Paper develops efficient RL algorithm for general value function approximation.
problem Lack of theory for RL with general value function approximation.
method Provable efficient RL algorithm using bounded eluder dimension.
result Achieves a regret bound of O ~ ( p o l y ( d H ) T ) \widetilde{O}(\mathrm{poly}(dH)\sqrt{T}) O ( poly ( d H ) T ) . The paper shows neural networks can approximate functions over non-compact domains with non-polynomial activation.
problem Approximating functions over non-compact domains using neural networks.
method Using single-hidden-layer feedforward neural networks with non-polynomial activation functions over non-compact subsets of Euclidean spaces.
result Neural networks can approximate functions in weighted C k C^k C k -spaces and weighted Sobolev spaces over unbounded domains. Paper shows deep neural networks can approximate Korobov functions nearly optimally.
problem Approximating Korobov functions with deep neural networks.
method Used deep neural networks and measured approximation rates with L p L_p L p and H 1 H^1 H 1 norms. result Achieved a super-convergence rate, outperforming traditional methods.
New RBF networks can approximate any continuous function.
problem Approximating any continuous function on a compact subset.
method Replacing smoothing factors with shifts in RBF networks and proving approximation under certain conditions.
result RBF networks can approximate any continuous function on any compact subset.
Quantum neural networks approximate periodic functions more efficiently.
problem Approximating periodic functions with quantum neural networks.
method Using Jackson's inequality to construct a QNN that approximates a trigonometric polynomial of the function.
result Quantum neural networks can achieve better approximation results with fewer parameters for smoother functions.
Deep networks with path norm regularization can approximate analytic functions.
problem Approximating analytic functions with neural networks.
method Path norm regularized deep networks with activation function.
result Deep networks can approximate analytic functions with logarithmic dependence on approximation error.
Deep, wide ConvResNets can approximate functions and their smoothness.
problem Function approximation and smoothness in deep networks.
method Analyzing ConvResNets, proving their ability to approximate functions and their smoothness.
result Large ConvResNets can approximate functions and exhibit sufficient first-order smoothness.
Generalizes neural network approximation to infinite-dimensional manifolds and derivatives.
problem Approximating differentiable maps on infinite-dimensional manifolds.
method Proves a weighted Nachbin theorem to establish universal approximation for differentiable maps, including derivatives.
result Linear functions of the signature can approximate path space functionals including their derivatives.
This work improves sample efficiency in neural function approximation for reinforcement learning.
problem Improving sample efficiency in reinforcement learning with neural function approximation.
method Study of function approximation with two-layer neural networks (ReLU and polynomial activations) under generative and realizability models.
result Significant improvement in sample complexity compared to linear methods.
2D CNNs approximate Korobov functions with near-optimal rates.
problem Approximating Korobov functions using 2D CNNs.
method Constructive approach for 2D CNNs with ReLU activations and fully connected layers.
result 2D CNNs achieve near-optimal approximation rates for Korobov functions.
A new Kolmogorov-Arnold network improves function approximation and optimization.
problem Approximating potentially irregular functions in high dimensions.
method Proposes a new Kolmogorov-Arnold network (KAN) and provides error bounds and universal approximation theorems.
result Outperforms multilayer perceptrons in accuracy and convergence speed for irregular functions.
In this paper, we propose a low-rank approximation method based on discrete least-squares for the approximation of a multivariate function from random, noisy-free observations. Sparsity inducing regularization techniques are used within classical algorithms for low-rank approximation in order to exploit the possible sp…
Deep neural networks with piecewise-polynomial activations can approximate smooth functions and their derivatives.
problem Approximating smooth functions and their derivatives with neural networks.
method Derives the depth, width, and sparsity required for approximation in Hölder norms.
result Deep neural networks with bounded weights can approximate Hölder smooth functions and their derivatives.
Minimum width for ReLU networks to approximate L^p functions is max(d_x+1, d_y).
problem Characterizing the minimum width for ReLU networks to approximate L^p functions.
method Analyzing networks with ReLU activation functions and proving the minimum width required.
result The minimum width required for the universal approximation of L^p functions is exactly max(d_x+1, d_y).
We propose fast approximations for the generalized sliced-Wasserstein distance.
problem Efficient approximation of the generalized sliced-Wasserstein distance in high dimensions.
method Deterministic approximations using random projections and concentration of measure results.
result One-dimensional projections of high-dimensional random vectors are approximately Gaussian.
Universal approximation theorem for differentiable maps on infinite-dimensional manifolds
problem Approximation of differentiable maps on infinite-dimensional manifolds
method Weighted universal approximation theorem
result Universal approximation theorem for differentiable maps
There has been a growing interest in expressivity of deep neural networks. However, most of the existing work about this topic focuses only on the specific activation function such as ReLU or sigmoid. In this paper, we investigate the approximation ability of deep neural networks with a broad class of activation functi…
This work improves polynomial approximations for functions with asymmetric behavior.
problem Efficiently approximating functions with asymmetric behavior, especially those growing unbounded on one side.
method Introduces weighted deep polynomial approximants that combine learnable deep polynomials with one-sided weights.
result Weighted deep polynomial approximants outperform existing methods in approximating functions with asymmetric behavior.
Deep networks can learn functions approximated by shallow networks, but not all functions.
problem The learnability of functions by deep neural networks and the approximation capacity of simpler classes.
method Study the connection between learnability and approximation capacity of functions by deep neural networks and simpler classes.
result A necessary condition for a function to be learnable by deep neural networks is to be approximable by shallow networks.
Let U ⊆ R n U\subseteq\mathbb{R}^{n} U ⊆ R n be open and convex. We show that every (not necessarily Lipschitz or strongly) convex function f : U → R f:U\to\mathbb{R} f : U → R can be approximated by real analytic convex functions, uniformly on all of U U U . In doing so we provide a technique which transfers results on uniform approximation on bounded …
Efficient offline reinforcement learning with neural networks using differentiable function approximation.
problem Statistical efficiency of offline reinforcement learning with function approximators.
method Pessimistic fitted Q-learning (PFQL) and differentiable function approximation.
result Provably efficient offline reinforcement learning with differentiable function approximation.
This paper develops fundamental limits of deep neural network learning by characterizing what is possible if no constraints are imposed on the learning algorithm and on the amount of training data. Concretely, we consider Kolmogorov-optimal approximation through deep neural networks with the guiding theme being a relat…
Efficiently approximates neural network function space distance.
problem Estimating the average discrepancy between neural network outputs.
method Linearized Activation Function TRick (LAFTR) for ReLU networks.
result Parametric approximation outperforms nonparametric methods in memory and accuracy.
Deep neural networks can approximate rough functions with high accuracy.
problem Approximating rough functions with neural networks.
method Proved that ENO interpolation can be cast as a deep ReLU neural network, transferring ENO's high-order accuracy.
result Deep neural networks can achieve high-order accuracy in approximating Lipschitz functions.
New bounds on ReLU networks for low-regular functions.
problem Bounding approximation error for ReLU networks on low-regular functions.
method Complexity analysis of Fourier features residual networks to ReLU networks.
result Approximation error bound proportional to target function norm and inversely proportional to network width and depth.
Entropy-regularized NPG converges linearly with linear function approximation.
problem Analyzing convergence of entropy-regularized NPG with function approximation.
method Established finite-time convergence analyses with entropy regularization and linear function approximation.
result Entropy-regularized NPG achieves linear convergence up to a function approximation error.
Q Q Q -learning with function approximation is one of the most popular methods in reinforcement learning. Though the idea of using function approximation was proposed at least 60 years ago, even in the simplest setup, i.e, approximating Q Q Q -functions with linear functions, it is still an open problem on how to design a pr…
In much of the literature on function approximation by deep networks, the function is assumed to be defined on some known domain, such as a cube or a sphere. In practice, the data might not be dense on these domains, and therefore, the approximation theory results are observed to be too conservative. In manifold learni…
The paper projects unknown manifolds onto hyperspheres for efficient function approximation.
problem Function approximation from data on unknown manifolds with added errors.
method Projects unknown manifold onto hypersphere and uses localized spherical polynomial kernels.
result Optimal rates of approximation for rough functions are given.
TVS-FNNs can approximate any continuous function on expanded input spaces.
problem Processing a broader range of inputs like sequences and matrices.
method Proving a universal approximation theorem for TVS-FNNs.
result TVS-FNNs can approximate any continuous function on expanded input spaces.
We show that finite-width deep ReLU neural networks yield rate-distortion optimal approximation (Bölcskei et al., 2018) of polynomials, windowed sinusoidal functions, one-dimensional oscillatory textures, and the Weierstrass function, a fractal function which is continuous but nowhere differentiable. Together with thei…
Study on RNNs' ability to approximate past-dependent Hölder functions and their application to regression.
problem Understanding and optimizing the approximation capacity of RNNs for regression tasks.
method Derivation of upper bounds on RNN approximation error for Hölder smooth functions and application to regression.
result Achievement of minimax optimal prediction error bounds for RNNs under various data assumptions.
Theory for deep neural network approximation of score function and its derivatives.
problem Handling data distributions with low-dimensional structure and unbounded support.
method Simultaneous approximation of the score function and its derivatives using deep neural networks.
result Approximation error bounds match literature but relax bounded support requirement.
Functional input neural networks approximate continuous functions on weighted spaces.
problem Approximating continuous functions on infinite-dimensional weighted spaces.
method Additive family mapping, non-linear activation, linear readouts, Stone-Weierstrass theorem.
result Global universal approximation of continuous functions on weighted spaces.
Complex-valued neural networks can approximate any continuous function.
problem Generalizing the universal approximation theorem to complex-valued networks.
method Characterizing activation functions for complex networks to approximate any continuous function.
result Different activation functions are required for deep vs shallow complex networks to achieve universal approximation.
Efficiently plans large MDPs with weak function approximations.
problem Planning in large MDPs with limited function approximation capabilities.
method Uses linear value function approximation with weak requirements and a generative oracle.
result Produces almost-optimal actions for any state with polynomial computation time.
Framework for universal graph function approximators outperforms existing methods.
problem Graph classification and separation of graph classes.
method Inspired by persistent homology, dependency parsing, and multivalued functions, the framework constructs universal approximators on graph isomorphism classes.
result Achieves state-of-the-art performance on four graph datasets.