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

52105157209 · Jun 202019922001200920172026
48 results for exponentially growing subsets

Abstract result on correlations of pairs in exponentially growing discrete subsets.

problem Pair correlations in exponentially growing discrete subsets with weight functions.
method Proved abstract result on correlations of pairs of elements in an exponentially growing discrete subset with a weight function.
result Distribution function of unscaled differences is tδ2ett\mapsto\fracδ2\,e^{-|t|}, and pair correlation exhibits Poissonian behavior under certain conditions.

The study shows exponential distortion in virtually special groups containing free subgroups.

problem Understanding distortion in virtually special groups containing free subgroups.
method Constructing examples of virtually special groups with finite rank free subgroups.
result Distortion functions grow like exp^k(x^m) and can be superexponential.

Suppose that Γ0Rn+1Γ_0\subset\mathbb R^{n+1} is a closed countably nn-rectifiable set whose complement Rn+1Γ0\mathbb R^{n+1}\setminus Γ_0 consists of more than one connected component. Assume that the nn-dimensional Hausdorff measure of Γ0Γ_0 is finite or grows at most exponentially near infinity. Under these assumptions, we…

2015-11-09abs ↗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.

It is well-known that neural networks are universal approximators, but that deeper networks tend in practice to be more powerful than shallower ones. We shed light on this by proving that the total number of neurons mm required to approximate natural classes of multivariate polynomials of nn variables grows only line…

2017-05-16abs ↗pdf ↗

This paper uses Reinforcement Learning to select features from a large dataset.

problem Selecting the best features to minimize variance and bias in machine learning models.
method Formulated the feature selection problem as a Markov Decision Process (MDP) and used Temporal Difference (TD) algorithm.
result The approach using Reinforcement Learning outperformed other methods in selecting features.

Paper proposes a method to identify negative transfers in multitask learning using surrogate models.

problem Identifying subsets of source tasks that improve target task performance in multitask learning.
method Surrogate modeling to precompute multitask learning performances and approximate them with a linear regression model.
result The approach predicts negative transfers from multiple source tasks to target tasks more accurately than existing methods.

In this paper we discuss the variable selection method from \ell0-norm constrained regression, which is equivalent to the problem of finding the best subset of a fixed size. Our study focuses on two aspects, consistency and computation. We prove that the sparse estimator from such a method can retain all of the importa…

2011-12-05abs ↗pdf ↗

The paper defines conditions for a free-by-free group to be hyperbolic.

problem Conditions for a free-by-free group to be relatively hyperbolic.
method Necessary and sufficient conditions involving exponentially growing automorphisms and invariant subgroup systems.
result A subgroup system can be used to construct peripheral subgroups making the extension hyperbolic.

We show that if a f.g. group GG has a non-elementary WPD action on a hyperbolic metric space XX, then the number of GG-conjugacy classes of XX-loxodromic elements of GG coming from a ball of radius RR in the Cayley graph of GG grows exponentially in RR. As an application we prove that for N3N\ge 3 the number of…

2017-07-22abs ↗pdf ↗

Random quotients of hyperbolic cubulated groups remain cubulated.

problem Understanding properties of random quotients of hyperbolic cubulated groups.
method Cubical small-cancellation theory, exponential growth of conjugacy classes, and hyperplane stabilizers' growth.
result Low-density random quotients of cubulated hyperbolic groups are cubulated and hyperbolic.

Accelerated gradient method's stability deteriorates exponentially with steps.

problem Algorithmic stability of Nesterov's accelerated gradient method.
method Analysis of two notions of algorithmic stability for Nesterov's accelerated gradient method.
result Stability of Nesterov's accelerated method deteriorates exponentially with the number of gradient steps.

