ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “tensor completion”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

stat.MLcs.ITcs.LGEmpiricalRecentAug 4, 2026

Robust Low-Tubal-Rank Tensor Completion under Cross-Concentrated Sampling

Hanqin Cai, Longxiu Huang, Jing Qin, Chengyue Wu

This paper proposes Robust Iterative t-CUR (R-ItCUR), a tensor-native algorithm for robust recovery of low-rank tensors from partial observations contaminated with sparse outliers using tensor cross-c…

View →
cs.LGcs.AIRecentJun 1, 2026

TN-SHAP-G: Graph-Structured Tensor Network Surrogates for Shapley Values and Interactions

Farzaneh Heidari, Guillaume Rabusseau

The paper introduces TN-SHAP-G, a novel framework that uses graph-structured tensor networks to efficiently approximate and compute Shapley values and interaction indices for black-box models, overcom…

View →
cs.LGmath.PRstat.MLTheoreticalRecentJul 7, 2026

Quantitative Gaussian-Process limits of Tensor Programs

Andrea Agazzi, Eloy Mosig García, Dario Trevisan

This paper provides explicit error bounds for the infinite-width Gaussian-process limit of random neural networks using tensor programs and quantitative convergence theory in Wasserstein distance.

View →
stat.MLcs.LGTheoreticalRecentOct 11, 2026

Minimax Rates and Improved Spectral Convergence for Multi-Manifold Clustering

Haoyu Chen, Chenghui Li

The paper studies eigenpair estimation for the tensorized Laplace--Beltrami operator from multi-manifold mixture data.

View →
cs.LGcs.AIEmpiricalRecentJul 9, 2026

SLORR: Simple and Efficient In-Training Low-Rank Regularization

David González-Martínez, Shiwei Liu

The paper introduces SLORR, a simple and stateless framework for in-training low-rank regularization of neural networks using two variants based on the Hoyer sparsity metric and the nuclear norm.

View →
stat.MLcs.LGmath.PRTheoreticalRecentJul 7, 2026

A Convex Approximation Framework for Neural Likelihood-Based Bayesian Inverse Problems

Fabian Schneider, Tapio Helin, Leila Taghizadeh

This paper improves the foundations of neural likelihood approximation for Bayesian inverse problems by making the learning problem strictly convex and showing convergence to the true likelihood.

View →
cs.SEcs.AIcs.PLEmpiricalRecentAug 3, 2026

Lossless Tensor Compression as Program Synthesis

Jieke Shi, Junda He, Wenjia Jiang, Weifeng Sun +10 more

Brevis compresses model checkpoints by synthesizing self-contained DSL programs that reconstruct tensors bit-exactly, reducing storage requirements and achieving high compression and decompression spe…

View →
stat.MLcs.LGstat.MEEmpiricalRecentJun 16, 2026

Tensor-based second-order causal discovery

Nathan Ouyang, Kexin Wan, Anna Seigal

This paper proposes an algorithm called Tensor-based Second-order Causal Discovery (TSCD) to uncover causal dependencies among variables.

View →
math.NAcs.ITEmpiricalRecentOct 25, 2026

Dynamics-Aware Sampling and Recovery for Tensor-Valued Dynamical Systems

Seok-Young Chung, Longxiu Huang, Yisen Wang

The paper studies sampling and recovery for tensor-valued dynamical systems using partial spatial observations over time.

View →
cs.LGcs.AIRecentMay 28, 2026

Automatically Differentiable Nonlinear Tensor Networks (ADNTNs) for Exponential Compression of Deep Neural Networks

Andrzej Cichocki, Michal Wietczak

The paper introduces Automatically Differentiable Nonlinear Tensor Networks (ADNTNs) to achieve massive, structured compression of deep neural networks, demonstrating compression ratios up to 77,000x…

View →
cs.CVRecentJun 1, 2026

VISReg: Variance-Invariance-Sketching Regularization for JEPA training

Haiyu Wu, Randall Balestriero, Morgan Levine

VISReg introduces a novel regularization technique that combines variance control with a Sliced-Wasserstein-based sketching objective to stabilize self-supervised learning, achieving state-of-the-art…

View →
eess.SPeess.IVTheoreticalRecentAug 10, 2026

Unrolling a Graph-Laplacian Denoiser Realizes Only Compositions of Polynomial Graph Filters

Seyed Alireza Hosseini

This paper constructs a graph-based image restoration system using unrolled networks and shows that the learned steps select an element of a Krylov subspace, constraining the hypothesis space.

View →
math.STcs.CCcs.DSRecentMay 28, 2026

Low-degree estimation thresholds in planted hypergraphs and tensor PCA

Daniel Fu, Youngtak Sohn

The paper analyzes low-degree estimation thresholds for recovering hidden signals in planted hypergraphs and tensor PCA, establishing sharp phase transitions and providing polynomial-time recovery alg…

View →
cs.LGRecentJun 1, 2026

Riemannian Gradient Descent for Low-Rank Architectures

Nicholas Knight

The paper investigates applying Riemannian optimization techniques to low-rank matrix parameters for deep learning, but finds that the proposed methods do not conclusively outperform the AdamW baselin…

View →
cs.DSTheoreticalRecentJun 10, 2026

Beyond Frequency Marching: Orbit Recovery in Dihedral and Projected Multireference Alignment

Tait Weicht, Alexander S. Wein

This paper presents the first polynomial-time algorithms for two variants of multireference alignment.

View →