REVIEW 5 cited by
Lecture notes on ridge regression
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
The linear regression model cannot be fitted to high-dimensional data, as the high-dimensionality brings about empirical non-identifiability. Penalized regression overcomes this non-identifiability by augmentation of the loss function by a penalty (i.e. a function of regression coefficients). The ridge penalty is the sum of squared regression coefficients, giving rise to ridge regression. Here many aspect of ridge regression are reviewed e.g. moments, mean squared error, its equivalence to constrained estimation, and its relation to Bayesian regression. Finally, its behaviour and use are illustrated in simulation and on omics data. Subsequently, ridge regression is generalized to allow for a more general penalty. The ridge penalization framework is then translated to logistic regression and its properties are shown to carry over. To contrast ridge penalized estimation, the final chapters introduce its lasso counterpart and generalizations thereof.
Forward citations
Cited by 5 Pith papers
-
Post-estimation Adjustments in Data-driven Decision-making with Applications in Pricing
A multiplicative post-estimation adjustment with closed-form coefficient, derived from the third-to-second derivative ratio of the reward, asymptotically improves predict-then-optimize decisions in pricing.
-
Efficient Parameter Estimation for Bayesian Network Classifiers using Hierarchical Linear Smoothing
Hierarchical linear smoothing replaces expensive HDP Gibbs sampling in Bayesian network classifiers with a fast log-linear regression that achieves comparable or better accuracy.
-
Efficient Sampling Allocation Strategies for General Graph-Filter-Based Signal Recovery
The paper casts sensor placement for graph-filtered regularized estimation as four cost functions, provides greedy and projected-gradient solvers, and reports up to 50% MSE reduction over A-, E-, and LR-design in test...
-
ESS-ReduNet: Enhancing Subspace Separability of ReduNet via Dynamic Expansion with Bayesian Inference
ESS-ReduNet speeds ReduNet training by dynamically boosting the expansion operator and correcting membership estimates with label-derived Bayesian posteriors, reporting more than 10x faster convergence on several datasets.
-
Quantile deep learning models for multi-step ahead time series prediction
Applying the quantile check loss to BD-LSTM, ED-LSTM, and Conv-LSTM gives multi-step forecasts with 5th-95th percentile bands at similar RMSE to the standard models on crypto and benchmark data.
Discussion (0). Continue with ORCID to comment.