Sparse Partially Linear Additive Models
원문 초록
The generalized partially linear additive model (GPLAM) is a flexible and interpretable approach to building predictive models. It combines features in an additive manner, allowing each to have either a linear or nonlinear effect on the response. However, the choice of which features to treat as linear or nonlinear is typically assumed known. Thus, to make a GPLAM a viable approach in situations in which little is known $a~priori$ about the features, one must overcome two primary model selection challenges: deciding which features to include in the model and determining which of these features to treat nonlinearly. We introduce the sparse partially linear additive model (SPLAM), which combines model fitting and $both$ of these model selection challenges into a single convex optimization problem. SPLAM provides a bridge between the lasso and sparse additive models. Through a statistical oracle inequality and thorough simulation, we demonstrate that SPLAM can outperform other methods across a broad spectrum of statistical regimes, including the high-dimensional ($p\gg N$) setting. We develop efficient algorithms that are applied to real data sets with half a million samples and over 45,000 features with excellent predictive performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
AutoML Algorithms for Online Generalized Additive Model Selection: Application to Electricity Demand Forecasting
mTSBench: Benchmarking Multivariate Time Series Anomaly Detection and Model Selection at Scale
Leveraging Predictive Equivalence in Decision Trees
The use of cross validation in the analysis of designed experiments
Router-R1: Teaching LLMs Multi-Round Routing and Aggregation via Reinforcement Learning
Tuning the Right Foundation Models is What you Need for Partial Label Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.