{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KQL46MIXFY45TJ6NDM3AWMXJP2","short_pith_number":"pith:KQL46MIX","schema_version":"1.0","canonical_sha256":"5417cf31172e39d9a7cd1b360b32e97e8bf40bbd9ae601fe3f40530fcfd55dbe","source":{"kind":"arxiv","id":"2005.04671","version":2},"attestation_state":"computed","paper":{"title":"A Generalized Kernel Risk Sensitive Loss for Robust Two-Dimensional Singular Value Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Miaohua Zhang, Yongsheng Gao","submitted_at":"2020-05-10T14:02:40Z","abstract_excerpt":"Two-dimensional singular decomposition (2DSVD) has been widely used for image processing tasks, such as image reconstruction, classification, and clustering. However, traditional 2DSVD algorithm is based on the mean square error (MSE) loss, which is sensitive to outliers. To overcome this problem, we propose a robust 2DSVD framework based on a generalized kernel risk sensitive loss (GKRSL-2DSVD) which is more robust to noise and and outliers. Since the proposed objective function is non-convex, a majorization-minimization algorithm is developed to efficiently solve it with guaranteed convergen"},"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":"2005.04671","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-05-10T14:02:40Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c9ff6550d603192e2dc0264037d97e776cbf7b34923241ca20e91bcd51b83db9","abstract_canon_sha256":"9eb867613c2090191c6d4ca6475836bee6e108636c8ba14c019f069a3e0c21b1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:16:15.014646Z","signature_b64":"l7CXgRXBcmQTIz29GGsYANn8axbnMif6+QOEsdtzoYZk6/YfTiFTz+RPL5qVM36jDS/NKhpdMimV6yQAR79eCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5417cf31172e39d9a7cd1b360b32e97e8bf40bbd9ae601fe3f40530fcfd55dbe","last_reissued_at":"2026-07-05T01:16:15.014075Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:16:15.014075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Generalized Kernel Risk Sensitive Loss for Robust Two-Dimensional Singular Value Decomposition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.CV","authors_text":"Miaohua Zhang, Yongsheng Gao","submitted_at":"2020-05-10T14:02:40Z","abstract_excerpt":"Two-dimensional singular decomposition (2DSVD) has been widely used for image processing tasks, such as image reconstruction, classification, and clustering. However, traditional 2DSVD algorithm is based on the mean square error (MSE) loss, which is sensitive to outliers. To overcome this problem, we propose a robust 2DSVD framework based on a generalized kernel risk sensitive loss (GKRSL-2DSVD) which is more robust to noise and and outliers. Since the proposed objective function is non-convex, a majorization-minimization algorithm is developed to efficiently solve it with guaranteed convergen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.04671","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/2005.04671/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":"2005.04671","created_at":"2026-07-05T01:16:15.014139+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.04671v2","created_at":"2026-07-05T01:16:15.014139+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.04671","created_at":"2026-07-05T01:16:15.014139+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQL46MIXFY45","created_at":"2026-07-05T01:16:15.014139+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQL46MIXFY45TJ6N","created_at":"2026-07-05T01:16:15.014139+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQL46MIX","created_at":"2026-07-05T01:16:15.014139+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/KQL46MIXFY45TJ6NDM3AWMXJP2","json":"https://pith.science/pith/KQL46MIXFY45TJ6NDM3AWMXJP2.json","graph_json":"https://pith.science/api/pith-number/KQL46MIXFY45TJ6NDM3AWMXJP2/graph.json","events_json":"https://pith.science/api/pith-number/KQL46MIXFY45TJ6NDM3AWMXJP2/events.json","paper":"https://pith.science/paper/KQL46MIX"},"agent_actions":{"view_html":"https://pith.science/pith/KQL46MIXFY45TJ6NDM3AWMXJP2","download_json":"https://pith.science/pith/KQL46MIXFY45TJ6NDM3AWMXJP2.json","view_paper":"https://pith.science/paper/KQL46MIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.04671&json=true","fetch_graph":"https://pith.science/api/pith-number/KQL46MIXFY45TJ6NDM3AWMXJP2/graph.json","fetch_events":"https://pith.science/api/pith-number/KQL46MIXFY45TJ6NDM3AWMXJP2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQL46MIXFY45TJ6NDM3AWMXJP2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQL46MIXFY45TJ6NDM3AWMXJP2/action/storage_attestation","attest_author":"https://pith.science/pith/KQL46MIXFY45TJ6NDM3AWMXJP2/action/author_attestation","sign_citation":"https://pith.science/pith/KQL46MIXFY45TJ6NDM3AWMXJP2/action/citation_signature","submit_replication":"https://pith.science/pith/KQL46MIXFY45TJ6NDM3AWMXJP2/action/replication_record"}},"created_at":"2026-07-05T01:16:15.014139+00:00","updated_at":"2026-07-05T01:16:15.014139+00:00"}