Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
From MaRDI portal
(Redirected from Publication:5273565)
Cited in
(31)- \(l_{0}\)-norm based structural sparse least square regression for feature selection
- Fast inference in generalized linear models via expected log-likelihoods
- Model selection via standard error adjusted adaptive Lasso
- An efficient adaptive forward-backward selection method for sparse polynomial chaos expansion
- Smoothing Newton method for \(\ell^0\)-\(\ell^2\) regularized linear inverse problem
- Fast feature selection via streamwise procedure for massive data
- A forward-backward greedy approach for sparse multiscale learning
- Greedy approximation in convex optimization
- Forward and backward least angle regression for nonlinear system identification
- Multi-stage convex relaxation for feature selection
- Reprint of: A forward-backward greedy approach for sparse multiscale learning
- Particle swarm stepwise (PaSS) algorithm for information criteria-based variable selections
- scientific article; zbMATH DE number 6982301 (Why is no real title available?)
- Sequential Lasso cum EBIC for feature selection with ultra-high dimensional feature space
- scientific article; zbMATH DE number 7626767 (Why is no real title available?)
- Scalable algorithms for the sparse ridge regression
- Scalable interpretable multi-response regression via SEED
- Generalized Sobol sensitivity indices for dependent variables: numerical methods
- Confidence intervals for low dimensional parameters in high dimensional linear models
- High-dimensional regression with unknown variance
- A general theory of concave regularization for high-dimensional sparse estimation problems
- Overview of debiased Lasso in high-dimensional linear model
- Adaptive Algorithm for Multi-Armed Bandit Problem with High-Dimensional Covariates
- An Interactive Greedy Approach to Group Sparsity in High Dimensions
- Constrained mix sparse optimization via hard thresholding pursuit
- Environment invariant linear least squares
- Variable Selection for High-Dimensional Heteroscedastic Regression and Its Applications
- High-Dimensional Knockoffs Inference for Time Series Data
- Reinforced variable selection
- Scalable network estimation with L₀ penalty
- Geometry-dependent matching pursuit: a transition phase for convergence on linear regression and Lasso
This page was built for publication: Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5273565)
