Recent works reveal that network embedding techniques enable many machine learning models to handle diverse downstream tasks on graph structured data. However, as previous methods usually focus on learning embeddings for a single network, they can not learn representations transferable on multiple networks. Hence, it i…
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
48 results for “embedding learning”
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.
ELM improves neural model embeddings for long-tail learning.
problem Learning skewed label distributions in neural models.
method Enforces margins in logit space and regularizes embedding distribution.
result ELM reduces generalization gap and tightens tail class embeddings.
Flexible embedding framework for diverse data types.
problem Limited applicability of existing embedding learning methods.
method A flexible framework using entity-relation-matrices and sampling mechanism.
result Framework outperforms state-of-the-art approaches in various tasks.
New framework infers multiple classes per image for one-shot learning.
problem Inferring multiple classes per image in one-shot learning.
method Compositional embedding framework with joint training of embedding and composition/query functions.
result Compositional embedding models outperform existing methods on various datasets.
Two new methods improve graph embedding without needing a complete graph structure.
problem Graph autoencoders' performance depends on the adjacency matrix quality.
method BAGE and VBAGE: unsupervised graph embedding via adaptive graph learning.
result The methods expand GAEs' applicability to datasets without graph structure.
This paper tackles efficient optimization for nonlinear embeddings in similarity learning.
problem Learning similarity with nonlinear embeddings is challenging due to the large number of pairs.
method Detailed derivations and efficient optimization methods for nonlinear embeddings are developed.
result Efficient optimization methods for nonlinear embeddings are shown to be highly effective.
AEALT uses autoencoders to reduce text embedding dimensions for improved efficiency.
problem High dimensionality of text embeddings hinders downstream tasks.
method Factor-augmented supervised learning with autoencoders.
result AEALT outperforms conventional deep-learning approaches.
Contrastive embeddings improve neural architecture search performance.
problem Improving performance of neural architecture search algorithms.
method Contrastive learning to identify networks based on data Jacobians and produce embeddings.
result Traditional black-box optimization algorithms can reach state-of-the-art performance with contrastive embeddings.
In this paper we consider self-supervised representation learning to improve sample efficiency in reinforcement learning (RL). We propose a forward prediction objective for simultaneously learning embeddings of states and action sequences. These embeddings capture the structure of the environment's dynamics, enabling e…
Recently, click-through rate (CTR) prediction models have evolved from shallow methods to deep neural networks. Most deep CTR models follow an Embedding\&MLP paradigm, that is, first mapping discrete id features, e.g. user visited items, into low dimensional vectors with an embedding module, then learn a multi-layer pe…
Learning a good speaker embedding is important for many automatic speaker recognition tasks, including verification, identification and diarization. The embeddings learned by softmax are not discriminative enough for open-set verification tasks. Angular based embedding learning target can achieve such discriminativenes…
We develop computationally efficient Riemannian manifolds for graph embeddings.
problem Challenging to maintain computational tractability in non-Euclidean graph embeddings.
method Explore computationally efficient matrix manifolds for graph embeddings.
result Consistent improvements over Euclidean geometry and outperforming hyperbolic and elliptical embeddings.
A new method speeds up SoftMax normalization for embedding learning.
problem Efficiently learning distributed representations with SoftMax normalization.
method Proposes a linear-time heuristic approximation for , optimizing cross entropy.
result Achieves higher or comparable accuracy to existing methods with lower computational time.
Unsupervised text embedding has shown great power in a wide range of NLP tasks. While text embeddings are typically learned in the Euclidean space, directional similarity is often more effective in tasks such as word similarity and document clustering, which creates a gap between the training stage and usage stage of t…
Representation learning has become an invaluable approach for learning from symbolic data such as text and graphs. However, while complex symbolic datasets often exhibit a latent hierarchical structure, state-of-the-art methods typically learn embeddings in Euclidean vector spaces, which do not account for this propert…
Word embeddings are representations of individual words of a text document in a vector space and they are often use- ful for performing natural language pro- cessing tasks. Current state of the art al- gorithms for learning word embeddings learn vector representations from large corpora of text documents in an unsu- pe…
DiSeNE generates interpretable node embeddings without supervision.
problem Lack of interpretability in unsupervised node embeddings.
method Disentangled representation learning with novel objective functions and metrics.
result DiSeNE produces interpretable node embeddings aligned with graph structure.
WEGL embeds graphs in a vector space for faster machine learning.
problem Efficiently embedding graphs for machine learning tasks.
method Wasserstein distance for node embedding similarity, Monge maps for graph representation.
result State-of-the-art classification performance with superior computational efficiency.
Ensembling word embeddings to improve distributed word representations has shown good success for natural language processing tasks in recent years. These approaches either carry out straightforward mathematical operations over a set of vectors or use unsupervised learning to find a lower-dimensional representation. Th…
The paper examines node2vec embeddings for community detection in networks.
problem Theoretical understanding of node2vec embeddings for community detection.
method Analysis of node2vec embeddings for community recovery in stochastic block models.
result k-means clustering on node2vec embeddings gives weakly consistent community recovery for stochastic block models.
The paper explores theories behind graph and relational data vector embeddings.
problem Understanding the foundations of vector embeddings for graphs and relational structures.
method Proposes two theoretical approaches to understand vector embeddings.
result Draws connections between various embedding techniques and suggests future research directions.
Deep metric learning employs deep neural networks to embed instances into a metric space such that distances between instances of the same class are small and distances between instances from different classes are large. In most existing deep metric learning techniques, the embedding of an instance is given by a featur…
Embeddings are ubiquitous in machine learning, appearing in recommender systems, NLP, and many other applications. Researchers and developers often need to explore the properties of a specific embedding, and one way to analyze embeddings is to visualize them. We present the Embedding Projector, a tool for interactive v…
Geometrically transforms word embeddings into a common space for better comparison.
problem Comparing embeddings from different sources is challenging.
method Applies orthogonal rotations and Mahalanobis scaling to transform embeddings into a shared latent space.
result The method improves word similarity and analogy tasks.
SOLAR improves search efficiency and accuracy with sparse, orthogonal embeddings.
problem Bottleneck of indexing large dense vectors and NNS for query efficiency and accuracy.
method Proposes SOLAR embeddings: sparse, orthogonal, learned, and random vectors across multiple GPUs.
result Successfully trains 500K dimensional SOLAR embeddings for 1.6M books and multi-label classification.
Learning powerful data embeddings has become a center piece in machine learning, especially in natural language processing and computer vision domains. The crux of these embeddings is that they are pretrained on huge corpus of data in a unsupervised fashion, sometimes aided with transfer learning. However currently in …
BC-Aligner maintains backward compatibility of embeddings after frequent updates.
problem Updating embeddings without requiring consumer teams to retrain their models.
method Learning backward compatible embeddings through BC-Aligner.
result BC-Aligner maintains backward compatibility with existing unintended tasks after multiple model version updates.
Word embedding, which encodes words into vectors, is an important starting point in natural language processing and commonly used in many text-based machine learning tasks. However, in most current word embedding approaches, the similarity in embedding space is not optimized in the learning. In this paper we propose a …
Probabilistic hash embeddings improve online learning of categorical features.
problem Online learning of categorical features with changing vocabulary.
method Probabilistic hash embedding (PHE) with Bayesian online learning.
result PHE mitigates forgetting and maintains high performance in online settings.
Representation learning methods that transform encoded data (e.g., diagnosis and drug codes) into continuous vector spaces (i.e., vector embeddings) are critical for the application of deep learning in healthcare. Initial work in this area explored the use of variants of the word2vec algorithm to learn embeddings for m…
Proposes QQE for transforming and embedding data distributions.
problem Transforming and embedding data distributions for better representation or visualization.
method Quantile-Quantile Embedding (QQE) using quantile-quantile plot concept.
result QQE allows for better discrimination of classes in some cases.
Euclidean embeddings of data are fundamentally limited in their ability to capture latent semantic structures, which need not conform to Euclidean spatial assumptions. Here we consider an alternative, which embeds data as discrete probability distributions in a Wasserstein space, endowed with an optimal transport metri…
Curvature regularization prevents distortion in graph embeddings.
problem Graph topology patterns distort in Euclidean space, making detection difficult.
method Proposes curvature regularization to enforce flatness in embedding manifolds.
result Significant improvements in five embedding methods on open graph datasets.
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…
FedGTEA learns new tasks in federated learning with task embeddings and alignment.
problem Federated class-incremental learning with task-specific knowledge and model uncertainty.
method Cardinality-Agnostic Task Encoder (CATE) for Gaussian task embeddings, 2-Wasserstein distance for inter-task alignment.
result FedGTEA achieves superior classification performance and mitigates forgetting.
Warm Up Cold-start Advertisements: Improving CTR Predictions via Learning to Learn ID Embeddingscs.LG
Click-through rate (CTR) prediction has been one of the most central problems in computational advertising. Lately, embedding techniques that produce low-dimensional representations of ad IDs drastically improve CTR prediction accuracies. However, such learning techniques are data demanding and work poorly on new ads w…
Most existing word embedding approaches do not distinguish the same words in different contexts, therefore ignoring their contextual meanings. As a result, the learned embeddings of these words are usually a mixture of multiple meanings. In this paper, we acknowledge multiple identities of the same word in different co…
Proposes VCLANC for attributed network clustering using node and attribute embeddings.
problem Lack of mutual affinity exploitation between nodes and attributes in graph convolution.
method Dual variational auto-encoders for node and attribute embeddings, Gaussian mixture model priors, mutual distance and clustering assignment hardening losses.
result Demonstrates effectiveness on real-world attributed network datasets.
Simple framework decouples word alignment and multilingual embedding mapping.
problem Learning multilingual embeddings without supervision.
method Two-stage approach: 1) unsupervised word alignment, 2) mapping embeddings to shared space.
result Robust performance across various multilingual tasks, including distant languages.
BERT embeddings improve sequence quality metrics.
problem Measuring the quality of generated sequences against references.
method Employ contextual BERT embeddings for sequence-level reward.
result Contextual embeddings provide a more effective learning signal.
Improves hierarchical clustering in Euclidean space using autoencoders.
problem Lack of unsupervised methods for learning hierarchical structure in Euclidean space.
method Variational autoencoder with Gaussian mixture prior, rescaling latent space, and Ward's linkage.
result Improved dendrogram purity and Moseley-Wang cost function results.
New sampling methods improve node embedding efficiency.
problem Efficiency and scalability in node embedding methods.
method Sampling approaches to node embedding, modeling eigenvectors and feature vectors.
result Improved computational efficiency and scalability.
New method integrates topological knowledge into data embeddings.
problem Lack of general tools to incorporate prior topological knowledge into embeddings.
method Introduces new topological losses to topologically regularize data embeddings.
result Natural representation of simple models like clusters and flares.
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.
Landmark-Based Node Representations for Shortest Path Distance Approximations in Random Graphsstat.ML
Landmark-based node embeddings approximate shortest path distances in random graphs.
problem Capturing global graph distances in node representations.
method Landmark-based node embeddings using shortest path distances from a subset of reference nodes (landmarks).
result Random graphs require lower dimensions in landmark-based embeddings compared to worst-case graphs.
The success of machine learning methods heavily relies on having an appropriate representation for data at hand. Traditionally, machine learning approaches relied on user-defined heuristics to extract features encoding structural information about data. However, recently there has been a surge in approaches that learn …
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.