IDEAS home Printed from https://ideas.repec.org/p/arx/papers/2511.15960.html
   My bibliography  Save this paper

Machine Learning vs. Randomness: Challenges in Predicting Binary Options Movements

Author

Listed:
  • Gabriel M. Arantes
  • Richard F. Pinto
  • Bruno L. Dalmazo
  • Eduardo N. Borges
  • Giancarlo Lucca
  • Viviane L. D. de Mattos
  • Fabian C. Cardoso
  • Rafael A. Berri

Abstract

Binary options trading is often marketed as a field where predictive models can generate consistent profits. However, the inherent randomness and stochastic nature of binary options make price movements highly unpredictable, posing significant challenges for any forecasting approach. This study demonstrates that machine learning algorithms struggle to outperform a simple baseline in predicting binary options movements. Using a dataset of EUR/USD currency pairs from 2021 to 2023, we tested multiple models, including Random Forest, Logistic Regression, Gradient Boosting, and k-Nearest Neighbors (kNN), both before and after hyperparameter optimization. Furthermore, several neural network architectures, including Multi-Layer Perceptrons (MLP) and a Long Short-Term Memory (LSTM) network, were evaluated under different training conditions. Despite these exhaustive efforts, none of the models surpassed the ZeroR baseline accuracy, highlighting the inherent randomness of binary options. These findings reinforce the notion that binary options lack predictable patterns, making them unsuitable for machine learning-based forecasting.

Suggested Citation

  • Gabriel M. Arantes & Richard F. Pinto & Bruno L. Dalmazo & Eduardo N. Borges & Giancarlo Lucca & Viviane L. D. de Mattos & Fabian C. Cardoso & Rafael A. Berri, 2025. "Machine Learning vs. Randomness: Challenges in Predicting Binary Options Movements," Papers 2511.15960, arXiv.org.
  • Handle: RePEc:arx:papers:2511.15960
    as

    Download full text from publisher

    File URL: http://arxiv.org/pdf/2511.15960
    File Function: Latest version
    Download Restriction: no
    ---><---

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:arx:papers:2511.15960. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: arXiv administrators (email available below). General contact details of provider: http://arxiv.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.