Distributed Learning with Sparse Communications by Identification
From MaRDI portal
Cites work
- ``Active-set complexity of proximal gradient: how long does it take to find the sparsity pattern?
- A distributed flexible delay-tolerant proximal gradient algorithm
- An accelerated communication-efficient primal-dual optimization framework for structured machine learning
- An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization
- An Asynchronous Parallel Stochastic Coordinate Descent Algorithm
- An inexact variable metric proximal point algorithm for generic quasi-Newton acceleration
- ARock: an algorithmic framework for asynchronous parallel coordinate updates
- Catalyst acceleration for first-order convex optimization: from theory to practice
- Convex analysis and monotone operator theory in Hilbert spaces
- Convex optimization: algorithms and complexity
- De-noising by soft-thresholding
- Descentwise inexact proximal algorithms for smooth optimization
- Distributed coordinate descent method for learning with big data
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 2155014 (Why is no real title available?)
- scientific article; zbMATH DE number 3237318 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Identifiable Surfaces in Constrained Optimization
- Improved asynchronous parallel optimization analysis for stochastic incremental methods
- Low complexity regularization of linear inverse problems
- Manifold identification in dual averaging for regularized stochastic online learning
- Monotone Operators and the Proximal Point Algorithm
- New Proximal Point Algorithms for Convex Minimization
- Nonsmoothness in machine learning: specific structure, proximal identification, and applications
- On optimal probabilities in stochastic coordinate descent methods
- Optimization with sparsity-inducing penalties
- Randomized progressive hedging methods for multi-stage stochastic programming
- Sparse online learning via truncated gradient
This page was built for publication: Distributed Learning with Sparse Communications by Identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4959464)
