Group sparse optimization for learning predictive state representations
From MaRDI portal
Publication:778374
alternating direction method of multipliersgroup sparse optimizationpredictive state representations
Learning and adaptive systems in artificial intelligence (68T05) Ridge regression; shrinkage estimators (Lasso) (62J07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Semidefinite programming (90C22) Agent technology and artificial intelligence (68T42)
Recommendations
- Models of active learning in group-structured state spaces
- Group Sparse Bayesian Learning Via Exact and Fast Marginal Likelihood Maximization
- Minimum description length penalization for group and multi-task sparse learning
- Bayesian Group-Sparse Modeling and Variational Inference
- Group sparse RLS algorithms
- Sparse optimization for nonconvex group penalized estimation
- Group-Sparse Model Selection: Hardness and Relaxations
- Group sparse optimization via \(\ell_{p,q}\) regularization
- Convergence analyses on sparse feedforward neural networks via group lasso regularization
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Analyzing Weighted $\ell_1$ Minimization for Sparse Recovery With Nonuniform Sparse Models
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Efficient block-coordinate descent algorithms for the group Lasso
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Model Selection and Estimation in Regression with Grouped Variables
- Near-ideal model selection by \(\ell _{1}\) minimization
- Planning and acting in partially observable stochastic domains
Cited in
(3)
This page was built for publication: Group sparse optimization for learning predictive state representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q778374)