Efficient online and batch learning using forward backward splitting
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 67625
- Distributed regularized online optimization using forward-backward splitting
- On‐line learning for very large data sets
- Fast and strong convergence of online learning algorithms
- Optimal distributed online prediction using mini-batches
- scientific article; zbMATH DE number 5957487
- Multi kernel learning with online-batch optimization
- scientific article; zbMATH DE number 1569113
- Approximation vector machines for large-scale online learning
- scientific article; zbMATH DE number 1950582
Cited in
(only showing first 100 items - show all)- Tseng type methods for solving inclusion problems and its applications
- Monotone operator theory in convex optimization
- A closer look at consistent operator splitting and its extensions for topology optimization
- On variance reduction for stochastic smooth convex optimization with multiplicative noise
- Modified Fejér sequences and applications
- An inexact alternating directions algorithm for constrained total variation regularized compressive sensing problems
- Fast projections onto mixed-norm balls with applications
- Splitting and linearizing augmented Lagrangian algorithm for subspace recovery from corrupted observations
- Forward stability of ResNet and its variants
- Alternating direction multiplier method for matrix \(l_{2,1}\)-norm optimization in multitask feature learning problems
- Convergence of stochastic proximal gradient algorithm
- General convergence analysis of stochastic first-order methods for composite optimization
- Modified forward-backward splitting method for variational inclusions
- \(\ell_{2,0}\)-norm based selection and estimation for multivariate generalized linear models
- Convergence analysis of the stochastic reflected forward-backward splitting algorithm
- An inertial semi-forward-reflected-backward splitting and its application
- Modified Tseng's splitting algorithms for the sum of two monotone operators in Banach spaces
- A parallel Tseng's splitting method for solving common variational inclusion applied to signal recovery problems
- Iterative method with inertial terms for nonexpansive mappings: applications to compressed sensing
- Three-operator splitting algorithm for a class of variational inclusion problems
- Network classification with applications to brain connectomics
- Robust and sparse regression in generalized linear model by stochastic optimization
- On the linear convergence of the stochastic gradient method with constant step-size
- An efficient primal dual prox method for non-smooth optimization
- Proximal iterative Gaussian smoothing algorithm for a class of nonsmooth convex minimization problems
- A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning
- Generalized Peaceman-Rachford splitting method for multiple-block separable convex programming with applications to robust PCA
- An accelerated variance reducing stochastic method with Douglas-Rachford splitting
- The asymptotics of ranking algorithms
- A new modified forward-backward-forward algorithm for solving inclusion problems
- A novel algorithm for approximating common solution of a system of monotone inclusion problems and common fixed point problem
- A general framework for fast stagewise algorithms
- Sparse online learning via truncated gradient
- Stochastic forward-backward splitting for monotone inclusions
- Bundle methods for regularized risk minimization
- 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
- Block coordinate descent algorithms for large-scale sparse multiclass classification
- Smoothing proximal gradient method for general structured sparse regression
- Transaction cost optimization for online portfolio selection
- Convergence of unregularized online learning algorithms
- Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
- A tight bound of hard thresholding
- Proximal methods for the latent group lasso penalty
- Stochastic model-based minimization of weakly convex functions
- Stochastic primal-dual coordinate method for regularized empirical risk minimization
- A survey of algorithms and analysis for adaptive online learning
- scientific article; zbMATH DE number 6860836 (Why is no real title available?)
- Learning theory of randomized sparse Kaczmarz method
- 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
- A data efficient and feasible level set method for stochastic convex optimization with expectation constraints
- Technical note: Perishable inventory systems: convexity results for base-stock policies and learning algorithms under censored demand
- Stochastic proximal AUC maximization
- Proximal Gradient Methods for Machine Learning and Imaging
- Complexity Analysis of stochastic gradient methods for PDE-constrained optimal Control Problems with uncertain parameters
- Fast convergence of generalized forward-backward algorithms for structured monotone inclusions
- Nonlinear reduced DNN models for state estimation
- SVM via saddle point optimization: new bounds and distributed algorithms
- Adaptive sequential machine learning
- Convergence rates for deterministic and stochastic subgradient methods without Lipschitz continuity
- Incremental majorization-minimization optimization with application to large-scale machine learning
- Analysis of Online Composite Mirror Descent Algorithm
- Kernel approximation methods for speech recognition
- Inertial methods for fixed point problems and zero point problems of the sum of two monotone mappings
- Manifold identification in dual averaging for regularized stochastic online learning
- A variational model for spatially weighting in image fusion
- A stochastic variance reduced primal dual fixed point method for linearly constrained separable optimization
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- 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
- Block-cyclic stochastic coordinate descent for deep neural networks
- Distributed regularized online optimization using forward-backward splitting
- Online Estimation for Functional Data
- Forward-backward-forward algorithms involving two inertial terms for monotone inclusions
- Robust echo state network with sparse online learning
- 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
- A line search based proximal stochastic gradient algorithm with dynamical variance reduction
- An accelerated forward-backward-half forward splitting algorithm for monotone inclusion with applications to image restoration
- Accelerated forward–backward algorithms for structured monotone inclusions
- When will gradient methods converge to max-margin classifier under ReLU models?
- HiQR: an efficient algorithm for high-dimensional quadratic regression with penalties
- Online composite optimization with time-varying regularizers
- Mini-batch stochastic subgradient for functional constrained optimization
- Forward-reflected-backward splitting algorithms with momentum: weak, linear and strong convergence results
- Fast iterative regularization by reusing data
- Three-operator reflected forward-backward splitting algorithm with double inertial effects
- On relaxed inertial projection and contraction algorithms for solving monotone inclusion problems
- A primal-dual backward reflected forward splitting algorithm for structured monotone inclusions
- Almost sure convergence rates of stochastic proximal gradient descent algorithm
- Modified inertial Tseng method for solving variational inclusion and fixed point problems on Hadamard manifolds
- A new algorithm for approximating solutions of the common variational inclusion
- Iterative methods for solving monotone variational inclusions without prior knowledge of the Lipschitz constant of the single-valued operator
- A novel inertial proximal contraction-type algorithm with self-adaptive step size for solving monotone variational inclusion problems
- Inertial Halpern-type Tseng's method for approximating a solution to monotone inclusion problems with fixed point constraint
- Accelerated Douglas-Rachford splitting algorithm using neural network
- A two-step inertial method for common variational inclusions with applications to sparse learning models
- Variable metric proximal stochastic gradient methods with additional sampling
- Four-operator reflected forward-backward algorithm for solving monotone inclusions involving Lipschitzian operator
This page was built for publication: Efficient online and batch learning using forward backward splitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880998)
