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

Trend · papers per month

85169254338 · Jun 202019922001200920172026
48 results for higher rank inner products

We propose a quantization based approach for fast approximate Maximum Inner Product Search (MIPS). Each database vector is quantized in multiple subspaces via a set of codebooks, learned directly by minimizing the inner product quantization error. Then, the inner product of a query to a database vector is approximated …

2015-09-04abs ↗pdf ↗

Heegaard Floer homology connects to polynomial representations of Hecke algebras.

problem Understanding polynomial representations of double affine Hecke algebras.
method Using higher-dimensional Heegaard Floer homology and topological interpretations.
result Recovery of polynomial representations from Heegaard Floer homology.

Improved ITL descriptors using explicit inner product spaces for scalable systems.

problem Scalability issues in ITL due to high computational complexity.
method Explicit inner product space (EIPS) kernels for ITL, leveraging data-independent basis.
result Superior performance of EIPS-ITL estimators and combined NT-KAF using EIPS-ITL cost functions.

Data often comes in the form of an array or matrix. Matrix factorization techniques attempt to recover missing or corrupted entries by assuming that the matrix can be written as the product of two low-rank matrices. In other words, matrix factorization approximates the entries of the matrix by a simple, fixed function-…

2015-11-19abs ↗pdf ↗

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a stochastically independent uniformly distributed unit vector. When the set of unit vectors …

2015-11-19abs ↗pdf ↗

Proves finite measure implies product structure for certain discrete subgroups.

problem Classifying discrete subgroups with finite Bowen-Margulis-Sullivan measure.
method Product structure of leafwise measures and high entropy method.
result Proves virtually a product structure for certain subgroups.

