{"paper":{"title":"Approximate Leave-One-Out for High-Dimensional Non-Differentiable Learning Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Arian Maleki, Haihao Lu, Shuaiwen Wang, Vahab Mirrokni, Wenda Zhou","submitted_at":"2018-10-04T16:11:27Z","abstract_excerpt":"Consider the following class of learning schemes: \\begin{equation} \\label{eq:main-problem1}\n  \\hat{\\boldsymbol{\\beta}} := \\underset{\\boldsymbol{\\beta} \\in \\mathcal{C}}{\\arg\\min} \\;\\sum_{j=1}^n \\ell(\\boldsymbol{x}_j^\\top\\boldsymbol{\\beta}; y_j) + \\lambda R(\\boldsymbol{\\beta}), \\qquad \\qquad \\qquad (1) \\end{equation} where $\\boldsymbol{x}_i \\in \\mathbb{R}^p$ and $y_i \\in \\mathbb{R}$ denote the $i^{\\rm th}$ feature and response variable respectively. Let $\\ell$ and $R$ be the convex loss function and regularizer, $\\boldsymbol{\\beta}$ denote the unknown weights, and $\\lambda$ be a regularization p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02716","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"}