Weakly-convex–concave min–max optimization: provable algorithms and applications in machine learning

2021 
Min–max problems have broad applications in machine learning, including learning with non-decomposable loss and learning with robustness to data distribution. Convex–concave min–max problem is an a...
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    34
    References
    29
    Citations
    NaN
    KQI
    []