---
title: Double-Space Tensor-Product RKHS Framework
url: https://www.emergentmind.com/topics/double-space-tensor-product-rkhs-framework
type: topic
---

# Double-Space Tensor-Product RKHS Framework

Searching arXiv for the cited papers to ground the article in the referenced literature.
The Double-Space Tensor-Product RKHS framework denotes a family of constructions in which learning is organized over two coupled Hilbert-space structures: either a Cartesian product or sum of reproducing kernel Hilbert spaces for additive multicomponent function estimation, or a tensor-product RKHS for multiplicative interactions on product domains. In the formulation of “Adaptive Learning in Cartesian Product of Reproducing Kernel Hilbert Spaces” [1408.0853], the central object is the Cartesian product \(H^\times = H_1 \times H_2\) together with the sum space \(H^+ = H_1 + H_2\), used to estimate or track nonlinear functions composed of multiple components such as “linear and nonlinear components” or “high- and low- frequency components.” The broader literature represented here connects that additive double-space viewpoint to tensor-product RKHS constructions used for hybrid tensor decomposition [2408.05677], correspondence-free bundle adjustment over geometry and semantics [2403.01254], joint distribution learning [2110.04829], algebraic tensor closure properties for RKHSs [2401.01295], dynamic multilayer network modeling [2509.05221], Gaussian/Hermite infinite tensor products [2110.05778], and multilinear spectral regularization in tensor-product RKHSs [1310.4977]. Taken together, these works establish a technical distinction between additive superposition in \(H_1 \times H_2\) or \(H_1+H_2\), and multiplicative interaction modeling in \(H_1 \otimes H_2\), while also suggesting a common design pattern: define mode-specific RKHSs, choose additive or multiplicative coupling according to the target structure, and exploit representer-based finite reductions for optimization.

## 1. Formal double-space constructions

In the additive framework of [1408.0853], two RKHSs over a common input space \(U\), \((H_1,\langle\cdot,\cdot\rangle_{H_1})\) and \((H_2,\langle\cdot,\cdot\rangle_{H_2})\) with kernels \(k_1\) and \(k_2\), generate the Cartesian product Hilbert space
\[
H^\times := H_1 \times H_2 := \{(f_1,f_2): f_1\in H_1, f_2\in H_2\}.
\]
Its inner product and norm are
\[
\langle (f_1,f_2),(g_1,g_2)\rangle_{H^\times}:=\langle f_1,g_1\rangle_{H_1}+\langle f_2,g_2\rangle_{H_2},
\]
\[
\|(f_1,f_2)\|^2_{H^\times}:=\|f_1\|^2_{H_1}+\|f_2\|^2_{H_2}.
\]
The associated sum space is
\[
H^+ := H_1 + H_2 := \{f: f=f_1+f_2,\ f_1\in H_1,\ f_2\in H_2\},
\]
with RKHS norm defined by the minimal decomposition:
\[
\|f\|^2_{H^+}:=\min\{\|f_1\|^2_{H_1}+\|f_2\|^2_{H_2}: f=f_1+f_2,\ f_1\in H_1,\ f_2\in H_2\}.
\]
When \(H_1\cap H_2=\{0\}\), the decomposition is unique, \(H^+=H_1\oplus H_2\), and the map
\[
T:H^\times\to H^+,\qquad T(f_1,f_2)=f_1+f_2
\]
is a Hilbert-space isomorphism [1408.0853].

The reproducing kernel of \(H^+\) is the additive kernel
\[
k_\Sigma(x,y):=k_1(x,y)+k_2(x,y),
\]
and with positive weights \(w_1,w_2>0\) one has the weighted sum-space kernel
\[
k_w(x,y):=w_1k_1(x,y)+w_2k_2(x,y),
\]
with weighted inner product satisfying
\[
\langle\cdot,\cdot\rangle_{H_q,w_q}=w_q^{-1}\langle\cdot,\cdot\rangle_{H_q},\qquad q\in\{1,2\}
\]
[1408.0853].

