{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:JUUV4AHXEO7FY52IEAPZDIQU62","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"07e7d88f213bd2d7e35e76cc0160c13685e2f18799c517c0bd060b9a163e621f","cross_cats_sorted":["cs.DS","math.OC","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-04T10:48:04Z","title_canon_sha256":"6ef55578fe8382bcb3e15c7b3499abfc956c0c19b60c154c05703648d62b55fb"},"schema_version":"1.0","source":{"id":"2005.01378","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2005.01378","created_at":"2026-07-05T01:00:07Z"},{"alias_kind":"arxiv_version","alias_value":"2005.01378v1","created_at":"2026-07-05T01:00:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.01378","created_at":"2026-07-05T01:00:07Z"},{"alias_kind":"pith_short_12","alias_value":"JUUV4AHXEO7F","created_at":"2026-07-05T01:00:07Z"},{"alias_kind":"pith_short_16","alias_value":"JUUV4AHXEO7FY52I","created_at":"2026-07-05T01:00:07Z"},{"alias_kind":"pith_short_8","alias_value":"JUUV4AHX","created_at":"2026-07-05T01:00:07Z"}],"graph_snapshots":[{"event_id":"sha256:f2250763f33fac81feaf6aa16d15ed38bcde6c85c8a8de789b750fb6203ffc90","target":"graph","created_at":"2026-07-05T01:00:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2005.01378/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study the problem of high-dimensional robust mean estimation in the presence of a constant fraction of adversarial outliers. A recent line of work has provided sophisticated polynomial-time algorithms for this problem with dimension-independent error guarantees for a range of natural distribution families.\n  In this work, we show that a natural non-convex formulation of the problem can be solved directly by gradient descent. Our approach leverages a novel structural lemma, roughly showing that any approximate stationary point of our non-convex objective gives a near-optimal solution to the ","authors_text":"Ilias Diakonikolas, Mahdi Soltanolkotabi, Rong Ge, Yu Cheng","cross_cats":["cs.DS","math.OC","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-04T10:48:04Z","title":"High-Dimensional Robust Mean Estimation via Gradient Descent"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.01378","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:037d046e01044efb4e0c1f7674404d9c4921ac3d6e820baf6181f6b900f933d4","target":"record","created_at":"2026-07-05T01:00:07Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"07e7d88f213bd2d7e35e76cc0160c13685e2f18799c517c0bd060b9a163e621f","cross_cats_sorted":["cs.DS","math.OC","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-04T10:48:04Z","title_canon_sha256":"6ef55578fe8382bcb3e15c7b3499abfc956c0c19b60c154c05703648d62b55fb"},"schema_version":"1.0","source":{"id":"2005.01378","kind":"arxiv","version":1}},"canonical_sha256":"4d295e00f723be5c7748201f91a214f6868a56f18c3036119fe695a0aa1ce02f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4d295e00f723be5c7748201f91a214f6868a56f18c3036119fe695a0aa1ce02f","first_computed_at":"2026-07-05T01:00:07.163467Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:00:07.163467Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IY3I39xnP7wLtiynwcsEINuD1aZ2f+oN57Mx83q4xaQVi7rdUqcEI6mwG2MVsK9ty/LYnybpiYTrwssXiLtgBQ==","signature_status":"signed_v1","signed_at":"2026-07-05T01:00:07.163886Z","signed_message":"canonical_sha256_bytes"},"source_id":"2005.01378","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:037d046e01044efb4e0c1f7674404d9c4921ac3d6e820baf6181f6b900f933d4","sha256:f2250763f33fac81feaf6aa16d15ed38bcde6c85c8a8de789b750fb6203ffc90"],"state_sha256":"5281a198ff43c4cbc66dc0fa3fe01738960b8e3024eb42af9ccec1b3d5e0302d"}