atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Non-Convex Tensor Recovery from Tube-Wise Sensing

NeurIPS 2025 · Learning theory and algorithms › Matrix and tensor methods · approach: Nonconvex low-rank and sparse optimization · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's abstract only. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes a tube-wise local tensor compressed sensing model and recovers low-rank tensors by minimizing a non-convex Burer–Monteiro factorized objective via gradient descent with spectral initialization, with a proof of exact recovery.

Problem

Recovering a low-rank third-order tensor from measurements when sensing operators are applied independently to each tube of the tensor.

Approach

Replaces global tensor sensing with tube-wise local sensing operators and solves the resulting problem with a Burer–Monteiro non-convex factorization optimized by gradient descent from spectral initialization, rather than convex nuclear-norm relaxation.

Key results

Limitations

Experimental setup

Builds on: Burer–Monteiro factorization tensor compressed sensing

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy