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.

169,291 papers · 148 categories

Trend · papers per month

0.6%1.1%1.7%2.3% · Jan 199819922001200920182026
48 results for binomials

The study tightens bounds on binomial probabilities and minimums using KL-divergence.

problem Tightening bounds on binomial probabilities and minimums of i.i.d. Binomials.
method Applied Sanov's theorem to derive upper and lower bounds on binomial tail probabilities and minimums, expressed in terms of KL-divergence.
result High probability upper and lower bounds on the minimum of i.i.d. Binomial random variables, finite sample, asymptotically tight.

Improved binomial model for American put prices with error analysis.

problem Improving the accuracy of American put price approximations.
method Binomial approximation in the Black-Scholes model with consideration of continuous dividend yield.
result Error in approximation is O((lnn)α/n)O((ln n) ^{α} /n), where α depends on interest rate and dividend yield.

The theme in this paper is the recombining binomial tree to price American put option when the underlying stock follows constant elasticity of variance(CEV) process. Recombining nodes of binomial tree are decided from finite difference scheme to emulate CEV process and the tree has a linear complexity. Also it is deriv…

2014-10-22abs ↗pdf ↗

Transformer learns to estimate negative binomial parameters efficiently.

problem Parameter estimation for over-dispersed count data in large screens.
method Pre-trained transformer trained on synthetic data generation to invert parameter to count transformation.
result Method of moments provides faster, more efficient, and better-calibrated estimates.

The paper resolves a counterexample showing convergence of expected utility in binomial models.

problem The convergence of expected utility under binomial models was previously shown to fail in certain cases.
method The paper provides a positive result on convergence using fine estimates from the Central Limit Theorem.
result A general positive result of convergence of expected utility is provided in symmetric binomial models.

We characterize the combinatorial structure of conditionally-i.i.d. sequences of negative binomial processes with a common beta process base measure. In Bayesian nonparametric applications, such processes have served as models for latent multisets of features underlying data. Analogously, random subsets arise from cond…

2013-12-31abs ↗pdf ↗

We justify and give error estimates for binomial approximations of game (Israeli) options in the Black--Scholes market with Lipschitz continuous path dependent payoffs which are new also for usual American style options. We show also that rational (optimal) exercise times and hedging self-financing portfolios of binomi…

2006-07-05abs ↗pdf ↗

This paper provides formulas for minimum cost super-hedging in a multi-asset binomial market.

problem Finding minimum cost super-hedging strategies in a multi-asset, incomplete market model.
method Explicit formulas for minimum cost super-hedging strategies for various European type multi-asset contingent claims.
result Explicit formulas for non-negative local residuals of super-hedging strategies.

Detecting and recovering labels in binomial logistic mixtures is challenging due to an information gap.

problem Detecting and recovering labels in binomial logistic mixtures
method Propose two feasibility-aware inference procedures
result Avoid misleading component selections and improve label probability calibration

PSO optimizes model parameters in nonstandard distributions.

problem Estimating model parameters in nonstandard distributions using existing algorithms.
method Particle Swarm Optimization (PSO) as an alternative optimization routine.
result PSO produces more optimal or convergent results than existing algorithms.

New framework for portfolio management using binomial markets and game theory.

problem Investment behavior in competitive and incomplete markets.
method Introduces PRFPP framework, constructs and analyzes for both finite and mean field games.
result Relative performance concerns do not always lead to more risky asset investment.

The study models credit risk using Merton's framework and binomial trees.

problem Credit risk pricing and implied volatility estimation.
method Calibrated using Merton's structural model, with asset volatility derived from Black-Scholes-Merton. Implied mean return and probability surfaces constructed using a recombining binomial tree.
result Established a practical method for constructing implied credit surfaces.

Bayesian optimization for binomial outputs with multifidelity.

problem Optimizing functions with binomial outputs that don't fit Gaussian process assumptions.
method General Gaussian process model for binomial data, Expected Improvement acquisition function, heuristic sample selection.
result Improves optimization performance for binomial target functions.

We show that prices and shortfall risks of game (Israeli) barrier options in a sequence of binomial approximations of the Black--Scholes (BS) market converge to the corresponding quantities for similar game barrier options in the BS market with path dependent payoffs and the speed of convergence is estimated, as well. …

2009-07-23abs ↗pdf ↗

BKP R package models spatially varying binomial probabilities efficiently.

problem Modeling spatially varying binomial probabilities efficiently.
method Beta Kernel Process (BKP) combining localized kernel-weighted likelihoods with conjugate beta priors.
result Closed-form posterior inference without requiring latent variables or intensive MCMC sampling.

We show that the shortfall risk of binomial approximations of game (Israeli) options converges to the shortfall risk in the corresponding Black--Scholes market considering Lipschitz continuous path-dependent payoffs for both discrete- and continuous-time cases. These results are new also for usual American style option…

2008-11-12abs ↗pdf ↗

Parallelizes computation of expected values in binomial trees for financial option pricing.

problem High computational cost of evaluating expected values in binomial trees.
method Parallelizes the calculation of expected values into an 'embarrassingly parallel' problem and uses a parallel Monte Carlo method.
result Parallelization and Monte Carlo methods reduce computational cost and variance.

Develops methods to construct exchangeable sequences of random multisets.

problem Creating models for random multisets with unknown base measures.
method Uses exchangeable sequences of point processes and conditional-i.i.d. negative binomial processes.
result Provides constructions for negative binomial processes with random base measures.

NegBio-VAE models neural spike counts with negative binomial distribution.

problem Limited biological plausibility of continuous latent variables in VAEs for neural spike modeling.
method Proposes a negative binomial latent-variable model with a dispersion parameter for overdispersed spike count modeling.
result NegBio-VAE outperforms competing models in reconstruction and generation tasks.

NBMF improves recommendation precision by modeling count data dispersion.

problem Predicting user preferences in recommender systems with over-dispersed data.
method NBMF extends PF with a multiplicative term to handle over-dispersion, skipping binarization.
result NBMF predicts user tastes more accurately than Poisson matrix factorization.

A common approach to analyze a covariate-sample count matrix, an element of which represents how many times a covariate appears in a sample, is to factorize it under the Poisson likelihood. We show its limitation in capturing the tendency for a covariate present in a sample to both repeat itself and excite related ones…

2016-04-25abs ↗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.

Study on risk model with claims, dividends, and random probabilities.

problem Analyzing a risk model with claims, delayed claims, and randomized dividends.
method Discrete time Compound Beta-Binomial Risk Model with recursive expressions for Gerber-Shiu function.
result Recursive relations for ruin-related quantities obtained.

We develop a Bayesian nonparametric approach to a general family of latent class problems in which individuals can belong simultaneously to multiple classes and where each class can be exhibited multiple times by an individual. We introduce a combinatorial stochastic process known as the negative binomial process (NBP)…

2011-11-08abs ↗pdf ↗