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.

169,051 papers · 148 categories

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for inner-product space

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.

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.

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.

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

The paper studies geometric properties of Grassman manifolds within Euclidean spaces.

problem Understanding the geometric structure of Grassman manifolds.
method Analyzing Grassman manifold G(E)G(E) as a subset of Euclidean space EE and orthogonal projections.
result Explicit formulas for differential geometry of G(E)G(E) as a submanifold.

The paper explores linear representations in language models using counterfactuals.

problem Understanding linear representations and geometric concepts in large language models.
method Formalized linear representation in output and input spaces, identified causal inner product.
result Unified understanding of linear representations and their connection to interpretation and control.

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.

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.

We formulate a quantization commutes with reduction principle in the setting where the Lie group GG, the symplectic manifold it acts on, and the orbit space of the action may all be noncompact. It is assumed that the action is proper, and the zero set of a deformation vector field, associated to the momentum map and a…

2013-09-26abs ↗pdf ↗

A new method uses Gram matrix for efficient multivariate functional principal components.

problem Efficiently estimating eigencomponents of multidimensional functional datasets.
method Proposes using inner-product matrix to estimate eigenelements of multivariate and multidimensional functional datasets.
result Established relationship between eigenelements of covariance operator and inner-product matrix.

We find a one-to-one correspondence between full extrinsic symmetric spaces in (possibly degenerate) inner product spaces and certain algebraic objects called (weak) extrinsic symmetric triples. In particular, this yields a description of arbitrary extrinsic symmetric spaces in pseudo-Euclidean spaces by corresponding …

2008-09-26abs ↗pdf ↗

WIPS optimizes inner product weights to approximate various similarities.

problem Learning high-quality node representations and accurate similarities.
method Weighted inner product similarity (WIPS) with adjustable weights.
result WIPS can approximate arbitrary general similarities including positive definite and indefinite kernels.

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.

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 ↗

In this paper we study isometry-invariant Finsler metrics on inner product spaces over R\mathbb{R} or C\mathbb{C}, i.e. the Finsler metrics which do not change under the action of all isometries of the inner product space. We give a new proof of the analytic description of all such metrics. In this article the most g…

2017-08-25abs ↗pdf ↗

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 ↗

New algorithm for linear bandits tackles Optimal Transport problems.

problem Optimal Transport problems not covered by traditional linear bandits.
method Embed actions into a Hilbertian subspace, penalize optimism, use least-squares estimation.
result Achieves same regret bounds as OFUL but interpolates between ildeO(T) ilde{\mathcal O}(\sqrt{T}) and O(T){\mathcal O}(T).

Enhances CLIP's similarity computation using PMI's linear structure.

problem CLIP's similarity computation misses the optimal linear structure of PMI.
method KME-CLIP, utilizing inner product in a reproducing kernel Hilbert space.
result KME-CLIP approximates PMI with arbitrary accuracy and outperforms CLIP.

Estimates latent inner products from an anisotropic Gaussian graph with improved spectral method.

problem Recovering latent inner products from an anisotropic Gaussian random geometric graph.
method Doubly centered adjacency matrix, rank-d spectral approximation, Hermite expansion, decoupling argument.
result Estimator achieves mean squared error rate matching state of the art for isotropic case and ill-conditioned covariance matrices.

PieClam autoencodes graphs into communities, improving graph anomaly detection.

problem Graph anomaly detection and universal graph autoencoding.
method Probabilistic graph model with overlapping inclusive and exclusive communities.
result PieClam is a universal autoencoder that uniformly approximates any graph.

New attacks break robust aggregation methods for SGD in Byzantine-tolerant systems.

problem Breaking Byzantine-tolerant techniques in distributed machine learning.
method Inner product manipulation to break robust aggregation methods (median and Krum).
result Coordinate-wise median and Krum can be broken using new attack strategies.

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 ↗

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.

The information metric arises in statistics as a natural inner product on a space of probability distributions. In general this inner product is positive semi-definite but is potentially degenerate. By associating to an instanton its energy density, we can examine the information metric {\bf g} on the moduli spaces $\M…

1996-11-25abs ↗pdf ↗

Equivalent tests for SGD batch size selection found.

problem Finding equivalent tests for adaptive batch size selection in SGD.
method Norm and inner product/orthogonality tests equivalence demonstration.
result Norm and inner product/orthogonality tests are equivalent under specific conditions.

A new method improves maximum inner product search by locally decomposing residual vectors.

problem Maximum inner product search efficiency and accuracy.
method Local Orthogonal Decomposition (LOD) combined with multiscale quantization.
result LOD consistently achieves higher recall than previous methods under the same bitrates.