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%).
This paper studies entropy regularization for the discrete-time dynamic mean–variance portfolio problem with no-shorting constraints. In the unconstrained setting, entropy regularization can be introduced without changing the basic quadratic structure of the dynamic program. Under no-shorting, this…
We develop a reinforcement-learning framework for the continuous-time optimal portfolio-consumption via utility maximization under no-shorting portfolio constraints. We adopt the exploratory formulation under entropy regularization and impose no-shorting constraint through a componentwise…
This paper studies a discrete-time mean-variance model based on reinforcement learning. Compared with its continuous-time counterpart in \cite{“zhou2020mv”}, the discrete-time model makes more general assumptions about the asset’s return distribution. Using entropy to measure the cost of…
Holy GrailMath 8.0Rigor 6.0capped
Costs: Not modeledOut-of-sample: Walk-forwardResolution: Weekly-Monthly Data