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

Trend · papers per month

25.0%50.0%75.0%100.0% · Dec 199219922001200920172026
48 results for data value embedding

Just as semantic hashing can accelerate information retrieval, binary valued embeddings can significantly reduce latency in the retrieval of graphical data. We introduce a simple but effective model for learning such binary vectors for nodes in a graph. By imagining the embeddings as independent coin flips of varying b…

2018-03-25abs ↗pdf ↗

Paper generalizes kernel mean embedding to von Neumann-algebra-valued measures.

problem Analyzing complex multivariate distributions and quantum mechanics.
method Generalizes kernel mean embedding to von Neumann-algebra-valued measures in reproducing kernel Hilbert modules.
result Injectivity and universality of the generalized KME are confirmed.

Learning knowledge representation is an increasingly important technology that supports a variety of machine learning related applications. However, the choice of hyperparameters is seldom justified and usually relies on exhaustive search. Understanding the effect of hyperparameter combinations on embedding quality is …

2019-12-21abs ↗pdf ↗

Representing entities and relations in an embedding space is a well-studied approach for machine learning on relational data. Existing approaches, however, primarily focus on simple link structure between a finite set of entities, ignoring the variety of data types that are often used in knowledge bases, such as text, …

2018-09-05abs ↗pdf ↗

Recommendation problems with large numbers of discrete items, such as products, webpages, or videos, are ubiquitous in the technology industry. Deep neural networks are being increasingly used for these recommendation problems. These models use embeddings to represent discrete items as continuous vectors, and the vocab…

2019-07-10abs ↗pdf ↗

Paper develops heavy-tailed embeddings for better text classification and augmentation.

problem Improving text classification, especially for extreme values.
method Develops heavy-tailed embeddings using multivariate extreme value theory and introduces a scale-invariant classifier.
result The classifier outperforms baselines and generates meaningful augmented text.

We approximate derivatives of functions on manifolds by embedding them and applying vector-valued operators.

problem Derivatives of manifold-valued functions are harder to approximate than vector-valued functions.
method Embed the manifold into a higher space, approximate the derivative of the vector-valued function, and project back.
result We provide error bounds for the approximation of manifold-valued function derivatives.

Bayesian sparsification improves complex-valued neural networks by 50-100x with minimal performance loss.

problem Efficiently compressing complex-valued neural networks for embedded systems.
method Extending Sparse Variational Dropout to complex-valued networks and conducting a numerical study.
result Achieved state-of-the-art performance on MusicNet with 50-100x compression.

New method learns state embeddings from demonstrations for improved reinforcement learning.

problem Difficult relationship between observed state and useful policy actions in dynamic problems.
method Variational framework for learning state embeddings that optimize trajectory linearity.
result Learning embedding spaces improves policy gradient reinforcement learning performance.

The recent proliferation of publicly available graph-structured data has sparked an interest in machine learning algorithms for graph data. Since most traditional machine learning algorithms assume data to be tabular, embedding algorithms for mapping graph data to real-valued vector spaces has become an active area of …

2019-08-08abs ↗pdf ↗

Unified framework for complex-valued eigenfunctions on Riemannian symmetric spaces.

problem Finding a unified scheme for complex-valued eigenfunctions on Riemannian symmetric spaces.
method Employing the Cartan embedding for classical compact Riemannian symmetric spaces and quaternionic Grassmannians.
result Construction of new eigenfunctions on quaternionic Grassmannians.

Word embeddings are a powerful approach for capturing semantic similarity among terms in a vocabulary. In this paper, we develop exponential family embeddings, a class of methods that extends the idea of word embeddings to other types of high-dimensional data. As examples, we studied neural data with real-valued observ…

2016-08-02abs ↗pdf ↗

The study shows how to accurately estimate embedding vectors in high dimensions.

problem How to accurately estimate embedding vectors in high-dimensional spaces.
method A simple probability model and a variant of low-rank approximate message passing (AMP) method.
result The AMP approach enables precise predictions of the accuracy of the estimation in certain high-dimensional limits.

The study analyzes XRP transaction networks to understand market dynamics.

problem Understanding market dynamics of XRP through transaction data.
method Weekly weighted directed networks are embedded into a vector space using network embedding techniques. A correlation tensor is calculated and analyzed using singular value decomposition.
result The correlation tensor provides insights into the system's behavior and dependence on model parameters.

Quantum kernel methods can lead to trivial models due to exponential concentration of kernel values.

problem Exponential concentration of quantum kernel values can lead to trivial models in QML.
method Analyzing the resources needed to accurately estimate quantum kernel values and identifying four sources of concentration.
result Quantum kernel values can be exponentially concentrated, leading to trivial models.

The paper defines invariants for almost graph embeddings and explores their properties.

