{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RA6YITTXWU2XVFOPVB6MTDCF3V","short_pith_number":"pith:RA6YITTX","schema_version":"1.0","canonical_sha256":"883d844e77b5357a95cfa87cc98c45dd6ab9088d41f9230ad2eb978bbd1e991d","source":{"kind":"arxiv","id":"1804.09904","version":1},"attestation_state":"computed","paper":{"title":"High-dimensional Penalty Selection via Minimum Description Length Principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kenji Yamanishi, Kohei Miyaguchi","submitted_at":"2018-04-26T06:22:01Z","abstract_excerpt":"We tackle the problem of penalty selection of regularization on the basis of the minimum description length (MDL) principle. In particular, we consider that the design space of the penalty function is high-dimensional. In this situation, the luckiness-normalized-maximum-likelihood(LNML)-minimization approach is favorable, because LNML quantifies the goodness of regularized models with any forms of penalty functions in view of the minimum description length principle, and guides us to a good penalty function through the high-dimensional space. However, the minimization of LNML entails two major"},"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":"1804.09904","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2018-04-26T06:22:01Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"9a90b9d97eff0f6139e4f767e562cf10e8c3fd72c214a142cc99eccf6f504a66","abstract_canon_sha256":"d7ad0fd079d13c63bad7bcd154247d1b38d7508da4fe4419b45edbd30b301cb9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:27.517685Z","signature_b64":"l/38Vc9qhkrb0S8Dfn0fZ57nxvls+brLH4d/QyjTHyhqDQFULf7DNRLqvOcxqdhdgzqOmLzlJaCPK2PqKLeECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"883d844e77b5357a95cfa87cc98c45dd6ab9088d41f9230ad2eb978bbd1e991d","last_reissued_at":"2026-05-18T00:17:27.517020Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:27.517020Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"High-dimensional Penalty Selection via Minimum Description Length Principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Kenji Yamanishi, Kohei Miyaguchi","submitted_at":"2018-04-26T06:22:01Z","abstract_excerpt":"We tackle the problem of penalty selection of regularization on the basis of the minimum description length (MDL) principle. In particular, we consider that the design space of the penalty function is high-dimensional. In this situation, the luckiness-normalized-maximum-likelihood(LNML)-minimization approach is favorable, because LNML quantifies the goodness of regularized models with any forms of penalty functions in view of the minimum description length principle, and guides us to a good penalty function through the high-dimensional space. However, the minimization of LNML entails two major"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.09904","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":"1804.09904","created_at":"2026-05-18T00:17:27.517118+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.09904v1","created_at":"2026-05-18T00:17:27.517118+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.09904","created_at":"2026-05-18T00:17:27.517118+00:00"},{"alias_kind":"pith_short_12","alias_value":"RA6YITTXWU2X","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RA6YITTXWU2XVFOP","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RA6YITTX","created_at":"2026-05-18T12:32:50.500415+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/RA6YITTXWU2XVFOPVB6MTDCF3V","json":"https://pith.science/pith/RA6YITTXWU2XVFOPVB6MTDCF3V.json","graph_json":"https://pith.science/api/pith-number/RA6YITTXWU2XVFOPVB6MTDCF3V/graph.json","events_json":"https://pith.science/api/pith-number/RA6YITTXWU2XVFOPVB6MTDCF3V/events.json","paper":"https://pith.science/paper/RA6YITTX"},"agent_actions":{"view_html":"https://pith.science/pith/RA6YITTXWU2XVFOPVB6MTDCF3V","download_json":"https://pith.science/pith/RA6YITTXWU2XVFOPVB6MTDCF3V.json","view_paper":"https://pith.science/paper/RA6YITTX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.09904&json=true","fetch_graph":"https://pith.science/api/pith-number/RA6YITTXWU2XVFOPVB6MTDCF3V/graph.json","fetch_events":"https://pith.science/api/pith-number/RA6YITTXWU2XVFOPVB6MTDCF3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RA6YITTXWU2XVFOPVB6MTDCF3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RA6YITTXWU2XVFOPVB6MTDCF3V/action/storage_attestation","attest_author":"https://pith.science/pith/RA6YITTXWU2XVFOPVB6MTDCF3V/action/author_attestation","sign_citation":"https://pith.science/pith/RA6YITTXWU2XVFOPVB6MTDCF3V/action/citation_signature","submit_replication":"https://pith.science/pith/RA6YITTXWU2XVFOPVB6MTDCF3V/action/replication_record"}},"created_at":"2026-05-18T00:17:27.517118+00:00","updated_at":"2026-05-18T00:17:27.517118+00:00"}