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%).
Robust utility optimization enables an investor to deal with market uncertainty in a structured way, with the goal of maximizing the worst-case outcome. In this work, we propose a generative adversarial network (GAN) approach to (approximately) solve robust utility optimization problems in general…
Holy GrailMath 8.0Rigor 7.5Code
Costs: ModeledOut-of-sample: HoldoutResolution: Synthetic Data
We propose MoE-F - a formalized mechanism for combining N pre-trained Large Language Models (LLMs) for online time-series prediction by adaptively forecasting the best weighting of LLM predictions at every time step. Our mechanism leverages the conditional information in each expert’s running…
Holy GrailMath 8.5Rigor 7.0
Costs: Not applicableOut-of-sample: HoldoutResolution: Daily Data
More details
Authors
Raeid Saqur, Anastasis Kratsios, Florian Krach, Yannick Limmer, Jacob-Junqi Tian, John Willes, Blanka Horvath, Frank Rudzicz
We propose an optimal iterative scheme for federated transfer learning, where a central planner has access to datasets " D"1,," D"N for the same learning model f_θ. Our objective is to minimize the cumulative deviation of the generated parameters “θ_i(t)"“t=0”^T across all T iterations from the…
Holy GrailMath 8.5Rigor 6.0
Costs: Not applicableOut-of-sample: NoneResolution: Synthetic Data