By contrast, the tensor-product side uses the multiplicative kernel
\[
k_\otimes((x_1,x_2),(y_1,y_2)):=k_1(x_1,y_1)k_2(x_2,y_2),
\]
which is the reproducing kernel of the tensor-product RKHS \(H_1\otimes H_2\) on the product domain \(U\times U\) or on heterogeneous product domains. In [1408.0853], this construction is explicitly distinguished from the additive sum-space formalism and is “not directly developed in the paper,” though it is identified as “the standard way to model multiplicative interactions.”

Several later works instantiate the tensor-product viewpoint explicitly. In CP-HiFi, the ambient product space is
\[
\mathcal{H}:=\Big(\bigotimes_{j\in J}\mathcal{H}_j\Big)\otimes\Big(\bigotimes_{k\in K}\mathbb{R}^{n_k}\Big),
\]
where the \(\mathcal{H}_j\) are RKHSs for continuous modes and the Euclidean factors represent discrete modes [2408.05677]. In RKHS-BA, the “Double-Space domain” is \(Z=X\times S\) for geometry and semantics, with a separable kernel
\[
K((x,s),(x',s'))=K_X(x,x')K_S(s,s')
\]
on the tensor-product RKHS \(H_X\otimes H_S\) [2403.01254]. In adaptive joint distribution learning, the hypothesis space is \(H_X\otimes H_Y\) with product kernel
\[
K((x,y),(x',y'))=k_X(x,x')k_Y(y,y')
\]
[2110.04829]. These constructions share the product-kernel mechanism, but they differ in objective, parameterization, and interpretation.

## 2. Additive double-space modeling in Cartesian-product and sum-space RKHSs

The additive formulation of [1408.0853] is tailored to multicomponent targets of the form
\[
f=f_1+f_2,\qquad f_1\in H_1,\quad f_2\in H_2.
\]
Each component admits its own kernel expansion,
\[
f_1(x)=\sum_n \alpha_{1,n}k_1(x,x_n),\qquad f_2(x)=\sum_n \alpha_{2,n}k_2(x,x_n),
\]
and in the adaptive setting each RKHS maintains its own dictionary \(D_{1,n}\), \(D_{2,n}\), generating subspaces
\[
M_{1,n}:=\operatorname{span}D_{1,n},\qquad M_{2,n}:=\operatorname{span}D_{2,n},
\]
with dictionary sum-space \(M_n^+=M_{1,n}+M_{2,n}\) [1408.0853].

This componentwise organization is particularly natural when different kernels capture different structures. The data synthesis explicitly lists “linear and nonlinear components” and “high- and low- frequency components” as representative targets [1408.0853]. The structural examples include the linear kernel
\[
k_L(x,y)=x^\top y+c,\qquad c\ge 0,
\]
and the Gaussian kernel
\[
k_{G,\sigma}(x,y)=((\sqrt{2\pi}\sigma)^{-L})\exp(-\|x-y\|^2/(2\sigma^2)).
\]
A key result attributed to Minh (2010) states that polynomial, including linear, RKHS and Gaussian RKHS intersect trivially:
\[
H_{\mathrm{poly}}\cap H_{G,\sigma}=\{0\}
\]
on sets \(U\) with nonempty interior. Hence
\[
H^+=H_{\mathrm{poly}}\oplus H_{G,\sigma},
\]
so the \(H^\times\)–\(H^+\) isomorphism holds in the linear-plus-Gaussian case [1408.0853].

By contrast, for two Gaussian RKHSs with \(\sigma_1>\sigma_2\), the spaces are nested:
\[
H_1\subset H_2,
\]
and the norms satisfy
\[
\sqrt{w_1}\|f\|_{H_1}\ge \sqrt{w_2}\|f\|_{H_2}\qquad\text{for }f\in H_1.
\]
The synthesis explicitly notes that this is “not a direct sum in that case,” so the Cartesian-product formulation is preferred [1408.0853].

