{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:IFAGZOUVBXQGWJ5O5SPL7RFEL7","short_pith_number":"pith:IFAGZOUV","schema_version":"1.0","canonical_sha256":"41406cba950de06b27aeec9ebfc4a45fecab5b2ef9de72c35062682a3dce1e7b","source":{"kind":"arxiv","id":"1501.02056","version":2},"attestation_state":"computed","paper":{"title":"Sequential Kernel Herding: Frank-Wolfe Optimization for Particle Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Francis Bach (LIENS, Fredrik Lindsten, INRIA Paris - Rocquencourt, MSR - INRIA), Simon Lacoste-Julien (LIENS","submitted_at":"2015-01-09T07:17:27Z","abstract_excerpt":"Recently, the Frank-Wolfe optimization algorithm was suggested as a procedure to obtain adaptive quadrature rules for integrals of functions in a reproducing kernel Hilbert space (RKHS) with a potentially faster rate of convergence than Monte Carlo integration (and \"kernel herding\" was shown to be a special case of this procedure). In this paper, we propose to replace the random sampling step in a particle filter by Frank-Wolfe optimization. By optimizing the position of the particles, we can obtain better accuracy than random or quasi-Monte Carlo sampling. In applications where the evaluation"},"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":"1501.02056","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2015-01-09T07:17:27Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"371ebee343884f9c97867fe13cd2fa72a9fae6cda64054983688e37f8d94f164","abstract_canon_sha256":"43a96817e2d7fab805356ea4c523fe5503370552dea27f592814e35f02a005a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:27:31.599170Z","signature_b64":"kzhC3aJCC6vXhF9xiqQogwPQtXSuuKl7Z7/GgEwtcHMdWN8J8BKxXIfo+ngMXzqpi2KBnwW0eh/9hvBFAj9dCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41406cba950de06b27aeec9ebfc4a45fecab5b2ef9de72c35062682a3dce1e7b","last_reissued_at":"2026-05-18T02:27:31.598529Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:27:31.598529Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sequential Kernel Herding: Frank-Wolfe Optimization for Particle Filtering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Francis Bach (LIENS, Fredrik Lindsten, INRIA Paris - Rocquencourt, MSR - INRIA), Simon Lacoste-Julien (LIENS","submitted_at":"2015-01-09T07:17:27Z","abstract_excerpt":"Recently, the Frank-Wolfe optimization algorithm was suggested as a procedure to obtain adaptive quadrature rules for integrals of functions in a reproducing kernel Hilbert space (RKHS) with a potentially faster rate of convergence than Monte Carlo integration (and \"kernel herding\" was shown to be a special case of this procedure). In this paper, we propose to replace the random sampling step in a particle filter by Frank-Wolfe optimization. By optimizing the position of the particles, we can obtain better accuracy than random or quasi-Monte Carlo sampling. In applications where the evaluation"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.02056","kind":"arxiv","version":2},"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":"1501.02056","created_at":"2026-05-18T02:27:31.598628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.02056v2","created_at":"2026-05-18T02:27:31.598628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.02056","created_at":"2026-05-18T02:27:31.598628+00:00"},{"alias_kind":"pith_short_12","alias_value":"IFAGZOUVBXQG","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"IFAGZOUVBXQGWJ5O","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"IFAGZOUV","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.10600","citing_title":"Weighted quantization using MMD: From mean field to mean shift via gradient flows","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IFAGZOUVBXQGWJ5O5SPL7RFEL7","json":"https://pith.science/pith/IFAGZOUVBXQGWJ5O5SPL7RFEL7.json","graph_json":"https://pith.science/api/pith-number/IFAGZOUVBXQGWJ5O5SPL7RFEL7/graph.json","events_json":"https://pith.science/api/pith-number/IFAGZOUVBXQGWJ5O5SPL7RFEL7/events.json","paper":"https://pith.science/paper/IFAGZOUV"},"agent_actions":{"view_html":"https://pith.science/pith/IFAGZOUVBXQGWJ5O5SPL7RFEL7","download_json":"https://pith.science/pith/IFAGZOUVBXQGWJ5O5SPL7RFEL7.json","view_paper":"https://pith.science/paper/IFAGZOUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.02056&json=true","fetch_graph":"https://pith.science/api/pith-number/IFAGZOUVBXQGWJ5O5SPL7RFEL7/graph.json","fetch_events":"https://pith.science/api/pith-number/IFAGZOUVBXQGWJ5O5SPL7RFEL7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IFAGZOUVBXQGWJ5O5SPL7RFEL7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IFAGZOUVBXQGWJ5O5SPL7RFEL7/action/storage_attestation","attest_author":"https://pith.science/pith/IFAGZOUVBXQGWJ5O5SPL7RFEL7/action/author_attestation","sign_citation":"https://pith.science/pith/IFAGZOUVBXQGWJ5O5SPL7RFEL7/action/citation_signature","submit_replication":"https://pith.science/pith/IFAGZOUVBXQGWJ5O5SPL7RFEL7/action/replication_record"}},"created_at":"2026-05-18T02:27:31.598628+00:00","updated_at":"2026-05-18T02:27:31.598628+00:00"}