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

18355370 · May 202619922001200920172026
48 results for Alpha-Beta divergence

A method to compute divergences between decomposable models, useful in supervised learning.

problem Computing exact divergences between high-dimensional distributions is intractable.
method Proposes an approach to compute exact alpha-beta divergences between marginal and conditional distributions of decomposable models.
result Tractable computation of marginal and conditional alpha-beta divergences.

This paper introduces a variational approximation framework using direct optimization of what is known as the {\it scale invariant Alpha-Beta divergence} (sAB divergence). This new objective encompasses most variational objectives that use the Kullback-Leibler, the R{é}nyi or the gamma divergences. It also gives access…

2018-05-02abs ↗pdf ↗

We describe the underlying probabilistic interpretation of alpha and beta divergences. We first show that beta divergences are inherently tied to Tweedie distributions, a particular type of exponential family, known as exponential dispersion models. Starting from the variance function of a Tweedie model, we outline how…

2012-09-19abs ↗pdf ↗

In this paper, the geometric meaning of (alpha,beta)-norms is made clear. On this basis, we introduce a new class of Finsler metrics called general (alpha,beta)-metrics, which are defined by a Riemannian metric and an 1-form. These metrics not only generalize original (alpha,beta)-metrics naturally, but also include so…

2012-09-05abs ↗pdf ↗

EGAB algorithms improve online portfolio selection.

problem Online portfolio selection problem.
method Generalized exponentiated gradient (EG) updates with Alpha-Beta divergence regularization.
result EGAB algorithms enhance portfolio performance, especially with transaction costs.

We consider an expanding flow of smooth, closed, uniformly convex hypersurfaces in (n+1)-dimensional Euclidean space with speed fu^{alpha}{sigma}_k^{beta}, where u is the support function of the hypersurface, alpha, beta are two constants, and beta>0, sigma_k is the k-th symmetric polynomial of the principle curvature …

2019-05-12abs ↗pdf ↗

We consider a shrinking flow of smooth, closed, uniformly convex hypersurfaces in (n+1)-dimensional Euclidean space with speed fu^{alpha}{sigma}_n^{beta}, where u is the support function of the hypersurface, alpha, beta are two constants, and beta>0, sigma_n is the n-th symmetric polynomial of the principle curvature r…

2019-05-12abs ↗pdf ↗

Efficiently simulates SABR model with novel sampling methods.

problem Sampling integrated variance and terminal forward price in SABR model.
method Moment-matched shifted lognormal approximation for integrated variance, CEV approximation for terminal forward price.
result Enhanced simulation scheme is highly efficient, accurate, and reliable.

In this paper, we study a class of Finsler metrics called general (α,β)(α,β)-metrics, which are defined by a Riemannian metric αα and a 11-form ββ. We find an equation which is necessary and sufficient condition for such Finsler metric to be a Douglas metric. By solving this equation, we obtain all of general (α,β)(α,β)-m…

2015-05-29abs ↗pdf ↗

For option pricing models and heavy-tailed distributions, this study proposes a continuous-time stochastic volatility model based on an arithmetic Brownian motion: a one-parameter extension of the normal stochastic alpha-beta-rho (SABR) model. Using two generalized Bougerol's identities in the literature, the study sho…

2018-09-11abs ↗pdf ↗

Blockchain funds balance risk and return for various investors.

problem Creating diversified portfolios with risk parity for different risk appetites.
method Developed three funds (Alpha, Beta, Gamma) with distinct risk and return profiles, setting weights inversely proportional to risk.
result Blockchain enables investors to select their preferred risk-return combination and allocate wealth accordingly.

k-nearest neighbour (kNN) is one of the most prominent, simple and basic algorithm used in machine learning and data mining. However, kNN has limited prediction ability, i.e., kNN cannot predict any instance correctly if it does not belong to any of the predefined classes in the training data set. The purpose of this p…

2020-03-01abs ↗pdf ↗

Improved option pricing for SABR model using Gauss-Hermite quadrature.

problem Improving accuracy of option pricing in the SABR model.
method Using Gauss-Hermite quadrature for numerical integration of the integrated variance.
result New method provides accurate option prices across all strike prices.

Divergence functions play a key role as to measure the discrepancy between two points in the field of machine learning, statistics and signal processing. Well-known divergences are the Bregman divergences, the Jensen divergences and the f-divergences. In this paper, we show that the symmetric Bregman divergence can be …

2018-10-03abs ↗pdf ↗

Study explores relationship between Hölder and FDPD divergences.

problem Understanding the relationship between Hölder and FDPD divergences.
method Intersection and generalization of divergence families, proving nonnegativity, deriving inequalities.
result Established ξξ-Hölder divergence and derived inequalities.

Unified representation of density-power-based divergences simplifies estimation to M-estimation.

problem Outliers in density estimation.
method Define a norm-based Bregman density power divergence (NB-DPD) that reduces to M-estimation.
result NB-DPD connects and generalizes existing divergences, highlighting robustness properties.