The sum-space viewpoint also supports a batch regularization interpretation. Kernel ridge regression in the additive space takes the form
\[
\min_{f\in H^+}\ \frac{1}{r}\sum_j (f(u_j)-d_j)^2+\eta \|f\|_{H^+}^2,
\]
with representer
\[
f^*(\cdot)=\sum_j \alpha_j k_\Sigma(\cdot,u_j),\qquad \alpha=(K+\eta r I)^{-1}d,
\]
where \(K\) is the Gram matrix of \(k_\Sigma\). Componentwise regularization,
\[
\min_{f_1,f_2}\sum_j (f_1(u_j)+f_2(u_j)-d_j)^2+\lambda_1\|f_1\|_{H_1}^2+\lambda_2\|f_2\|_{H_2}^2,
\]
is stated to be equivalent to weighted sum-space regularization via the weighted norm construction [1408.0853].

A plausible implication is that the additive double-space formalism supplies an RKHS-native decomposition language for heterogeneous priors without collapsing all structure into a single kernel. In this reading, the direct-sum case provides not only algebraic simplification but also interpretability, because the decomposition \(f=f_1+f_2\) is unique.

## 3. Iterative projection learning: HYPASS and CHYPASS

The adaptive algorithm in [1408.0853] combines multikernel adaptive filtering with the algorithm of hyperplane projection along affine subspace. For a new sample \((u_n,d_n)\), the zero-instantaneous-error hyperplane restricted to the current dictionary sum-space is
\[
\Pi_n:=\{f\in M_n^+:\ f(u_n)=\langle f,k_\Sigma(\cdot,u_n)\rangle_{H^+}=d_n\}.
\]
The relaxed projection update is
\[
\varphi_{n+1}:=\varphi_n+\lambda_n(P_{\Pi_n}(\varphi_n)-\varphi_n),\qquad \lambda_n\in(0,2),
\]
where \(P_{\Pi_n}\) denotes orthogonal projection in \(H^+\) [1408.0853].

For a general hyperplane \(\Pi\subset M^+\),
\[
P_\Pi(\varphi)=\varphi+\frac{d-\varphi(u)}{\|P_{M^+}(k_\Sigma(\cdot,u))\|_{H^+}^2}\,P_{M^+}(k_\Sigma(\cdot,u)).
\]
In the direct-sum case \(H_1\cap H_2=\{0\}\), the projection onto \(M^+\) decomposes componentwise:
\[
P_{M^+}(f)=P_{M_1}(f_1)+P_{M_2}(f_2),\qquad f=f_1+f_2.
\]
Each component projection is computed from normal equations. If
\[
M_i=\operatorname{span}\{k_i(\cdot,x_j)\}_{j=1}^{r_i},
\]
then
\[
P_{M_i}(f)=\sum_{j=1}^{r_i}\alpha_j k_i(\cdot,x_j),
\]
where
\[
K\alpha=b,\qquad b=[f(x_1),\dots,f(x_{r_i})]^\top,\qquad K(i,j)=k_i(x_i,x_j).
\]
In particular,
\[
P_{M_i}(k_i(\cdot,x_j))=k_i(\cdot,x_j)
\]
[1408.0853].

The key general-case update is the Cartesian HYPASS, or CHYPASS, formula:
\[
\varphi_{n+1}:=\varphi_n+\lambda_n\frac{d_n-\varphi_n(u_n)}{\sum_{q=1}^2\|P_{M_{q,n}}(k_q(\cdot,u_n))\|_{H_q}^2}\cdot \sum_{q=1}^2 P_{M_{q,n}}(k_q(\cdot,u_n)).
\]
This form “does not require the direct-sum assumption” and enforces
\[
f_1(u_n)+f_2(u_n)=d_n
\]
by projecting along the sum of the componentwise projected kernel sections [1408.0853].

