Pages that link to "Item:Q3631444"

The following pages link to The Group Lasso for Logistic Regression (Q3631444):

Displaying 50 items.

• On asymptotically optimal confidence regions and tests for high-dimensional models (Q95759) (← links)
• Fast marginal likelihood estimation of penalties for group-adaptive elastic net (Q108783) (← links)
• Ensembling classification models based on phalanxes of variables with applications in drug discovery (Q124196) (← links)
• Penalized Estimation of Directed Acyclic Graphs From Discrete Data (Q139756) (← links)
• A Note on Coding and Standardization of Categorical Variables in (Sparse) Group Lasso Regression (Q146016) (← links)
• Multi-Resolution Functional ANOVA for Large-Scale, Many-Input Computer Experiments (Q147162) (← links)
• Model selection in linear mixed models (Q252741) (← links)
• Group variable selection for relative error regression (Q282894) (← links)
• Split Bregman algorithms for sparse group lasso with application to MRI reconstruction (Q335981) (← links)
• Block coordinate proximal gradient methods with variable Bregman functions for nonsmooth separable optimization (Q344922) (← links)
• Fast learning rate of multiple kernel learning: trade-off between sparsity and smoothness (Q366980) (← links)
• Grouping strategies and thresholding for high dimensional linear models (Q394551) (← links)
• Block coordinate descent algorithms for large-scale sparse multiclass classification (Q399900) (← links)
• Group coordinate descent algorithms for nonconvex penalized regression (Q425386) (← links)
• Simultaneous estimation and factor selection in quantile regression via adaptive sup-norm regularization (Q433240) (← links)
• Sparsity with sign-coherent groups of variables via the cooperative-Lasso (Q439175) (← links)
• The log-linear group-lasso estimator and its asymptotic properties (Q442085) (← links)
• Simultaneous multiple response regression and inverse covariance matrix estimation via penalized Gaussian maximum likelihood (Q444979) (← links)
• Subset selection in Poisson regression (Q450845) (← links)
• Proximal methods for the latent group lasso penalty (Q457209) (← links)
• On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems (Q457540) (← links)
• Concave group methods for variable selection and estimation in high-dimensional varying coefficient models (Q477279) (← links)
• On the linear convergence of the approximate proximal splitting method for non-smooth convex optimization (Q489108) (← links)
• Sparse modeling of categorial explanatory variables (Q542985) (← links)
• Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
• \(\ell_{1}\)-penalization for mixture regression models (Q619141) (← links)
• Consistent group selection in high-dimensional linear regression (Q627307) (← links)
• A majorization-minimization approach to variable selection using spike and slab priors (Q638812) (← links)
• Oracle inequalities and optimal inference under group sparsity (Q651028) (← links)
• A greedy feature selection algorithm for big data of high dimensionality (Q669273) (← links)
• Nonconcave penalized composite conditional likelihood estimation of sparse Ising models (Q693730) (← links)
• Some theoretical results on the grouped variables Lasso (Q734551) (← links)
• Accuracy guaranties for \(\ell_{1}\) recovery of block-sparse signals (Q741817) (← links)
• Penalized estimation in additive varying coefficient models using grouped regularization (Q744806) (← links)
• On Bayesian lasso variable selection and the specification of the shrinkage parameter (Q746286) (← links)
• A tutorial on rank-based coefficient estimation for censored data in small- and large-scale problems (Q746299) (← links)
• APPLE: approximate path for penalized likelihood estimators (Q746326) (← links)
• Sample size determination for training cancer classifiers from microarray and RNA-seq data (Q746699) (← links)
• The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms (Q778013) (← links)
• Double regularization methods for robust feature selection and SVM classification via DC programming (Q781867) (← links)
• Hybrid safe-strong rules for efficient optimization in Lasso-type problems (Q830584) (← links)
• Conditional score matching for high-dimensional partial graphical models (Q830589) (← links)
• Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230) (← links)
• Variable selection for generalized linear mixed models by \(L_1\)-penalized estimation (Q892458) (← links)
• Gene selection and prediction for cancer classification using support vector machines with a reject option (Q901576) (← links)
• From compression to compressed sensing (Q905909) (← links)
• Discussion: One-step sparse estimates in nonconcave penalized likelihood models (Q939651) (← links)
• A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
• High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression (Q973867) (← links)
• Least angle and \(\ell _{1}\) penalized regression: a review (Q975564) (← links)