{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:7ZN3ETNNQVMC2SPL3GOXJ7YQNB","short_pith_number":"pith:7ZN3ETNN","schema_version":"1.0","canonical_sha256":"fe5bb24dad85582d49ebd99d74ff106858fa3f0fd016c257f41a0d9ed5f656b3","source":{"kind":"arxiv","id":"1711.02857","version":1},"attestation_state":"computed","paper":{"title":"Learning Sparse Visual Representations with Leaky Capped Norm Regularizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dahua Lin, Jianqiao Wangni","submitted_at":"2017-11-08T07:54:41Z","abstract_excerpt":"Sparsity inducing regularization is an important part for learning over-complete visual representations. Despite the popularity of $\\ell_1$ regularization, in this paper, we investigate the usage of non-convex regularizations in this problem. Our contribution consists of three parts. First, we propose the leaky capped norm regularization (LCNR), which allows model weights below a certain threshold to be regularized more strongly as opposed to those above, therefore imposes strong sparsity and only introduces controllable estimation bias. We propose a majorization-minimization algorithm to opti"},"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":"1711.02857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-11-08T07:54:41Z","cross_cats_sorted":["cs.AI","cs.CV","math.NA","stat.ML"],"title_canon_sha256":"34b697f1786e539f5cea2cab2713d936f0958f7be0670ed12eed69bdfd2ddd9f","abstract_canon_sha256":"662f5ef3cecdfbdd5214ebd701d97260cf228d35fd30cf4346f4a2f6f6c653bf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:01.508840Z","signature_b64":"cJ4FIaQCIFNrXAFvGSe708QR2SHb3qrwNknvDzE3zumwDTWDLpBdcI5PeqCdxzsGFy687A6R55kb/XcPYoAEAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fe5bb24dad85582d49ebd99d74ff106858fa3f0fd016c257f41a0d9ed5f656b3","last_reissued_at":"2026-05-18T00:31:01.508127Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:01.508127Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Sparse Visual Representations with Leaky Capped Norm Regularizers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.CV","math.NA","stat.ML"],"primary_cat":"cs.LG","authors_text":"Dahua Lin, Jianqiao Wangni","submitted_at":"2017-11-08T07:54:41Z","abstract_excerpt":"Sparsity inducing regularization is an important part for learning over-complete visual representations. Despite the popularity of $\\ell_1$ regularization, in this paper, we investigate the usage of non-convex regularizations in this problem. Our contribution consists of three parts. First, we propose the leaky capped norm regularization (LCNR), which allows model weights below a certain threshold to be regularized more strongly as opposed to those above, therefore imposes strong sparsity and only introduces controllable estimation bias. We propose a majorization-minimization algorithm to opti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02857","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":"1711.02857","created_at":"2026-05-18T00:31:01.508226+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02857v1","created_at":"2026-05-18T00:31:01.508226+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02857","created_at":"2026-05-18T00:31:01.508226+00:00"},{"alias_kind":"pith_short_12","alias_value":"7ZN3ETNNQVMC","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"7ZN3ETNNQVMC2SPL","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"7ZN3ETNN","created_at":"2026-05-18T12:31:05.417338+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/7ZN3ETNNQVMC2SPL3GOXJ7YQNB","json":"https://pith.science/pith/7ZN3ETNNQVMC2SPL3GOXJ7YQNB.json","graph_json":"https://pith.science/api/pith-number/7ZN3ETNNQVMC2SPL3GOXJ7YQNB/graph.json","events_json":"https://pith.science/api/pith-number/7ZN3ETNNQVMC2SPL3GOXJ7YQNB/events.json","paper":"https://pith.science/paper/7ZN3ETNN"},"agent_actions":{"view_html":"https://pith.science/pith/7ZN3ETNNQVMC2SPL3GOXJ7YQNB","download_json":"https://pith.science/pith/7ZN3ETNNQVMC2SPL3GOXJ7YQNB.json","view_paper":"https://pith.science/paper/7ZN3ETNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02857&json=true","fetch_graph":"https://pith.science/api/pith-number/7ZN3ETNNQVMC2SPL3GOXJ7YQNB/graph.json","fetch_events":"https://pith.science/api/pith-number/7ZN3ETNNQVMC2SPL3GOXJ7YQNB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7ZN3ETNNQVMC2SPL3GOXJ7YQNB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7ZN3ETNNQVMC2SPL3GOXJ7YQNB/action/storage_attestation","attest_author":"https://pith.science/pith/7ZN3ETNNQVMC2SPL3GOXJ7YQNB/action/author_attestation","sign_citation":"https://pith.science/pith/7ZN3ETNNQVMC2SPL3GOXJ7YQNB/action/citation_signature","submit_replication":"https://pith.science/pith/7ZN3ETNNQVMC2SPL3GOXJ7YQNB/action/replication_record"}},"created_at":"2026-05-18T00:31:01.508226+00:00","updated_at":"2026-05-18T00:31:01.508226+00:00"}