Papers
Topics
Authors
Recent
Search
2000 character limit reached

Reproducing Kernel Banach Spaces

Updated 28 April 2026
  • Reproducing Kernel Banach Spaces are Banach spaces where evaluation at every point is continuous and represented via kernel-induced duality, generalizing RKHS.
  • They enable rigorous analysis of non-quadratic regularization and non-Euclidean metrics, broadening the theory and algorithms of kernel methods.
  • Canonical constructions like p-norm and Orlicz RKBS support finite kernel expansions and sparsity through representer theorems for efficient learning.

A reproducing kernel Banach space (RKBS) is a Banach space of functions in which point evaluations are continuous and can be represented via a kernel-induced dual pairing, generalizing the structure of reproducing kernel Hilbert spaces (RKHS) to non-Hilbertian geometries. The RKBS paradigm enables the rigorous analysis of non-quadratic regularization, non-Euclidean metrics, structured sparsity, and broadens the theoretical and algorithmic foundations of kernel methods and infinite-width neural networks.

1. Foundational Definition and Characterizations

Let XX be a non-empty set. A Banach space (B,B)(B,\|\cdot\|_B) of real- or complex-valued functions on XX is called a reproducing kernel Banach space if, for each xXx\in X, the point-evaluation operator evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x) is continuous, i.e., there exists Cx<C_x < \infty so that f(x)CxfB|f(x)| \leq C_x \|f\|_B for all fBf\in B (Shin et al., 2024, Lin et al., 2019, Bartolucci et al., 2021, Ikeda et al., 2022).

A fundamental characterization asserts that every RKBS admits a feature space representation: there exists a Banach space YY, a feature map ϕ:XY\phi:X \to Y^*, and a bounded linear operator

(B,B)(B,\|\cdot\|_B)0

with (B,B)(B,\|\cdot\|_B)1 and

(B,B)(B,\|\cdot\|_B)2

(Shin et al., 2024, Bartolucci et al., 2021, Lin et al., 2019). The reproducing (“kernel”) property is then

(B,B)(B,\|\cdot\|_B)3

for any (B,B)(B,\|\cdot\|_B)4 with (B,B)(B,\|\cdot\|_B)5. This generalizes the classical Aronszajn–Moore RKHS construction to the Banach setting by replacing inner product geometry with Banach-space duality and quotient-norm structures.

2. Kernel and Duality Structure

In a generic RKBS setting, a kernel arises as a function (B,B)(B,\|\cdot\|_B)6 such that for a dual pair of Banach spaces (B,B)(B,\|\cdot\|_B)7 and (B,B)(B,\|\cdot\|_B)8, there exists a continuous bilinear form

(B,B)(B,\|\cdot\|_B)9

with reproducing properties

XX0

(Lin et al., 2019, Ikeda et al., 2022, Heeringa, 27 Mar 2026). Unlike in RKHS, the kernel need not be positive-definite or symmetric; it reflects Banach duality and the structure of the feature space.

A key extension is to vector-valued RKBS (vv-RKBS), in which functions take values in a Banach space XX1 and the kernel is a map XX2, where XX3 denotes the set of twin (bilinear) operators acting across a dual pair XX4 (Dummer et al., 30 Sep 2025, Zhang et al., 2011, Chen et al., 2019). The reproducing property is then formulated via the duality

XX5

for all XX6, XX7.

3. Canonical Constructions: Feature Space, p-Norm, and Orlicz RKBS

The general framework unifies a diverse range of concrete constructions (Lin et al., 2019, Xu et al., 2014, Song et al., 2011):

  • p-norm RKBS: A special case arises when the feature space is XX8 and the kernel admits a Mercer-type expansion. For a generalized Mercer kernel XX9 satisfying certain summability conditions, set

xXx\in X0

with dual xXx\in X1. For xXx\in X2 this recovers the classical RKHS. For xXx\in X3 (the ℓ¹ case), strong sparsity properties are present (Xu et al., 2014, Song et al., 2011, Wang et al., 2023).

  • Orlicz RKBS: Using Orlicz feature spaces xXx\in X4 defined by a convex Young function xXx\in X5, kernels and norms are built analogously with duals in the conjugate Orlicz space (Lin et al., 2019).
  • Integral/Barron–type RKBS: For xXx\in X6 and xXx\in X7 locally compact, and a bounded kernel xXx\in X8, one defines

