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

Trend · papers per month

185370555740 · Jun 202019922001200920172026
48 results for affine distance functions

The paper classifies singularities of plane congruences and affine distance functions.

problem Classifying singularities of plane congruences and affine distance functions.
method Classification through 2-parameter plane congruences in \(\mathbb{R^4}\) and affine normal plane congruences.
result Generic singularities of plane congruences and affine distance functions are classified.

The area distance to a convex plane curve is an important concept in computer vision. In this paper we describe a strong link between area distances and improper affine spheres. This link makes possible a better understanding of both theories. The concepts of the theory of affine spheres lead to a new definition of an …

2007-10-09abs ↗pdf ↗

The two main theorems of this paper provide a characterization of hyperbolic affine iterated function systems defined on Rm. Atsushi Kameyama (Distances on Topological Self-Similar Sets, Proceedings of Symposia in Pure Mathematics, Volume 72.1, 2004) asked the following fundamental question: given a topological self-si…

2009-08-10abs ↗pdf ↗

Algorithm learns affine transformations robustly from corrupted samples.

problem Learning affine transformations from corrupted samples.
method New geometric certificate and iterative improvement method.
result Total variation distance of O(ε)O(ε) between learned and original distributions.

New proof shows affine manifolds with parallel volume are Riemannian-flat.

problem Characterize compact affine manifolds with parallel volume.
method Construct a representative metric with Levi-Civita connection, using Hessian of volume-normalized distance functions.
result Affine manifolds with parallel volume are Riemannian-flat.

The study examines lower and upper bounds of Wasserstein distances for affine transformations of random vectors.

problem Understanding Wasserstein distances for affine transformations of random vectors.
method Lower and upper bounds for affine transformations of random vectors in Rn\mathbb{R}^n are derived using Bures metric and compositions of affine maps.
result Concrete lower bounds and upper bounds for affine transformations are derived and applied to various distributions.

Study equi-affine invariants for convex domains with asymptotes.

problem Understanding geometric properties of convex domains with specific asymptotes.
method Introducing equi-affine invariants by averaging tropical structures.
result Proving a limiting description of level sets for unbounded domains with two non-parallel asymptotes.

The aim of this paper is to investigate the differential geometry of immersed surfaces in three-dimensional normed spaces from the viewpoint of affine differential geometry. We endow the surface with a useful Riemannian metric which is closely related to normal curvature, and from this we re-calculate the Minkowski Gau…

2017-09-02abs ↗pdf ↗

Estimates latent positions in 1D torus from noisy pairwise affinities.

problem Estimating latent positions in a 1D torus from noisy pairwise affinities.
method Introduced an estimation procedure with provable localization error of O(log(n)/n)O(\sqrt{\log(n)/n}).
result The estimation procedure provably localizes latent positions with a maximum error of O(log(n)/n)O(\sqrt{\log(n)/n}).

In this paper we discuss some affine properties of convex equal-area polygons, which are convex polygons such that all triangles formed by three consecutive vertices have the same area. Besides being able to approximate closed convex smooth curves almost uniformly with respect to affine length, convex equal-area polygo…

2011-03-14abs ↗pdf ↗

The paper establishes inequalities for convex curves and applies them to lattice point estimates.

problem Estimating the number of lattice points on convex curves.
method Developed comparison theorems for affine curves and used them to estimate areas and lattice points.
result Established inequalities for areas of inscribed triangles in terms of affine curvature and distance.

Study on estimating distances between covariance operators and Gaussian processes.

problem Estimating distances between covariance operators and Gaussian processes.
method Riemannian distances, concentration results for Hilbert space-valued random variables, RKHS covariance and cross-covariance operators.
result Both distances converge in the Hilbert-Schmidt norm and can be consistently and efficiently estimated.

The paper explores fully affine maximal curves and their properties.

problem Whether the hyperbola is the fully affine maximal curve in R^2.
method Utilizing evolution equations for curves, the second variational formula for fully affine extremal curves in R^2 was obtained.
result The fully affine maximal curves in R^2 are much more abundant and include explicit curves y=x^α (α is a constant and α∉{0,1,1/2,2}).

