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

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for explicit bound

Explicit bounds found for shortest orthogeodesics and volumes of hyperbolic manifolds.

problem Finding explicit bounds for shortest orthogeodesics and volumes of hyperbolic manifolds.
method Derived explicit estimates for functions related to volumes and orthospectra, using a new approach.
result Explicit lower bound for the length of the shortest orthogeodesic in terms of volume.

For a surface group, a new bound is given for conjugator length function.

problem Finding an explicit bound for the conjugator length function of a surface group.
method Detailed analysis of conjugation reductions.
result An explicit bound n1CL(2n)n+8g1n-1 \leq \mathrm{CL}(2n) \leq n+8g-1 for the conjugator length function of a surface group.

Explicit polynomial bound found for subgroup Dehn function.

problem Finding explicit bounds on Dehn functions of subgroups of hyperbolic groups.
method Constructing a specific example of a non-hyperbolic subgroup and analyzing its Dehn function.
result Explicit polynomial upper bound n96n^{96} on the Dehn function of a non-hyperbolic subgroup.

This paper continues arXiv.org:math.AG/0609256 and arXiv:0708.3991 Using authors's methods of 1980, 1981, some explicit finite sets of number fields containing all ground fields of arithmetic hyperbolic reflection groups in dimensions at least 4 are defined, and good explicit bounds of their degrees (over Q) are obtain…

2007-09-30abs ↗pdf ↗

New algorithms improve machine learning performance with explicit regret bounds.

problem Improving machine learning performance with explicit regret bounds.
method Projection-based linear regression algorithms with a focus on modern machine-learning models and their algorithmic performance.
result Established a priori regret bounds with explicit λ-dependence.

PAC-Bayes bounds for Gibbs posteriors derived via singular learning theory.

problem Generalization bounds for overparameterized models with data-dependent priors.
method Explicit non-asymptotic PAC-Bayes bounds using singular learning theory.
result Explicit posterior-averaged risk bounds for overparameterized models.

The purpose of this paper is to give explicit methods for bounding the number of vertices of finite kk-regular graphs with given second eigenvalue. Let XX be a finite kk-regular graph and μ1(X)μ_1(X) the second largest eigenvalue of its adjacency matrix. It follows from the well-known Alon-Boppana Theorem, that for any…

2013-06-27abs ↗pdf ↗

This paper continues arXiv.org:math.AG/0609256, arXiv:0708.3991 and arXiv:0710.0162 . Using authors's methods of 1980, 1981, some explicit finite sets of number fields containing all ground fields of arithmetic hyperbolic reflection groups in dimension at least 3 are defined, and explicit bounds of their degrees (over …

2007-10-11abs ↗pdf ↗

We prove an explicit and sharp upper bound for the Castelnuovo-Mumford regularity of an FI-module V in terms of the degrees of its generators and relations. We use this to refine a result of Putman on the stability of homology of congruence subgroups, extending his theorem to previously excluded small characteristics a…

2015-06-02abs ↗pdf ↗

Develops methods to analyze manifold singularities using graph Laplacian.

problem Analyzing geometric properties of singularities in datasets.
method Theory and methods using the graph Laplacian to provide explicit bounds on manifold singularities.
result Explicit bounds on the graph Laplacian for functions near manifold singularities.

We prove distance bounds for graphs possessing positive Bakry-Émery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits an explicit upper bound for the diameter. Otherwise, the graph is a subset of the …

2017-05-23abs ↗pdf ↗

The framework of Integral Quadratic Constraints of Lessard et al. (2014) reduces the computation of upper bounds on the convergence rate of several optimization algorithms to semi-definite programming (SDP). Followup work by Nishihara et al. (2015) applies this technique to the entire family of over-relaxed Alternating…

2015-12-07abs ↗pdf ↗

It is not known whether there exists a computable function bounding the number of Pachner moves needed to connect any two triangulation of a compact 3-manifold. In this paper we find an explicit bound of this kind for all Haken 3-manifolds which contain no fibred submanifolds as strongly simple pieces of their JSJ-deco…

2003-06-06abs ↗pdf ↗

By investigating model-independent bounds for exotic options in financial mathematics, a martingale version of the Monge-Kantorovich mass transport problem was introduced in \cite{BeiglbockHenry LaborderePenkner,GalichonHenry-LabordereTouzi}. In this paper, we extend the one-dimensional Brenier's theorem to the present…

2013-02-20abs ↗pdf ↗

This paper precisely estimates transformer derivatives for explicit learning guarantees.

problem Computing fully-explicit generalization bounds for transformers with precise higher-order derivative estimates.
method Analyzes and estimates all higher-order derivatives of transformers with multiple attention heads and layer normalization.
result Obtains explicit pathwise generalization bounds for transformers learning from non-i.i.d. samples.

Based on a new coupling approach, we prove that the transition step of the Hamiltonian Monte Carlo algorithm is contractive w.r.t. a carefully designed Kantorovich (L1 Wasserstein) distance. The lower bound for the contraction rate is explicit. Global convexity of the potential is not required, and thus multimodal targ…

2018-05-01abs ↗pdf ↗

We derive exponential tail inequalities for sums of random matrices with no dependence on the explicit matrix dimensions. These are similar to the matrix versions of the Chernoff bound and Bernstein inequality except with the explicit matrix dimensions replaced by a trace quantity that can be small even when the dimens…

2011-04-09abs ↗pdf ↗

Explicitly bounds the spectral gap for Schottky subgroups of SL(2,Z).

problem Finding uniform bounds for spectral gaps of Schottky subgroups.
method Establishes explicit lower bounds for the second eigenvalue of the Laplace-Beltrami operator.
result Uniform and explicit lower bounds for the second eigenvalue of congruence coverings.

