Distributed Sparse Linear Regression
From MaRDI portal
Cited in
(48)- Event-triggered zero-gradient-sum distributed optimisation algorithm with time-varying communication delays
- A decentralized smoothing quadratic regularization algorithm for composite consensus optimization with non-Lipschitz singularities
- Online learning over a decentralized network through ADMM
- An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
- A framework for parallel and distributed training of neural networks
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- Two-timescale gradient descent ascent algorithms for nonconvex minimax optimization
- Supervised model predictive control of large‐scale electricity networks via clustering methods
- Learning Coefficient Heterogeneity over Networks: A Distributed Spanning-Tree-Based Fused-Lasso Regression
- Model aggregation for doubly divided data with large size and large dimension
- Distributed optimization for penalized regression in massive compositional data
- On the global and linear convergence of the generalized alternating direction method of multipliers
- Gradient-free algorithms for distributed online convex optimization
- Inertial proximal ADMM for separable multi-block convex optimizations and compressive affine phase retrieval
- Dynamic regret for decentralized online bandit gradient descent with local steps
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- A review of decentralized optimization focused on information flows of decomposition algorithms
- Robust and efficient sparse learning over networks: a decentralized surrogate composite quantile regression approach
- EXTRA: an exact first-order algorithm for decentralized consensus optimization
- Asymptotic properties of primal-dual algorithm for distributed stochastic optimization over random networks with imperfect communications
- A fast proximal gradient algorithm for decentralized composite optimization over directed networks
- Distributed multi-agent optimisation via coordination with second-order nearest neighbours
- Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs
- One-shot distributed shrinkage estimation in sparse linear regression models
- Variable selection and parameter estimation in distributed high-dimensional quantile regression with responses missing at random
- Distributed Robust Subspace Recovery
- Global convergence rate of proximal incremental aggregated gradient methods
- Distributed primal-dual optimisation method with uncoordinated time-varying step-sizes
- A first-order method for nonconvex-strongly-concave constrained minimax optimization
- Distributed semi-supervised support vector machines
- Distributed online bandit linear regressions with differential privacy
- Decentralized proximal splitting algorithms for composite constrained convex optimization
- A zero-gradient-sum algorithm for distributed cooperative learning using a feedforward neural network with random weights
- A distributed proximal gradient method with time-varying delays for solving additive convex optimizations
- Distributed support vector machine in master-slave mode
- A decentralized training algorithm for echo state networks in distributed big data applications
- A first-order augmented Lagrangian method for constrained minimax optimization
- Distributed parametric and nonparametric regression with on-line performance bounds computation
- Model selection with distributed SCAD penalty
- Distributed additive hazards regression analysis of multi-site current status data without using individual-level data
- Distributed adaptive Huber regression
- Optimal survey schemes for stochastic gradient descent with applications to \(M\)-estimation
- Distributed Sparse Total Least-Squares Over Networks
- Decentralized online strongly convex optimization with general compressors and random disturbances
- Gradient-free distributed online optimization in networks
- Derivative-free alternating projection algorithms for general nonconvex-concave minimax problems
- Distributed learning for random vector functional-link networks
- A unified single-loop alternating gradient projection algorithm for nonconvex-concave and convex-nonconcave minimax problems
This page was built for publication: Distributed Sparse Linear Regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4570580)
