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

Trend · papers per month

1234 · May 202619922001200920172026
48 results for GBM

Researchers develop a generalised geometric Brownian motion for better asset pricing.

problem Irregularities in simple geometric Brownian motion for asset dynamics.
method Introduce a memory kernel to generalise GBM, derive moments and probability density functions.
result The performance of kernels in pricing options depends on option maturity and moneyness.

Gradient Boosting Machine (GBM) is an extremely powerful supervised learning algorithm that is widely used in practice. GBM routinely features as a leading algorithm in machine learning competitions such as Kaggle and the KDDCup. In this work, we propose Accelerated Gradient Boosting Machine (AGBM) by incorporating Nes…

2019-03-20abs ↗pdf ↗

GBM outperforms DL in credit scoring tasks, but performance depends on dataset.

problem Benchmarking deep learning vs. gradient boosting for credit scoring.
method Used three datasets with different features to compare DL and GBM.
result GBM is more powerful and faster than DL for credit scoring.

Study finds GBM model accurately predicts stock prices on Ghana Stock Exchange.

problem Investigating the suitability of GBM for modeling stock price dynamics.
method Geometric Brownian Motion model applied to weekly and monthly returns of equities listed on the Ghana Stock Exchange.
result GBM model accurately forecasts stock prices with minimal deviations, as evidenced by MSE evaluations.

A method interprets black-box models using an ensemble of gradient boosting machines.

problem Local and global interpretation of black-box models.
method An ensemble of gradient boosting machines (GBMs) to form a generalized additive model.
result Efficiency and properties demonstrated on synthetic and real datasets.

Gradient Boosting Machine (GBM) introduced by Friedman is a powerful supervised learning algorithm that is very widely used in practice---it routinely features as a leading algorithm in machine learning competitions such as Kaggle and the KDDCup. In spite of the usefulness of GBM in practice, our current theoretical un…

2018-10-24abs ↗pdf ↗

Geometric Brownian motion (GBM) is a key model for representing self-reproducing entities. Self-reproduction may be considered the definition of life [5], and the dynamics it induces are of interest to those concerned with living systems from biology to economics. Trajectories of GBM are distributed according to the we…

2018-02-08abs ↗pdf ↗

Study models illiquid stock prices and finds low correlation due to constant prices.

problem Modeling illiquid stock prices and measuring correlation accurately.
method Combined Markov model with Ornstein Uhlenbeck and geometric Brownian motion.
result Low correlation in USE stocks due to constant prices and illiquidity.

The study extends GBM to include stable nonzero prices and finds a pronounced potential well.

problem The standard GBM model cannot describe stable nonzero prices in financial dynamics.
method Generalized GBM with polynomial drift of order q, model selection, and Markov chain Monte Carlo ensembles of potential functions.
result The optimal model for financial data is q=2, indicating the existence of a stable price.

A new ensemble model uses simple hyper-rectangles to improve gradient boosting machine performance.

problem Improving gradient boosting machine performance and avoiding overfitting.
method Proposes a new ensemble model with axis-parallel hyper-rectangles as base models, integrates into GBM, and uses SHAP for interpretation.
result GBM with HRBMs can be an effective and interpretable model for regression and classification problems.

Study benchmarks cryptocurrency risk using GBM, revealing Lognormal limitations.

problem Tackles limitations of Lognormal assumption in modeling cryptocurrency volatility and VaR.
method Applies Geometric Brownian Motion (GBM) with Maximum Likelihood Estimation and correlated Monte Carlo Simulation.
result Observed limitations of Lognormal assumption in cryptocurrency volatility and VaR calculations.

Geometric Brownian motion (GBM) is a model for systems as varied as financial instruments and populations. The statistical properties of GBM are complicated by non-ergodicity, which can lead to ensemble averages exhibiting exponential growth while any individual trajectory collapses according to its time-average. A com…

2012-09-20abs ↗pdf ↗

HypeGBMS clusters data in hyperbolic space, overcoming Euclidean limitations.

problem Clustering in hierarchical or tree-like datasets in curved spaces.
method Hyperbolic Gaussian Blurring Mean Shift with Möbius-weighted means.
result HypeGBMS effectively captures latent hierarchies in non-Euclidean data.

We study how resetting affects geometric Brownian motion, showing it becomes stationary but remains non-ergodic.

problem Effects of stochastic resetting on geometric Brownian motion.
method Analysis of geometric Brownian motion under stochastic resetting.
result Resetting makes geometric Brownian motion stationary but non-ergodic.

Study shows physical drift affects put-call parity enforcement, not just option payoffs.

problem Inconsistency between quoted put-call parity and actual market behavior.
method Examined SPX and RUT index options, used drift-preserving GBM term to improve fit.
result Physical drift enters the enforcement of risk-neutral parity, not just option payoffs.

To convert standard Brownian motion ZZ into a positive process, Geometric Brownian motion (GBM) eβZt,β>0e^{βZ_t}, β>0 is widely used. We generalize this positive process by introducing an asymmetry parameter α0 α\geq 0 which describes the instantaneous volatility whenever the process reaches a new low. For our new process, …

