arXiv:1311.4057
공식 코드 · Papers with Code
A Fast Algorithm for Computing High-dimensional Risk Parity Portfolios
원문 초록
In this paper we propose a cyclical coordinate descent (CCD) algorithm for solving high dimensional risk parity problems. We show that this algorithm converges and is very fast even with large covariance matrices (n > 500). Comparison with existing algorithms also shows that it is one of the most efficient algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Scaling Laws of Dynamic High-Capacity Ride-Sharing
CUTS+: High-dimensional Causal Discovery from Irregular Time-series
CosmoPower-JAX: high-dimensional Bayesian inference with differentiable cosmological emulators
HumanRF: High-Fidelity Neural Radiance Fields for Humans in Motion
MIReAD: Simple Method for Learning High-quality Representations from Scientific Documents
High-Fidelity 3D Face Generation from Natural Language Descriptions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.