Taylor-TT Construction Overview

• Taylor-TT construction is a family of methods that integrate Taylor series expansions with tensor-train representations to manage high-order information.
• The approach embeds local Taylor polynomials into tensor-product feature spaces and employs low-rank tensor approximations for efficiency and error control.
• These methods extend to diverse applications, including quantum model surrogates and PDE mappings, and inspire further advances in tensor optimization and categorical formulations.

“Taylor-TT construction” does not denote a single standardized object. In current literature, the expression is used for several distinct constructions that combine Taylor data with structured representations, most notably tensor-train compression of local Taylor models and Taylor-series surrogates whose derivative tensors are represented in Tucker tensor train form. In other settings, the same label is attached to algebraic, categorical, or even physically unrelated Taylor-based constructions (Nair et al., 28 Apr 2026, Alger et al., 22 Mar 2026, Sobieska, 2022, Walch, 13 Feb 2025). The common thread is not a shared formalism, but the use of explicit Taylor-type structure together with a second mechanism—compression, transport, lifting, or exact basis fitting—to make higher-order information computationally or structurally tractable.

1. Terminological scope

The term appears in several mathematically different contexts.

Usage	Core mechanism	Representative paper
Local Taylor-TT surrogate	Taylor polynomial on a local patch, embedded in tensor-product features, then compressed in TT form	(Nair et al., 28 Apr 2026)
Tucker tensor train Taylor series	Truncated Taylor series with each derivative tensor approximated by a Tucker tensor train	(Alger et al., 22 Mar 2026)
Taylor resolution over complete intersections	Classical Taylor resolution transported by Eisenbud–Shamash to $R=Q/(a_1,\dots,a_c)$	(Sobieska, 2022)
Categorical Taylor construction	Higher-order Taylor functor/monad or generalized Taylor morphism	(Walch, 13 Feb 2025, Ng, 2023)

In the tensor-network literature, two constructions are central. The first is a local tensor-train surrogate for a trained quantum model on a patch $B(x_0,r)$, where a truncated Taylor polynomial is embedded into a tensor-product feature map and then approximated by a TT tensor with bond dimension $\chi$ (Nair et al., 28 Apr 2026). The second is the Tucker tensor train Taylor series or T4S model for PDE-constrained maps, where the Taylor derivative tensors are never formed densely and are instead learned from probes in compressed Tucker tensor train form (Alger et al., 22 Mar 2026).

A plausible implication is that “Taylor-TT” functions more as a family resemblance term than as a single formal designation. The recurring pattern is explicit higher-order local structure plus low-rank tensor organization.

2. Local Taylor polynomial embedding in tensor-train form

In the local-surrogate construction for quantum learning models, the starting point is a function $g(x)$ restricted to a local cube

$$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$

The patch is normalized by

$$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$

Assuming $g$ is $(p+1)$-times continuously differentiable on the patch, the construction uses the total-degree Taylor polynomial

$$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$

The Taylor truncation error is controlled by

$$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$

where

$B(x_0,r)$0

The paper also defines

$B(x_0,r)$1

These quantities separate locality, smoothness, and approximation order in a way that is explicit throughout the later TT analysis (Nair et al., 28 Apr 2026).

To make the Taylor polynomial TT-compatible, the coefficients are embedded into a full tensor-product feature space. For each coordinate,

$B(x_0,r)$2

and the tensor-product feature map is

$B(x_0,r)$3

The coefficient tensor $B(x_0,r)$4 is defined by zero-padding outside the simplex: $B(x_0,r)$5 Equivalently, using $B(x_0,r)$6,

$B(x_0,r)$7

This gives the exact identity

$B(x_0,r)$8

The Taylor problem is thereby converted into tensor approximation (Nair et al., 28 Apr 2026).

The TT stage approximates $B(x_0,r)$9 by a tensor $\chi$0 of TT rank at most $\chi$1. The TT representation is written as

$\chi$2

with

$\chi$3

The associated surrogate is

$\chi$4

The central deterministic certificate is

$\chi$5

where

$\chi$6

This isolates the two deterministic error sources: Taylor truncation and TT compression (Nair et al., 28 Apr 2026).

The same paper embeds this construction in empirical risk minimization. The constrained TT class is

$\chi$7

with canonical norm radius

$\chi$8

Its parameter count satisfies

$\chi$9

and the pseudo-dimension bound is

$g(x)$0

The paper’s interpretation is that the end-to-end local error splits into three independently controllable terms: Taylor truncation error, TT approximation error, and statistical estimation error (Nair et al., 28 Apr 2026).

3. Tucker tensor train Taylor series for implicitly defined maps

The T4S construction addresses a different regime: a high-dimensional map

$g(x)$1

