mlsanityData to 7 Oct 2026

Multilinear Kernel Regression and Imputation via Manifold Learning

arXiv 2402.03648 ↗First posted 6 Feb 2024eess.SP cs.LGcited by 3

Not on the map. Why?

Abstract (arXiv)

This paper introduces a novel nonparametric framework for data imputation, coined multilinear kernel regression and imputation via the manifold assumption (MultiL-KRIM). Motivated by manifold learning, MultiL-KRIM models data features as a point cloud located in or close to a user-unknown smooth manifold embedded in a reproducing kernel Hilbert space. Unlike typical manifold-learning routes, which seek low-dimensional patterns via regularizers based on graph-Laplacian matrices, MultiL-KRIM builds instead on the intuitive concept of tangent spaces to manifolds and incorporates collaboration among point-cloud neighbors (regressors) directly into the data-modeling term of the loss function. Multiple kernel functions are allowed to offer robustness and rich approximation properties, while multiple matrix factors offer low-rank modeling, integrate dimensionality reduction, and streamline computations with no need of training data. Two important application domains showcase the functionality of MultiL-KRIM: time-varying-graph-signal (TVGS) recovery, and reconstruction of highly accelerated dynamic-magnetic-resonance-imaging (dMRI) data. Extensive numerical tests on real and synthetic data demonstrate MultiL-KRIM's remarkable speedups over its predecessors, and outperformance over prevalent "shallow" data-imputation techniques, with a more intuitive and explainable pipeline than deep-image-prior methods.

Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 31 of its 122 references that are in the map. First posted on arXiv 6 Feb 2024.

Builds on

31 of 122 references.

References · 31

  1. 2015U-Net: Convolutional Networks for Biomedical Image Segmentationcited by 19,604
  2. 2017Deep Image Priorcited by 1,097
  3. 2017Graph Signal Processing: Overview, Challenges and Applicationscited by 409
  4. 2019Implicit Regularization in Deep Matrix Factorizationcited by 402
  5. 2017Implicit Regularization in Matrix Factorizationcited by 318
  6. 2019On instabilities of deep learning in image reconstruction - Does AI come at a cost?cited by 211
  7. 2018Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overviewcited by 159
  8. 2016Tensor Ring Decompositioncited by 125
  9. 2020Neural Collaborative Filtering vs. Matrix Factorization Revisitedcited by 123
  10. 2019Deep Learning Methods for Parallel Magnetic Resonance Image Reconstructioncited by 81
  11. 2019Time-Dependent Deep Image Prior for Dynamic MRIcited by 70
  12. 2015Complete Dictionary Recovery over the Sphere I: Overview and the Geometric Picturecited by 49
19 more
  1. 2019Low-Rank Matrix Completion: A Contemporary Surveycited by 43
  2. 2020Compressive sensing with un-trained neural networks: Gradient descent finds the smoothest approximationcited by 39
  3. 2019Nonconvex Low-Rank Tensor Completion from Noisy Datacited by 35
  4. 2014Matrix Completion on Graphscited by 26
  5. 2014Signal Recovery on Graphs: Variation Minimizationcited by 26
  6. 2015Complete Dictionary Recovery over the Sphere II: Recovery by Riemannian Trust-region Methodcited by 24
  7. 2020Graph Signal Processing for Geometric Data and Beyond: Theory and Applicationscited by 23
  8. 2022Reconstruction of Time-varying Graph Signals via Sobolev Smoothnesscited by 18
  9. 2021Dynamic imaging using a deep generative SToRM (Gen-SToRM) modelcited by 17
  10. 2021Untrained Graph Neural Networks for Denoisingcited by 15
  11. 2016Kernel-based Reconstruction of Space-time Functions on Dynamic Graphscited by 12
  12. 2020Kernel-based Graph Learning from Smooth Signals: A Functional Viewpointcited by 12
  13. 2021Grid-Graph Signal Processing (Grid-GSP): A Graph Signal Processing Framework for the Power Gridcited by 12
  14. 2013Nonparametric Basis Pursuit via Sparse Kernel-based Learningcited by 6
  15. 2014Parallel Selective Algorithms for Big Data Optimizationcited by 6
  16. 2016Fej'er-monotone hybrid steepest descent method for affinely constrained and composite convex minimization taskscited by 6
  17. 2018A Comparative Study of Pairwise Learning Methods based on Kernel Ridge Regressioncited by 3
  18. 2018Bi-Linear Modeling of Data Manifolds for Dynamic-MRI Recoverycited by 3
  19. 2018Matrix completion and extrapolation via kernel regressioncited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 1; 2026: 1.

3 papers.