{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3GRBVGLHPR3UK542OTB4DKI3DM","short_pith_number":"pith:3GRBVGLH","schema_version":"1.0","canonical_sha256":"d9a21a99677c7745779a74c3c1a91b1b0216d639b4f0a5dfaf845c88d2cae8bb","source":{"kind":"arxiv","id":"1406.3190","version":4},"attestation_state":"computed","paper":{"title":"Online Optimization for Large-Scale Max-Norm Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Huan Xu, Jie Shen, Ping Li","submitted_at":"2014-06-12T10:49:50Z","abstract_excerpt":"Max-norm regularizer has been extensively studied in the last decade as it promotes an effective low-rank estimation for the underlying data. However, such max-norm regularized problems are typically formulated and solved in a batch manner, which prevents it from processing big data due to possible memory budget. In this paper, hence, we propose an online algorithm that is scalable to large-scale setting. Particularly, we consider the matrix decomposition problem as an example, although a simple variant of the algorithm and analysis can be adapted to other important problems such as matrix com"},"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":"1406.3190","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-06-12T10:49:50Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"3a083c5601a0b5f23f43b600c219e66d2c2b5ebfae5360964b4cdae8a4ec5edc","abstract_canon_sha256":"58665faa2e63b32e558303ef223a90244621fda351b0f64f20a5a5e3bf65550c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:14:53.474000Z","signature_b64":"kTqT6Ic9V9TvB4RCEWsW5owInS/Nkb54PonGGRnwqAKnGGxQ5BXiXErtrHjuic7aIks22K57mCOe1wZRTeO+AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9a21a99677c7745779a74c3c1a91b1b0216d639b4f0a5dfaf845c88d2cae8bb","last_reissued_at":"2026-05-18T01:14:53.473335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:14:53.473335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Optimization for Large-Scale Max-Norm Regularization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Huan Xu, Jie Shen, Ping Li","submitted_at":"2014-06-12T10:49:50Z","abstract_excerpt":"Max-norm regularizer has been extensively studied in the last decade as it promotes an effective low-rank estimation for the underlying data. However, such max-norm regularized problems are typically formulated and solved in a batch manner, which prevents it from processing big data due to possible memory budget. In this paper, hence, we propose an online algorithm that is scalable to large-scale setting. Particularly, we consider the matrix decomposition problem as an example, although a simple variant of the algorithm and analysis can be adapted to other important problems such as matrix com"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.3190","kind":"arxiv","version":4},"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":"1406.3190","created_at":"2026-05-18T01:14:53.473449+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.3190v4","created_at":"2026-05-18T01:14:53.473449+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.3190","created_at":"2026-05-18T01:14:53.473449+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GRBVGLHPR3U","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GRBVGLHPR3UK542","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GRBVGLH","created_at":"2026-05-18T12:28:11.866339+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/3GRBVGLHPR3UK542OTB4DKI3DM","json":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM.json","graph_json":"https://pith.science/api/pith-number/3GRBVGLHPR3UK542OTB4DKI3DM/graph.json","events_json":"https://pith.science/api/pith-number/3GRBVGLHPR3UK542OTB4DKI3DM/events.json","paper":"https://pith.science/paper/3GRBVGLH"},"agent_actions":{"view_html":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM","download_json":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM.json","view_paper":"https://pith.science/paper/3GRBVGLH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.3190&json=true","fetch_graph":"https://pith.science/api/pith-number/3GRBVGLHPR3UK542OTB4DKI3DM/graph.json","fetch_events":"https://pith.science/api/pith-number/3GRBVGLHPR3UK542OTB4DKI3DM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM/action/storage_attestation","attest_author":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM/action/author_attestation","sign_citation":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM/action/citation_signature","submit_replication":"https://pith.science/pith/3GRBVGLHPR3UK542OTB4DKI3DM/action/replication_record"}},"created_at":"2026-05-18T01:14:53.473449+00:00","updated_at":"2026-05-18T01:14:53.473449+00:00"}