Dictionary maintenance is kernel-specific. For the linear kernel, “a fixed orthonormal basis can be used,” whereas for the Gaussian kernel the dictionary can grow online via coherence criteria, with pruning by shrinkage or \(\ell_1\). To reduce complexity, one may use selected subsets \(\tilde D_{q,n}\subset D_{q,n}\), for example the \(s_n\) nearest neighbors to \(u_n\) by Gaussian coherence, replacing \(M_{q,n}\) by \(\tilde M_{q,n}=\operatorname{span}\tilde D_{q,n}\) in the update [1408.0853].

The paper synthesis states that each \(\Pi_n\) is a closed convex hyperplane and that the relaxed projection with \(\lambda_n\in(0,2)\) is standard for Fejér-type monotonicity in projection methods, while also noting that “the paper does not present a formal convergence theorem” [1408.0853]. This is important because the mechanism is explicitly characterized by iterative orthogonal projections, but the article’s evidence is numerical rather than theorem-based.

The stated per-iteration complexities are:

| Case | Complexity |
|---|---|
| Linear-Gaussian | CHYPASS \(\approx (L+3)r_{2,n}+3L+\min\{L,s_n\}+O(s_n^3)\) |
| Two-Gaussian | CHYPASS \(\approx (L+3)r_n+O(s_n^3)\), \(r_n=r_{1,n}+r_{2,n}\) |

The \(O(s^3)\) term is attributed to inversion of the small selected Gram submatrix [1408.0853].

A one-iteration worked example is given for a linear RKHS plus a normalized Gaussian RKHS. With selected subsets \(\tilde D_{1,n}\) and \(\tilde D_{2,n}\), one computes
\[
P_{\tilde M_{1,n}}(k_1(\cdot,u_n))=k_1(\cdot,u_n),
\]
\[
P_{\tilde M_{2,n}}(k_2(\cdot,u_n))=\sum_{j\in J}\alpha_j k_2(\cdot,u_j),
\]
where \(\alpha\) solves \(K\alpha=b\). The denominator is
\[
D_n:=\|k_1(\cdot,u_n)\|_{H_1}^2+\Big\|\sum_j \alpha_j k_2(\cdot,u_j)\Big\|_{H_2}^2,
\]
and because \(\|k(\cdot,x)\|^2=k(x,x)\) in RKHSs,
\[
\|k_1(\cdot,u_n)\|_{H_1}^2=k_1(u_n,u_n),\qquad \Big\|\sum_j \alpha_j k_2(\cdot,u_j)\Big\|_{H_2}^2=\alpha^\top K\alpha.
\]
The update becomes
\[
\beta_n:=\lambda_n\frac{d_n-\varphi_n(u_n)}{D_n},
\]
\[
\varphi_{n+1}:=\varphi_n+\beta_n\Big[k_1(\cdot,u_n)+\sum_j \alpha_j k_2(\cdot,u_j)\Big],
\]
or componentwise
\[
f_{1,n+1}:=f_{1,n}+\beta_n k_1(\cdot,u_n),\qquad f_{2,n+1}:=f_{2,n}+\beta_n\sum_j \alpha_j k_2(\cdot,u_j)
\]
[1408.0853].

## 4. From additive double-space to tensor-product RKHSs

The synthesis accompanying [1408.0853] makes the additive-versus-multiplicative distinction explicit. Additive modeling uses \(H^+\) or \(H^\times\) when the target decomposes as
\[
f=f_1+f_2,
\]
with component kernels combined through
\[
k_\Sigma=k_1+k_2.
\]
Multiplicative modeling instead uses the tensor-product RKHS \(H_1\otimes H_2\), typically on product domains, with
\[
k_\otimes=k_1\otimes k_2.
\]
The text states that this tensor-product construction “is different from the additive sum-space” and that the paper “does not implement tensor-product RKHS updates,” but also states that “the HYPASS projection principle extends” formally to the tensor-product space [1408.0853].