where $g(x)$2 depends on the solution $g(x)$3 of a nonlinear state equation

$g(x)$4

The intended surrogate is the truncated Taylor series

$g(x)$5

with $g(x)$6 approximating the $g(x)$7-th derivative tensor. The obstacle is that $g(x)$8 is a $g(x)$9-way array of size

$$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$0

after discretization, and in the PDE setting only contractions against vectors are available. The construction therefore replaces each derivative tensor by a Tucker tensor train learned from probes rather than from entries (Alger et al., 22 Mar 2026).

The derivative tensors inherit the covariance-preconditioned structure

$$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$1

Before fitting the tensor network, the method performs derivative-based dimension reduction, building orthonormal bases

$$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$2

and defining the reduced map

$$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$3

The Tucker tensor trains are then fit to the reduced derivatives

$$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$4

This initial reduction is part of what makes the later tensor optimization manageable (Alger et al., 22 Mar 2026).

The derivative data are accessed through directionally symmetric probes such as

$$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$5

The paper emphasizes that these are cheaper than directionally asymmetric probes because the number of incremental linear solves depends on the multiplicity pattern of the directions. A key structural point is that the full derivative tensor is determined by its directionally symmetric probes, using multilinearity and polarization (Alger et al., 22 Mar 2026).

For each derivative order $$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$6, the fitting problem is posed as a nonlinear least-squares problem on the manifold $$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$7 of fixed-rank Tucker tensor trains: $$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$8 with

$$B(x_0,r):=\{x\in\mathbb{R}^N:\|x-x_0\|_\infty\le r\}.$$9

The optimization is performed by Riemannian methods inside a rank-continuation scheme. Tangent vectors are represented by gauged variations

$$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$0

subject to gauge conditions such as

$$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$1

The method is enabled by fast sweeping algorithms for the Riemannian Jacobian and its transpose. In effect, the paper replaces unavailable dense derivative tensors by a sequence of sweep-based contractions on a low-rank manifold (Alger et al., 22 Mar 2026).

The theoretical justification is tied to the spectrum of the covariance operator $$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$2. The main theorem states that for sufficiently smooth $$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$3 and Hilbert–Schmidt $$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$4, there exists a Tucker tensor train $$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$5 such that

$$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$6

where the $$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$7 depend on the spectral tail of $$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$8. For power-law covariance spectra $$\xi:=\frac{x-x_0}{r}\in[-1,1]^N, \qquad f(\xi):=g(x_0+r\xi).$$9, the paper further derives asymptotic rank/error bounds involving hyperbolic cross estimates. This links compressibility directly to covariance spectral decay (Alger et al., 22 Mar 2026).

The numerical evidence is organized around random tensors and nonlinear Poisson PDE examples. The reported findings are that both trust-region Riemannian Gauss–Newton and manifold Cauchy stochastic gradient descent can fit Tucker tensor trains accurately, rank continuation improves behavior as the model dimension increases, and the full T4S surrogate can match Taylor orders up to $g$0 or $g$1 depending on sample size in the PDE examples (Alger et al., 22 Mar 2026).

4. TT-native operations and geometry around Taylor-TT models

Once a function has been represented in TT form, other TT-native procedures become relevant. One such procedure is direct optimization of a TT tensor. Given a tensor

$g$2

the optimization algorithm optima_tt_max orthogonalizes the TT cores, interprets the squared entries as a probability distribution

$g$3

and then scans the train left to right, repeatedly multiplying by the next core, reshaping, and pruning to the top $g$4 candidates by row norm. The paper describes this as “sequential tensor multiplications of the TT-cores with an intelligent selection of candidates for the optimum,” and in practice as “a single pass over the tensor train.” Its complexity is

$g$5

The method is directly relevant to Taylor-TT surrogates because it allows extrema to be searched in the compressed representation without reconstructing the full tensor (Chertkov et al., 2022).

A second supporting development is the differential geometry of the TT-rank variety. For tensors of bounded TT rank, the Bouligand tangent cone at a tensor $g$6 is parametrized by a TT-structured block decomposition, and the cone is exactly the intersection of the tangent cones of the rank-constrained matricizations: $g$7 The paper also gives a retraction from the tangent bundle back to the TT variety that is easy to compose because it is built core by core. In a Taylor-style local method, this supplies the admissible first-order directions and a structured return map to the low-rank set (Kutschan, 2017).

A broader precursor is the TT response-surface construction for polynomial chaos expansions. There, the stochastic dependence of a PDE solution is represented on either sparse or full polynomial multi-index sets, and the coefficient tensors are recovered by block TT-cross from sampled entries and solved by the alternating minimal energy algorithm. The full tensor-product index set

$g$8

