{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:XMCSSPUZRQHQXZ7AUGL6VKV7SF","short_pith_number":"pith:XMCSSPUZ","schema_version":"1.0","canonical_sha256":"bb05293e998c0f0be7e0a197eaaabf9174cbe45cb2a2279574d8c35d26305792","source":{"kind":"arxiv","id":"1703.05038","version":2},"attestation_state":"computed","paper":{"title":"Harmonic Mean Iteratively Reweighted Least Squares for Low-Rank Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"math.NA","authors_text":"Christian K\\\"ummerle, Juliane Sigl","submitted_at":"2017-03-15T09:26:52Z","abstract_excerpt":"We propose a new iteratively reweighted least squares (IRLS) algorithm for the recovery of a matrix $X \\in \\mathbb{C}^{d_1\\times d_2}$ of rank $r \\ll\\min(d_1,d_2)$ from incomplete linear observations, solving a sequence of low complexity linear problems. The easily implementable algorithm, which we call harmonic mean iteratively reweighted least squares (HM-IRLS), optimizes a non-convex Schatten-$p$ quasi-norm penalization to promote low-rankness and carries three major strengths, in particular for the matrix completion setting. First, we observe a remarkable global convergence behavior of the"},"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":"1703.05038","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-03-15T09:26:52Z","cross_cats_sorted":["cs.IT","math.IT","math.OC"],"title_canon_sha256":"2717fc2a54882ad8e65c4960c88fd52a14cdc99cfcea6a647eea0226f0d95c5d","abstract_canon_sha256":"5ea92241178d00f8c7b077bad804606ff7c36ebeefc85fb1d0e5629f84c57cd4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:29.442701Z","signature_b64":"kU1eK6wKy8HKa0QDbPsZdHfpvC5/t3RJy9ovLHFT77Iu6YZZJmpd56etCR19sPFVaoJNuDcyadsr5b8aiUydDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb05293e998c0f0be7e0a197eaaabf9174cbe45cb2a2279574d8c35d26305792","last_reissued_at":"2026-05-18T00:22:29.442038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:29.442038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Harmonic Mean Iteratively Reweighted Least Squares for Low-Rank Matrix Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.OC"],"primary_cat":"math.NA","authors_text":"Christian K\\\"ummerle, Juliane Sigl","submitted_at":"2017-03-15T09:26:52Z","abstract_excerpt":"We propose a new iteratively reweighted least squares (IRLS) algorithm for the recovery of a matrix $X \\in \\mathbb{C}^{d_1\\times d_2}$ of rank $r \\ll\\min(d_1,d_2)$ from incomplete linear observations, solving a sequence of low complexity linear problems. The easily implementable algorithm, which we call harmonic mean iteratively reweighted least squares (HM-IRLS), optimizes a non-convex Schatten-$p$ quasi-norm penalization to promote low-rankness and carries three major strengths, in particular for the matrix completion setting. First, we observe a remarkable global convergence behavior of the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05038","kind":"arxiv","version":2},"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":"1703.05038","created_at":"2026-05-18T00:22:29.442137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05038v2","created_at":"2026-05-18T00:22:29.442137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05038","created_at":"2026-05-18T00:22:29.442137+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMCSSPUZRQHQ","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMCSSPUZRQHQXZ7A","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMCSSPUZ","created_at":"2026-05-18T12:31:56.362134+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF","json":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF.json","graph_json":"https://pith.science/api/pith-number/XMCSSPUZRQHQXZ7AUGL6VKV7SF/graph.json","events_json":"https://pith.science/api/pith-number/XMCSSPUZRQHQXZ7AUGL6VKV7SF/events.json","paper":"https://pith.science/paper/XMCSSPUZ"},"agent_actions":{"view_html":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF","download_json":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF.json","view_paper":"https://pith.science/paper/XMCSSPUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05038&json=true","fetch_graph":"https://pith.science/api/pith-number/XMCSSPUZRQHQXZ7AUGL6VKV7SF/graph.json","fetch_events":"https://pith.science/api/pith-number/XMCSSPUZRQHQXZ7AUGL6VKV7SF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/action/storage_attestation","attest_author":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/action/author_attestation","sign_citation":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/action/citation_signature","submit_replication":"https://pith.science/pith/XMCSSPUZRQHQXZ7AUGL6VKV7SF/action/replication_record"}},"created_at":"2026-05-18T00:22:29.442137+00:00","updated_at":"2026-05-18T00:22:29.442137+00:00"}