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

Trend · papers per month

3979118157 · Jun 202019922001200920172026
48 results for Terminating Laplace sequences

Circular nets with spherical parameter lines have geometric properties related to Darboux cyclides and terminating Laplace sequences.

problem Discretizing surfaces with spherical curvature lines.
method Lie-geometric discretisation in terms of principal contact element nets.
result Circular nets with two families of spherical parameter lines are related to Darboux cyclides.

The paper proves conditions for Darboux integrability in diagonal hydrodynamic systems.

problem Conditions for Darboux integrability in diagonal hydrodynamic systems.
method Proof of conditions using Laplace transformation sequences and geometric interpretations.
result Diagonal systems of hydrodynamic type are Darboux integrable if and only if the corresponding systems for commuting flows are Darboux integrable.

We define a discrete Laplace-Beltrami operator for simplicial surfaces. It depends only on the intrinsic geometry of the surface and its edge weights are positive. Our Laplace operator is similar to the well known finite-elements Laplacian (the so called ``cotan formula'') except that it is based on the intrinsic Delau…

2005-03-11abs ↗pdf ↗

We study discrete conjugate nets whose Laplace sequence is of period four. Corresponding points of opposite nets in this cyclic sequence have equal osculating planes in different net directions, that is, they correspond in an asymptotic transformation. We show that this implies that the connecting lines of correspondin…

2011-04-19abs ↗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.

We develop an option pricing model based on a tug-of-war game. This two-player zero-sum stochastic differential game is formulated in the context of a multi-dimensional financial market. The issuer and the holder try to manipulate asset price processes in order to minimize and maximize the expected discounted reward. W…

2014-10-07abs ↗pdf ↗

The Dirichlet eigenvalues of the Laplace-Beltrami operator are larger on an annulus than on any other surface of revolution in R3\mathbb{R}^3 with the same boundary. This is established by defining a sequence of shrinking cylinders about the axis of symmetry and proving that flattening a surface outside of each cylinde…

2015-10-07abs ↗pdf ↗

In this paper we develop the theory of Willmore sequences for Willmore surfaces in the 4-sphere. We show that under appropriate conditions this sequence has to terminate. In this case the Willmore surface either is the twistor projection of a holomorphic curve into complex projective space or the inversion of a minimal…

2006-10-21abs ↗pdf ↗

Study of line congruences for Appell's rank-4 hypergeometric functions.

problem Understanding line congruences for Appell's rank-4 hypergeometric functions.
method Derived original formulae for Laplace transform of rank-4 system, applied to geometry of surfaces defined by these functions.
result Natural line congruences for Laplace transforms of Appell's rank-4 functions form a W-congruence.

Study eigenvalues and shapes, proving sharp inequalities for Steklov eigenvalues.

problem Eigenvalue continuity and shape optimization for Laplace and Steklov problems.
method Variational eigenvalue analysis, Sobolev space convergence, shape optimization techniques.
result Sharp isoperimetric inequalities for Steklov eigenvalues, upper bound 8πk8\pi k for kk-th perimeter-normalized eigenvalue.

Develops a method for causal inference in recurrent event data with terminal failure.

problem Causal inference in recurrent event data with a terminal event.
method Multiply robust estimation framework for causal inference.
result Proposes an estimator for the expected number of recurrent events and failure survival function.

We study the spectral functions, and in particular the zeta function, associated to a class of sequences of complex numbers, called of spectral type. We investigate the decomposability of the zeta function associated to a double sequence with respect to some simple sequence, and we provide a technique for obtaining the…

2006-07-31abs ↗pdf ↗

In the continuous time mean-variance model, we want to minimize the variance (risk) of the investment portfolio with a given mean at terminal time. However, the investor can stop the investment plan at any time before the terminal time. To solve this kind of problem, we consider to minimize the variances of the investm…

2019-12-04abs ↗pdf ↗

We introduce a new class of reinforcement learning methods referred to as {\em episodic multi-armed bandits} (eMAB). In eMAB the learner proceeds in {\em episodes}, each composed of several {\em steps}, in which it chooses an action and observes a feedback signal. Moreover, in each step, it can take a special action, c…

2015-08-04abs ↗pdf ↗

Study approximates sub-Riemannian structures with Riemannian metrics and analyzes spectral convergence.

problem Approximating sub-Riemannian structures for analysis.
method Constructing Riemannian metrics tailored to sub-Riemannian structures and studying spectral convergence.
result Riemannian volumes converge to Popp's volume and spectral convergence of Laplace operators is studied.

Study two types of singular Kähler-Einstein metrics on complex varieties.

problem Understanding different types of singular Kähler-Einstein metrics.
method Analyzing Ricci flat Kähler cone metrics and applying to more general spaces.
result A weaker notion of singular Kähler-Einstein metrics is equivalent to a stronger one under certain conditions.

Bayesian context trees capture complex dependencies in categorical sequences.

problem Complex, long-range dependencies in categorical sequences are not well captured by simple models.
method Parsimonious Bayesian context trees with model-based agglomerative clustering for efficient inference.
result The proposed framework outperforms existing models on real-world data.

Let (M,g)(M,g) be a connected, closed, orientable Riemannian surface and denote by λk(M,g)λ_k(M,g) the kk-th eigenvalue of the Laplace-Beltrami operator on (M,g)(M,g). In this paper, we consider the mapping (M,g)λk(M,g)(M, g)\mapsto λ_k(M,g). We propose a computational method for finding the conformal spectrum Λkc(M,[g0])Λ^c_k(M,[g_0]), which is d…

