Approximation

Follow this topic Ask about this topic

Recent momentum

+0%

17 papers in the last 28 days · 0.3% of indexed attention

Twelve weeks of publication activity for this topic as it is defined today.

Weekly history

Recent digests

What was published in this topic, kept on the site without email delivery.

Period ending 2026-09-21

4 new papers

A weekly snapshot of new work published in Approximation.

144 papers

Latest in Approximation

Open your feed →

Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks
Sep 17, 2026Xianjun Li, Yunfei YangLogarithmic Sobolev Inequalities Rectified Linear Unit Networks
Randomized SVD Approximations for Spectral Co-Clustering of Word-Document Matrices
Sep 16, 2026Fateme Mazdarani, Carlos ToxtliSingular Value Decomposition Image Clustering
A Weighted Kernel Method for Approximation that Adapts to Learned Multivariable Structure
Sep 15, 2026John E. Darges, Laura WeidensagerKernel Method Approximation
SIMS: Scale-Invariant Merit-Function-Based Scalarization for Multi-Task Learning
Sep 14, 2026Zebin Chen, Fei Xing, Yang Chen +4Multi--Task Learning Multi-Objective Optimization
Stochastic Gradient Descent over P2
Sep 11, 2026Maria Oprea, Qin Li, Yunan YangStochastic Gradient Descent Stochastic Differential Equations
Dynamical Non-compensatory Multidimensional IRT Model Using Variational Approximation
Sep 9, 2026Hiroshi Tamano, Daichi MochihashiItem Response Theory Dynamics Models
A Sharp Barrier for Consistent Submodular Maximization: Any Improvement over $2-\sqrt{2}$ Entails Exponential Queries or Linear RecourseA Sharp Barrier for Consistent Submodular Maximization: Any Improvement over 2-\sqrt{2} Entails Exponential Queries or Linear Recourse
Sep 9, 2026Shi Fu, Qixin Zhang, Dacheng TaoSubmodular Maximization Worst-Case
Sharp Structure-Agnostic Minimax Risk for Partial Linear Models
Sep 7, 2026Haichen Hu, David Simchi-LeviEmpirical Risk Minimization Minimax
A Sub-4 Approximation for Fair $k$ -MeansA Sub-4 Approximation for Fair k-Means
Sep 7, 2026Kangke Cheng, Guanlin Mo, Shihong Song +1K-Means Approximation Algorithms
Mind the Approximation: Fisher-Weighted SVD Compression for ViTs
Sep 7, 2026Moritz Thoma, Maximilian Groezinger, Maximilian Forstenhäusler +7Vision Transformer Large Language Model Compression
Towards a Statistical Understanding of Mixture-of-Experts
Sep 3, 2026Siyuan He, Bokai Yang, Jie Hu +2Mixture-of-Experts Models Adaptive Routing
Sierpiński--Knopp Wasserstein Distance for Persistence Diagrams and Applications to 2-Wasserstein Approximation
Sep 1, 2026Sebastien Tchitchek, Julien TiernyWasserstein Distance Persistent Homology
iPINN for Broadband CARS Phase Retrieval: A Framework for Function Approximation and Inverse Modeling Problems in Nonlinear Spectroscopy
Sep 1, 2026Ravi Teja Vulchi, Carl Messerschmidt, Mohammadsadegh Vafaeinezhad +4Conventional Physics-Informed Neural Networks Ill-Posed Inverse Problem
Why Multi-Layer Message Passing Works: Completeness Theory for Graph Neural Network Interatomic Potentials
Sep 1, 2026Pingbing Ming, Han WangInteratomic Potentials Message Passing Neural Networks
Sharp Approximation Rates for Neural Networks with Affine Latent Parameterizations
Aug 31, 2026Shijun ZhangNeural-Network Approximation Approximation
Learning Representations through Token Prediction: Geometry, Approximation, and Downstream Guarantees
Aug 30, 2026Shulei WangNext-Token Prediction Representation Learning
From Relaxed Indexability to Exact Indexability: A $t$ -Step Approach for Partially Observable Restless BanditsFrom Relaxed Indexability to Exact Indexability: A t-Step Approach for Partially Observable Restless Bandits
Aug 25, 2026Qizhen Jia, Keqin LiuLinear Bandits Optimal Policies
Sparse Orthogonal Regression Technique: A Spectral Framework for Equation Discovery, Approximation, and Integration
Aug 13, 2026Sabin Roman, Ljupco Todorovski, Saso DzeroskiSystem Identification Symbolic Regression
Kernel Methods for Learning Operators with Multiple Inputs and Outputs
Aug 12, 2026Adrien Weihs, Chunyang Liao, Jingmin Sun +1Probabilistic Operator Learning Kernel Method
Is Per-Agent Policy Composition Safe? Rethinking Successor-Feature Transfer in Cooperative Multi-Agent Reinforcement Learning
Aug 12, 2026Zijian Zhao, Sen LiMulti-Agent Reinforcement Learning Successor Representations
Decision-Aware Approximation of Belief Functions for Evidential Combinatorial Optimization
Aug 11, 2026Sohaib AfifiCombinatorial Optimization Approximation
A Single Atom in Front of a Mirror is a Universal Reservoir Computer
Aug 11, 2026Peter J. Ehlers, Phi Hung Nguyen, Kanu Sinha +4Reservoir Computing Reservoir
Training-Free Universal Approximation by Prompting Random Transformers
Aug 10, 2026Alexander Hsu, Rongjie LaiSoftmax Attention Approximation
Walk-on-Spheres Monte Carlo and deep neural network approximations of elliptic PDEs with drift and killing
Aug 10, 2026Konrad Kleinberg, Thomas KruseNeural-Network Approximation Stochastic Differential Equations
Approximation Rates for Metaplectic Neural Networks
Aug 9, 2026Ahmed Abdeljawad, Marcello Carioni, Elena CorderoNeural-Network Approximation Quantum Neural Networks
Universal Function Approximation via Diffractive Optical Processors: Physical Limits, Error Bounds, and Learnability
Aug 5, 2026Md Sadman Sakib Rahman, Che-Yung Shen, Aydogan OzcanApproximation Fourier
Approximate Multi-Objective Search Under Rulebooks
Aug 5, 2026Omar Muhammetkulyyev, Oren Salzman, Tichakorn WongpiromsarnSearch Algorithms Multi-Objective Optimization
Random features for Grassmannian kernel approximation with bounded rank-one projections
Aug 4, 2026Rémi Delogne, Laurent JacquesKernel Method Approximation
PLAN: Parallel Liquid-Inspired Approximation Network for Efficient Representation Learning in Flexible Job Shop Scheduling
Aug 4, 2026Dhivya Dharshini Kannan, Wei Zhang, Jieyi Bi +5Neural-Network Approximation Deep Reinforcement Learning
A Simple Approximation to the Distribution of the Ridge Regression Estimator
Aug 3, 2026José Luis Montiel Olea, Ryan Strong, Amilcar Velez +2Kernel Ridge Regression Heteroskedasticity
PAC Approximation and DIRECT Optimization for Parametric Markov Models
Aug 3, 2026Zhiming Chi, Ying Liu, Andrea Turrini +2Markov Decision Processes Llm-Based Optimization Modeling
Do Neural Networks Really Beat the Curse of Dimensionality? A Bit-Complexity View
Aug 2, 2026Tong Mao, Jinchao XuNeural-Network Approximation Approximation
Universality and Approximation Rates of Graph Neural Networks with Random Features
Jul 29, 2026Lukas Gonon, Thilo Meyer-Brandis, Niklas WeberGraph Neural Networks Neural-Network Approximation
Structural Loss Metrics for Tensor Approximation via Matrix Low-Rank Approximation
Jul 27, 2026Hiroki HasegawaLow-Rank Factorization Reconstruction Error
ATLAS: Automated Approximation of Transformers for Efficient Homomorphic Inference in One Hour
Jul 26, 2026Jianhang Xie, Sicheng Tan, Vishnu Naresh Boddeti +1Homomorphic Encryption Transformer Architectures
From Score Approximation to Distribution Approximation in Score-Based Diffusion Models
Jul 24, 2026Lan V. TruongScore-Based Diffusion Model Neural-Network Approximation
Functional Equivalence and Geometric Diversity in Neural Network Approximations: An Empirical Characterization
Jul 21, 2026Anuragine S A, Prem JagadeesanNeural-Network Approximation Approximation
Chebyshev Manifold Adaptation
Jul 19, 2026Jiawen LiParameter-Efficient Adaptation Approximation
NeuralChaos: Optimal Adapted Approximation of Square Integrable Predictable Processes
Jul 15, 2026Anastasis Kratsios, Giulia Livieri, Philipp SchmockerNeural-Network Approximation Stochastic Systems
Optimal and Efficient Contextual Combinatorial Semi-bandits with General Function Approximation
Jul 15, 2026Hao Qin, Chicheng ZhangGeneralized Linear Bandit Combinations
Approximation of solutions of parameter-dependent problems by residual neural networks
Jul 15, 2026Ana CarpioNeural-Network Approximation Neural Network
Hierarchical $\mathcal{F}$ -Clustering: Approximation and Hardness of Clustering into Trees and Bounded Diameter GraphsHierarchical \mathcal{F}-Clustering: Approximation and Hardness of Clustering into Trees and Bounded Diameter Graphs
Jul 14, 2026Michał Szyfelbein, Dariusz DereniowskiImage Clustering Approximation Algorithms
Approximation of Analytic Functions by ReLU Neural Networks with Adjustable Depth and Width
Jul 12, 2026Yanming Lai, Defeng Sun, Yang WangRectified Linear Unit Networks Neural-Network Approximation
On Explicit Super-Expressive Approximation for Neural Networks
Jul 7, 2026Feng-Lei Fan, Ze-Yu Li, Chen-Yu Wang +1Neural-Network Approximation Approximation
Minimum Block Width for Universal Approximation by Residual Neural Networks with Inner Width One
Jul 6, 2026Qi Zhou, Xuan Zhou, Xiao-Song YangNeural-Network Approximation Residual Connections
Foundations of Equivariant Deep Learning: Unifying Graph and Sheaf Neural Networks
Jul 4, 2026Yoshihiro MaruyamaEquivariant Neural Networks Geometric Deep Learning
Privacy-Preserving and Verifiable Approximate Distributed Coded Computing
Jul 2, 2026Xavier Martínez-Luaña, Alba Gude-Santos, Manuel Fernández-Veiga +1Privacy-Preserving Framework Federated Learning
From Approximation to Emergence: A Theory of Deep Learning
Jul 1, 2026Zhilin ZhaoOver-Parameterized Neural Networks Deep Learning
Fast approximation and learning of binary classification tasks in o-minimal structures using ReLU neural networks
Jun 29, 2026Clemens Kinn, Philipp PetersenRectified Linear Unit Networks Binary Classification
Harvesting AI Computation at the Edge via Generic Approximation
Jun 28, 2026Yihan Wang, Huiru Yan, Luxin Zhang +6Heterogeneous Edge Devices Central Processing Units
Ribbon: Scalable Approximation and Robust Uncertainty Quantification
Jun 25, 2026Graham Gibson, John Tipton, Kellin Rumsey +1Reliable Uncertainty Quantification Bayesian
Algorithmic Foundations of Deep Learning: Complexity-Theoretic Rates and a Characterization of Universal Approximation
Jun 25, 2026Anastasis Kratsios, Simone Brugiapaglia, Bum Jun Kim +2Neural-Network Approximation Approximation
Sketched Linear Contrastive Learning: Approximation, Optimization, and Statistical Scaling
Jun 25, 2026Ziyan Chen, Zhongzhu Zhou, Ding-Xuan ZhouContrastive Learning Scaling Laws
Compiler-Driven Approximation Tuning for Hyperdimensional Computing
Jun 25, 2026Xavier Routh, Abdul Rafae Noor, Akash Kothari +4Code Optimization Approximation
An Analysis of Posterior Collapse, Parameterization and Initialization in Variational Deep Gaussian Processes
Jun 24, 2026Francisco Javier Sáez-Maldonado, Juan Maroñas, Daniel Hernández-LobatoVariational Inference Variational
Dynamic estimation of slowly varying sequences
Jun 22, 2026Prashant Gokhale, Mikhail Khodak, Sandeep SilwalEstimators Time-Varying Systems
EML Trees Are Universal Approximators
Jun 22, 2026Joe Germany, Elie Abdo, Joseph BakarjiNeural-Network Approximation Approximation
On the Expressive Power of Weight Quantization in Large Language Models
Jun 20, 2026Shao-Qun ZhangLarge Language Model Quantization Quantization
Recurrent neural networks approximate continuous functions
Jun 18, 2026Valentin Abadie, Clemens Hutter, Helmut BölcskeiNeural-Network Approximation Recurrent Neural Networks
Score Approximation for Diffusion Models on Arbitrary Low-Dimensional Structures
Jun 18, 2026Xinhe Mu, Zaijiu Shang, Zhaoqi Zhou +4Score-Based Diffusion Model Low-Dimensional Structure

