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

4999148197 · Jun 202019922001200920182026
48 results for discrete sums

The paper studies discrete sums of geometric Brownian motions in finance.

problem Modeling stochastic annuities and pricing Asian options.
method Analyzes probability distributions and asymptotic behavior of discrete sums of geometric Brownian motions.
result Derives tail asymptotics and computes asymptotic distribution functions for discrete sums.

Study optimal stopping and a non-zero-sum game with risk measures in discrete time.

problem Optimal stopping and risk assessment in discrete time with non-zero-sum game.
method Using gg-expectations and recursive procedures, construct Nash equilibrium.
result Construct Nash equilibrium for a non-zero-sum game with risk measures.

Log-concavity proven for multinomial likelihoods under specific constraints.

problem Log-concavity of multinomial likelihoods under interval censoring constraints.
method Proved log-concavity by showing M-convex subsets of the discrete simplex.
result Likelihood function is completely log-concave.

A system for federated learning with private data, adding discrete Gaussian noise and secure aggregation.

problem Training models on private data distributed across devices while ensuring privacy.
method Discretizes data, adds discrete Gaussian noise, and uses secure aggregation to protect privacy.
result Matches the accuracy of central differential privacy with less than 16 bits of precision per value.

Gradient-based methods for games suffer from discrete update steps that cause drift, affecting performance.

problem Gradient-based methods for two-player games suffer from drift due to discrete update steps.
method Derived modified continuous dynamical systems to closely follow the discrete dynamics of games.
result Identified distinct components of discretization drift that can alter or destabilize game performance.

Study of discrete period matrices on embedded graphs, relating to Riemann surfaces.

problem Understanding discrete conformal structures on surfaces via period matrices.
method Combinatorial interpretation of period matrices, using homological quasi-trees and Laplacian determinants.
result Derived a combinatorial analogue of the Weil-Petersson potential and related it to homological quasi-trees.

Study local differential privacy methods for estimating power sums of discrete distributions.

problem Estimating non-linear functionals of discrete distributions under local differential privacy constraints.
method Interactive and non-interactive mechanisms for estimating power sums, with lower bounds provided.
result Achieves faster rates of estimation under certain conditions.

Asymptotic error distribution for approximation of a stochastic integral with respect to continuous semimartingale by Riemann sum with general stochastic partition is studied. Effective discretization schemes of which asymptotic conditional mean-squared error attains a lower bound are constructed. Two applications are …

2010-04-13abs ↗pdf ↗

Discretizing time series data introduces bias for decision-making models.

problem Discretization of non-regular time series data introduces bias in decision-making models.
method Showed discretization bias and proposed using continuous-time models instead.
result Avoiding discretization introduces unbiased decision-making models.

We consider two-player non-zero-sum stopping games in discrete time. Unlike Dynkin games, in our games the payoff of each player is revealed after both players stop. Moreover, each player can adjust her own stopping strategy according to the other player's action. In the first part of the paper, we consider the game wh…

2015-08-25abs ↗pdf ↗

Paper proves method for calculating NML code length works for continuous models.

problem Uncertainty in calculating NML code length for continuous models.
method Introduced a novel decomposition approach based on the coarea formula to prove correctness for continuous cases.
result Method accurately calculates NML code length for continuous models.

Study on convergence of Langevin dynamics for zero-sum games in probability distributions.

problem Analyzing convergence of Langevin dynamics for zero-sum games in probability distributions.
method Proved exponential and biased convergence guarantees for mean-field and finite-particle min-max Langevin dynamics.
result Explicit iteration complexity for finite-particle algorithms to approximate equilibrium distributions.

Study orbits of discrete lattice actions on the plane, derive new results for Veech surfaces.

problem Count pairs of holonomy vectors in Veech surfaces with bounded parameters.
method Siegel-Veech-type integral formula for averages of pairs of orbits.
result Upper bounds on pairs of holonomy vectors in Veech surfaces with bounded parameters.

Lognormal random variables appear naturally in many engineering disciplines, including wireless communications, reliability theory, and finance. So, too, does the sum of (correlated) lognormal random variables. Unfortunately, no closed form probability distribution exists for such a sum, and it requires approximation. …

2015-08-30abs ↗pdf ↗

A game theory study on optimal hiding and searching strategies in discrete locations.

problem Optimal hiding and searching strategies in a two-person zero-sum game between a hider and a searcher.
method Proved the existence of optimal strategies, developed an algorithm to compute them, and compared with a simple strategy.
result Optimal hiding strategy involves hiding in each location with nonzero probability, and optimal searching strategy can be constructed with up to n simple sequences.

Given a discrete group G and a spherical G-fusion category whose neutral component has invertible dimension, we use the state-sum method to construct a 3-dimensional Homotopy Quantum Field Theory (HQFT) with target the Eilenberg-MacLane space K(G,1).

