Papers
Topics
Authors
Recent
Search
2000 character limit reached

GLASD: A Loss-Function-Agnostic Global Optimizer for Robust Correlation Estimation under Data Contamination and Heavy Tails

Published 2 Jun 2025 in stat.AP, math.OC, and stat.CO | (2506.14801v1)

Abstract: Robust correlation estimation is essential in high-dimensional settings, particularly when data are contaminated by outliers or exhibit heavy-tailed behavior. Many robust loss functions of practical interest-such as those involving truncation or redescending M-estimators-lead to objective functions that are inherently non-convex and non-differentiable. Traditional methods typically focus on a single loss function tailored to a specific contamination model and develop custom algorithms tightly coupled with that loss, limiting generality and adaptability. We introduce GLASD (Global Adaptive Stochastic Descent), a general-purpose black-box optimization algorithm designed to operate over the manifold of positive definite correlation matrices. Unlike conventional solvers, GLASD requires no gradient information and imposes no assumptions of convexity or smoothness, making it ideally suited for optimizing a wide class of loss functions-including non-convex, non-differentiable, or discontinuous objectives. This flexibility allows GLASD to serve as a unified framework for robust estimation under arbitrary user-defined criteria. We demonstrate its effectiveness through extensive simulations involving contaminated and heavy-tailed distributions, as well as a real-data application to breast cancer proteomic network inference, where GLASD successfully identifies biologically plausible interactions despite the presence of outliers. The proposed method is scalable, constraint-aware, and available as open-source software at GitHub.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.