{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:64OXPGFLIIHMV4AFN2NVUY3Q2L","short_pith_number":"pith:64OXPGFL","canonical_record":{"source":{"id":"1602.05916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-18T19:13:23Z","cross_cats_sorted":[],"title_canon_sha256":"6f21c27757d5ae3d62015677cac8cfa2240b5231404445a02990d2c028a0ac9f","abstract_canon_sha256":"d03b76d945605ba0c9414596574bd5355fbe96870a53cc23bb9da0f488f8fd5b"},"schema_version":"1.0"},"canonical_sha256":"f71d7798ab420ecaf0056e9b5a6370d2c043d8d4d507629a505bbc1c45db43d8","source":{"kind":"arxiv","id":"1602.05916","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05916","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05916v2","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05916","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"64OXPGFLIIHM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"64OXPGFLIIHMV4AF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"64OXPGFL","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:64OXPGFLIIHMV4AFN2NVUY3Q2L","target":"record","payload":{"canonical_record":{"source":{"id":"1602.05916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-18T19:13:23Z","cross_cats_sorted":[],"title_canon_sha256":"6f21c27757d5ae3d62015677cac8cfa2240b5231404445a02990d2c028a0ac9f","abstract_canon_sha256":"d03b76d945605ba0c9414596574bd5355fbe96870a53cc23bb9da0f488f8fd5b"},"schema_version":"1.0"},"canonical_sha256":"f71d7798ab420ecaf0056e9b5a6370d2c043d8d4d507629a505bbc1c45db43d8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:01.395292Z","signature_b64":"2XfV5eWDB9oSTM8yeJefXnwTyfPCT2ItrykNODcnKQDEcArjyHdmj8T8W7fHo0Fy4M2oMSVN/8g9Y709A59HBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f71d7798ab420ecaf0056e9b5a6370d2c043d8d4d507629a505bbc1c45db43d8","last_reissued_at":"2026-05-18T00:51:01.394791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:01.394791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1602.05916","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l7BtvGMyihtVTbAGtxpqfP0ldsXmpa27ttNd/1FqpJ2gh6qG+rt7yRA/TocJ0hkG1AFkjC2Fp4N6lwV/Bkf/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T18:22:37.677332Z"},"content_sha256":"82193f9b74d43932fb8220170f702611782684b8c95098361e6a1f1f9171a719","schema_version":"1.0","event_id":"sha256:82193f9b74d43932fb8220170f702611782684b8c95098361e6a1f1f9171a719"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:64OXPGFLIIHMV4AFN2NVUY3Q2L","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Local Rademacher Complexity-based Learning Guarantees for Multi-Task Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Georgios Anagnostopoulos, Mansooreh Mollaghasemi, Marius Kloft, Niloofar Yousefi, Yunwen Lei","submitted_at":"2016-02-18T19:13:23Z","abstract_excerpt":"We show a Talagrand-type concentration inequality for Multi-Task Learning (MTL), using which we establish sharp excess risk bounds for MTL in terms of distribution- and data-dependent versions of the Local Rademacher Complexity (LRC). We also give a new bound on the LRC for norm regularized as well as strongly convex hypothesis classes, which applies not only to MTL but also to the standard i.i.d. setting. Combining both results, one can now easily derive fast-rate bounds on the excess risk for many prominent MTL methods, including---as we demonstrate---Schatten-norm, group-norm, and graph-reg"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05916","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:51:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IS4F1WxCPb25RZOkxua74AZIAlCIF5jbjzKxAfWaiPlDtR4/Q69WnRbMMzA2h/Kc6jMIFxJ5O7lB1lsWYkflBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T18:22:37.677955Z"},"content_sha256":"4cc8e7f0ccf193bfcb6b15835b4effb02465d0f69354303584a1f17366c7a686","schema_version":"1.0","event_id":"sha256:4cc8e7f0ccf193bfcb6b15835b4effb02465d0f69354303584a1f17366c7a686"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/64OXPGFLIIHMV4AFN2NVUY3Q2L/bundle.json","state_url":"https://pith.science/pith/64OXPGFLIIHMV4AFN2NVUY3Q2L/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/64OXPGFLIIHMV4AFN2NVUY3Q2L/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-23T18:22:37Z","links":{"resolver":"https://pith.science/pith/64OXPGFLIIHMV4AFN2NVUY3Q2L","bundle":"https://pith.science/pith/64OXPGFLIIHMV4AFN2NVUY3Q2L/bundle.json","state":"https://pith.science/pith/64OXPGFLIIHMV4AFN2NVUY3Q2L/state.json","well_known_bundle":"https://pith.science/.well-known/pith/64OXPGFLIIHMV4AFN2NVUY3Q2L/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:64OXPGFLIIHMV4AFN2NVUY3Q2L","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d03b76d945605ba0c9414596574bd5355fbe96870a53cc23bb9da0f488f8fd5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-18T19:13:23Z","title_canon_sha256":"6f21c27757d5ae3d62015677cac8cfa2240b5231404445a02990d2c028a0ac9f"},"schema_version":"1.0","source":{"id":"1602.05916","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.05916","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"arxiv_version","alias_value":"1602.05916v2","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.05916","created_at":"2026-05-18T00:51:01Z"},{"alias_kind":"pith_short_12","alias_value":"64OXPGFLIIHM","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"64OXPGFLIIHMV4AF","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"64OXPGFL","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:4cc8e7f0ccf193bfcb6b15835b4effb02465d0f69354303584a1f17366c7a686","target":"graph","created_at":"2026-05-18T00:51:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We show a Talagrand-type concentration inequality for Multi-Task Learning (MTL), using which we establish sharp excess risk bounds for MTL in terms of distribution- and data-dependent versions of the Local Rademacher Complexity (LRC). We also give a new bound on the LRC for norm regularized as well as strongly convex hypothesis classes, which applies not only to MTL but also to the standard i.i.d. setting. Combining both results, one can now easily derive fast-rate bounds on the excess risk for many prominent MTL methods, including---as we demonstrate---Schatten-norm, group-norm, and graph-reg","authors_text":"Georgios Anagnostopoulos, Mansooreh Mollaghasemi, Marius Kloft, Niloofar Yousefi, Yunwen Lei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-18T19:13:23Z","title":"Local Rademacher Complexity-based Learning Guarantees for Multi-Task Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.05916","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:82193f9b74d43932fb8220170f702611782684b8c95098361e6a1f1f9171a719","target":"record","created_at":"2026-05-18T00:51:01Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d03b76d945605ba0c9414596574bd5355fbe96870a53cc23bb9da0f488f8fd5b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-02-18T19:13:23Z","title_canon_sha256":"6f21c27757d5ae3d62015677cac8cfa2240b5231404445a02990d2c028a0ac9f"},"schema_version":"1.0","source":{"id":"1602.05916","kind":"arxiv","version":2}},"canonical_sha256":"f71d7798ab420ecaf0056e9b5a6370d2c043d8d4d507629a505bbc1c45db43d8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f71d7798ab420ecaf0056e9b5a6370d2c043d8d4d507629a505bbc1c45db43d8","first_computed_at":"2026-05-18T00:51:01.394791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:01.394791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2XfV5eWDB9oSTM8yeJefXnwTyfPCT2ItrykNODcnKQDEcArjyHdmj8T8W7fHo0Fy4M2oMSVN/8g9Y709A59HBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:01.395292Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.05916","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82193f9b74d43932fb8220170f702611782684b8c95098361e6a1f1f9171a719","sha256:4cc8e7f0ccf193bfcb6b15835b4effb02465d0f69354303584a1f17366c7a686"],"state_sha256":"641ef48342b2de61b5df3e553beb3845f650e0bc5389c4aa6a8231b9539e4308"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9cZ2eO2OzbIV1NPO4zm+DO9JmSrxyhd+OUJLv2/CP3lE/eiIHnJmaZltMnHHNcwikVZCZ+AoFjkTXk0+YI2tCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T18:22:37.680298Z","bundle_sha256":"db811ecd80697db85bec28a746286a1b38739be9320522d9ff12775c5c904447"}}