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

Trend · papers per month

13253850 · May 202619922001200920172026
48 results for Subexponential growth

We present a new, more elementary proof of the Freedman-Teichner result that the geometric classification techniques (surgery, s-cobordism, and pseudoisotopy) hold for topological 4-manifolds with groups of subexponential growth. In an appendix Freedman and Teichner give a correction to their original proof, and reform…

2000-01-11abs ↗pdf ↗

Study shows torsion grows subexponentially in book of I-bundles but can grow exponentially in non-regular covers.

problem Growth rates of torsion in book of I-bundles.
method Analysis of torsion in homology of book of I-bundles using finite-sheeted covers.
result Torsion growth rates differ between regular and non-regular finite-sheeted covers.

Graphs with bounded degrees and non-negative Ollivier-Ricci curvature have subexponential growth and diffusive random walk.

problem Understanding geometric properties of graphs with non-negative Ollivier-Ricci curvature.
method Analyzing the geometric properties of graphs with non-negative Ollivier-Ricci curvature, proving subexponential growth and diffusive random walk.
result For graphs with bounded degrees and non-negative Ollivier-Ricci curvature, the average log-volume growth and random walk displacement are subexponential.

Study on hyperbolic groups, focusing on separability and splittings.

problem Coarse separability and splittings in hyperbolic groups.
method Quantitative analysis of volume growth and cut-sets, focusing on thickened spheres.
result One-ended hyperbolic groups that are not virtually surface groups are coarsely separable by a subset of subexponential growth if and only if they split over a virtually cyclic subgroup.

We introduce a new quasi-isometry invariant $\subcorank X$ of a metric space XX called {\it subexponential corank}. A metric space XX has subexponential corank kk if roughly speaking there exists a continuous map g:XTg:X\to T such that for each tTt\in T the set g1(t)g^{-1}(t) has subexponential growth rate in XX and the…

2001-02-14abs ↗pdf ↗

New insights into natural exponential families improve regret bounds for bandit problems.

problem Improving regret bounds for bandit problems with subexponential tails.
method Proving self-concordance for natural exponential families and applying to bandits.
result Optimistic algorithms for generalized linear bandits have second-order regret bounds that are free of an exponential dependence on problem parameters.

The study classifies translating and self-expanding solitons in 3D space.

problem Characterizing the topology and index of solitons in mean curvature flow.
method Analyzing the spectrum and index of expanding and translating solitons in R3\mathbb{R}^3.
result Translating and self-expanding solitons have finite topology under certain conditions.

Growth of monetary assets and debts is commonly described by the formula of compound interest which for the case of continuous compounding is the exponential growth law. Its differential form is dc/dt = i c where dc/dt describes the rate of monetary growth, i the compounded interest rate and c the actual principal. Exp…

2012-04-30abs ↗pdf ↗

Study of linear classifiers in infinite imbalance scenarios.

problem Behavior of linear discriminant functions in extreme imbalance conditions.
method Analysis of linear classifiers under infinite imbalance, focusing on weight function properties and limit behavior.
result Limiting coefficient vectors reflect robustness or conservatism, optimizing against worst-case alternatives.

This is a sequel to the paper [Cas]. Here, we extend the methods of Farb-Wolfson using the theory of FI_G-modules to obtain stability of equivariant Galois representations of the etale cohomology of orbit configuration spaces. We establish subexponential bounds on the growth of unstable cohomology, and then use the Gro…

2017-03-21abs ↗pdf ↗

Let MmM^m be a minimal properly immersed submanifold in an ambient space close, in a suitable sense, to the space form Nkn\mathbb{N}^n_k of curvature k0-k\le 0. In this paper, we are interested in the relation between the density function Θ(r)Θ(r) of MmM^m and the spectrum of the Laplace-Beltrami operator. In particular, …

2014-07-20abs ↗pdf ↗

Study improves error bounds for sparse regression with heavy-tailed covariates.

