Related papers: Explicit Formulae to Interchangeably use Hyperplan…
We develop the basic formulae of hyperspherical trigonometry in multidimensional Euclidean space, using multidimensional vector products, and their conversion to identities for elliptic functions. We show that the basic addition formulae…
The work develops further the theory of the following inversion problem, which plays the central role in the rapidly developing area of thermoacoustic tomography and has intimate connections with PDEs and integral geometry: {\it Reconstruct…
The generalization of (super)integrable Euclidean classical Hamiltonian systems to the two-dimensional sphere and the hyperbolic space by preserving their (super)integrability properties is reviewed. The constant Gaussian curvature of the…
Many high-dimensional practical data sets have hierarchical structures induced by graphs or time series. Such data sets are hard to process in Euclidean spaces and one often seeks low-dimensional embeddings in other space forms to perform…
Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…
Many high-dimensional and large-volume data sets of practical relevance have hierarchical structures induced by trees, graphs or time series. Such data sets are hard to process in Euclidean spaces and one often seeks low-dimensional…
Projective geometry provides the preferred framework for most implementations of Euclidean space in graphics applications. Translations and rotations are both linear transformations in projective geometry, which helps when it comes to…
Representing data in hyperbolic space can effectively capture latent hierarchical relationships. With the goal of enabling accurate classification of points in hyperbolic space while respecting their hyperbolic geometry, we introduce…
Let $\D$ be a set of $n$ pairwise disjoint unit balls in $\R^d$ and $P$ the set of their center points. A hyperplane $\Hy$ is an \emph{$m$-separator} for $\D$ if each closed halfspace bounded by $\Hy$ contains at least $m$ points from $P$.…
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds…
In this paper we embed $m$-dimensional Euclidean space in the geometric algebra $Cl_m $ to extend the operators of incidence in ${R^m}$ to operators of incidence in the geometric algebra to generalize the notion of separator to a decision…
The aim of this paper is to investigate an attempt to build a binary classification algorithm using principles of geometry such as vectors, planes, and vector algebra. The basic idea behind the proposed algorithm is that a hyperplane can be…
In machine learning, data is usually represented in a (flat) Euclidean space where distances between points are along straight lines. Researchers have recently considered more exotic (non-Euclidean) Riemannian manifolds such as hyperbolic…
Hierarchical data is common in many domains like life sciences and e-commerce, and its embeddings often play a critical role. While hyperbolic embeddings offer a theoretically grounded approach to representing hierarchies in low-dimensional…
In this article, we use the second intrinsic volume to define a metric on the space of homothetic classes of Gaussian bounded convex bodies in a separable real Hilbert space. Using kernels of hyperbolic type, we can deduce that this space…
Most mathematical distortions used in ML are fundamentally integral in nature: $f$-divergences, Bregman divergences, (regularized) optimal transport distances, integral probability metrics, geodesic distances, etc. In this paper, we unveil…
Computer vision tasks such as image classification, image retrieval and few-shot learning are currently dominated by Euclidean and spherical embeddings, so that the final decisions about class belongings or the degree of similarity are made…
We first prove a new separating hyperplane theorem characterizing when a pair of compact convex subsets $K, K'$ of the Euclidean space intersect, and when they are disjoint. The theorem is distinct from classical separation theorems. It…
Inspired by the boolean discrepancy problem, we study the following optimization problem which we term \textsc{Spherical Discrepancy}: given $m$ unit vectors $v_1, \dots, v_m$, find another unit vector $x$ that minimizes $\max_i \langle x,…
The cognitive framework of conceptual spaces [3] provides geometric means for representing knowledge. A conceptual space is a high-dimensional space whose dimensions are partitioned into so-called domains. Within each domain, the Euclidean…