Integrated Basis Expansion Principles

• Integrated Basis Expansion is a framework where basis elements, coefficients, and constraints are jointly optimized within the model, ensuring adaptive performance.
• It is applied in neural adaptation, view synthesis, covariance estimation, and physical simulations to boost computational efficiency and accuracy.
• The integrated approach relies on design principles like orthogonality, boundedness, and tailored residuals to enforce structural regularization and improve model expressiveness.

Searching arXiv for recent and foundational papers related to "integrated basis expansion". Integrated Basis Expansion denotes, in the cited literature, a family of constructions in which a basis expansion is embedded directly into a model, inference pipeline, numerical scheme, or arithmetic representation, so that basis elements, coefficients, and structural constraints are optimized or enforced jointly rather than treated as an external decomposition. In neural adaptation this appears as shared basis banks with state-dependent composition (Khasia, 29 Dec 2025); in view synthesis as per-pixel coefficients over global view-direction bases (Wizadwongsa et al., 2021); in disentanglement as an orthogonal transform embedded inside InfoGAN (Jiang et al., 2021); in covariance estimation as a structured-plus-residual matrix expansion (Bak et al., 21 Feb 2025); and in kernel theory, stochastic analysis, finite-basis extrapolation, electronic dynamics, and algebraic number theory as controlled expansions whose coefficients, norms, or integrality properties are part of the primary problem formulation (Bisiacco et al., 2024, Farnoosh et al., 2017, Furnstahl et al., 2013, Sato et al., 2014, Remete, 2021, Bauch, 2015). This suggests a family resemblance rather than a single standardized formalism.

1. General formulation and scope

A common structural template is a representation of the form

$f \approx \sum_k \alpha_k B_k,$

with the distinction that the basis elements $B_k$, the coefficients $\alpha_k$, or both, are internal to the operative system. Representative instances include dynamic weight updates

$$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$

per-pixel radiance factorization

$$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$

covariance regression

$$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$

and kernel expansions

$$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$

all of which are treated as primary modeling objects rather than auxiliary reparameterizations (Khasia, 29 Dec 2025, Wizadwongsa et al., 2021, Bak et al., 21 Feb 2025, Bisiacco et al., 2024).

Setting	Representative expansion	Integrated aspect
Neural adaptation	$$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$	routing, gating, and spectral control are part of the layer
View synthesis	$$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$	basis evaluation and compositing are coupled inside MPI rendering
Structured estimation	$\Sigma=\sum \theta_j B_j$	basis choice, sparsity, and estimation objective are joint

The phrase therefore spans several technical meanings. In some works the emphasis is on shared adaptive subspaces; in others it is on orthogonality, boundedness, local integrality, or extrapolation. A plausible implication is that “integrated” refers less to a particular algebraic form than to where the expansion sits in the computational stack: inside the model, not beside it.

2. Neural and generative model constructions

In neural weight adaptation, "Dynamic Subspace Composition: Efficient Adaptation via Contractive Basis Expansion" formalizes integrated basis expansion as a residual, star-shaped perturbation around the identity (Khasia, 29 Dec 2025). A base network $B_k$0 is augmented by

$B_k$1

with

$B_k$2

The basis bank is shared, $B_k$3, each atom is rank $B_k$4, and Top-$B_k$5 routing yields a compositional rank-$B_k$6 update. Magnitude-Gated Simplex Interpolation sets

$B_k$7

so the update retreats continuously to zero as routing confidence vanishes. The paper frames the reachable updates as a star-shaped domain, proves spectral bounds such as $B_k$8 under global scaling, and contrasts the resulting $B_k$9 parameter complexity and $\alpha_k$0 memory traffic with the $\alpha_k$1 and $\alpha_k$2 scaling of standard Mixture-of-LoRAs.

In neural scene representation, "NeX: Real-time View Synthesis with Neural Basis Expansion" uses a global angular basis and per-pixel coefficients to encode view-dependent appearance (Wizadwongsa et al., 2021). Each MPI pixel stores $\alpha_k$3, a base color $\alpha_k$4, and reflectance coefficients $\alpha_k$5, while a second network provides globally shared basis functions $\alpha_k$6. The color law

$\alpha_k$7

is evaluated inside standard homography warping and alpha compositing. The spatial factor is produced by an implicit MLP $\alpha_k$8, the angular factor by $\alpha_k$9, and the base color $$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$0 is optimized explicitly. This hybrid implicit–explicit split is central: high-frequency detail remains in $$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$1, while angular variation is carried by a low-rank global basis.

In disentanglement, "Inference-InfoGAN: Inference Independence via Embedding Orthogonal Basis Expansion" inserts an Orthogonal Basis Expansion module into InfoGAN (Jiang et al., 2021). A learned orthogonal matrix $$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$2 satisfies

$$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$3

and generated images are decomposed as

$$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$4

The coefficients $$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$5 are then coupled to latent variables $$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$6 through a factorized inference model $$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$7, jointly optimized with the usual InfoGAN mutual-information term. Here integrated basis expansion means that the basis is neither fixed nor external: it is optimized with the generator, discriminator, and inference network, and the orthogonality geometry is enforced by the training objective itself.

