arXiv:2606. 15812v1 Announce Type: new Abstract: Constructing mathematically tractable function spaces that capture hierarchical compositional representations remains a central challenge in statistical learning theory.
arXiv:2410. 11116v4 Announce Type: replace-cross Abstract: In this paper, we establish a novel connection between the metric entropy growth and the embeddability of function spaces into reproducing kernel Hilbert/Banach spaces.
We develop a comprehensive theory for regularized M-estimation in reproducing kernel Hilbert spaces. Under mild conditions on the loss we establish existence and measurability of the estimator, covering a wide range of convex and non-convex losses, including bounded robust losses.
arXiv:2608. 15982v1 Announce Type: new Abstract: We develop operator-theoretic generalization bounds for deep multi-output function classes by representing network layers as Koopman composition operators on vector-valued reproducing kernel Hilbert spaces.
The paper presents a theoretical framework for approximating ratio-type functionals that arise in conditional generative modeling, specifically when the target density is expressed as a ratio of two kernel-based marginal densities. It proves that deep neural networks using the SignReLU activation can approximate these ratios with established L^p(Omega) bounds and convergence rates under standard regularity assumptions. Applying the framework to Denoising Diffusion Probabilistic Models, the authors construct a SignReLU-based estimator for the reverse process and derive bounds on the excess Kullback–Leibler risk, decomposing it into approximation and estimation errors to provide generalization guarantees for finite-sample training.
arXiv:2606. 14954v1 Announce Type: cross Abstract: We develop a general framework for analyzing representation costs of parametric data-fitting methods through their parameter-space regularizers.
We develop operator-theoretic generalization bounds for deep multi-output function classes by representing network layers as Koopman composition operators on vector-valued reproducing kernel Hilbert spaces. In vector-valued Sobolev RKHSs, we derive Rademacher complexity bounds for invertible and width-expanding injective architectures.
arXiv:2608. 13882v1 Announce Type: new Abstract: Claims about the benefit of depth depend on the complexity assigned to a representation.
arXiv:2607. 05546v1 Announce Type: cross Abstract: We develop a unified function space theory of deep fully connected neural networks.
The paper studies operator learning on function spaces using encoder–decoder architectures. It shows that as input and output resolutions grow, the induced kernels converge to a limiting kernel, enabling regularity assumptions independent of resolution. The authors derive upper and lower bounds for regularized stochastic gradient descent, extend the analysis to neural networks via the limiting neural tangent kernel, and provide error bounds and complexity guarantees for various kernel and encoding constructions.
arXiv:2606. 08218v1 Announce Type: cross Abstract: Compositional priors describe the generic properties of layered functions in deep Bayesian models, where deep neural networks with random weights are a canonical example.
arXiv:2608. 06155v1 Announce Type: cross Abstract: Conditional expectation operators (CEOs) and their associated conditional mean embeddings (CMEs) play a central role across applied mathematics and machine learning, appearing in nonparametric regression, Bayesian inverse problems, and Koopman operator theory.
arXiv:2609.38049v1 Announce Type: new Abstract: Generative models for function-valued data, such as time series and solutions of partial differential equations, must learn distributions over infinite...