The authors study the method of scaling in the context of the study of automorphism groups of complex domains in multiple dimensions. Various types of scaling techniques are compared and contrasted. Applications are given in a number of areas of complex geometric analysis. Relations with other parts of mathematics are …
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.
Trend · papers per month
SAEs struggle with curved activation manifolds, revealing layer-dependent scaling laws.
This paper proposes a new method for learning covers of geometric datasets to improve topological inference and visualization.
Finite-time queue peaks in stochastic networks have logarithmic scaling after geometric thresholds.
Study shows how electromagnetic and gravitational waves can form trapped surfaces.
We realize Stasheff's multiplihedron geometrically as the moduli space of stable quilted disks. This generalizes the geometric realization of the associahedron as the moduli space of stable disks. We show that this moduli space is the non-negative real part of a complex moduli space of stable scaled marked curves.
Geometrically transforms nonconservative dynamics to linearize Kepler and Manev systems.
New method selects diffusion scales for graph wavelets.
Hyperfitting improves LLM generation quality by enhancing diversity, contrary to simple temperature scaling.
Geometrically transforms word embeddings into a common space for better comparison.
The paper proves inequalities for closed surfaces involving mean curvature.
Predictive geometric models deliver excellent results for many Machine Learning use cases. Despite their undoubted performance, neural predictive algorithms can show unexpected degrees of instability and variance, particularly when applied to large datasets. We present an approach to measure changes in geometric models…
Introduces halo products and studies their geometric properties.
The paper analyzes geometric densities and compression radii for knot types.
GETF efficiently decomposes large-scale Boolean tensors.
We define and discuss the notion of pseudospherical surfaces in asymptotic coordinates on time scales. Thus we extend well known notions of discrete pseudospherical surfaces and smooth pseudosperical surfaces on more exotic domains (e.g, the Cantor set). In particular, we present a new expression for the discrete Gauss…
The paper proves that certain FLRW spacetimes cannot be extended past the big bang.
We study the large-scale geometry of 3-manifolds with nontrivial 2-dimensional bounded cohomology, with a view to proving a weak version of the geometrization conjecture for such manifolds.
We draw elliptic regularity results for 4-manifolds with an elliptic system, without Sobolev constant control. Direct use of analysis is circumvented; the results come mainly through geometric and topological arguments. In contrast to our previous paper, which worked predominantly on the scale of the curvature radius, …
SEMASIA provides a large dataset of latent representations for model comparison.
New criterion for Weyl law on Riemannian manifolds without standard assumptions.
We propose a system for calculating a "scaling constant" for layers and weights of neural networks. We relate this scaling constant to two important quantities that relate to the optimizability of neural networks, and argue that a network that is "preconditioned" via scaling, in the sense that all weights have the same…
We describe conditions under which a spacetime connection and a scaled Lorentzian metric define natural symplectic and Poisson structures on the tangent bundle of the Einstein spacetime.
Integral invariants obtained from Principal Component Analysis on a small kernel domain of a submanifold encode important geometric information classically defined in differential-geometric terms. We generalize to hypersurfaces in any dimension major results known for surfaces in space, which in turn yield a method to …
New summary measures reveal geometric structure in weighted measures on manifolds.
A new model for defective media using two scales.
Let be a group acting properly and by isometries on a metric space ; it follows that the quotient or orbit space is also a metric space. We study the Vietoris-Rips and Čech complexes of . Whereas (co)homology theories for metric spaces let the scale parameter of a Vietoris-Rips or Čech complex go to z…
Method learns symmetries in curves without augmentation.
Yau's Affine Normal Descent optimizes smooth unconstrained problems with geometrically adapted directions.
The matching of multiple objects (e.g. shapes or images) is a fundamental problem in vision and graphics. In order to robustly handle ambiguities, noise and repetitive patterns in challenging real-world settings, it is essential to take geometric consistency between points into account. Computationally, the multi-match…
Geometric framework for signed multivariate tail-dependence compatibility at various thresholds.
Analyzed geometric and diffusion properties of a coupled system.
Unified model learns from proteins and ligands for drug design.
Extracts geometric information from point-clouds for multiclass classification.
We study the large scale geometry of the upper triangular subgroup of PSL(2,Z[1/n]), which arises naturally in a geometric context. We prove a quasi-isometry classification theorem and show that these groups are quasi-isometrically rigid with infinite dimensional quasi-isometry group. We generalize our results to a lar…
New coarse LS-category introduced for groups and spaces.
Geometric AD framework simplifies derivative computation in JAX.
We develop and analyze a procedure for gradient-based optimization that we refer to as stochastically controlled stochastic gradient (SCSG). As a member of the SVRG family of algorithms, SCSG makes use of gradient estimates at two scales, with the number of updates at the faster scale being governed by a geometric rand…
We introduce a method called multi-scale local shape analysis, or MLSA, for extracting features that describe the local structure of points within a dataset. The method uses both geometric and topological features at multiple levels of granularity to capture diverse types of local information for subsequent machine lea…
We present a geometric formulation of the Multiple Kernel Learning (MKL) problem. To do so, we reinterpret the problem of learning kernel weights as searching for a kernel that maximizes the minimum (kernel) distance between two convex polytopes. This interpretation combined with novel structural insights from our geom…
New bound on neural network generalization error using geometric complexity.
We show that uniformly finite homology of products of trees vanishes in all degrees except degree , where it is infinite dimensional. Our method is geometric and applies to several large scale homology theories, including almost equivariant homology and controlled coarse homology. As an application we determine …
New method calculates Ricci curvature from distances between weighted volumes.
Deep networks improve by progressively refining approximations at each layer.
Temperature scaling improves model uncertainty but not diversity in LLMs.
Python tools for 3D shape analysis on Kendall's space.
We develop a theory to represent dislocated single crystals at the mesoscopic scale by considering concentrated effects, governed by the distribution theory combined with multiple-valued kinematic fields. Our approach gives a new understanding of the continuum theory of defects as developed by Kroener (1980) and other …
Some model reduction techniques for multiple time-scale dynamical systems make use of the identification of low dimensional slow invariant attracting manifolds (SIAM) in order to reduce the dimensionality of the phase space by restriction to the slow flow. The focus of this work is on a proposition and discussion of a …