Corpus ID: 15711052

From safe screening rules to working sets for faster Lasso-type solvers

@article{Massias2017FromSS,
  title={From safe screening rules to working sets for faster Lasso-type solvers},
  author={Mathurin Massias and Alexandre Gramfort and Joseph Salmon},
  journal={ArXiv},
  year={2017},
  volume={abs/1703.07285}
}
  • Mathurin Massias, Alexandre Gramfort, Joseph Salmon
  • Published in ArXiv 2017
  • Mathematics, Computer Science
  • Convex sparsity-promoting regularizations are ubiquitous in modern statistical learning. By construction, they yield solutions with few non-zero coefficients, which correspond to saturated constraints in the dual optimization formulation. Working set (WS) strategies are generic optimization techniques that consist in solving simpler problems that only consider a subset of constraints, whose indices form the WS. Working set methods therefore involve two nested iterations: the outer loop… CONTINUE READING

    Create an AI-powered research feed to stay up to date with new papers like this posted to ArXiv

    9
    Twitter Mentions

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 14 CITATIONS

    Stable Safe Screening and Structured Dictionaries for Faster $\ell _{1}$ Regularization

    VIEW 1 EXCERPT
    CITES METHODS

    References

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

    A Primer on Coordinate Descent Algorithms

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    On the Convergence of Block Coordinate Descent Type Methods

    VIEW 1 EXCERPT
    HIGHLY INFLUENTIAL