{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:LKP3STKVPLCTADMMC77A6ND2HB","short_pith_number":"pith:LKP3STKV","schema_version":"1.0","canonical_sha256":"5a9fb94d557ac5300d8c17fe0f347a38599148e89ca2802e1cdb9fb0ef6a900c","source":{"kind":"arxiv","id":"1209.2784","version":1},"attestation_state":"computed","paper":{"title":"Minimax Multi-Task Learning and a Generalized Loss-Compositional Paradigm for MTL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander G. Gray, Dongryeol Lee, Nishant A. Mehta","submitted_at":"2012-09-13T06:14:31Z","abstract_excerpt":"Since its inception, the modus operandi of multi-task learning (MTL) has been to minimize the task-wise mean of the empirical risks. We introduce a generalized loss-compositional paradigm for MTL that includes a spectrum of formulations as a subfamily. One endpoint of this spectrum is minimax MTL: a new MTL formulation that minimizes the maximum of the tasks' empirical risks. Via a certain relaxation of minimax MTL, we obtain a continuum of MTL formulations spanning minimax MTL and classical MTL. The full paradigm itself is loss-compositional, operating on the vector of empirical risks. It inc"},"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":"1209.2784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-09-13T06:14:31Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"05ffe47f508b62e57b758f450498bdb369f599f9f747ecb8abd4baa5b2c5d861","abstract_canon_sha256":"f7d646ea20f2930adb3c69b977bce12440b6ae4bc133cbd38175ba9030d8a5b3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:45:40.989479Z","signature_b64":"vqyiLsQDdqgFQ/Vnm70v63BVPYWQu3ejK7QHv6akP6RjQTALo9b/lYk4+60F+Iua0n8cp0WiM2wQh0p5IJGdAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a9fb94d557ac5300d8c17fe0f347a38599148e89ca2802e1cdb9fb0ef6a900c","last_reissued_at":"2026-05-18T03:45:40.988829Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:45:40.988829Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimax Multi-Task Learning and a Generalized Loss-Compositional Paradigm for MTL","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Alexander G. Gray, Dongryeol Lee, Nishant A. Mehta","submitted_at":"2012-09-13T06:14:31Z","abstract_excerpt":"Since its inception, the modus operandi of multi-task learning (MTL) has been to minimize the task-wise mean of the empirical risks. We introduce a generalized loss-compositional paradigm for MTL that includes a spectrum of formulations as a subfamily. One endpoint of this spectrum is minimax MTL: a new MTL formulation that minimizes the maximum of the tasks' empirical risks. Via a certain relaxation of minimax MTL, we obtain a continuum of MTL formulations spanning minimax MTL and classical MTL. The full paradigm itself is loss-compositional, operating on the vector of empirical risks. It inc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2784","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":"1209.2784","created_at":"2026-05-18T03:45:40.988944+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2784v1","created_at":"2026-05-18T03:45:40.988944+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2784","created_at":"2026-05-18T03:45:40.988944+00:00"},{"alias_kind":"pith_short_12","alias_value":"LKP3STKVPLCT","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"LKP3STKVPLCTADMM","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"LKP3STKV","created_at":"2026-05-18T12:27:14.488303+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/LKP3STKVPLCTADMMC77A6ND2HB","json":"https://pith.science/pith/LKP3STKVPLCTADMMC77A6ND2HB.json","graph_json":"https://pith.science/api/pith-number/LKP3STKVPLCTADMMC77A6ND2HB/graph.json","events_json":"https://pith.science/api/pith-number/LKP3STKVPLCTADMMC77A6ND2HB/events.json","paper":"https://pith.science/paper/LKP3STKV"},"agent_actions":{"view_html":"https://pith.science/pith/LKP3STKVPLCTADMMC77A6ND2HB","download_json":"https://pith.science/pith/LKP3STKVPLCTADMMC77A6ND2HB.json","view_paper":"https://pith.science/paper/LKP3STKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2784&json=true","fetch_graph":"https://pith.science/api/pith-number/LKP3STKVPLCTADMMC77A6ND2HB/graph.json","fetch_events":"https://pith.science/api/pith-number/LKP3STKVPLCTADMMC77A6ND2HB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LKP3STKVPLCTADMMC77A6ND2HB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LKP3STKVPLCTADMMC77A6ND2HB/action/storage_attestation","attest_author":"https://pith.science/pith/LKP3STKVPLCTADMMC77A6ND2HB/action/author_attestation","sign_citation":"https://pith.science/pith/LKP3STKVPLCTADMMC77A6ND2HB/action/citation_signature","submit_replication":"https://pith.science/pith/LKP3STKVPLCTADMMC77A6ND2HB/action/replication_record"}},"created_at":"2026-05-18T03:45:40.988944+00:00","updated_at":"2026-05-18T03:45:40.988944+00:00"}