Papers, ranked by score

Ordered by a blend of empirical rigor (60%) and math complexity (40%).

Successive one-sided Hodrick-Prescott filter with incremental filtering algorithm for nonlinear economic time series

Liu et al.

We propose a successive one-sided Hodrick-Prescott (SOHP) filter from multiple time scale decomposition perspective to derive trend estimate for a time series. The idea is to apply the one-sided HP (OHP) filter recursively on the updated cyclical component to extract the trend residual on multiple…

Holy Grail Math 8.0 Rigor 6.0 capped
Costs: Not applicableOut-of-sample: NoneResolution: Weekly-Monthly Data
More details
Authors
Yuxia Liu, Qi Zhang, Wei Xiao, Tianguang Chu
Evaluation
Forecast accuracy

Ploutos: Towards interpretable stock movement prediction with financial large language model

Tong et al.

Recent advancements in large language models (LLMs) have opened new pathways for many domains. However, the full potential of LLMs in financial investments remains largely untapped. There are two main challenges for typical deep learning-based methods for quantitative finance. First, they struggle…

Street Traders Math 2.0 Rigor 8.5
Costs: Not applicableOut-of-sample: HoldoutResolution: Daily Data
More details
Authors
Hanshuang Tong, Jun Li, Ning Wu, Ming Gong, Dongmei Zhang, Qi Zhang
Evaluation
Forecast accuracy

Competitive optimal portfolio selection under mean-variance criterion

Shao et al.

We investigate a portfolio selection problem involving multi competitive agents, each exhibiting mean-variance preferences. Unlike classical models, each agent’s utility is determined by their relative wealth compared to the average wealth of all agents, introducing a competitive dynamic into the…

Lab Rats Math 9.0 Rigor 1.0
More details
Authors
Guojiang Shao, Zuo Quan Xu, Qi Zhang

Browse

All authors · Research topics · Papers with code · Download the scored dataset

📬 The Quant Space Weekly

One email a week: the most interesting quant finance papers, scored and summarized. No spam, unsubscribe anytime.