Frequent co-authors: Henk Berkman (1), Paul D. Koch (1), Laura A. Tuttle (1), Yan Ding (1), Sotirios Sabanis (1), Sheng Xiang (1).
Scores are our LLM-assisted heuristics (methodology), not peer review or citation counts. Author pages are generated from paper metadata; name variants may split one person across pages.
arXiv author page →
Papers, ranked by score
Ordered by a blend of empirical rigor (60%) and math complexity (40%).
Conditional-Value-at-Risk (CVaR) optimization is a fundamental tool in portfolio selection, yet its nonsmooth loss structure poses a challenge for the existing theory of stochastic gradient methods including associated Langevin algorithms. In particular, the positive-part loss and the softmax…
Abstract We find a strong tendency for positive returns during the overnight period followed by reversals during the trading day. This behavior is driven by an opening price that is high relative to intraday prices. It is concentrated among stocks that have recently attracted the attention of…
Holy GrailMath 5.0Rigor 8.0
Costs: Unclear
More details
Authors
Henk Berkman, Paul D. Koch, Laura A. Tuttle, Ying Zhang
The price movement prediction of stock market has been a classical yet challenging problem, with the attention of both economists and computer scientists. In recent years, graph neural network has significantly improved the prediction performance by employing deep learning on company relations.…
Holy GrailMath 7.5Rigor 6.0capped
Costs: Not modeledOut-of-sample: HoldoutResolution: Daily Data
In this paper we develop a Stochastic Gradient Langevin Dynamics (SGLD) algorithm tailored for solving a certain class of non-convex distributionally robust optimisation (DRO) problems. By deriving non-asymptotic convergence bounds, we build an algorithm which for any prescribed accuracy ε>0…
Holy GrailMath 8.5Rigor 5.0Code
Costs: Not applicableOut-of-sample: HoldoutResolution: Synthetic Data