{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TVHECAQDUZNV4I75C5K43XTQKV","short_pith_number":"pith:TVHECAQD","schema_version":"1.0","canonical_sha256":"9d4e410203a65b5e23fd1755cdde70555f442e12837b4690b78ddf724515c8a9","source":{"kind":"arxiv","id":"1507.04721","version":2},"attestation_state":"computed","paper":{"title":"On Accelerating the Regularized Alternating Least Square Algorithm for Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Carmeliza Navasca, Stefan Kindermann, Xiaofei Wang","submitted_at":"2015-07-16T19:32:57Z","abstract_excerpt":"In this paper, we discuss the acceleration of the regularized alternating least square (RALS) algorithm for tensor approximation. We propose a fast iterative method using a Aitken-Stefensen like updates for the regularized algorithm. Through numerical experiments, the fast algorithm demonstrate a faster convergence rate for the accelerated version in comparison to both the standard and regularized alternating least squares algorithms. In addition, we analyze the global convergence based on the Kurdyka- Lojasiewicz inequality as well as show that the RALS algorithm has a linear local convergenc"},"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":"1507.04721","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2015-07-16T19:32:57Z","cross_cats_sorted":[],"title_canon_sha256":"dc9004d9d7f270d264d8230a9c19a76bb1b974e2e8a2a41f62d711b9c377ad2e","abstract_canon_sha256":"0a2915a7193c35bb358c175877affdc4edf4f5256dd825e4450e0223478f306d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:48.190835Z","signature_b64":"vDqwYcW+Sp++8VXtvfk8FBPAAxvLWQeceqnJzac3YCrejzEBTRaghaul2ckfpGYb3vxYOc00SsUiC99WAVexCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9d4e410203a65b5e23fd1755cdde70555f442e12837b4690b78ddf724515c8a9","last_reissued_at":"2026-05-18T00:39:48.190166Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:48.190166Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Accelerating the Regularized Alternating Least Square Algorithm for Tensors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Carmeliza Navasca, Stefan Kindermann, Xiaofei Wang","submitted_at":"2015-07-16T19:32:57Z","abstract_excerpt":"In this paper, we discuss the acceleration of the regularized alternating least square (RALS) algorithm for tensor approximation. We propose a fast iterative method using a Aitken-Stefensen like updates for the regularized algorithm. Through numerical experiments, the fast algorithm demonstrate a faster convergence rate for the accelerated version in comparison to both the standard and regularized alternating least squares algorithms. In addition, we analyze the global convergence based on the Kurdyka- Lojasiewicz inequality as well as show that the RALS algorithm has a linear local convergenc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.04721","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":"1507.04721","created_at":"2026-05-18T00:39:48.190255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.04721v2","created_at":"2026-05-18T00:39:48.190255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.04721","created_at":"2026-05-18T00:39:48.190255+00:00"},{"alias_kind":"pith_short_12","alias_value":"TVHECAQDUZNV","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TVHECAQDUZNV4I75","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TVHECAQD","created_at":"2026-05-18T12:29:42.218222+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/TVHECAQDUZNV4I75C5K43XTQKV","json":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV.json","graph_json":"https://pith.science/api/pith-number/TVHECAQDUZNV4I75C5K43XTQKV/graph.json","events_json":"https://pith.science/api/pith-number/TVHECAQDUZNV4I75C5K43XTQKV/events.json","paper":"https://pith.science/paper/TVHECAQD"},"agent_actions":{"view_html":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV","download_json":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV.json","view_paper":"https://pith.science/paper/TVHECAQD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.04721&json=true","fetch_graph":"https://pith.science/api/pith-number/TVHECAQDUZNV4I75C5K43XTQKV/graph.json","fetch_events":"https://pith.science/api/pith-number/TVHECAQDUZNV4I75C5K43XTQKV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV/action/storage_attestation","attest_author":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV/action/author_attestation","sign_citation":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV/action/citation_signature","submit_replication":"https://pith.science/pith/TVHECAQDUZNV4I75C5K43XTQKV/action/replication_record"}},"created_at":"2026-05-18T00:39:48.190255+00:00","updated_at":"2026-05-18T00:39:48.190255+00:00"}