no code implementations • 11 Mar 2021 • Andreas Löhne, Fangyuan Zhao, Lizhen Shao
An MOCP can be solved approximately by Benson type algorithms, which compute outer and inner polyhedral approximations of the problem's upper image.
Multiobjective Optimization Optimization and Control
no code implementations • 9 Oct 2020 • Fangyuan Zhao, Xuebin Ren, Shusen Yang, Qing Han, Peng Zhao, Xinyu Yang
To address the privacy issue in LDA, we systematically investigate the privacy protection of the main-stream LDA training algorithm based on Collapsed Gibbs Sampling (CGS) and propose several differentially private LDA algorithms for typical training scenarios.
no code implementations • 4 Jun 2019 • Fangyuan Zhao, Xuebin Ren, Shusen Yang, Xinyu Yang
Latent Dirichlet Allocation (LDA) is a popular topic modeling technique for discovery of hidden semantic architecture of text datasets, and plays a fundamental role in many machine learning applications.