problem Estimating sparse coefficients in linear regression with heavy-tailed covariates.
method Employed an 1\ell_1-penalized Huber regression method.
result Error bound identical to Gaussian case for LL-subexponential covariates.

We contribute to the arithmetic/topology dictionary by relating asymptotic point counts and arithmetic statistics over finite fields to homological stability and representation stability over $\Cb$ in the example of configuration spaces of nn points in smooth varieties. To do this, we import the method of homological …

2015-12-01abs ↗pdf ↗

To a knot in 3-space, one can associate a sequence of Laurent polynomials, whose nnth term is the nnth colored Jones polynomial. The Volume Conjecture for small angles states that the value of the nn-th colored Jones polynomial at $e^{\a/n}$ is a sequence of complex numbers that grows subexponentially, for a fixed s…

2005-03-28abs ↗pdf ↗

Single gradient step finds adversarial examples in random neural networks.

problem Finding adversarial examples in neural networks with random architectures.
method Gradient descent approach applied to random undercomplete and overcomplete two-layers neural networks.
result A single gradient step is sufficient to find adversarial examples in random neural networks.

Paper studies second order tail probabilities in risk models.

problem Analyzing tail probabilities in risk models with constant interest force.
method Asymptotic expansion and weighted Kesten-type inequality for second order subexponential random variables.
result Second order asymptotic formulae for continuous-time renewal risk models are derived.

Study of Alexander polynomials of torus knots and links, showing zeros equidistribute on unit circle.

problem Analyzing asymptotic behavior and distribution of zeros of Alexander polynomials of torus knots.
method Equidistribution analysis, moment sequence, Iwasawa theory, logarithmic Mahler measure.
result Zeros of Alexander polynomials of torus knots and links become equidistributed on the unit circle as p, q → ∞.

We address a long-standing and long-investigated problem in combinatorial topology, and break the exponential barrier for triangulations of real projective space, constructing a trianglation of RPn\mathbb{RP}^n of size e(12+o(1))nlogne^{(\frac{1}{2}+o(1))\sqrt{n}{\log n}}.

2020-09-06abs ↗pdf ↗

Estimates change point in high dimensional time series models.

problem Change point estimation in high dimensional time series.
method Plug-in least squares estimator with sufficient conditions for adaptivity.
result Optimal rate of convergence Op(ξ2)O_p(ξ^{-2}) in integer scale.

