A novel framework for online supervised learning with feature selection
From MaRDI portal
Cites work
- L₁-regularized least squares for support recovery of high dimensional single index models with Gaussian designs
- A distribution-free theory of nonparametric regression
- A test for a change in a parameter occurring at an unknown point
- Dual averaging methods for regularized stochastic learning and online optimization
- Efficient noise-tolerant learning from statistical queries
- Efficient online and batch learning using forward backward splitting
- Estimation of genetic correlation with summary association statistics
- Finite Sample Change Point Inference and Identification for High-Dimensional Mean Vectors
- scientific article; zbMATH DE number 1972910 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
- Logarithmic regret algorithms for online convex optimization
- Markov Neighborhood Regression for High-Dimensional Inference
- Multivariate online regression analysis with heterogeneous streaming data
- Nearly unbiased variable selection under minimax concave penalty
- Perishability of data: dynamic pricing under varying-coefficient models
- Primal-dual subgradient methods for convex problems
- Probabilistic machine learning. An introduction
- Regularization and Variable Selection Via the Elastic Net
- Renewable estimation and incremental inference in generalized linear models with streaming data sets
- Sharp Thresholds for High-Dimensional and Noisy Sparsity Recovery Using $\ell _{1}$-Constrained Quadratic Programming (Lasso)
- Sparse online learning via truncated gradient
- Support recovery without incoherence: a case for nonconvex regularization
- The elements of statistical learning. Data mining, inference, and prediction
- Thresholding-based iterative selection procedures for model selection and shrinkage
- Understanding machine learning. From theory to algorithms
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
This page was built for publication: A novel framework for online supervised learning with feature selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885341)
