Wenxi Sun
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Wenxi Sun has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Ziheng Chen
Department of Mathematics, University of Texas at Austin, Austin, TX, USA
6 shared publications - Jiayu Yi
School of Social Sciences, Nanyang Technological University, Singapore, Singapore
5 shared publications - Minxuan Hu
Cornell Ann S. Bowers College of Computing and Information Science, Cornell University, Ithaca, NY, USA
5 shared publications - Qiannan Shen
Boston University
3 shared publications - Qinkai Mao
Baruch College
2 shared publications - Shuo Xu
Computer Science and Engineering Department, University of California San Diego, USA
2 shared publications
Latest Publications
- Open Access
- 8 November 2026
- Published by Atlantis Press SARL
- p. 305-313
Who Fire-Sells? Public Pensions as Conditional, Not Aggregate, Sellers in Drawdowns
- 8 November 2026
- Published by Atlantis Press SARL
- p. 305-313
Open AccessWho Fire-Sells? Public Pensions as Conditional, Not Aggregate, Sellers in Drawdowns
- 4 July 2026
- Published by Elsevier in Finance Research Letters
- Vol. 108
Reinforcement learning for option hedging: Static implied-volatility fit versus shortfall-aware performance
- 4 July 2026
- Published by Elsevier in Finance Research Letters
- Vol. 108
Reinforcement learning for option hedging: Static implied-volatility fit versus shortfall-aware performance
- Open Access
- 29 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 220-227
Deconfounding ESG-Driven Resilience: A Computational Pipeline for State-Dependent Crash Insurance
- 29 May 2026
- Published by Association for Computing Machinery (ACM)
- p. 220-227
Open AccessDeconfounding ESG-Driven Resilience: A Computational Pipeline for State-Dependent Crash Insurance
- Open Access
- 24 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1317-1324
Adaptive-QLBS and RLOP: Differentiable Reinforcement Learning for Dynamic Option Hedging
- 24 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1317-1324
Open AccessAdaptive-QLBS and RLOP: Differentiable Reinforcement Learning for Dynamic Option Hedging
- Open Access
- 17 March 2026
- Published by Elsevier in SSRN Electronic Journal
Autonomous AI Agents for Option Hedging: Enhancing Financial Stability through Shortfall Aware Reinforcement Learning
The deployment of autonomous AI agents in derivatives markets has widened a practical gap between static model calibration and realized hedging outcomes. We introduce two reinforcement learning frameworks, a novel Replication Learning of Option Pricing (RLOP) approach and an adaptive extension of Q-learner in Black-Scholes (QLBS), that prioritize shortfall probability and align learning objectives with downside sensitive hedging. Using listed SPY and XOP options, we evaluate models using realized path delta hedging outcome distributions, shortfall probability, and tail risk measures such as Expected Shortfall. Empirically, RLOP reduces shortfall frequency in most slices and shows the clearest tail-risk improvements in stress, while implied volatility fit often favors parametric models yet poorly predicts after-cost hedging performance. This friction-aware RL framework supports a practical approach to autonomous derivatives risk management as AI-augmented trading systems scale.
- 17 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessAutonomous AI Agents for Option Hedging: Enhancing Financial Stability through Shortfall Aware Reinforcement Learning
The deployment of autonomous AI agents in derivatives markets has widened a practical gap between static model calibration and realized hedging outcomes. We introduce two reinforcement learning frameworks, a novel Replication Learning of Option Pricing (RLOP) approach and an adaptive extension of Q-learner in Black-Scholes (QLBS), that prioritize shortfall probability and align learning objectives with downside sensitive hedging. Using listed SPY and XOP options, we evaluate models using realized path delta hedging outcome distributions, shortfall probability, and tail risk measures such as Expected Shortfall. Empirically, RLOP reduces shortfall frequency in most slices and shows the clearest tail-risk improvements in stress, while implied volatility fit often favors parametric models yet poorly predicts after-cost hedging performance. This friction-aware RL framework supports a practical approach to autonomous derivatives risk management as AI-augmented trading systems scale.
- Open Access
Reinforcement Learning for Option Hedging: Static Implied-Volatility Fit versus Shortfall-Aware Performance
We extend the Q-learner in Black-Scholes (QLBS) framework by incorporating risk aversion and trading costs, and propose a novel Replication Learning of Option Pricing (RLOP) approach. Both methods are fully compatible with standard reinforcement learning algorithms and operate under market frictions. Using SPY and XOP option data, we evaluate performance along static and dynamic dimensions. Adaptive-QLBS achieves higher static pricing accuracy in implied volatility space, while RLOP delivers superior dynamic hedging performance by reducing shortfall probability. These results highlight the importance of evaluating option pricing models beyond static fit, emphasizing realized hedging outcomes.
Open AccessReinforcement Learning for Option Hedging: Static Implied-Volatility Fit versus Shortfall-Aware Performance
We extend the Q-learner in Black-Scholes (QLBS) framework by incorporating risk aversion and trading costs, and propose a novel Replication Learning of Option Pricing (RLOP) approach. Both methods are fully compatible with standard reinforcement learning algorithms and operate under market frictions. Using SPY and XOP option data, we evaluate performance along static and dynamic dimensions. Adaptive-QLBS achieves higher static pricing accuracy in implied volatility space, while RLOP delivers superior dynamic hedging performance by reducing shortfall probability. These results highlight the importance of evaluating option pricing models beyond static fit, emphasizing realized hedging outcomes.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 152441-152457
Cost-Sensitive Top- K Review for Capacity-Constrained Fraud Screening
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 152441-152457
Open AccessCost-Sensitive Top- K Review for Capacity-Constrained Fraud Screening
- Open Access
- 9 December 2025
- Published by MDPI AG in Computation
- Vol. 13 (12) , 290
Objective over Architecture: Fraud Detection Under Extreme Imbalance in Bank Account Opening
Fraud in financial services—especially account opening fraud—poses major operational and reputational risks. Static rules struggle to adapt to evolving tactics, missing novel patterns and generating excessive false positives. Machine learning promises adaptive detection, but deployment faces severe class imbalance: in the NeurIPS 2022 BAF Base benchmark used here, fraud prevalence is 1.10%. Standard metrics (accuracy, f1_weighted) can look strong while doing little for the minority class. We compare Logistic Regression, SVM (RBF), Random Forest, LightGBM, and a GRU model on N = 1,000,000 accounts under a unified preprocessing pipeline. All models are trained to minimize their loss function, while configurations are selected on a stratified development set using validation-weighted F1-score f1_weighted. For the four classical models, class weighting in the loss (class_weight ) is treated as a hyperparameter and tuned. Similarly, the GRU is trained with a fixed class-weighted CrossEntropy loss that up-weights fraud cases. This ensures that both model families leverage weighted training objectives, while their final hyperparameters are consistently selected by the f1_weighted metric. Despite similar AUCs and aligned feature importance across families, the classical models converge to high-precision, low-recall solutions (1–6% fraud recall), whereas the GRU recovers 78% recall at 5% precision (AUC ). Under extreme imbalance, objective choice and operating point matter at least as much as architecture.- 9 December 2025
- Published by MDPI AG in Computation
- Vol. 13 (12) , 290
Open AccessObjective over Architecture: Fraud Detection Under Extreme Imbalance in Bank Account Opening
Fraud in financial services—especially account opening fraud—poses major operational and reputational risks. Static rules struggle to adapt to evolving tactics, missing novel patterns and generating excessive false positives. Machine learning promises adaptive detection, but deployment faces severe class imbalance: in the NeurIPS 2022 BAF Base benchmark used here, fraud prevalence is 1.10%. Standard metrics (accuracy, f1_weighted) can look strong while doing little for the minority class. We compare Logistic Regression, SVM (RBF), Random Forest, LightGBM, and a GRU model on N = 1,000,000 accounts under a unified preprocessing pipeline. All models are trained to minimize their loss function, while configurations are selected on a stratified development set using validation-weighted F1-score f1_weighted. For the four classical models, class weighting in the loss (class_weight ) is treated as a hyperparameter and tuned. Similarly, the GRU is trained with a fixed class-weighted CrossEntropy loss that up-weights fraud cases. This ensures that both model families leverage weighted training objectives, while their final hyperparameters are consistently selected by the f1_weighted metric. Despite similar AUCs and aligned feature importance across families, the classical models converge to high-precision, low-recall solutions (1–6% fraud recall), whereas the GRU recovers 78% recall at 5% precision (AUC ). Under extreme imbalance, objective choice and operating point matter at least as much as architecture. - Open Access
- 9 December 2025
- Published by Springer Nature in Research Square
Objective over Architecture: Fraud Detection Under Extreme Imbalance in Bank Account Opening
Fraud in financial services—especially account opening fraud—poses major operational and reputational risks. Static rules struggle to adapt to evolving tactics, missing novel patterns and generating excessive false positives. Machine learning promises adaptive detection, but deployment faces severe class imbalance: in the NeurIPS 2022 BAF Base benchmark used here, fraud prevalence is 1.10%. Standard metrics (accuracy, f1_weighted) can look strong while doing little for the minority class. We compare logistic regression, SVM (RBF), Random Forest, LightGBM, and a GRU model on N=1,000,000 accounts under a unified preprocessing pipeline. All models are trained to minimize their loss function, while configurations are selected on a stratified development set using validation 1_weighted. For the four classical models, class weighting in the loss (class_weight in {None, 'balanced'}) is treated as a hyperparameter and tuned. Similarly, the GRU is trained with a fixed class-weighted cross-entropy loss that up-weights fraud cases. This ensures that both model families leverage weighted training objectives, while their final hyperparameters are consistently selected by the f1_weighted metric. Despite similar AUCs and aligned feature importance across families, the classical models converge to high-precision, low-recall solutions (1-6% fraud recall), whereas the GRU recovers 78% recall at 5% precision (AUC = 0.8800). Under extreme imbalance, objective choice and operating point matter at least as much as architecture.
- 9 December 2025
- Published by Springer Nature in Research Square
Open AccessObjective over Architecture: Fraud Detection Under Extreme Imbalance in Bank Account Opening
Fraud in financial services—especially account opening fraud—poses major operational and reputational risks. Static rules struggle to adapt to evolving tactics, missing novel patterns and generating excessive false positives. Machine learning promises adaptive detection, but deployment faces severe class imbalance: in the NeurIPS 2022 BAF Base benchmark used here, fraud prevalence is 1.10%. Standard metrics (accuracy, f1_weighted) can look strong while doing little for the minority class. We compare logistic regression, SVM (RBF), Random Forest, LightGBM, and a GRU model on N=1,000,000 accounts under a unified preprocessing pipeline. All models are trained to minimize their loss function, while configurations are selected on a stratified development set using validation 1_weighted. For the four classical models, class weighting in the loss (class_weight in {None, 'balanced'}) is treated as a hyperparameter and tuned. Similarly, the GRU is trained with a fixed class-weighted cross-entropy loss that up-weights fraud cases. This ensures that both model families leverage weighted training objectives, while their final hyperparameters are consistently selected by the f1_weighted metric. Despite similar AUCs and aligned feature importance across families, the classical models converge to high-precision, low-recall solutions (1-6% fraud recall), whereas the GRU recovers 78% recall at 5% precision (AUC = 0.8800). Under extreme imbalance, objective choice and operating point matter at least as much as architecture.
- Open Access
- 19 November 2025
- Published by Springer Nature in Research Square
High-Recall Deep Learning: A Gated Recurrent Unit Approach to Bank Account Fraud Detection on Imbalanced Data
Fraud detection in financial services is challenged by severe class imbalance, where fraudulent events are rare. This study provides a rigorous comparison of classical machine learning models—Logistic Regression, SVM, Random Forest, and LightGBM—and a Gated Recurrent Unit (GRU) deep learning model on a large-scale, imbalanced bank account fraud dataset. Our findings reveal a dramatic performance divide. All classical models, including the widely-used tree-based ensembles, proved ineffective at the primary detection task, with fraud recall scores below 7%.In stark contrast, the GRU network successfully identified the vast majority of fraudulent cases, achieving over 78% recall on the minority fraud class, albeit at the cost of very low precision. The results demonstrate that the GRU offers a viable, high-recall solution where classical models fail. This highlights a critical strategic choice for financial institutions: adopt a high-recall/high-alert detection framework or use conventional models that allow most fraud to go undetected. The approach is broadly applicable across financial domains—including banking and insurance—where rare-event detection is critical.
- 19 November 2025
- Published by Springer Nature in Research Square
Open AccessHigh-Recall Deep Learning: A Gated Recurrent Unit Approach to Bank Account Fraud Detection on Imbalanced Data
Fraud detection in financial services is challenged by severe class imbalance, where fraudulent events are rare. This study provides a rigorous comparison of classical machine learning models—Logistic Regression, SVM, Random Forest, and LightGBM—and a Gated Recurrent Unit (GRU) deep learning model on a large-scale, imbalanced bank account fraud dataset. Our findings reveal a dramatic performance divide. All classical models, including the widely-used tree-based ensembles, proved ineffective at the primary detection task, with fraud recall scores below 7%.In stark contrast, the GRU network successfully identified the vast majority of fraudulent cases, achieving over 78% recall on the minority fraud class, albeit at the cost of very low precision. The results demonstrate that the GRU offers a viable, high-recall solution where classical models fail. This highlights a critical strategic choice for financial institutions: adopt a high-recall/high-alert detection framework or use conventional models that allow most fraud to go undetected. The approach is broadly applicable across financial domains—including banking and insurance—where rare-event detection is critical.