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

20416181 · Jun 202619922001200920172026
48 results for Summation formula

We prove an explicit formula of the Berezin star product on Kaehler manifolds. The formula is expressed as a summation over certain strongly connected digraphs. The proof relies on a combinatorial interpretation of Englis' work on the asymptotic expansion of the Laplace integral.

2011-03-21abs ↗pdf ↗

For an eigenfunction of the Laplacian on a hyperbolic Riemann surface, the coefficients of the Fourier expansion are described as intertwining functionals. All intertwiners are classified. A refined growth estimate for the coefficients is given and a summation formula is proved.

2006-07-11abs ↗pdf ↗

Quantum dilogarithm function proven from a linear difference equation.

problem Proving Faddeev's quantum dilogarithm from a linear difference equation.
method Proved Faddeev's quantum dilogarithm using Borel summation of a formal power series solution of a linear difference equation.
result Borel summation of a formal power series solution produces Faddeev's quantum dilogarithm.

The study shows how certain ODEs and integrals are regular under Borel summation.

problem Analyzing the regularity of solutions to ODEs and integration problems.
method Using geometric perspective on Laplace and Borel transforms, the study examines level 1 ODEs and exponential period integrals over Lefschetz thimbles.
result Solutions of certain ODEs and integration problems are Borel regular.

New techniques prove quantum modularity for various functions.

problem Proving quantum modularity of false theta functions and related series.
method Developed techniques including Poisson summation formula and modular series framework.
result Unified approach to proving quantum modularity for various functions.

In recent work, Cheu et al. (Eurocrypt 2019) proposed a protocol for nn-party real summation in the shuffle model of differential privacy with Oε,δ(1)O_{ε, δ}(1) error and Θ(εn)Θ(ε\sqrt{n}) one-bit messages per party. In contrast, every local model protocol for real summation must incur error Ω(1/n)Ω(1/\sqrt{n}), and there exist …

2019-06-20abs ↗pdf ↗

In this paper we will study the statistics of the unit geodesic flow normal to the boundary of a hyperbolic manifold with non-empty totally geodesic boundary. Viewing the time it takes this flow to hit the boundary as a random variable, we derive a formula for its moments in terms of the orthospectrum. The first moment…

2013-03-26abs ↗pdf ↗

We extend knot Floer homology to string links in D^{2} \times I and to d-based links in arbitrary three manifolds, without any hypothesis on the null-homology of the components. As for knot Floer homology we obtain a description of the Euler characteristic of the resulting homology groups (in D^{2} \times I) in terms o…

2006-07-10abs ↗pdf ↗

Mathematical structures link Gromov-Witten to Donaldson-Thomas invariants.

problem Understanding non-perturbative topological string theory.
method Borel summation of Gromov-Witten potential and analysis of Stokes phenomena.
result Stokes phenomena encode Donaldson-Thomas invariants of the resolved conifold.

Improved greedy 2-coordinate updates for optimization problems with constraints.

problem Minimizing smooth functions subject to constraints.
method Exploiting a connection to steepest descent in the 1-norm, we give faster convergence rates and efficient computation.
result Greedy selection converges faster than random selection and can be computed in O(nlogn)O(n \log n) time.

Stochastic gradient descent updates parameters with summation gradient computed from a random data batch. This summation will lead to unbalanced training process if the data we obtained is unbalanced. To address this issue, this paper takes the error variance and error mean both into consideration. The adaptively adjus…

2018-11-20abs ↗pdf ↗

This paper presents a deep learning method for faster magnetic resonance imaging (MRI) by reducing k-space data with sub-Nyquist sampling strategies and provides a rationale for why the proposed approach works well. Uniform subsampling is used in the time-consuming phase-encoding direction to capture high-resolution im…

2017-09-08abs ↗pdf ↗

Kernel density estimation (KDE) is a popular statistical technique for estimating the underlying density distribution with minimal assumptions. Although they can be shown to achieve asymptotic estimation optimality for any input distribution, cross-validating for an optimal parameter requires significant computation do…

2011-02-14abs ↗pdf ↗

In the present paper the electrostatic of charges in non rotating BTZ black hole and wormhole space times is studied. In particular, the self force of a point charge in the geometry is characterized analitically. The differences between the self force in both cases is a theoretical experiment for distinguishing both ge…

2014-08-04abs ↗pdf ↗

We provide faster algorithms for the problem of Gaussian summation, which occurs in many machine learning methods. We develop two new extensions - an O(Dp) Taylor expansion for the Gaussian kernel with rigorous error bounds and a new error control scheme integrating any arbitrary approximation method - within the best …

2012-06-27abs ↗pdf ↗

New sigma models compute graviton scattering amplitudes from quaternionic geometry.

