HOGWILD

swMATH28396MaRDI QIDQ40110FDOQ40110

Author name not available (Why is that?)

Cited In (71)

• A Block Successive Upper-Bound Minimization Method of Multipliers for Linearly Constrained Convex Optimization
• Randomized Kaczmarz with averaging
• Collaborative filtering for massive multinomial data
• Perturbed Iterate Analysis for Asynchronous Stochastic Optimization
• Parallel coordinate descent methods for big data optimization
• Vampire with a brain is a good ITP hammer
• On the parallelization upper bound for asynchronous stochastic gradients descent in non-convex optimization
• Global Convergence Rate of Proximal Incremental Aggregated Gradient Methods
• Asynchronous parallel primal-dual block coordinate update methods for affinely constrained convex programs
• An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
• An asynchronous distributed and scalable generalized Nash equilibrium seeking algorithm for strongly monotone games
• ARock: an algorithmic framework for asynchronous parallel coordinate updates
• Towards easier and faster sequence labeling for natural language processing: a search-based probabilistic online learning framework (SAPO)
• An accelerated communication-efficient primal-dual optimization framework for structured machine learning
• On unbounded delays in asynchronous parallel fixed-point algorithms
• Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations
• A Continuous-Time Analysis of Distributed Stochastic Gradient
• Matrix completion under interval uncertainty
• Distributed and Robust Support Vector Machine
• Title not available (Why is that?)
• Numerical methods for the resource allocation problem in a computer network
• Properties of vector embeddings in social networks
• Consensus-based modeling using distributed feature construction with ILP
• Asynchronous parallel algorithms for nonconvex optimization
• Distributed Stochastic Optimization with Large Delays
• On the convergence of asynchronous parallel iteration with unbounded delays
• Performance analysis of asynchronous parallel Jacobi
• DSCOVR: Randomized Primal-Dual Block Coordinate Algorithms for Asynchronous Distributed Optimization
• Title not available (Why is that?)
• A General Distributed Dual Coordinate Optimization Framework for Regularized Loss Minimization
• Eigenvector Computation and Community Detection in Asynchronous Gossip Models
• Likelihood Inference for Large Scale Stochastic Blockmodels With Covariates Based on a Divide-and-Conquer Parallelizable Algorithm With Communication
• Asynchronous Stochastic Coordinate Descent: Parallelism and Convergence Properties
• Online learning in optical tomography: a stochastic approach
• \textsc{OCam}: out-of-core coordinate descent algorithm for matrix completion
• Efficient inference and learning in a large knowledge base. Reasoning with extracted information using a locally groundable first-order probabilistic logic
• Sampling Strategies for Fast Updating of Gaussian Markov Random Fields
• EGC: entropy-based gradient compression for distributed deep learning
• Dynamic Assortment Personalization in High Dimensions
• Improved asynchronous parallel optimization analysis for stochastic incremental methods
• Coordinate descent algorithms
• Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
• Title not available (Why is that?)
• Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
• Optimization Methods for Large-Scale Machine Learning
• On the convergence analysis of asynchronous SGD for solving consistent linear systems
• Variance reduction for root-finding problems
• Revisiting EXTRA for Smooth Distributed Optimization
• Zipline: an optimized algorithm for the elastic bulk synchronous parallel model
• What can be sampled locally?
• Title not available (Why is that?)
• Comment: A brief survey of the current state of play for Bayesian computation in data science at big-data scale
• Block delayed Majorize-Minimize subspace algorithm for large scale image restoration ^*
• Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions
• A Sparse Completely Positive Relaxation of the Modularity Maximization for Community Detection
• Sample size selection in optimization methods for machine learning
• Distributed Matrix Completion and Robust Factorization
• Title not available (Why is that?)
• Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory
• A Distributed Flexible Delay-Tolerant Proximal Gradient Algorithm
• Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
• Deep Convolutional Neural Networks for Image Classification: A Comprehensive Review
• Fast and Reliable Parameter Estimation from Nonlinear Observations
• An Optimal Algorithm for Decentralized Finite-Sum Optimization
• Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
• Title not available (Why is that?)
• Distributed Stochastic Inertial-Accelerated Methods with Delayed Derivatives for Nonconvex Problems
• Redundancy Techniques for Straggler Mitigation in Distributed Optimization and Learning
• Title not available (Why is that?)
• Title not available (Why is that?)
• A class of smooth exact penalty function methods for optimization problems with orthogonality constraints

This page was built for software: HOGWILD