Note proves bi-Lipschitz embeddings for Ham(S^2) metrics.
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.
Trend · papers per month
This paper compares FAISS and FENSHSES for nearest neighbor search in Hamming space.
We verify here some variants of topological and dynamical flavor of the injectivity radius conjecture in Hofer geometry, Lalonde-Savelyev \cite{citeLalondeSavelyevOntheinjectivityradiusinHofergeometry} in the case of and , for a closed positive genus surface. In particular we show that any lo…
Classifies homeomorphism groups of countable Stone spaces up to coarse equivalence.
We apply Gromov's ham sandwich method to get (1) domain monotonicity (up to a multiplicative constant factor); (2) reverse domain monotonicity (up to a multiplicative constant factor); and (3) universal inequalities for Neumann eigenvalues of the Laplacian on bounded convex domains in a Euclidean space.
Develops homotopies for Lagrangian field theory using advanced algebraic structures.
New metric space for ReLU codes connects to network safety and robustness.
We prove that contains an infinite cyclic subgroup, where is the Hamiltonian group of the one point blow up of . We give a sufficient condition for the group to contain an infinite cyclic subgroup, when is a general toric manifold.
A theorem divides hyperplanes evenly with a line through the origin.
Let Σ_g be a closed orientable surface let Diff_0(Σ_g; area) be the identity component of the group of area-preserving diffeomorphisms of Σ_g. In this work we present an extension of Gambaudo-Ghys construction to the case of a closed hyperbolic surface Σ_g, i.e. we show that every non-trivial homogeneous quasi-morphism…
Let be a maximal globally hyperbolic flat --dimensional space--time with compact Cauchy surface of hyperbolic type. We prove that is globally foliated by constant mean curvature hypersurfaces , with mean curvature taking all values in . For , define the rescaled volume of $…
Let be a compact oriented surface. We construct homogeneous quasimorphisms on , on and on generalizing the constructions of Gambaudo-Ghys and Polterovich. We prove that there are infinitely many linearly independent homogeneous quasimorphisms on , on $Diff_0(…
We revisit fuzzy neural network with a cornerstone notion of generalized hamming distance, which provides a novel and theoretically justified framework to re-interpret many useful neural network techniques in terms of fuzzy logic. In particular, we conjecture and empirically illustrate that, the celebrated batch normal…
We present a lower bound for a fragmentation norm and construct a bi-Lipschitz embedding with respect to the fragmentation norm on the group of Hamiltonian diffeomorphisms of a symplectic manifold . As an application, we provide an answer to Brandenbursk…
This paper analyzes the conflict between Hamming loss and subset accuracy in multi-label classification.
We introduce here a natural functional associated to any : \emph{spectral length functional}, on the space of "generalized paths" in , closely related to both the Hofer length functional and spectral invariants and establish some of its properties. This functional is smooth on its…
We extend the definition of Weinstein's Action homomorphism to Hamiltonian actions with equivariant moment maps of (possibly infinite-dimensional) Lie groups on symplectic manifolds, and show that under conditions including a uniform bound on the symplectic areas of geodesic triangles the resulting homomorphism extends…
NESTA accelerates neural networks by compressing Hamming weights.
New STH distance finds patterns in event timeseries without resampling.
The paper explores simple and relatively simple transformation groups and their universal coverings.
An analogue of the Hofer metric on the Hamiltonian group of a Poisson manifold can be defined but there is the problem of its non-degeneracy. First we observe that is a genuine metric on when the union of all closed leaves (as subsets of ) of the corresponding sy…
In this work we construct Calabi quasi-morphisms on the universal cover of the group Ham(M) of Hamiltonian diffeomorphisms for some non-monotone symplectic manifolds. This complements a result by Entov and Polterovich which applies in the monotone case. Moreover, in contrast to their work, we show that these quasi-morp…
A growing interest has been witnessed recently from both academia and industry in building nearest neighbor search (NNS) solutions on top of full-text search engines. Compared with other NNS systems, such solutions are capable of effectively reducing main memory consumption, coherently supporting multi-model search and…
Let be a closed hyperbolic surface of genus and let be the group of Hamiltonian diffeomorphisms of . The most natural word metric on this group is the autonomous metric. It has many interesting properties, most important of which is the bi-invariance of this metric. In this work we show that $…
ExDAG solves DAG learning problems with low structural Hamming distance.
Study robust mean estimation under coordinate-level corruptions using Hamming distance.
Paper develops malware detection methods using Hamming distance.
Locality-sensitive hashing converts high-dimensional feature vectors, such as image and speech, into bit arrays and allows high-speed similarity calculation with the Hamming distance. There is a hashing scheme that maps feature vectors to bit arrays depending on the signs of the inner products between feature vectors a…
We prove that every RAAG (a Right-Angled Artin Group) embeds in the group of Hamiltonian symplectomorphisms of the 2-sphere.
The existence of adversarial examples in which an imperceptible change in the input can fool well trained neural networks was experimentally discovered by Szegedy et al in 2013, who called them "Intriguing properties of neural networks". Since then, this topic had become one of the hottest research areas within machine…
Differentially private data structures for estimating distances between strings.
New method identifies extreme risk propagation in financial networks.
Paper presents a new trie for integer sketches to improve similarity searches.
We propose using five data-driven community detection approaches from social networks to partition the label space for the task of multi-label classification as an alternative to random partitioning into equal subsets as performed by RAkELd: modularity-maximizing fastgreedy and leading eigenvector, infomap, walktrap an…
Hashing, or learning binary embeddings of data, is frequently used in nearest neighbor retrieval. In this paper, we develop learning to rank formulations for hashing, aimed at directly optimizing ranking-based evaluation metrics such as Average Precision (AP) and Normalized Discounted Cumulative Gain (NDCG). We first o…
Let denote the Frechet Lie group of Hamiltonian symplectomorphisms of a monotone symplectic manifold . Let be the -nerve of the Fukaya category , and let denote the component of the ``space of -categories''…
Study shows effective resistance distance yields more accurate network barycenter than Hamming distance.
A new algorithm improves solving QAP with better performance.
Let be the graph whose vertices are all subexpressions with target of a fixed expression in generators of a Coxeter group and edges are the pairs of subexpressions with Hamming distance 2. We prove that is connected and its cycle space …
Asynchronous Gibbs sampling has been recently shown to be fast-mixing and an accurate method for estimating probabilities of events on a small number of variables of a graphical model satisfying Dobrushin's condition~\cite{DeSaOR16}. We investigate whether it can be used to accurately estimate expectations of functions…
Following \cite{citeSavelyevVirtualMorsetheoryonHam.}, we develop here a connection between Morse theory for the (positive) Hofer length functional , with Gromov-Witten/Floer theory, for monotone symplectic manifolds . This gives some immediate restrictio…
New algorithms reduce overfitting in multiclass classification.
New algorithm recovers labels from noisy categorical data.
We present a powerful new loss function and training scheme for learning binary hash codes with any differentiable model and similarity function. Our loss function improves over prior methods by using log likelihood loss on top of an accurate approximation for the probability that two inputs fall within a Hamming dista…
Let (F,u)\to P\to N be a symplectic fibration in math.SG/0503268 McDuff has defined a subgroup Ham^s(F,u) of the group of symplectic automorphisms of(F,u). She has shown that the cohomology class [u] of u can be extended to P if and only if the symplectic fibration has an Ham^s reduction. To show this result, she const…
Structured prediction tasks in machine learning involve the simultaneous prediction of multiple labels. This is typically done by maximizing a score function on the space of labels, which decomposes as a sum of pairwise elements, each depending on two specific labels. Intuitively, the more pairwise terms are used, the …
PDHAMS improves sampling for discrete distributions with quadratic potential functions.
This paper introduces a novel real-time Fuzzy Supervised Learning with Binary Meta-Feature (FSL-BM) for big data classification task. The study of real-time algorithms addresses several major concerns, which are namely: accuracy, memory consumption, and ability to stretch assumptions and time complexity. Attaining a fa…