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

113227340453 · Jun 202019922001200920172026
48 results for fundamental limits

In this note we investigate to what extent the fundamental group of a metric space can be described as the inverse limit of its discrete fundamental groups. We show that some mild conditions suffice to imply the existence of an isomorphism and we provide a list of counterexamples to possible weakenings of these hypothe…

2017-10-19abs ↗pdf ↗

Study shows a central limit theorem for random coverings of manifolds with nilpotent groups.

problem Understanding the distribution of connected components in random coverings of manifolds with nilpotent fundamental groups.
method Used sampling homomorphisms from the fundamental group into the symmetric group and subgroup growth zeta functions of nilpotent groups.
result Proved a central limit theorem for the number of connected components of these random coverings.

This work characterizes the fundamental limit of network pruning using statistical dimension and convex geometry.

problem The fundamental limit of network pruning is still lacking, especially for deep neural networks.
method Directly imposing sparsity constraint on the loss function and using statistical dimension in convex geometry.
result Characterizes the sharp phase transition point as the fundamental limit of pruning ratio.

Study on matching nodes between graphs to preserve edges, focusing on limits and algorithms.

problem Matching nodes between graphs to preserve most edges, especially in random graphs.
method Investigates fundamental limits and designs algorithms to recover alignments in planted graphs.
result High probability guarantees on the success or failure of graph alignment algorithms.

Paper explores limits of exact inference in structured prediction models.

problem Exact recovery of true labels in graph-based structured prediction models.
method Analyzes necessary and sufficient conditions for exact recovery using maximum likelihood estimation.
result Derives tight conditions for exact recovery, revealing a gap with computationally tractable methods.

Characterizes fundamental groups of disjointly tree-graded spaces.

problem Understanding fundamental groups of complex geometric structures.
method Defines and analyzes disjointly tree-graded spaces, characterizing their fundamental groups.
result Fundamental groups of disjointly tree-graded spaces embed into inverse limits of free products of fundamental groups of pieces.

Study on the limits of projective special real manifolds and their symmetries.

problem Understanding the limits of projective special real manifolds.
method Evolution of defining polynomial and centro-affine fundamental form along curves.
result Found a list of possible limit geometries and a lower bound for symmetry groups.

We study the limits and methods of training two-layer autoencoders.

problem Understanding the limits and methods of training two-layer autoencoders.
method Focus on non-linear two-layer autoencoders trained in the proportional regime, using gradient methods.
result Gradient methods achieve the minimizers of the population risk and reveal the structure of the features.

We study direct limits of embedded Cantor sets and embedded \sier curves. We show that under appropriate conditions on the embeddings, all limits of Cantor spaces give rise to homeomorphic spaces, called ωω-Cantor spaces, and similarly, all limits of \sier curves give homeomorphic spaces, called to ωω-\sier curves. W…

2019-08-09abs ↗pdf ↗

This paper sets fundamental limits for rank-one matrix estimation with varying noise levels.

problem Estimating a rank-one matrix from Gaussian observations with different noise levels across blocks.
method Novel reduction from heterogeneous noise to homogeneous noise, proving asymptotic error bounds.
result Asymptotically exact formulas for minimum mean-squared error in estimating rank-one matrix and factors.

In this paper we study the behaviour of the limit set of complete proper compact minimal immersions in a regular domain G of R^3. We prove that the second fundamental form of the boundary surface of G is nonnegatively defined at every point of the limit set of such immersions.

2006-12-06abs ↗pdf ↗

Paper proposes MMC to avoid high-density bias in clustering.

problem High-density bias in density-based clustering.
method Introduces mass distribution as a better foundation for clustering, proposing mass-maximization clustering (MMC).
result MMC avoids high-density bias and discovers clusters of arbitrary shapes, sizes, and densities.

When a solenoid is embedded in three space, its complement is an open three manifold. We discuss the geometry and fundamental groups of such manifolds, and show that the complements of different solenoids (arising from different inverse limits) have different fundamental groups. Embeddings of the same solenoid can give…