New tiles in higher dimensions are shown to be homeomorphic to balls.

problem Characterizing self-affine tiles in higher dimensions as balls.
method Using Brouwer's invariance of domain theorem and a horizontal distance tool.
result Necessary and sufficient conditions for tiles to be dd-dimensional tame balls.

Employing the affine normal flow, we prove a stability version of the pp-affine isoperimetric inequality for p1p\geq1 in R2\mathbb{R}^2 in the class of origin-symmetric convex bodies. That is, if KK is an origin-symmetric convex body in R2\mathbb{R}^2 such that it has area ππ and its pp-affine perimeter is close en…

2012-09-30abs ↗pdf ↗

Training neural networks under a strict Lipschitz constraint is useful for provable adversarial robustness, generalization bounds, interpretable gradients, and Wasserstein distance estimation. By the composition property of Lipschitz functions, it suffices to ensure that each individual affine transformation or nonline…

2018-11-13abs ↗pdf ↗

In the field of statistics, many kind of divergence functions have been studied as an amount which measures the discrepancy between two probability distributions. In the differential geometrical approach in statistics (information geometry), dually flat spaces play a key role. In a dually flat space, there exist dual a…

2018-08-16abs ↗pdf ↗

In this paper we tackle the issue of clustering trajectories of geolocalized observations. Using clustering technics based on the choice of a distance between the observations, we first provide a comprehensive review of the different distances used in the literature to compare trajectories. Then based on the limitation…

2015-08-20abs ↗pdf ↗

In this paper we construct new invariants of knotoids including the odd writhe, the parity bracket polynomial, the affine index polynomial and the arrow polynomial, and give an introduction to the theory of virtual knotoids. The invariants in this paper are defined for classical knotoids in analogy to corresponding inv…

2016-02-10abs ↗pdf ↗

NucleusDiff models atomic nuclei interactions to prevent separation violations in drug design.

problem Maintaining minimum pairwise distance between atoms to avoid separation violations in drug design.
method Enforces distance constraint between atomic nuclei and manifolds in a diffusion model.
result Reduces separation violations by up to 100.00% and enhances binding affinity by up to 22.16%.

New algorithm estimates task affinities without repeated training, improving model performance and efficiency.

problem Efficiently estimating task affinities among multiple tasks for model training.
method Grad-TAG algorithm: trains a base model for all tasks and uses gradient-based linearization to estimate task affinities.
result Estimates task affinities with high accuracy and low computational cost.

The volume distance from a point p to a convex hypersurface M of the (N+1)-dimensional space is defined as the minimum (N+1)-volume of a region bounded by M and a hyperplane H through the point. This function is differentiable in a neighborhood of M and if we restrict its hessian to the minimizing hyperplane H(p) we ob…

2010-07-14abs ↗pdf ↗

This paper is dedicated to the Orlicz-Petty bodies. We first propose the homogeneous Orlicz affine and geominimal surface areas, and establish their basic properties such as homogeneity, affine invariance and affine isoperimetric inequalities. We also prove that the homogeneous geominimal surface areas are continuous, …

2016-11-14abs ↗pdf ↗