For a standard Finsler metric F on a manifold M, its domain is the whole tangent bundle TM and its fundamental tensor g is positive-definite. However, in many cases (for example, the well-known Kropina and Matsumoto metrics), these two conditions are relaxed, obtaining then either a pseudo-Finsler metric (with arbitrar…

2011-11-22abs ↗pdf ↗

This paper improves active learning by using robust divergences for committee disagreement.

problem Active learning with high measurement costs.
method Query by committee with Bregman divergence (including Kullback-Leibler divergence as a special case).
result The proposed method is more robust and performs as well as or better than conventional methods.

Extensive neural networks eliminate the need for SABR pricing formulas.

problem Lack of exact pricing formulas for the SABR model.
method Used a GPU-based simulation and an extensive neural network to learn implied volatilities.
result Neural networks achieve high accuracy and efficiency comparable to Monte-Carlo simulations.

The paper improves semi-supervised learning using ff-divergences and αα-Rényi divergences.

problem Improving semi-supervised learning with noisy pseudo-labels.
method Inspired by ff-divergences and αα-Rényi divergences, the paper develops new empirical risk functions and regularization techniques.
result The new methods show better performance than traditional self-training methods, especially in noisy pseudo-label scenarios.

ff-divergences are a general class of divergences between probability measures which include as special cases many commonly used divergences in probability, mathematical statistics and information theory such as Kullback-Leibler divergence, chi-squared divergence, squared Hellinger distance, total variation distance e…

2013-02-02abs ↗pdf ↗

We introduce a new quasi-isometry invariant, called the divergence spectrum, to study finitely generated groups. We compare the concept of divergence spectrum with the other classical notions of divergence and we examine the divergence spectra of relatively hyperbolic groups. We show the existence of an infinite collec…

2016-11-15abs ↗pdf ↗

We study the logarithmic L(α)L^{(α)}-divergence which extrapolates the Bregman divergence and corresponds to solutions to novel optimal transport problems. We show that this logarithmic divergence is equivalent to a conformal transformation of the Bregman divergence, and, via an explicit affine immersion, is equivalent t…

2019-06-17abs ↗pdf ↗

The study defines divergence for multivector fields on infinite-dimensional manifolds.

problem Defining divergence for multivector fields on infinite-dimensional manifolds.
method Definition of divergence consistent with finite-dimensional geometry, properties transferred from finite to infinite dimensions.
result Natural properties of divergence are preserved in infinite dimensions.

The paper evaluates biased methods for alpha-divergence minimization.

problem The impact of bias on solutions found for alpha-divergence minimization.
method Empirical evaluation of biased methods for alpha-divergence minimization, focusing on bias effects and dimensionality.
result Solutions are biased towards KL-divergence minimizers and require impractical computation in high dimensions to minimize alpha-divergence.

Develops a new divergence framework that combines ff-divergences and IPMs.

problem Comparing distributions that are not absolutely continuous.
method Introduces (f,Γ)(f,Γ)-divergences as a two-stage mass-redistribution/mass-transport process.
result Improves estimation, learning, and uncertainty quantification in GANs for heavy-tailed distributions.

Study compares statistical properties and power of divergence measures for credit risk monitoring.

problem Detecting distributional shifts in credit risk models.
method Derives statistical properties and chi-square benchmark values for Jensen-Shannon Divergence and Kullback-Leibler Divergence, demonstrating their applicability in credit risk monitoring.
result Jensen-Shannon Divergence and Kullback-Leibler Divergence follow chi-square distributions and reveal practical trade-offs in minimizing false positives vs. detecting changes.

New α\alpha-divergence loss function improves neural density ratio estimation.

problem Optimization challenges in existing DRE methods, especially overfitting and high sample requirements.
method Derived α\alpha-divergence loss function (α\alpha-Div) for neural density ratio estimation.
result The α\alpha-divergence loss function (α\alpha-Div) offers stable and effective optimization for DRE.

Study on geometric Jensen-Shannon divergence for Gaussian measures in Hilbert space.

problem Computing divergence between Gaussian measures in infinite-dimensional Hilbert space.
method Closed form expression and regularization for divergence calculation.
result Closed form expression and regularization for Geometric Jensen-Shannon divergence.

The paper explores how information geometry impacts classical CR inequalities.

problem Deriving and generalizing CR inequalities using information geometry.
method Examining Eguchi's theory and applying Amari-Nagoaka's theory to KL-divergence, and then extending to other divergences.
result Generalized CR inequalities derived from various divergences.

We extend CS divergence to conditional distributions and show its advantages in time series data and sequential decision making.

problem Quantifying the closeness between conditional distributions.
method Developed and estimated a conditional Cauchy-Schwarz divergence using kernel density estimation.
result Conditional CS divergence outperforms previous methods in time series clustering and sequential decision making.

Rényi divergence is related to Rényi entropy much like Kullback-Leibler divergence is related to Shannon's entropy, and comes up in many settings. It was introduced by Rényi as a measure of information that satisfies almost the same axioms as Kullback-Leibler divergence, and depends on a parameter that is called its or…

2012-06-12abs ↗pdf ↗

Classifies divergence and thickness in right-angled Coxeter groups.

problem Characterizing the divergence and thickness of right-angled Coxeter groups.
method Completely classifies divergence functions and proves conditions for thickness using the hypergraph index.
result Exact divergence functions of RACGs can be computed from their defining graphs.

The paper explores statistical and topological properties of sliced probability divergences.

problem Understanding the topological, statistical, and computational consequences of slicing divergences.
method Deriving theoretical properties of sliced probability divergences, including metric axioms preservation and weak continuity.
result Sliced divergences share similar topological properties and have stable sample complexity.

New framework using Jensen-Shannon divergence improves domain adaptation theory.

problem Incoherence between empirical domain adversarial training and theoretical H\mathcal{H}-divergence.
method Established new theoretical framework based on Jensen-Shannon divergence, derived bi-directional upper bounds.
result Framework exhibits flexibilities for various transfer learning problems.