xXx\in X9

This class includes Barron spaces for infinite-width neural networks (Spek et al., 2022, Bartolucci et al., 2021). For evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x)0-norm regularization on evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x)1-type feature spaces, an analogous construction yields RKBSs with evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x)2-norm margins (Xu et al., 2014, Shin et al., 2024, Kumar et al., 2024).

4. Structural Results: Sums, Decompositions, and Connections to Neural Networks

Given a family evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x)3 of RKBSs on the same domain evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x)4, their evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x)5-direct sum

evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x)6

with infimal convolution norm is itself an RKBS. The feature space is the direct sum of the evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x)7 feature spaces, and the kernel is the sum of the evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x)8 kernels (Shin et al., 2024).

For integral RKBSs, one obtains a canonical decomposition into an infinite sum of evx:BR,ff(x)\mathrm{ev}_x : B \to \mathbb{R}, \, f \mapsto f(x)9-norm RKBSs via measure disintegration: Cx<C_x < \infty0 where each Cx<C_x < \infty1 is a Cx<C_x < \infty2-norm RKBS parametrized over singular measures Cx<C_x < \infty3 (Shin et al., 2024). This decomposition underlies the analysis of infinite-width (Barron-type) one-layer neural networks, with the solution space structured as an Cx<C_x < \infty4-sum over Cx<C_x < \infty5 component spaces.

Moreover, every finite multi-kernel sum, and any hypothesis class formed as a finite sum of such RKBSs, is itself again an RKBS, a key property for multi-block and multi-kernel learning in Banach settings (Shin et al., 2024).

5. Representer Theorems, Sparse Expansions, and Regularization

A critical property for applications is the representer theorem: for a wide class of regularized learning or interpolation schemes posed over an RKBS with kernel Cx<C_x < \infty6, minimizers are finite kernel expansions: Cx<C_x < \infty7 for data points Cx<C_x < \infty8 (Lin et al., 2019, Xu et al., 2014, Kumar et al., 2024, Song et al., 2011). For Cx<C_x < \infty9-norm and ℓ¹-type RKBS, the dual geometry induces sparsity in the expansion coefficients—sparse representer theorems hold under additional conditions on the kernel and the Banach norm (Wang et al., 2023, Song et al., 2011).

For integral RKBSs and neural network/Barron spaces, regularized empirical risk minimization over the variation norm on the representing measure yields solutions given by atomic (finite) measures, ensuring the network's expressivity aligns with the number of training constraints (Bartolucci et al., 2021, Spek et al., 2022).

6. Optimization: Mirror Descent and Learning Algorithms

Optimization in non-Hilbertian RKBSs naturally exploits the duality and geometry of the Banach space. Mirror descent algorithms, using dual mappings and reproducing kernels, provide efficient optimization techniques and admit precise convergence guarantees. For reflexive, strongly convex Banach spaces endowed with a reproducing kernel, mirror descent achieves linear convergence under strong convexity and smoothness, and f(x)CxfB|f(x)| \leq C_x \|f\|_B0 rates in the constrained setting (Kumar et al., 2024).

The representer property ensures that mirror descent iterates remain within the finite span of the data-induced kernel sections, so even in f(x)CxfB|f(x)| \leq C_x \|f\|_B1-norm and Orlicz RKBSs, infinite-dimensional problems admit finite-dimensional algorithmic reductions.

7. Applications and Structural Insights in Modern Machine Learning

RKBS theory provides the appropriate geometric and functional-analytic framework for learning models that go beyond the scope of RKHS, including:

Structural decompositions, e.g., the decomposition of integral RKBSs into sums of f(x)CxfB|f(x)| \leq C_x \|f\|_B3-norm spaces, yield fine-grained insight into representational hierarchies underlying neural architectures, enable the design of novel Banach-geometry-based regularizers and provide principled understanding of the complexity, approximation power, and learnability of function classes (Shin et al., 2024, Lu et al., 2024).

References

Definition Search Book Streamline Icon: https://streamlinehq.com
References (19)

Topic to Video (Beta)

No one has generated a video about this topic yet.

Whiteboard

No one has generated a whiteboard explanation for this topic yet.

Follow Topic

Get notified by email when new papers are published related to Reproducing Kernel Banach Spaces (RKBSs).