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

Trend · papers per month

52103155206 · May 202619922001200920172026
48 results for exponential separations

We present a separation property for the gaps in the length spectrum of a compact Riemannian manifold with negative curvature. In arbitrary small neighborhoods of the metric for some suitable topology, we show that there are negatively curved metrics with a length spectrum exponentially separated from below. This prope…

2018-06-18abs ↗pdf ↗

Mirror flow optimizes separable data problems, converging to a maximum margin classifier.

problem Optimizing classification problems with separable data using mirror flow.
method Examine mirror flow on linearly separable classification problems, focusing on the horizon function of the mirror potential.
result Mirror flow converges to a maximum margin classifier for separable data under certain conditions.

This study analyzes adversarial training on linearly separable data and finds that gradient updates can achieve large margins in polynomial iterations.

problem Ensuring robustness in machine learning models trained on linearly separable data.
method Analysis of adversarial training with gradient updates on linearly separable data.
result Gradient updates in adversarial training can achieve large margins in polynomial iterations, whereas non-smooth methods require exponentially many iterations.

The paper establishes a nearly-sharp statistical threshold for efficient learning in Latent MDPs with separated components.

problem Learning Latent Markov Decision Processes (LMDPs) with separated components.
method The paper considers various notions of separation and establishes a nearly-sharp statistical threshold for efficient learning. It also presents a quasi-polynomial algorithm with time complexity scaling in terms of the statistical threshold under a weaker assumption of separability under the optimal policy, and a near-matching time complexity lower bound under the exponential time hypothesis.
result Establishes a nearly-sharp statistical threshold for efficient learning in Latent MDPs with separated components.

A random walk wnw_n on a separable, geodesic hyperbolic metric space XX converges to the boundary X\partial X with probability one when the step distribution supports two independent loxodromics. In particular, the random walk makes positive linear progress. Progress is known to be linear with exponential decay when …

2017-10-14abs ↗pdf ↗

