A Saddle Point Algorithm for Robust Data-Driven Factor Model Problems
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914462118707200 |
|---|---|
| author | Khodakaramzadeh, Shabnam Shafiee, Soroosh Gleizer, Gabriel de Albuquerque Esfahani, Peyman Mohajerin |
| author_facet | Khodakaramzadeh, Shabnam Shafiee, Soroosh Gleizer, Gabriel de Albuquerque Esfahani, Peyman Mohajerin |
| contents | We study the factor model problem, which aims to uncover low-dimensional structures in high-dimensional datasets. Adopting a robust data-driven approach, we formulate the problem as a saddle-point optimization. Our primary contribution is a first-order algorithm that solves this reformulation by leveraging a linear minimization oracle (LMO). We further develop semi-closed form solutions (up to a scalar) for three specific LMOs, corresponding to the Frobenius norm, Kullback-Leibler divergence, and Gelbrich (aka Wasserstein) distance. The analysis includes explicit quantification of these LMOs' regularity conditions, notably the Lipschitz constants of the dual function, which govern the algorithm's convergence performance. Numerical experiments confirm our method's effectiveness in high-dimensional settings, outperforming standard off-the-shelf optimization solvers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_09776 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Saddle Point Algorithm for Robust Data-Driven Factor Model Problems Khodakaramzadeh, Shabnam Shafiee, Soroosh Gleizer, Gabriel de Albuquerque Esfahani, Peyman Mohajerin Optimization and Control Systems and Control We study the factor model problem, which aims to uncover low-dimensional structures in high-dimensional datasets. Adopting a robust data-driven approach, we formulate the problem as a saddle-point optimization. Our primary contribution is a first-order algorithm that solves this reformulation by leveraging a linear minimization oracle (LMO). We further develop semi-closed form solutions (up to a scalar) for three specific LMOs, corresponding to the Frobenius norm, Kullback-Leibler divergence, and Gelbrich (aka Wasserstein) distance. The analysis includes explicit quantification of these LMOs' regularity conditions, notably the Lipschitz constants of the dual function, which govern the algorithm's convergence performance. Numerical experiments confirm our method's effectiveness in high-dimensional settings, outperforming standard off-the-shelf optimization solvers. |
| title | A Saddle Point Algorithm for Robust Data-Driven Factor Model Problems |
| topic | Optimization and Control Systems and Control |
| url | https://arxiv.org/abs/2506.09776 |