{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:5IOCT2QRTGYGCSL2FAV4OFHJSD","short_pith_number":"pith:5IOCT2QR","schema_version":"1.0","canonical_sha256":"ea1c29ea1199b061497a282bc714e990c75fde6788b209cc2d3dff6e19ee9857","source":{"kind":"arxiv","id":"1406.4465","version":2},"attestation_state":"computed","paper":{"title":"Multi-stage Multi-task feature learning via adaptive threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Yaru Fan, Yilun Wang","submitted_at":"2014-06-16T12:47:37Z","abstract_excerpt":"Multi-task feature learning aims to identity the shared features among tasks to improve generalization. It has been shown that by minimizing non-convex learning models, a better solution than the convex alternatives can be obtained. Therefore, a non-convex model based on the capped-$\\ell_{1},\\ell_{1}$ regularization was proposed in \\cite{Gong2013}, and a corresponding efficient multi-stage multi-task feature learning algorithm (MSMTFL) was presented. However, this algorithm harnesses a prescribed fixed threshold in the definition of the capped-$\\ell_{1},\\ell_{1}$ regularization and the lack of"},"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":"1406.4465","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-06-16T12:47:37Z","cross_cats_sorted":["cs.CV","stat.ML"],"title_canon_sha256":"9e09c4bea37a03a43ccc358f853d1447675af719ac2a6272f17cd95ed469b5f8","abstract_canon_sha256":"c7fc45049d07ad6fa408a12ffd516dc195977382c68d33fb1ea173ffc7d5994c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:38.730271Z","signature_b64":"ZYm5TF9McQQuSnv68z57qDIDZPafVuUBU1ayj9jwKcMuLGKHCVrl6aoaHkBQCkhC6WXBEzl5Vp5PJ2rCbJlRAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea1c29ea1199b061497a282bc714e990c75fde6788b209cc2d3dff6e19ee9857","last_reissued_at":"2026-05-18T01:59:38.729510Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:38.729510Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multi-stage Multi-task feature learning via adaptive threshold","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV","stat.ML"],"primary_cat":"cs.LG","authors_text":"Yaru Fan, Yilun Wang","submitted_at":"2014-06-16T12:47:37Z","abstract_excerpt":"Multi-task feature learning aims to identity the shared features among tasks to improve generalization. It has been shown that by minimizing non-convex learning models, a better solution than the convex alternatives can be obtained. Therefore, a non-convex model based on the capped-$\\ell_{1},\\ell_{1}$ regularization was proposed in \\cite{Gong2013}, and a corresponding efficient multi-stage multi-task feature learning algorithm (MSMTFL) was presented. However, this algorithm harnesses a prescribed fixed threshold in the definition of the capped-$\\ell_{1},\\ell_{1}$ regularization and the lack of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4465","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":"1406.4465","created_at":"2026-05-18T01:59:38.729635+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4465v2","created_at":"2026-05-18T01:59:38.729635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4465","created_at":"2026-05-18T01:59:38.729635+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IOCT2QRTGYG","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IOCT2QRTGYGCSL2","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IOCT2QR","created_at":"2026-05-18T12:28:14.216126+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/5IOCT2QRTGYGCSL2FAV4OFHJSD","json":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD.json","graph_json":"https://pith.science/api/pith-number/5IOCT2QRTGYGCSL2FAV4OFHJSD/graph.json","events_json":"https://pith.science/api/pith-number/5IOCT2QRTGYGCSL2FAV4OFHJSD/events.json","paper":"https://pith.science/paper/5IOCT2QR"},"agent_actions":{"view_html":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD","download_json":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD.json","view_paper":"https://pith.science/paper/5IOCT2QR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4465&json=true","fetch_graph":"https://pith.science/api/pith-number/5IOCT2QRTGYGCSL2FAV4OFHJSD/graph.json","fetch_events":"https://pith.science/api/pith-number/5IOCT2QRTGYGCSL2FAV4OFHJSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/action/storage_attestation","attest_author":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/action/author_attestation","sign_citation":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/action/citation_signature","submit_replication":"https://pith.science/pith/5IOCT2QRTGYGCSL2FAV4OFHJSD/action/replication_record"}},"created_at":"2026-05-18T01:59:38.729635+00:00","updated_at":"2026-05-18T01:59:38.729635+00:00"}