That extension is summarized as follows: in \(H_1\otimes H_2\), using kernel section \(k_\otimes(\cdot,u)\) and a dictionary of product atoms \(\{k_1(\cdot,x_{1i})\otimes k_2(\cdot,x_{2j})\}\), the projection retains the form
\[
f\leftarrow f+\lambda\frac{d-f(u)}{\|P_{M_\otimes}(k_\otimes(\cdot,u))\|^2}\,P_{M_\otimes}(k_\otimes(\cdot,u)),
\]
where \(M_\otimes\) is a subspace of \(H_1\otimes H_2\) [1408.0853]. The text immediately adds that “complexity grows with the number of product atoms, so sparsification becomes even more critical.”

This distinction reappears in later tensor-product works, but there the multiplicative form is not an extension remark; it is the primary modeling object. In CP-HiFi, a rank-\(R\) mixed continuous/discrete tensor is modeled as
\[
X\approx \sum_{r=1}^R \Big(\bigotimes_{j\in J} f_r^{(j)}\Big)\otimes \Big(\bigotimes_{k\in K} v_r^{(k)}\Big),
\]
and evaluation at mixed coordinates factorizes as a product over continuous and discrete modes [2408.05677]. In the dynamic multilayer network setting, the “double-space tensor-product RKHS” appears when a layer-time varying core \(R_{k,\ell}(t,s)\) is placed in
\[
H_t\otimes H_\ell
\]
with kernel
\[
K((t,s),(t',s'))=K_t(t,t')K_\ell(s,s'),
\]
leading to expansions
\[
R_{k,\ell}^{[t,s]}=\sum_{h\in T}\sum_{q\in[K]} \theta_{k,\ell,q,h}K_t(t,h)K_\ell(s,q)
\]
and norms
\[
\|R_{k,\ell}\|_{H_t\otimes H_\ell}^2=\operatorname{vec}(\Theta_{k,\ell})^\top (K_\ell\otimes K_t)\operatorname{vec}(\Theta_{k,\ell})
\]
[2509.05221]. In RKHS-BA, geometry and semantics are modeled on \(X\times S\) with product kernel \(K_XK_S\), and transformed frame similarity is computed through inner products in \(H_X\otimes H_S\) [2403.01254]. In JDL, the tensor-product space \(H_X\otimes H_Y\) is paired with empirical \(L^2\) spaces to form what the paper calls a double orthogonality structure across two spaces per marginal [2110.04829].

This suggests a useful editorial distinction. The phrase “double-space” is used in at least two closely related ways in the supplied literature: first, for additive two-component RKHS decompositions in a Cartesian product or sum space [1408.0853]; second, for product-domain constructions where two or more spaces are coupled multiplicatively through a tensor-product RKHS [2403.01254; 2408.05677; 2110.04829; 2509.05221]. The data support both usages, but they are not interchangeable.

## 5. Representative instantiations across the literature

Several works in the supplied corpus realize double-space or tensor-product RKHS constructions in distinct application regimes. The table summarizes only formulations explicitly stated in the data.

| Work | Space construction | Kernel form |
|---|---|---|
| Adaptive learning [1408.0853] | \(H^\times=H_1\times H_2\), \(H^+=H_1+H_2\) | \(k_\Sigma=k_1+k_2\) |
| CP-HiFi [2408.05677] | \(\big(\bigotimes_{j\in J}\mathcal H_j\big)\otimes\big(\bigotimes_{k\in K}\mathbb R^{n_k}\big)\) | modewise RKHS kernels \(K_j\) |
| RKHS-BA [2403.01254] | \(H_X\otimes H_S\) on \(Z=X\times S\) | \(K=K_X\cdot K_S\) |
| JDL [2110.04829] | \(H_X\otimes H_Y\) | \(K((x,y),(x',y'))=k_X(x,x')k_Y(y,y')\) |
| Dynamic multilayer networks [2509.05221] | \(H_t\otimes H_\ell\) | \(K=K_tK_\ell\) |
| Gaussian/Hermite tensor products [2110.05778] | countable tensor products of RKHSs | product kernels \(L\) and \(K\) |
| TP-RKHS with spectral penalties [1310.4977] | \(\bigotimes_{m=1}^M H_m\) | \(K(x,x')=\prod_m k_m(x_m,x_m')\) |

