{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4OL4ZDCU22CLA6ESJYYVZLMQZK","short_pith_number":"pith:4OL4ZDCU","schema_version":"1.0","canonical_sha256":"e397cc8c54d684b078924e315cad90cab174ce8ee95aa02fc1f46285ba810a29","source":{"kind":"arxiv","id":"2403.16162","version":1},"attestation_state":"computed","paper":{"title":"Multi-Task Learning with Multi-Task Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abhishek Gupta, Lu Bai, Yew-Soon Ong","submitted_at":"2024-03-24T14:04:40Z","abstract_excerpt":"Multi-task learning solves multiple correlated tasks. However, conflicts may exist between them. In such circumstances, a single solution can rarely optimize all the tasks, leading to performance trade-offs. To arrive at a set of optimized yet well-distributed models that collectively embody different trade-offs in one algorithmic pass, this paper proposes to view Pareto multi-task learning through the lens of multi-task optimization. Multi-task learning is first cast as a multi-objective optimization problem, which is then decomposed into a diverse set of unconstrained scalar-valued subproble"},"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":"2403.16162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2024-03-24T14:04:40Z","cross_cats_sorted":[],"title_canon_sha256":"7369d4db4104382797124fcd018a5dfbcb0af97b2e5b9547bc69831f76fc12c0","abstract_canon_sha256":"17fbd76812ffe4a8b3c786b647814c2ed2a176ef2fb101ee0d5ff9826665b961"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:00:11.364328Z","signature_b64":"r1g2pLVGIIUyx+Jez8U7V9F8G+ekqWI83E4ADBy03I++TPL/KpEERxx8Nh3+eKVgjEwBhFolPBDbKWsk+v0LCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e397cc8c54d684b078924e315cad90cab174ce8ee95aa02fc1f46285ba810a29","last_reissued_at":"2026-07-05T08:00:11.363880Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:00:11.363880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Task Learning with Multi-Task Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Abhishek Gupta, Lu Bai, Yew-Soon Ong","submitted_at":"2024-03-24T14:04:40Z","abstract_excerpt":"Multi-task learning solves multiple correlated tasks. However, conflicts may exist between them. In such circumstances, a single solution can rarely optimize all the tasks, leading to performance trade-offs. To arrive at a set of optimized yet well-distributed models that collectively embody different trade-offs in one algorithmic pass, this paper proposes to view Pareto multi-task learning through the lens of multi-task optimization. Multi-task learning is first cast as a multi-objective optimization problem, which is then decomposed into a diverse set of unconstrained scalar-valued subproble"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.16162","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2403.16162/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":"2403.16162","created_at":"2026-07-05T08:00:11.363940+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.16162v1","created_at":"2026-07-05T08:00:11.363940+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.16162","created_at":"2026-07-05T08:00:11.363940+00:00"},{"alias_kind":"pith_short_12","alias_value":"4OL4ZDCU22CL","created_at":"2026-07-05T08:00:11.363940+00:00"},{"alias_kind":"pith_short_16","alias_value":"4OL4ZDCU22CLA6ES","created_at":"2026-07-05T08:00:11.363940+00:00"},{"alias_kind":"pith_short_8","alias_value":"4OL4ZDCU","created_at":"2026-07-05T08:00:11.363940+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.08198","citing_title":"Adaptive$^2$: Adaptive Domain Mining for Fine-grained Domain Adaptation Modeling","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4OL4ZDCU22CLA6ESJYYVZLMQZK","json":"https://pith.science/pith/4OL4ZDCU22CLA6ESJYYVZLMQZK.json","graph_json":"https://pith.science/api/pith-number/4OL4ZDCU22CLA6ESJYYVZLMQZK/graph.json","events_json":"https://pith.science/api/pith-number/4OL4ZDCU22CLA6ESJYYVZLMQZK/events.json","paper":"https://pith.science/paper/4OL4ZDCU"},"agent_actions":{"view_html":"https://pith.science/pith/4OL4ZDCU22CLA6ESJYYVZLMQZK","download_json":"https://pith.science/pith/4OL4ZDCU22CLA6ESJYYVZLMQZK.json","view_paper":"https://pith.science/paper/4OL4ZDCU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.16162&json=true","fetch_graph":"https://pith.science/api/pith-number/4OL4ZDCU22CLA6ESJYYVZLMQZK/graph.json","fetch_events":"https://pith.science/api/pith-number/4OL4ZDCU22CLA6ESJYYVZLMQZK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4OL4ZDCU22CLA6ESJYYVZLMQZK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4OL4ZDCU22CLA6ESJYYVZLMQZK/action/storage_attestation","attest_author":"https://pith.science/pith/4OL4ZDCU22CLA6ESJYYVZLMQZK/action/author_attestation","sign_citation":"https://pith.science/pith/4OL4ZDCU22CLA6ESJYYVZLMQZK/action/citation_signature","submit_replication":"https://pith.science/pith/4OL4ZDCU22CLA6ESJYYVZLMQZK/action/replication_record"}},"created_at":"2026-07-05T08:00:11.363940+00:00","updated_at":"2026-07-05T08:00:11.363940+00:00"}