Sep 17, 2026 · stat.MLJ/K move · Enter open · S save

Error bounds in Sobolev norms for approximations with norm constrained ReLU neural networks

Xianjun Li, Yunfei Yang

Recent studies have shown that smooth functions can be well approximated by ReLU neural networks with path norm constraint on the weights. We extend these results from uniform approximation to approximation in Sobolev norm. Specifically, we analyze how well Sobolev functions in

W^{n,p}

can be approximated by neural networks with width

W

, depth

L

and path norm bounded by

K

, when the approximation error is measured in the

W^{1,p}

-norm. For shallow networks with depth

L=1

, we derive the approximation error bound

\mathcal{O}(\max\{W^{-(n-1)/d}, K^{-(n-1)/(s-n)}\})

, when the smoothness index satisfies

n<s=(d+3)/2

and the input is

d

-dimensional. For deep networks, we remove the restriction on the smoothness by showing that the approximation bound

\mathcal{O}(K^{-(n-1)/(d+d/p+1)})

holds if the width

W

and depth

L

are sufficiently large.

Logarithmic Sobolev Inequalities Rectified Linear Unit Networks Neural-Network Approximation Approximation Generalization Bounds Neural Network

Open paper Ask about it PDF

Recent momentum

Neighbouring directions

Recent digests

4 new papers

Latest in Approximation