In CP-HiFi, the continuous-mode factors obey representer expansions on the union of observed coordinates:
\[
f_r^{(j)}(\cdot)=\sum_{p=1}^{N_j}\alpha_{r,p}^{(j)}K_j(t_p^{(j)},\cdot),
\]
and the evaluated factor matrix becomes
\[
C^{(j)}=K_jA^{(j)}
\]
[2408.05677]. The method is motivated by the statement that CP-HiFi “does not require the observed data to lie on a regular and finite rectangular grid and naturally incorporates misaligned data” [2408.05677].

In RKHS-BA, continuous landmark functions are represented either in a vector-valued RKHS or as scalar functions on \(Z=X\times S\):
\[
f_m(x,s)=\sum_i \alpha_{m,i}K_X(x,x_i^m)K_S(s,s_i^m),
\]
and the pairwise alignment energy is
\[
E_{jk}(T_j,T_k)=\|f_j\circ T_j-f_k\circ T_k\|_H^2.
\]
The cross-term expands as
\[
\sum_{i,l}\alpha_{j,i}\alpha_{k,l}K_X(T_jx_{j,i},T_kx_{k,l})K_S(s_{j,i},s_{k,l}),
\]
which the exposition identifies as the tensor-product scalar counterpart of the paper’s vector-valued semantic weighting [2403.01254].

In JDL, the product RKHS is combined with empirical \(L^2(\hat P_X)\) and \(L^2(\hat P_Y)\). The paper describes the computational device as working “simultaneously in two inner-product spaces”: the RKHS inner products and the empirical \(L^2\) inner products, yielding an adaptive basis that is orthonormal in the RKHS and diagonal in empirical \(L^2\) [2110.04829]. This is a notably different meaning of double-space than the Cartesian \(H_1\times H_2\) construction, but it still depends on a two-space coupling principle.

The algebraic paper on reproducing kernel Hilbert algebras proves that the class of RKHAs is closed under Hilbert space tensor product and pullback, with tensor-product kernel
\[
K((x,y),(x',y'))=K_X(x,x')K_Y(y,y')
\]
and multiplication bound controlled by the product of factor bounds [2401.01295]. That result is structural rather than algorithmic, but it situates product-RKHS construction within a broader categorical and algebraic framework.

The paper on countable tensor products of Hermite spaces and spaces of Gaussian kernels proves that, under square-summable Gaussian shape parameters, the tensor-product Gaussian space is isometrically isomorphic to a tensor-product Hermite space, with an explicit isometry that “respects point evaluations” and is also an \(L^2\)-isometry [2110.05778]. This provides an infinite-dimensional realization of tensor-product RKHS equivalences.

Finally, the multilinear spectral-penalty work formulates learning in TP-RKHSs over Cartesian products \(X_1\times\cdots\times X_M\) with kernel
\[
K(x,x')=\prod_{m=1}^M k_m(x_m,x_m'),
\]
and the data block identifies “a novel representer theorem suitable for existing as well as new spectral penalties for tensors” [1310.4977]. The synthesis supplied with the prompt marks this presentation as paraphrastic rather than quoted, so its detailed derivations should be read as a standard-form exposition consistent with the paper rather than verbatim reconstruction.

## 6. Empirical behavior, practical criteria, and interpretive cautions

