Pages that link to "Item:Q399900"
From MaRDI portal
The following pages link to Block coordinate descent algorithms for large-scale sparse multiclass classification (Q399900):
Displaying 14 items.
- A coordinate descent MM algorithm for fast computation of sparse logistic PCA (Q333734) (← links)
- Sparse group Lasso and high dimensional multinomial classification (Q1621358) (← links)
- Kernel multilogit algorithm for multiclass classification (Q1623757) (← links)
- Semi-supervised AUC optimization based on positive-unlabeled learning (Q1640567) (← links)
- A weighted block dictionary learning algorithm for classification (Q1793072) (← links)
- Subspace quadratic regularization method for group sparse multinomial logistic regression (Q2044487) (← links)
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring (Q2185626) (← links)
- A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression (Q2419533) (← links)
- Incremental regularized least squares for dimensionality reduction of large-scale data (Q2810327) (← links)
- A comparison of optimization methods and software for large-scale L1-regularized linear classifi\-cation (Q2896183) (← links)
- Separable approximations and decomposition methods for the augmented Lagrangian (Q2943840) (← links)
- (Q5129275) (← links)
- Taylor quasi-likelihood for limited generalized linear models (Q5861540) (← links)
- Robust supervised learning with coordinate gradient descent (Q6172182) (← links)
