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.
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…
In this paper, we study a class of Finsler metrics called general (α,β)-metrics, which are defined by a Riemannian metric α and a 1-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…
Multiple hypothesis testing is a core problem in statistical inference and arises in almost every scientific field. Given a set of null hypotheses H(n)=(H1,…,Hn), Benjamini and Hochberg introduced the false discovery rate (FDR), which is the expected proportion of false positives among rejected nu…
We study the problem of optimal trading using general alpha predictors with linear costs and temporary impact. We do this within the framework of stochastic optimization with finite horizon using both limit and market orders. Consistently with other studies, we find that the presence of linear costs induces a no-tradin…
In the online multiple testing problem, p-values corresponding to different null hypotheses are observed one by one, and the decision of whether or not to reject the current hypothesis must be made immediately, after which the next p-value is observed. Alpha-investing algorithms to control the false discovery rate (FDR…
It was proved in 1998 by Ben-David and Litman that a concept space has a sample compression scheme of size d if and only if every finite subspace has a sample compression scheme of size d. In the compactness theorem, measurability of the hypotheses of the created sample compression scheme is not guaranteed; at the same…
Study evaluates UK CDC schemes, finding intergenerational cross-subsidies in flat-accrual schemes and dynamic-accrual schemes can reduce but not eliminate them.
problem Intergenerational cross-subsidies in UK CDC schemes, particularly in flat-accrual schemes.
method Comparison of flat-accrual and dynamic-accrual CDC schemes, analysis of performance and level of cross-subsidies.
result Dynamic-accrual schemes can reduce but not eliminate intergenerational cross-subsidies, while flat-accrual schemes often have significant cross-subsidies.
We study first-order optimization methods obtained by discretizing ordinary differential equations (ODEs) corresponding to Nesterov's accelerated gradient methods (NAGs) and Polyak's heavy-ball method. We consider three discretization schemes: an explicit Euler scheme, an implicit Euler scheme, and a symplectic scheme.…
In this paper we propose a new kind of high order numerical scheme for backward stochastic differential equations(BSDEs). Unlike the traditional θ-scheme, we reduce truncation errors by taking θ carefully for every subinterval according to the characteristics of integrands. We give error estimates of this nonlinear…
We extend the scheme developed in B. Düring, A. Pitkin, "High-order compact finite difference scheme for option pricing in stochastic volatility jump models", 2019, to the so-called stochastic volatility with contemporaneous jumps (SVCJ) model, derived by Duffie, Pan and Singleton. The performance of the scheme is asse…
In this paper we propose a generalized numerical scheme for backward stochastic differential equations(BSDEs). The scheme is based on approximation of derivatives via Lagrange interpolation. By changing the distribution of sample points used for interpolation, one can get various numerical schemes with different stabil…
A discretization scheme for nonnegative diffusion processes is proposed and the convergence of the corresponding sequence of approximate processes is proved using the martingale problem framework. Motivations for this scheme come typically from finance, especially for path-dependent option pricing. The scheme is simple…
In this paper, we propose an acceleration scheme for online memory-limited PCA methods. Our scheme converges to the first k>1 eigenvectors in a single data pass. We provide empirical convergence results of our scheme based on the spiked covariance model. Our scheme does not require any predefined parameters such as t…
In the present paper, we introduce a numerical scheme for the price of a barrier option when the price of the underlying follows a diffusion process. The numerical scheme is based on an extension of a static hedging formula of barrier options. For getting the static hedging formula, the underlying process needs to have…
We introduce (binary) Darboux transformation for general differential equation of the second order in two independent variables. We present a discrete version of the transformation for a 6-point difference scheme. The scheme is appropriate to solving a hyperbolic type initial-boundary value problem. We discuss several …
We present a new high-order compact scheme for the multi-dimensional Black-Scholes model with application to European Put options on a basket of two underlying assets. The scheme is second-order accurate in time and fourth-order accurate in space. Numerical examples confirm that a standard second-order finite differenc…