GBM-based Bregman Proximal Algorithms for Constrained Learning

1 code implementation • 21 Aug 2023 • Zhenwei Lin, Qi Deng

In this paper, we adapt the GBM for constrained learning tasks within the framework of Bregman proximal algorithms.

Fairness

Efficient First-order Methods for Convex Optimization with Strongly Convex Function Constraints

no code implementations • 21 Dec 2022 • Zhenwei Lin, Qi Deng

Before our work, the best complexity bound was $\mathcal{O}(1/{\varepsilon})$, and it remains unclear how to improve this result by leveraging the strong convexity assumption.