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

4692138184 · May 202619922001200920172026
48 results for log covers

The paper studies orbifold splice quotients and log covers of surface pairs.

problem Understanding orbifold splice quotients and log covers of surface pairs.
method Analyzes orbifold homology and constructs pairs with universal abelian log covers.
result Computes orbifold homology from resolutions and constructs orbifold splice quotients.

The study finds effective lower bounds for spectra of random surfaces and bundles.

problem Determining the spectrum of Laplacian on random surfaces and bundles.
method Analysis of random covering surfaces and unitary bundles over finite-area non-compact hyperbolic surfaces.
result With high probability, the spectrum of random surfaces and bundles has no eigenvalues below a certain threshold.

Study geometric properties of log Calabi-Yau manifolds, focusing on Fano manifolds with smooth or two proportional components.

problem Geometric properties of log Calabi-Yau manifolds in two specific cases.
method Analysis of various geometric properties, focusing on Bochner principle, local triviality, polystability, and compactifiability of universal cover.
result The universal cover of XDX\setminus D is a Calabi-Yau manifold of infinite topological type when DD has two components.

We show relationships between uniform K-stability and plt blowups of log Fano pairs. We see that it is enough to evaluate certain invariants defined by volume functions for all plt blowups in order to test uniform K-stability of log Fano pairs. We also discuss the uniform K-stability of two log Fano pairs under crepant…

2017-01-01abs ↗pdf ↗

New SGD covering technique yields dimension-independent generalization bounds.

problem Generalization of stochastic gradient descent in non-convex, non-smooth settings.
method Localized ε-covers for SGD trajectories, showing dimension-independent complexity.
result Generalization error upper bounded by O((lognlog(nP))/n)O(\sqrt{(\log n\log(nP))/n}).

Using stable log maps, we introduce log twisted differentials extending the notion of abelian differentials to the Deligne-Mumford boundary of stable curves. The moduli stack of log twisted differentials provides a compactification of the strata of abelian differentials. The open strata can have up to three connected c…

2016-10-17abs ↗pdf ↗

Equivalence proven between divisorial stability and quotient log divisorial stability.

problem Equivalence of divisorial stability and log divisorial stability under finite group actions.
method Interpolation technique and equivariant divisorial stability construction.
result Equivariant divisorial stability of a polarized variety is equivalent to log divisorial stability of its quotient.

The paper improves transformer generalization bounds using rank-dependent covering number bounds.

problem Improving generalization bounds for transformers.
method Introducing rank-dependent covering number bounds for linear function classes and applying them to transformers.
result Generalization error bounds for transformers decay as O(1/n)O(1/\sqrt{n}) and O(logrw)O(\log r_w), improving existing bounds.

This paper examines Bachelier implied volatility at extreme strikes.

problem Investigates appropriate implied volatility extrapolation at extreme strikes.
method Compares Bachelier and Black-Scholes models, focusing on normal distribution and vanilla options.
result Bachelier implied variance grows at most linearly in log-moneyness, similar to Black-Scholes.

Let T(x,r) denote the first hitting time of the disc of radius r centered at x for Brownian motion on the two dimensional torus. We prove that sup_{x} T(x,r)/|log r|^2 --> 2/pi as r --> 0. The same applies to Brownian motion on any smooth, compact connected, two-dimensional, Riemannian manifold with unit area and no bo…

2001-07-26abs ↗pdf ↗

A log symplectic manifold is a Poisson manifold which is generically nondegenerate. We develop two methods for constructing the symplectic groupoids of log symplectic manifolds. The first is a blow-up construction, corresponding to the notion of an elementary modification of a Lie algebroid along a subalgebroid. The se…

2012-06-16abs ↗pdf ↗

The paper explores the shape of filling-systole subspace in surface moduli space and critical points of systole function.

problem Understanding the structure and critical points of the filling-systole subspace in surface moduli space.
method Analyzing Teichmüller and Weil-Petersson distances to determine the proximity of points to the subspace.
result Most points in Mg\mathcal{M}_g are within a specific Teichmüller distance from XgX_g and have a certain distance from the thick part of Mg\mathcal{M}_g.

We prove that on a closed, orientable surface of genus gg, a set of simple loops with the property that no two are homotopic or intersect in more than kk points has cardinality kgk+1logg\lesssim_k g^{k+1} \log g. The bound matches the size of the largest known construction to within a factor of klogg\sim_k \log g. It generaliz…

2018-11-04abs ↗pdf ↗

A translation structure equips a Riemann surface with a singular flat metric. Not much is known about the shape of a random translation surface. We compute an upper bound on the expected value of the covering radius of a translation surface in any stratum H_1(kappa). The covering radius of a translation surface is the …

2018-09-27abs ↗pdf ↗

The paper tightens bounds on covering numbers for deep ReLU networks.

problem Characterizing the capacity and performance of deep ReLU networks.
method Derives tight lower and upper bounds on metric entropy of ReLU networks.
result Establishes optimality in nonparametric regression via deep networks.

The paper uses Tannakian reconstruction to understand hyperbolic log-orbi curves.

problem Understanding the structure of hyperbolic log-orbi curves.
method Formulates hyperbolic uniformization as a Tannakian reconstruction theorem and constructs a canonical maximal parahoric PSL2-Higgs object.
result Reconstructs the absolute Galois group of a one-variable complex function field as the inverse limit of etale fundamental groups of orbifold models.

The paper proposes a new method for clustering survival data using smoothed log-hazard trajectories.

