{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6XJE3EQM46A6MIQWHGT6CYGIRB","short_pith_number":"pith:6XJE3EQM","schema_version":"1.0","canonical_sha256":"f5d24d920ce781e6221639a7e160c8887727e7ea069578b417ac362c1ddb340d","source":{"kind":"arxiv","id":"2504.13633","version":2},"attestation_state":"computed","paper":{"title":"Efficient algorithms for the Hadamard decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arnaud Vandaele, Nicolas Gillis, Samuel Wertz","submitted_at":"2025-04-18T11:14:25Z","abstract_excerpt":"The Hadamard decomposition is a powerful technique for data analysis and matrix compression, which decomposes a given matrix into the element-wise product of two or more low-rank matrices. In this paper, we develop an efficient algorithm to solve this problem, leveraging an alternating optimization approach that decomposes the global non-convex problem into a series of convex sub-problems. To improve performance, we explore advanced initialization strategies inspired by the singular value decomposition (SVD) and incorporate acceleration techniques by introducing momentum-based updates. Beyond "},"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":"2504.13633","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-04-18T11:14:25Z","cross_cats_sorted":["eess.SP","math.OC","stat.ML"],"title_canon_sha256":"b3c2c0107ee84b5e9cd877c532414ccd7d625cc763eb62571f9dd853e765f96f","abstract_canon_sha256":"e947671a03a407455c6b968a58c882c90fadc29c4e8ef908a277b5065b8fd272"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:52:23.043549Z","signature_b64":"Opa7+A/+cV373QwhBndWJr4wd/iuYQSh9Ny2RdMOnTbUDn2m3/RQPQYN/wAfzBaEFLEsJ4teKSXcZ2FLxQkzDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f5d24d920ce781e6221639a7e160c8887727e7ea069578b417ac362c1ddb340d","last_reissued_at":"2026-07-05T10:52:23.043073Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:52:23.043073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient algorithms for the Hadamard decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP","math.OC","stat.ML"],"primary_cat":"cs.LG","authors_text":"Arnaud Vandaele, Nicolas Gillis, Samuel Wertz","submitted_at":"2025-04-18T11:14:25Z","abstract_excerpt":"The Hadamard decomposition is a powerful technique for data analysis and matrix compression, which decomposes a given matrix into the element-wise product of two or more low-rank matrices. In this paper, we develop an efficient algorithm to solve this problem, leveraging an alternating optimization approach that decomposes the global non-convex problem into a series of convex sub-problems. To improve performance, we explore advanced initialization strategies inspired by the singular value decomposition (SVD) and incorporate acceleration techniques by introducing momentum-based updates. Beyond "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.13633","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.13633/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":"2504.13633","created_at":"2026-07-05T10:52:23.043132+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.13633v2","created_at":"2026-07-05T10:52:23.043132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.13633","created_at":"2026-07-05T10:52:23.043132+00:00"},{"alias_kind":"pith_short_12","alias_value":"6XJE3EQM46A6","created_at":"2026-07-05T10:52:23.043132+00:00"},{"alias_kind":"pith_short_16","alias_value":"6XJE3EQM46A6MIQW","created_at":"2026-07-05T10:52:23.043132+00:00"},{"alias_kind":"pith_short_8","alias_value":"6XJE3EQM","created_at":"2026-07-05T10:52:23.043132+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.04584","citing_title":"Variable Smoothing for Weakly Convex Problems with Non-Euclidean Directions","ref_index":37,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6XJE3EQM46A6MIQWHGT6CYGIRB","json":"https://pith.science/pith/6XJE3EQM46A6MIQWHGT6CYGIRB.json","graph_json":"https://pith.science/api/pith-number/6XJE3EQM46A6MIQWHGT6CYGIRB/graph.json","events_json":"https://pith.science/api/pith-number/6XJE3EQM46A6MIQWHGT6CYGIRB/events.json","paper":"https://pith.science/paper/6XJE3EQM"},"agent_actions":{"view_html":"https://pith.science/pith/6XJE3EQM46A6MIQWHGT6CYGIRB","download_json":"https://pith.science/pith/6XJE3EQM46A6MIQWHGT6CYGIRB.json","view_paper":"https://pith.science/paper/6XJE3EQM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.13633&json=true","fetch_graph":"https://pith.science/api/pith-number/6XJE3EQM46A6MIQWHGT6CYGIRB/graph.json","fetch_events":"https://pith.science/api/pith-number/6XJE3EQM46A6MIQWHGT6CYGIRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6XJE3EQM46A6MIQWHGT6CYGIRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6XJE3EQM46A6MIQWHGT6CYGIRB/action/storage_attestation","attest_author":"https://pith.science/pith/6XJE3EQM46A6MIQWHGT6CYGIRB/action/author_attestation","sign_citation":"https://pith.science/pith/6XJE3EQM46A6MIQWHGT6CYGIRB/action/citation_signature","submit_replication":"https://pith.science/pith/6XJE3EQM46A6MIQWHGT6CYGIRB/action/replication_record"}},"created_at":"2026-07-05T10:52:23.043132+00:00","updated_at":"2026-07-05T10:52:23.043132+00:00"}