2014-05-20abs ↗pdf ↗

We propose a framework to study the optimal liquidation strategy in a limit order book for large-tick stocks, with spread equal to one tick. All order book events (market orders, limit orders and cancellations) occur according to independent Poisson processes, with parameters depending on price move directions. Our goa…

2017-01-05abs ↗pdf ↗

This manuscript studies manifolds-with-boundary collapsing in the Gromov-Hausdorff topology. The main aim is an understanding of the relationship of the topology and geometry of a limiting sequence of manifolds-with-boundary to that of a limit space, which is presumed to be without geodesic terminals. The main result e…

2007-11-21abs ↗pdf ↗

In this paper, we obtain stability results for martingale representations in a very general framework. More specifically, we consider a sequence of martingales each adapted to its own filtration, and a sequence of random variables measurable with respect to those filtrations. We assume that the terminal values of the m…

2018-06-04abs ↗pdf ↗

Recurrent models can produce infinite sequences, causing bias; new methods prevent this.

problem Inconsistency in decoding infinite-length sequences from recurrent language models.
method Defined and proved inconsistency of common decoding algorithms; proposed remedies.
result Proposed methods prevent inconsistency in practice.

We approximate the spectral data (eigenvalues and eigenfunctions) of compact Riemannian manifold by the spectral data of a sequence of (computable) discrete Laplace operators associated to some graphs immersed in the manifold. We give an upper bound on the error that depends on upper bounds on the diameter and the sect…

2013-01-16abs ↗pdf ↗

A new method optimizes neural sequence models for better task performance.

problem Training neural sequence models with maximum likelihood estimation ignores task losses.
method Maximum likelihood guided parameter search (MGS) in the parameter space.
result MGS optimizes sequence-level losses, reducing repetition and non-termination.

We consider the space KR(n,F) of Kahler-Ricci solitons on n-dimensional Fano manifolds with Futaki invariant bounded by F. We prove a partial C^0 estimate for KR(n,F) as a generalization of the recent work of Donaldson-Sun for Fano Kahler-Einstein manifolds. In particular, any sequence in KR(n,F) has a convergent sub…

2012-11-26abs ↗pdf ↗

In this short paper, we improve the result of Phong-Song-Sturm on degeneration of Fano Kähler-Ricci solitons by removing the assumption on the uniform bound of the Futaki invariant. Let KR(n)\mathcal{KR}(n) be the space of Kähler-Ricci solitons on nn-dimensional Fano manifolds. We show that after passing to a subsequence…

2018-05-08abs ↗pdf ↗

Graph Shift (GS) algorithms are recently focused as a promising approach for discovering dense subgraphs in noisy data. However, there are no theoretical foundations for proving the convergence of the GS Algorithm. In this paper, we propose a generic theoretical framework consisting of three key GS components: simplex …

2013-06-13abs ↗pdf ↗

To improve the efficient frontier of the classical mean-variance model in continuous time, we propose a varying terminal time mean-variance model with a constraint on the mean value of the portfolio asset, which moves with the varying terminal time. Using the embedding technique from stochastic optimal control in conti…

2019-09-28abs ↗pdf ↗

We work with a generalization of knot theory, in which one diagram is reachable from another via a finite sequence of moves if a fixed condition, regarding the existence of certain morphisms in an associated category, is satisfied for every move of the sequence. This conditional setting leads to a possibility of irreve…

2013-12-31abs ↗pdf ↗

Study improves regularity estimates for harmonic maps into ellipsoids.

problem Independence of regularity estimates on harmonic maps with varying target dimensions.
method Analyzes harmonic maps into ellipsoids, uses Palais-Smale sequences, and critical metrics.
result Enhanced regularity estimates for Laplace harmonic eigenmaps.

In this work, we consider the problem of autonomously discovering behavioral abstractions, or options, for reinforcement learning agents. We propose an algorithm that focuses on the termination condition, as opposed to -- as is common -- the policy. The termination condition is usually trained to optimize a control obj…

2019-02-26abs ↗pdf ↗

Bayesian framework for sphere regression using Gaussian fields.

problem Nonparametric regression on the sphere with Gaussian priors.
method Isotropic Gaussian field priors, harmonic structure, exact posterior distributions, optimal spectral truncation, posterior contraction rates.
result Sharp posterior contraction rates for Gaussian priors with polynomially decaying angular power spectra.

The paper analyzes network models with binary values and sub-Gamma noise, deriving asymptotic properties.

problem Analyzing network models with binary values and sub-Gamma noise.
method Derives asymptotic properties of network models with binary values and sub-Gamma noise.
result Established asymptotic consistency and normality of parameter estimators in network models.

We study a maturity randomization technique for approximating optimal control problems. The algorithm is based on a sequence of control problems with random terminal horizon which converges to the original one. This is a generalization of the so-called Canadization procedure suggested by Carr [Review of Financial Studi…

2006-02-21abs ↗pdf ↗

This paper investigates the problem of determining a binary-valued function through a sequence of strategically selected queries. The focus is an algorithm called Generalized Binary Search (GBS). GBS is a well-known greedy algorithm for determining a binary-valued function through a sequence of strategically selected q…

2009-10-22abs ↗pdf ↗