swMATH28396MaRDI QIDQ40110FDOQ40110
Author name not available (Why is that?)
Official website: https://arxiv.org/abs/1106.5730
Cited In (only showing first 100 items - show all)
- Randomized Kaczmarz with averaging
- 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
- 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)
- Distributed matrix completion and robust factorization
- An accelerated communication-efficient primal-dual optimization framework for structured machine learning
- Optimization methods for large-scale machine learning
- Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
- On unbounded delays in asynchronous parallel fixed-point algorithms
- A Continuous-Time Analysis of Distributed Stochastic Gradient
- Asynchronous stochastic coordinate descent: parallelism and convergence properties
- Matrix completion under interval uncertainty
- Deep convolutional neural networks for image classification: a comprehensive review
- A distributed flexible delay-tolerant proximal gradient algorithm
- Stochastic reformulations of linear systems: algorithms and convergence theory
- Robust asynchronous stochastic gradient-push: asymptotically optimal and network-independent performance for strongly convex functions
- Dynamic assortment personalization in high dimensions
- A sparse completely positive relaxation of the modularity maximization for community detection
- Consensus-based modeling using distributed feature construction with ILP
- Asynchronous parallel algorithms for nonconvex optimization
- On the convergence of asynchronous parallel iteration with unbounded delays
- Performance analysis of asynchronous parallel Jacobi
- 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
- Perturbed iterate analysis for asynchronous stochastic optimization
- Global convergence rate of proximal incremental aggregated gradient methods
- AMLET
- KSSOLV
- RCV1
- Jellyfish
- iPiasco
- Dremel
- CYCLADES
- TMAC
- ARock
- Efficient inference and learning in a large knowledge base. Reasoning with extracted information using a locally groundable first-order probabilistic logic
- Giraph
- SGD-QN
- GSPBOX
- TernGrad
- AsynML
- ADD-OPT
- Graft
- AIDE
- DSCOVR
- DiSCO
- Vowpal Wabbit
- Tuffy
- ensmallen
- GraphChi
- ciag
- SCAFFOLD
- TuPAQ
- Sampling Strategies for Fast Updating of Gaussian Markov Random Fields
- EGC: entropy-based gradient compression for distributed deep learning
- DoReFa-Net
- Finito
- GPipe
- Saga
- Trace
- Coordinate descent algorithms
- Practical matrix completion and corruption recovery using proximal alternating robust subspace minimization
- A block successive upper-bound minimization method of multipliers for linearly constrained convex optimization
- SONIA
- Deep xVA solver
- Inertial-SsGM
- Distributed and robust support vector machine
- Revisiting EXTRA for Smooth Distributed Optimization
- Zipline: an optimized algorithm for the elastic bulk synchronous parallel model
- What can be sampled locally?
- Parallelizing stochastic gradient descent for least squares regression: mini-batching, averaging, and model misspecification
- 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 *
- Sample size selection in optimization methods for machine learning
- Title not available (Why is that?)
- Parallelizable Algorithms for Optimization Problems with Orthogonality Constraints
- DSCOVR: randomized primal-dual block coordinate algorithms for asynchronous distributed optimization
- A general distributed dual coordinate optimization framework for regularized loss minimization
- An Optimal Algorithm for Decentralized Finite-Sum Optimization
- Collaborative filtering for massive multinomial data
- Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
- A class of parallel doubly stochastic algorithms for large-scale learning
- Title not available (Why is that?)
- Weighted SGD for \(\ell_p\) regression with randomized preconditioning
- Trust-region algorithms for training responses: machine learning methods using indefinite Hessian approximations
- APAM
- Title not available (Why is that?)
- Numerical methods for the resource allocation problem in a computer network
- Properties of vector embeddings in social networks
- Title not available (Why is that?)
- Fast and reliable parameter estimation from nonlinear observations
- Distributed stochastic inertial-accelerated methods with delayed derivatives for nonconvex problems
- Online learning in optical tomography: a stochastic approach
- \textsc{OCam}: out-of-core coordinate descent algorithm for matrix completion
- Redundancy techniques for straggler mitigation in distributed optimization and learning
This page was built for software: HOGWILD