problem Computing graviton scattering amplitudes from quaternionic geometry.
method Introducing new twistor sigma models that encode finite non-linear perturbations of flat structures.
result Provides a first-principles derivation of Hodges' formula for MHV graviton amplitudes.

We study the length, weak length and complex length spectrum of closed geodesics of a compact flat Riemannian manifold, comparing length-isospectrality with isospectrality of the Laplacian acting on p-forms. Using integral roots of the Krawtchouk polynomials, we give many pairs of p-isospectral flat manifolds having di…

2001-10-31abs ↗pdf ↗

Finet uses FBN for efficient, lightweight neural networks.

problem Building efficient neural networks with limited computational resources.
method Introduces Fine-grained Batch Normalization (FBN) and a novel light-weight network (Finet) that combines FBN with standard convolution.
result Finet achieves state-of-the-art performance on ImageNet classification with reduced computational complexity.

The paper is concerned with the Kontsevich-Zagier formal power series f(q)=n=0(1q)...(1qn) f(q)=\sum_{n=0}^\infty (1-q)... (1-q^n) and its analytic properties. To begin with, we give an explicit formula for the Borel transform of the associated formal power series F(x)=e1/(24x)f(e1/x)F(x)=e^{-1/(24x)}f(e^{-1/x}) from which its analytic continuation, i…

2006-09-21abs ↗pdf ↗

We consider an elliptic self-adjoint first order pseudodifferential operator acting on columns of m complex-valued half-densities over a connected compact n-dimensional manifold without boundary. The eigenvalues of the principal symbol are assumed to be simple but no assumptions are made on their sign, so the operator …

2012-04-30abs ↗pdf ↗

We consider an elliptic self-adjoint first order differential operator acting on pairs (2-columns) of complex-valued half-densities over a connected compact 3-dimensional manifold without boundary. The principal symbol of our operator is assumed to be trace-free. We study the spectral function which is the sum of squar…

2012-09-16abs ↗pdf ↗

Quantum algorithms improve calculation of parameter sensitivities in financial derivatives.

problem Calculating derivatives of expected values with respect to parameters in stochastic models.
method Two quantum methods based on QMCI and central difference formula.
result Sum-in-QAE method can be more advantageous for nonsmooth functions or limited qubits.

In this paper, we study some vanishing identities for Gromov-Witten invariants conjectured by K. Liu and H. Xu. We will prove these conjectures in the case that the summation range is large compare to genus. In fact, in such cases, we can obtain a vanishing identity which is stronger than their conjectures. Moreover we…

2008-05-06abs ↗pdf ↗

We rewrite the recently proposed differential expansion formula for HOMFLY polynomials of the knot 414_1 in arbitrary rectangular representation R=[rs]R=[r^s] as a sum over all Young sub-diagrams λλ of RR with extraordinary simple coefficients Dλtr(r)Dλ(s)D_{λ^{tr}}(r)\cdot D_λ(s) in front of the ZZ-factors. Somewhat miraculously…

2016-09-01abs ↗pdf ↗

This paper is an introduction to Khovanov homology, starting with the Kauffman bracket state summation, emphasizing the Bar-Natan Canopoloy and tangle cobordism approach. The paper discusses a simplicial approach to Khovanov homology and a quantum model for it so that the graded Euler characteristic that produces the J…

2011-07-07abs ↗pdf ↗

We study the forecasting of the power consumptions of a population of households and of subpopulations thereof. These subpopulations are built according to location, to exogenous information and/or to profiles we determined from historical households consumption time series. Thus, we aim to forecast the electricity con…

2020-03-01abs ↗pdf ↗

This paper solves the open problem of computing Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.

problem Computing the Bayes optimal prediction for decision trees is infeasible due to an infeasible summation over all division patterns of a feature space.
method Solved the open problem using a Markov chain Monte Carlo method with adaptively tuned step size.
result Computed the Bayes optimal prediction for decision trees using a Markov chain Monte Carlo method.

The paper tackles non-cumulative objectives in reinforcement learning and proposes modifications to existing algorithms.

problem Optimizing objectives that are not naturally expressed as summations of rewards in various fields.
method The paper modifies the Bellman optimality equation to handle non-cumulative objectives by replacing summation with a generalized operation.
result The modified Bellman updates can converge to the globally optimal solution under certain conditions.

Improves accuracy of SMCI estimators without expanding sum regions.

problem Intractable multiple summations in evaluating expectations on the Ising model.
method Combining multiple SMCI estimators using generalized least squares (GLS).
result The proposed method can improve accuracy without combinatorial explosion.

F. Jaeger presented the two-variable Kauffman polynomial of an unoriented link L as a weighted sum of HOMFLY-PT polynomials of oriented links associated with L. Murakami, Ohtsuki and Yamada (MOY) used planar graphs and a recursive evaluation of these graphs to construct a state model for the sl(n)-link invariant (a one…

2013-04-17abs ↗pdf ↗