{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:F4NEXXFBQWHIDOVZAVFMCMZOPU","short_pith_number":"pith:F4NEXXFB","schema_version":"1.0","canonical_sha256":"2f1a4bdca1858e81bab9054ac1332e7d122919acdf3e0793c46948b3df2dd50b","source":{"kind":"arxiv","id":"1710.10002","version":1},"attestation_state":"computed","paper":{"title":"Online linear optimization with the log-determinant regularizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eiji Takimoto, Ken-ichiro Moridomi, Kohei Hatano","submitted_at":"2017-10-27T06:38:11Z","abstract_excerpt":"We consider online linear optimization over symmetric positive semi-definite matrices, which has various applications including the online collaborative filtering. The problem is formulated as a repeated game between the algorithm and the adversary, where in each round t the algorithm and the adversary choose matrices X_t and L_t, respectively, and then the algorithm suffers a loss given by the Frobenius inner product of X_t and L_t. The goal of the algorithm is to minimize the cumulative loss. We can employ a standard framework called Follow the Regularized Leader (FTRL) for designing algorit"},"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":"1710.10002","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-10-27T06:38:11Z","cross_cats_sorted":[],"title_canon_sha256":"38843acb32b6e479c2d2b1e9c1e7dee419c68f398577cd2d0c991fdbbd7fc476","abstract_canon_sha256":"56195d86319a0a2b69d86668c9e7d927b5a4cafecd9b6e4330f752dadd0cb23a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:11:40.327753Z","signature_b64":"e6TuooeNWuGHZrzLv0gtDRQqKtBla9uA0JBmx9nycKM5RVB5r2XciVuic3wS+68htM78t321yCKIFB0CggK/Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f1a4bdca1858e81bab9054ac1332e7d122919acdf3e0793c46948b3df2dd50b","last_reissued_at":"2026-05-18T00:11:40.327182Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:11:40.327182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online linear optimization with the log-determinant regularizer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Eiji Takimoto, Ken-ichiro Moridomi, Kohei Hatano","submitted_at":"2017-10-27T06:38:11Z","abstract_excerpt":"We consider online linear optimization over symmetric positive semi-definite matrices, which has various applications including the online collaborative filtering. The problem is formulated as a repeated game between the algorithm and the adversary, where in each round t the algorithm and the adversary choose matrices X_t and L_t, respectively, and then the algorithm suffers a loss given by the Frobenius inner product of X_t and L_t. The goal of the algorithm is to minimize the cumulative loss. We can employ a standard framework called Follow the Regularized Leader (FTRL) for designing algorit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10002","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":"1710.10002","created_at":"2026-05-18T00:11:40.327280+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10002v1","created_at":"2026-05-18T00:11:40.327280+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10002","created_at":"2026-05-18T00:11:40.327280+00:00"},{"alias_kind":"pith_short_12","alias_value":"F4NEXXFBQWHI","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"F4NEXXFBQWHIDOVZ","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"F4NEXXFB","created_at":"2026-05-18T12:31:15.632608+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/F4NEXXFBQWHIDOVZAVFMCMZOPU","json":"https://pith.science/pith/F4NEXXFBQWHIDOVZAVFMCMZOPU.json","graph_json":"https://pith.science/api/pith-number/F4NEXXFBQWHIDOVZAVFMCMZOPU/graph.json","events_json":"https://pith.science/api/pith-number/F4NEXXFBQWHIDOVZAVFMCMZOPU/events.json","paper":"https://pith.science/paper/F4NEXXFB"},"agent_actions":{"view_html":"https://pith.science/pith/F4NEXXFBQWHIDOVZAVFMCMZOPU","download_json":"https://pith.science/pith/F4NEXXFBQWHIDOVZAVFMCMZOPU.json","view_paper":"https://pith.science/paper/F4NEXXFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10002&json=true","fetch_graph":"https://pith.science/api/pith-number/F4NEXXFBQWHIDOVZAVFMCMZOPU/graph.json","fetch_events":"https://pith.science/api/pith-number/F4NEXXFBQWHIDOVZAVFMCMZOPU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F4NEXXFBQWHIDOVZAVFMCMZOPU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F4NEXXFBQWHIDOVZAVFMCMZOPU/action/storage_attestation","attest_author":"https://pith.science/pith/F4NEXXFBQWHIDOVZAVFMCMZOPU/action/author_attestation","sign_citation":"https://pith.science/pith/F4NEXXFBQWHIDOVZAVFMCMZOPU/action/citation_signature","submit_replication":"https://pith.science/pith/F4NEXXFBQWHIDOVZAVFMCMZOPU/action/replication_record"}},"created_at":"2026-05-18T00:11:40.327280+00:00","updated_at":"2026-05-18T00:11:40.327280+00:00"}