is kept feasible by TT compression, which the paper identifies as preferable when higher polynomial orders and higher accuracy are required (Dolgov et al., 2014).

Taken together, these works show that Taylor-TT constructions are not only approximation schemes. They sit inside a broader TT computational ecosystem consisting of optimization, tangent-cone geometry, low-rank interpolation, and alternating solvers.

5. Algebraic and categorical Taylor constructions carrying the same label

A different use of the label appears in commutative algebra. In the generalized Taylor resolution over a complete intersection, one starts with

$g$9

where $(p+1)$0 is generated by a regular sequence and each

$(p+1)$1

The classical Taylor resolution $(p+1)$2 of $(p+1)$3 over $(p+1)$4 has differential

$(p+1)$5

The paper defines explicit higher homotopies $(p+1)$6 on $(p+1)$7 by setting $(p+1)$8, defining $(p+1)$9 from the coefficients $$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$0 and ratios of least common multiples, and taking $$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$1 for $$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$2. The Eisenbud–Shamash construction then forms

$$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$3

yielding an $$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$4-free resolution $$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$5 of $$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$6. Here “Taylor-TT” refers to transporting the Taylor resolution to the complete-intersection setting while preserving its lcm-based combinatorics (Sobieska, 2022).

In category theory, the phrase appears in a still more abstract form. One paper defines a higher-order Taylor functor

$$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$7

whose components encode Taylor coefficients up to order $$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$8. The $$T_p(\xi):=\sum_{|\alpha|\le p}\frac{r^{|\alpha|}}{\alpha!}(\partial^\alpha g)(x_0)\,\xi^\alpha, \qquad \xi\in[-1,1]^N.$$9-th projection of $$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$0 is

$$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$1

The construction is functorial, forms a monad, and is interpreted as a categorical model of higher-order dual numbers and jet bundles (Walch, 13 Feb 2025).

A related differential-algebraic formulation studies generalized Taylor morphisms. For a differential ring $$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$2, a $$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$3-Taylor morphism assigns to each ring homomorphism $$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$4 a differential ring homomorphism $$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$5, functorially in $$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$6. The paper shows that the universal Taylor morphism is the right adjoint to a forgetful functor and realizes it concretely by twisting the Hurwitz series ring. Its twisted Hurwitz morphism is

$$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$7

with explicit coefficient formula

$$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$8

This is a Taylor construction in the sense of differential algebra rather than tensor compression (Ng, 2023).

These algebraic and categorical usages share the Taylor mechanism of explicit coefficient transport or compositional expansion, but they are not tensor-train constructions.

6. Other usages and common misconceptions

The term should not be conflated with several unrelated Taylor-based constructions. In plasma physics, an exact axisymmetric Taylor-state construction solves

$$\bigl|g(x_0+r\xi)-T_p(\xi)\bigr| \le \frac{C_{p+1}^{(x)}\,r^{p+1}\,N^{p+1}}{(p+1)!},$$9

by building the poloidal flux $B(x_0,r)$00 as a finite linear combination of exact separable solutions of

$B(x_0,r)$01

and then fitting the coefficients to geometric boundary constraints such as aspect ratio, elongation, triangularity, and possibly an X-point location. Its “Taylor” refers to Woltjer–Taylor relaxed states, not to tensor trains (Cerfon et al., 2014).

In data visualization, the kernelized Taylor diagram replaces standard deviation, Pearson correlation, and RMSE by the RKHS norm of the kernel mean embedding, the angle between embeddings, and the maximum mean discrepancy. Its basic identity is

$B(x_0,r)$02

which is the law of cosines in RKHS geometry. This is a Taylor-diagram extension rather than a Taylor-TT tensor method (Wickstrøm et al., 2022).

In fluid mechanics, Rayleigh–Taylor interface models describe unstable two-fluid dynamics through reduced equations such as

$B(x_0,r)$03

and the corresponding parameterized $B(x_0,r)$04-model for overturning interfaces. These are RT models; neither the notation nor the mechanism is a Taylor-TT construction (Granero-Belinchón et al., 2016).

The principal misconception is therefore terminological. “Taylor-TT” can denote a genuine tensor-network approximation scheme, an algebraic transport of the Taylor resolution, a categorical Taylor monad, or another Taylor-based construction whose acronym collides with “TT.” Their governing spaces, error mechanisms, and intended applications are different. Two uses are presently the most structurally developed in the tensor setting: the local Taylor polynomial embedded into a TT hypothesis class with explicit deterministic and statistical bounds (Nair et al., 28 Apr 2026), and the T4S framework in which derivative tensors of an implicitly defined map are learned in Tucker tensor train form from probe data (Alger et al., 22 Mar 2026).