AI × QuantPPR-01
QuantEval: A Benchmark for LLMs in the Compute–Implement–Validate Loop of Quantitative Finance
QuantEval addresses the fragmented evaluation of large language models in professional quantitative workflows, which often stops at factual or document-grounded QA. It introduces an expert-validated benchmark with three dimensions: knowledge-based QA, quantitative mathematical reasoning, and quantitative strategy coding. The coding task is evaluated with a deterministic CTA-style backtesting framework that executes model-generated strategies and compares risk–return metrics a
#large language models#quantitative finance#benchmark
Quantitative ResearchPPR-02
Structural Modeling and Forecasting of Volatility in Binary Prediction Market Contracts
A structural volatility model for prediction markets is proposed, combining a Wright-Fisher deadline-resolution component and a Glosten-Mimrom order-flow component to capture binary uncertainty resolution and informed trading, validated on Kalshi contracts where it outperforms plain ARCH/GARCH benchmarks.
#prediction markets#volatility modeling#GARCH
Quantitative ResearchPPR-03
Data-Driven Dynamic Portfolio Selection with Vine Copula Simulation and Reinforcement Learning
Novelty lies in combining vine copula conditional simulation with reinforcement learning for CVaR-penalized dynamic portfolio selection, plus stability bounds from parameter error propagation. Utility lies in offering a theoretical error budget and reproducible empirical evidence for data-driven strategies.
#vine copula#reinforcement learning#dynamic portfolio selection
AI × QuantPPR-04
Unified Joint Optimization with Nyström Approximation for Scalable Adaptive SVM
This work couples kernel selection and SVM training as a continuous bi-level joint optimization problem, using Nyström low-rank approximation and block coordinate ascent to reduce training complexity from cubic to O(Nm) while aiming to preserve accuracy, addressing classical SVM bottlenecks in the big-data regime.
#Support Vector Machines#Joint Optimization#Nyström Approximation
AI 研究PPR-05
Log Parsing Removes Critical Clues for Distributed GPU Failures
This study introduces GF-Bench, a framework for generating diverse failures in distributed GPU workloads, and evaluates sequence-based models and LLMs on parsed versus raw logs. Its novelty lies in exposing that generic log parsing reduces cost but discards distributed execution context, undermining failure detection reliability; it is relevant for cost-sensitive analysis.
#distributed GPU#failure detection#log parsing
AI 研究PPR-06
Cover Tree Implementation Details Can Dramatically Change KNN Performance
A unified Rust implementation, RustKNN, systematically evaluates Cover Tree construction and query variants, revealing how query mode, base parameter, and micro-optimizations affect runtime rankings and offering guidance for reproducible benchmarking.
#KNN#Cover Tree#Implementation Details
AI × QuantPPR-07
Structured Conditional Neural Solvers Improve Stochastic-Volatility Pricing Accuracy
BeTINN, a structured conditional architecture, extends time-induced modulation with multi-directional time-parameter conditioning and a joint residual pathway, improving joint accuracy of option values and sensitivities on the Heston stochastic-volatility PDE.
#quantitative finance#stochastic volatility#physics-informed neural networks
AI 研究PPR-08
WER Framework: Training a Skill Optimizer from Execution Feedback to Improve Tool-Using Agents
Addressing the finding that agent-authored skills can be worse than using no skill, WER trains a standalone skill optimizer through a Write-Execute-Refine multi-phase reinforcement learning procedure outside a frozen executor, improving results on BFCL v4 multi-turn and tau2-bench and offering a reusable training paradigm for skill generation.
#skill optimization#reinforcement learning#execution feedback