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

101201302402 · Jun 202019922001200920172026
48 results for numerical dimension

This work is an analytical and numerical study of the composition of several fractals into one and of the relation between the composite dimension and the dimensions of the component fractals. In the case of composition of standard IFS with segments of equal size, the composite dimension can be expressed as a function …

2014-07-10abs ↗pdf ↗

Let XX be a compact connected strongly pseudoconvex CRCR manifold of real dimension 2n12n-1 in CN\mathbb{C}^{N}. For n3n\ge 3, Yau solved the complex Plateau problem of hypersurface type by checking a bunch of Kohn-Rossi cohomology groups in 1981. In this paper, we generalize Yau's conjecture on some numerical invarian…

2017-12-07abs ↗pdf ↗

Analyzes Kodaira-Iitaka dimension and multiplicity using intersection theory.

problem Understanding Kodaira-Iitaka dimension and multiplicity in analytic terms.
method Expresses dimensions and multiplicity in terms of intersection theory of plurisubharmonic envelopes.
result Introduces non-pluripolar numerical Kodaira-Iitaka dimension and shows it dominates the classical dimension.

We investigate the secant dimensions and the identifiablity of flag varieties parametrizing flag of sub vector spaces of a fixed vector space. We give numerical conditions ensuring that secant varieties of flag varieties have the expected dimension, and that a general point on these secant varieties is identifiable.

2019-12-02abs ↗pdf ↗

A new method optimizes Fourier pricing for multi-asset options using adaptive quadrature.

problem Efficiently pricing multi-asset options in Lévy models.
method Optimized damping parameters and hierarchical adaptive quadrature.
result Significant speed-up in computational time for up to six dimensions.

Criterion for solvability of complex 2-Hessian equation on compact Kähler manifolds.

problem Solvability of complex 2-Hessian equation on compact Kähler manifolds.
method Nakai--Moishezon-type criterion associated with the complex 2-Hessian equation.
result Criterion equivalent to existence of a smooth 2-admissible representative in complex dimension three.

Unified method for calculating financial option prices from characteristic functions.

problem Calculating financial option prices from characteristic functions in high dimensions.
method Damped Fourier-cosine expansion (COS) method.
result The method converges exponentially if the characteristic function decays exponentially.

We provide notions of numerical effectiveness and numerical flatness for Higgs vector bundles on compact Kähler manifolds in terms of fibre metrics. We prove several properties of bundles satisfying such conditions and in particular we show that numerically flat Higgs bundles have vanishing Chern classes, and that they…

2006-05-25abs ↗pdf ↗

Two types of nonvanishing results are presented for compact Kähler varieties.

problem Deriving geometric consequences from numerical information in Kähler geometry.
method Analyzing non-uniruled varieties and hyperkähler manifolds to establish nonvanishing results for adjoint and nef bundles.
result Strong abundance-type results are obtained in dimension 4.

A numerical expression in the form of an integral is given for the determinant of the scalar GJMS operator on an odd--dimensional sphere. Manipulation yields a curious sum formula for the logdet in terms of the logdets of the ordinary conformal Laplacian for other dimensions. A few graphs are drawn.

2013-09-11abs ↗pdf ↗

Invariant kernels reduce rank and improve generalization across dimensions.

problem Symmetry in high-dimensional data impacts kernel matrix rank and learning algorithms.
method Compute invariant polynomial kernel ranks under various groups acting on data.
result Symmetry decreases kernel rank, making it independent of data dimension.

Study on elasticity with mixed boundary conditions, proving spectral asymptotics.

problem Analyzing spectral asymptotics for linear elasticity with mixed boundary conditions.
method Established two-term spectral asymptotics for linear elasticity on smooth compact manifolds.
result Verification of general formulae through explicit examples in 2D and 3D.

This work improves scalability of Wasserstein distances in high dimensions.

problem Scalability issues in computing Wasserstein distances in high dimensions.
method Empirical convergence rates, robustness to data contamination, and computational methods.
result Established fast rates and robust estimation risks for sliced Wasserstein distances.

Study identifies numerical signs of blow-up in hydrodynamic equations.

problem Determining if numerical results of blow-up are genuine or artifacts.
method Geometrically consistent spatiotemporal discretization of complexified Euler equations.
result Identification of a signature based on supremum norm growth rates of vorticity.

Study geometric manifolds in arbitrary dimensions, focusing on maps and diffeomorphisms.

problem Existence and properties of maps and diffeomorphisms in geometric manifolds.
method Analysis of geometric structures and homotopy invariants in arbitrary dimensions.
result Existence of Anosov diffeomorphisms and monotonicity of homotopy invariants.

Enhances SDR via Hellinger correlation for better data dependency understanding.

problem Improving sufficient dimension reduction in single-index models.
method Developed a new method using Hellinger correlation for detecting the dimension reduction subspace.
result Significantly enhances and outperforms existing SDR methods through deeper data dependency understanding.

Paper proposes a new clustering model that preserves cluster recovery with fewer dimensions.

problem Clustering high-dimensional data with limited embedding dimensions.
method Randomly projected convex clustering model with improved embedding dimension.
result Cluster recovery can be preserved with fewer dimensions, independent of data points.

The paper studies the dimension of limit sets using variational principles and stationary measures.

problem Calculating the Hausdorff dimension of limit sets of Anosov representations and the Rauzy gasket.
method Established variational principles for affinity exponents and Rauzy gaskets, combined with dimension formulas of stationary measures.
result Yields the equality between the Hausdorff dimensions and affinity exponents in both settings.

We review properties of affine special Kaehler structures focusing on singularities of such structures in the simplest case of real dimension two. We describe all possible isolated singularities and compute the monodromy of the flat symplectic connection, which is a part of a special Kaehler structure, near a singulari…

2017-10-14abs ↗pdf ↗

A new method reduces high-dimensional parameter spaces for faster numerical tasks.

problem Efficiently reducing high-dimensional parameter spaces for numerical tasks.
method Local Active Subspaces (LAS) combining active subspaces with clustering techniques.
result Significant speed-up in numerical tasks through efficient dimension reduction.

Loss functions with a large number of saddle points are one of the major obstacles for training modern machine learning models efficiently. First-order methods such as gradient descent are usually the methods of choice for training machine learning models. However, these methods converge to saddle points for certain ch…

2019-01-21abs ↗pdf ↗

A simple spin system is constructed to simulate dynamics of asset prices and studied numerically. The outcome for the distribution of prices is shown to depend both on the dimension of the system and the introduction of price into the link measure. For dimensions below 2, the associated risk is high and the price distr…

2014-08-01abs ↗pdf ↗

In many fields of science, high-dimensional integration is required. Numerical methods have been developed to evaluate these complex integrals. We introduce the code i-flow, a python package that performs high-dimensional numerical integration utilizing normalizing flows. Normalizing flows are machine-learned, bijectiv…

2020-01-15abs ↗pdf ↗