{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KJLMSZFB4SSLE2MRV5LQ4FPHOJ","short_pith_number":"pith:KJLMSZFB","schema_version":"1.0","canonical_sha256":"5256c964a1e4a4b26991af570e15e7724a62657797f5064b7e22e71e1cc4ca93","source":{"kind":"arxiv","id":"1802.06502","version":3},"attestation_state":"computed","paper":{"title":"EA-CG: An Approximate Second-Order Method for Training Fully-Connected Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chun-Nan Chou, Edward Y. Chang, Sheng-Wei Chen","submitted_at":"2018-02-19T02:31:24Z","abstract_excerpt":"For training fully-connected neural networks (FCNNs), we propose a practical approximate second-order method including: 1) an approximation of the Hessian matrix and 2) a conjugate gradient (CG) based method. Our proposed approximate Hessian matrix is memory-efficient and can be applied to any FCNNs where the activation and criterion functions are twice differentiable. We devise a CG-based method incorporating one-rank approximation to derive Newton directions for training FCNNs, which significantly reduces both space and time complexity. This CG-based method can be employed to solve any linea"},"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":"1802.06502","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-19T02:31:24Z","cross_cats_sorted":[],"title_canon_sha256":"d4e8025d019ce3f0f6d586879203a7b400477601fb9a19dca0e1fd5b13217846","abstract_canon_sha256":"3672644e7dae9f683674683072a37ff1b18cb9eee0255a6ec216d274309abc63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:59.264701Z","signature_b64":"nFI20t+/8kajtjYchXbRQJ/EwTh36XBLTIwaaPQ6QptXN/j9FiOwgd2GYx81YCwCxdpByy2RXIrCVAHpej2SCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5256c964a1e4a4b26991af570e15e7724a62657797f5064b7e22e71e1cc4ca93","last_reissued_at":"2026-05-17T23:58:59.264133Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:59.264133Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EA-CG: An Approximate Second-Order Method for Training Fully-Connected Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Chun-Nan Chou, Edward Y. Chang, Sheng-Wei Chen","submitted_at":"2018-02-19T02:31:24Z","abstract_excerpt":"For training fully-connected neural networks (FCNNs), we propose a practical approximate second-order method including: 1) an approximation of the Hessian matrix and 2) a conjugate gradient (CG) based method. Our proposed approximate Hessian matrix is memory-efficient and can be applied to any FCNNs where the activation and criterion functions are twice differentiable. We devise a CG-based method incorporating one-rank approximation to derive Newton directions for training FCNNs, which significantly reduces both space and time complexity. This CG-based method can be employed to solve any linea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06502","kind":"arxiv","version":3},"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":"1802.06502","created_at":"2026-05-17T23:58:59.264210+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06502v3","created_at":"2026-05-17T23:58:59.264210+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06502","created_at":"2026-05-17T23:58:59.264210+00:00"},{"alias_kind":"pith_short_12","alias_value":"KJLMSZFB4SSL","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KJLMSZFB4SSLE2MR","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KJLMSZFB","created_at":"2026-05-18T12:32:33.847187+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/KJLMSZFB4SSLE2MRV5LQ4FPHOJ","json":"https://pith.science/pith/KJLMSZFB4SSLE2MRV5LQ4FPHOJ.json","graph_json":"https://pith.science/api/pith-number/KJLMSZFB4SSLE2MRV5LQ4FPHOJ/graph.json","events_json":"https://pith.science/api/pith-number/KJLMSZFB4SSLE2MRV5LQ4FPHOJ/events.json","paper":"https://pith.science/paper/KJLMSZFB"},"agent_actions":{"view_html":"https://pith.science/pith/KJLMSZFB4SSLE2MRV5LQ4FPHOJ","download_json":"https://pith.science/pith/KJLMSZFB4SSLE2MRV5LQ4FPHOJ.json","view_paper":"https://pith.science/paper/KJLMSZFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06502&json=true","fetch_graph":"https://pith.science/api/pith-number/KJLMSZFB4SSLE2MRV5LQ4FPHOJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KJLMSZFB4SSLE2MRV5LQ4FPHOJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KJLMSZFB4SSLE2MRV5LQ4FPHOJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KJLMSZFB4SSLE2MRV5LQ4FPHOJ/action/storage_attestation","attest_author":"https://pith.science/pith/KJLMSZFB4SSLE2MRV5LQ4FPHOJ/action/author_attestation","sign_citation":"https://pith.science/pith/KJLMSZFB4SSLE2MRV5LQ4FPHOJ/action/citation_signature","submit_replication":"https://pith.science/pith/KJLMSZFB4SSLE2MRV5LQ4FPHOJ/action/replication_record"}},"created_at":"2026-05-17T23:58:59.264210+00:00","updated_at":"2026-05-17T23:58:59.264210+00:00"}