{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:RMN5PSZH5WU4SJQNTOOJZ7L6GC","short_pith_number":"pith:RMN5PSZH","schema_version":"1.0","canonical_sha256":"8b1bd7cb27eda9c9260d9b9c9cfd7e30b3e98eeb109b44d3eeb1ad7780e7b33e","source":{"kind":"arxiv","id":"2105.03678","version":1},"attestation_state":"computed","paper":{"title":"Nearly Minimax-Optimal Rates for Noisy Sparse Phase Retrieval via Early-Stopped Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"eess.SP","authors_text":"Fan Wu, Patrick Rebeschini","submitted_at":"2021-05-08T11:22:19Z","abstract_excerpt":"This paper studies early-stopped mirror descent applied to noisy sparse phase retrieval, which is the problem of recovering a $k$-sparse signal $\\mathbf{x}^\\star\\in\\mathbb{R}^n$ from a set of quadratic Gaussian measurements corrupted by sub-exponential noise. We consider the (non-convex) unregularized empirical risk minimization problem and show that early-stopped mirror descent, when equipped with the hyperbolic entropy mirror map and proper initialization, achieves a nearly minimax-optimal rate of convergence, provided the sample size is at least of order $k^2$ (modulo logarithmic term) and "},"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":"2105.03678","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2021-05-08T11:22:19Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"ca8edb70524296ff1bd1b79d20bb1cf9287f0a9395a4956b5b0aa7adb2a8d6a5","abstract_canon_sha256":"5e33964de47c86b91424bc2f5d02b3b418efb4af495d2c42a2323b3e700bca1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:38:37.926949Z","signature_b64":"v7IO8Bka/Iqg+rIEE756tMmlSBSezyJYGifM12MZ0X+PTdI/XSJfolM07gE7fqtBO1xH/4z7LLM2Q4UiQVMNCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b1bd7cb27eda9c9260d9b9c9cfd7e30b3e98eeb109b44d3eeb1ad7780e7b33e","last_reissued_at":"2026-07-05T02:38:37.926464Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:38:37.926464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nearly Minimax-Optimal Rates for Noisy Sparse Phase Retrieval via Early-Stopped Mirror Descent","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"eess.SP","authors_text":"Fan Wu, Patrick Rebeschini","submitted_at":"2021-05-08T11:22:19Z","abstract_excerpt":"This paper studies early-stopped mirror descent applied to noisy sparse phase retrieval, which is the problem of recovering a $k$-sparse signal $\\mathbf{x}^\\star\\in\\mathbb{R}^n$ from a set of quadratic Gaussian measurements corrupted by sub-exponential noise. We consider the (non-convex) unregularized empirical risk minimization problem and show that early-stopped mirror descent, when equipped with the hyperbolic entropy mirror map and proper initialization, achieves a nearly minimax-optimal rate of convergence, provided the sample size is at least of order $k^2$ (modulo logarithmic term) and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.03678","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.03678/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.03678","created_at":"2026-07-05T02:38:37.926527+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.03678v1","created_at":"2026-07-05T02:38:37.926527+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.03678","created_at":"2026-07-05T02:38:37.926527+00:00"},{"alias_kind":"pith_short_12","alias_value":"RMN5PSZH5WU4","created_at":"2026-07-05T02:38:37.926527+00:00"},{"alias_kind":"pith_short_16","alias_value":"RMN5PSZH5WU4SJQN","created_at":"2026-07-05T02:38:37.926527+00:00"},{"alias_kind":"pith_short_8","alias_value":"RMN5PSZH","created_at":"2026-07-05T02:38:37.926527+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/RMN5PSZH5WU4SJQNTOOJZ7L6GC","json":"https://pith.science/pith/RMN5PSZH5WU4SJQNTOOJZ7L6GC.json","graph_json":"https://pith.science/api/pith-number/RMN5PSZH5WU4SJQNTOOJZ7L6GC/graph.json","events_json":"https://pith.science/api/pith-number/RMN5PSZH5WU4SJQNTOOJZ7L6GC/events.json","paper":"https://pith.science/paper/RMN5PSZH"},"agent_actions":{"view_html":"https://pith.science/pith/RMN5PSZH5WU4SJQNTOOJZ7L6GC","download_json":"https://pith.science/pith/RMN5PSZH5WU4SJQNTOOJZ7L6GC.json","view_paper":"https://pith.science/paper/RMN5PSZH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.03678&json=true","fetch_graph":"https://pith.science/api/pith-number/RMN5PSZH5WU4SJQNTOOJZ7L6GC/graph.json","fetch_events":"https://pith.science/api/pith-number/RMN5PSZH5WU4SJQNTOOJZ7L6GC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RMN5PSZH5WU4SJQNTOOJZ7L6GC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RMN5PSZH5WU4SJQNTOOJZ7L6GC/action/storage_attestation","attest_author":"https://pith.science/pith/RMN5PSZH5WU4SJQNTOOJZ7L6GC/action/author_attestation","sign_citation":"https://pith.science/pith/RMN5PSZH5WU4SJQNTOOJZ7L6GC/action/citation_signature","submit_replication":"https://pith.science/pith/RMN5PSZH5WU4SJQNTOOJZ7L6GC/action/replication_record"}},"created_at":"2026-07-05T02:38:37.926527+00:00","updated_at":"2026-07-05T02:38:37.926527+00:00"}