{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3F54ZFGJSS7U25CEU54BZ7GVGE","short_pith_number":"pith:3F54ZFGJ","schema_version":"1.0","canonical_sha256":"d97bcc94c994bf4d7444a7781cfcd5312c46a7d478cf8f2a106fbdd9c0fc2647","source":{"kind":"arxiv","id":"1509.04612","version":2},"attestation_state":"computed","paper":{"title":"Adapting Resilient Propagation for Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Alan Mosca, George D. Magoulas","submitted_at":"2015-09-15T15:55:29Z","abstract_excerpt":"The Resilient Propagation (Rprop) algorithm has been very popular for backpropagation training of multilayer feed-forward neural networks in various applications. The standard Rprop however encounters difficulties in the context of deep neural networks as typically happens with gradient-based learning algorithms. In this paper, we propose a modification of the Rprop that combines standard Rprop steps with a special drop out technique. We apply the method for training Deep Neural Networks as standalone components and in ensemble formulations. Results on the MNIST dataset show that the proposed "},"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":"1509.04612","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.NE","submitted_at":"2015-09-15T15:55:29Z","cross_cats_sorted":["cs.CV","cs.LG","stat.ML"],"title_canon_sha256":"92b3db7127577dbadfe2d42169cd2511d72a9548529e3ef64379d0dfa09409e5","abstract_canon_sha256":"77c48ffb57cc5a5c40bf048452b72f64c42883de0df1a3e089526d09e46cc204"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:51.920709Z","signature_b64":"qewnfSYyYHMldTSFgHswvd1URLKhq4louFpKR5nIfd6LSJda6QVRO1JrzxlcHxh9j+Ph7YYiSq7I0suh4gHFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d97bcc94c994bf4d7444a7781cfcd5312c46a7d478cf8f2a106fbdd9c0fc2647","last_reissued_at":"2026-05-18T01:32:51.920102Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:51.920102Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adapting Resilient Propagation for Deep Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.LG","stat.ML"],"primary_cat":"cs.NE","authors_text":"Alan Mosca, George D. Magoulas","submitted_at":"2015-09-15T15:55:29Z","abstract_excerpt":"The Resilient Propagation (Rprop) algorithm has been very popular for backpropagation training of multilayer feed-forward neural networks in various applications. The standard Rprop however encounters difficulties in the context of deep neural networks as typically happens with gradient-based learning algorithms. In this paper, we propose a modification of the Rprop that combines standard Rprop steps with a special drop out technique. We apply the method for training Deep Neural Networks as standalone components and in ensemble formulations. Results on the MNIST dataset show that the proposed "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.04612","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":"1509.04612","created_at":"2026-05-18T01:32:51.920195+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.04612v2","created_at":"2026-05-18T01:32:51.920195+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.04612","created_at":"2026-05-18T01:32:51.920195+00:00"},{"alias_kind":"pith_short_12","alias_value":"3F54ZFGJSS7U","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3F54ZFGJSS7U25CE","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3F54ZFGJ","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.12680","citing_title":"Majorization Inequalities from Logarithmic Convexity","ref_index":26,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3F54ZFGJSS7U25CEU54BZ7GVGE","json":"https://pith.science/pith/3F54ZFGJSS7U25CEU54BZ7GVGE.json","graph_json":"https://pith.science/api/pith-number/3F54ZFGJSS7U25CEU54BZ7GVGE/graph.json","events_json":"https://pith.science/api/pith-number/3F54ZFGJSS7U25CEU54BZ7GVGE/events.json","paper":"https://pith.science/paper/3F54ZFGJ"},"agent_actions":{"view_html":"https://pith.science/pith/3F54ZFGJSS7U25CEU54BZ7GVGE","download_json":"https://pith.science/pith/3F54ZFGJSS7U25CEU54BZ7GVGE.json","view_paper":"https://pith.science/paper/3F54ZFGJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.04612&json=true","fetch_graph":"https://pith.science/api/pith-number/3F54ZFGJSS7U25CEU54BZ7GVGE/graph.json","fetch_events":"https://pith.science/api/pith-number/3F54ZFGJSS7U25CEU54BZ7GVGE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3F54ZFGJSS7U25CEU54BZ7GVGE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3F54ZFGJSS7U25CEU54BZ7GVGE/action/storage_attestation","attest_author":"https://pith.science/pith/3F54ZFGJSS7U25CEU54BZ7GVGE/action/author_attestation","sign_citation":"https://pith.science/pith/3F54ZFGJSS7U25CEU54BZ7GVGE/action/citation_signature","submit_replication":"https://pith.science/pith/3F54ZFGJSS7U25CEU54BZ7GVGE/action/replication_record"}},"created_at":"2026-05-18T01:32:51.920195+00:00","updated_at":"2026-05-18T01:32:51.920195+00:00"}