Boosting as a regularized path to a maximum margin classifier
From MaRDI portal
Recommendations
Cited in
(51)- Bi-cross-validation for factor analysis
- Noise peeling methods to improve boosting algorithms
- Least angle regression. (With discussion)
- The Lasso problem and uniqueness
- On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
- The generalized Lasso problem and uniqueness
- Boosting high dimensional predictive regressions with time varying parameters
- In defense of the indefensible: a very naïve approach to high-dimensional inference
- On the robustness of minimum norm interpolators and regularized empirical risk minimizers
- AdaBoost and robust one-bit compressed sensing
- Understanding neural networks with reproducing kernel Banach spaces
- 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
- Supervised projection approach for boosting classifiers
- Boosting as a kernel-based method
- Analysis of boosting algorithms using the smooth margin function
- Boosting with early stopping: convergence and consistency
- Piecewise linear regularized solution paths
- A view of margin losses as regularizers of probability estimates
- Inducing wavelets into random fields via generative boosting
- scientific article; zbMATH DE number 2089372 (Why is no real title available?)
- Some theory for generalized boosting algorithms
- Cost-sensitive boosting algorithms: do we really need them?
- Dynamic Visualization and Fast Computation for Convex Clustering via Algorithmic Regularization
- Entropy Regularized LPBoost
- Multi-stage classifier design
- Exploring the trade-off between generalization and empirical errors in a one-norm SVM
- Further results on the margin explanation of boosting: new algorithm and experiments
- Boosting With theL2Loss
- On ψ-Learning
- Degrees of freedom in lasso problems
- Sparsest representations and approximations of an underdetermined linear system
- Fully corrective boosting with arbitrary loss and regularization
- The implicit bias of gradient descent on separable data
- Learning Theory
- A selective boosting algorithm for maximizing the soft margin
- Statistical guarantees for local graph clustering
- scientific article; zbMATH DE number 6253924 (Why is no real title available?)
- Doubly Penalized Buckley–James Method for Survival Data with High‐Dimensional Covariates
- Turnpike in optimal control of PDEs, ResNets, and beyond
- Linear programming boosting via column generation
- Multiclass classification with potential function rules: margin distribution and generalization
- Homotopic policy mirror descent: policy convergence, algorithmic regularization, and improved sample complexity
- MEBoost: variable selection in the presence of measurement error
- A new perspective on boosting in linear regression via subgradient optimization and relatives
- To bag is to prune
- Iterative regularization in classification via hinge loss diagonal descent
- Uncertainty quantification for iterative algorithms in linear models with application to early stopping
- Feature selection guided by structural information
This page was built for publication: Boosting as a regularized path to a maximum margin classifier
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093208)