2018-09-06abs ↗pdf ↗

New methods improve tree ensemble models by compressing them while maintaining accuracy.

problem Theoretical understanding and practical compression of tree ensembles like random forests and gradient boosting machines.
method Spectral perspective on tree ensembles, deriving minimax rates and developing compression schemes.
result Leading eigenfunctions/singular vectors capture dominant predictive directions, leading to smaller, competitive models.

This work extends Tweedie's formulae to non-Gaussian processes for better diffusion model generation.

problem Limited exploration of non-Gaussian diffusion models and corresponding Tweedie's formulae.
method Extended Tweedie's formulae to geometric Brownian motion, squared Bessel, and Cox-Ingersoll-Ross processes.
result Demonstrated potential of non-Gaussian models in image and financial time series generation.

The geometric Lévy model (GLM) is a natural generalisation of the geometric Brownian motion model (GBM) used in the derivation of the Black-Scholes formula. The theory of such models simplifies considerably if one takes a pricing kernel approach. In one dimension, once the underlying Lévy process has been specified, th…

2011-11-09abs ↗pdf ↗

Unified comparison of gradient boosting algorithms for insurance claims.

problem Improving predictive accuracy and computational efficiency in insurance claim prediction.
method Unified notation and comprehensive numerical study comparing 12 gradient boosting algorithms on 5 datasets.
result No trade-off between model adequacy and predictive accuracy.

New methods for quantifying insurance claim cost uncertainty using LightGBM and GLMs.

problem Quantifying prediction uncertainty in insurance claim costs.
method Proposed non-conformity measures for GLMs and GBMs with Tweedie loss.
result Locally weighted Pearson residuals outperform other methods in maintaining nominal coverage with smallest average width.

Study optimal portfolio strategy with sporadic bankruptcy for isoelastic utility.

problem Maximizing expected isoelastic utility in a stock with potential bankruptcy.
method Coupled Hamilton-Jacobi-Bellman (HJB) equations, stochastic integral approach.
result Non-myopic optimal weights for non-logarithmic utilities.

This paper includes a proof of well-posedness of an initial-boundary value problem involving a system of degenerate non-local parabolic PDE which naturally arises in the study of derivative pricing in a generalized market model. In a semi-Markov modulated GBM model the locally risk minimizing price function satisfies a…

2015-06-04abs ↗pdf ↗

Accurate and reliable forecasting of total cloud cover (TCC) is vital for many areas such as astronomy, energy demand and production, or agriculture. Most meteorological centres issue ensemble forecasts of TCC, however, these forecasts are often uncalibrated and exhibit worse forecast skill than ensemble forecasts of o…

2020-01-16abs ↗pdf ↗

PGBM creates probabilistic predictions efficiently.

problem Creating probabilistic predictions for large-scale data.
method Approximates leaf weights as random variables, learns moments via stochastic tree ensemble update equations.
result PGBM offers significant speedup and accuracy improvements over existing methods.

Federated machine learning systems have been widely used to facilitate the joint data analytics across the distributed datasets owned by the different parties that do not trust each others. In this paper, we proposed a novel Gradient Boosting Machines (GBM) framework SecureGBM built-up with a multi-party computation mo…

2019-11-27abs ↗pdf ↗

New algorithms improve uncertainty estimation in satellite precipitation predictions.

problem Lack of uncertainty estimates in machine learning spatial precipitation predictions from satellite data.
method Benchmarked six algorithms including LightGBM, compared using quantile scoring functions and rules.
result LightGBM outperformed other algorithms in quantile scoring rule by 11.10%.

Study compares machine learning models for insurance pricing, including neural networks and GLMs.

problem Improving insurance pricing models using machine learning techniques.
method Benchmark study using four insurance datasets, comparing GLMs, GBM, FFNN, and CANN.
result CANNs provide better performance than GLMs and GBM, especially for frequency and severity modeling.

Quantum algorithms speed up derivative pricing beyond Black-Scholes models.

problem Quantum speedups for derivative pricing beyond Black-Scholes models.
method Utilizing fast-forwardability and quantum Milstein sampler for non-GBM models, and improved numerical integration for GBM and CIR models.
result Quadratic speedups for derivative pricing in practical models like CIR and Heston's model.

We consider the problem of computing the Credit Value Adjustment ({CVA}) of a European option in presence of the Wrong Way Risk ({WWR}) in a default intensity setting. Namely we model the asset price evolution as solution to a linear equation that might depend on different stochastic factors and we provide an approxima…

2018-11-18abs ↗pdf ↗

This paper explores alternative regression techniques in pricing American put options and compares to the least-squares method (LSM) in Monte Carlo implemented by Longstaff-Schwartz, 2001 which uses least squares to estimate the conditional expected payoff to the option holder from continuation. The pricing is done und…

2018-08-08abs ↗pdf ↗