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,742 papers · 148 categories

Trend · papers per month

255075100 · Jun 202019922001200920172026
48 results for Binary options

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.

In this paper we extend Buchen's method to develop a new technique for pricing of some exotic options with several expiry dates(more than 3 expiry dates) using a concept of higher order binary option. At first we introduce the concept of higher order binary option and then provide the pricing formulae of nn-th order b…

2013-02-14abs ↗pdf ↗

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.

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.

Adversarial robustness improved by abstaining from decisions.

problem Improving classification accuracy in the presence of adversarial perturbations.
method Introducing an abstain option in binary classification problems, using metrics to quantify performance and robustness.
result There is a tradeoff between nominal performance and adversarial robustness.

The paper studies large deviation principles for stochastic volatility models with reflection, focusing on binary barrier options and call prices.

problem Large deviation principles for stochastic volatility models with reflection.
method Sample path and small-noise large deviation principles for the log-price process.
result Asymptotic behavior of binary barrier options and call prices in the small-noise regime.

Extends BBSM model to incorporate ESG ratings and path dynamics.

problem Price stock options considering historical market index dynamics and ESG ratings.
method Develops discrete, binary tree option pricing model under BBSM with ESG valuation.
result Model accurately fits stock price changes and European call option prices.

Adaptive Multilevel Splitting improves rare event pricing for financial derivatives.

problem Efficient pricing of binary options in rare event regimes with discontinuous payoffs.
method Adaptive Multilevel Splitting (AMS) reformulates rare-event problem as conditional events.
result AMS achieves up to 200-fold improvements over standard Monte Carlo, preserving unbiasedness.

Study volatility models with rough paths, focusing on large deviations and option behavior.

problem Analyzing volatility in financial markets with very rough paths.
method Introduced time-inhomogeneous stochastic volatility models with Volterra Gaussian processes.
result Obtained large deviation principles for log-price processes in super rough Gaussian models.

Active learning is an important technique to reduce the number of labeled examples in supervised learning. Active learning for binary classification has been well addressed in machine learning. However, active learning of the reject option classifier remains unaddressed. In this paper, we propose novel algorithms for a…

2019-06-14abs ↗pdf ↗

We consider the problem of binary classification where one can, for a particular cost, choose not to classify an observation. We present a simple proof for the oracle inequality for the excess risk of structural risk minimizers using a lasso type penalty.

2007-05-16abs ↗pdf ↗

In many real applications of statistical learning, a decision made from misclassification can be too costly to afford; in this case, a reject option, which defers the decision until further investigation is conducted, is often preferred. In recent years, there has been much development for binary classification with a …

2017-01-09abs ↗pdf ↗

Enhances binomial model with machine learning for microstructure effects.

problem Traditional binomial models ignore market microstructure effects like bid-ask spreads.
method Augments binomial tree with Random Forest classifiers trained on market data.
result Achieves 88.25% AUC in forecasting price movements using real-world data.

Modern datasets are becoming heterogeneous. To this end, we present in this paper Mixed-Variate Restricted Boltzmann Machines for simultaneously modelling variables of multiple types and modalities, including binary and continuous responses, categorical options, multicategorical choices, ordinal assessment and category…

2014-08-06abs ↗pdf ↗

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 ↗

We propose a general framework for the simultaneous modeling of equity, government bonds, corporate bonds and derivatives. Uncertainty is generated by a general affine Markov process. The setting allows for stochastic volatility, jumps, the possibility of default and correlation between different assets. We show how to…

2010-12-01abs ↗pdf ↗

Survey on assessing and improving classifier calibration for better decision making.

problem Ensuring classifiers correctly quantify prediction uncertainty.
method Overview of principles, methods, and evaluation metrics for calibration.
result New methods and extensions from binary to multiclass settings.

Enhanced Random Forests outperform XGBoost across binary classification datasets.

problem Improving performance of Random Forests in binary classification.
method Adaptive sample and model weighting, iterative algorithm for sample weights, personalized tree weighting schemes.
result Significantly outperforms XGBoost across 15 binary classification datasets.

Developed R package for creating nomograms for any ML algorithms.

problem Creating nomograms for any machine learning algorithms.
method Formulated a function to transform ML prediction models into nomograms, requiring specific datasets.
result Created 5 types of nomograms for various ML algorithms and predictor types.

Classifier chains link binary classifiers for multi-label learning, achieving state-of-the-art performance.

problem Multi-label learning problems where multiple labels can be assigned to instances.
method Linking off-the-shelf binary classifiers in a chain structure.
result Classifier chains achieve state-of-the-art performance across various datasets and metrics.

Bayesian inference identifies model parameters from financial data to detect arbitrage opportunities.

problem Identifying model parameters from financial data to detect arbitrage opportunities.
method Bayesian inference approach using Markov Chain Monte Carlo (MCMC) algorithm.
result Bayesian inference can estimate unknown trend and volatility coefficients from measured data.

Motivated by an application in computational biology, we consider low-rank matrix factorization with {0,1}\{0,1\}-constraints on one of the factors and optionally convex constraints on the second one. In addition to the non-convexity shared with other matrix factorization schemes, our problem is further complicated by a c…

2014-01-23abs ↗pdf ↗

This work presents a new strategy for multi-class classification that requires no class-specific labels, but instead leverages pairwise similarity between examples, which is a weaker form of annotation. The proposed method, meta classification learning, optimizes a binary classifier for pairwise similarity prediction a…

2019-01-02abs ↗pdf ↗

This paper provides fast estimates for complex option types.

problem Estimating prices for constrained multiple exercise American options.
method Lookahead search for lower estimates and nearest-neighbor martingale for upper estimates.
result Probabilistic convergence guarantees for the algorithms.

Large deviation principles for multivariate stochastic volatility models.

problem Understanding the behavior of log-processes in multivariate stochastic volatility models.
method Establishing a comprehensive sample path large deviation principle for log-processes.
result Asymptotic formulas for first exit times and barrier option prices derived from the LDP.

Study bounds for prices of European and American options with optional termination.

problem Bounding prices of options with potential termination.
method Duality results linking upper prices of vulnerable options to American options with constrained exercise times.
result Linking upper prices of vulnerable options to American options and game options.