{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MX3EDB6ZQ767647VVDF22ZZLRB","short_pith_number":"pith:MX3EDB6Z","schema_version":"1.0","canonical_sha256":"65f64187d987fdff73f5a8cbad672b8871e1dc567cdb02622a483d12b9c18f7b","source":{"kind":"arxiv","id":"1410.6990","version":1},"attestation_state":"computed","paper":{"title":"Local Rademacher Complexity for Multi-label Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chang Xu, Chao Xu, Dacheng Tao, Tongliang Liu","submitted_at":"2014-10-26T05:52:33Z","abstract_excerpt":"We analyze the local Rademacher complexity of empirical risk minimization (ERM)-based multi-label learning algorithms, and in doing so propose a new algorithm for multi-label learning. Rather than using the trace norm to regularize the multi-label predictor, we instead minimize the tail sum of the singular values of the predictor in multi-label learning. Benefiting from the use of the local Rademacher complexity, our algorithm, therefore, has a sharper generalization error bound and a faster convergence rate. Compared to methods that minimize over all singular values, concentrating on the tail"},"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":"1410.6990","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-10-26T05:52:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"93cf55ae0ecda0fd73f5854b58501ac8692a38b779882d5e8172b1550ede43c3","abstract_canon_sha256":"c89950b618919be480d2585fb59a1518688f6ee44fadc597e3f0dc1ef00ed361"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:18.218455Z","signature_b64":"n2purhq2ZKPvYLY1gRbj4FODPAGGXzmLG/uongYviUiwsFg7NOPXIotr53J51JRhARE9Na4f6jfdP4K8WbUWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65f64187d987fdff73f5a8cbad672b8871e1dc567cdb02622a483d12b9c18f7b","last_reissued_at":"2026-05-18T02:39:18.218078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:18.218078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Rademacher Complexity for Multi-label Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Chang Xu, Chao Xu, Dacheng Tao, Tongliang Liu","submitted_at":"2014-10-26T05:52:33Z","abstract_excerpt":"We analyze the local Rademacher complexity of empirical risk minimization (ERM)-based multi-label learning algorithms, and in doing so propose a new algorithm for multi-label learning. Rather than using the trace norm to regularize the multi-label predictor, we instead minimize the tail sum of the singular values of the predictor in multi-label learning. Benefiting from the use of the local Rademacher complexity, our algorithm, therefore, has a sharper generalization error bound and a faster convergence rate. Compared to methods that minimize over all singular values, concentrating on the tail"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6990","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":"1410.6990","created_at":"2026-05-18T02:39:18.218130+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6990v1","created_at":"2026-05-18T02:39:18.218130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6990","created_at":"2026-05-18T02:39:18.218130+00:00"},{"alias_kind":"pith_short_12","alias_value":"MX3EDB6ZQ767","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MX3EDB6ZQ767647V","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MX3EDB6Z","created_at":"2026-05-18T12:28:38.356838+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/MX3EDB6ZQ767647VVDF22ZZLRB","json":"https://pith.science/pith/MX3EDB6ZQ767647VVDF22ZZLRB.json","graph_json":"https://pith.science/api/pith-number/MX3EDB6ZQ767647VVDF22ZZLRB/graph.json","events_json":"https://pith.science/api/pith-number/MX3EDB6ZQ767647VVDF22ZZLRB/events.json","paper":"https://pith.science/paper/MX3EDB6Z"},"agent_actions":{"view_html":"https://pith.science/pith/MX3EDB6ZQ767647VVDF22ZZLRB","download_json":"https://pith.science/pith/MX3EDB6ZQ767647VVDF22ZZLRB.json","view_paper":"https://pith.science/paper/MX3EDB6Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6990&json=true","fetch_graph":"https://pith.science/api/pith-number/MX3EDB6ZQ767647VVDF22ZZLRB/graph.json","fetch_events":"https://pith.science/api/pith-number/MX3EDB6ZQ767647VVDF22ZZLRB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MX3EDB6ZQ767647VVDF22ZZLRB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MX3EDB6ZQ767647VVDF22ZZLRB/action/storage_attestation","attest_author":"https://pith.science/pith/MX3EDB6ZQ767647VVDF22ZZLRB/action/author_attestation","sign_citation":"https://pith.science/pith/MX3EDB6ZQ767647VVDF22ZZLRB/action/citation_signature","submit_replication":"https://pith.science/pith/MX3EDB6ZQ767647VVDF22ZZLRB/action/replication_record"}},"created_at":"2026-05-18T02:39:18.218130+00:00","updated_at":"2026-05-18T02:39:18.218130+00:00"}