problem Understanding the properties and limitations of almost graph embeddings in the plane.
method Introducing and analyzing integer invariants (winding number, Wu numbers) for almost embeddings.
result Some values of invariants are realizable for almost embeddings but not for embeddings.

We demonstrate an equivalence between reproducing kernel Hilbert space (RKHS) embeddings of conditional distributions and vector-valued regressors. This connection introduces a natural regularized loss function which the RKHS embeddings minimise, providing an intuitive understanding of the embeddings and a justificatio…

2012-05-21abs ↗pdf ↗

In statistical relational learning, knowledge graph completion deals with automatically understanding the structure of large knowledge graphs---labeled directed graphs---and predicting missing relationships---labeled edges. State-of-the-art embedding models propose different trade-offs between modeling expressiveness, …

2017-02-22abs ↗pdf ↗

VICE embeds concepts in a vector space using human data.

problem Developing numerical models for mental representations of object concepts.
method Variational Interpretable Concept Embeddings (VICE) using variational inference and triplet odd-one-out task data.
result VICE outperforms SPoSE at predicting human behavior and provides more reproducible object representations.

A new method estimates multi-dimensional value distributions using Hilbert space embeddings.

problem Estimating value distributions in complex, multi-dimensional reinforcement learning settings.
method Hilbert space mappings and kernel mean embeddings to estimate the kernel mean embedding of multi-dimensional value distributions.
result Uniform convergence guarantees and robust off-policy evaluation demonstrated in simulations.

A nonparametric approach for policy learning for POMDPs is proposed. The approach represents distributions over the states, observations, and actions as embeddings in feature spaces, which are reproducing kernel Hilbert spaces. Distributions over states given the observations are obtained by applying the kernel Bayes' …

2012-10-16abs ↗pdf ↗

We describe the Customer LifeTime Value (CLTV) prediction system deployed at ASOS.com, a global online fashion retailer. CLTV prediction is an important problem in e-commerce where an accurate estimate of future value allows retailers to effectively allocate marketing spend, identify and nurture high value customers an…

2017-03-07abs ↗pdf ↗

The study of Seifert linking forms for punctured n-manifolds in (2n-1)-space.

problem Understanding Seifert linking forms for punctured n-manifolds.
method Analyzing integer-valued bilinear symmetric forms on Hn1(N0;Z)H_{n-1}(N_0;\mathbb Z) and proving their realizability.
result The value modulo two of the invariant equals a specific intersection formula involving Steifel-Whitney class.

We unify subsampling methods for network embeddings and prove their asymptotic distribution.

problem Understanding and improving the performance of network embeddings learned via subsampling.
method Unified framework for node2vec-like methods, proving asymptotic distribution under exchangeable graph assumption.
result Asymptotic distribution of learned embedding vectors decouples and provides rates of convergence.

Investigates the rotating Kepler problem for energy values ≤ -3/2.

problem Understanding periodic orbits and symplectic structures in rotating celestial mechanics.
method Ligon-Schaaf and Levi-Civita symplectic regularizations, special concave toric domain construction.
result Identification of a special concave toric domain (SCTD) for the RKP phase space.

In this paper we prove that an embedded and simply connected constant mean curvature surface with curvature large at a point contains a multi-valued graph around that point on the scale of A2|A|^2, where A2|A|^2 is the norm squared of the second fundamental form. This generalizes Colding and Minicozzi's result for mini…

2004-09-10abs ↗pdf ↗

Skip-gram with negative sampling, a popular variant of Word2vec originally designed and tuned to create word embeddings for Natural Language Processing, has been used to create item embeddings with successful applications in recommendation. While these fields do not share the same type of data, neither evaluate on the …

2018-04-11abs ↗pdf ↗

With automobiles becoming increasingly reliant on sensors to perform various driving tasks, it is important to encode the relevant CAN bus sensor data in a way that captures the general state of the vehicle in a compact form. In this paper, we develop a deep learning-based method, called Drive2Vec, for embedding such s…

2018-06-12abs ↗pdf ↗

LLMs can memorize economic data and recall exact values before their training cutoff.

problem Evaluating the trustworthiness of LLMs' economic forecasts during their training period.
method Demonstrated through counterfactual forecasting and analysis of LLMs' recall ability.
result LLMs have memorized economic and financial data, leading to recall-level accuracy before their knowledge cutoff.

Paper establishes identifiability conditions for a model with two latent vectors and auxiliary data.

problem Identifying conditions for a statistical model with two latent vectors and auxiliary data.
method Proposes a statistical model with two latent vectors and auxiliary data, establishing various identifiability conditions.
result Identifiability conditions reveal a dimensionality relation and link model indeterminacies to maximum link weights.