scientific article
From MaRDI portal
Publication:3093208
zbMath1222.68290MaRDI QIDQ3093208
Saharon Rosset, Ji Zhu, Trevor Hastie
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v5/rosset04a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (33)
Turnpike in optimal control of PDEs, ResNets, and beyond ⋮ Least angle regression. (With discussion) ⋮ Inducing wavelets into random fields via generative boosting ⋮ Mathematical foundations of machine learning. Abstracts from the workshop held March 21--27, 2021 (hybrid meeting) ⋮ Surprises in high-dimensional ridgeless least squares interpolation ⋮ Degrees of freedom for off-the-grid sparse estimation ⋮ A precise high-dimensional asymptotic theory for boosting and minimum-\(\ell_1\)-norm interpolated classifiers ⋮ Cost-sensitive boosting algorithms: do we really need them? ⋮ Piecewise linear regularized solution paths ⋮ Noise peeling methods to improve boosting algorithms ⋮ Sparsest representations and approximations of an underdetermined linear system ⋮ Multi-stage classifier design ⋮ The Lasso problem and uniqueness ⋮ Exploring the trade-off between generalization and empirical errors in a one-norm SVM ⋮ Degrees of freedom in lasso problems ⋮ Multiclass classification with potential function rules: margin distribution and generalization ⋮ Fully corrective boosting with arbitrary loss and regularization ⋮ Analysis of boosting algorithms using the smooth margin function ⋮ The generalized Lasso problem and uniqueness ⋮ Supervised projection approach for boosting classifiers ⋮ Bi-cross-validation for factor analysis ⋮ Feature selection guided by structural information ⋮ Doubly Penalized Buckley–James Method for Survival Data with High‐Dimensional Covariates ⋮ Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity ⋮ Boosting high dimensional predictive regressions with time varying parameters ⋮ MEBoost: variable selection in the presence of measurement error ⋮ Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization ⋮ In defense of the indefensible: a very naïve approach to high-dimensional inference ⋮ Unnamed Item ⋮ On the robustness of minimum norm interpolators and regularized empirical risk minimizers ⋮ Unnamed Item ⋮ AdaBoost and robust one-bit compressed sensing ⋮ Understanding neural networks with reproducing kernel Banach spaces
Uses Software
This page was built for publication:
