New metrics derived from Hölder distortion on Hitchin components.
problem Deriving metrics on Hitchin components from Hölder distortion.
method Expressing Thurston's metric in terms of Hölder regularity of boundary maps, associating stratified loci, and measuring relative Hölder distortion.
result First known geometrically significant complete metrics on Hitchin components for n>3. Foundation models fail to preserve continuous geometry, identified as the Geometric Alignment Tax.
problem Continuous geometry is lost in foundation models due to discrete categorical bottlenecks.
method Controlled ablations on synthetic systems and evaluation of 14 biological models using rate-distortion theory and MINE.
result Replacing cross-entropy with a continuous head reduces geometric distortion by up to 8.5x.
New stretch maps minimize distortion in geometric group theory.
problem Finding optimal maps in geometric group theory.
method Proving minimizers using modulus of curve families and MSP.
result Stretch maps are minimizers of mean quasiconformal distortion.
We study geometric properties of stabilisers in the handlebody group. We find that stabilisers of meridians are undistorted, while stabilisers of primitive curves or annuli are exponentially distorted for large enough genus.
Let g:S↬N be a properly immersed π1--injective surface in a non-geometric 3--manifold N. We compute the distortion of π1(S) in π1(N) and show that how it is related to separability of π1(S) in π1(N). The only possibility of the distortion is linear, quadratic, exponential, an…
The paper proposes methods for volumetric parameterization of 3D solid manifolds.
problem Complex structure of solid manifolds makes conventional approaches ineffective.
method Incorporates models to preserve geometric structure, achieve density equalization, and balance distortions.
result Various 3D manifold parameterizations with different properties can be achieved.
Maps persistence diagrams into Hilbert and Euclidean spaces with explicit distortions.
problem Embedding persistence diagrams into Euclidean spaces for statistical analysis.
method Explicit geometric maps with distortion functions.
result Controlled geometric information loss through explicit distortion functions.
Researchers prove inner product recovery is impossible in latent space models.
problem Recovering inner products in latent space models with random geometric graphs.
method Rate-distortion theory applied to Gaussian or spherical latent locations.
result Impossible to recover inner products if dimensionality exceeds nh(p), matching positive results' conditions. QC-SPHARM detects Alzheimer's Disease early using hippocampal surface geometry.
problem Early detection of Alzheimer's Disease (AD) using hippocampal surface geometry.
method Spherical harmonics registration, conformality and curvature distortions quantification, t-test feature selection, SVM classification.
result 85.2% testing accuracy on ADNI data, 81.2% on aMCI progression data.
Proposes a neural network method to correct residual distortions in coordinate transformations.
problem Nonlinear and spatially dependent distortions in coordinate transformation models.
method Residual-based neural network approach focusing on systematic distortions.
result The method improves accuracy and stability in challenging conditions.
Paper shows geometric frequency and Lagrange derivative equivalence for electric and fluid systems.
problem Understanding and classifying system operating conditions based on electric quantity waveform distortions.
method Demonstrates equivalence between geometric frequency and Lagrange derivative through numerical examples.
result Identifies components of Lagrange derivative that relate to geometric frequency and waveform distortions.
Given a finite metric CW complex X and an element α∈πn(X), what are the properties of a geometrically optimal representative of α? We study the optimal volume of kα as a function of k. Asymptotically, this function, whose inverse, for reasons of tradition, we call the volume distortion, turns out to be an…
New approach connects robust learning to privacy issues.
problem Vulnerability of deep neural networks to adversarial examples.
method Privacy-utility tradeoff and rate-distortion theory.
result Found saddle point via maximum conditional entropy problem.
New method uses iterated integrals to bridge geometric and homotopy information.
problem Lack of effective methods to connect geometric and homotopy information.
method Introducing Chen's iterated integrals on loop spaces.
result Upper bounds for Gromov's distortion and non-existence of small-volume cycles.
We propose the first global accelerated gradient method for Riemannian manifolds. Toward establishing our result we revisit Nesterov's estimate sequence technique and develop an alternative analysis for it that may also be of independent interest. Then, we extend this analysis to the Riemannian setting, localizing the …
MLDL preserves manifold geometry in vector transformations.
problem Geometric deterioration in neural network transformations.
method Locally isometric smoothness (LIS) and Markov random field (MRF) encoding.
result Enhanced vector transformations into well-behaved metric homeomorphisms.
Given a simplicial complex K, we consider several notions of geometric complexity of embeddings of K in a Euclidean space Rd: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL embedding). We show that any n-complex with N simplices which topologically…
We study some relation between some geometrically defined classes of diffeomorphisms between manifolds and the Lq,p-cohomology of these manifolds. Some applications to vanishing and non vanishing results in Lq,p-cohomology are given.
Extends likelihood ratio exponential families to analyze various optimization methods.
problem Analyzing optimization methods like rate-distortion and information bottleneck.
method Linking geometric mixture paths to exponential families and using hypothesis testing.
result Provides a common mathematical framework for understanding these methods.
Study bounds on curvature for special Finsler metrics.
problem Curvature and topological properties of ∞-Einstein Finsler metrics. method Construct special metrics, analyze equivalence, impose curvature bounds.
result Establish bounds for curvature and distortion on ∞-Einstein Finsler manifolds. New method learns disentangled representations using Gromov-Monge maps.
problem Learning disentangled representations from unlabelled data.
method Introduces a novel approach based on Gromov-Monge maps to preserve geometric features while aligning data distributions.
result Demonstrates effectiveness on four benchmarks, outperforming other methods.
Method flattens complex surfaces with consistent density and shape.
problem Shape deformations and local geometric distortions in density-equalizing maps for multiply-connected surfaces.
method Formulates density diffusion as a quasiconformal flow, solving an energy minimization problem involving the Beltrami coefficient to ensure bijectivity and control distortion.
result Achieves optimal parameterization of multiply-connected surfaces with bijective and controlled geometric distortions.
We consider several ways to measure the `geometric complexity' of an embedding from a simplicial complex into Euclidean space. One of these is a version of `thickness', based on a paper of Kolmogorov and Barzdin. We prove inequalities relating the thickness and the number of simplices in the simplicial complex, general…
Optimizes maps with controlled distortion for geometric tasks.
problem Free-boundary diffeomorphism optimization in geometric modeling.
method Least-squares quasiconformal (LSQC) operator and Spectral Beltrami Network (SBN).
result LSQC minimizer well-posed under mild conditions, stable under mesh refinement.
New framework uses cohomology to analyze probabilistic distortions and arbitrage.
problem Analyzing probabilistic distortions and arbitrage in categorical filtrations.
method Transport cohomological framework, simplicial structure, loop effects, holonomy.
result Nontrivial probabilistic distortions and obstructions generated by loops.
The input data features set for many data driven tasks is high-dimensional while the intrinsic dimension of the data is low. Data analysis methods aim to uncover the underlying low dimensional structure imposed by the low dimensional hidden parameters by utilizing distance metrics that consider the set of attributes as…
We formulate an optimal stopping problem for a geometric Brownian motion where the probability scale is distorted by a general nonlinear function. The problem is inherently time inconsistent due to the Choquet integration involved. We develop a new approach, based on a reformulation of the problem where one optimally c…
A framework compares image representations based on local geometry.
problem Comparing image representations based on global structure overlooks local differences.
method Quantify local geometry using Fisher information matrix and optimize differentiation with principal distortions.
result Identifies differences in local sensitivities between models.
Vertex distortion detects if a knot is unknot.
problem Determining if a knot is the unknot.
method Using Denne-Sullivan's bound on Gromov distortion, the vertex distortion of nontrivial lattice knots is bounded. Then, it is shown that trivial vertex distortion implies the unknot.
result The conjecture that trivial vertex distortion implies the unknot is proven.
IsUMap improves data visualization of complex geometries.
problem Accurately representing complex, locally distorted metric spaces.
method Integrates UMAP and Isomap with Vietoris-Rips filtrations.
result Significant improvements in data representation quality.
Study homeomorphism groups of ordinals, proving strong distortion and normal generators.
problem Understanding algebraic and geometric properties of homeomorphism groups of ordinals.
method Analyzing successor ordinals with connections to permutation groups and manifolds.
result Proves strong distortion and normal generators for homeomorphism groups of ordinals.
Algorithm finds optimal affine transformation to minimize overall distortion.
problem Minimizing distortion in affine transformations.
method Riemannian geometry approach to define and minimize distortion.
result Mean distorting transformation found for minimizing overall distortion.
LIMP learns latent shapes with metric preservation, improving generative models.
problem Insufficient training data for high-fidelity latent representations.
method Metric preservation as a prior, geometric distortion criterion, geodesic loss.
result Synthetic samples of higher quality achieved through metric preservation.
Conventional SVM-based image coding methods are founded on independently restricting the distortion in every image coefficient at some particular image representation. Geometrically, this implies allowing arbitrary signal distortions in an n-dimensional rectangle defined by the ε-insensitivity zone in eac…
Geometric framework analyzes bias in variational inference for posterior functionals.
problem Analyzing the bias of posterior functionals under variational approximations.
method Developed a geometric framework to evaluate the bias of posterior functionals using the variational tangent space.
result The leading-order bias of a posterior functional is determined by its component orthogonal to the variational tangent space.
A geometric analysis of protein folding, which complements many of the models in the literature, is presented. We examine the process from unfolded strand to the point where the strand becomes self-interacting. A central question is how it is possible that so many initial configurations proceed to fold to a unique fina…
Vertex distortion measures how far lattice knots deviate from straight lines.
problem Measuring how much lattice knots deviate from straight paths.
method Analogous to smooth knots, study vertex distortion in lattice knots.
result Vertex distortion is 1 only for the unknot and can be arbitrarily high.
We consider the problem of distortion minimal morphing of n-dimensional compact connected oriented smooth manifolds without boundary embedded in Rn+1. Distortion involves bending and stretching. In this paper, minimal distortion (with respect to stretching) is defined as the infinitesimal relative change in vol…
This paper shows how to calculate risk measures for sums of two counter-monotonic risks.
problem Calculating risk measures for sums of two counter-monotonic risks.
method Using a fixed distortion function and expressing the risk measure of a sum as the sum of two related measures of the marginals.
result The risk measure of a sum of two counter-monotonic risks can be expressed as the sum of two related distortion risk measures of the marginals.
This paper clarifies VAE's property through geometric and information-theoretic interpretations.
problem The transparency of VAE model is an underlying issue.
method Quantitative understanding of VAE through differential geometry and information theory.
result VAE can be mapped to an implicit isometric embedding with a scale factor derived from the posterior parameter.
Most distortion correction methods focus on simple forms of distortion, such as radial or linear distortions. These works undistort images either based on measurements in the presence of a calibration grid, or use multiple views to find point correspondences and predict distortion parameters. When possible distortions …
We consider the problem of stopping a diffusion process with a payoff functional that renders the problem time-inconsistent. We study stopping decisions of naive agents who reoptimize continuously in time, as well as equilibrium strategies of sophisticated agents who anticipate but lack control over their future selves…
Study distortion risk measures for step-weighted distributions.
problem Analyzing risk measures for specific distribution types.
method Investigate distortion risk measures of step-weighted distributions.
result Developed methods for calculating risk measures.
Develops a unified framework for computing n-dimensional quasi-conformal mappings.
problem Effective mapping methods for higher-dimensional objects with geometric constraints.
method Variational model integrating quasi-conformal distortion, volumetric distortion, and other factors.
result Existence and efficient numerical methods for solving the optimization problem.
The distortion of a curve measures the maximum arc/chord length ratio. Gromov showed any closed curve has distortion at least pi/2 and asked about the distortion of knots. Here, we prove that any nontrivial tame knot has distortion at least 5pi/3; examples show that distortion under 7.16 suffices to build a trefoil kno…
Computed distortion coefficients for the α-Grushin plane.
problem Analyzing the distortion coefficients of the α-Grushin plane.
method Using generalised trigonometric functions and synthetic curvature conditions.
result Estimates for distortion coefficients and a curvature condition conjecture.
Study on risk measures using distorted Choquet integrals with random distortions.
problem Developing risk measures under random distortions of capacities.
method Introducing and analyzing randomly distorted Choquet integrals with respect to a distorted capacity, establishing properties and providing representations.
result Representation of comonotonic additive conditional risk measures using G-randomly distorted Choquet integrals.
Deep generative models provide a systematic way to learn nonlinear data distributions, through a set of latent variables and a nonlinear "generator" function that maps latent points into the input space. The nonlinearity of the generator imply that the latent space gives a distorted view of the input space. Under mild …