Benchmarking Classical and Quantum Models for DeFi Yield Prediction on Curve Finance

• URL: http://arxiv.org/abs/2508.02685v1
• Date: Tue, 22 Jul 2025 06:55:20 GMT
• Title: Benchmarking Classical and Quantum Models for DeFi Yield Prediction on Curve Finance
• Authors: Chi-Sheng Chen, Aidan Hung-Wen Tsai,
• Abstract summary: We benchmark six models, XGBoost, Random Forest, LSTM, Transformer, quantum neural networks (QNN), and quantum support vector machines with quantum feature maps (QSVM-QNN)<n>We evaluate model performance on test MAE, RMSE, and directional accuracy.<n>XGBoost achieves the highest directional accuracy (71.57%) with a test MAE of 1.80, while Random Forest attains the lowest test MAE of 1.77 and 71.36% accuracy.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The rise of decentralized finance (DeFi) has created a growing demand for accurate yield and performance forecasting to guide liquidity allocation strategies. In this study, we benchmark six models, XGBoost, Random Forest, LSTM, Transformer, quantum neural networks (QNN), and quantum support vector machines with quantum feature maps (QSVM-QNN), on one year of historical data from 28 Curve Finance pools. We evaluate model performance on test MAE, RMSE, and directional accuracy. Our results show that classical ensemble models, particularly XGBoost and Random Forest, consistently outperform both deep learning and quantum models. XGBoost achieves the highest directional accuracy (71.57%) with a test MAE of 1.80, while Random Forest attains the lowest test MAE of 1.77 and 71.36% accuracy. In contrast, quantum models underperform with directional accuracy below 50% and higher errors, highlighting current limitations in applying quantum machine learning to real-world DeFi time series data. This work offers a reproducible benchmark and practical insights into model suitability for DeFi applications, emphasizing the robustness of classical methods over emerging quantum approaches in this domain.

Related papers

• Quantum Temporal Convolutional Neural Networks for Cross-Sectional Equity Return Prediction: A Comparative Benchmark Study [8.777151099203934]
  Quantum Temporal Convolutional Neural Network (QTCNN) combines a classical temporal encoder with parameter-efficient quantum convolution circuits for cross-sectional equity return prediction.<n> QTCNN achieves a Sharpe ratio of 0.538, outperforming the best classical baseline by approximately 72%.<n>These results highlight the practical potential of quantum-enhanced forecasting model, QTCNN, for robust decision-making in quantitative finance.
  arXiv  Detail & Related papers  (2025-12-07T02:34:24Z)
• A Novel XAI-Enhanced Quantum Adversarial Networks for Velocity Dispersion Modeling in MaNGA Galaxies [14.016108312641101]
  We propose a novel quantum adversarial framework that integrates a hybrid quantum neural network (QNN) with classical deep learning layers.<n>In the proposed model, an adversarial evaluator concurrently guides the QNN by computing feedback loss, thereby optimizing both prediction accuracy and model explainability.<n> Empirical evaluations show that the Vanilla model achieves RMSE = 0.27, MSE = 0.071, MAE = 0.21, and R2 = 0.59, delivering the most consistent performance across regression metrics compared to adversarial counterparts.
  arXiv  Detail & Related papers  (2025-10-28T16:27:10Z)
• Hybrid Quantum-Classical Neural Networks for Few-Shot Credit Risk Assessment [52.05742536403784]
  This work tackles the challenge of few-shot credit risk assessment.<n>We design and implement a novel hybrid quantum-classical workflow.<n>A Quantum Neural Network (QNN) was trained via the parameter-shift rule.<n>On a real-world credit dataset of 279 samples, our QNN achieved a robust average AUC of 0.852 +/- 0.027 in simulations and yielded an impressive AUC of 0.88 in the hardware experiment.
  arXiv  Detail & Related papers  (2025-09-17T08:36:05Z)
• Prediction of Stocks Index Price using Quantum GANs [0.5900825203015314]
  We implement a QGAN model tailored for stock price prediction and evaluate its performance using historical stock market data.<n>Our results demonstrate that QGANs can generate synthetic data closely resembling actual market behavior, leading to enhanced prediction accuracy.<n>This research represents a key step toward integrating quantum computing in financial forecasting, offering potential advantages in speed and precision over traditional methods.
  arXiv  Detail & Related papers  (2025-09-14T20:28:24Z)
• FD4QC: Application of Classical and Quantum-Hybrid Machine Learning for Financial Fraud Detection A Technical Report [36.1999598554273]
  This report investigates and compares the efficacy of classical, quantum, and quantum-hybrid machine learning models for the binary behavioural classification of fraudulent financial activities.<n>We implement and evaluate a range of models on the IBM Anti-Money Laundering (AML) dataset.<n>We propose Fraud Detection for Quantum Computing (FD4QC), a practical, API-driven system architecture designed for real-world deployment.
  arXiv  Detail & Related papers  (2025-07-25T16:08:22Z)
• Contextual Quantum Neural Networks for Stock Price Prediction [0.0]
  We apply quantum machine learning (QML) to predict the stock prices of multiple assets using a contextual quantum neural network.<n>This architecture represents the first of its kind in quantum finance, offering superior predictive power and computational efficiency.<n>Our findings highlight the transformative potential of QML in financial applications, paving the way for more advanced, resource-efficient quantum algorithms.
  arXiv  Detail & Related papers  (2025-02-26T22:39:23Z)
• Benchmarking Quantum Models for Time-series Forecasting [0.3806074545662052]
  We compare classical and quantum models for time series forecasting.<n>Most of the quantum models were able to achieve comparable results.<n>Results serve as a useful point of comparison for the field of forecasting with quantum machine learning.
  arXiv  Detail & Related papers  (2024-12-18T14:17:17Z)
• GARCH-Informed Neural Networks for Volatility Prediction in Financial Markets [0.0]
  We present a new, hybrid Deep Learning model that captures and forecasting market volatility more accurately than either class of models are capable of on their own. When compared to other time series models, GINN showed superior out-of-sample prediction performance in terms of the Coefficient of Determination ($R2$), Mean Squared Error (MSE), and Mean Absolute Error (MAE)
  arXiv  Detail & Related papers  (2024-09-30T23:53:54Z)
• A Framework for Demonstrating Practical Quantum Advantage: Racing Quantum against Classical Generative Models [62.997667081978825]
  We build over a proposed framework for evaluating the generalization performance of generative models. We establish the first comparative race towards practical quantum advantage (PQA) between classical and quantum generative models. Our results suggest that QCBMs are more efficient in the data-limited regime than the other state-of-the-art classical generative models.
  arXiv  Detail & Related papers  (2023-03-27T22:48:28Z)
• Generalization Metrics for Practical Quantum Advantage in Generative Models [68.8204255655161]
  Generative modeling is a widely accepted natural use case for quantum computers. We construct a simple and unambiguous approach to probe practical quantum advantage for generative modeling by measuring the algorithm's generalization performance. Our simulation results show that our quantum-inspired models have up to a $68 times$ enhancement in generating unseen unique and valid samples.
  arXiv  Detail & Related papers  (2022-01-21T16:35:35Z)
• MEMO: Test Time Robustness via Adaptation and Augmentation [131.28104376280197]
  We study the problem of test time robustification, i.e., using the test input to improve model robustness. Recent prior works have proposed methods for test time adaptation, however, they each introduce additional assumptions. We propose a simple approach that can be used in any test setting where the model is probabilistic and adaptable.
  arXiv  Detail & Related papers  (2021-10-18T17:55:11Z)
• Learnability of the output distributions of local quantum circuits [53.17490581210575]
  We investigate, within two different oracle models, the learnability of quantum circuit Born machines. We first show a negative result, that the output distributions of super-logarithmic depth Clifford circuits are not sample-efficiently learnable. We show that in a more powerful oracle model, namely when directly given access to samples, the output distributions of local Clifford circuits are computationally efficiently PAC learnable.
  arXiv  Detail & Related papers  (2021-10-11T18:00:20Z)
• ANNETTE: Accurate Neural Network Execution Time Estimation with Stacked Models [56.21470608621633]
  We propose a time estimation framework to decouple the architectural search from the target hardware. The proposed methodology extracts a set of models from micro- kernel and multi-layer benchmarks and generates a stacked model for mapping and network execution time estimation. We compare estimation accuracy and fidelity of the generated mixed models, statistical models with the roofline model, and a refined roofline model for evaluation.
  arXiv  Detail & Related papers  (2021-05-07T11:39:05Z)
• Evaluating the Performance of Some Local Optimizers for Variational Quantum Classifiers [0.0]
  We studied the performance and role of locals in quantum variational circuits. Results show that machine learning on noisy immediate scale quantum machines can produce comparable results as on classical machines.
  arXiv  Detail & Related papers  (2021-02-17T16:31:42Z)
• Exploring the Uncertainty Properties of Neural Networks' Implicit Priors in the Infinite-Width Limit [47.324627920761685]
  We use recent theoretical advances that characterize the function-space prior to an ensemble of infinitely-wide NNs as a Gaussian process. This gives us a better understanding of the implicit prior NNs place on function space. We also examine the calibration of previous approaches to classification with the NNGP.
  arXiv  Detail & Related papers  (2020-10-14T18:41:54Z)
• APQ: Joint Search for Network Architecture, Pruning and Quantization Policy [49.3037538647714]
  We present APQ for efficient deep learning inference on resource-constrained hardware. Unlike previous methods that separately search the neural architecture, pruning policy, and quantization policy, we optimize them in a joint manner. With the same accuracy, APQ reduces the latency/energy by 2x/1.3x over MobileNetV2+HAQ.
  arXiv  Detail & Related papers  (2020-06-15T16:09:17Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.