~/talk

Parallel Coordinate Descent Methods for Big Data Optimization

links:none on file
slides:none on file

Presents a concrete parallel coordinate-descent framework built around an ESO (expected separable over-approximation) that produces algorithm parameters beta and W, shows beta scales with data sparsity (omega) and update batch size (tau), and gives a distributed implementation called Hydra. Proves iteration bounds ~beta·N/(tau·C), demonstrates nearly linear speedups on sparse problems (24 cores → ~20× faster), and solves a 3 TB LASSO instance with 512 MPI processes on 128 nodes in roughly 15–20 minutes.

AI-written summary · about

  1. 0:00Intro
  2. 1:482D Optimization
  3. 4:45Convergence of Randomized Coordinate Descent
  4. 5:49Parallelization Dream
  5. 7:18"Naive" parallelization
  6. 9:05Failure of naive parallelization
  7. 13:14Problem
  8. 13:45Regularizer: examples
  9. 14:12Loss: examples
  10. 15:243 models for f with small B
  11. 20:16Randomized Parallel Coordinate Descent Method
  12. 22:05ESO: Expected Separable Overapproximation
  13. 24:57Convergence rate: convex f
  14. 27:08Serial uniform sampling
  15. 33:41Theoretical speedup
  16. 36:24Practice
  17. 37:08Optimization with Big Data
  18. 37:30Coordinate Updates
  19. 38:46Wall Time
  20. 39:50Distributed T-nice sampling
  21. 42:26ESO: Distributed setting
  22. 43:53Bad partitioning at most doubles # of iterations
  23. 46:14LASSO with a 3TB data matrix
  24. 47:41Conclusions
  25. 48:19References: serial coordinate descent
  26. 48:45References: parallel coordinate descent
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.