{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:N6UPRU2ULILVL2CFI7ZGQVRGN6","short_pith_number":"pith:N6UPRU2U","schema_version":"1.0","canonical_sha256":"6fa8f8d3545a1755e84547f26856266fb40bf17991118670c1a74f846739aa00","source":{"kind":"arxiv","id":"2104.12031","version":4},"attestation_state":"computed","paper":{"title":"Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","math.OC","stat.ME"],"primary_cat":"stat.ML","authors_text":"Anru R. Zhang, Yuetian Luo","submitted_at":"2021-04-24T22:24:14Z","abstract_excerpt":"In this paper, we consider the estimation of a low Tucker rank tensor from a number of noisy linear measurements. The general problem covers many specific examples arising from applications, including tensor regression, tensor completion, and tensor PCA/SVD. We consider an efficient Riemannian Gauss-Newton (RGN) method for low Tucker rank tensor estimation. Different from the generic (super)linear convergence guarantee of RGN in the literature, we prove the first local quadratic convergence guarantee of RGN for low-rank tensor estimation in the noisy setting under some regularity conditions an"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2104.12031","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2021-04-24T22:24:14Z","cross_cats_sorted":["cs.LG","cs.NA","math.NA","math.OC","stat.ME"],"title_canon_sha256":"7425b226948b413cdd369984b75275ad9a591389a83b76383a01d095918cd9c0","abstract_canon_sha256":"c415f336f5f588f6ac6a6db0e51e42950869e9749cf6f8b6079ff9713e4aa1bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:28:50.764622Z","signature_b64":"TPkS5kutjV1rtoTBME9+rTUx0W2AzSRpFTichd6aL+LnQP6tWvB7F61/H7rPDFr4h+Nyk79RTO0hA919ErO0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fa8f8d3545a1755e84547f26856266fb40bf17991118670c1a74f846739aa00","last_reissued_at":"2026-07-05T06:28:50.764040Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:28:50.764040Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Low-rank Tensor Estimation via Riemannian Gauss-Newton: Statistical Optimality and Second-Order Convergence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","cs.NA","math.NA","math.OC","stat.ME"],"primary_cat":"stat.ML","authors_text":"Anru R. Zhang, Yuetian Luo","submitted_at":"2021-04-24T22:24:14Z","abstract_excerpt":"In this paper, we consider the estimation of a low Tucker rank tensor from a number of noisy linear measurements. The general problem covers many specific examples arising from applications, including tensor regression, tensor completion, and tensor PCA/SVD. We consider an efficient Riemannian Gauss-Newton (RGN) method for low Tucker rank tensor estimation. Different from the generic (super)linear convergence guarantee of RGN in the literature, we prove the first local quadratic convergence guarantee of RGN for low-rank tensor estimation in the noisy setting under some regularity conditions an"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.12031","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2104.12031/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2104.12031","created_at":"2026-07-05T06:28:50.764101+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.12031v4","created_at":"2026-07-05T06:28:50.764101+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.12031","created_at":"2026-07-05T06:28:50.764101+00:00"},{"alias_kind":"pith_short_12","alias_value":"N6UPRU2ULILV","created_at":"2026-07-05T06:28:50.764101+00:00"},{"alias_kind":"pith_short_16","alias_value":"N6UPRU2ULILVL2CF","created_at":"2026-07-05T06:28:50.764101+00:00"},{"alias_kind":"pith_short_8","alias_value":"N6UPRU2U","created_at":"2026-07-05T06:28:50.764101+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.16032","citing_title":"A Scalable Factorization Approach for High-Order Structured Tensor Recovery","ref_index":66,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/N6UPRU2ULILVL2CFI7ZGQVRGN6","json":"https://pith.science/pith/N6UPRU2ULILVL2CFI7ZGQVRGN6.json","graph_json":"https://pith.science/api/pith-number/N6UPRU2ULILVL2CFI7ZGQVRGN6/graph.json","events_json":"https://pith.science/api/pith-number/N6UPRU2ULILVL2CFI7ZGQVRGN6/events.json","paper":"https://pith.science/paper/N6UPRU2U"},"agent_actions":{"view_html":"https://pith.science/pith/N6UPRU2ULILVL2CFI7ZGQVRGN6","download_json":"https://pith.science/pith/N6UPRU2ULILVL2CFI7ZGQVRGN6.json","view_paper":"https://pith.science/paper/N6UPRU2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.12031&json=true","fetch_graph":"https://pith.science/api/pith-number/N6UPRU2ULILVL2CFI7ZGQVRGN6/graph.json","fetch_events":"https://pith.science/api/pith-number/N6UPRU2ULILVL2CFI7ZGQVRGN6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N6UPRU2ULILVL2CFI7ZGQVRGN6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N6UPRU2ULILVL2CFI7ZGQVRGN6/action/storage_attestation","attest_author":"https://pith.science/pith/N6UPRU2ULILVL2CFI7ZGQVRGN6/action/author_attestation","sign_citation":"https://pith.science/pith/N6UPRU2ULILVL2CFI7ZGQVRGN6/action/citation_signature","submit_replication":"https://pith.science/pith/N6UPRU2ULILVL2CFI7ZGQVRGN6/action/replication_record"}},"created_at":"2026-07-05T06:28:50.764101+00:00","updated_at":"2026-07-05T06:28:50.764101+00:00"}