paper-with-me

홈 › Papers

Uniform Approximation with Quadratic Neural Networks

2022-01-11 · Ahmed Abdeljawad

In this work, we examine the approximation capabilities of deep neural networks utilizing the Rectified Quadratic Unit (ReQU) activation function, defined as \(\max(0,x)^2\), for approximating H\"older-regular functions with respect to the uniform norm. We constructively prove that deep neural networks with ReQU activation can approximate any function within the \(R\)-ball of \(r\)-H\"older-regular functions (\(\mathcal{H}^{r, R}([-1,1]^d)\)) up to any accuracy \(\epsilon \) with at most \(\mathcal{O}\left(\epsilon^{-d /2r}\right)\) neurons and fixed number of layers. This result highlights that the effectiveness of the approximation depends significantly on the smoothness of the target function and the characteristics of the ReQU activation function. Our proof is based on approximating local Taylor expansions with deep ReQU neural networks, demonstrating their ability to capture the behavior of H\"older-regular functions effectively. Furthermore, the results can be straightforwardly generalized to any Rectified Power Unit (RePU) activation function of the form \(\max(0,x)^p\) for \(p \geq 2\), indicating the broader applicability of our findings within this family of activations.

📄 PDF Abstract BibTeX arXiv:2201.03747

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Uniform Confidence Band for Marginal Treatment Effect Function

2025-01-29 · Toshiki Tsuda, Yanchun Jin, Ryo Okui

This paper presents a method for constructing uniform confidence bands for the marginal treatment effect function. Our approach visualizes statistical uncertainty, facilitating inferences about the function's shape. We d…

Universal approximation with signatures of non-geometric rough paths

2026-02-05 · Mihriban Ceylan, Anna P. Kwossek, David J. Prömel arxiv

We establish a universal approximation theorem for signatures of rough paths that are not necessarily weakly geometric. By extending the path with time and its rough path bracket terms, we prove that linear functionals o…

Beyond the Quadratic Approximation: the Multiscale Structure of Neural Network Loss Landscapes

2022-04-24 · Chao Ma, Daniel Kunin, Lei Wu, Lexing Ying

A quadratic approximation of neural network loss landscapes has been extensively used to study the optimization process of these networks. Though, it usually holds in a very small neighborhood of the minimum, it cannot e…

On receding-horizon approximation in time-varying optimal control

2023-05-10 · Jintao Sun, Michael Cantoni

The closed-loop stability and infinite-horizon performance of receding-horizon approximations are studied for non-stationary linear-quadratic regulator (LQR) problems. The approach is based on a lifted reformulation of t…

Efficient Sampling for Learning Sparse Additive Models in High Dimensions

2014-12-01 · NeurIPS 2014 12 · Hemant Tyagi, Bernd Gärtner, Andreas Krause

We consider the problem of learning sparse additive models, i.e., functions of the form: $f(\vecx) = \sum_{l \in S} \phi_{l}(x_l)$, $\vecx \in \matR^d$ from point queries of $f$. Here $S$ is an unknown subset of coordina…

Additive modelsCompressive SensingVocal Bursts Intensity Prediction