The paper provides bounds for high-dimensional U-statistics with novel order-explicit inequalities.

problem Bounding the deviation of high-dimensional U-statistics from their Hájek projections.
method Develops novel order-explicit moment inequalities for higher-order Hoeffding components.
result The maximum deviation of a high-dimensional U-statistic from its Hájek projection is of order Op(φbn1log2(dn))O_p(φb n^{-1}\log^2(dn)).

Improved guarantees for sparse random embeddings with explicit bounds and empirical superiority.

problem Improving the explicitness and sharpness of guarantees for sparse random embeddings.
method Explicit bounds, tighter estimates for quadratic chaos, extreme properties of sparse linear forms, and improved bounds for sums of independent random variables.
result Significantly outperforms prior works on various real-world datasets.

This paper proves properties of uniformly hyperbolic sets and constructs Markov partitions.

problem Establishing properties of uniformly hyperbolic sets and constructing Markov partitions.
method Backward graph transform, spectral decomposition, shadowing lemma, Markov partitions construction.
result Explicit bounds and Hölder continuity for the coding map.

The paper analyzes matrix completion with unlabeled implicit feedback and provides error bounds.

problem Matrix completion with shared low-rank ground truth and sampling distribution.
method Combining subspace recovery theory and matrix completion bounds.
result Error bounds showing contributions from estimating the sampling distribution and ground truth.

Given a prime, alternating link diagram, we build a special cover of the link complement whose degree is bounded by a factorial function of the crossing number. It follows that a subgroup of the link group of that index embeds into right-angled Artin and Coxeter groups. Corollaries of this result include a quantificati…

2019-09-26abs ↗pdf ↗

We give a new lower bound for the first gap λ2λ1λ_2 - λ_1 of the Dirichlet eigenvalues of the Schr{ö}dinger operator on a bounded convex domain ΩΩ in Rn^n or Sn^n and greatly sharpens the previous estimates. The new bound is explicit and computable.

2004-04-22abs ↗pdf ↗

Researchers create integral representations for two-layer ReLU networks with quantitative bounds.

problem Approximating functions with two-layer ReLU networks using explicit integral representations.
method Developed integral representations involving harmonic extension and projection, providing L2L^{2} bounds.
result Functions can be approximated with L2L^{2} errors independent of dimension or degree, depending on coefficients and distribution.

It was recently shown that there exists an explicit bound for the number of Pachner moves needed to connect any two triangulation of any Haken 3-manifold which contains no fibred sub-manifolds as strongly simple pieces of its JSJ-decomposition. In this paper we prove a generalisation of that result to all knot compleme…

2003-06-06abs ↗pdf ↗

In Statistical Learning, the Vapnik-Chervonenkis (VC) dimension is an important combinatorial property of classifiers. To our knowledge, no theoretical results yet exist for the VC dimension of edited nearest-neighbour (1NN) classifiers with reference set of fixed size. Related theoretical results are scattered in the …

2019-02-07abs ↗pdf ↗

We provide an explicit upper bound on the number of Reidemeister moves required to pass between two diagrams of the same link. This leads to a conceptually simple solution to the equivalence problem for links.

2011-04-11abs ↗pdf ↗

This paper gives the first explicit, two-sided estimates on the cusp area of once-punctured torus bundles, 4-punctured sphere bundles, and 2-bridge link complements. The input for these estimates is purely combinatorial data coming from the Farey tesselation of the hyperbolic plane. The bounds on cusp area lead to expl…

2008-08-20abs ↗pdf ↗

The paper proves geometric bordisms for specific hyperbolic surfaces.

problem Proving geometric bordisms for Accola-Maclachlan, Kulkarni, and Wiman surfaces.
method Explicit geodesic embeddings and geometric proofs for specific surfaces.
result The surfaces bound geometrically compact hyperbolic 3-manifolds.

Maps persistence diagrams into Hilbert and Euclidean spaces with explicit distortions.

problem Embedding persistence diagrams into Euclidean spaces for statistical analysis.
method Explicit geometric maps with distortion functions.
result Controlled geometric information loss through explicit distortion functions.

Researchers develop explicit approximations for European put options in stochastic volatility models.

problem Developing accurate approximations for European put option prices in stochastic volatility models.
method Exploits expansions of the mixing representation of the put option price using Malliavin calculus.
result Explicit formulas for option prices and error bounds are derived, with closed-form solutions under piecewise-constant parameters.

This paper proves explicit bilipschitz bounds on the change in metric between the thick part of a cusped hyperbolic 3-manifold N and the thick part of any of its long Dehn fillings. Given a bilipschitz constant J > 1 and a thickness constant epsilon > 0, we quantify how long a Dehn filling suffices to guarantee a J-bil…

2019-07-31abs ↗pdf ↗

The paper strengthens a theorem on crossings under linear perturbations with Hausdorff measure estimates.

problem Understanding multiple-point crossings under linear perturbations.
method Establishes a transversality theorem with Hausdorff measure estimates for exceptional parameter sets.
result Explicit upper bounds on the Hausdorff dimension of the exceptional set.

In this paper we present some bounds of Hausdorff measures of objects definable in o-minimal structures: sets, fibers of maps, inverse images of curves of maps, etc. Moreover, we also give some explicit bounds for semi-algebraic or semi-Pfaffian cases, which depend only on the combinatoric data representing the objects…

2012-04-25abs ↗pdf ↗

This work improves neural network calibration using explicit regularization.

problem Improving predictive uncertainty in neural networks.
method Introducing a probabilistic calibration measure and exploring explicit regularization techniques.
result Explicit regularization improves log-likelihood and predictive uncertainty.