{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/exact-low-tubal-rank-tensor-recovery-from","title":"Exact Low Tubal Rank Tensor Recovery from Gaussian Measurements","arxiv_id":"1806.02511","date":"2018-06-07","proceeding":null,"authors":["Canyi Lu","Jiashi Feng","Zhouchen Lin","Shuicheng Yan"],"abstract":"The recent proposed Tensor Nuclear Norm (TNN) [Lu et al., 2016; 2018a] is an\ninteresting convex penalty induced by the tensor SVD [Kilmer and Martin, 2011].\nIt plays a similar role as the matrix nuclear norm which is the convex\nsurrogate of the matrix rank. Considering that the TNN based Tensor Robust PCA\n[Lu et al., 2018a] is an elegant extension of Robust PCA with a similar tight\nrecovery bound, it is natural to solve other low rank tensor recovery problems\nextended from the matrix cases. However, the extensions and proofs are\ngenerally tedious. The general atomic norm provides a unified view of\nlow-complexity structures induced norms, e.g., the $\\ell_1$-norm and nuclear\nnorm. The sharp estimates of the required number of generic measurements for\nexact recovery based on the atomic norm are known in the literature. In this\nwork, with a careful choice of the atomic set, we prove that TNN is a special\natomic norm. Then by computing the Gaussian width of certain cone which is\nnecessary for the sharp estimate, we achieve a simple bound for guaranteed low\ntubal rank tensor recovery from Gaussian measurements. Specifically, we show\nthat by solving a TNN minimization problem, the underlying tensor of size\n$n_1\\times n_2\\times n_3$ with tubal rank $r$ can be exactly recovered when the\ngiven number of Gaussian measurements is $O(r(n_1+n_2-r)n_3)$. It is order\noptimal when comparing with the degrees of freedom $r(n_1+n_2-r)n_3$. Beyond\nthe Gaussian mapping, we also give the recovery guarantee of tensor completion\nbased on the uniform random mapping by TNN minimization. Numerical experiments\nverify our theoretical results.","url_abs":"http://arxiv.org/abs/1806.02511v1","url_pdf":"http://arxiv.org/pdf/1806.02511v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"exact-low-tubal-rank-tensor-recovery-from","repo_url":"https://github.com/canyilu/tensor-completion-tensor-recovery","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[],"methods":[{"method_slug":"pca","method_name":"PCA"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1806.02511","atlas_url":"https://app.syntology.ai/?focus=1806.02511","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1806.02511"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1806.02511\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1806.02511"},"call":"get_concepts_for_paper(arxiv_id=\"1806.02511\")"}],"by_repo":[{"repo":"canyilu/tensor-completion-tensor-recovery","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"6427f1e9e4fc18502011af6c47d758fa51f7d3696081fd002c3c94a5a370efc0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}