{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DRT37YG6TMSXTQKJC3FJMDKHN4","short_pith_number":"pith:DRT37YG6","schema_version":"1.0","canonical_sha256":"1c67bfe0de9b2579c14916ca960d476f1dbf5f15fcc4744ba8a7a48b27d57e79","source":{"kind":"arxiv","id":"1409.0272","version":2},"attestation_state":"computed","paper":{"title":"Multi-task Sparse Structure Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andre R. Goncalves, Arindam Banerjee, Fernando J. Von Zuben, Puja Das, Soumyadeep Chatterjee, Vidyashankar Sivakumar","submitted_at":"2014-09-01T00:33:38Z","abstract_excerpt":"Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. While sometimes the underlying task relationship structure is known, often the structure needs to be estimated from data at hand. In this paper, we present a novel family of models for MTL, applicable to regression and classification problems, capable of learning the structure of task relationships. In particular, we consider a joint estimation problem of the task relationship structure and the individual task parameters, which is solved using alternating minimization. The ta"},"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":"1409.0272","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-09-01T00:33:38Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"137296c44bb1b9796fbc6cae97995bbd4395cd970db1d170bfd45e242e5f09c6","abstract_canon_sha256":"99ea648b17dc1818de1113efc2e118a4d3ae4bede875ca11de9e9c4312e79478"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:58.506279Z","signature_b64":"ud7Ba+O0EzKZaZDT6gwtoI9oTvamNXY4sffI2nVik3p8wwjvE1l+fhi/feIKaWhJvkMFGp/6aHL5CorNSi70Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1c67bfe0de9b2579c14916ca960d476f1dbf5f15fcc4744ba8a7a48b27d57e79","last_reissued_at":"2026-05-18T00:51:58.505617Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:58.505617Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-task Sparse Structure Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andre R. Goncalves, Arindam Banerjee, Fernando J. Von Zuben, Puja Das, Soumyadeep Chatterjee, Vidyashankar Sivakumar","submitted_at":"2014-09-01T00:33:38Z","abstract_excerpt":"Multi-task learning (MTL) aims to improve generalization performance by learning multiple related tasks simultaneously. While sometimes the underlying task relationship structure is known, often the structure needs to be estimated from data at hand. In this paper, we present a novel family of models for MTL, applicable to regression and classification problems, capable of learning the structure of task relationships. In particular, we consider a joint estimation problem of the task relationship structure and the individual task parameters, which is solved using alternating minimization. The ta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.0272","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.0272","created_at":"2026-05-18T00:51:58.505736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.0272v2","created_at":"2026-05-18T00:51:58.505736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.0272","created_at":"2026-05-18T00:51:58.505736+00:00"},{"alias_kind":"pith_short_12","alias_value":"DRT37YG6TMSX","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DRT37YG6TMSXTQKJ","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DRT37YG6","created_at":"2026-05-18T12:28:25.294606+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/DRT37YG6TMSXTQKJC3FJMDKHN4","json":"https://pith.science/pith/DRT37YG6TMSXTQKJC3FJMDKHN4.json","graph_json":"https://pith.science/api/pith-number/DRT37YG6TMSXTQKJC3FJMDKHN4/graph.json","events_json":"https://pith.science/api/pith-number/DRT37YG6TMSXTQKJC3FJMDKHN4/events.json","paper":"https://pith.science/paper/DRT37YG6"},"agent_actions":{"view_html":"https://pith.science/pith/DRT37YG6TMSXTQKJC3FJMDKHN4","download_json":"https://pith.science/pith/DRT37YG6TMSXTQKJC3FJMDKHN4.json","view_paper":"https://pith.science/paper/DRT37YG6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.0272&json=true","fetch_graph":"https://pith.science/api/pith-number/DRT37YG6TMSXTQKJC3FJMDKHN4/graph.json","fetch_events":"https://pith.science/api/pith-number/DRT37YG6TMSXTQKJC3FJMDKHN4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DRT37YG6TMSXTQKJC3FJMDKHN4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DRT37YG6TMSXTQKJC3FJMDKHN4/action/storage_attestation","attest_author":"https://pith.science/pith/DRT37YG6TMSXTQKJC3FJMDKHN4/action/author_attestation","sign_citation":"https://pith.science/pith/DRT37YG6TMSXTQKJC3FJMDKHN4/action/citation_signature","submit_replication":"https://pith.science/pith/DRT37YG6TMSXTQKJC3FJMDKHN4/action/replication_record"}},"created_at":"2026-05-18T00:51:58.505736+00:00","updated_at":"2026-05-18T00:51:58.505736+00:00"}