{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GAHD2Y22POARIQWSEPN67FJYI2","short_pith_number":"pith:GAHD2Y22","schema_version":"1.0","canonical_sha256":"300e3d635a7b811442d223dbef953846b1e68afcc3639131213519c03435f03c","source":{"kind":"arxiv","id":"1905.12115","version":2},"attestation_state":"computed","paper":{"title":"AdaOja: Adaptive Learning Rates for Streaming PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Amelia Henriksen, Rachel Ward","submitted_at":"2019-05-28T22:02:24Z","abstract_excerpt":"Oja's algorithm has been the cornerstone of streaming methods in Principal Component Analysis (PCA) since it was first proposed in 1982. However, Oja's algorithm does not have a standardized choice of learning rate (step size) that both performs well in practice and truly conforms to the online streaming setting. In this paper, we propose a new learning rate scheme for Oja's method called AdaOja. This new algorithm requires only a single pass over the data and does not depend on knowing properties of the data set a priori. AdaOja is a novel variation of the Adagrad algorithm to Oja's algorithm"},"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":"1905.12115","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-05-28T22:02:24Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"0136f71102b4ac41f5bd644a1a3ed7dd4cb95619b1c97da230a1e733ee01a61a","abstract_canon_sha256":"dd0ef85fa766b5c231a844b08c9f97f72687fcd2a8e28cd7566beb81ce4b0d3c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:16:20.291383Z","signature_b64":"P61NVVUGb54wAYHsuIhVeph1na4/fMCm3sE6LP5HZ5QFVZSJLhTmCvYa5EWc/ZKkuG5AF1BZCPAQbDn6DvzJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"300e3d635a7b811442d223dbef953846b1e68afcc3639131213519c03435f03c","last_reissued_at":"2026-07-05T00:16:20.290917Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:16:20.290917Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"AdaOja: Adaptive Learning Rates for Streaming PCA","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Amelia Henriksen, Rachel Ward","submitted_at":"2019-05-28T22:02:24Z","abstract_excerpt":"Oja's algorithm has been the cornerstone of streaming methods in Principal Component Analysis (PCA) since it was first proposed in 1982. However, Oja's algorithm does not have a standardized choice of learning rate (step size) that both performs well in practice and truly conforms to the online streaming setting. In this paper, we propose a new learning rate scheme for Oja's method called AdaOja. This new algorithm requires only a single pass over the data and does not depend on knowing properties of the data set a priori. AdaOja is a novel variation of the Adagrad algorithm to Oja's algorithm"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.12115","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1905.12115/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":"1905.12115","created_at":"2026-07-05T00:16:20.290985+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.12115v2","created_at":"2026-07-05T00:16:20.290985+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.12115","created_at":"2026-07-05T00:16:20.290985+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAHD2Y22POAR","created_at":"2026-07-05T00:16:20.290985+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAHD2Y22POARIQWS","created_at":"2026-07-05T00:16:20.290985+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAHD2Y22","created_at":"2026-07-05T00:16:20.290985+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.12655","citing_title":"Beyond Sin-Squared Error: Linear-Time Entrywise Uncertainty Quantification for Streaming PCA","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GAHD2Y22POARIQWSEPN67FJYI2","json":"https://pith.science/pith/GAHD2Y22POARIQWSEPN67FJYI2.json","graph_json":"https://pith.science/api/pith-number/GAHD2Y22POARIQWSEPN67FJYI2/graph.json","events_json":"https://pith.science/api/pith-number/GAHD2Y22POARIQWSEPN67FJYI2/events.json","paper":"https://pith.science/paper/GAHD2Y22"},"agent_actions":{"view_html":"https://pith.science/pith/GAHD2Y22POARIQWSEPN67FJYI2","download_json":"https://pith.science/pith/GAHD2Y22POARIQWSEPN67FJYI2.json","view_paper":"https://pith.science/paper/GAHD2Y22","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.12115&json=true","fetch_graph":"https://pith.science/api/pith-number/GAHD2Y22POARIQWSEPN67FJYI2/graph.json","fetch_events":"https://pith.science/api/pith-number/GAHD2Y22POARIQWSEPN67FJYI2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAHD2Y22POARIQWSEPN67FJYI2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAHD2Y22POARIQWSEPN67FJYI2/action/storage_attestation","attest_author":"https://pith.science/pith/GAHD2Y22POARIQWSEPN67FJYI2/action/author_attestation","sign_citation":"https://pith.science/pith/GAHD2Y22POARIQWSEPN67FJYI2/action/citation_signature","submit_replication":"https://pith.science/pith/GAHD2Y22POARIQWSEPN67FJYI2/action/replication_record"}},"created_at":"2026-07-05T00:16:20.290985+00:00","updated_at":"2026-07-05T00:16:20.290985+00:00"}