{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:VFWBCPMBMMRL33FNVO7DNAVQTD","short_pith_number":"pith:VFWBCPMB","schema_version":"1.0","canonical_sha256":"a96c113d816322bdecadabbe3682b098fc64677e754fb1df20dc86b3f62ba774","source":{"kind":"arxiv","id":"1507.00500","version":1},"attestation_state":"computed","paper":{"title":"Non-convex Regularizations for Feature Selection in Ranking With Sparse SVM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Josiane Mothe (IRIT), LAGRANGE), L\\'ea Laporte (IRIT), R\\'emi Flamary (OCA, S\\'ebastien D\\'ejean (IMT), Stephane Canu (LITIS)","submitted_at":"2015-07-02T10:06:02Z","abstract_excerpt":"Feature selection in learning to rank has recently emerged as a crucial issue. Whereas several preprocessing approaches have been proposed, only a few works have been focused on integrating the feature selection into the learning process. In this work, we propose a general framework for feature selection in learning to rank using SVM with a sparse regularization term. We investigate both classical convex regularizations such as $\\ell\\_1$ or weighted $\\ell\\_1$ and non-convex regularization terms such as log penalty, Minimax Concave Penalty (MCP) or $\\ell\\_p$ pseudo norm with $p\\textless{}1$. Tw"},"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":"1507.00500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-07-02T10:06:02Z","cross_cats_sorted":[],"title_canon_sha256":"d4dd5b8a841f0681b5775f82ed7682f7c65db518a3f63ad593ae3460fdbf579b","abstract_canon_sha256":"bd64c3285f5a0c5607fa298c7d901ee8235f007aca3da26d7f29e14752d00414"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:37:24.542875Z","signature_b64":"re2h7sRhJt19gs0wH2vE9GtkxIC6237CS2zm+SJoGU2fz0laHim9ShFGUdPjlquyPSClksWM9b8my2yoiVONCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a96c113d816322bdecadabbe3682b098fc64677e754fb1df20dc86b3f62ba774","last_reissued_at":"2026-05-18T01:37:24.541991Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:37:24.541991Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-convex Regularizations for Feature Selection in Ranking With Sparse SVM","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Josiane Mothe (IRIT), LAGRANGE), L\\'ea Laporte (IRIT), R\\'emi Flamary (OCA, S\\'ebastien D\\'ejean (IMT), Stephane Canu (LITIS)","submitted_at":"2015-07-02T10:06:02Z","abstract_excerpt":"Feature selection in learning to rank has recently emerged as a crucial issue. Whereas several preprocessing approaches have been proposed, only a few works have been focused on integrating the feature selection into the learning process. In this work, we propose a general framework for feature selection in learning to rank using SVM with a sparse regularization term. We investigate both classical convex regularizations such as $\\ell\\_1$ or weighted $\\ell\\_1$ and non-convex regularization terms such as log penalty, Minimax Concave Penalty (MCP) or $\\ell\\_p$ pseudo norm with $p\\textless{}1$. Tw"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.00500","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":"1507.00500","created_at":"2026-05-18T01:37:24.542137+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.00500v1","created_at":"2026-05-18T01:37:24.542137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.00500","created_at":"2026-05-18T01:37:24.542137+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFWBCPMBMMRL","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFWBCPMBMMRL33FN","created_at":"2026-05-18T12:29:44.643036+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFWBCPMB","created_at":"2026-05-18T12:29:44.643036+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/VFWBCPMBMMRL33FNVO7DNAVQTD","json":"https://pith.science/pith/VFWBCPMBMMRL33FNVO7DNAVQTD.json","graph_json":"https://pith.science/api/pith-number/VFWBCPMBMMRL33FNVO7DNAVQTD/graph.json","events_json":"https://pith.science/api/pith-number/VFWBCPMBMMRL33FNVO7DNAVQTD/events.json","paper":"https://pith.science/paper/VFWBCPMB"},"agent_actions":{"view_html":"https://pith.science/pith/VFWBCPMBMMRL33FNVO7DNAVQTD","download_json":"https://pith.science/pith/VFWBCPMBMMRL33FNVO7DNAVQTD.json","view_paper":"https://pith.science/paper/VFWBCPMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.00500&json=true","fetch_graph":"https://pith.science/api/pith-number/VFWBCPMBMMRL33FNVO7DNAVQTD/graph.json","fetch_events":"https://pith.science/api/pith-number/VFWBCPMBMMRL33FNVO7DNAVQTD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFWBCPMBMMRL33FNVO7DNAVQTD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFWBCPMBMMRL33FNVO7DNAVQTD/action/storage_attestation","attest_author":"https://pith.science/pith/VFWBCPMBMMRL33FNVO7DNAVQTD/action/author_attestation","sign_citation":"https://pith.science/pith/VFWBCPMBMMRL33FNVO7DNAVQTD/action/citation_signature","submit_replication":"https://pith.science/pith/VFWBCPMBMMRL33FNVO7DNAVQTD/action/replication_record"}},"created_at":"2026-05-18T01:37:24.542137+00:00","updated_at":"2026-05-18T01:37:24.542137+00:00"}