Convex Loss Function

Convex loss functions are fundamental in machine learning, enabling efficient optimization algorithms to find model parameters minimizing prediction error. Current research focuses on extending their application to distributed and federated learning settings, addressing challenges like data heterogeneity, adversarial attacks, and stragglers, often employing techniques like mirror descent and gradient coding. This work also explores tighter convex loss functions (e.g., Fitzpatrick losses) and their application in robust optimization frameworks, including distributionally robust optimization and differentially private optimization, to improve model robustness and privacy. The resulting advancements enhance the efficiency, robustness, and privacy of machine learning models across various applications.

Papers