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 …
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,742 papers · 148 categories
Trend · papers per month
48 results for “Geometric scaling”
SAEs struggle with curved activation manifolds, revealing layer-dependent scaling laws.
problem Sparse autoencoders' reconstruction error varies across layers, not fitting existing scaling laws.
method Cross-layer study of 844 SAE checkpoints, fitting and regressing on manifold geometry.
result Manifold geometry predicts layer-dependent width exponents in SAEs, with transferable coefficients.
This paper proposes a new method for learning covers of geometric datasets to improve topological inference and visualization.
problem Improving topological inference and visualization of large-scale geometric datasets.
method Proposes a method for learning topologically-faithful covers of geometric datasets using optimization.
result Simplicial complexes obtained from learned covers outperform standard methods in terms of size and representation of large-scale topology.
Finite-Time Queue Peak Laws in Stochastic Networks: Logarithmic Scaling After Geometric Thresholdsmath.PR
Finite-time queue peaks in stochastic networks have logarithmic scaling after geometric thresholds.
problem Queue peak laws in stochastic networks with geometric thresholds.
method Self-normalization mechanism
result Logarithmic scaling of queue peaks after geometric thresholds.
Study shows how electromagnetic and gravitational waves can form trapped surfaces.
problem Formation of trapped surfaces from initial data with electromagnetic fields.
method Established a scale-critical semi-global existence result from past null infinity for the Einstein-Maxwell system.
result Generalized approach for studying Einstein vacuum equations and extended a result to scale-critical regime.
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.
Linear and Regular Kepler-Manev Dynamics via Projective Transformations: A Geometric Perspectivemath-ph
Geometrically transforms nonconservative dynamics to linearize Kepler and Manev systems.
problem Regularizing and linearizing nonconservative central force dynamics.
method Projective transformation and conformal scaling in configuration and phase spaces.
result Full linearization of Kepler and Manev dynamics in any finite dimension.
New method selects diffusion scales for graph wavelets.
problem Choosing optimal diffusion scales for graph wavelets.
method Proposes an unsupervised method using information theory.
result Method selects diffusion scales for graph wavelets.
Hyperfitting improves LLM generation quality by enhancing diversity, contrary to simple temperature scaling.
problem Improving open-ended generation quality of LLMs with minimal fine-tuning effort.
method Demonstrates that hyperfitting, a phenomenon where LLMs are fine-tuned to near-zero training loss, enhances generation quality and mitigates repetition.
result Hyperfitting is distinct from temperature scaling and involves a dynamic, context-dependent rank reordering mechanism in the final transformer block.
Geometrically transforms word embeddings into a common space for better comparison.
problem Comparing embeddings from different sources is challenging.
method Applies orthogonal rotations and Mahalanobis scaling to transform embeddings into a shared latent space.
result The method improves word similarity and analogy tasks.
The paper proves inequalities for closed surfaces involving mean curvature.
problem Proving geometric inequalities for closed surfaces in Euclidean space.
method Verification of inequalities for convex surfaces and addressing Topping's conjecture.
result Optimal scaling law between Willmore energy and isoperimetric ratio for convex surfaces.
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.
problem Understanding the large-scale geometry of halo groups.
method Introduces halo products and builds a geometric framework.
result Provides refined invariants distinguishing halo groups up to quasi-isometry.
A new geometric method approximates slow invariant manifolds without explicit time-scale separation.
problem Approximating slow invariant manifolds in systems with multiple time-scales.
method Geodesic Stretching and Flow Curvature methods translated into tensorial constructions of Riemannian geometry.
result The method approximates normally attracting invariant manifolds without requiring explicit time-scale separation.
The paper analyzes geometric densities and compression radii for knot types.
problem Optimizing geometric quantities associated with knot types.
method Develops a factorization framework for scale-covariant size functionals.
result Different minimizing sequences for density, compression, packing, and ropelength problems.
GETF efficiently decomposes large-scale Boolean tensors.
problem Efficiently factorizing large-scale Boolean tensors.
method Geometric Expansion for all-order Tensor Factorization (GETF).
result GETF significantly improves reconstruction accuracy and efficiency.
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.
problem The singularity structure of FLRW spacetimes without particle horizons at the -level.
method Analyzing the singularity structure of FLRW spacetimes with constant spatial curvature.
result A geometric obstruction prevents continuous spacetime extensions for a wide range of scale factors in the case of .
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.
problem Difficulty in comparing semantic structures across different neural network models.
method Collection of latent representations from 1700 pretrained models across various benchmarks.
result Consistent semantic organization across models and datasets.
New criterion for Weyl law on Riemannian manifolds without standard assumptions.
problem Establishing Weyl law for Schrödinger operators on complete Riemannian manifolds.
method Identifying a geometric-analytic invariant that balances manifold geometry, potential growth, and oscillation scale.
result Weyl asymptotic holds if approaches 0 as λ goes to infinity.
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 …
Heat-Kernel Entropy Profiles and Geometric Effective Sample Size for Weighted Measures on Manifoldsstat.ML
New summary measures reveal geometric structure in weighted measures on manifolds.
problem Lack of geometric information in standard weight-only summaries.
method Heat-kernel entropy profiles, tracking nonuniformity across scales.
result Geometric effective sample size discounts nearby or duplicate particles.
A new model for defective media using two scales.
problem Modeling defects in media with two scales.
method Generalization of Riemann-Cartan manifolds and fibre bundle theory, constructing a first-order placement map.
result Emergent behaviors like dislocations and disclinations arise from the interaction of macroscopic and microscopic 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.
problem Symmetries in datasets like rotations and scalings.
method Geometric learning using principal fiber bundles.
result 2-parameter family of canonical curve parameterizations.
Yau's Affine Normal Descent optimizes smooth unconstrained problems with geometrically adapted directions.
problem Optimizing smooth unconstrained problems with geometrically adapted directions.
method Yau's Affine Normal Descent (YAND) uses the equi-affine normal of level-set hypersurfaces as search directions.
result YAND converges globally under standard smoothness assumptions and locally quadratically near nondegenerate minimizers.
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.
problem Modeling and analyzing signed multivariate tail-dependence across different thresholds.
method Developed a geometric witness framework to represent and invert signed tail families, identifying nonnegative weights and normalized masses.
result Characterization and synthesis of signed multivariate tail-dependence at finite thresholds, preserving the complete signed tail family throughout.
Analyzed geometric and diffusion properties of a coupled system.
problem Qualitative behavior of a geometric evolution coupled with diffusion.
method Mean curvature flow scaled with diffusion equation analysis.
result Surface area strictly decreases, but solutions can exist infinitely.
Unified model learns from proteins and ligands for drug design.
problem Disjoint data sources and modeling assumptions limit joint use of structure- and ligand-based drug design.
method Contrastive Geometric Learning for Unified Computational Drug Design (ConGLUDe)
result Unified model achieves competitive zero-shot virtual screening performance and state-of-the-art ligand-conditioned pocket selection.
Extracts geometric information from point-clouds for multiclass classification.
problem Multiclass Classification with labeled point-clouds.
method Stochastic partial orderings and label embedding trees.
result Computes multiscale geometries for explainable prediction and error-free labeling.
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.
problem Large-scale topological properties of groups and spaces.
method Introducing a coarse analog of Lusternik-Schnirelmann category for metric spaces.
result Established lower and upper bounds for geometrically finite and bicombable groups.
Geometric AD framework simplifies derivative computation in JAX.
problem Efficient and accurate automatic differentiation.
method Jet functors and Weil algebras for geometric analysis.
result Unified view of derivative propagation with algebraic exactness.
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.
problem Understanding the generalization capabilities of deep neural networks.
method Derive a new upper bound on generalization error using margin-normalized geometric complexity.
result Empirical validation of the bound for ResNet-18 on CIFAR-10 and CIFAR-100 datasets.
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.
problem Calculating Ricci curvature for weighted Riemannian manifolds.
method Asymptotic retrieval of generalized Ricci tensor from scaled metric derivatives of Wasserstein 1-distances.
result Limiting coarse curvature of random graphs converges to generalized Ricci tensor.
Deep networks improve by progressively refining approximations at each layer.
problem Standard approximation theory doesn't explain the role of intermediate layers in deep neural networks.
method Developed a mixed-activation architecture with a geometric scale interpretation of depth.
result Each intermediate layer approximates the target function with a geometric rate.
Temperature scaling improves model uncertainty but not diversity in LLMs.
problem Improving the calibration and stochasticity of probabilistic models.
method Investigates theoretical properties of temperature scaling in classification and LLMs.
result Temperature scaling increases model uncertainty but not diversity in LLMs.
A Python implementation of some geometric tools on Kendall 3D shape space for practical applicationsstat.CO
Python tools for 3D shape analysis on Kendall's space.
problem Lack of practical utilities for advanced 3D shape analysis.
method Developed Python tools for 3D shape analysis on Kendall's 3D Shape Space.
result Efficient, accessible software solutions for researchers.
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 …