2012-12-01abs ↗pdf ↗

A new method combines simple binary classifiers to build complex multiclass classifiers, achieving performance limits in a Gaussian setting.

problem Building a sophisticated multiclass classifier from simple binary decisions.
method Combining O(logK)O(\log K) simple binary classifiers to form a KK-class classifier.
result Explicit performance bounds across various decoding and dimensional regimes for a stylized Gaussian setting.

The fundamental group of a hyperbolic manifold acts on the limit set, giving rise to a cross-product C^* algebra. We construct nontrivial K-cycles for the cross-product algebra, thereby extending some results of Connes and Sullivan to higher dimensions. We also show how the Patterson-Sullivan measure on the limit set c…

2004-04-19abs ↗pdf ↗

New research limits how well attackers can guess if data points were in a model's training set.

problem Revealing membership of data points in machine learning models.
method Theoretical analysis of statistical limits for membership inference attacks.
result The effectiveness of membership inference attacks is limited by a constant that quantifies data distribution diversity.

In this note we establish several versions of a compactness theorem for submanifolds. In particular we require only bounds on the second fundamental form and do not assume volume or diameter bounds. As an application we prove a compactness theorem for mean curvature flows and use it to construct smooth blow-up limits a…

2010-06-29abs ↗pdf ↗

The paper studies random covers of torus knot complements and their statistical properties.

problem Understanding the statistical behavior of finite covers of torus knot complements.
method Asymptotic subgroup growth analysis and Benjamini-Schramm limit theorems.
result Determination of the linear growth rate of Betti numbers for random covers of torus knot complements.

Turnover-adjusted IR is always lower than classic IR, suggesting managers can improve performance by limiting turnover.

problem The classic relationship between IR and its determinants does not account for turnover costs.
method Mathematical derivations and simulations considering volatility of information coefficient and portfolio turnover.
result Turnover-adjusted IR is lower and managers can improve performance by limiting turnover.

Esnault asked whether every smooth complex projective variety with infinite fundamental group has a nonzero symmetric differential (a section of a symmetric power of the cotangent bundle). In a sense, this would mean that every variety with infinite fundamental group has some nonpositive curvature. We show that the ans…

2012-04-29abs ↗pdf ↗

We prove Gaussian type bounds for the fundamental solution of the conjugate heat equation evolving under the Ricci flow. As a consequence, for dimension 4 and higher, we show that the backward limit of type I κκ-solutions of the Ricci flow must be a non-flat gradient shrinking Ricci soliton. This extends Perelman's pr…

2010-06-03abs ↗pdf ↗

The paper sets fundamental limits for ERM in high dimensions.

problem Understanding statistical accuracy of ERM in high-dimensional settings.
method Sharp performance characterizations and tight lower bounds derived for generalized linear models.
result Optimal tuning of loss function and regularization parameter.

The paper characterizes the efficiency of transferring knowledge from a teacher to a student classifier over finite domains.

problem Characterizing the statistical efficiency of knowledge transfer over finite domains.
method Three progressive levels of privileged information: hard labels, teacher probabilities, and soft labels. Novel empirical loss functions used to achieve the fundamental limits.
result Achieving the fundamental limits of knowledge transfer through specific levels of privileged information and novel loss functions.

This work examines fundamental limits in model falsification without assuming specific distributions.

problem Establishing lower bounds on model class risk in distribution-free settings.
method Model-agnostic fundamental hardness result for constructing lower bounds on test error.
result No positive lower bound on model class risk is possible in certain settings.

We explore the limit set of a particular spherical CR uniformization of a cusped hyperbolic manifold. We prove that the limit set is the closure of a countable union of R\mathbb{R}-circles, is connected, and contains a Hopf link with three components; we also show that the fundamental group of its complement in S3S^3

