Cheng Li, Zhao-Rong Lai, Yizun Lin, Yangyu Zhang
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The ℓ 0 -constrained mean-CVaR model poses a significant challenge due to its NP-hard nature, typically tackled through combinatorial methods characterized by high computational demands. From a markedly different perspective, we propose an innovative autonomous sparse mean-CVaR portfolio model, capable of approximating the original ℓ 0 -constrained mean-CVaR model with arbitrary accuracy. The core idea is to convert the ℓ 0 constraint into an indicator function and subsequently handle it through a tailed approximation. We then propose a proximal alternating linearized minimization algorithm, coupled with a nested fixed-point proximity algorithm (both convergent), to iteratively solve the model. Autonomy in sparsity refers to retaining a significant portion of assets within the selected asset pool during adjustments in pool size. Consequently, our framework offers a theoretically guaranteed approximation of the ℓ 0 -constrained mean-CVaR model, improving computational efficiency while providing a robust asset selection scheme.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2405.08047")
get_code_for_paper("2405.08047")
have("2405.08047")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2405.08047.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2405.08047)
Connect an agent — have() is free.