Unified framework for non-Euclidean CPD under scalable stochastic mirror descent.
problem Handling non-Euclidean losses in tensor decomposition.
method Tensor fiber sampling strategy-based stochastic mirror descent.
result Global convergence to a stationary point under reasonable conditions.
Graph-based methods provide a powerful tool set for many non-parametric frameworks in Machine Learning. In general, the memory and computational complexity of these methods is quadratic in the number of examples in the data which makes them quickly infeasible for moderate to large scale datasets. A significant effort t…
DFNNs predict non-Euclidean responses from Euclidean predictors.
problem Regression with non-Euclidean responses.
method Deep Fréchet neural networks (DFNNs) approximating conditional Fréchet means.
result DFNNs consistently outperform existing methods in empirical studies.
Ricci flow emerges from renormalizing nonlinear Sigma models.
problem Understanding the renormalization group flow in nonlinear Sigma models.
method Using Euclidean algebraic quantum field theory and Wick ordering.
result The first-order renormalization group flow of nonlinear Sigma models equals the Ricci flow.
In this paper, using the framework of equivariant differential geometry, we study proper SO(p+1)×SO(q+1)-invariant biconservative hypersurfaces into the Euclidean space Rn (n=p+q+2) and proper SO(p+1)-invariant biconservative hypersurfaces into the Euclidean space Rn (n=p+2). Mo…
The study compares Euclidean and cosine distances in medical drug prescription prediction.
problem Comparing Euclidean and cosine distances in medical drug prescription prediction.
method Established geometric properties and compared distances in real-world medical data.
result Different distances lead to different optimizing nonlinear kernel embedding frameworks.
The problem of the invariant classification of the orthogonal coordinate webs defined in Euclidean space is solved within the framework of Felix Klein's Erlangen Program. The results are applied to the problem of integrability of the Calogero-Moser model.
New framework improves robustness of implicit neural networks.
problem Ill-posedness and convergence instability in implicit neural networks.
method NEMON framework based on contraction theory for ℓ∞ norm, including well-posedness condition, average iteration, and input-output Lipschitz constant regularization. result Improved accuracy and robustness of implicit models with smaller input-output Lipschitz bounds.
In this paper, we consider the problem of fast and efficient indexing techniques for sequences evolving in non-Euclidean spaces. This problem has several applications in the areas of human activity analysis, where there is a need to perform fast search, and recognition in very high dimensional spaces. The problem is ma…
Paper extends causal inference to non-Euclidean data like images and distributions.
problem Causal inference for non-Euclidean data like images and distributions.
method Hilbert space embeddings, Fréchet mean estimation, nonparametric doubly-debiased causal inference.
result Validated approach for causal inference with continuous treatments on non-Euclidean data.
Unified framework for Riemannian deep learning across manifold-valued representations.
problem Deep learning on manifold-valued representations often relies on Euclidean approximations or costly geometric operations.
method Develops reusable neural modules, manifold-specific network architectures, and geometric designs.
result Generalizes batch normalization and multinomial logistic regression to broader classes of manifolds.
Unified framework for Riemannian deep learning across manifold-valued representations.
problem Deep learning on manifold-valued data lacks reusable modules, specific network architectures, and efficient geometric operations.
method Develops reusable neural modules, manifold-specific network architectures, and geometric designs for broad classes of Lie groups and gyrogroups.
result Generalizes batch normalization and multinomial logistic regression to Riemannian manifolds, including SPD and hyperbolic spaces.
A new geometric framework embeds correlation matrices into Euclidean space for scalable brain network analysis.
problem Inefficient and unstable analysis of functional brain networks in high-dimensional contexts.
method Diffeomorphic transformations to embed correlation matrices into Euclidean space, preserving manifold properties.
result Improved computational speed and enhanced accuracy compared to conventional manifold-based approaches.
We analyze Riemannian accelerated methods using a new framework.
problem Understanding Riemannian accelerated gradient methods.
method Riemannian A-HPE framework, focusing on Euclidean A-HPE insights and metric distortion control.
result Characterization of acceleration for various Riemannian methods.
Develops log-Euclidean Lie groups for SPD and correlation matrices.
problem Unifies various log-Euclidean constructions for SPD and correlation matrices.
method Theory and explicit isometries linking different log-Euclidean metrics.
result Explicit log-Euclidean metrics on SPD and correlation matrices.
A new optimization method handles Euclidean bounds efficiently.
problem Optimization problems with Euclidean bounds.
method Riemannian limited-memory BFGS method combining quasi-Newton and Riemannian adaptations.
result Outperforms existing methods by several orders of magnitude.
New framework improves EM algorithm convergence under log-Sobolev inequality.
problem Improving convergence of the EM algorithm.
method Extending gradient flow techniques to EM algorithm, using free energy representation.
result Exponential convergence of EM algorithm under log-Sobolev inequality.
Develops weak formulation for spacelike flows in pseudo-Euclidean space.
problem Weak formulation of spacelike mean curvature flow in pseudo-Euclidean space.
method Based on spacelike integer rectifiable varifolds and pseudo-Euclidean first variation.
result Existence and compactness of spacelike Brakke flows with fixed boundary.
Paper proposes a method to recover point configurations from noisy distance data.
problem Recovering point configurations from noisy distance data.
method Robust Euclidean Distance Geometry via Dual Basis (RoDEoDB) algorithm.
result Exact recovery guarantees for point configuration and Gram matrix under mild conditions.
New graph convolution captures local features on non-Euclidean grids.
problem Capturing local features on irregular, coarse non-Euclidean grids.
method Low-rank learnable local filters in graph convolutions.
result Proves more expressive than previous spectral graph convolution methods.
UNOT solves optimal transport problems efficiently using neural networks.
problem Computational expense in solving optimal transport problems.
method UNOT (Universal Neural Optimal Transport) uses Fourier Neural Operators to predict OT distances and plans accurately and efficiently.
result UNOT achieves up to 7.4x speedup over the Sinkhorn algorithm while maintaining accuracy.
Mathematical framework for minimum enclosing ball problem.
problem Determining the smallest sphere enclosing a set in d-dimensional space.
method Theoretical framework based on enclosing and partitioning theorems.
result Bounds and relations between circumradius, inradius, diameter, and width.
Non-Euclidean BPM extends optimization theory to non-Euclidean norms.
problem Extending BPM's convergence theory to non-Euclidean norms.
method Iteratively minimizing over norm balls in non-Euclidean geometry.
result Most BPM guarantees carry over to non-Euclidean norms.
Study bubbling Kahler metrics using algebraic geometry.
problem Analyzing the degeneration of Kahler metrics with Euclidean volume growth.
method Algebraic construction of birational modifications to simplify degenerations, comparing with analytic constructions.
result Provide a framework to compare algebraic and analytic approaches to bubbling phenomena.
Almost-euclidean inequalities proved in spaces with local Ricci curvature bounds.
problem Proving almost-euclidean inequalities in spaces with local Ricci curvature bounds.
method Using Perelman's pseudo locality theorem and optimal transportation in non-smooth spaces.
result Almost-euclidean isoperimetric inequalities established in metric balls.
Formula derived for Laplace-Beltrami on Stiefel manifold.
problem Finding Laplace-Beltrami operator on Stiefel manifold.
method Using the general framework of Laplace operators on constraint manifolds, derived the explicit formula in terms of ambient Euclidean coordinates.
result Extended previously known formulas for sphere and special orthogonal group.
Study on curvature measures in non-Euclidean spaces linked to Euclidean geometry.
problem Investigating curvature measures in spherical, hyperbolic, and de Sitter spaces.
method Establishing a unifying framework for curvature measures in real-analytic spaces of constant curvature.
result Floating bodies and duality in non-Euclidean spaces are connected to curvature measures in Euclidean space.
This paper autoformalizes Euclidean geometry using LLMs and theorem provers.
problem Challenges in formalizing Euclidean geometry due to reliance on diagrams.
method Combines neuro-symbolic framework, SMT solvers, and LLMs to fill in diagrammatic gaps.
result Demonstrates the capability and limitations of LLMs on autoformalizing geometry problems.
LOT framework speeds up event distance computation in collider physics.
problem Computational inefficiency in quantifying event distances.
method Linearized Optimal Transport (LOT) for efficient computation.
result LOT significantly reduces computational cost without sacrificing accuracy.
Novel framework for uncertainty quantification in metric spaces.
problem Uncertainty quantification in regression models with metric responses.
method Developed algorithms for large datasets, agnostic to predictive models, with asymptotic and non-asymptotic guarantees.
result Asymptotic and non-asymptotic guarantees for special cases, demonstrated in clinical applications.
Graph Gaussian processes use Matérn models for better function learning.
problem Lack of Gaussian process models for graph input spaces.
method Stochastic partial differential equation characterization of Matérn Gaussian processes.
result Graph Matérn Gaussian processes inherit properties of Euclidean and Riemannian models and can be trained efficiently.
Extends manifold learning to non-Euclidean metrics.
problem Applying manifold learning to data in non-Euclidean spaces.
method Generalizes manifold learning to metric spaces and studies conditions for convergence.
result Conditions for the convergence of graph Laplacian in metric spaces.
The paper classifies and studies conformally flat hypersurfaces in 4D space.
problem Understanding conformally flat hypersurfaces in 4D space.
method Using Möbius geometry, the paper classifies and investigates the global behavior of these hypersurfaces.
result Examples of conformally flat hypersurfaces include cones, cylinders, and rotational hypersurfaces over surfaces with constant Gaussian curvature.
A new method compares unaligned datasets using log-Euclidean signatures of SPD matrices.
problem Efficiently comparing datasets with unknown alignment.
method Diffusion operators, Riemannian geometry, log-Euclidean metric.
result LES distance recovers meaningful structural differences, outperforming existing methods.
This report concerns the problem of dimensionality reduction through information geometric methods on statistical manifolds. While there has been considerable work recently presented regarding dimensionality reduction for the purposes of learning tasks such as classification, clustering, and visualization, these method…
Extends diffusion models to non-Euclidean spaces with geometric priors.
problem Difficulties in natural sciences with symmetries and non-Euclidean data.
method Constructs a noising process and neural network equivariant to symmetry group, approximates score function.
result Model can generate complex scalar and vector fields on synthetic and real-world data.
EF21-Muon optimizes deep learning with error feedback, improving efficiency and accuracy.
problem Lack of principled distributed frameworks for non-Euclidean LMO-based optimizers.
method Introduces EF21-Muon, a communication-efficient, non-Euclidean LMO-based optimizer with convergence guarantees.
result First efficient distributed implementation of non-Euclidean LMO-based optimizers, achieving up to 7x communication savings.
Gradient descent near stability threshold shows sharpness oscillations.
problem Understanding sharpness and stability in non-Euclidean norms during gradient descent.
method Interpreted EoS through Directional Smoothness, defined generalized sharpness for arbitrary norms.
result Non-Euclidean GD exhibits sharpness oscillations around the stability threshold.
Gradient descent near stability threshold exhibits sharpness oscillations.
problem Understanding sharpness behavior near stability threshold in non-Euclidean norms.
method Interpreted EoS through Directional Smoothness and generalized sharpness under arbitrary norms.
result Non-Euclidean GD with generalized sharpness shows sharpness oscillations near 2/η. Free boundary minimal submanifolds with boundaries on concentric spheres
problem Finding minimal submanifolds with boundaries on concentric spheres in Euclidean space
method Using a Steklov problem with an indefinite weight
result Exact Morse index of an m-dimensional flat annulus in an n-dimensional spherical shell This paper explains a technique for proving geometric inequalities.
problem Proving various geometric inequalities in different contexts.
method Unified framework based on Alexandrov-Bakelman-Pucci technique.
result Unified approach to proving geometric inequalities.
The paper introduces a new geometric representation for data.
problem Representing tree-like data more effectively in non-Euclidean spaces.
method Develops a representation on a pseudo-Riemannian manifold of constant nonzero curvature.
result Provides closed-form expressions for distances and descent directions.
A framework for network embedding using VDS principles.
problem Challenges in systematically studying network embedding algorithms.
method Veridical Data Science (VDS) framework applied to network embedding.
result Potential for new research directions in network embedding.
Unified framework for human motion generation on Riemannian manifolds.
problem Learning valid human motion in Euclidean spaces.
method Riemannian Motion Generation (RMG) on product manifolds, Riemannian flow matching.
result Achieves state-of-the-art FID (0.043) on HumanML3D and surpasses strong baselines on MotionMillion.
Kernel-Gradient Drifting improves generative modeling for non-Euclidean data.
problem Challenges in generative modeling for non-Euclidean data.
method Replaces Euclidean displacement with kernel-induced directions, exposing score-based structure.
result Kernel-gradient drifting enables state-of-the-art one-step generation for non-Euclidean data.
Develops iso-Riemannian optimization for data manifolds.
problem Challenges in performing optimization on learned data manifolds.
method Introduces iso-connection and iso-Riemannian descent algorithm.
result Demonstrates efficient solutions to inverse problems on learned data manifolds.
Novel Fréchet regression method handles errors-in-variables with low-rank covariates.
problem Regression with noisy and limited covariate data.
method Combines global Fréchet regression and principal component regression for low-rank structure.
result Improved efficiency and accuracy in high-dimensional and noisy data settings.
Improved VAEs learn flat latent spaces for better data similarity.
problem Measuring data similarity in latent spaces using Euclidean metric.
method Extend VAEs to learn flat latent manifolds using Riemannian geometry and regularisation.
result Improved performance on video-tracking benchmarks, nears supervised methods.