paper-with-me

홈 › Papers

On the Use of Minimum Penalties in Statistical Learning

2021-06-09 · Ben Sherwood, Bradley S. Price

Modern multivariate machine learning and statistical methodologies estimate parameters of interest while leveraging prior knowledge of the association between outcome variables. The methods that do allow for estimation of relationships do so typically through an error covariance matrix in multivariate regression which does not scale to other types of models. In this article we proposed the MinPEN framework to simultaneously estimate regression coefficients associated with the multivariate regression model and the relationships between outcome variables using mild assumptions. The MinPen framework utilizes a novel penalty based on the minimum function to exploit detected relationships between responses. An iterative algorithm that generalizes current state of the art methods is proposed as a solution to the non-convex optimization that is required to obtain estimates. Theoretical results such as high dimensional convergence rates, model selection consistency, and a framework for post selection inference are provided. We extend the proposed MinPen framework to other exponential family loss functions, with a specific focus on multiple binomial responses. Tuning parameter selection is also addressed. Finally, simulations and two data examples are presented to show the finite sample properties of this framework.

📄 PDF Abstract BibTeX arXiv:2106.05172

Code (0)

등록된 구현이 없습니다.

Tasks

Model Selectionregression

Similar Papers 제목 키워드 기반

Untangling Lariats: Subgradient Following of Variationally Penalized Objectives

2024-05-07 · Kai-Chia Mo, Shai Shalev-Shwartz, Nisæl Shártov

We describe an apparatus for subgradient-following of the optimum of convex problems with variational penalties. In this setting, we receive a sequence $y_i,\ldots,y_n$ and seek a smooth sequence $x_1,\ldots,x_n$. The sm…

Temporal Sequences

On model selection consistency of penalized M-estimators: a geometric theory

2013-12-01 · NeurIPS 2013 12 · Jason D. Lee, Yuekai Sun, Jonathan E. Taylor

Penalized M-estimators are used in diverse areas of science and engineering to fit high-dimensional models with some low-dimensional structure. Often, the penalties are \emph{geometrically decomposable}, \ie\ can be expr…

Model Selection

Finite-sample risk bounds for maximum likelihood estimation with arbitrary penalties

2017-12-29 · W. D. Brinda, Jason M. Klusowski

The MDL two-part coding $ \textit{index of resolvability} $ provides a finite-sample upper bound on the statistical risk of penalized likelihood estimators over countable models. However, the bound does not apply to unpe…

Bilinear Parameterization for Non-Separable Singular Value Penalties

2021-06-19 · CVPR 2021 1 · Marcus Valtonen Ornhag, Jose Pedro Iglesias, Carl Olsson

Low rank inducing penalties have been proven to successfully uncover fundamental structures considered in computer vision and machine learning; however, such methods generally lead to non-convex optimization problems…

Second-order methods

Towards Faster Rates and Oracle Property for Low-Rank Matrix Estimation

2015-05-18 · Huan Gui, Quanquan Gu

We present a unified framework for low-rank matrix estimation with nonconvex penalties. We first prove that the proposed estimator attains a faster statistical rate than the traditional low-rank matrix estimator with nuc…

Matrix Completion