🏢 KAUST

Differentially private ReLU regression algorithms, DP-GLMtron and DP-TAGLMtron, achieve comparable performance with only an additional factor of O(log N) in the utility upper bound compared to the con…

New algorithms achieve optimal weak regret in K-armed dueling bandits by leveraging the full problem structure, improving upon state-of-the-art methods.

MARINA-P and M3 algorithms drastically cut downlink and overall communication costs in nonconvex distributed optimization, scaling efficiently with the number of worker nodes.