paper-with-me

Papers

A Fast Algorithm for Computing High-dimensional Risk Parity Portfolios

2013-11-16 · Théophile Griveau-Billion, Jean-Charles Richard, Thierry Roncalli

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.

📄 PDF Abstract BibTeX arXiv:1311.4057

Code (4)

jcrichard/pyrb 공식 구현
cran/riskParityPortfolio
dppalomar/riskParityPortfolio
dppalomar/riskparity.py jax

Tasks

Vocal Bursts Intensity Prediction

Similar Papers 제목 키워드 기반

Pricing and Risk Management with High-Dimensional Quasi Monte Carlo and Global Sensitivity Analysis

2015-04-11

We review and apply Quasi Monte Carlo (QMC) and Global Sensitivity Analysis (GSA) techniques to pricing and risk management (greeks) of representative financial instruments of increasing complexity. We compare QMC vs sta…

ManagementSensitivity

Subspace Embeddings for the Polynomial Kernel

2014-12-01 · NeurIPS 2014 12 · Haim Avron, Huy Nguyen, David Woodruff

Sketching is a powerful dimensionality reduction tool for accelerating statistical learning algorithms. However, its applicability has been limited to a certain extent since the crucial ingredient, the so-called obliviou…

Dimensionality Reduction

Power Weighted Shortest Paths for Clustering Euclidean Data

2019-05-30 · Daniel Mckenzie, Steven Damelin

We study the use of power weighted shortest path distance functions for clustering high dimensional Euclidean data, under the assumption that the data is drawn from a collection of disjoint low dimensional manifolds. We …

Clustering

HyperGraphX: Graph Transductive Learning with Hyperdimensional Computing and Message Passing

2025-10-28 · Guojing Cong, Tom Potok, Hamed Poursiami, Maryam Parsa arxiv

We present a novel algorithm, \hdgc, that marries graph convolution with binding and bundling operations in hyperdimensional computing for transductive graph learning. For prediction accuracy \hdgc outperforms major and …

Graph Neural NetworkGraph Learning

A fast PC algorithm for high dimensional causal discovery with multi-core PCs

2015-02-09 · Thuc Duy Le, Tao Hoang, Jiuyong Li, Lin Liu 외

Discovering causal relationships from observational data is a crucial problem and it has applications in many research areas. The PC algorithm is the state-of-the-art constraint based method for causal discovery. However…

Causal DiscoveryCausal InferenceCPU