{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:BWUUFR2T4SHVKKAGXPV4TJNHCL","short_pith_number":"pith:BWUUFR2T","schema_version":"1.0","canonical_sha256":"0da942c753e48f552806bbebc9a5a712e978d6b085942fd00842ce415e455e32","source":{"kind":"arxiv","id":"1205.2631","version":1},"attestation_state":"computed","paper":{"title":"Multi-Task Feature Learning Via Efficient l2,1-Norm Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jieping Ye, Jun Liu, Shuiwang Ji","submitted_at":"2012-05-09T17:09:42Z","abstract_excerpt":"The problem of joint feature selection across a group of related tasks has applications in many areas including biomedical informatics and computer vision. We consider the l2,1-norm regularized regression model for joint feature selection from multiple tasks, which can be derived in the probabilistic framework by assuming a suitable prior from the exponential family. One appealing feature of the l2,1-norm regularization is that it encourages multiple predictors to share similar sparsity patterns. However, the resulting optimization problem is challenging to solve due to the non-smoothness of t"},"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":"1205.2631","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-05-09T17:09:42Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"5f2e8c2eded15745c4c3506ab503c89f827f4ad5c0bc54227baff624c67c2cd0","abstract_canon_sha256":"f22ed150756f5e7621ec3001446ae81f3e591acdbabc4c6276bdf63c8226db44"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:47.775391Z","signature_b64":"c0OVcaBi3if+t3ShqRFzTX4t/aCX7pRKL7Zvf/y26j0mFMR0f/gLtNJEzBUk79p4OzM1fyo1y2BcBCzglBwGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0da942c753e48f552806bbebc9a5a712e978d6b085942fd00842ce415e455e32","last_reissued_at":"2026-05-18T03:55:47.774584Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:47.774584Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-Task Feature Learning Via Efficient l2,1-Norm Minimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jieping Ye, Jun Liu, Shuiwang Ji","submitted_at":"2012-05-09T17:09:42Z","abstract_excerpt":"The problem of joint feature selection across a group of related tasks has applications in many areas including biomedical informatics and computer vision. We consider the l2,1-norm regularized regression model for joint feature selection from multiple tasks, which can be derived in the probabilistic framework by assuming a suitable prior from the exponential family. One appealing feature of the l2,1-norm regularization is that it encourages multiple predictors to share similar sparsity patterns. However, the resulting optimization problem is challenging to solve due to the non-smoothness of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.2631","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":"1205.2631","created_at":"2026-05-18T03:55:47.774727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.2631v1","created_at":"2026-05-18T03:55:47.774727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.2631","created_at":"2026-05-18T03:55:47.774727+00:00"},{"alias_kind":"pith_short_12","alias_value":"BWUUFR2T4SHV","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"BWUUFR2T4SHVKKAG","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"BWUUFR2T","created_at":"2026-05-18T12:27:01.376967+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2503.13874","citing_title":"Multi-label feature selection based on binary hashing learning and dynamic graph constraints","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL","json":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL.json","graph_json":"https://pith.science/api/pith-number/BWUUFR2T4SHVKKAGXPV4TJNHCL/graph.json","events_json":"https://pith.science/api/pith-number/BWUUFR2T4SHVKKAGXPV4TJNHCL/events.json","paper":"https://pith.science/paper/BWUUFR2T"},"agent_actions":{"view_html":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL","download_json":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL.json","view_paper":"https://pith.science/paper/BWUUFR2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.2631&json=true","fetch_graph":"https://pith.science/api/pith-number/BWUUFR2T4SHVKKAGXPV4TJNHCL/graph.json","fetch_events":"https://pith.science/api/pith-number/BWUUFR2T4SHVKKAGXPV4TJNHCL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/action/storage_attestation","attest_author":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/action/author_attestation","sign_citation":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/action/citation_signature","submit_replication":"https://pith.science/pith/BWUUFR2T4SHVKKAGXPV4TJNHCL/action/replication_record"}},"created_at":"2026-05-18T03:55:47.774727+00:00","updated_at":"2026-05-18T03:55:47.774727+00:00"}