scientific article; zbMATH DE number 6253940

zbMath1280.94029arXiv1009.2139MaRDI QIDQ5396679

Francis Bach, Rodolphe Jenatton, Julien Mairal, Guillaume Obozinski

Publication date: 3 February 2014

Full work available at URL: https://arxiv.org/abs/1009.2139

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Learning and adaptive systems in artificial intelligence (68T05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Related Items (49)

Bayesian variable selection and estimation for group Lasso ⋮ Linearized alternating direction method of multipliers for sparse group and fused Lasso models ⋮ Learning Sparsely Used Overcomplete Dictionaries via Alternating Minimization ⋮ Parameter choices for sparse regularization with the ℓ1 norm ^* ⋮ Structured Sparsity: Discrete and Convex Approaches ⋮ Sharp MSE bounds for proximal denoising ⋮ Monotone operator theory in convex optimization ⋮ A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives ⋮ Error bounds for compressed sensing algorithms with group sparsity: A unified approach ⋮ Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging ⋮ A lasso for hierarchical interactions ⋮ A First-Order Optimization Algorithm for Statistical Learning with Hierarchical Sparsity Structure ⋮ The geometry of least squares in the 21st century ⋮ Convergence Rate Analysis of Primal-Dual Splitting Schemes ⋮ Efficient nonconvex sparse group feature selection via continuous and discrete optimization ⋮ Learning with optimal interpolation norms ⋮ A Dirichlet-Tree Multinomial Regression Model for Associating Dietary Nutrients with Gut Microorganisms ⋮ Sparse and low-rank matrix regularization for learning time-varying Markov networks ⋮ Subspace learning by \(\ell^0\)-induced sparsity ⋮ Inexact proximal stochastic gradient method for convex composite optimization ⋮ Sparse representation based Fisher discrimination dictionary learning for image classification ⋮ Fast overcomplete dictionary construction with probabilistic guarantees ⋮ Fast projections onto mixed-norm balls with applications ⋮ Hierarchical sparse modeling: a choice of two group Lasso formulations ⋮ Smoothing proximal gradient method for general structured sparse regression ⋮ Alternating Proximal Regularized Dictionary Learning ⋮ A tree-based dictionary learning framework ⋮ Discriminative compact pyramids for object and scene recognition ⋮ Discrete optimization methods for group model selection in compressed sensing ⋮ Foveated compressive imaging for low power vehicle fingerprinting and tracking in aerial imagery ⋮ Efficient Learning with a Family of Nonconvex Regularizers by Redistributing Nonconvexity ⋮ First- and Second-Order Methods for Online Convolutional Dictionary Learning ⋮ Group Regularized Estimation Under Structural Hierarchy ⋮ An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems ⋮ Structured sparsity through convex optimization ⋮ A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers ⋮ Bayesian indicator variable selection to incorporate hierarchical overlapping group structure in multi-omics applications ⋮ Toward fast transform learning ⋮ Image deblurring with coupled dictionary learning ⋮ On integer and MPCC representability of affine sparsity ⋮ Research and realization of video target detection system based on deep learning ⋮ On Algorithms for Difference of Monotone Operators ⋮ On Algorithms for Difference of Monotone Operators ⋮ Penalized Cox's proportional hazards model for high-dimensional survival data with grouped predictors ⋮ Gap Safe screening rules for sparsity enforcing penalties ⋮ Investigating consumers' store-choice behavior via hierarchical variable selection ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item

Uses Software

BSDS

This page was built for publication: