{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UOX4T4NSLDE7XFAOFK26FLDY33","short_pith_number":"pith:UOX4T4NS","schema_version":"1.0","canonical_sha256":"a3afc9f1b258c9fb940e2ab5e2ac78ded54588e6eb82489eef182e1b193930b0","source":{"kind":"arxiv","id":"1703.09813","version":1},"attestation_state":"computed","paper":{"title":"Gradient-based Regularization Parameter Selection for Problems with Non-smooth Penalty Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jean Feng, Noah Simon","submitted_at":"2017-03-28T21:41:13Z","abstract_excerpt":"In high-dimensional and/or non-parametric regression problems, regularization (or penalization) is used to control model complexity and induce desired structure. Each penalty has a weight parameter that indicates how strongly the structure corresponding to that penalty should be enforced. Typically the parameters are chosen to minimize the error on a separate validation set using a simple grid search or a gradient-free optimization method. It is more efficient to tune parameters if the gradient can be determined, but this is often difficult for problems with non-smooth penalty functions. Here "},"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":"1703.09813","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-28T21:41:13Z","cross_cats_sorted":[],"title_canon_sha256":"5f04cf1440780e22528f0a2c12c8262e8e849d5991b399853a66ddc53a5bed18","abstract_canon_sha256":"f00adc779ade0d7162733d55f0f7266624d99f8308a18a32f71d6c0c1f605964"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:47:39.380806Z","signature_b64":"cpBc166vMtpQFjFFZyfW6WzL7bP+XS7Q1ZpT8Edhb5yd4Yw3+kiyj5H7BGDYEbzBI9WeiSRmK2egJlb2oiA9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3afc9f1b258c9fb940e2ab5e2ac78ded54588e6eb82489eef182e1b193930b0","last_reissued_at":"2026-05-18T00:47:39.380208Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:47:39.380208Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Gradient-based Regularization Parameter Selection for Problems with Non-smooth Penalty Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.ML","authors_text":"Jean Feng, Noah Simon","submitted_at":"2017-03-28T21:41:13Z","abstract_excerpt":"In high-dimensional and/or non-parametric regression problems, regularization (or penalization) is used to control model complexity and induce desired structure. Each penalty has a weight parameter that indicates how strongly the structure corresponding to that penalty should be enforced. Typically the parameters are chosen to minimize the error on a separate validation set using a simple grid search or a gradient-free optimization method. It is more efficient to tune parameters if the gradient can be determined, but this is often difficult for problems with non-smooth penalty functions. Here "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.09813","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":"1703.09813","created_at":"2026-05-18T00:47:39.380302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.09813v1","created_at":"2026-05-18T00:47:39.380302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.09813","created_at":"2026-05-18T00:47:39.380302+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOX4T4NSLDE7","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOX4T4NSLDE7XFAO","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOX4T4NS","created_at":"2026-05-18T12:31:46.661854+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/UOX4T4NSLDE7XFAOFK26FLDY33","json":"https://pith.science/pith/UOX4T4NSLDE7XFAOFK26FLDY33.json","graph_json":"https://pith.science/api/pith-number/UOX4T4NSLDE7XFAOFK26FLDY33/graph.json","events_json":"https://pith.science/api/pith-number/UOX4T4NSLDE7XFAOFK26FLDY33/events.json","paper":"https://pith.science/paper/UOX4T4NS"},"agent_actions":{"view_html":"https://pith.science/pith/UOX4T4NSLDE7XFAOFK26FLDY33","download_json":"https://pith.science/pith/UOX4T4NSLDE7XFAOFK26FLDY33.json","view_paper":"https://pith.science/paper/UOX4T4NS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.09813&json=true","fetch_graph":"https://pith.science/api/pith-number/UOX4T4NSLDE7XFAOFK26FLDY33/graph.json","fetch_events":"https://pith.science/api/pith-number/UOX4T4NSLDE7XFAOFK26FLDY33/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOX4T4NSLDE7XFAOFK26FLDY33/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOX4T4NSLDE7XFAOFK26FLDY33/action/storage_attestation","attest_author":"https://pith.science/pith/UOX4T4NSLDE7XFAOFK26FLDY33/action/author_attestation","sign_citation":"https://pith.science/pith/UOX4T4NSLDE7XFAOFK26FLDY33/action/citation_signature","submit_replication":"https://pith.science/pith/UOX4T4NSLDE7XFAOFK26FLDY33/action/replication_record"}},"created_at":"2026-05-18T00:47:39.380302+00:00","updated_at":"2026-05-18T00:47:39.380302+00:00"}