scientific article; zbMATH DE number 6253925
From MaRDI portal
zbMath1280.62081MaRDI QIDQ5396661
Shai Shalev-Shwartz, Ambuj Tewari
Publication date: 3 February 2014
Full work available at URL: http://www.jmlr.org/papers/v12/shalev-shwartz11a.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ridge regression; shrinkage estimators (Lasso) (62J07) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inequalities; stochastic orderings (60E15) Stochastic programming (90C15)
Related Items
Investigating competition in financial markets: a sparse autologistic model for dynamic network data, Hybrid safe-strong rules for efficient optimization in Lasso-type problems, Accelerated, Parallel, and Proximal Coordinate Descent, A stochastic successive minimization method for nonsmooth nonconvex optimization with applications to transceiver design in wireless communication networks, Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems, An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization, On optimal probabilities in stochastic coordinate descent methods, A stochastic extra-step quasi-Newton method for nonsmooth nonconvex optimization, Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee, A random block-coordinate Douglas-Rachford splitting method with low computational complexity for binary logistic regression, Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization, Adaptive coordinate sampling for stochastic primal–dual optimization, Stochastic approximation with discontinuous dynamics, differential inclusions, and applications, A Randomized Nonmonotone Block Proximal Gradient Method for a Class of Structured Nonlinear Programming, Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory, Large-scale distributed sparse class-imbalance learning, Robust supervised learning with coordinate gradient descent, Local linear convergence of proximal coordinate descent algorithm, Synchronous parallel block coordinate descent method for nonsmooth convex function minimization, Faster convergence of a randomized coordinate descent method for linearly constrained optimization problems, Analysis of Online Composite Mirror Descent Algorithm, Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function, Nonmonotone Barzilai-Borwein gradient algorithm for \(\ell_1\)-regularized nonsmooth minimization in compressive sensing, Pathwise coordinate optimization for sparse learning: algorithm and theory, Multi-label Lagrangian support vector machine with random block coordinate descent method, On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization, Iteration complexity analysis of block coordinate descent methods, Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions, Unnamed Item, Unnamed Item, Unnamed Item, Stochastic proximal quasi-Newton methods for non-convex composite optimization, Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization, A parallel line search subspace correction method for composite convex optimization, Efficient computation for differential network analysis with applications to quadratic discriminant analysis, Markov chain block coordinate descent, A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization, Gauss-Seidel method with oblique direction, Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent, Sparse low-rank separated representation models for learning from data, Nonparametric regression with modified ReLU networks, On the local convergence of a stochastic semismooth Newton method for nonsmooth nonconvex optimization, Unnamed Item, Unnamed Item, Unnamed Item, A generic coordinate descent solver for non-smooth convex optimisation, Coordinate descent algorithms, A second-order method for strongly convex \(\ell _1\)-regularization problems, Parallel coordinate descent methods for big data optimization
