Regularized distributionally robust optimization with application to the index tracking problem
Uloženo v:
| Název: | Regularized distributionally robust optimization with application to the index tracking problem |
|---|---|
| Autoři: | Zhao, L, Li, G, Penev, S |
| Zdroj: | Annals of Operations Research. 337:397-424 |
| Informace o vydavateli: | Springer Science and Business Media LLC, 2024. |
| Rok vydání: | 2024 |
| Témata: | anzsrc-for: 35 Commerce, 4901 Applied Mathematics, anzsrc-for: 01 Mathematical Sciences, anzsrc-for: 46 Information and Computing Sciences, Management, anzsrc-for: 49 Mathematical Sciences, 46 Information and Computing Sciences, 49 Mathematical Sciences, anzsrc-for: 4901 Applied Mathematics, Tourism and Services, anzsrc-for: 08 Information and Computing Sciences, anzsrc-for: 15 Commerce |
| Popis: | In recent years, distributionally robust optimization (DRO) has received a lot of interest due to its ability to reduce the worst-case risk when there is a perturbation to the data-generating distribution. A good statistical model is expected to perform well on both the normal and the perturbed data. On the other hand, variable selection and regularization is a research area that aims to identify the important features and remove the redundant ones. It helps to improve the prediction accuracy as well as the interpretability of the model. In this paper, we propose an optimization model that is a regularized version of the canonical distributionally robust optimization (DRO) problem where the ambiguity set is described by a general class of divergence measures that admit a suitable conic structure. The divergence measures we examined include several popular divergence measures used in the literature such as the Kullback–Leibler divergence, total variation, and the Chi-divergence. By exploiting the conic representability of the divergence measure, we show that the regularized DRO problem can be equivalently reformulated as a nonlinear conic programming problem. In the case where the regularization is convex and semi-definite programming representable, the reformulation can be further simplified as a tractable linear conic program and hence can be efficiently solved via existing software. More generally, if the regularization can be written as a difference of convex functions, we demonstrate that a solution for the regularized DRO problem can be found by solving a sequence of conic linear programming problems. Finally, we apply the proposed regularized DRO model to both simulated and real financial data and demonstrate its superior performance in comparison with some non-robust models. |
| Druh dokumentu: | Article |
| Popis souboru: | application/pdf |
| Jazyk: | English |
| ISSN: | 1572-9338 0254-5330 |
| DOI: | 10.1007/s10479-023-05726-3 |
| Rights: | Springer Nature TDM |
| Přístupové číslo: | edsair.doi.dedup.....e7aab948bdc5fb455512a100fc259251 |
| Databáze: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | In recent years, distributionally robust optimization (DRO) has received a lot of interest due to its ability to reduce the worst-case risk when there is a perturbation to the data-generating distribution. A good statistical model is expected to perform well on both the normal and the perturbed data. On the other hand, variable selection and regularization is a research area that aims to identify the important features and remove the redundant ones. It helps to improve the prediction accuracy as well as the interpretability of the model. In this paper, we propose an optimization model that is a regularized version of the canonical distributionally robust optimization (DRO) problem where the ambiguity set is described by a general class of divergence measures that admit a suitable conic structure. The divergence measures we examined include several popular divergence measures used in the literature such as the Kullback–Leibler divergence, total variation, and the Chi-divergence. By exploiting the conic representability of the divergence measure, we show that the regularized DRO problem can be equivalently reformulated as a nonlinear conic programming problem. In the case where the regularization is convex and semi-definite programming representable, the reformulation can be further simplified as a tractable linear conic program and hence can be efficiently solved via existing software. More generally, if the regularization can be written as a difference of convex functions, we demonstrate that a solution for the regularized DRO problem can be found by solving a sequence of conic linear programming problems. Finally, we apply the proposed regularized DRO model to both simulated and real financial data and demonstrate its superior performance in comparison with some non-robust models. |
|---|---|
| ISSN: | 15729338 02545330 |
| DOI: | 10.1007/s10479-023-05726-3 |