Pith. sign in

REVIEW 5 cited by

Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Data

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2408.05677 v1 pith:RWDJBTTN submitted 2024-08-11 math.NA cs.LGcs.NA

Brett W. Larsen , Tamara G. Kolda , Anru R. Zhang , Alex H. Williams This is my paper · ORCID
classification math.NAcs.LGcs.NA
keywords datatensorcp-hifidecompositionmodesrkhssomevectors
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The canonical polyadic (CP) tensor decomposition decomposes a multidimensional data array into a sum of outer products of finite-dimensional vectors. Instead, we can replace some or all of the vectors with continuous functions (infinite-dimensional vectors) from a reproducing kernel Hilbert space (RKHS). We refer to tensors with some infinite-dimensional modes as quasitensors, and the approach of decomposing a tensor with some continuous RKHS modes is referred to as CP-HiFi (hybrid infinite and finite dimensional) tensor decomposition. An advantage of CP-HiFi is that it can enforce smoothness in the infinite dimensional modes. Further, CP-HiFi does not require the observed data to lie on a regular and finite rectangular grid and naturally incorporates misaligned data. We detail the methodology and illustrate it on a synthetic example.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Kernel Regression with Tensor Trains and Hadamard Overparameterization

    stat.ML 2026-07 conditional novelty 6.0 of 10

    KReTTaH jointly learns kernel covariance matrices and fixed-rank tensor-train regression coefficients on a Riemannian product manifold, and reports state-of-the-art imputation accuracy on 4D fMRI and dynamic edge-flow data.

  2. A functional tensor model for dynamic multilayer networks with common invariant subspaces and the RKHS estimation

    stat.ME 2025-09 unverdicted novelty 6.0 of 10

    A functional tensor model with common invariant subspaces and RKHS estimation for analyzing dynamic multilayer networks, applied to bike-share and food-trade data.

  3. Smooth tensor decomposition with application to ambulatory blood pressure monitoring data

    stat.ME 2025-07 conditional novelty 6.0 of 10

    SmoothHOOI, a Tucker tensor decomposition with temporal smoothing and missing-data support, recovers circadian patterns and detects an association between OSA severity and overall blood pressure and heart rate levels ...

  4. Spectral Embedding via Chebyshev Bases for Robust DeepONet Approximation

    cs.LG 2025-12 conditional novelty 5.0 of 10

    Replacing the coordinate-input trunk of a DeepONet with a fixed Chebyshev polynomial dictionary lowers reported reconstruction error on bounded non-periodic PDE benchmarks.

  5. Kernel manifolds: nonlinear-augmentation dimensionality reduction using reproducing kernel Hilbert spaces

    cs.CE 2025-08 conditional novelty 5.0 of 10

    The paper introduces kernel manifold dimension reduction, where a learned kernel interpolant corrects linear POD reconstructions, generalizing quadratic manifolds.

Pith tools