problem Clustering survival data based on instantaneous risk dynamics.
method Functional Principal Component Analysis applied to B-spline smoothed log-hazard trajectories.
result The proposed method provides an interpretable representation of relative temporal risk dynamics.

The paper classifies certain singular projective varieties with specific properties.

problem Classifying projective klt pairs with nef anti-log canonical divisors.
method Establishes a structure theorem using locally trivial rationally connected fibrations.
result Projective klt pairs can be decomposed into rationally connected and Calabi-Yau varieties.

In this paper we prove that, for any arithmetic hyperbolic nn-manifold MM of the first type, the systole of most of the principal congruence coverings MIM_{I} satisfy sys1(MI)8n(n+1)log(vol(MI))c,sys_{1}(M_{I})\geq \frac{8}{n(n+1)}\log(vol(M_{I}))-c, where cc is a constant independent of II. This generalizes previous work of Buser and Sarn…

2016-10-12abs ↗pdf ↗

We investigate the geometry of π1π_1-injective surfaces in closed hyperbolic 3-manifolds. First we prove that for any e>0e>0, if the manifold MM has sufficiently large systole $\sys_1(M)$, the genus of any such surface in MM is bounded below by $\exp((1/2-e)\sys_1(M))$. Using this result we show, in particular, that f…

2012-05-23abs ↗pdf ↗

The paper analyzes log-optimal portfolios in markets with random time events.

problem Analyzing log-optimal portfolios in markets with random events.
method Examined a market model with two information flows, F and G, and addressed log-optimal portfolio existence and sensitivity.
result Identified necessary and sufficient conditions for log-optimal portfolio existence, types of risks induced by random time, and factors affecting sensitivity.

Study shows offline RL with partial coverage and weak function classes is possible.

problem Learning optimal policies from logged data with function approximation.
method Marginalized Importance Sampling (MIS) with additional covering distribution.
result Finite-sample guarantees for sample-efficient offline RL for general MDPs.

Improved Langevin algorithms with prior diffusion achieve dimension-independent convergence for non-log-concave distributions.

problem Understanding the dimension dependency of computational complexity in high-dimensional sampling.
method Investigation of prior diffusion technique for log-Sobolev inequality target distributions.
result Modified Langevin algorithm achieves dimension-independent KL divergence convergence.

We provide a differentially private algorithm for hypothesis selection. Given samples from an unknown probability distribution PP and a set of mm probability distributions H\mathcal{H}, the goal is to output, in a ε\varepsilon-differentially private manner, a distribution from H\mathcal{H} whose total variation di…

2019-05-30abs ↗pdf ↗

Generative Adversarial Networks (GANs) can achieve state-of-the-art sample quality in generative modelling tasks but suffer from the mode collapse problem. Variational Autoencoders (VAE) on the other hand explicitly maximize a reconstruction-based data log-likelihood forcing it to cover all modes, but suffer from poore…

2019-09-27abs ↗pdf ↗

Discrete time analogues of ergodic stochastic differential equations (SDEs) are one of the most popular and flexible tools for sampling high-dimensional probability measures. Non-asymptotic analysis in the L2L^2 Wasserstein distance of sampling algorithms based on Euler discretisations of SDEs has been recently develop…

2018-08-21abs ↗pdf ↗

We discuss the asymptotic lower bound on the inner radius of nodal domains that arise from Laplacian eigenfunctions φλ φ_λ on a closed Riemannian manifold (M,g) (M,g) . First, in the real-analytic case we present an improvement of the currently best known bounds, due to Mangoubi (\cite{Man1}). Furthermore, using recent re…

2016-07-13abs ↗pdf ↗

New method uses higher-order Langevin dynamics for efficient parallel sampling.

problem Efficient parallel sampling from high-dimensional log-concave distributions.
method Combines higher-order Langevin dynamics with blockwise Lagrange polynomial interpolation.
result Reduces the number of parallel points required for a target accuracy.

We study the problem of reconstructing an unknown matrix M of rank r and dimension d using O(rd poly log d) Pauli measurements. This has applications in quantum state tomography, and is a non-commutative analogue of a well-known problem in compressed sensing: recovering a sparse vector from a few of its Fourier coeffic…

2011-03-14abs ↗pdf ↗

New insights show coverage conditions are crucial for efficient online reinforcement learning.

problem The role of coverage conditions in determining sample complexity of offline reinforcement learning.
method Established a connection between coverage conditions and sample efficiency in online reinforcement learning.
result Coverability, a structural property of MDPs, enables sample-efficient exploration in online reinforcement learning.

Onflow optimizes portfolio allocation with gradient flows, robust to transaction fees.

problem Optimizing portfolio allocation with transaction costs.
method Gradient flow reinforcement learning method for dynamic asset allocation.
result Onflow outperforms benchmarks in high transaction cost regimes.

Study minimax regret in sequential probability assignment with and without side information.

problem Minimax regret analysis in sequential probability assignment.
method Upper and lower bounds on minimax regret using square-root entropy.
result Lower bound matches upper bound for Donsker classes, up to log factors.

The paper studies positivity properties of cotangent bundles in complex hyperbolic manifolds with cusps.

problem Positivity properties of cotangent bundles in complex hyperbolic manifolds with cusps.
method Analyzes intrinsic positivity properties of cotangent bundles using toroidal compactifications and ample line bundles.
result The cotangent bundle is ample modulo the boundary divisor for sufficiently small rational numbers.