{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:U3HENN44H2FUIL22YQDWLDKCHQ","short_pith_number":"pith:U3HENN44","schema_version":"1.0","canonical_sha256":"a6ce46b79c3e8b442f5ac407658d423c1ac5d316f68fd2197ca07c8857d67f3e","source":{"kind":"arxiv","id":"1901.11149","version":1},"attestation_state":"computed","paper":{"title":"Which Factorization Machine Modeling is Better: A Theoretical Answer with Optimal Guarantee","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jieping Ye, Liang Sun, Ming Lin, Qi Qian, Rong Jin, Shenghuo Zhu, Shuang Qiu, Xiaomin Song","submitted_at":"2019-01-30T23:47:21Z","abstract_excerpt":"Factorization machine (FM) is a popular machine learning model to capture the second order feature interactions. The optimal learning guarantee of FM and its generalized version is not yet developed. For a rank $k$ generalized FM of $d$ dimensional input, the previous best known sampling complexity is $\\mathcal{O}[k^{3}d\\cdot\\mathrm{polylog}(kd)]$ under Gaussian distribution. This bound is sub-optimal comparing to the information theoretical lower bound $\\mathcal{O}(kd)$. In this work, we aim to tighten this bound towards optimal and generalize the analysis to sub-gaussian distribution. We pro"},"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":"1901.11149","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-01-30T23:47:21Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"ecf33e76a90c2db44934fcaff23649666d1e064d943ea0015dd16ce2a2dc8a3f","abstract_canon_sha256":"3da7c204ed6abff87a970de7c937feb44388b0da410f2da436aa08865760d14a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:02.567765Z","signature_b64":"snARyZ3qSg7Ee02r96FvmqfKbvAJgz/fWrL3W9DffCigdf+cEhOBUJVl+JAzIyffqQXmTsjWE6+JyNtE1q24Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a6ce46b79c3e8b442f5ac407658d423c1ac5d316f68fd2197ca07c8857d67f3e","last_reissued_at":"2026-05-17T23:55:02.567257Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:02.567257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Which Factorization Machine Modeling is Better: A Theoretical Answer with Optimal Guarantee","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Jieping Ye, Liang Sun, Ming Lin, Qi Qian, Rong Jin, Shenghuo Zhu, Shuang Qiu, Xiaomin Song","submitted_at":"2019-01-30T23:47:21Z","abstract_excerpt":"Factorization machine (FM) is a popular machine learning model to capture the second order feature interactions. The optimal learning guarantee of FM and its generalized version is not yet developed. For a rank $k$ generalized FM of $d$ dimensional input, the previous best known sampling complexity is $\\mathcal{O}[k^{3}d\\cdot\\mathrm{polylog}(kd)]$ under Gaussian distribution. This bound is sub-optimal comparing to the information theoretical lower bound $\\mathcal{O}(kd)$. In this work, we aim to tighten this bound towards optimal and generalize the analysis to sub-gaussian distribution. We pro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.11149","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":"1901.11149","created_at":"2026-05-17T23:55:02.567331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1901.11149v1","created_at":"2026-05-17T23:55:02.567331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.11149","created_at":"2026-05-17T23:55:02.567331+00:00"},{"alias_kind":"pith_short_12","alias_value":"U3HENN44H2FU","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"U3HENN44H2FUIL22","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"U3HENN44","created_at":"2026-05-18T12:33:30.264802+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/U3HENN44H2FUIL22YQDWLDKCHQ","json":"https://pith.science/pith/U3HENN44H2FUIL22YQDWLDKCHQ.json","graph_json":"https://pith.science/api/pith-number/U3HENN44H2FUIL22YQDWLDKCHQ/graph.json","events_json":"https://pith.science/api/pith-number/U3HENN44H2FUIL22YQDWLDKCHQ/events.json","paper":"https://pith.science/paper/U3HENN44"},"agent_actions":{"view_html":"https://pith.science/pith/U3HENN44H2FUIL22YQDWLDKCHQ","download_json":"https://pith.science/pith/U3HENN44H2FUIL22YQDWLDKCHQ.json","view_paper":"https://pith.science/paper/U3HENN44","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1901.11149&json=true","fetch_graph":"https://pith.science/api/pith-number/U3HENN44H2FUIL22YQDWLDKCHQ/graph.json","fetch_events":"https://pith.science/api/pith-number/U3HENN44H2FUIL22YQDWLDKCHQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U3HENN44H2FUIL22YQDWLDKCHQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U3HENN44H2FUIL22YQDWLDKCHQ/action/storage_attestation","attest_author":"https://pith.science/pith/U3HENN44H2FUIL22YQDWLDKCHQ/action/author_attestation","sign_citation":"https://pith.science/pith/U3HENN44H2FUIL22YQDWLDKCHQ/action/citation_signature","submit_replication":"https://pith.science/pith/U3HENN44H2FUIL22YQDWLDKCHQ/action/replication_record"}},"created_at":"2026-05-17T23:55:02.567331+00:00","updated_at":"2026-05-17T23:55:02.567331+00:00"}