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

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for extended exponential function

Proposes a new classification model using extended exponential functions.

problem Improving classification accuracy in binary linear classification problems.
method Developed a Bregman-Tweedie classification model based on extended exponential functions.
result The H-Bregman and L-Bregman sub-models outperform traditional methods in ranking and classification accuracy.

A new model relaxes constraints on exponential dispersion models.

problem Tight conditions on cumulant function limit the class of exponential dispersion models.
method Introduces K-LED model with Legendre cumulant function and Bregman divergence guidance.
result The model allows for easier computation of mean parameter and includes various distributions.

In this paper, we study the dividend strategies for a shareholder with non-constant discount rate in a diffusion risk model. We assume that the dividends can only be paid at a bounded rate and restrict ourselves to the Markov strategies. This is a time inconsistent control problem. The extended HJB equation is given an…

2013-04-30abs ↗pdf ↗

Three-hidden-layer neural networks can approximate Hölder continuous functions uniformly with exponential rate.

problem Approximating Hölder continuous functions with neural networks.
method Introduced Floor-Exponential-Step (FLES) networks with three hidden layers.
result Uniform approximation of Hölder continuous functions with an exponential rate.

The paper extends mixability theory to function-valued forecasts, proving various loss functions are mixable.

problem Efficient aggregation of functional and probabilistic forecasts in online prediction games.
method Adapting mixable and exponentially concave loss functions to function-valued forecasts.
result Various loss functions used for probabilistic forecasting are mixable (exp-concave).

We introduce, for every Z\mathbb{Z}-graded manifold, a formal exponential map defined in a purely algebraic way and study its properties. As an application, we give a simple new construction of a Fedosov type resolution of the algebra of smooth functions of Z\mathbb{Z}-graded manifolds and we extend the Emmrich--Wein…

2015-08-12abs ↗pdf ↗

New energy functional and fields for Yang-Mills theory, proving monotonicity and vanishing theorems.

problem Developing new mathematical tools for Yang-Mills theory.
method Introducing normalized exponential Yang-Mills energy functional, deriving monotonicity formula and vanishing theorem.
result Monotonicity and vanishing theorems for exponential Yang-Mills fields.

Extends likelihood ratio exponential families to analyze various optimization methods.

problem Analyzing optimization methods like rate-distortion and information bottleneck.
method Linking geometric mixture paths to exponential families and using hypothesis testing.
result Provides a common mathematical framework for understanding these methods.

Extends Stein's lemma to exponential-family mixtures for gradient computation.

problem Computing gradients for complex distributions with weak assumptions.
method Generalizes Stein's lemma to exponential-family mixtures and applies it to reparameterization trick.
result Derives new gradient identities for various distributions.

Develops a semi-supervised learning method using exponential tilt mixture models.

problem Improves classification accuracy with labeled and unlabeled data.
method Extends logistic regression to exponential tilt modeling, derives maximum likelihood estimation, and proposes regularized estimation.
result Demonstrates improved prediction accuracy compared to existing methods.

Paper introduces kernel deformed exponential families for sparse continuous attention.

problem Creating efficient attention mechanisms for sparse data.
method Developed kernel deformed exponential families, theoretically and experimentally.
result Kernel deformed exponential families can attend to multiple compact regions of data.

Extend classical theory of affine processes to path-dependent setting

problem Path-dependent affine processes
method Introduce path-dependent coefficients and provide analytic formulas for their Fourier--Laplace transform
result Define path-dependent affine processes through their exponential-affine Fourier--Laplace transform and establish a characterization theorem

Analytic networks with bounded coefficients can't outperform polynomial approximations.

problem Approximation limits of neural networks with analytic activation functions under coefficient constraints.
method Deterministic analysis using comparison argument and Bernstein-type estimates.
result Networks with analytic activation functions and controlled coefficients cannot outperform classical polynomial approximation rates on non-analytic targets.

We study the Dehn function of connected Lie groups. We show that this function is always exponential or polynomially bounded, according to the geometry of weights and of the 2-cohomology of their Lie algebras. Our work, which also addresses algebraic groups over local fields, uses and extends Abels' theory of multiamal…

2013-10-20abs ↗pdf ↗

Dropout improves regularization in flexible models for rare features.

problem Understanding theoretical properties of dropout in generalized linear models.
method Theoretical analysis and application to adaptive smoothing with B-splines.
result Dropout prefers rare features in mean and dispersion parameters.