Analytic curves are classified w.r.t. their symmetry under a regular and separately analytic Lie group action on an analytic manifold. We show that an analytic curve is either exponential or splits into countably many analytic immersive curves, each of them discretely generated by the symmetry group (i.e., each such cu…

2016-01-25abs ↗pdf ↗

We prove an exponential estimate for the asymptotics of Bergman kernels of a positive line bundle under hypotheses of bounded geometry. We give further Bergman kernel proofs of complex geometry results, such as separation of points, existence of local coordinates and holomorphic convexity by sections of positive line b…

2013-10-14abs ↗pdf ↗

We use a new geometric construction, grope splitting, to give a sharp bound for separation of surfaces in 4-manifolds. We also describe applications of this technique in link-homotopy theory, and to the problem of locating pi_1-null surfaces in 4-manifolds. In our applications to link-homotopy, grope splitting serves a…

2000-08-29abs ↗pdf ↗

Let g ⁣:SNg \colon S \looparrowright N be a properly immersed π1π_1--injective surface in a non-geometric 33--manifold NN. We compute the distortion of π1(S)π_1(S) in π1(N)π_1(N) and show that how it is related to separability of π1(S)π_1(S) in π1(N)π_1(N). The only possibility of the distortion is linear, quadratic, exponential, an…

2018-05-03abs ↗pdf ↗

Memory capacity of DAM scales exponentially with feature separation, unaffected by correlations.

problem Understanding how feature correlations impact DAM's capacity.
method Developed an empirical framework to analyze DAM's capacity under varying feature correlations and pattern separations.
result Memory capacity scales exponentially with feature separation, unaffected by correlations.

We give a new, effective proof of the separability of cubically convex-cocompact subgroups of special groups. As a consequence, we show that if GG is a virtually compact special hyperbolic group, and QGQ\leq G is a KK-quasiconvex subgroup, then any gGQg\in G-Q of word-length at most nn is separated from QQ by a subg…

2015-01-28abs ↗pdf ↗

New methods test discrete distributions faster with local privacy constraints.

problem Testing discrete distributions under local differential privacy constraints.
method Efficient randomized algorithms and test procedures, both non-interactive and interactive.
result Faster separation rates in interactive privacy mechanisms.

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.

Proves depth 2 neural networks can't approximate certain functions as well as depth 3 networks.

problem Approximating functions with depth 2 networks in high dimensions.
method Lower bound proof using worst-to-average-case random self-reducibility.
result Proves depth 2 networks can't approximate certain functions as well as depth 3 networks, resolving an open problem.

The second author previously discussed how classical complexity separation conjectures, we call them "axioms", have implications in three manifold topology: polynomial length stings of operations which preserve certain Jones polynomial evaluations cannot produce exponential simplifications of link diagrams. In this pap…

2013-05-26abs ↗pdf ↗

Gradient descent reveals the exact implicit bias via dual optimization for linearly separable data.

problem Characterizing the implicit bias of gradient descent on linearly separable data.
method Primal-dual analysis with smoothed margin for general losses, and exponential loss with specific step sizes.
result Proves faster convergence rates for implicit bias and margin maximization.

Let S be an immersed horizontal surface in a 3-dimensional graph manifold. We show that the fundamental group of the surface S is quadratically distorted whenever the surface is virtually embedded (i.e., separable) and is exponentially distorted when the surface is not virtually embedded.

2017-03-21abs ↗pdf ↗

Algorithm distinguishes Gaussian mixtures from pure Gaussians in quasi-polynomial time.

problem Distinguishing mixtures of Gaussian components from pure Gaussians, especially when components are well-separated.
method Sum-of-Squares method, quasi-polynomial time algorithm, bipartitioning sample to separate components.
result Algorithm can reliably distinguish between mixtures and pure Gaussians in quasi-polynomial time.

Randomly initialized neural networks can linearly separate arbitrary sets.

problem Mapping two arbitrary sets to linearly separable sets.
method Randomly initialized one-layer neural networks with sufficient width.
result With high probability, these networks can transform two sets into linearly separable sets.

Paper explains why robust generalization is hard in deep learning models.

problem Difficulty in achieving robust generalization despite good training accuracy.
method Theoretical analysis of expressive power for deep neural networks.
result Expressive power of neural networks affects robust generalization.

New energy functional and fields for Yang-Mills theory, proving monotonicity and vanishing theorems.

problem Developing new mathematical tools for Yang-Mills theory.
method Introducing normalized exponential Yang-Mills energy functional, deriving monotonicity formula and vanishing theorem.
result Monotonicity and vanishing theorems for exponential Yang-Mills fields.

Why are classifiers in high dimension vulnerable to "adversarial" perturbations? We show that it is likely not due to information theoretic limitations, but rather it could be due to computational constraints. First we prove that, for a broad set of classification tasks, the mere existence of a robust classifier implie…

2018-05-25abs ↗pdf ↗

We provide a detailed study on the implicit bias of gradient descent when optimizing loss functions with strictly monotone tails, such as the logistic loss, over separable datasets. We look at two basic questions: (a) what are the conditions on the tail of the loss function under which gradient descent converges in the…

2018-03-05abs ↗pdf ↗

New findings on depth vs. width in neural networks, showing depth can improve learnability.

problem Understanding the role of depth in neural networks, especially when width is unbounded.
method Analyzing sample complexity for learnability in norm-controlled depth-2 and depth-3 ReLU networks.
result Depth can improve learnability of functions that are otherwise unlearnable with depth-2 networks.

In a previous article, analytic 1-submanifolds had been classified w.r.t. their symmetry under a given regular and separately analytic Lie group action on an analytic manifold. It was shown that such an analytic 1-submanifold is either free or (via the exponential map) analytically diffeomorphic to the unit circle or a…

2016-01-26abs ↗pdf ↗

We adress the maximization problem of expected utility from terminal wealth. The special feature of this paper is that we consider a financial market where the price process of risky assets can have a default time. Using dynamic programming, we characterize the value function with a backward stochastic differential equ…

2008-11-28abs ↗pdf ↗

High-dimensional diffusion models suffer from distorted samples due to CFG.

problem Distortions in high-dimensional guided diffusion models.
method Analytical tools from statistical physics, dynamic mean-field theory.
result Distortions arise in high-dimensional settings due to class separability issues.

Hyperbolic space outperforms Euclidean in learning hierarchical data.

problem Learning hierarchical data in Euclidean space requires exponentially many samples.
method Established geometric obstruction in Euclidean space and showed hyperbolic space's advantage.
result Hyperbolic space enables learning with O(mRlogm)O(mR \log m) samples, matching information-theoretic optimum.

Study shows depth improves generalization in deep learning models.

problem Understanding why and when depth improves generalization in deep learning.
method Implementation-agnostic state-transition model to analyze depth and generalization.
result Identifies geometric and semigroup mechanisms that keep entropy contribution saturated or polynomial, clarifying depth's statistical advantage.

Study on focal locus of submanifolds in Finsler manifolds, showing regularity and smoothness.

problem Investigating the focal locus of submanifolds in Finsler manifolds.
method Using the normal exponential map and extending Warner's ideas, studying connected components and smoothness of focal time maps.
result Identified an open and dense subset where focal time maps are smooth, provided they are finite.

New findings show depth separations for natural radial functions are not possible.

problem Depth separations for natural radial functions in neural networks.
method Study of O(1)\mathcal{O}(1)-Lipschitz radial functions with depth 2 networks.
result Approximating O(1)\mathcal{O}(1)-Lipschitz radial functions with depth 2, size poly(d) networks for every constant ε.

We prove the dimension of any asymptotic cone over a metric space X does not exceed the asymptotic Assouad-Nagata dimension of X. This improves a result of Dranishnikov and Smith who showed that dim(Y) does not exceed asymptotic Assouad-Nagata dimension of X for all separable subsets Y of special asymptotic cones of X …

2006-10-10abs ↗pdf ↗