arXiv (All)
open access
Robust Tensor Completion via Reflective Convolution Nuclear Norm Minimization
Robust tensor completion recovers multidimensional data from partial observations corrupted by sparse gross errors. Existing convolutional low-rank models typically construct translated copies using circular continuation, which introduces artificial wrap-around neighborhoods for finite nonperiodic d
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Casewise and Cellwise Robust Tensor-on-Tensor Regression#1156310
- Identifiability of Nonnegative Tensor Decompositions via Positive Scattering#673526
- Orthogonal JEPA: Factorized Predictive States for Latent World Models#471241
- Towards Robust Time Series Learning via Capacity-Centric Modulation#1144456
- Comparison between Supervised and Unsupervised Learning in Deep Unfolded Sparse Signal Recovery#160946
Record · ID 1200630
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive