{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DO6QNNXVP7BCZ6LJP6FSYQYWDO","short_pith_number":"pith:DO6QNNXV","schema_version":"1.0","canonical_sha256":"1bbd06b6f57fc22cf9697f8b2c43161ba034d83adae9f164f6cbdc55f8556dd7","source":{"kind":"arxiv","id":"1507.01073","version":5},"attestation_state":"computed","paper":{"title":"Convex Factorization Machine for Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Amit Goyal, Hiroshi Mamitsuka, Jianhui Chen, Kishan Wimalawarne, Makoto Yamada, Samuel Kaski, Suleiman A Khan, Wenzhao Lian, Yi Chang","submitted_at":"2015-07-04T05:54:29Z","abstract_excerpt":"We propose the convex factorization machine (CFM), which is a convex variant of the widely used Factorization Machines (FMs). Specifically, we employ a linear+quadratic model and regularize the linear term with the $\\ell_2$-regularizer and the quadratic term with the trace norm regularizer. Then, we formulate the CFM optimization as a semidefinite programming problem and propose an efficient optimization procedure with Hazan's algorithm. A key advantage of CFM over existing FMs is that it can find a globally optimal solution, while FMs may get a poor locally optimal solution since the objectiv"},"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.01073","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-07-04T05:54:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"68ace293e7b363df396b33cdc7f4de2bd081ec73e1344c09eddbf81cefde1b52","abstract_canon_sha256":"50c333acd0c6726f01165737f285d67e0de4da3df7fd83764310bee7a88ad10a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:32.254406Z","signature_b64":"OG9uM/9KIznb7swAsYCeZDidG5N7HrN3JOSvh5r8CdOjtERBJ9S+6WOY/WeGdPu8xvBsdwS0exOZ9o6gG3H4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bbd06b6f57fc22cf9697f8b2c43161ba034d83adae9f164f6cbdc55f8556dd7","last_reissued_at":"2026-05-18T01:09:32.253915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:32.253915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Convex Factorization Machine for Regression","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Amit Goyal, Hiroshi Mamitsuka, Jianhui Chen, Kishan Wimalawarne, Makoto Yamada, Samuel Kaski, Suleiman A Khan, Wenzhao Lian, Yi Chang","submitted_at":"2015-07-04T05:54:29Z","abstract_excerpt":"We propose the convex factorization machine (CFM), which is a convex variant of the widely used Factorization Machines (FMs). Specifically, we employ a linear+quadratic model and regularize the linear term with the $\\ell_2$-regularizer and the quadratic term with the trace norm regularizer. Then, we formulate the CFM optimization as a semidefinite programming problem and propose an efficient optimization procedure with Hazan's algorithm. A key advantage of CFM over existing FMs is that it can find a globally optimal solution, while FMs may get a poor locally optimal solution since the objectiv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01073","kind":"arxiv","version":5},"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.01073","created_at":"2026-05-18T01:09:32.253982+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.01073v5","created_at":"2026-05-18T01:09:32.253982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01073","created_at":"2026-05-18T01:09:32.253982+00:00"},{"alias_kind":"pith_short_12","alias_value":"DO6QNNXVP7BC","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DO6QNNXVP7BCZ6LJ","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DO6QNNXV","created_at":"2026-05-18T12:29:17.054201+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/DO6QNNXVP7BCZ6LJP6FSYQYWDO","json":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO.json","graph_json":"https://pith.science/api/pith-number/DO6QNNXVP7BCZ6LJP6FSYQYWDO/graph.json","events_json":"https://pith.science/api/pith-number/DO6QNNXVP7BCZ6LJP6FSYQYWDO/events.json","paper":"https://pith.science/paper/DO6QNNXV"},"agent_actions":{"view_html":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO","download_json":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO.json","view_paper":"https://pith.science/paper/DO6QNNXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.01073&json=true","fetch_graph":"https://pith.science/api/pith-number/DO6QNNXVP7BCZ6LJP6FSYQYWDO/graph.json","fetch_events":"https://pith.science/api/pith-number/DO6QNNXVP7BCZ6LJP6FSYQYWDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/action/storage_attestation","attest_author":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/action/author_attestation","sign_citation":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/action/citation_signature","submit_replication":"https://pith.science/pith/DO6QNNXVP7BCZ6LJP6FSYQYWDO/action/replication_record"}},"created_at":"2026-05-18T01:09:32.253982+00:00","updated_at":"2026-05-18T01:09:32.253982+00:00"}