For the additive CHYPASS framework, the supplied experiments are concrete. In the linear-plus-Gaussian experiment,
\[
\psi(u)=u+\exp(-(u-0.5)^2/(2\cdot 0.5^2)),\qquad U=(-2,2),
\]
“CHYPASS and MKNLMS (two kernels) outperform single-kernel KNLMS/HYPASS, with smaller dictionaries.” The reported mean dictionary sizes are KNLMS 31.9, HYPASS 31.6, MKNLMS 17.8, and CHYPASS 17.7 [1408.0853]. In the two-Gaussian experiment,
\[
\psi(u)=\sin(\pi u/3)-\exp(-(u-0.5)^2/(2\cdot 0.1^2)),
\]
with \(\sigma_1=1.0\), \(\sigma_2=0.02\), and \(w_2=0.1\), “CHYPASS achieves better MSE than MKNLMS, with smaller or comparable dictionaries,” with mean sizes KNLMS 205.0, HYPASS 205.8, MKNLMS 147.6, CHYPASS 149.3 [1408.0853]. Similar behavior is reported for a partially linear dynamic system and for real laser and CO\(_2\) data [1408.0853].

In CP-HiFi, the empirical outcomes listed in the data concern sampling alignment rather than dictionary size. The paper reports that with dense aligned sampling, CP and CP-HiFi are similar; with fewer aligned points, CP appears jaggier while CP-HiFi preserves smoothness; a single misaligned point can induce spurious behavior in CP’s continuous-mode factor while CP-HiFi remains well-behaved; and with fully unaligned sampling across fibers, CP-HiFi best matches ground truth [2408.05677]. In RKHS-BA, semantic information is reported to improve robustness and running time, with cited examples including “mean ATE 0.584 m with semantics vs. 0.664 m color-only” on TartanAir and lower translational and rotational drifts on SemanticKITTI [2403.01254]. In JDL, scalability “up to n ≈ 10^7” is explicitly reported, with positivity and normalization enforced by construction and conditional distributions obtained by normalization of the learned nonnegative joint table [2110.04829].

These results support a practical division of labor. The additive double-space machinery of [1408.0853] is directed at online estimation/tracking of superposed components and emphasizes selective dictionary updates, hyperplane projections, and decomposition structure. The multiplicative tensor-product formulations emphasize product-domain interactions, representer-based finite reductions, and mode-coupled optimization.

Three cautions follow directly from the data.

First, additive and multiplicative constructions should not be conflated. The prompt material repeatedly separates \(k_\Sigma=k_1+k_2\) from \(k_\otimes=k_1\otimes k_2\) [1408.0853]. Second, the direct-sum isomorphism \(H^\times\simeq H^+\) requires \(H_1\cap H_2=\{0\}\); this fails for nested RKHS pairs such as two Gaussians of different bandwidths [1408.0853]. Third, not every “double-space” construction refers to the same geometry. In JDL, “double-space” concerns simultaneous RKHS and empirical \(L^2\) orthogonality [2110.04829], whereas in RKHS-BA it refers to geometry–semantics coupling on a product domain [2403.01254].

A plausible implication is that “Double-Space Tensor-Product RKHS framework” functions less as a single canonical formalism than as a recurring architectural pattern in RKHS research. In one branch, it denotes additive superposition across multiple RKHS components, as in CHYPASS [1408.0853]. In another, it denotes multiplicative coupling across domains or modes through a product kernel, as in CP-HiFi [2408.05677], RKHS-BA [2403.01254], JDL [2110.04829], and related tensor-product constructions [2509.05221; 2110.05778; 1310.4977]. The common thread is the deliberate separation of structure across spaces, together with explicit control of how those spaces are recombined—by direct sum, Cartesian product, or tensor product—according to the target phenomenon.

Source: https://www.emergentmind.com/topics/double-space-tensor-product-rkhs-framework