2012-02-28abs ↗pdf ↗

Study shows linear sample complexity for learning SPNs.

problem Learning the set of distributions represented by Sum-Product Networks (SPNs).
method Initiate study of sample complexity, show linear growth up to logarithmic factors, use distribution compression schemes.
result Sample complexity grows linearly with the number of parameters of the SPN.

This thesis predicts the distribution of smoothed zeros of random sections on line bundles.

problem Predicting the distribution of smoothed zeros of random sections on line bundles.
method Developing smoothing operators on discrete surfaces and computing the expected sum of indices on each face.
result Predictions on the distribution of smoothed section's signed zeros with multiplicity.

Study asymptotic expansion of graph Laplacian on discretized surfaces, relating spanning trees and cycle-rooted forests.

problem Asymptotic expansion of graph Laplacian on discretized surfaces.
method Relate spanning trees and cycle-rooted spanning forests to zeta-regularized determinants.
result Explicit formula for limit of cycle-rooted spanning forest probability and topological observables.

Study of convergence of point-object configurations to a charged dust continuum.

problem Understanding the convergence of discretized point-object configurations to a charged dust continuum.
method Establishing existence and uniqueness of horizons/minimal surfaces, studying geometries of regions exterior to minimal surfaces, and discussing limits.
result Examples of scalar curvature jumps upon taking Gromov-Hausdorff and intrinsic flat limits.

New method reduces bias in estimating causal effects from discretized variables.

problem Bias in estimating causal effects from discretized continuous variables.
method Proposes a bias-reduced functional that evaluates outcome regression at within-bin conditional means.
result Demonstrates substantial bias reduction and near-nominal confidence interval coverage.

The functional determinant of an elliptic operator with positive, discrete spectrum may be defined as eZ(0)e^{-Z'(0)}, where Z(s)Z(s), the zeta function, is the sum nλns\sum_n^{\infty} λ_n^{-s} analytically continued to ss around the origin. In this paper Z(0)Z'(0) is calculated for the Laplace operator with Dirichlet boundary…

1993-04-08abs ↗pdf ↗

We introduce the index i(v) = 1 - X(S(v)) for critical points of a locally injective function f on the vertex set V of a simple graph G=(V,E). Here S(v) = {w in E | (v,w) in E, f(w)-f(v)<0} is the subgraph of the unit sphere at v in G. It is the exit set of the gradient vector field. We prove that the sum of i(v) over …

2012-01-05abs ↗pdf ↗

Researchers prove inequalities for reaction-diffusion systems using a new curvature-dimension condition.

problem Proving Li-Yau and Harnack inequalities for systems of linear reaction-diffusion equations.
method Introducing a hybrid curvature-dimension condition and proving a differential Harnack estimate.
result A Harnack inequality holds under the hybrid curvature-dimension condition CDhyb(0,d)CD_{hyb} (0,d) with d<d<\infty.

A new algorithm for minimizing functions on Wasserstein space.

problem Discretization of continuous Wasserstein gradient flows in machine learning.
method Forward-Backward discretization scheme for minimizing functions with smooth and nonsmooth components.
result The FB scheme converges similarly to proximal gradient algorithms in Euclidean spaces.

We extend risk measure stability conditions for coherent risk management.

problem Reserving and hedging claims under dynamic coherent risk measures.
method Dual characterisation of cones in LL^\infty adapted to a discrete time filtration, proving stability conditions.
result Equivalence of VV-m-stability and time-consistency in risk management.

New method estimates discrete distributions while protecting privacy.

problem Estimating discrete distributions with local differential privacy.
method Combining robust learning and local differential privacy.
result Minimax estimation rate of εd/α2k+d2/α2knε\sqrt{d/α^2 k}+\sqrt{d^2/α^2 kn} under privacy constraint.

We prove the existence of extremal, non-csc, Kähler metrics on certain unstable projectivised vector bundles (E)M¶(E) \to M over a cscK-manifold MM with discrete holomorphic automorphism group, in certain adiabatic Kähler classes. In particular, the vector bundles EME \to M under consideration are assumed to split as a …

2013-01-29abs ↗pdf ↗

If GG is a finite group, is a function f:GCf:G\to\mathbb C determined by its sums over all cosets of cyclic subgroups of GG? In other words, is the Radon transform on GG injective? This inverse problem is a discrete analogue of asking whether a function on a compact Lie group is determined by its integrals over all ge…

2014-11-14abs ↗pdf ↗

Piecewise flat approximations for curvature in Euclidean and non-Euclidean spaces.

problem Approximating local extrinsic curvature on discrete manifolds.
method Constructing discrete curvature forms on piecewise flat manifolds, using weighted sums of hinge angles.
result Converges to smooth curvature values as mesh refinement occurs, favorably comparing with other discrete approaches.