{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:YILOOTCEMASCH5LW7ROFTBS3TJ","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"492c14ee8feebfd4875ad8d97293a20792de699b58eaef4de56208a04a32eabd","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T08:20:31Z","title_canon_sha256":"008aee5483313bea397512406e3d3b5b3143d1370d003c1255a476b1ae426b7e"},"schema_version":"1.0","source":{"id":"1705.07603","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07603","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07603v2","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07603","created_at":"2026-05-18T00:31:19Z"},{"alias_kind":"pith_short_12","alias_value":"YILOOTCEMASC","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"YILOOTCEMASCH5LW","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"YILOOTCE","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:cbd73e94abb46671860afab9d9ba98b62ccdc99a42ac8ef4acc8691e2c6d14f6","target":"graph","created_at":"2026-05-18T00:31:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Factorization machines and polynomial networks are supervised polynomial models based on an efficient low-rank decomposition. We extend these models to the multi-output setting, i.e., for learning vector-valued functions, with application to multi-class or multi-task problems. We cast this as the problem of learning a 3-way tensor whose slices share a common basis and propose a convex formulation of that problem. We then develop an efficient conditional gradient algorithm and prove its global convergence, despite the fact that it involves a non-convex basis selection step. On classification ta","authors_text":"Mathieu Blondel, Naonori Ueda, Takuma Otsuka, Vlad Niculae","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T08:20:31Z","title":"Multi-output Polynomial Networks and Factorization Machines"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07603","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:77fe71ac1481abad3113e3150c9bdc0f9e219fb3ea096280aee14d4242a7a1e0","target":"record","created_at":"2026-05-18T00:31:19Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"492c14ee8feebfd4875ad8d97293a20792de699b58eaef4de56208a04a32eabd","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-05-22T08:20:31Z","title_canon_sha256":"008aee5483313bea397512406e3d3b5b3143d1370d003c1255a476b1ae426b7e"},"schema_version":"1.0","source":{"id":"1705.07603","kind":"arxiv","version":2}},"canonical_sha256":"c216e74c44602423f576fc5c59865b9a556fbd91bb458080e2dc74c7056f7418","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c216e74c44602423f576fc5c59865b9a556fbd91bb458080e2dc74c7056f7418","first_computed_at":"2026-05-18T00:31:19.467570Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:19.467570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nWnbFsWjOMcJlxtHt4z76jpi58HSCh5nFhuCRWRH4qHoK43PdTF1ZiuvgYKtg5xEK4SMYLkGcWF44eXN7HFuBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:19.468444Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07603","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:77fe71ac1481abad3113e3150c9bdc0f9e219fb3ea096280aee14d4242a7a1e0","sha256:cbd73e94abb46671860afab9d9ba98b62ccdc99a42ac8ef4acc8691e2c6d14f6"],"state_sha256":"3655328b7a7b523a3a55f311d578f954efc2a741c91bceb01a78ccd10b8e05de"}