{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:ICGURY7YGJROAPAOJXYFVCHJZ7","short_pith_number":"pith:ICGURY7Y","schema_version":"1.0","canonical_sha256":"408d48e3f83262e03c0e4df05a88e9cfec565b689027b27a127bbf13949c98a5","source":{"kind":"arxiv","id":"1810.12460","version":1},"attestation_state":"computed","paper":{"title":"A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ashkan Esmaeili, Farokh Marvasti","submitted_at":"2018-10-29T23:44:29Z","abstract_excerpt":"In this paper, we introduce a novel and robust approach to Quantized Matrix Completion (QMC). First, we propose a rank minimization problem with constraints induced by quantization bounds. Next, we form an unconstrained optimization problem by regularizing the rank function with Huber loss. Huber loss is leveraged to control the violation from quantization bounds due to two properties: 1- It is differentiable, 2- It is less sensitive to outliers than the quadratic loss. A Smooth Rank Approximation is utilized to endorse lower rank on the genuine data matrix. Thus, an unconstrained optimization"},"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":"1810.12460","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-10-29T23:44:29Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"6ac570f948db16bf905c79d5e42a7999776566229371732995d2d1699d21b30c","abstract_canon_sha256":"ef5856e3de559967ce0c8c063c090d6101ca15d9223d5eef0b1be02eecb26bf4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:24.919879Z","signature_b64":"X9T9acuCu6Jth+DbmdeN+/vV3FG5ey5hJTGJ8EXMn9qINpuY09O0nhVibRky0uKscSNzchQJya4m1aPx6KevCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"408d48e3f83262e03c0e4df05a88e9cfec565b689027b27a127bbf13949c98a5","last_reissued_at":"2026-05-17T23:53:24.919305Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:24.919305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Novel Approach to Quantized Matrix Completion Using Huber Loss Measure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Ashkan Esmaeili, Farokh Marvasti","submitted_at":"2018-10-29T23:44:29Z","abstract_excerpt":"In this paper, we introduce a novel and robust approach to Quantized Matrix Completion (QMC). First, we propose a rank minimization problem with constraints induced by quantization bounds. Next, we form an unconstrained optimization problem by regularizing the rank function with Huber loss. Huber loss is leveraged to control the violation from quantization bounds due to two properties: 1- It is differentiable, 2- It is less sensitive to outliers than the quadratic loss. A Smooth Rank Approximation is utilized to endorse lower rank on the genuine data matrix. Thus, an unconstrained optimization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.12460","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":"1810.12460","created_at":"2026-05-17T23:53:24.919382+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.12460v1","created_at":"2026-05-17T23:53:24.919382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.12460","created_at":"2026-05-17T23:53:24.919382+00:00"},{"alias_kind":"pith_short_12","alias_value":"ICGURY7YGJRO","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"ICGURY7YGJROAPAO","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"ICGURY7Y","created_at":"2026-05-18T12:32:28.185984+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/ICGURY7YGJROAPAOJXYFVCHJZ7","json":"https://pith.science/pith/ICGURY7YGJROAPAOJXYFVCHJZ7.json","graph_json":"https://pith.science/api/pith-number/ICGURY7YGJROAPAOJXYFVCHJZ7/graph.json","events_json":"https://pith.science/api/pith-number/ICGURY7YGJROAPAOJXYFVCHJZ7/events.json","paper":"https://pith.science/paper/ICGURY7Y"},"agent_actions":{"view_html":"https://pith.science/pith/ICGURY7YGJROAPAOJXYFVCHJZ7","download_json":"https://pith.science/pith/ICGURY7YGJROAPAOJXYFVCHJZ7.json","view_paper":"https://pith.science/paper/ICGURY7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.12460&json=true","fetch_graph":"https://pith.science/api/pith-number/ICGURY7YGJROAPAOJXYFVCHJZ7/graph.json","fetch_events":"https://pith.science/api/pith-number/ICGURY7YGJROAPAOJXYFVCHJZ7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ICGURY7YGJROAPAOJXYFVCHJZ7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ICGURY7YGJROAPAOJXYFVCHJZ7/action/storage_attestation","attest_author":"https://pith.science/pith/ICGURY7YGJROAPAOJXYFVCHJZ7/action/author_attestation","sign_citation":"https://pith.science/pith/ICGURY7YGJROAPAOJXYFVCHJZ7/action/citation_signature","submit_replication":"https://pith.science/pith/ICGURY7YGJROAPAOJXYFVCHJZ7/action/replication_record"}},"created_at":"2026-05-17T23:53:24.919382+00:00","updated_at":"2026-05-17T23:53:24.919382+00:00"}