3. Structured estimation and prediction

In covariance modeling, "Covariance Regression based on Basis Expansion" develops a Linear Covariance Selection Model that explicitly relaxes the exact-span assumption of earlier covariance regression methods (Bak et al., 21 Feb 2025). The covariance is decomposed as

$$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$8

where $$\Delta W(\mathbf{x}) = \sum_{j \in \mathcal{I}(\mathbf{x})} \hat z_j(\mathbf{x})\, \mathbf{u}_j^\top \mathbf{v}_j,$$9 encode known structure and $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$0 span an orthogonal residual subspace. The additional basis matrices are obtained from the left null space of

$$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$1

followed by inverse half-vectorization and orthonormalization. Estimation proceeds through an $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$2-penalized matrix regression,

$$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$3

solved by coordinate descent with soft-thresholding. The paper derives non-asymptotic Frobenius-error bounds under sub-Gaussian and Bernstein-type matrix error assumptions. In this setting, integrated basis expansion is the joint use of scientifically specified bases and data-driven residual bases inside one penalized estimator.

In high-mobility communications, "Basis Expansion Extrapolation based Long-Term Channel Prediction for Massive MIMO OTFS Systems" combines several basis layers into a single UL-estimation/DL-prediction pipeline (Zhang et al., 2 Jul 2025). Within a frame, a CE-BEM models each tap as

$$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$4

while an SR-BEM expands antenna-domain coefficients on a rotated DFT basis. Across frames, estimated channels are projected onto Slepian sequences,

$$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$5

and the resulting Slepian coefficients are fitted with discrete Legendre polynomials,

$$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$6

This layered expansion is tightly coupled to pilot design, sparse recovery via VBL-SOMP, Savitzky–Golay smoothing, and iterative extrapolation. The paper explicitly treats the method as an integrated scheme: low pilot overhead, structured sparse estimation, and long-term prediction are all consequences of placing multiple basis expansions inside one TDD massive MIMO-OTFS architecture.

4. Physical simulation and finite-basis dynamics

In real-time electron dynamics, "Efficient basis expansion for describing linear and nonlinear electron dynamics in crystalline solids" replaces a large three-dimensional real-space grid with a $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$7-shifted basis expansion (Sato et al., 2014). A naive truncation on eigenstates at fixed $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$8,

$$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum_{n=1}^N k_n^{\mathbf p} H_n(\mathbf v),$$9

is shown to be inadequate: it produces a spurious Drude-like divergence in the dielectric response and a large constant current in an insulator. The effective alternative is to integrate occupied states at nearby $$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$0-points with unoccupied states at the original $$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$1-point, motivated by the velocity-gauge shift $$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$2 and by Houston-state dynamics. For SiO$$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$3, the full grid uses $$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$4 grid points per $$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$5-point, whereas a $$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$6-shifted-4(48) basis has dimension $$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$7 per $$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$8 and yields an overall speedup of about $$\Sigma=\alpha_0^* I+\sum_{j=1}^s \alpha_j^* G_j+\sum_{j=1}^q \beta_j^* F_j,$$9.

In finite-basis extrapolation, "Systematic expansion for infrared oscillator basis extrapolations" gives a different but closely related use of basis expansion: the truncated harmonic-oscillator basis is interpreted as a Dirichlet boundary at an effective radius

$$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$0

which holds for nonzero angular momentum as well (Furnstahl et al., 2013). Bound-state energies are then expanded in powers of $$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$1. At leading order,

$$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$2

and the $$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$3-wave NLO formula introduces the $$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$4 and $$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$5 corrections in terms of the ANC $$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$6 and effective-range parameters. The same paper derives detailed extrapolation forms for radii, with

$$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$7

Here the “integration” lies in turning a finite basis into a controlled asymptotic expansion for observable extrapolation.

5. Functional-analytic, stochastic, and arithmetic formulations

"Gaussian kernel expansion with basis functions uniformly bounded in $$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$8" studies exact kernel representations

$$K(x,y)=\sum_{k=1}^\infty \lambda_k \psi_k(x)\psi_k(y),$$9

under the joint constraints $$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$0 and $$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$1 (Bisiacco et al., 2024). Its main result is sharp: on $$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$2, the Gaussian kernel admits a $$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$3-expansion for any $$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$4, but not a $$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$5-expansion; more generally, nontrivial radial basis function kernels with $$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$6 as $$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$7 do not admit $$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$8-expansions on $$\Delta W(\mathbf{x})=\sum \hat z_j(\mathbf{x})\,\mathbf{u}_j^\top \mathbf{v}_j$$9. A corollary is the non-existence of Mercer expansions on $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$0, with respect to any finite measure, whose eigenfunctions all belong to a closed ball of $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$1. In this literature, integrated basis expansion refers to uniform control under sup-norm and integration.

In stochastic analysis, "An orthogonal basis expansion method for solving path-independent stochastic differential equations" expands a path-independent solution $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$2 in 2D-Hermite polynomials,

