{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:35ADFMNT5NVPRVOQ2ZM4BZKDTD","short_pith_number":"pith:35ADFMNT","schema_version":"1.0","canonical_sha256":"df4032b1b3eb6af8d5d0d659c0e54398f1d1347b8f5b84089fb5c48bd64b6832","source":{"kind":"arxiv","id":"1612.01663","version":1},"attestation_state":"computed","paper":{"title":"Efficient Non-oblivious Randomized Reduction for Risk Minimization with Improved Excess Risk Guarantee","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haiqin Yang, Lijun Zhang, Tianbao Yang, Yi Xu","submitted_at":"2016-12-06T04:58:45Z","abstract_excerpt":"In this paper, we address learning problems for high dimensional data. Previously, oblivious random projection based approaches that project high dimensional features onto a random subspace have been used in practice for tackling high-dimensionality challenge in machine learning. Recently, various non-oblivious randomized reduction methods have been developed and deployed for solving many numerical problems such as matrix product approximation, low-rank matrix approximation, etc. However, they are less explored for the machine learning tasks, e.g., classification. More seriously, the theoretic"},"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":"1612.01663","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-12-06T04:58:45Z","cross_cats_sorted":[],"title_canon_sha256":"c293e294c1c01f85bb9165b2f114610bcedc39f38be0b104b7da128b32ce3e5c","abstract_canon_sha256":"3d264f03905964aa4dbbea6ef8395a959b53e27ee3ba6fb380375c5efffd969e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:47.910050Z","signature_b64":"q/GekRsvVuSoU2CyHMbQ4BSovTNUYyM6svJLpBswBMBtXEzDIPdHmeU7d/OQ3/gTsCzCZi+8inDeuibpIfzwAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df4032b1b3eb6af8d5d0d659c0e54398f1d1347b8f5b84089fb5c48bd64b6832","last_reissued_at":"2026-05-18T00:55:47.909398Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:47.909398Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient Non-oblivious Randomized Reduction for Risk Minimization with Improved Excess Risk Guarantee","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Haiqin Yang, Lijun Zhang, Tianbao Yang, Yi Xu","submitted_at":"2016-12-06T04:58:45Z","abstract_excerpt":"In this paper, we address learning problems for high dimensional data. Previously, oblivious random projection based approaches that project high dimensional features onto a random subspace have been used in practice for tackling high-dimensionality challenge in machine learning. Recently, various non-oblivious randomized reduction methods have been developed and deployed for solving many numerical problems such as matrix product approximation, low-rank matrix approximation, etc. However, they are less explored for the machine learning tasks, e.g., classification. More seriously, the theoretic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.01663","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":""},"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":"1612.01663","created_at":"2026-05-18T00:55:47.909512+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.01663v1","created_at":"2026-05-18T00:55:47.909512+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.01663","created_at":"2026-05-18T00:55:47.909512+00:00"},{"alias_kind":"pith_short_12","alias_value":"35ADFMNT5NVP","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"35ADFMNT5NVPRVOQ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"35ADFMNT","created_at":"2026-05-18T12:29:55.572404+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/35ADFMNT5NVPRVOQ2ZM4BZKDTD","json":"https://pith.science/pith/35ADFMNT5NVPRVOQ2ZM4BZKDTD.json","graph_json":"https://pith.science/api/pith-number/35ADFMNT5NVPRVOQ2ZM4BZKDTD/graph.json","events_json":"https://pith.science/api/pith-number/35ADFMNT5NVPRVOQ2ZM4BZKDTD/events.json","paper":"https://pith.science/paper/35ADFMNT"},"agent_actions":{"view_html":"https://pith.science/pith/35ADFMNT5NVPRVOQ2ZM4BZKDTD","download_json":"https://pith.science/pith/35ADFMNT5NVPRVOQ2ZM4BZKDTD.json","view_paper":"https://pith.science/paper/35ADFMNT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.01663&json=true","fetch_graph":"https://pith.science/api/pith-number/35ADFMNT5NVPRVOQ2ZM4BZKDTD/graph.json","fetch_events":"https://pith.science/api/pith-number/35ADFMNT5NVPRVOQ2ZM4BZKDTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/35ADFMNT5NVPRVOQ2ZM4BZKDTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/35ADFMNT5NVPRVOQ2ZM4BZKDTD/action/storage_attestation","attest_author":"https://pith.science/pith/35ADFMNT5NVPRVOQ2ZM4BZKDTD/action/author_attestation","sign_citation":"https://pith.science/pith/35ADFMNT5NVPRVOQ2ZM4BZKDTD/action/citation_signature","submit_replication":"https://pith.science/pith/35ADFMNT5NVPRVOQ2ZM4BZKDTD/action/replication_record"}},"created_at":"2026-05-18T00:55:47.909512+00:00","updated_at":"2026-05-18T00:55:47.909512+00:00"}