Pages that link to "Item:Q2810888"

The following pages link to Distributed coordinate descent method for learning with big data (Q2810888):

Displaying 33 items.

• Parallel coordinate descent methods for big data optimization (Q263212) (← links)
• On optimal probabilities in stochastic coordinate descent methods (Q315487) (← links)
• Matrix completion under interval uncertainty (Q1752160) (← links)
• An accelerated distributed gradient method with local memory (Q2097691) (← links)
• Parallel random block-coordinate forward-backward algorithm: a unified convergence analysis (Q2133415) (← links)
• Primal-dual block-proximal splitting for a class of non-convex problems (Q2218923) (← links)
• Distributed cooperative learning over time-varying random networks using a gossip-based communication protocol (Q2219358) (← links)
• Block-proximal methods with spatially adapted acceleration (Q2323015) (← links)
• On the convergence analysis of asynchronous SGD for solving consistent linear systems (Q2685380) (← links)
• Manifold optimization for hybrid beamforming in dual-function radar-communication system (Q2688007) (← links)
• Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent (Q2832112) (← links)
• Efficiency of the Accelerated Coordinate Descent Method on Structured Optimization Problems (Q2957979) (← links)
• A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments (Q3304857) (← links)
• Accelerated, Parallel, and Proximal Coordinate Descent (Q3449571) (← links)
• An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization (Q3451763) (← links)
• Distributed Block Coordinate Descent for Minimizing Partially Separable Functions (Q3462314) (← links)
• Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds (Q3465244) (← links)
• (Q4558169) (← links)
• (Q4558572) (← links)
• (Q4637005) (← links)
• On the complexity of parallel coordinate descent (Q4638927) (← links)
• Distributed Learning with Sparse Communications by Identification (Q4959464) (← links)
• (Q4969198) (← links)
• On Adaptive Sketch-and-Project for Solving Linear Systems (Q4997841) (← links)
• Distributed Sufficient Dimension Reduction for Heterogeneous Massive Data (Q5040486) (← links)
• Stochastic Reformulations of Linear Systems: Algorithms and Convergence Theory (Q5112239) (← links)
• (Q5148997) (← links)
• A generic coordinate descent solver for non-smooth convex optimisation (Q5865339) (← links)
• Stochastic distributed learning with gradient quantization and double-variance reduction (Q5882226) (← links)
• Distributed statistical optimization for non-randomly stored big data with application to penalized learning (Q6172933) (← links)
• Nonexpansive Markov operators and random function iterations for stochastic fixed point problems (Q6178237) (← links)
• More communication-efficient distributed sparse learning (Q6546022) (← links)
• Distributed multi-agent optimisation via coordination with second-order nearest neighbours (Q6608904) (← links)