We describe a probabilistic (generative) view of affinity matrices along with inference algorithms for a subclass of problems associated with data clustering. This probabilistic view is helpful in understanding different models and algorithms that are based on affinity functions OF the data. IN particular, we show how(…

2012-10-19abs ↗pdf ↗

The Grassmannian of affine subspaces is a natural generalization of both the Euclidean space, points being zero-dimensional affine subspaces, and the usual Grassmannian, linear subspaces being special cases of affine subspaces. We show that, like the Grassmannian, the affine Grassmannian has rich geometrical and topolo…

2018-07-28abs ↗pdf ↗

Optimal inequalities found between Riemannian and Hilbert metrics in convex projective domains.

problem Finding optimal bounds between Riemannian and Hilbert metrics in convex projective domains.
method Optimal control techniques applied to Riemannian metrics induced by centro-affine hypersurface immersions.
result Optimal inequalities between Riemannian and Hilbert metrics for a class of convex projective domains.

Improved convergence rate for kNN graph Laplacians with adaptive bandwidth.

problem Enhancing the efficiency of graph-based data analysis methods.
method Introducing a new class of kNN graph with adaptive bandwidth and proving operator convergence rate.
result Operator convergence rate of O(N2/(d+6))O(N^{-2/(d+6)}) for the kNN graph Laplacian, up to a log factor.

The abstract investigates how volume ratios relate to curvature in geometric surfaces.

problem Understanding the relationship between curvature and volume in geometric surfaces.
method Investigates the geometric meaning of a quantity related to curvature and volume ratios.
result Shows how the ratio of Gaussian curvature to a volume function can be represented as a function of volumes.

Spectral clustering improves accuracy and efficiency for clustering discrete distributions.

problem Inaccurate clustering of discrete distributions using traditional methods.
method Spectral clustering combined with distribution affinity measures (MMD, Wasserstein distance) and linear optimal transport.
result Spectral clustering outperforms traditional methods in accuracy and efficiency.

The paper develops inequalities for log-concave functions and related surface areas.

problem Understanding log-concave functions and their inequalities.
method Establishing new inequalities through f-divergences and functional affine surface areas.
result New inequalities on functional affine surface area and bounds for Kullback-Leibler divergence.

We state and prove a simple Theorem that allows one to generate invariant quantities in Metric-Affine Geometry, under a given transformation of the affine connection. We start by a general functional of the metric and the connection and consider transformations of the affine connection possessing a certain symmetry. We…

2019-11-11abs ↗pdf ↗

We study affine Jacobi structures on an affine bundle π:AMπ:A\to M, i.e. Jacobi brackets that close on affine functions. We prove that there is a one-to-one correspondence between affine Jacobi structures on AA and Lie algebroid structures on the vector bundle A+=pMAff(Ap,R)A^+=\bigcup_{p\in M}Aff(A_p,\R) of affine functionals. Som…

2002-12-04abs ↗pdf ↗

Study infinite Euclidean distance discriminants of algebraic varieties.

problem Understanding the structure of data points with infinitely many critical points in Euclidean distance correspondence.
method Developed computer code to compute discriminants and proved properties of fibers.
result Infinite Euclidean distance discriminants contain all data points with infinitely many critical points for the nearest-point problem.

We show that every finite-dimensional Alexandrov space X with curvature bounded from below embeds canonically into a product of an Alexandrov space with the same curvature bound and a Euclidean space such that each affine function on X comes from an affine function on the Euclidean space.

2016-11-26abs ↗pdf ↗

Single particle reconstruction (SPR) from cryo-electron microscopy (EM) is a technique in which the 3D structure of a molecule needs to be determined from its contrast transfer function (CTF) affected, noisy 2D projection images taken at unknown viewing directions. One of the main challenges in cryo-EM is the typically…

2016-11-10abs ↗pdf ↗

A Finsler function FF is affinely rigid if its canonical spray is uniquely metrizable, in the sense that if Fˉ\bar F is another Finsler function whose canonical spray is SS, then d(F/Fˉ)=0d(F/\bar F)=0. In this short note we explore some sufficient conditions for a Finsler function to be affinely rigid, and discuss open pro…

2017-02-16abs ↗pdf ↗

Let us denote by Kn\mathcal K_n the hyperspace of all convex bodies of Rn\mathbb R^n equipped with the Hausdorff distance topology. An affine invariant point pp is a continuous and Aff(n)-equivariant map p:KnRnp:\mathcal K_n\to \mathbb R^n, where Aff(n) denotes the group of all nonsingular affine maps of Rn\mathbb R^n. Fo…

2016-02-21abs ↗pdf ↗

New bounds on optimal transport regularization show faster convergence rates than previously known.

problem Understanding the localization rate of Quadratically Regularized Optimal Transport (QOT) optimizers.
method Established lower bounds and derived mean-squared deviation controls for QOT optimizers.
result Lower bound of support concentration rate ε1d+2\varepsilon^{\frac{1}{d+2}} in directed Hausdorff distance.