paper-with-me

홈 › Papers

Adaptive Noisy Data Augmentation for Regularized Estimation and Inference in Generalized Linear Models

2022-04-18 · Yinan Li, Fang Liu

We propose the AdaPtive Noise Augmentation (PANDA) procedure to regularize the estimation and inference of generalized linear models (GLMs). PANDA iteratively optimizes the objective function given noise augmented data until convergence to obtain the regularized model estimates. The augmented noises are designed to achieve various regularization effects, including $l_0$, bridge (lasso and ridge included), elastic net, adaptive lasso, and SCAD, as well as group lasso and fused ridge. We examine the tail bound of the noise-augmented loss function and establish the almost sure convergence of the noise-augmented loss function and its minimizer to the expected penalized loss function and its minimizer, respectively. We derive the asymptotic distributions for the regularized parameters, based on which, inferences can be obtained simultaneously with variable selection. PANDA exhibits ensemble learning behaviors that help further decrease the generalization error. Computationally, PANDA is easy to code, leveraging existing software for implementing GLMs, without resorting to complicated optimization techniques. We demonstrate the superior or similar performance of PANDA against the existing approaches of the same type of regularizers in simulated and real-life data. We show that the inferences through PANDA achieve nominal or near-nominal coverage and are far more efficient compared to a popular existing post-selection procedure.

📄 PDF Abstract BibTeX arXiv:2204.08574

Code (0)

등록된 구현이 없습니다.

Tasks

Data AugmentationEnsemble LearningVariable Selection

Similar Papers 제목 키워드 기반

PANDA: AdaPtive Noisy Data Augmentation for Regularization of Undirected Graphical Models

2018-10-11 · Yi-Nan Li, Xiao Liu, Fang Liu

We propose an AdaPtive Noise Augmentation (PANDA) technique to regularize the estimation and construction of undirected graphical models. PANDA iteratively optimizes the objective function given the noise augmented data …

Data AugmentationVariable Selection

Graph Augmentation for Recommendation

2024-03-25 · Qianru Zhang, Lianghao Xia, Xuheng Cai, SiuMing Yiu 외

Graph augmentation with contrastive learning has gained significant attention in the field of recommendation systems due to its ability to learn expressive user representations, even when labeled data is limited. However…

Contrastive LearningGraph Neural NetworkRecommendation Systems

Adaptive sparseness for correntropy-based robust regression via automatic relevance determination

2023-01-31 · Yuanhao Li, Badong Chen, Okito Yamashita, Natsue Yoshimura 외

Sparseness and robustness are two important properties for many machine learning scenarios. In the present study, regarding the maximum correntropy criterion (MCC) based robust regression algorithm, we investigate to int…

Bayesian Inferencefeature selectionregression

Robust Variable Selection and Estimation Via Adaptive Elastic Net S-Estimators for Linear Regression

2021-07-07 · David Kepplinger

Heavy-tailed error distributions and predictors with anomalous values are ubiquitous in high-dimensional regression problems and can seriously jeopardize the validity of statistical analyses if not properly addressed. Fo…

regressionVariable Selection

Adaptive Estimation and Inference in Conditional Moment Models via the Discrepancy Principle

2026-03-02 · Jiyuan Tan, Vasilis Syrgkanis arxiv

We study adaptive estimation and inference in ill-posed linear inverse problems defined by conditional moment restrictions. Existing regularized estimators such as Regularized DeepIV (RDIV) require prior knowledge of the…