{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:LRBM7YYAL4GYHOL7JEKFOJ4UJV","short_pith_number":"pith:LRBM7YYA","schema_version":"1.0","canonical_sha256":"5c42cfe3005f0d83b97f49145727944d44bef5d08a94a39144e3dfb4a936a91c","source":{"kind":"arxiv","id":"1610.09322","version":4},"attestation_state":"computed","paper":{"title":"Homotopy Analysis for Tensor PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Anima Anandkumar, Hossein Mobahi, Rong Ge, Yuan Deng","submitted_at":"2016-10-28T17:24:45Z","abstract_excerpt":"Developing efficient and guaranteed nonconvex algorithms has been an important challenge in modern machine learning. Algorithms with good empirical performance such as stochastic gradient descent often lack theoretical guarantees. In this paper, we analyze the class of homotopy or continuation methods for global optimization of nonconvex functions. These methods start from an objective function that is efficient to optimize (e.g. convex), and progressively modify it to obtain the required objective, and the solutions are passed along the homotopy path. For the challenging problem of tensor PCA"},"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":"1610.09322","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-10-28T17:24:45Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"58c99009589f79a0e527cb473978793ad49042260965942e25e81fc9bcb15217","abstract_canon_sha256":"2b2e778cfa3eeb4cce2c410407b335c48789d6e701c41137a4f6a332b555f1e2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:23.753861Z","signature_b64":"06CcIMDIaSyswQdAP4Un7QGWxvI4tkl0ZC4TVLeo5a9BmtZ+AL1pPAAjUwssetKib17IMW+Yn8KePt0w1yAxDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c42cfe3005f0d83b97f49145727944d44bef5d08a94a39144e3dfb4a936a91c","last_reissued_at":"2026-05-18T00:42:23.753378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:23.753378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Homotopy Analysis for Tensor PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Anima Anandkumar, Hossein Mobahi, Rong Ge, Yuan Deng","submitted_at":"2016-10-28T17:24:45Z","abstract_excerpt":"Developing efficient and guaranteed nonconvex algorithms has been an important challenge in modern machine learning. Algorithms with good empirical performance such as stochastic gradient descent often lack theoretical guarantees. In this paper, we analyze the class of homotopy or continuation methods for global optimization of nonconvex functions. These methods start from an objective function that is efficient to optimize (e.g. convex), and progressively modify it to obtain the required objective, and the solutions are passed along the homotopy path. For the challenging problem of tensor PCA"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.09322","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":""},"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":"1610.09322","created_at":"2026-05-18T00:42:23.753466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.09322v4","created_at":"2026-05-18T00:42:23.753466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.09322","created_at":"2026-05-18T00:42:23.753466+00:00"},{"alias_kind":"pith_short_12","alias_value":"LRBM7YYAL4GY","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"LRBM7YYAL4GYHOL7","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"LRBM7YYA","created_at":"2026-05-18T12:30:29.479603+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"1907.11636","citing_title":"Notes on Computational Hardness of Hypothesis Testing: Predictions using the Low-Degree Likelihood Ratio","ref_index":2,"is_internal_anchor":true},{"citing_arxiv_id":"2605.16520","citing_title":"Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LRBM7YYAL4GYHOL7JEKFOJ4UJV","json":"https://pith.science/pith/LRBM7YYAL4GYHOL7JEKFOJ4UJV.json","graph_json":"https://pith.science/api/pith-number/LRBM7YYAL4GYHOL7JEKFOJ4UJV/graph.json","events_json":"https://pith.science/api/pith-number/LRBM7YYAL4GYHOL7JEKFOJ4UJV/events.json","paper":"https://pith.science/paper/LRBM7YYA"},"agent_actions":{"view_html":"https://pith.science/pith/LRBM7YYAL4GYHOL7JEKFOJ4UJV","download_json":"https://pith.science/pith/LRBM7YYAL4GYHOL7JEKFOJ4UJV.json","view_paper":"https://pith.science/paper/LRBM7YYA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.09322&json=true","fetch_graph":"https://pith.science/api/pith-number/LRBM7YYAL4GYHOL7JEKFOJ4UJV/graph.json","fetch_events":"https://pith.science/api/pith-number/LRBM7YYAL4GYHOL7JEKFOJ4UJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LRBM7YYAL4GYHOL7JEKFOJ4UJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LRBM7YYAL4GYHOL7JEKFOJ4UJV/action/storage_attestation","attest_author":"https://pith.science/pith/LRBM7YYAL4GYHOL7JEKFOJ4UJV/action/author_attestation","sign_citation":"https://pith.science/pith/LRBM7YYAL4GYHOL7JEKFOJ4UJV/action/citation_signature","submit_replication":"https://pith.science/pith/LRBM7YYAL4GYHOL7JEKFOJ4UJV/action/replication_record"}},"created_at":"2026-05-18T00:42:23.753466+00:00","updated_at":"2026-05-18T00:42:23.753466+00:00"}