Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,982 papers · 148 categories

Trend · papers per month

1.7%3.5%5.2%7.0% · Apr 202619922001200920172026
48 results for binary forecasting

The study examines the discrepancies between binary forecasts and real-world outcomes, revealing their often misleading nature.

problem The confusion between binary forecasts and real-world payoffs in decision-making and prediction.
method Comparative analysis of binary forecasts, bets, and real-world continuous payoffs under different tail conditions.
result Binary forecasting abilities do not translate to better real-world performance, and vice versa, especially under nonlinearities.

We present a simple approach to forecasting conditional probability distributions of asset returns. We work with a parsimonious specification of ordered binary choice regression that imposes a connection on sign predictability across different quantiles. The model forecasts the future conditional probability distributi…

2017-11-15abs ↗pdf ↗

Machine learning struggles to predict binary options movements due to randomness.

problem Predicting binary options movements using machine learning.
method Tested multiple machine learning models (RF, LR, GB, kNN) and neural networks (MLP, LSTM) on EUR/USD currency pairs.
result None of the models surpassed the ZeroR baseline accuracy, indicating randomness in binary options.

BinConv improves time series forecasting by preserving ordinal information in a classification framework.

problem Lack of ordinal information in existing classification-based time series forecasting methods.
method Cumulative Binary Encoding (CBE) and BinConv architecture.
result BinConv achieves superior performance in time series forecasting compared to existing methods.

Improved upper bound for online calibrated forecasting of binary sequences.

problem Online calibrated forecasting of binary sequences.
method Introducing a variant of Qiao & Valiant's sign preservation game called sign preservation with reuse (SPR) and proving its equivalence to calibrated forecasting.
result Improved upper bound of O(T2/3ε)O(T^{2/3 - \varepsilon}) for calibrated forecasting, improving the O(T2/3)O(T^{2/3}) bound of Foster & Vohra.

Develops a new volatility model for prediction markets.

problem Volatility forecasting in prediction markets differs from standard asset markets.
method Combines Wright-Fisher and Glosten-Milgrom mechanisms to model binary prediction markets.
result Structural model outperforms standard ARCH/GARCH models in volatility forecasting.

Critiques binary classification evaluation methods, advocating for proper scoring rules.

problem The dominance of top-K metrics and fixed-threshold evaluations in machine learning.
method Introduces a decision-theoretic framework mapping evaluation metrics to their use cases, and implements a clipped Brier score variant.
result Demonstrates the clinical utility of proper scoring rules through a Python package, exttt{briertools}.

Foresight Arena benchmarks AI forecasting on real-world markets, isolating predictive edge.

problem Evaluating AI forecasting ability in real-world markets is challenging due to overfitting, centralized trust, and conflated metrics.
method Permissionless, on-chain benchmark using probabilistic forecasts, commit-reveal protocol, and smart contracts.
result Demonstrates the need for 350 predictions to reliably distinguish agents of different skill levels.

New algorithms reduce label collection for online prediction with expert advice.

problem Efficiently predicting binary sequences with expert advice using fewer labels.
method Adaptive selective sampling for exponentially weighted forecasters.
result Label complexity scales roughly as the square root of the number of rounds for a scenario with a strictly better expert.

We study the multiclass online learning problem where a forecaster makes a sequence of predictions using the advice of nn experts. Our main contribution is to analyze the regime where the best expert makes at most bb mistakes and to show that when b=o(log4n)b = o(\log_4{n}), the expected number of mistakes made by the optima…

2018-07-30abs ↗pdf ↗

A new method uses deep learning to predict full conditional distributions.

problem Lack of uncertainty information in conditional distribution predictions.
method Transformed distribution estimation into multi-class classification, using deep neural networks and a joint binary cross-entropy loss function.
result Improved accuracy in probabilistic solar energy forecasting.

Study compares two methods for predicting extreme atmospheric events.

problem Forecasting threshold exceedances of atmospheric variables like temperature and wind speed.
method Direct vs. full distribution probabilistic methods for rare events.
result Full distribution approach outperforms direct method for extreme events.

We consider the estimation of binary election outcomes as martingales and propose an arbitrage pricing when one continuously updates estimates. We argue that the estimator needs to be priced as a binary option as the arbitrage valuation minimizes the conventionally used Brier score for tracking the accuracy of probabil…

2017-03-18abs ↗pdf ↗

The paper studies the distance from calibration in sequential prediction, proving upper and lower bounds.

problem The challenge is to measure and minimize the deviation from perfect calibration in sequential binary prediction.
method The approach involves proving an O(T)O(\sqrt{T}) upper bound and an Ω(T1/3)Ω(T^{1/3}) lower bound, using structural results and minimax arguments.
result An O(T)O(\sqrt{T}) upper bound on the calibration distance is achieved, with an Ω(T1/3)Ω(T^{1/3}) lower bound showing the inherent difficulty.