We show that for a smooth closed curve γγ on a compact Riemannian surface without boundary, the inner product of two eigenfunctions eλe_λ and eμe_μ restricted to γγ, eλeμds|\int e_λ\overline{e_μ}\,ds|, is bounded by min{λ12,μ12}\min\{λ^\frac12,μ^\frac12\}. Furthermore, given 0<c<10<c<1, if 0<μ<cλ0<μ<cλ, we prove that $\int e_λ\overline{e…

2017-11-13abs ↗pdf ↗

Inverted file and asymmetric distance computation (IVFADC) have been successfully applied to approximate nearest neighbor search and subsequently maximum inner product search. In such a framework, vector quantization is used for coarse partitioning while product quantization is used for quantizing residuals. In the ori…

2019-03-25abs ↗pdf ↗

Study string topology on symmetric spaces, showing non-triviality and nilpotency results.

problem Understanding the structure of string topology on symmetric spaces.
method Used cycles from Bott-Samelson and Ziller to study coproduct and product.
result Showed non-triviality and nilpotency of Chas-Sullivan product and coproduct for higher rank symmetric spaces.

Researchers prove inner product recovery is impossible in latent space models.

problem Recovering inner products in latent space models with random geometric graphs.
method Rate-distortion theory applied to Gaussian or spherical latent locations.
result Impossible to recover inner products if dimensionality exceeds nh(p)n h(p), matching positive results' conditions.

Paper proposes a new method to optimize feature coordinates for better image classification.

problem Improving feature extraction for better machine learning classification.
method Mutual-energy inner product optimization method.
result The method enhances low-frequency features and suppresses high-frequency noise, leading to better classification results.

We determine the structure of the *-Lie superalgebra generated by a set of carefully chosen natural operators of an orientable WSD manifold of rank three. This Lie superalgebra is formed by global sections of a natural Lie superalgebra bundle, and turns out to be a product of $\mathbf{sl}(4,\C)$ with the full special…

2007-06-07abs ↗pdf ↗

Study of Gaussian distributions using entropic Gromov-Wasserstein and inner product Gromov-Wasserstein.

problem Optimal transportation between Gaussian distributions with different dimensions.
method Entropic Gromov-Wasserstein and inner product Gromov-Wasserstein, with closed-form expressions and von Neumann's trace inequality.
result Closed-form expressions for the entropic IGW and its unbalanced variant between Gaussian distributions.

Theoretical studies have proven that the Hilbert space has remarkable performance in many fields of applications. Frames in tensor product of Hilbert spaces were introduced to generalize the inner product to high-order tensors. However, these techniques require tensor decomposition which could lead to the loss of infor…

2017-06-25abs ↗pdf ↗

Study on kernel regression risk in high dimensions using Pinsker bound.

problem Kernel regression risk in high-dimensional inner product spaces.
method Investigation of Pinsker bound for kernel regression on sphere Sd\mathbb{S}^{d} with sample size n=αdγ(1+od(1))n = αd^γ(1+o_{d}(1)).
result Exact minimax risk and Pinsker constant identified for kernel regression.

We point out that the Homfly polynomial (that is to say, Ocneanu's trace functional) contains two polynomial-valued inner products on the Hecke algebra representation of Artin's braid group. These bear a close connection to the Morton-Franks-Williams inequality. In these structures, the sets of positive, respectively n…

2009-06-30abs ↗pdf ↗

Convex learning for diverse invariances in semi-inner-product space.

problem Efficiently learning invariant representations for a wide range of invariances.
method Developed a convex representation learning algorithm for generalized invariances modeled as semi-norms, introducing Euclidean embeddings for kernel representers in a semi-inner-product space.
result Accurate invariant representations learned efficiently and effectively, validated by experiments.

Efficient Maximum Inner Product Search (MIPS) is an important task that has a wide applicability in recommendation systems and classification with a large number of classes. Solutions based on locality-sensitive hashing (LSH) as well as tree-based solutions have been investigated in the recent literature, to perform ap…

2015-07-21abs ↗pdf ↗

The paper proves actions of lattices in higher rank groups have cost one.

problem Fixed price question for higher rank semisimple Lie groups.
method Low intensity Poisson point processes and geometry of Voronoi tessellations.
result Proves all probability measure preserving actions of lattices in higher rank groups have cost one.

We study estimation of (semi-)inner products between two nonparametric probability distributions, given IID samples from each distribution. These products include relatively well-studied classical L2\mathcal{L}^2 and Sobolev inner products, as well as those induced by translation-invariant reproducing kernels, for whic…

2018-03-30abs ↗pdf ↗

This study approximates neural network features for modeling relations and attention mechanisms.

problem Approximating neural network features for modeling relations and attention mechanisms.
method Analyzes inner products of multi-layer perceptrons for universal approximation of symmetric and asymmetric relation functions.
result Universal approximation of relation functions and attention mechanisms using inner products of neural networks.

We complete our recent classification of compact inner symmetric spaces with weakly complex tangent bundle by filling up a case which was left open, and extend this classification to the larger category of compact homogeneous spaces with positive Euler characteristic. We show that a simply connected compact equal rank …

2012-02-15abs ↗pdf ↗

The Bergman kernels of holomorphic vector bundles are studied to extend the Fubini-Study map.

problem Extending the Fubini-Study map to a closed range for general inner products.
method Associate Bergman kernels with general inner products on the dual space.
result FS is an injective immersion but not necessarily closed in the space of positive definite inner products.

Let MM be complete nonpositively curved Riemannian manifold of finite volume whose fundamental group ΓΓ does not contain a finite index subgroup which is a product of infinite groups. We show that the universal cover M~\tilde M is a higher rank symmetric space iff Hb2(M;R)H2(M;R)H^2_b(M;\R)\to H^2(M;\R) is injective (and otherwis…

2007-02-09abs ↗pdf ↗

The paper studies knot quandles and their cohomology, proving infinite dimensionality results.

problem Understanding the cohomology of knot quandles and its implications in knot theory.
method Analyzing quandles and their inner automorphism groups, proving conditions for infinite dimensionality.
result The second bounded cohomology of knot quandles is infinite dimensional, detecting the unknot.

We propose a robust elastic net (REN) model for high-dimensional sparse regression and give its performance guarantees (both the statistical error bound and the optimization bound). A simple idea of trimming the inner product is applied to the elastic net model. Specifically, we robustify the covariance matrix by trimm…

2015-11-15abs ↗pdf ↗

We show that every unimodular Lie algebra, of dimension at most 4, equipped with an inner product, possesses an orthonormal basis comprised of geodesic elements. On the other hand, we give an example of a solvable unimodular Lie algebra of dimension 5 that has no orthonormal geodesic basis, for any inner product.

2013-02-12abs ↗pdf ↗

Signature Isolation Forest removes constraints from FIF by using rough path theory's signature transform.

problem Challenges in FIF's linear inner product and dictionary choices leading to unreliable results.
method Introduces Signature Isolation Forest using rough path theory's signature transform to remove linearity constraints.
result Demonstrates relevance of methods through numerical experiments and real-world applications.

We propose weighted inner product similarity\textit{weighted inner product similarity} (WIPS) for neural network-based graph embedding. In addition to the parameters of neural networks, we optimize the weights of the inner product by allowing positive and negative values. Despite its simplicity, WIPS can approximate arbitrary general similarities in…

2019-02-27abs ↗pdf ↗

In this paper, a geometric framework for neural networks is proposed. This framework uses the inner product space structure underlying the parameter set to perform gradient descent not in a component-based form, but in a coordinate-free manner. Convolutional neural networks are described in this framework in a compact …

2016-08-15abs ↗pdf ↗

Recently, Factorization Machines (FM) has become more and more popular for recommendation systems, due to its effectiveness in finding informative interactions between features. Usually, the weights for the interactions is learnt as a low rank weight matrix, which is formulated as an inner product of two low rank matri…

2018-04-17abs ↗pdf ↗