Corpus ID: 775236

Avoiding Communication in Proximal Methods for Convex Optimization Problems

@article{Soori2017AvoidingCI,
  title={Avoiding Communication in Proximal Methods for Convex Optimization Problems},
  author={Saeed Soori and Aditya Devarakonda and James Demmel and Mert G{\"u}rb{\"u}zbalaban and Maryam Mehri Dehnavi},
  journal={ArXiv},
  year={2017},
  volume={abs/1710.08883}
}
  • Saeed Soori, Aditya Devarakonda, +2 authors Maryam Mehri Dehnavi
  • Published 2017
  • Computer Science, Mathematics
  • ArXiv
  • The fast iterative soft thresholding algorithm (FISTA) is used to solve convex regularized optimization problems in machine learning. Distributed implementations of the algorithm have become popular since they enable the analysis of large datasets. However, existing formulations of FISTA communicate data at every iteration which reduces its performance on modern distributed architectures. The communication costs of FISTA, including bandwidth and latency costs, is closely tied to the… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-6 OF 6 CITATIONS

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 32 REFERENCES

    CoCoA: A General Framework for Communication-Efficient Distributed Optimization

    VIEW 2 EXCERPTS

    Templates for convex cone problems with applications to sparse signal recovery

    VIEW 3 EXCERPTS
    HIGHLY INFLUENTIAL

    CA-SVM: Communication-Avoiding Support Vector Machines on Distributed Systems

    VIEW 1 EXCERPT