{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:GWMZNEIB5E743EUGAPF4YAWJJX","short_pith_number":"pith:GWMZNEIB","schema_version":"1.0","canonical_sha256":"3599969101e93fcd928603cbcc02c94dc727b44afb4ec2854e592e14d299871c","source":{"kind":"arxiv","id":"1705.09476","version":1},"attestation_state":"computed","paper":{"title":"Learning Robust Features with Incremental Auto-Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Donghui Wang, Yanan Li","submitted_at":"2017-05-26T08:30:41Z","abstract_excerpt":"Automatically learning features, especially robust features, has attracted much attention in the machine learning community. In this paper, we propose a new method to learn non-linear robust features by taking advantage of the data manifold structure. We first follow the commonly used trick of the trade, that is learning robust features with artificially corrupted data, which are training samples with manually injected noise. Following the idea of the auto-encoder, we first assume features should contain much information to well reconstruct the input from its corrupted copies. However, merely "},"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":"1705.09476","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-05-26T08:30:41Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"61272dfcc53874e5143df1bf5ebf660550c4bb06197b49263f0844eb1b7dfa5a","abstract_canon_sha256":"ba3363eb43a425263f3ee7f640934167fb8346d9a14898292e0aed40c3b329b0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:38.610197Z","signature_b64":"R86WbcxJiGWRDdNqm0wRGLwaQ8F0UAkinCICnVO3hRv/hdumknRsRO40Es5Th3eX6ulbh6xSIDWVwM9JHUlVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3599969101e93fcd928603cbcc02c94dc727b44afb4ec2854e592e14d299871c","last_reissued_at":"2026-05-18T00:43:38.609759Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:38.609759Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Robust Features with Incremental Auto-Encoders","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.LG","authors_text":"Donghui Wang, Yanan Li","submitted_at":"2017-05-26T08:30:41Z","abstract_excerpt":"Automatically learning features, especially robust features, has attracted much attention in the machine learning community. In this paper, we propose a new method to learn non-linear robust features by taking advantage of the data manifold structure. We first follow the commonly used trick of the trade, that is learning robust features with artificially corrupted data, which are training samples with manually injected noise. Following the idea of the auto-encoder, we first assume features should contain much information to well reconstruct the input from its corrupted copies. However, merely "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09476","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":"1705.09476","created_at":"2026-05-18T00:43:38.609833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09476v1","created_at":"2026-05-18T00:43:38.609833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09476","created_at":"2026-05-18T00:43:38.609833+00:00"},{"alias_kind":"pith_short_12","alias_value":"GWMZNEIB5E74","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_16","alias_value":"GWMZNEIB5E743EUG","created_at":"2026-05-18T12:31:18.294218+00:00"},{"alias_kind":"pith_short_8","alias_value":"GWMZNEIB","created_at":"2026-05-18T12:31:18.294218+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/GWMZNEIB5E743EUGAPF4YAWJJX","json":"https://pith.science/pith/GWMZNEIB5E743EUGAPF4YAWJJX.json","graph_json":"https://pith.science/api/pith-number/GWMZNEIB5E743EUGAPF4YAWJJX/graph.json","events_json":"https://pith.science/api/pith-number/GWMZNEIB5E743EUGAPF4YAWJJX/events.json","paper":"https://pith.science/paper/GWMZNEIB"},"agent_actions":{"view_html":"https://pith.science/pith/GWMZNEIB5E743EUGAPF4YAWJJX","download_json":"https://pith.science/pith/GWMZNEIB5E743EUGAPF4YAWJJX.json","view_paper":"https://pith.science/paper/GWMZNEIB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09476&json=true","fetch_graph":"https://pith.science/api/pith-number/GWMZNEIB5E743EUGAPF4YAWJJX/graph.json","fetch_events":"https://pith.science/api/pith-number/GWMZNEIB5E743EUGAPF4YAWJJX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GWMZNEIB5E743EUGAPF4YAWJJX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GWMZNEIB5E743EUGAPF4YAWJJX/action/storage_attestation","attest_author":"https://pith.science/pith/GWMZNEIB5E743EUGAPF4YAWJJX/action/author_attestation","sign_citation":"https://pith.science/pith/GWMZNEIB5E743EUGAPF4YAWJJX/action/citation_signature","submit_replication":"https://pith.science/pith/GWMZNEIB5E743EUGAPF4YAWJJX/action/replication_record"}},"created_at":"2026-05-18T00:43:38.609833+00:00","updated_at":"2026-05-18T00:43:38.609833+00:00"}