Unified theory linking node embeddings and graph representations.
problem Clarifying the relationship between node embeddings and graph representations.
method Using invariant theory, the paper establishes a theoretical framework bridging node embeddings and structural graph representations.
result Proves equivalence between node embeddings and structural graph representations, showing they are interchangeable for various tasks.
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.
This study improves sentence embeddings from BERT models.
problem Capturing the underlying meaning of sentences using BERT models.
method Comprehensive review and testing of various sentence embedding extraction and refinement methods.
result Representation-shaping techniques significantly improve sentence embeddings from BERT-based and simple baseline models.
We present an unsupervised approach for discovering semantic representations of mathematical equations. Equations are challenging to analyze because each is unique, or nearly unique. Our method, which we call equation embeddings, finds good representations of equations by using the representations of their surrounding …
The study categorizes knowledge graph relations and explains their embedding representations.
problem Understanding how knowledge graph relation representations capture semantic information.
method Categorizing knowledge graph relations into three types and deriving explicit requirements for their representations.
result Empirical properties of relation representations and the performance of methods are justified by the analysis.
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…
Estimator Vectors learns OOV word embeddings using subword and context clues.
problem Lack of OOV word representations in neural network models.
method Jointly learns word, subword, and context clue representations.
result Strong estimates for OOV words via combined subword and context clue embeddings.
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.
New examples show embeddings not approximated by Anosov representations.
problem Understanding quasi-isometric embeddings of word hyperbolic groups into SL(d,R). method Constructing specific examples of embeddings that are not limits of Anosov representations.
result Analogous density theorem does not hold for SL(d,R) when d⩾5. New examples of embeddings defy Anosov representation limits.
problem Examples of robust quasi-isometric embeddings not approximated by Anosov representations.
method Exhibited non-locally rigid, Zariski dense embeddings in SLm(K). result Higher rank Anosov representation theorems fail for m≥30. 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.
Study evaluates margin parameter effects on knowledge embedding quality.
problem Understanding margin parameter's impact on embedding quality.
method Examined margin parameter values for multi-relational categorized data.
result Lower margin values are insufficient, while larger values cause noise.
A new method for document network embedding interprets and generalizes well.
problem Lack of interpretability and generalization to new documents in existing methods.
method Introduces Topic-Word Attention (TWA) and Inductive Document Network Embedding (IDNE) to generate document representations.
result Achieves state-of-the-art performance on various networks and produces meaningful representations.
Linear representations help embed manifolds into matrix spaces.
problem Embedding manifolds into matrix spaces with effective bounds.
method Defining linear representations of G-manifolds as maps into matrix spaces, encoding G-actions as matrix products. result Explicit bounds for Mostow-Palais G-equivariant embeddings of G-manifolds into G-modules V, showing dimV<∞ for compact G. This paper improves spectral embedding for multipartite networks, revealing latent subspaces and providing consistent node representations.
problem Improving spectral embedding for multipartite networks to better represent node types.
method Developed a follow-on step to spectral embedding that recovers node representations in their intrinsic rather than ambient dimension, proving consistency under a specific model.
result Node representations in multipartite networks lie near type-specific subspaces, and the proposed method recovers these representations consistently.
Recent successes in word embedding and document embedding have motivated researchers to explore similar representations for networks and to use such representations for tasks such as edge prediction, node label prediction, and community detection. Such network embedding methods are largely focused on finding distribute…
This research shows how to learn shared representations from unpaired data.
problem Learning shared representations from unpaired data.
method Spectral embeddings of random walk matrices from each unimodal representation.
result Shared representations can be learned almost exclusively from unpaired data.
Distributed representations of words, better known as word embeddings, have become important building blocks for natural language processing tasks. Numerous studies are devoted to transferring the success of unsupervised word embeddings to sentence embeddings. In this paper, we introduce a simple representation of sent…
Graph embedding techniques convert graph data into vectors to preserve graph properties.
problem Handling high-dimensional irregular graph data.
method Various graph embedding techniques to convert graph data into low-dimensional vectors.
result Evaluation of state-of-the-art methods on small and large datasets.
APGE protects graph node representations from inference attacks.
problem Privacy leakage in graph embedding methods.
method Adversarial training framework with disentangling and purging mechanisms.
result APGE preserves structural and utility attributes while concealing private information.
Kernel embeddings help estimate causal effects from observational data.
problem Estimating causal effects from observational data with confounding variables.
method Kernel embeddings in reproducing kernel Hilbert spaces (RKHS).
result Robust nonparametric framework for causal inference.
Proposes clustering as a new evaluation method for clinical knowledge embedding.
problem Traditional Link Prediction evaluation protocol loses information and harms model accuracy.
method Proposes Clustering Evaluation Protocol as an alternative.
result Experimental results show the proposed protocol can potentially replace Link Prediction.
CADE learns dual node representations for better generalization.
problem Transductive graph embeddings cannot generalize to unseen nodes or across different graphs.
method CADE combines real-time neighborhoods with neighbor-attentioned representation, preserving known node memory.
result CADE outperforms state-of-the-art methods in generalization and context-awareness.
Improved molecular property prediction using WL embedding in GNNs.
problem Limited performance of GNNs in predicting molecular properties.
method Explored Weisfeiler-Lehman (WL) embedding to replace GNN layers, enhancing representability and performance.
result WL embedding consistently improves GNN performance across multiple datasets.
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.
Trains word embeddings from music and text data to link music contexts.
problem Varying vocabulary size and musical relevance in word embeddings.
method Combines general text and music-specific data to train word embeddings.
result Trained embeddings better associate music contexts with compositions.
Persona2vec learns multiple node roles in graphs.
problem Graphs often have nodes with multiple overlapping roles.
method Persona2vec learns multiple node representations based on structural contexts.
result Persona2vec outperforms state-of-the-art models in link prediction.
A novel geometric algebra-based KG embedding framework improves link prediction.
problem KG embedding to model entities and relations in a low-dimensional space.
method Utilizes multivector representations and geometric product in geometric algebra.
result Outperforms state-of-the-art models in link prediction experiments.
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.
The paper presents a new method to represent directed graphs using pseudo-Riemannian manifolds.
problem Representing directed graphs in a compact and meaningful way.
method Combines pseudo-Riemannian metric structure, non-trivial global topology, and a unique likelihood function.
result Low-dimensional cylindrical Minkowski and anti-de Sitter spacetimes produce equal or better graph representations than curved Riemannian manifolds.
The joint optimization of representation learning and clustering in the embedding space has experienced a breakthrough in recent years. In spite of the advance, clustering with representation learning has been limited to flat-level categories, which often involves cohesive clustering with a focus on instance relations.…
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…
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.
Method learns audio embeddings with contextualized tags.
problem Align audio and tags for cross-modal tasks.
method Audio autoencoder, word embeddings, multi-head self-attention, contrastive loss.
result Multi-head self-attention improves audio representations.
InstantEmbedding efficiently generates node representations with less computation and memory.
problem Efficiently generating local node representations for large graphs.
method Local PageRank computations in sublinear time.
result Significantly faster and less memory-intensive than traditional methods.
A new framework for graph representation learning.
problem Acquiring continuous representations of discrete objects like graphs.
method Nested SubSpace (NSS) arrangement and Disk-ANChor ARrangement (DANCAR).
result Successfully embedded WordNet in 20-dimensional space with high F1 score.
Enhances thematic investing with stock embeddings from textual data.
problem Challenges in constructing thematic portfolios due to overlapping sector boundaries and evolving market dynamics.
method Introduces THEME, a framework that fine-tunes embeddings using hierarchical contrastive learning, aligning themes and stocks using their hierarchical relationship and incorporating stock returns.
result Theme-aligned portfolios demonstrate compelling performance, significantly outperforming large language models in thematic asset retrieval.
Earth observation embeddings can convert discrete biome maps into continuous representations that better capture ecological variation.
problem Biome maps impose categorical boundaries that compress continuous variation in biotic communities.
method Fit a linear classifier on Earth observation embeddings to predict biome labels.
result Continuous biome representation outperforms discrete biome labels for predicting species occurrence.
VJE learns latent representations without contrastive learning, providing probabilistic semantics.
problem Learning latent representations without contrastive signals.
method VJE maximizes a symmetric conditional evidence lower bound (ELBO) on paired encoder embeddings, using a Student-t distribution on a polar representation.
result VJE outperforms standard non-contrastive baselines in ImageNet-1K, CIFAR-10/100, and STL-10.
The abstract explains how word and relation representations capture semantic meaning.
problem Understanding how word and relation representations capture semantic meaning.
method Theoretical justification and extension of geometric relationships between word embeddings and knowledge graph representations.
result The geometric relationships between word embeddings correspond to semantic relations between words and entities in knowledge graphs.
We propose a new method for embedding graphs while preserving directed edge information. Learning such continuous-space vector representations (or embeddings) of nodes in a graph is an important first step for using network information (from social networks, user-item graphs, knowledge bases, etc.) in many machine lear…
Improves interpretability of graph representation learning models.
problem Limited insight into graph representation learning models.
method Exploration of methods to interpret node embeddings and creation of an evaluation framework.
result Improved ability to recover graph structure in downstream tasks.
ME2Vec learns medical entity vectors from EHR data.
problem Learning structured information from EHR data.
method Graph-based medical entity embedding using diverse graph embedding techniques.
result ME2Vec outperforms baselines in disease diagnosis prediction.
Adding attributes for nodes to network embedding helps to improve the ability of the learned joint representation to depict features from topology and attributes simultaneously. Recent research on the joint embedding has exhibited a promising performance on a variety of tasks by jointly embedding the two spaces. Howeve…
Paper proposes a new speech representation benchmark and model.
problem Lack of benchmarks for comparing speech representations.
method Unsupervised triplet-loss objective for training a universal non-semantic speech representation.
result Proposed representation outperforms other models on benchmark and transfer learning tasks.
Compressed LLM embeddings improve noisy regression tasks without overfitting.
problem Noisy regression tasks with high signal-to-noise ratios.
method Comparison of embedding compression techniques using autoencoder hidden representations.
result Compression improves performance on noisy tasks like financial return prediction.
A new method reduces embedding size for efficient recommendation systems.
problem Memory bottleneck in embedding tables for diverse categorical features.
method Complementary partitions to produce unique embeddings without explicit definition.
result Our approach reduces embedding size and maintains similar accuracy.
New embedding method in function spaces improves expressiveness.
problem Enhancing expressiveness in knowledge graph embeddings.
method Employing polynomial functions and neural networks with varying layer complexities.
result Improved expressiveness and more degrees of freedom in entity representation.