Minxuan Hu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Minxuan Hu has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Jiayu Yi
School of Social Sciences, Nanyang Technological University, Singapore, Singapore
5 shared publications - Wenxi Sun
Johns Hopkins University
5 shared publications - Ziheng Chen
Department of Mathematics, University of Texas at Austin, Austin, TX, USA
5 shared publications - Qishi Zhan
Department of Mathematical and Statistical Science Marquette University Milwaukee Wisconsin USA
1 shared publication
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
- 5 September 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
A deployment-oriented framework for evaluating streaming integrity alerting under workload constraints
- 5 September 2026
- Published by Elsevier in Expert Systems with Applications
- Vol. 333
A deployment-oriented framework for evaluating streaming integrity alerting under workload constraints
- 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
- 21 March 2026
- Published by Elsevier in SSRN Electronic Journal
A Deployment-Oriented Framework for Evaluating Streaming Integrity Alerting Under Workload Constraints
Streaming monitoring systems are deployed as alerting systems, not as score generators alone. In these settings, evaluation must answer not only whether incidents receive high scores, but whether the realized alert stream changes under corruption, responds in time to matter, and remains workload-safe under nonstationarity. We present a reproducible, deployment-oriented framework for evaluating streaming alerting systems that treats the realized score-to-warning-to-episode pipeline as the evaluated object. The framework combines paired clean/corrupted replay for counterfactual alert impact, matched-burden event timeliness, explicit feasible-versus-infeasible operating regions under episode-budget and time-in-warning (TIW) constraints, and regime-sliced compliance audits. For adaptive policies, the framework preserves counterfactual parity by learning the clean-replay threshold schedule once and replaying it unchanged on corrupted streams at identical timestamps. Across a primary financial-services monitoring panel and two telemetry replications, feasibility emerges as a first-class result: operating points that appear attractive under score-centric or unconstrained views can become non-deployable once workload constraints are enforced. In the primary Consumer Financial Protection Bureau (CFPB) setting, median budget-only matched-burden coverage is 0.844, but median joint coverage after enforcing TIW falls to 0.025, showing that TIW is the binding safety constraint. Online recalibration preserves the narrow surviving feasible region that static calibration removes. Results on NASA SMAP A-1 and D-15 further show that although the best detector family varies by panel, framework-level conclusions transport across domains.
- 21 March 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessA Deployment-Oriented Framework for Evaluating Streaming Integrity Alerting Under Workload Constraints
Streaming monitoring systems are deployed as alerting systems, not as score generators alone. In these settings, evaluation must answer not only whether incidents receive high scores, but whether the realized alert stream changes under corruption, responds in time to matter, and remains workload-safe under nonstationarity. We present a reproducible, deployment-oriented framework for evaluating streaming alerting systems that treats the realized score-to-warning-to-episode pipeline as the evaluated object. The framework combines paired clean/corrupted replay for counterfactual alert impact, matched-burden event timeliness, explicit feasible-versus-infeasible operating regions under episode-budget and time-in-warning (TIW) constraints, and regime-sliced compliance audits. For adaptive policies, the framework preserves counterfactual parity by learning the clean-replay threshold schedule once and replaying it unchanged on corrupted streams at identical timestamps. Across a primary financial-services monitoring panel and two telemetry replications, feasibility emerges as a first-class result: operating points that appear attractive under score-centric or unconstrained views can become non-deployable once workload constraints are enforced. In the primary Consumer Financial Protection Bureau (CFPB) setting, median budget-only matched-burden coverage is 0.844, but median joint coverage after enforcing TIW falls to 0.025, showing that TIW is the binding safety constraint. Online recalibration preserves the narrow surviving feasible region that static calibration removes. Results on NASA SMAP A-1 and D-15 further show that although the best detector family varies by panel, framework-level conclusions transport across domains.
- 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
- 25 February 2026
- Published by Elsevier in SSRN Electronic Journal
ChebGate: Input-Conditioned Polynomial Convolution with Program-Level Gate Interventions and Realization-Aware Benchmarking
Learned spatial 3×3 convolutions dominate vision backbones, but their effective operators are implicit, and common proxies (parameter count, multiply-adds) can mispredict realized throughput and energy under modern compilation. We introduce ChebGate, a drop-in spatial block that makes the operator explicit by freezing a depthwise local operator and generating higher-order interactions through a gated Chebyshev recurrence; a lightweight controller outputs per-sample coefficients over polynomial orders, followed by learned 1×1 channel mixing. Instantiated as ChebResNet in a Wide-ResNet-style backbone, ChebGate exposes order allocation that enables mechanism analysis and gate-only interventions without changing weights. On CIFAR-10, clustering late-stage allocation into a compact program codebook enables substitutions that improve calibration with negligible accuracy loss (Top-1 97.02%→96.95%; expected calibration error (ECE) 0.1080→0.0094); matching logit norms largely removes the gain, indicating temperature-like logit-scale control. Separately, benchmarking four numerically equivalent realizations under strict FP32 checks shows throughput varies 0.47×–1.31× despite identical parameters and multiply-adds, with corresponding energy shifts under a fixed stack. ChebGate demonstrates that operator-explicit modules with program diagnostics and equivalence-checked benchmarking support both mechanistic interpretability and deployment accountability.
- 25 February 2026
- Published by Elsevier in SSRN Electronic Journal
Open AccessChebGate: Input-Conditioned Polynomial Convolution with Program-Level Gate Interventions and Realization-Aware Benchmarking
Learned spatial 3×3 convolutions dominate vision backbones, but their effective operators are implicit, and common proxies (parameter count, multiply-adds) can mispredict realized throughput and energy under modern compilation. We introduce ChebGate, a drop-in spatial block that makes the operator explicit by freezing a depthwise local operator and generating higher-order interactions through a gated Chebyshev recurrence; a lightweight controller outputs per-sample coefficients over polynomial orders, followed by learned 1×1 channel mixing. Instantiated as ChebResNet in a Wide-ResNet-style backbone, ChebGate exposes order allocation that enables mechanism analysis and gate-only interventions without changing weights. On CIFAR-10, clustering late-stage allocation into a compact program codebook enables substitutions that improve calibration with negligible accuracy loss (Top-1 97.02%→96.95%; expected calibration error (ECE) 0.1080→0.0094); matching logit norms largely removes the gain, indicating temperature-like logit-scale control. Separately, benchmarking four numerically equivalent realizations under strict FP32 checks shows throughput varies 0.47×–1.31× despite identical parameters and multiply-adds, with corresponding energy shifts under a fixed stack. ChebGate demonstrates that operator-explicit modules with program diagnostics and equivalence-checked benchmarking support both mechanistic interpretability and deployment accountability.