scientific article

Publication date: 17 April 2012

Full work available at URL: http://www.jmlr.org/papers/v10/duchi09a.html

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

convex optimization online learning subgradient methods group sparsity

Convex programming (90C25) Applications of mathematical programming (90C90) Learning and adaptive systems in artificial intelligence (68T05) Applications of statistics (62P99)

Related Items (84)

A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning ⋮ Tseng type methods for solving inclusion problems and its applications ⋮ Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA ⋮ Stochastic forward-backward splitting for monotone inclusions ⋮ Modified Tseng's splitting algorithms for the sum of two monotone operators in Banach spaces ⋮ Comprehensive comparative analysis and identification of RNA-binding protein domains: multi-class classification and feature selection ⋮ A family of second-order methods for convex \(\ell _1\)-regularized optimization ⋮ Transaction cost optimization for online portfolio selection ⋮ Monotone operator theory in convex optimization ⋮ Complexity Analysis of stochastic gradient methods for PDE-constrained optimal Control Problems with uncertain parameters ⋮ Unnamed Item ⋮ A parallel Tseng's splitting method for solving common variational inclusion applied to signal recovery problems ⋮ A closer look at consistent operator splitting and its extensions for topology optimization ⋮ Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing ⋮ Nonlinear Reduced DNN Models for State Estimation ⋮ Statistical properties of convex clustering ⋮ An inertial forward-backward algorithm for monotone inclusions ⋮ Semi-discrete optimal transport: hardness, regularization and numerical solution ⋮ Mann-type algorithms for solving the monotone inclusion problem and the fixed point problem in reflexive Banach spaces ⋮ An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems ⋮ Block coordinate descent algorithms for large-scale sparse multiclass classification ⋮ Block-cyclic stochastic coordinate descent for deep neural networks ⋮ Distributed regularized online optimization using forward-backward splitting ⋮ A new modified forward-backward-forward algorithm for solving inclusion problems ⋮ Feature-aware regularization for sparse online learning ⋮ Online Estimation for Functional Data ⋮ Sparse identification of posynomial models ⋮ Forward-backward-forward algorithms involving two inertial terms for monotone inclusions ⋮ Robust echo state network with sparse online learning ⋮ Unnamed Item ⋮ An accelerated variance reducing stochastic method with Douglas-Rachford splitting ⋮ A modified Tseng splitting method with double inertial steps for solving monotone inclusion problems ⋮ A new projection algorithm for variational inclusion problems and its application to cervical cancer disease prediction ⋮ Three-operator splitting algorithm for a class of variational inclusion problems ⋮ A line search based proximal stochastic gradient algorithm with dynamical variance reduction ⋮ Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning ⋮ Fast projections onto mixed-norm balls with applications ⋮ An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration ⋮ A novel algorithm for approximating common solution of a system of monotone inclusion problems and common fixed point problem ⋮ Smoothing proximal gradient method for general structured sparse regression ⋮ The asymptotics of ranking algorithms ⋮ Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations ⋮ Proximal methods for the latent group lasso penalty ⋮ Stochastic Model-Based Minimization of Weakly Convex Functions ⋮ Analysis of Online Composite Mirror Descent Algorithm ⋮ Inertial methods for fixed point problems and zero point problems of the sum of two monotone mappings ⋮ Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing ⋮ A generalized online mirror descent with applications to classification and regression ⋮ On variance reduction for stochastic smooth convex optimization with multiplicative noise ⋮ Forward stability of ResNet and its variants ⋮ A Tight Bound of Hard Thresholding ⋮ Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization ⋮ Fast convergence of generalized forward-backward algorithms for structured monotone inclusions ⋮ Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems ⋮ Convergence of stochastic proximal gradient algorithm ⋮ Sample size selection in optimization methods for machine learning ⋮ Unnamed Item ⋮ Accelerated forward–backward algorithms for structured monotone inclusions ⋮ Learning Theory of Randomized Sparse Kaczmarz Method ⋮ Network classification with applications to brain connectomics ⋮ General convergence analysis of stochastic first-order methods for composite optimization ⋮ Modified Fejér sequences and applications ⋮ Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization ⋮ Modified forward-backward splitting method for variational inclusions ⋮ \(\ell_{2,0}\)-norm based selection and estimation for multivariate generalized linear models ⋮ Adaptive sequential machine learning ⋮ Unnamed Item ⋮ Technical Note—Perishable Inventory Systems: Convexity Results for Base-Stock Policies and Learning Algorithms Under Censored Demand ⋮ Robust and sparse regression in generalized linear model by stochastic optimization ⋮ Unnamed Item ⋮ On the linear convergence of the stochastic gradient method with constant step-size ⋮ Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity ⋮ Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization ⋮ Stochastic primal dual fixed point method for composite optimization ⋮ Make \(\ell_1\) regularization effective in training sparse CNN ⋮ Convergence analysis of the stochastic reflected forward-backward splitting algorithm ⋮ An efficient primal dual prox method for non-smooth optimization ⋮ Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems ⋮ A Variational Model for Spatially Weighting in Image Fusion ⋮ A Stochastic Variance Reduced Primal Dual Fixed Point Method for Linearly Constrained Separable Optimization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An inertial semi-forward-reflected-backward splitting and its application ⋮ Proximal Gradient Methods for Machine Learning and Imaging

This page was built for publication: