Sparse calibration based on adaptive lasso penalty for computer models

DOI10.1080/03610918.2022.2155311MaRDI QIDQ6971880zbMATH OpenFDO

Authors Yang Sun, Xiangzhong Fang

Publication date 13 June 2025

Published in Communications in Statistics. Simulation and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03610918.2022.2155311

Mathematics Subject Classification ID

Statistics (62-XX)

Cites work

• A frequentist approach to computer model calibration
• A new perspective on robust \(M\)-estimation: finite sample theory and applications to dependence-adjusted multiple testing
• A tuning-free robust and efficient approach to high-dimensional regression
• Adaptive Huber Regression
• Adjustments to computer models via projected kernel calibration
• Bayesian calibration of computer models. (With discussion)
• Bayesian Projected Calibration of Computer Models
• Calibration for computer experiments with binary responses and application to cell adhesion study
• Computer Model Emulation with High-Dimensional Functional Output in Large-Scale Observing System Uncertainty Experiments
• Effective model calibration via sensible variable identification and adjustment with application to composite fuselage simulation
• Efficient calibration for imperfect computer models
• High-dimensional statistics. A non-asymptotic viewpoint
• scientific article; zbMATH DE number 845714 (Why is no real title available?)
• I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error
• Robust Estimation of a Location Parameter
• Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties

This page was built for publication: Sparse calibration based on adaptive lasso penalty for computer models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6971880)