We prove that almost all geodesics on a noncompact locally symmetric space of finite volume grow with a logarithmic speed -- the higher rank generalization of a theorem of D. Sullivan (1982). More generally, under certain conditions on a sequence of subsets AnA_n of a homogeneous space G/ΓG/Γ (GG a semisimple Lie group…

1998-12-15abs ↗pdf ↗

Improved sample efficiency in preference-based RL with multiple comparisons.

problem Sample inefficiency in preference-based reinforcement learning with pairwise comparisons.
method Proposes M-AUPO, an algorithm that selects multiple actions by maximizing average uncertainty within subsets.
result Achieves a suboptimality gap of $O\left( \frac{d}{T} \sqrt{ \sum_{t=1}^T \frac{1}{|S_t|}} ight)$, improving performance with larger subsets.

We show that there is a family of pseudo-Anosov braids independently parameterized by the braid index and the (canonical) length whose smallest conjugacy invariant sets grow exponentially in the braid index and linearly in the length and conclude that the conjugacy problem remains exponential in the braid index under t…

2012-03-11abs ↗pdf ↗

Given a simply connected, closed four manifold, we associate to it a simply connected, closed, spin five manifold. This leads to several consequences : the stable and unstable homotopy groups of such a four manifold is determined by its second Betti number, and the ranks of the homotopy groups can be explicitly calcula…

2013-03-14abs ↗pdf ↗

Ancient solutions on a strip are constant if polynomial, and have finite-dimensional space for slower growth.

problem Characterizing ancient solutions on an infinite strip with polynomial and exponential growth.
method Analyzing parabolic equations on an infinite strip, proving properties of ancient solutions.
result Ancient solutions on the strip are constant if they grow polynomially, and have a finite-dimensional space for slower exponential growth.

New hyperbolic graph constructed from projections of free splitting graph.

problem Constructing a new hyperbolic graph from projections of free splitting graph.
method Using submanifold projections and geometric realization of free splitting graph.
result A new hyperbolic graph constructed for n3n\geq 3.

We give bounds on the number of non-simple closed curves on a negatively curved surface, given upper bounds on both length and self-intersection number. In particular, it was previously known that the number of all closed curves of length at most LL grows exponentially in LL. We get exponentially tighter bounds given…

2015-05-27abs ↗pdf ↗

This paper studies a class of exponential family models whose canonical parameters are specified as linear functionals of an unknown infinite-dimensional slope function. The optimal minimax rates of convergence for slope function estimation are established. The estimators that achieve the optimal rates are constructed …

2011-08-17abs ↗pdf ↗

The study of private inference has been sparked by growing concern regarding the analysis of data when it stems from sensitive sources. We present the first method for private Bayesian inference in exponential families that properly accounts for noise introduced by the privacy mechanism. It is efficient because it work…

2018-09-06abs ↗pdf ↗

We show that a smooth unknotted curve in R^3 satisfies an isoperimetric inequality that bounds the area of an embedded disk spanning the curve in terms of two parameters: the length L of the curve and the thickness r (maximal radius of an embedded tubular neighborhood) of the curve. For fixed length, the expression giv…

2003-06-21abs ↗pdf ↗

Exponential family extensions of principal component analysis (EPCA) have received a considerable amount of attention in recent years, demonstrating the growing need for basic modeling tools that do not assume the squared loss or Gaussian distribution. We extend the EPCA model toolbox by presenting the first exponentia…

2012-03-15abs ↗pdf ↗

This paper refines bounds on random walk speed in Teichmüller space.

problem Understanding the speed of random walks on Teichmüller space.
method Analyzing Jenkins-Strebel directions and Lebesgue geodesics.
result The drift of random walks grows exponentially for typical geodesics and oscillates between linear and exponential for some geodesics.

The volume conjecture and its generalizations say that the colored Jones polynomial corresponding to the N-dimensional irreducible representation of sl(2;C) of a (hyperbolic) knot evaluated at exp(c/N) grows exponentially with respect to N if one fixes a complex number c near 2*Pi*I. On the other hand if the absolute v…

2007-11-19abs ↗pdf ↗

With the rapidly growing scales of statistical problems, subset based communication-free parallel MCMC methods are a promising future for large scale Bayesian analysis. In this article, we propose a new Weierstrass sampler for parallel MCMC based on independent subsets. The new sampler approximates the full data poster…

2013-12-17abs ↗pdf ↗

Study shows exponential growth of knot polynomial tied to Chern-Simons invariant.

problem Asymptotic behavior of colored Jones polynomials of figure-eight knot.
method Analyzes growth rate of polynomial evaluated at specific points.
result Growth rate determined by Chern-Simons invariant of an affine representation.

This paper proves exponential mixing for frame flows on hyperbolic manifolds with cusps.

problem Establishing exponential mixing for frame flows on geometrically finite hyperbolic manifolds with cusps.
method Symbolic coding of geodesic flow, Dolgopyat's method, large deviation property, combinatorics of cusp excursions, renewal theorem.
result Frame flows for geometrically finite hyperbolic manifolds of arbitrary dimensions are exponentially mixing.

Expressive efficiency refers to the relation between two architectures A and B, whereby any function realized by B could be replicated by A, but there exists functions realized by A, which cannot be replicated by B unless its size grows significantly larger. For example, it is known that deep networks are exponentially…

2017-03-06abs ↗pdf ↗