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

89177266354 · Jun 202019922001200920172026
48 results for continuum limits

Proves continuum limits of Lipschitz learning using Γ-convergence.

problem Semi-supervised learning with graph-based methods and continuum limits of pp-Laplacian learning.
method Proves continuum limits of Lipschitz learning using Γ-convergence.
result Proves ΓΓ-convergence in the LL^\infty-topology to the supremum norm of the gradient.

This work proves the continuum limit of t-SNE for data visualization.

problem Understanding the theoretical basis of t-SNE from a continuum limit perspective.
method Proving the Kullback-Leibler divergence consistency as non o \infty for t-SNE.
result The continuum variational problem involving non-convex gradient regularization and penalty on probability density function magnitude.

Study of convergence of point-object configurations to a charged dust continuum.

problem Understanding the convergence of discretized point-object configurations to a charged dust continuum.
method Establishing existence and uniqueness of horizons/minimal surfaces, studying geometries of regions exterior to minimal surfaces, and discussing limits.
result Examples of scalar curvature jumps upon taking Gromov-Hausdorff and intrinsic flat limits.

A mesh-free method solves continuum-marginal optimal transport problems.

problem Recovering minimum-energy velocity fields from time-continuous probability marginals.
method Embeds weak continuity equation in a reproducing kernel Hilbert space, optimizing with mini-batch stochastic methods.
result Accurately recovers drift and maintains marginal consistency in synthetic experiments.

Derives continuum model from discrete ε\varepsilon-graphs with connectivity functional.

problem Modeling diffusion in networks with varying connectivity.
method Energy-based continuum limit derivation, neural-network reconstruction of connectivity.
result Error between discrete and continuum energies is O(ε)O(\varepsilon), valid even with fluctuations.

Study shows how discrete graph curvature relates to manifold curvature.

problem Relating discrete graph curvature to intrinsic manifold curvature.
method Continuum limits of Ollivier's Ricci curvature on data clouds.
result Random geometric graphs inherit global curvature properties of manifolds.

Continuum transformers learn operators in context via gradient descent.

problem Generalizing transformers to handle infinite-dimensional inputs for in-context learning.
method Gradient descent in an operator RKHS, leveraging generalized representer theorems and gradient flows.
result Operator learned in context is Bayes Optimal Predictor in infinite depth limit.

Geometrically infinite Kleinain groups have nonconical limit sets with the cardinality of the continuum. In this paper, we construct a geometrically infinite Fuchsian group such that the Hausdorff dimension of the nonconical limit set equals zero. For finitely generated, geometrically infinite Kleinian groups, we prove…

2019-09-19abs ↗pdf ↗

We analyze convergence of Fermat distances and their application in clustering.

problem Understanding convergence properties of Fermat distances on Riemannian manifolds.
method Geometric and statistical arguments in percolation theory, leveraging novel arguments for non-uniform densities and curved domains.
result Discrete, sample-based Fermat distances converge to their continuum analogues with a precise rate dependent on intrinsic dimensionality.

Using an inverse system of metric graphs as in: J. Cheeger and B. Kleiner, "Inverse limit spaces satisfying a Poincaré inequality", we provide a simple example of a metric space XX that admits Poincaré inequalities for a continuum of mutually singular measures.

2014-03-20abs ↗pdf ↗

The standard Feynman diagrammatic approach to quantum field theories assumes that perturbation theory approximates the full quantum theory at small coupling even when a mathematically rigorous construction of the latter is absent. On the other hand, two-dimensional Yang-Mills theory is a rare (if not the only) example …

2015-08-25abs ↗pdf ↗

Smooth knots can be embedded into a specific Menger continuum.

problem Embedding smooth knots into a specific type of continuum.
method Explicit construction using cubical models and self-similarity of the Menger continuum.
result Every smooth knot can be isotoped into the Menger continuum.

We prove the following result announced in Todorov and Valov: Any homogeneous, metric ANRANR-continuum is a VGnV^n_G-continuum provided dimGX=n1\dim_GX=n\geq 1 and Hˇn(X;G)0\check{H}^n(X;G)\neq 0, where GG is a principal ideal domain. This implies that any homogeneous nn-dimensional metric ANRANR-continuum with $\check{H}^n(X;G)\neq…

2012-08-31abs ↗pdf ↗

We consider point clouds obtained as random samples of a measure on a Euclidean domain. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. Our goal is to develop mathematical tools needed to study the consistency, as the number of availa…

2014-03-25abs ↗pdf ↗

We introduce the continuum self-similar tree (CSST) and characterize it topologically. We apply this to answer a question of Curien about the topology of the continuum random tree (CRT). We also give a topological characterization of other trees with branch points of finite or infinite valences.

2018-03-26abs ↗pdf ↗

Machine learning finds a compact fixed point action for SU(3) gauge theory.

problem Finding accurate and compact parametrizations of fixed point actions for SU(3) gauge theory.
method Used machine learning, specifically a gauge equivariant convolutional neural network.
result Obtained a superior parametrization of a fixed point action for SU(3) gauge theory.

