{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7QNBRDUZUEAIVBW3P2RPCTZLRP","short_pith_number":"pith:7QNBRDUZ","schema_version":"1.0","canonical_sha256":"fc1a188e99a1008a86db7ea2f14f2b8bcae6da42a84ae5196beded3332590730","source":{"kind":"arxiv","id":"1402.4844","version":2},"attestation_state":"computed","paper":{"title":"Subspace Learning with Partial Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alon Gonen, Dan Rosenbaum, Shai Shalev-Shwartz, Yonina Eldar","submitted_at":"2014-02-19T22:57:03Z","abstract_excerpt":"The goal of subspace learning is to find a $k$-dimensional subspace of $\\mathbb{R}^d$, such that the expected squared distance between instance vectors and the subspace is as small as possible. In this paper we study subspace learning in a partial information setting, in which the learner can only observe $r \\le d$ attributes from each instance vector. We propose several efficient algorithms for this task, and analyze their sample complexity"},"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":"1402.4844","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-02-19T22:57:03Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"a4e6038a2b45f8c877c94d3769eac21c5dc93daf94beebd62f75cc94ef4d4811","abstract_canon_sha256":"58672ee379f14f391ef18211986954f447e8e68397778a4f7e66e72a3fa5f236"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:13:38.418436Z","signature_b64":"6D5YN27wj3WxKcCEp8yZQtuvAr7rbfLqT3xHZkKSYknrbsPzBsU7jcLmKC/Uhd2Pm+PbjSjL2phgJrNJYs9xAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc1a188e99a1008a86db7ea2f14f2b8bcae6da42a84ae5196beded3332590730","last_reissued_at":"2026-05-18T01:13:38.417851Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:13:38.417851Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Subspace Learning with Partial Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alon Gonen, Dan Rosenbaum, Shai Shalev-Shwartz, Yonina Eldar","submitted_at":"2014-02-19T22:57:03Z","abstract_excerpt":"The goal of subspace learning is to find a $k$-dimensional subspace of $\\mathbb{R}^d$, such that the expected squared distance between instance vectors and the subspace is as small as possible. In this paper we study subspace learning in a partial information setting, in which the learner can only observe $r \\le d$ attributes from each instance vector. We propose several efficient algorithms for this task, and analyze their sample complexity"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4844","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":"1402.4844","created_at":"2026-05-18T01:13:38.417943+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4844v2","created_at":"2026-05-18T01:13:38.417943+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4844","created_at":"2026-05-18T01:13:38.417943+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QNBRDUZUEAI","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QNBRDUZUEAIVBW3","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QNBRDUZ","created_at":"2026-05-18T12:28:19.803747+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/7QNBRDUZUEAIVBW3P2RPCTZLRP","json":"https://pith.science/pith/7QNBRDUZUEAIVBW3P2RPCTZLRP.json","graph_json":"https://pith.science/api/pith-number/7QNBRDUZUEAIVBW3P2RPCTZLRP/graph.json","events_json":"https://pith.science/api/pith-number/7QNBRDUZUEAIVBW3P2RPCTZLRP/events.json","paper":"https://pith.science/paper/7QNBRDUZ"},"agent_actions":{"view_html":"https://pith.science/pith/7QNBRDUZUEAIVBW3P2RPCTZLRP","download_json":"https://pith.science/pith/7QNBRDUZUEAIVBW3P2RPCTZLRP.json","view_paper":"https://pith.science/paper/7QNBRDUZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4844&json=true","fetch_graph":"https://pith.science/api/pith-number/7QNBRDUZUEAIVBW3P2RPCTZLRP/graph.json","fetch_events":"https://pith.science/api/pith-number/7QNBRDUZUEAIVBW3P2RPCTZLRP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QNBRDUZUEAIVBW3P2RPCTZLRP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QNBRDUZUEAIVBW3P2RPCTZLRP/action/storage_attestation","attest_author":"https://pith.science/pith/7QNBRDUZUEAIVBW3P2RPCTZLRP/action/author_attestation","sign_citation":"https://pith.science/pith/7QNBRDUZUEAIVBW3P2RPCTZLRP/action/citation_signature","submit_replication":"https://pith.science/pith/7QNBRDUZUEAIVBW3P2RPCTZLRP/action/replication_record"}},"created_at":"2026-05-18T01:13:38.417943+00:00","updated_at":"2026-05-18T01:13:38.417943+00:00"}