{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:XXKFHIIQTHOX67KXREXZIDJNS6","short_pith_number":"pith:XXKFHIIQ","schema_version":"1.0","canonical_sha256":"bdd453a11099dd7f7d57892f940d2d97b6c842db2db939b177c06f3c0be8e780","source":{"kind":"arxiv","id":"1607.08810","version":1},"attestation_state":"computed","paper":{"title":"Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Akinori Fujino, Masakazu Ishihata, Mathieu Blondel, Naonori Ueda","submitted_at":"2016-07-29T13:54:51Z","abstract_excerpt":"Polynomial networks and factorization machines are two recently-proposed models that can efficiently use feature interactions in classification and regression tasks. In this paper, we revisit both models from a unified perspective. Based on this new view, we study the properties of both models and propose new efficient training algorithms. Key to our approach is to cast parameter learning as a low-rank symmetric tensor estimation problem, which we solve by multi-convex optimization. We demonstrate our approach on regression and recommender system tasks."},"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":"1607.08810","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2016-07-29T13:54:51Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2968d28cc886ffb822a6620d45e31438b6e417b9ab148097ad8e9309a3ad6d5a","abstract_canon_sha256":"8e7be1bbcf1a59a87265b1569ec483fcd1013b80630970b5678de56f54689598"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:15.845087Z","signature_b64":"v23iVRY7fCY22F9Ij/oZO/OK+LKXq2YYT/j0CjGteNQDjUtYIAMl94pdIhKSmdzVkPlSBKDow8dYS9NA4c7ODA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bdd453a11099dd7f7d57892f940d2d97b6c842db2db939b177c06f3c0be8e780","last_reissued_at":"2026-05-18T01:10:15.844560Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:15.844560Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Akinori Fujino, Masakazu Ishihata, Mathieu Blondel, Naonori Ueda","submitted_at":"2016-07-29T13:54:51Z","abstract_excerpt":"Polynomial networks and factorization machines are two recently-proposed models that can efficiently use feature interactions in classification and regression tasks. In this paper, we revisit both models from a unified perspective. Based on this new view, we study the properties of both models and propose new efficient training algorithms. Key to our approach is to cast parameter learning as a low-rank symmetric tensor estimation problem, which we solve by multi-convex optimization. We demonstrate our approach on regression and recommender system tasks."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08810","kind":"arxiv","version":1},"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":"1607.08810","created_at":"2026-05-18T01:10:15.844653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.08810v1","created_at":"2026-05-18T01:10:15.844653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08810","created_at":"2026-05-18T01:10:15.844653+00:00"},{"alias_kind":"pith_short_12","alias_value":"XXKFHIIQTHOX","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"XXKFHIIQTHOX67KX","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"XXKFHIIQ","created_at":"2026-05-18T12:30:51.357362+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/XXKFHIIQTHOX67KXREXZIDJNS6","json":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6.json","graph_json":"https://pith.science/api/pith-number/XXKFHIIQTHOX67KXREXZIDJNS6/graph.json","events_json":"https://pith.science/api/pith-number/XXKFHIIQTHOX67KXREXZIDJNS6/events.json","paper":"https://pith.science/paper/XXKFHIIQ"},"agent_actions":{"view_html":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6","download_json":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6.json","view_paper":"https://pith.science/paper/XXKFHIIQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.08810&json=true","fetch_graph":"https://pith.science/api/pith-number/XXKFHIIQTHOX67KXREXZIDJNS6/graph.json","fetch_events":"https://pith.science/api/pith-number/XXKFHIIQTHOX67KXREXZIDJNS6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6/action/storage_attestation","attest_author":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6/action/author_attestation","sign_citation":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6/action/citation_signature","submit_replication":"https://pith.science/pith/XXKFHIIQTHOX67KXREXZIDJNS6/action/replication_record"}},"created_at":"2026-05-18T01:10:15.844653+00:00","updated_at":"2026-05-18T01:10:15.844653+00:00"}