We provide yet another proof of the existence of calibrated forecasters; it has two merits. First, it is valid for an arbitrary finite number of outcomes. Second, it is short and simple and it follows from a direct application of Blackwell's approachability theorem to carefully chosen vector-valued payoff function and …

2009-12-18abs ↗pdf ↗

Cubic predicts stock market indices by fusing stock latent embeddings and converting to binary classification.

problem Challenges in predicting stock market indices due to isolated time series treatment and simple regression.
method Fusion of stock latent embeddings, binary encoding classification, and confidence-guided prediction.
result Cubic outperforms state-of-the-art baselines in stock index prediction tasks.

LSTM neural networks improve stock price prediction for Stockholm OMX30.

problem Forecasting stock price movement in financial markets.
method Ensemble of parallel long short-term memory (LSTM) neural networks trained on binary classification of stock returns.
result The LSTM ensemble outperforms traditional portfolios in terms of average daily returns, cumulative returns, and risk-adjusted performance.

We analyze the dynamics of a forecasting game which exhibits the phenomenon of information cascades. Each agent aims at correctly predicting a binary variable and he/she can either look for independent information or herd on the choice of others. We show that dynamics can be analitically described in terms of a Langevi…

2007-05-28abs ↗pdf ↗

A key problem in financial mathematics is the forecasting of financial crashes: if we perturb asset prices, will financial institutions fail on a massive scale? This was recently shown to be a computationally intractable (NP-hard) problem. Financial crashes are inherently difficult to predict, even for a regulator whic…

2018-10-16abs ↗pdf ↗

We address online linear optimization problems when the possible actions of the decision maker are represented by binary vectors. The regret of the decision maker is the difference between her realized loss and the best loss she would have achieved by picking, in hindsight, the best possible action. Our goal is to unde…

2012-04-20abs ↗pdf ↗

This paper uses MIL and MHCNN-RNN to predict precursors to aviation safety events.

problem Identifying events that precede aviation safety incidents.
method Multiple-instance learning (MIL) framework combined with a Multi-Head Convolutional Neural Network-Recurrent Neural Network (MHCNN-RNN) architecture.
result Multiple binary classifiers outperform in predicting high speed and high path angle events during the approach phase.

Epilepsy is the most common neurological disorder and an accurate forecast of seizures would help to overcome the patient's uncertainty and helplessness. In this contribution, we present and discuss a novel methodology for the classification of intracranial electroencephalography (iEEG) for seizure prediction. Contrary…

2018-11-02abs ↗pdf ↗

EDINET-Bench evaluates LLMs on complex financial tasks using Japanese financial statements.

problem Challenges in evaluating LLMs on financial tasks due to specialized expertise and scarce benchmarks.
method Developed EDINET-Bench, an open-source Japanese financial benchmark for LLMs on tasks like fraud detection and earnings forecasting.
result State-of-the-art LLMs perform only marginally better than logistic regression in financial tasks, highlighting the need for more realistic benchmarks.

Transformer pre-training improves stock return prediction accuracy.

problem Improving stock price prediction accuracy for better investment decisions.
method Pre-trained transformer models on TSX index, fine-tuned for individual stocks, compared to LSTM and XGBoost.
result Transformer model achieved lower mean squared error than benchmarks.

This paper concerns sequential computation of risk measures for financial data and asks how, given a risk measurement procedure, we can tell whether the answers it produces are `correct'. We draw the distinction between `external' and `internal' risk measures and concentrate on the latter, where we observe data in real…

2014-10-16abs ↗pdf ↗

We address the online linear optimization problem when the actions of the forecaster are represented by binary vectors. Our goal is to understand the magnitude of the minimax regret for the worst possible set of actions. We study the problem under three different assumptions for the feedback: full information, and the …

2011-05-24abs ↗pdf ↗

Simpler models outperform deep architectures with proper preprocessing and tuning.

problem Signal extraction from noisy cryptocurrency LOB data.
method Benchmarked a range of models including deep architectures and interpretable baselines.
result Simpler models can match and exceed deep architectures' performance with proper preprocessing and tuning.

New method detects TC imagery patterns for rapid intensity change.

problem Detecting upcoming rapid intensity changes in TC satellite imagery.
method Nonparametric test of association between images and event labels using neural networks and bootstrap.
result Identifies archetypes of infrared imagery associated with elevated rapid intensification risk.

Paper proposes a framework for probabilistic load forecasting by integrating point forecasts.

problem Short-term load forecasting for power systems energy management.
method Two-stage framework: first stage for point forecasting, second stage for probabilistic forecasting using feature integration.
result Numerical results show effectiveness of the proposed approach in hour-ahead load forecasting.