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.
The paper analyzes binary option markets with exogenous information and price sensitivity.
problem Analyzing binary option markets with exogenous information and price sensitivity.
method Derive and analyze a continuous model of binary option markets with exogenous information, using Filippov surfaces and general assumptions on purchasing rules.
result Price always converges when exogenous information is constant, and price sensitivity affects price lag vs. information.
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.
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.
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.
Selective classification improves trading strategies by abstaining from predictions.
problem Designing effective trading strategies using selective classification.
method Extends binary or multi-class classifiers to allow abstaining from predictions, evaluates across different feature sets and classifiers.
result Selective classifiers can improve trading performance by avoiding poor predictions.
Study shows how high-budget agents can manipulate prediction markets.
problem Manipulation of prediction markets by high-budget agents.
method Agent-based simulations and analytic characterization of price dynamics.
result High-budget agents can temporarily shift prediction market prices.
Develops a new framework for perpetual futures on binary prediction markets.
problem Lack of effective risk management in perpetual futures on binary prediction markets.
method PIRAP framework with six components: index estimator, margin sizing, leverage, funding rule, halt protocol, and eligibility framework.
result Mixed results from empirical evaluation, with some pre-registered floors passing and others failing.
Endogenous randomness emerges from adversarial market learning.
problem Market randomness
method Deterministic adversarial market model
result Out-of-sample profitability collapses to zero.
In this paper I empirically investigate prediction markets for binary options. Advocates of prediction markets have suggested that asset prices are consistent estimators of the "true" probability of a state of the world being realized. I test whether the market reaches a "consensus." I find little evidence for converge…
A new uplift modeling approach uses binary treatment indicators more efficiently.
problem Lack of full value utilization in binary uplift modeling.
method Design a novel transformed outcome for binary target variables.
result Our new approach outperforms traditional methods in synthetic and real-world datasets.
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.
What do binary (or probabilistic) forecasting abilities have to do with overall performance? We map the difference between (univariate) binary predictions, bets and "beliefs" (expressed as a specific "event" will happen/will not happen) and real-world continuous payoffs (numerical benefits or harm from an event) and sh…
PredictionMarketBench benchmarks trading agents on prediction markets.
problem Evaluating trading agents on prediction markets with realistic conditions.
method Deterministic replay of historical data, execution-realistic simulator, agent interface.
result Fee-aware algorithmic strategies outperform naive agents in volatile episodes.
Optimal market making improves liquidity in prediction markets.
problem Efficient price discovery in prediction markets.
method Stochastic control framework for optimal market making.
result Optimal market quotes improve downside protection and profit.
A method uses image processing and deep learning for financial market state prediction.
problem Low signal-to-noise ratio in financial time series data.
method Wavelet transform for denoising, convolutional neural network for pattern extraction.
result Competitive prediction accuracy of market states 'Up' and 'Down' on S&P 500 data.
PolySwarm uses a swarm of LLMs to predict and arbitrage prediction markets.
problem Real-time prediction market trading and latency arbitrage inefficiencies.
method PolySwarm employs a swarm of 50 diverse LLMs, Bayesian combination, and risk-controlled execution.
result Swarm aggregation outperforms single-model baselines in prediction tasks.
Prediction markets and crypto options show persistent pricing gaps.
problem Comparing prediction markets and crypto options for identical payoffs.
method Comparing Polymarket Yes prices with Binance call option prices.
result Mean pricing gap of 5.6 percentage points across 214 hourly observations.
Symmetric binary matrices representing relations among entities are commonly collected in many areas. Our focus is on dynamically evolving binary relational matrices, with interest being in inference on the relationship structure and prediction. We propose a nonparametric Bayesian dynamic model, which reduces dimension…
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.
We study the arbitrage opportunities in the presence of transaction costs in a sequence of binary markets approximating the fractional Black-Scholes model. This approximating sequence was constructed by Sottinen and named fractional binary markets. Since, in the frictionless case, these markets admit arbitrage, we aim …
Using frequency distributions of daily closing price time series of several financial market indexes, we investigate whether the bias away from an equiprobable sequence distribution found in the data, predicted by algorithmic information theory, may account for some of the deviation of financial markets from log-normal…
PolyBench benchmarks LLMs on real market data, revealing significant performance gaps.
problem Benchmarking LLMs for real-world event prediction from live market signals.
method Multimodal benchmark derived from Polymarket, evaluating 7 LLMs under identical market states.
result Only two models achieve positive financial returns, highlighting the gap between fluency and probabilistic reasoning.
In this paper, we prove a Donsker type approximation theorem for the Rosenblatt process, which is a selfsimilar stochastic process exhibiting long range dependence. By using numerical results and simulated data, we show that this approximation performs very well. We use this result to construct a binary market model dr…
A new model prices assets considering market microstructure effects.
problem Including market microstructure effects in dynamic asset pricing.
method Discrete binary tree model with history-dependent underlying security prices.
result The model preserves historical price dynamics and is market-complete, arbitrage-free.
The paper categorizes and analyzes various event-linked perpetual futures contracts.
problem Developing a risk-design framework for complex event-linked perpetual futures.
method Formal taxonomy of seven pure-form canonical variants, organized along four design axes.
result Detailed analysis of microstructure properties and limitations of various variants.
The mesoscopic organization of complex systems, from financial markets to the brain, is an intermediate between the microscopic dynamics of individual units (stocks or neurons, in the mentioned cases), and the macroscopic dynamics of the system as a whole. The organization is determined by "communities" of units whose …
Binary classification models get more efficient predictive probabilities.
problem Computing predictive probabilities in Bayesian probit models is computationally challenging.
method Use of expectation propagation (EP) to find a closed-form expression for predictive probabilities.
result Closed-form predictive probabilities improve over existing methods.
ForesightFlow detects informed trading on prediction markets using an information leakage score.
problem Detecting informed trading on decentralized prediction markets.
method Developed an Information Leakage Score (ILS) framework to quantify the fraction of terminal information move priced in before public news events.
result The score connects label generation to proper-scoring-rule literature and reveals systematic biases in insider trading documentation.
RiskLabs uses LLMs to predict financial risks from multimodal data.
problem Financial risk prediction using AI techniques.
method Integrates multimodal financial data (textual, vocal, time series, news) into LLMs for prediction.
result Empirical results show effectiveness in forecasting market volatility and variance.
The paper explores anticipative binary information in financial markets using Brownian motion and Poisson processes.
problem Capturing anticipative information in financial markets with Brownian motion and Poisson processes.
method Using Malliavin calculus and filtration enlargement techniques, the paper computes the semimartingale decomposition of the processes.
result The paper provides the exact value of anticipative information in the pure jump case.
Cryptocurrencies are ranked for efficiency using a new Complexity-Entropy Plane.
problem Evaluating the efficiency of cryptocurrencies using traditional financial metrics.
method Developed a Binary Complexity-Entropy Plane (BiCEP) to analyze daily price fluctuations of major cryptocurrencies.
result Only Shiba Inu (SHIB) is significantly inefficient, while most cryptocurrencies operate in close-to-efficient conditions.
We have developed a strategy for the analysis of newly available binary data to improve outcome predictions based on existing data (binary or non-binary). Our strategy involves two modeling approaches for the newly available data, one combining binary covariate selection via LASSO with logistic regression and one based…
Study evaluates consistency of LLMs in binary text classification, providing systematic guidance.
problem Lack of reliable methods for evaluating large language model (LLM) binary text classification.
method Adapting psychometric principles, the study determines sample size requirements, develops metrics for invalid responses, and evaluates intra- and inter-rater reliability.
result LLMs demonstrated high intra-rater consistency, achieving perfect agreement on 90-98% of examples, with smaller models outperforming larger counterparts.
New method recovers predictions from unobservable source subpopulation in binary classification.
problem Challenging binary classification with unobservable subpopulation in source domain.
method Distribution matching method to estimate subpopulation proportions, rigorous derivation of prediction models.
result Our method outperforms naive benchmarks in synthetic and real-world datasets.
Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.
problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.
Quantum circuits represent binary classification trees with binary features.
problem Classifying data using binary classification trees with binary features.
method Quantum circuits and probabilistic approach for traversing decision trees.
result First realization of a decision tree classifier on a quantum device.
Unbiased wealth exchanges always lead to inequality.
problem Understanding wealth distribution in unbiased binary exchange systems.
method Analytical demonstration of unbiased binary exchanges leading to perfect inequality.
result Any system driven by unbiased binary exchanges will reach perfect inequality and zero mobility.
Here we present a novel approach to statistical analysis of financial time series. The approach is based on n-grams frequency dictionaries derived from the quantized market data. Such dictionaries are studied by evaluating their information capacity using relative entropy. A specific quantization of (originally conti…
We introduce a novel scheme to train binary convolutional neural networks (CNNs) -- CNNs with weights and activations constrained to {-1,+1} at run-time. It has been known that using binary weights and activations drastically reduce memory size and accesses, and can replace arithmetic operations with more efficient bit…
New metric reduces arbitrariness in fair binary classification predictions.
problem Variance in predictions leads to arbitrary decisions in fair classification.
method Developed a self-consistency metric and an abstention algorithm.
result Fair binary classification is often close to fair due to variance, not interventions.
Sharp bounds on binary model inference performance.
problem High-dimensional inference in binary models.
method Convex empirical risk minimization, sharp asymptotics, optimal performance bounds.
result Sharp predictions and optimal performance bounds for binary models.
Paper introduces impact curves for evaluating binarized regression models with varying costs.
problem Evaluating binarized regression models with varying costs and instance-specific utility.
method Proposes impact curves to optimize binary decisions across different utilities.
result Impact curves identify conditions where one model is favored over another and quantify model improvement.
New method predicts binary matrix entries using empirical Bayes and low-rank structure.
problem Predicting unobserved entries in binary matrices.
method Empirical Bayes method motivated by Efron--Morris estimator, exploiting low-rank structure.
result Superior performance in predictive accuracy, calibration, and efficiency compared to existing methods.
Develops a binary tree model for option pricing with skew dynamics.
problem Option pricing in incomplete markets with skew dynamics.
method Binary tree model with skew Brownian motion dynamics.
result Model preserves skewness under both discrete and continuous time limits.
The paper develops bounds for predictive values in binary classification.
problem Lack of confidence intervals for positive and negative predictive values.
method Bi-criterion framework and distribution-free large deviation and uniform convergence bounds.
result New bounds for predictive values without relying on concentration inequalities.
Random forest models predict CLABSI risk in hospital admissions, with static models performing similarly to dynamic ones.
problem Predicting CLABSI risk in hospital admissions using EHR data with competing risks.
method Comparison of static and dynamic random forest models for binary, multinomial, survival, and competing risks outcomes.
result Static and dynamic random forest models perform similarly in predicting CLABSI risk, with multinomial models having the lowest computation times.
A method for making predictions with a reject option using conformal prediction.
problem Uncertainty in machine learning predictions, especially when models are unsure.
method Formalizing ML with reject option, using conformal prediction for distribution-free error guarantees.
result Theoretical guarantees on error rate for prediction sets with distribution-free validity.