{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:OIKMCZSOKVAWHVRPU566VEJFPK","short_pith_number":"pith:OIKMCZSO","schema_version":"1.0","canonical_sha256":"7214c1664e554163d62fa77dea91257a8733181a7b8d8bcdb45930b0d92274a3","source":{"kind":"arxiv","id":"1401.0086","version":2},"attestation_state":"computed","paper":{"title":"Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jieping Ye, Ji Liu, Ryohei Fujimaki","submitted_at":"2013-12-31T04:00:31Z","abstract_excerpt":"We consider forward-backward greedy algorithms for solving sparse feature selection problems with general convex smooth functions. A state-of-the-art greedy method, the Forward-Backward greedy algorithm (FoBa-obj) requires to solve a large number of optimization problems, thus it is not scalable for large-size problems. The FoBa-gdt algorithm, which uses the gradient information for feature selection at each forward iteration, significantly improves the efficiency of FoBa-obj. In this paper, we systematically analyze the theoretical properties of both forward-backward greedy algorithms. Our ma"},"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":"1401.0086","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-12-31T04:00:31Z","cross_cats_sorted":[],"title_canon_sha256":"d8e38d62e0146f418da9db282cf54cdc0f220d1a2859a14143adf13ccb4d28b2","abstract_canon_sha256":"5b633f4d548cd9f1fe1750d1531caf27c490e8cc655abefb0be5c460bc3e5c01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:09.459245Z","signature_b64":"JmQjv71nA5IUCajGuST9uTFlO0QIFXs4a6rYnTcvLUIftSvHw9de/XbjQqK/5V4h7XxgnnEbvRIyInFi2Lq4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7214c1664e554163d62fa77dea91257a8733181a7b8d8bcdb45930b0d92274a3","last_reissued_at":"2026-05-18T03:03:09.458338Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:09.458338Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Forward-Backward Greedy Algorithms for General Convex Smooth Functions over A Cardinality Constraint","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jieping Ye, Ji Liu, Ryohei Fujimaki","submitted_at":"2013-12-31T04:00:31Z","abstract_excerpt":"We consider forward-backward greedy algorithms for solving sparse feature selection problems with general convex smooth functions. A state-of-the-art greedy method, the Forward-Backward greedy algorithm (FoBa-obj) requires to solve a large number of optimization problems, thus it is not scalable for large-size problems. The FoBa-gdt algorithm, which uses the gradient information for feature selection at each forward iteration, significantly improves the efficiency of FoBa-obj. In this paper, we systematically analyze the theoretical properties of both forward-backward greedy algorithms. Our ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.0086","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":"1401.0086","created_at":"2026-05-18T03:03:09.458516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.0086v2","created_at":"2026-05-18T03:03:09.458516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.0086","created_at":"2026-05-18T03:03:09.458516+00:00"},{"alias_kind":"pith_short_12","alias_value":"OIKMCZSOKVAW","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_16","alias_value":"OIKMCZSOKVAWHVRP","created_at":"2026-05-18T12:27:54.935989+00:00"},{"alias_kind":"pith_short_8","alias_value":"OIKMCZSO","created_at":"2026-05-18T12:27:54.935989+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/OIKMCZSOKVAWHVRPU566VEJFPK","json":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK.json","graph_json":"https://pith.science/api/pith-number/OIKMCZSOKVAWHVRPU566VEJFPK/graph.json","events_json":"https://pith.science/api/pith-number/OIKMCZSOKVAWHVRPU566VEJFPK/events.json","paper":"https://pith.science/paper/OIKMCZSO"},"agent_actions":{"view_html":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK","download_json":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK.json","view_paper":"https://pith.science/paper/OIKMCZSO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.0086&json=true","fetch_graph":"https://pith.science/api/pith-number/OIKMCZSOKVAWHVRPU566VEJFPK/graph.json","fetch_events":"https://pith.science/api/pith-number/OIKMCZSOKVAWHVRPU566VEJFPK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK/action/storage_attestation","attest_author":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK/action/author_attestation","sign_citation":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK/action/citation_signature","submit_replication":"https://pith.science/pith/OIKMCZSOKVAWHVRPU566VEJFPK/action/replication_record"}},"created_at":"2026-05-18T03:03:09.458516+00:00","updated_at":"2026-05-18T03:03:09.458516+00:00"}