(Mn,g)(M^n,g) be a complete Riemannian manifold without conjugate points. In this paper, we show that if MM is also simply connected, then MM is flat, provided that MM is also asymptotically harmonic manifold with minimal horospheres (AHM). The (first order) flatness of MM is shown by using the strongest criterion: $\{…

2017-03-01abs ↗pdf ↗

Study partially hyperbolic flows on flat bundles, proving equivalence for complete affine manifolds.

problem Characterize partially hyperbolic representations of fundamental groups of manifolds.
method Representation theory techniques, focusing on holonomy representations and their properties.
result Show equivalence between partially hyperbolic representations and PP-Anosov representations for complete affine manifolds.

The paper proposes a new method to measure risk with fine-grained tail sensitivity.

problem Risk measures that do not account for tail sensitivity are insufficient for machine learning systems.
method The approach involves specifying a reference distribution with desired tail behavior and constructing risk measures compatible with this upper probability.
result Risk measures with fine-grained tail sensitivity can replace the expectation operator in machine learning systems.

The quantification of diversification benefits due to risk aggregation plays a prominent role in the (regulatory) capital management of large firms within the financial industry. However, the complexity of today's risk landscape makes a quantifiable reduction of risk concentration a challenging task. In the present pap…

2009-10-13abs ↗pdf ↗

This paper extends the standard chaining technique to prove excess risk upper bounds for empirical risk minimization with random design settings even if the magnitude of the noise and the estimates is unbounded. The bound applies to many loss functions besides the squared loss, and scales only with the sub-Gaussian or …

2016-09-07abs ↗pdf ↗

We study the crossing number of links that are formed by edges of a triangulation T of the 3-sphere with n tetrahedra. We show that the crossing number is bounded from above by an exponential function of n^2. In general, this bound can not be replaced by a subexponential bound. However, if T is polytopal (resp. shellab…

2001-10-17abs ↗pdf ↗

We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated group GG has the word problem solvable in subexponential time and has a subgroup of…

2002-06-25abs ↗pdf ↗

We study the computational cost of recovering a unit-norm sparse principal component xRnx \in \mathbb{R}^n planted in a random matrix, in either the Wigner or Wishart spiked model (observing either W+λxxW + λxx^\top with WW drawn from the Gaussian orthogonal ensemble, or NN independent samples from $\mathcal{N}(0, I_n + …

2019-07-26abs ↗pdf ↗

Optimal data-driven formulations are found for learning and decision-making with historical data.

problem Designing optimal learning and decision-making formulations from historical data.
method Define a yardstick for measuring formulation quality, then construct an optimal formulation that is uniformly closer to the true cost.
result Existence of three distinct out-of-sample performance regimes with corresponding optimal formulations.

This article shows that counting or computing the small eigenvalues of the Witten Laplacian in the semi-classical limit can be done without assuming that the potential is a Morse function as the authors did in [LNV]. In connection with persistent cohomology, we prove that the rescaled logarithms of these small eigenval…

2020-02-17abs ↗pdf ↗

This paper investigates the average-case time complexity of certifying RIP matrices.

problem Certifying the restricted isometry property (RIP) for large sparsity levels in random Gaussian matrices.
method Analysis of the low-degree likelihood ratio to determine the average-case time complexity.
result Subexponential runtime of NildeΩ(s2/M)N^{ ildeΩ(s^2/M)} is required for certifying RIP matrices.

Let GG be the group of complex points of a real semi-simple Lie group whose fundamental rank is equal to 1, e.g. $G= \SL_2 (\C) \times \SL_2 (\C)$ or $\SL_3 (\C)$. Then the fundamental rank of GG is 2,2, and according to the conjecture made in \cite{BV}, lattices in GG should have 'little' --- in the very weak sense…

2014-09-23abs ↗pdf ↗

Ridge regression performs optimally in noisy environments with heavy-tailed distributions.

problem Performance of ridge regression in noisy environments with heavy-tailed noise.
method Established excess risk bounds using integral operator framework and Fuk-Nagaev inequality.
result Ridge regression achieves optimal convergence rates under heavy-tailed noise, demonstrating robustness.

Study finds the minimum number of finite Gaussian mixtures for best approximation.

problem Finding the minimum number of finite Gaussian mixtures for best approximation.
method Local moment matching for upper bound and spectral analysis for lower bound.
result Corrects a previous lower bound in the case of Gaussian mixing distributions.

Historical economic growth in Asia (excluding Japan) is analysed. It is shown that Unified Growth Theory is contradicted by the data, which were used (but not analysed) during the formulation of this theory. Unified Growth Theory does not explain the mechanism of economic growth. It explains the mechanism of Malthusian…

2015-12-16abs ↗pdf ↗

Study confined subgroups in groups with contracting elements, showing their growth rate is strictly greater than half of the ambient growth rate.

problem Understanding the growth rate of confined subgroups in groups with contracting elements.
method Through boundary actions, analyzing the Hopf decomposition and quotient growth.
result Confined subgroups have a growth rate strictly greater than half of the ambient growth rate.

Growth rate of the world Growth Domestic Product (GDP) is analysed to determine possible pathways of the future economic growth. The analysis is based on using the latest data of the World Bank and it reveals that the growth rate between 1960 and 2014 was following a trajectory approaching asymptotically a constant val…

2015-10-26abs ↗pdf ↗