paper-with-me

홈 › Papers

Neural Network Approximation of Refinable Functions

2021-07-28 · Ingrid Daubechies, Ronald DeVore, Nadav Dym, Shira Faigenbaum-Golovin, Shahar Z. Kovalsky, Kung-Ching Lin, Josiah Park, Guergana Petrova, Barak Sober

In the desire to quantify the success of neural networks in deep learning and other applications, there is a great interest in understanding which functions are efficiently approximated by the outputs of neural networks. By now, there exists a variety of results which show that a wide range of functions can be approximated with sometimes surprising accuracy by these outputs. For example, it is known that the set of functions that can be approximated with exponential accuracy (in terms of the number of parameters used) includes, on one hand, very smooth functions such as polynomials and analytic functions (see e.g. \cite{E,S,Y}) and, on the other hand, very rough functions such as the Weierstrass function (see e.g. \cite{EPGB,DDFHP}), which is nowhere differentiable. In this paper, we add to the latter class of rough functions by showing that it also includes refinable functions. Namely, we show that refinable functions are approximated by the outputs of deep ReLU networks with a fixed width and increasing depth with accuracy exponential in terms of their number of parameters. Our results apply to functions used in the standard construction of wavelets as well as to functions constructed via subdivision algorithms in Computer Aided Geometric Design.

📄 PDF Abstract BibTeX arXiv:2107.13191

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

On Convergence Rate of Adaptive Multiscale Value Function Approximation For Reinforcement Learning

2019-08-22 · Tao Li, Quanyan Zhu

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…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

PCSR: Pseudo-label Consistency-Guided Sample Refinement for Noisy Correspondence Learning

2025-09-19 · Zhuoyao Liu, Yang Liu, Wentao Feng, Shudong Huang arxiv

Cross-modal retrieval aims to align different modalities via semantic similarity. However, existing methods often assume that image-text pairs are perfectly aligned, overlooking Noisy Correspondences in real data. These …

Cross-Modal RetrievalSemantic Similarity

An End-to-End Deep Learning Generative Framework for Refinable Shape Matching and Generation

2024-03-10 · Soodeh Kalaie, Andy Bulpitt, Alejandro F. Frangi, Ali Gooya

Generative modelling for shapes is a prerequisite for In-Silico Clinical Trials (ISCTs), which aim to cost-effectively validate medical device interventions using synthetic anatomical shapes, often represented as 3D surf…

Agentic Control Center for Data Product Optimization

2026-03-10 · Priyadarshini Tamilselvan, Gregory Bramble, Sola Shirai, Ken C. L. Wong 외 arxiv

Data products enable end users to gain greater insights about their data by providing supporting assets, such as example question-SQL pairs which can be answered using the data or views over the database tables. However,…

Successive Refinement of Images with Deep Joint Source-Channel Coding

2019-03-15 · David Burth Kurka, Deniz Gunduz

We introduce deep learning based communication methods for successive refinement of images over wireless channels. We present three different strategies for progressive image transmission with deep JSCC, with different c…