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,695 papers · 148 categories

Trend · papers per month

2565127671,023 · Jun 202019922001200920172026
48 results for Euclidean base

The study characterizes round spheres in Euclidean space based on r-mean curvature conditions.

problem Characterizing round spheres in Euclidean space under specific curvature conditions.
method Characterization based on r-mean curvature conditions.
result Characterizes round spheres in Euclidean space under suitable r-mean curvature conditions.

Study on hypersurfaces in pseudo-Euclidean space with constant curvature or rotational properties.

problem Characterizing hypersurfaces in pseudo-Euclidean space.
method Defined and studied warped product hypersurfaces with constant sectional curvature or rotational properties.
result Hypersurfaces in pseudo-Euclidean space either have constant curvature or are contained in rotational hypersurfaces.

This paper addresses Gaussian Process regression over probability measures, revealing a non-stationarity issue between Euclidean and Wasserstein kernels.

problem Non-stationarity issue between Euclidean and Wasserstein kernels in Gaussian Process regression over probability measures.
method Assuming Euclidean input space, applying algebraic transformation based on uncovered non-stationarity relationship to create a non-stationary and Wasserstein-based Gaussian Process model.
result An algebraic transformation simplifies learning a non-stationary Gaussian Process model over probability measures.

Extends illumination bodies to non-Euclidean spaces and proves their volume derivative defines surface area.

problem Defining surface area in non-Euclidean geometries.
method Generalizes illumination bodies to Riemannian spaces of constant curvature and projective Finsler geometries, proving their volume derivative defines surface area.
result Derivative of volume of illumination bodies defines surface area in non-Euclidean geometries.

Piecewise flat approximations for curvature in Euclidean and non-Euclidean spaces.

problem Approximating local extrinsic curvature on discrete manifolds.
method Constructing discrete curvature forms on piecewise flat manifolds, using weighted sums of hinge angles.
result Converges to smooth curvature values as mesh refinement occurs, favorably comparing with other discrete approaches.

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.

New method for learning with non-Euclidean data using decomposable kernels.

problem Difficulty in using classical kernels for non-Euclidean data.
method Reproducing kernel Krein space (RKKS) methods for kernels that admit a positive decomposition.
result Invariant kernels can be used for learning in non-Euclidean spaces.

Paper proposes a matrix optimization model for reliable Euclidean embedding from noisy data.

problem Challenges in Euclidean embedding from noisy observations containing outliers.
method Matrix optimization based embedding model to detect and remove outliers.
result The model provides high accuracy estimators and successfully identifies outliers.

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 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.

Improves hierarchical clustering in Euclidean space using autoencoders.

problem Lack of unsupervised methods for learning hierarchical structure in Euclidean space.
method Variational autoencoder with Gaussian mixture prior, rescaling latent space, and Ward's linkage.
result Improved dendrogram purity and Moseley-Wang cost function results.

We investigate connections between pairs of (pseudo-)Riemannian metrics whose sum is a (tensor) product of a covector field with itself. A bijective mapping between the classes of Euclidean and Lorentzian metrics is constructed as a special result. The existence of such maps on a differentiable manifold is discussed. S…

1998-02-22abs ↗pdf ↗

The paper studies momentum-based minimization for Ginzburg-Landau on Euclidean spaces and graphs.

problem Minimizing the Ginzburg-Landau functional on Euclidean spaces and graphs.
method Momentum-based minimization using a convex-concave splitting-based FISTA-type time discretization.
result Momentum can lead to faster convergence if the time step size is large but not too large.

Revisits Isomap, showing it constructs Euclidean representations of geodesic structure.

problem Nonlinear dimension reduction of manifold data.
method Revisits Isomap's rationale, clarifying its approach to constructing Euclidean representations of geodesic structure.
result Convexity is not required for shortest path distances to converge to Riemannian distances.

We present an invariant of a three-dimensional manifold with a framed knot in it based on the Reidemeister torsion of an acyclic complex of Euclidean geometric origin. To show its nontriviality, we calculate the invariant for some framed (un)knots in lens spaces. Our invariant is related to a finite-dimensional fermion…

2006-05-06abs ↗pdf ↗

We study surfaces with decorations and prove uniformization in non-Euclidean geometries.

problem Discrete conformal equivalence in non-Euclidean geometries.
method Variational principle and continuous deformation.
result One master theory of discrete conformal equivalence across different geometries.

The paper extends manifold learning to arbitrary norms, improving molecular motion mapping.

problem Improving manifold learning for non-Euclidean norms.
method Determines the limiting differential operator for graph Laplacians using any norm.
result A modified Laplacian eigenmaps algorithm using Earthmover's distance outperforms Euclidean methods in molecular motion mapping.

We consider timelike and spacelike reductions of 4D, N = 2 Minkowskian and Euclidean vector multiplets coupled to supergravity and the maps induced on the scalar geometry. In particular, we investigate (i) the (standard) spatial c-map, (ii) the temporal c-map, which corresponds to the reduction of the Minkowskian theor…

2015-07-16abs ↗pdf ↗

This paper tightens the generalization error bound for graph embedding in non-Euclidean spaces.

problem High generalization error in non-Euclidean graph embedding, preventing practical applications.
method Novel upper bound of graph embedding's generalization error using local Rademacher complexity.
result The new bound is tighter and faster, allowing better performance in non-Euclidean spaces.

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.

The Piola identity divcoff=0\operatorname{div} \operatorname{cof} \nabla f=0 is a central result in the mathematical theory of elasticity. We prove a generalized version of the Piola identity for mappings between Riemannian manifolds, using two approaches, based on different interpretations of the cofactor of a linear map: on…

2018-05-31abs ↗pdf ↗

We study warped products semi-Riemannian Einstein manifolds. We consider the case in that the base is conformal to an n-dimensional pseudo Euclidean space and invariant under the action of an translation group. We provide all such solutions in the case Ricci flat when the base is conformal to an n-dimensional pseudo-Eu…

2015-08-17abs ↗pdf ↗

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…

2013-09-26abs ↗pdf ↗

New optimization method combines gradient clipping and non-Euclidean smoothness.

problem Improving optimization in non-Euclidean spaces for machine learning.
method Hybrid of steepest descent and conditional gradient, incorporating weight decay.
result Achieves optimal convergence rate and demonstrates effectiveness in deep learning.

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.

In this paper we derive a precise estimate on the growth of potential functions of complete noncompact shrinking solitons. Based on this, we prove that a complete noncompact gradient shrinking Ricci soliton has at most Euclidean volume growth. The latter result can be viewed as an analog of the well-known theorem of Bi…

2009-03-23abs ↗pdf ↗