2019-10-24abs ↗pdf ↗

Study finds exact limits for sparse regression with fewer observations than usual.

problem Understanding sparse linear regression with sublinear sparsity.
method Adaptive interpolation method and modified AMP algorithm.
result Exact asymptotic expressions for mutual information and MMSE in sublinear sparsity.

We prove that any complete hyperbolic 3--manifold with finitely generated fundamental group, with a single topological end, and which embeds into $\BS^3$ is the geometric limit of a sequence of hyperbolic knot complements in $\BS^3$. In particular, we derive the existence of hyperbolic knot complements which contain ba…

2009-02-10abs ↗pdf ↗

Paper models and compresses wideband CSI feedback in FDD MIMO systems.

problem Fundamental limits of channel state information (CSI) feedback in FDD massive MIMO systems.
method Modeling CSI as a Gaussian-mixture source with latent geometry states, proposing Gaussian-mixture transform coding (GMTC).
result Near-optimal CSI compression achieved through state-adaptive transform coding without large neural encoders.

Proves a fundamental gap lower bound for horoconvex domains in hyperbolic space.

problem Proving a fundamental gap lower bound for horoconvex domains in hyperbolic space.
method Reduces the problem to a radial-height problem, compares Dirichlet forms with angular operators, and uses Green estimates.
result Establishes a polynomial \(D^{-3}\) scale fundamental gap lower bound.

We consider the possible Euler characteristics and fundamental groups of the complementary components XX and YY of an embedding of a connected closed 3-manifold MM in S4S^4. We use a 2-knot satellite construction to change the fundamental groups, and Massey products to limit the values of χ(X)χ(X) and χ(Y)χ(Y) when MM

2015-02-15abs ↗pdf ↗

Paper analyzes online reinforcement learning with outcome-based feedback, providing efficient algorithms and fundamental limits.

problem Assigning credit to actions in reinforcement learning with only endpoint rewards.
method Develops a provably sample-efficient algorithm for online reinforcement learning with general function approximation.
result Achieves O(CmcovH3/ε2)O(C_{ m cov} H^3/ε^2) sample complexity, characterizing statistical separation between outcome-based and per-step rewards.

Optimal first-order methods are shown to be fundamental limits in functional estimation.

problem Optimal functional estimation under weak conditions.
method Formalization of functional estimation with black-box nuisance function estimates and derivation of minimax lower bounds.
result First-order methods are optimal under weak conditions, but higher-order methods can outperform them when nuisance function structure is known.

The paper explores game-theoretic alignment of LLMs with human preferences, finding limitations and conditions.

problem Aligning LLMs with human preferences using game theory.
method Systematic study of payoff choices in a two-player zero-sum game for desirable alignment properties.
result Impossibility of preference matching in game-theoretic LLM alignment under standard assumptions.

We give an expository account of our proof that each cusp-free hyperbolic 3-manifold M with finitely generated fundamental group and incompressible ends is an algebraic limit of geometrically finite hyperbolic 3-manifolds.

2002-10-31abs ↗pdf ↗

Consider a one-ended word-hyperbolic group. If it is the fundamental group of a graph of free groups with cyclic edge groups then either it is the fundamental group of a surface or it contains a finitely generated one-ended subgroup of infinite index. As a corollary, the same holds for limit groups. We also obtain a ch…

2011-02-14abs ↗pdf ↗

Paper studies fundamental limits of communication in distributed learning.

problem Communication efficiency in model aggregation for distributed learning.
method Rate-Distortion approach to model aggregation as a vector Gaussian CEO problem.
result Derives rate region bound and sum-rate-distortion function for model aggregation.

Approximate inference algorithm is one of the fundamental research fields in machine learning. The two dominant theoretical inference frameworks in machine learning are variational inference (VI) and Markov chain Monte Carlo (MCMC). However, because of the fundamental limitation in the theory, it is very challenging to…

2018-11-17abs ↗pdf ↗