$$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$3

inside a Hilbert space weighted by the Brownian Gaussian density (Farnoosh et al., 2017). The coefficients satisfy a nonlinear integro-differential system obtained by Itô calculus, and moments follow directly from orthogonality: $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$4 Here the expansion is integrated in the literal sense that the coefficients and statistics are defined through weighted integrals against the basis.

In algebraic number theory, the phrase shifts from function approximation to arithmetic representation. "A generalization of simplest number fields and their integral basis" proves that, under square-freeness hypotheses, the integral basis of generalized simplest number fields repeats periodically in the parameter $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$5: for each residue class $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$6, there exist polynomials $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$7 such that

$$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$8

is an integral basis whenever $$\mathcal{C}^{\mathbf p}(\mathbf v)=k_0^{\mathbf p}+\sum k_n^{\mathbf p} H_n(\mathbf v)$$9 and $\Sigma=\sum \theta_j B_j$0 is irreducible (Remete, 2021). "Computation of Integral Bases" treats the local version: a $\Sigma=\sum \theta_j B_j$1-integral basis is characterized by $\Sigma=\sum \theta_j B_j$2-semi-orthonormality, and is constructed from Montes data, divisor polynomials, and simple multipliers, often in triangular form (Bauch, 2015). In this domain, an integrated basis expansion is the expression of algebraic integers in a basis whose integrality and localization are part of the arithmetic problem itself.

6. Empirical behavior, limitations, and conceptual distinctions

A recurring empirical pattern is that adaptive or jointly optimized bases outperform fixed or fragmented alternatives. In NeX, learned angular bases significantly outperform Taylor series, spherical harmonics, hemispherical harmonics, Jacobi spherical harmonics, and Fourier-series alternatives with the same coefficient form; rendering requires $\Sigma=\sum \theta_j B_j$3 MFLOPs per pixel versus $\Sigma=\sum \theta_j B_j$4 MFLOPs per pixel for NeRF, yielding more than $\Sigma=\sum \theta_j B_j$5 faster rendering in practice (Wizadwongsa et al., 2021). In Inference-InfoGAN, the learned OBE basis exceeds the DCT variant on disentanglement metrics, and alternating optimization improves FactorVAE from $\Sigma=\sum \theta_j B_j$6 to $\Sigma=\sum \theta_j B_j$7, SAP from $\Sigma=\sum \theta_j B_j$8 to $\Sigma=\sum \theta_j B_j$9, and MIG from $B_k$00 to $B_k$01 (Jiang et al., 2021). In DSC on WikiText-103 under an iso-active-parameter protocol, the dense baseline has validation loss $B_k$02 and latency $B_k$03 ms, standard MoE has $B_k$04 and $B_k$05 ms, and DSC with $B_k$06 bases and $B_k$07 has $B_k$08 and $B_k$09 ms (Khasia, 29 Dec 2025).

The same literature also records explicit limits. NeX remains constrained by fixed basis size $B_k$10, MPI’s “stack of cards” geometry, and difficult refraction or multiple scattering (Wizadwongsa et al., 2021). Inference-InfoGAN notes hyperparameter sensitivity and the computational overhead of alternating optimization (Jiang et al., 2021). The covariance-regression construction identifies the residual matrix $B_k$11, but the individual coefficients $B_k$12 depend on the chosen residual basis (Bak et al., 21 Feb 2025). The OTFS predictor assumes TDD reciprocity, Jakes-type Doppler structure, and knowledge of $B_k$13, and its accuracy degrades as velocity and prediction horizon increase (Zhang et al., 2 Jul 2025). The Gaussian-kernel results impose a hard impossibility boundary: on $B_k$14, uniformly bounded basis functions and $B_k$15-summable weights cannot coexist for Gaussian and related radial kernels (Bisiacco et al., 2024).

A common misconception is that integrated basis expansion presupposes a fixed orthogonal transform. The cited work shows otherwise. Some constructions are explicitly orthogonal, as in OBE (Jiang et al., 2021); others pursue low coherence or frame-like spreading rather than orthogonality, as in DSC (Khasia, 29 Dec 2025); others use globally shared but learned nonlinear bases, as in NeX (Wizadwongsa et al., 2021); and still others add residual bases precisely because the scientifically supplied basis is incomplete, as in LCSM (Bak et al., 21 Feb 2025). Another misconception is that the term always refers to approximation in function space. In arithmetic uses, the central issue is not approximation but exact expansion in an integral basis with periodic or local integrality structure (Remete, 2021, Bauch, 2015).

Taken together, these works support a broad technical characterization. Integrated Basis Expansion is not a single algorithm but a design principle: a basis expansion becomes “integrated” when basis selection, coefficient generation, structural regularization, and downstream computation are inseparable. Depending on the field, the governing constraints may be contractivity and spectral control, orthogonality and mutual-information coupling, boundedness in $B_k$16, sparsity in matrix regression, finite-volume asymptotics, or local integrality. The unifying feature is that the basis is part of the model’s operative semantics rather than an external coordinate system.