{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:B4S2DPMUPIEKPL3M77FRI4AZZN","short_pith_number":"pith:B4S2DPMU","schema_version":"1.0","canonical_sha256":"0f25a1bd947a08a7af6cffcb147019cb789c1e02e2416419870242efb83eb687","source":{"kind":"arxiv","id":"1411.3553","version":1},"attestation_state":"computed","paper":{"title":"Greedy metrics in orthogonal greedy learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jinshan Zeng, Lin Xu, Shaobo Lin, Zongben Xu","submitted_at":"2014-11-13T14:26:11Z","abstract_excerpt":"Orthogonal greedy learning (OGL) is a stepwise learning scheme that adds a new atom from a dictionary via the steepest gradient descent and build the estimator via orthogonal projecting the target function to the space spanned by the selected atoms in each greedy step. Here, \"greed\" means choosing a new atom according to the steepest gradient descent principle. OGL then avoids the overfitting/underfitting by selecting an appropriate iteration number. In this paper, we point out that the overfitting/underfitting can also be avoided via redefining \"greed\" in OGL. To this end, we introduce a new "},"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":"1411.3553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-11-13T14:26:11Z","cross_cats_sorted":[],"title_canon_sha256":"3210c0257215b8c165762587e208f58cdb267b915ebca10e37633caffb3285bf","abstract_canon_sha256":"8673ce178d934924aac09e90ef8a2551145abf5222671bf858af3fde5eaf3bf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.476984Z","signature_b64":"IokvmB7xIVSjDdSw0xLNcDVNU+vKqi8gAQ0WMLJ/TWlRS2FX4oQeA1QC7mIxnqUd+4pRmXDAjk4Zq50rmGjfCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f25a1bd947a08a7af6cffcb147019cb789c1e02e2416419870242efb83eb687","last_reissued_at":"2026-05-18T02:37:43.476588Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.476588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Greedy metrics in orthogonal greedy learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jinshan Zeng, Lin Xu, Shaobo Lin, Zongben Xu","submitted_at":"2014-11-13T14:26:11Z","abstract_excerpt":"Orthogonal greedy learning (OGL) is a stepwise learning scheme that adds a new atom from a dictionary via the steepest gradient descent and build the estimator via orthogonal projecting the target function to the space spanned by the selected atoms in each greedy step. Here, \"greed\" means choosing a new atom according to the steepest gradient descent principle. OGL then avoids the overfitting/underfitting by selecting an appropriate iteration number. In this paper, we point out that the overfitting/underfitting can also be avoided via redefining \"greed\" in OGL. To this end, we introduce a new "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1411.3553","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":"1411.3553","created_at":"2026-05-18T02:37:43.476649+00:00"},{"alias_kind":"arxiv_version","alias_value":"1411.3553v1","created_at":"2026-05-18T02:37:43.476649+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1411.3553","created_at":"2026-05-18T02:37:43.476649+00:00"},{"alias_kind":"pith_short_12","alias_value":"B4S2DPMUPIEK","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"B4S2DPMUPIEKPL3M","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"B4S2DPMU","created_at":"2026-05-18T12:28:19.803747+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/B4S2DPMUPIEKPL3M77FRI4AZZN","json":"https://pith.science/pith/B4S2DPMUPIEKPL3M77FRI4AZZN.json","graph_json":"https://pith.science/api/pith-number/B4S2DPMUPIEKPL3M77FRI4AZZN/graph.json","events_json":"https://pith.science/api/pith-number/B4S2DPMUPIEKPL3M77FRI4AZZN/events.json","paper":"https://pith.science/paper/B4S2DPMU"},"agent_actions":{"view_html":"https://pith.science/pith/B4S2DPMUPIEKPL3M77FRI4AZZN","download_json":"https://pith.science/pith/B4S2DPMUPIEKPL3M77FRI4AZZN.json","view_paper":"https://pith.science/paper/B4S2DPMU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1411.3553&json=true","fetch_graph":"https://pith.science/api/pith-number/B4S2DPMUPIEKPL3M77FRI4AZZN/graph.json","fetch_events":"https://pith.science/api/pith-number/B4S2DPMUPIEKPL3M77FRI4AZZN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B4S2DPMUPIEKPL3M77FRI4AZZN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B4S2DPMUPIEKPL3M77FRI4AZZN/action/storage_attestation","attest_author":"https://pith.science/pith/B4S2DPMUPIEKPL3M77FRI4AZZN/action/author_attestation","sign_citation":"https://pith.science/pith/B4S2DPMUPIEKPL3M77FRI4AZZN/action/citation_signature","submit_replication":"https://pith.science/pith/B4S2DPMUPIEKPL3M77FRI4AZZN/action/replication_record"}},"created_at":"2026-05-18T02:37:43.476649+00:00","updated_at":"2026-05-18T02:37:43.476649+00:00"}