Study shows how deep residual networks can be analyzed as shallow network ensembles for optimization.

problem Understanding why deep neural networks can be trained to zero loss despite non-convex optimization landscapes.
method Mean-field analysis of deep residual networks, focusing on their continuum limit as a two-layer network.
result Derives the first global convergence result for multilayer neural networks in the mean-field regime.

We investigated the feature map inside deep neural networks (DNNs) by tracking the transport map. We are interested in the role of depth (why do DNNs perform better than shallow models?) and the interpretation of DNNs (what do intermediate layers do?) Despite the rapid development in their application, DNNs remain anal…

2016-05-10abs ↗pdf ↗

We consider the problem of recovering a function input of a differential equation formulated on an unknown domain MM. We assume to have access to a discrete domain Mn={x1,,xn}MM_n=\{x_1, \dots, x_n\} \subset M, and to noisy measurements of the output solution at pnp\le n of those points. We introduce a graph-based Bayesian inve…

2017-06-22abs ↗pdf ↗

Continuum Dropout improves neural differential equations by preventing overfitting.

problem Overfitting in Neural Differential Equations (NDEs).
method Introduces Continuum Dropout, a regularization technique based on alternating renewal processes.
result Continuum Dropout outperforms existing methods in various tasks, improving generalization and uncertainty quantification.

Dimension reduction of multivariate data supervised by auxiliary information is considered. A series of basis for dimension reduction is obtained as minimizers of a novel criterion. The proposed method is akin to continuum regression, and the resulting basis is called continuum directions. With a presence of binary sup…

2016-06-20abs ↗pdf ↗

An important question that discrete approaches to quantum gravity must address is how continuum features of spacetime can be recovered from the discrete substructure. Here, we examine this question within the causal set approach to quantum gravity, where the substructure replacing the spacetime continuum is a locally f…

2006-04-28abs ↗pdf ↗

Generalizes Alexandroff's VnV^n-continua to cohomological dimensions.

problem Extending Alexandroff's concept of VnV^n-continua to cohomological dimensions.
method Proves that strongly locally homogeneous generalized continua with cohomological dimension nn are generalized VnV^n-spaces.
result Every strongly locally homogeneous continuum of covering dimension nn is a VnV^n-continuum in the sense of Alexandroff.

We generalize Bonahon's characterization of geometrically infinite torsion-free discrete subgroups of PSL(2, C\mathbb{C}) to geometrically infinite discrete isometry subgroups in the case of rank 1 symmetric spaces, and, under the assumption of bounded torsion, to the case of negatively pinched Hadamard manifolds. Eve…

2018-04-26abs ↗pdf ↗

In this paper, we generalize Bonahon's characterization of geometrically infinite torsion-free discrete subgroups of PSL(2, C\mathbb{C}) to geometrically infinite discrete subgroups ΓΓ of isometries of negatively pinched Hadamard manifolds XX. We then generalize a theorem of Bishop to prove that every discrete geome…

2018-01-24abs ↗pdf ↗

This paper studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.

problem Optimizing an unknown function with limited evaluations.
method Studies continuum-armed bandits under Besov smoothness conditions and derives minimax rates.
result Minimax rates over Besov spaces are identical to those over the smallest Hölder space into which Besov spaces embed.

Optimal reinsurance contracts designed for a continuum of risk types.

problem Designing optimal reinsurance contracts with a continuum of risk types.
method Principal-agent model, VaR at risk tolerance level, change of variables, univariate approach.
result Optimal reinsurance contracts are in stop-loss form, classifying agents into high and low risk groups.

We characterize those planar Peano continua that are homotopy equivalent to 1-dimensional sets. While many planar Peano continua are not homotopically 1-dimensional, we prove that each has fundamental group that embeds in the fundamental group of a 1-dimensional planar Peano continuum. We leave open the following quest…

2006-03-03abs ↗pdf ↗

We show how to associate an R-tree to the set of cut points of a continuum. If X is a continuum without cut points we show how to associate an R-tree to the set of cut pairs of X.

2009-05-15abs ↗pdf ↗

Continuum-wise hyperbolicity is exactly the pseudo-Anosov dynamics with spine singularities.

problem Classification of continuum-wise hyperbolic surface homeomorphisms
method Proving a complete structural classification
result Every cwF_F-hyperbolic homeomorphism is pseudo-Anosov with spine singularities

This paper establishes the consistency of spectral approaches to data clustering. We consider clustering of point clouds obtained as samples of a ground-truth measure. A graph representing the point cloud is obtained by assigning weights to edges based on the distance between the points they connect. We investigate the…

2015-08-08abs ↗pdf ↗

We introduce a concept of tree-graded metric space and we use it to show quasi-isometry invariance of certain classes of relatively hyperbolic groups, to obtain a characterization of relatively hyperbolic groups in terms of their asymptotic cones, to find geometric properties of Cayley graphs of relatively hyperbolic g…

2004-05-03abs ↗pdf ↗