{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:KH26G4WYD5RMT2N27MMFFS46TJ","short_pith_number":"pith:KH26G4WY","schema_version":"1.0","canonical_sha256":"51f5e372d81f62c9e9bafb1852cb9e9a7ef1e896ac0bcb43f8f893183b57f927","source":{"kind":"arxiv","id":"1412.4044","version":2},"attestation_state":"computed","paper":{"title":"Adaptive Stochastic Gradient Descent on the Grassmannian for Robust Low-Rank Subspace Recovery and Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA","math.OC"],"primary_cat":"stat.ML","authors_text":"Jun He, Yue Zhang","submitted_at":"2014-12-12T16:32:48Z","abstract_excerpt":"In this paper, we present GASG21 (Grassmannian Adaptive Stochastic Gradient for $L_{2,1}$ norm minimization), an adaptive stochastic gradient algorithm to robustly recover the low-rank subspace from a large matrix. In the presence of column outliers, we reformulate the batch mode matrix $L_{2,1}$ norm minimization with rank constraint problem as a stochastic optimization approach constrained on Grassmann manifold. For each observed data vector, the low-rank subspace $\\mathcal{S}$ is updated by taking a gradient step along the geodesic of Grassmannian. In order to accelerate the convergence rat"},"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":"1412.4044","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-12-12T16:32:48Z","cross_cats_sorted":["cs.CV","cs.NA","math.OC"],"title_canon_sha256":"23d8459c8d74dd38a56e5386b9daba9b50a51128fbb8f26de8096046e3de6d88","abstract_canon_sha256":"afb8d8a720288de733aac59151d51456dadbb9af9dda778d7f97ca68a41e1efa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:31.289684Z","signature_b64":"Yrrembu324TxiPhOr6neaDUx0pilKtEl5i6TLPachKKi7RRbFSzSiQh6Yn+gZl4JkN0Gcj9hMkK9eSE/lki7BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51f5e372d81f62c9e9bafb1852cb9e9a7ef1e896ac0bcb43f8f893183b57f927","last_reissued_at":"2026-05-18T02:18:31.289252Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:31.289252Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Adaptive Stochastic Gradient Descent on the Grassmannian for Robust Low-Rank Subspace Recovery and Clustering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","cs.NA","math.OC"],"primary_cat":"stat.ML","authors_text":"Jun He, Yue Zhang","submitted_at":"2014-12-12T16:32:48Z","abstract_excerpt":"In this paper, we present GASG21 (Grassmannian Adaptive Stochastic Gradient for $L_{2,1}$ norm minimization), an adaptive stochastic gradient algorithm to robustly recover the low-rank subspace from a large matrix. In the presence of column outliers, we reformulate the batch mode matrix $L_{2,1}$ norm minimization with rank constraint problem as a stochastic optimization approach constrained on Grassmann manifold. For each observed data vector, the low-rank subspace $\\mathcal{S}$ is updated by taking a gradient step along the geodesic of Grassmannian. In order to accelerate the convergence rat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4044","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":"1412.4044","created_at":"2026-05-18T02:18:31.289331+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.4044v2","created_at":"2026-05-18T02:18:31.289331+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4044","created_at":"2026-05-18T02:18:31.289331+00:00"},{"alias_kind":"pith_short_12","alias_value":"KH26G4WYD5RM","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"KH26G4WYD5RMT2N2","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"KH26G4WY","created_at":"2026-05-18T12:28:35.611951+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/KH26G4WYD5RMT2N27MMFFS46TJ","json":"https://pith.science/pith/KH26G4WYD5RMT2N27MMFFS46TJ.json","graph_json":"https://pith.science/api/pith-number/KH26G4WYD5RMT2N27MMFFS46TJ/graph.json","events_json":"https://pith.science/api/pith-number/KH26G4WYD5RMT2N27MMFFS46TJ/events.json","paper":"https://pith.science/paper/KH26G4WY"},"agent_actions":{"view_html":"https://pith.science/pith/KH26G4WYD5RMT2N27MMFFS46TJ","download_json":"https://pith.science/pith/KH26G4WYD5RMT2N27MMFFS46TJ.json","view_paper":"https://pith.science/paper/KH26G4WY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.4044&json=true","fetch_graph":"https://pith.science/api/pith-number/KH26G4WYD5RMT2N27MMFFS46TJ/graph.json","fetch_events":"https://pith.science/api/pith-number/KH26G4WYD5RMT2N27MMFFS46TJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KH26G4WYD5RMT2N27MMFFS46TJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KH26G4WYD5RMT2N27MMFFS46TJ/action/storage_attestation","attest_author":"https://pith.science/pith/KH26G4WYD5RMT2N27MMFFS46TJ/action/author_attestation","sign_citation":"https://pith.science/pith/KH26G4WYD5RMT2N27MMFFS46TJ/action/citation_signature","submit_replication":"https://pith.science/pith/KH26G4WYD5RMT2N27MMFFS46TJ/action/replication_record"}},"created_at":"2026-05-18T02:18:31.289331+00:00","updated_at":"2026-05-18T02:18:31.289331+00:00"}