The article extends previous work on contracting convex hypersurfaces by nonhomogeneous curvature functions.

problem Contraction of convex hypersurfaces by nonhomogeneous functions of curvature.
method Extending previous results to various cases, showing convergence to asymptotically round points under pinching conditions.
result Convergence to asymptotically round points under suitable rescaling and pinching conditions.

The abstract theorem extends a Lie group result to Lie groupoids.

problem Expressing functions on Lie groupoids as convolutions of two functions.
method Using a lemma from Dixmier-Malliavin, Lie algebroids, and exponential map.
result Every smooth, compactly-supported function on a Lie groupoid can be expressed as a finite sum of convolutions of two such functions.

We study the geodesic X-ray transform on Cartan-Hadamard manifolds, and prove solenoidal injectivity of this transform acting on functions and tensor fields of any order. The functions are assumed to be exponentially decaying if the sectional curvature is bounded, and polynomially decaying if the sectional curvature de…

2017-05-29abs ↗pdf ↗

TensorPlan shows an exponential lower bound for planning in MDPs with linearly realizable value functions.

problem Finding an exponential lower bound for planning in MDPs with linearly realizable value functions.
method TensorPlan and a few action lower bound approach.
result An exponentially large lower bound is shown for planning in MDPs with linearly realizable value functions.

New bounds on learning algorithm generalization error derived using information density.

problem Bounding the generalization error of learning algorithms.
method Exponential inequalities and information density/conditional information density.
result Novel bounds on average and tail probability of generalization error.

Expressive efficiency refers to the relation between two architectures A and B, whereby any function realized by B could be replicated by A, but there exists functions realized by A, which cannot be replicated by B unless its size grows significantly larger. For example, it is known that deep networks are exponentially…

2017-03-06abs ↗pdf ↗

A random walk wnw_n on a separable, geodesic hyperbolic metric space XX converges to the boundary X\partial X with probability one when the step distribution supports two independent loxodromics. In particular, the random walk makes positive linear progress. Progress is known to be linear with exponential decay when …

2017-10-14abs ↗pdf ↗

Study the exponential map on surfaces using fluid dynamics.

problem Exponential map of volume-preserving diffeomorphisms on closed surfaces.
method Fluid dynamical proof of Ebin--Misiołek--Preston theorem and extension of Shnirelman's rigidity result.
result Exponential map is a nonlinear Fredholm mapping of index zero and Fredholm quasiregular.

The paper analyzes optimal dividend and capital injection strategies under time-inconsistent preferences.

problem Optimal dividend and capital injection strategies under time-inconsistent preferences.
method Diffusion risk model with general discount functions, weak equilibrium definition, HJB equation system.
result Explicit solutions and threshold types of optimal strategies derived under different discount functions.

The Langevin Algorithm's stationary distribution is shown to be sub-exponential or sub-Gaussian under certain conditions.

problem Understanding the properties of the Langevin Algorithm's stationary distribution.
method Analysis using a rotation-invariant moment generating function (Bessel function) to study the stationary dynamics of the Langevin Algorithm.
result Concentration results for the Langevin Algorithm's stationary distribution πηπ_η are established, showing it is sub-exponential or sub-Gaussian under convex or strongly convex potential conditions.

Extends DAMs to Gaussian distributions for efficient pattern storage and retrieval.

problem Limited storage capacity and retrieval methods for non-vector pattern representations.
method Introduces a log-sum-exp energy function over Gaussian distributions, using optimal transport maps for retrieval dynamics.
result Proves exponential storage capacity and provides quantitative retrieval guarantees.

This paper extends exponential smoothing to distributional time series using Wasserstein distance.

problem Forecasting distributional time series with exponential smoothing.
method Generalized exponential smoothing in Wasserstein space, with consistent parameter estimation.
result Wasserstein exponential smoothing outperforms traditional methods in high-frequency financial and electricity demand data.

Study shows exponential convergence in classification errors using random features and SGD.

problem Scalability issues in kernel methods for large datasets.
method Binary classification problem with random features and stochastic gradient descent.
result Exponential convergence rate of expected classification error achieved.

In this short paper, we overview and extend the results of our papers cond-mat/0001432, cond-mat/0008305, and cond-mat/0103544, where we use an analogy with statistical physics to describe probability distributions of money, income, and wealth in society. By making a detailed quantitative comparison with the available …

2002-11-09abs ↗pdf ↗