Saec compresses recommendation system embeddings by clustering similar features.
problem Large embedding matrix in recommendation systems consumes excessive memory.
method Saec clusters similar features within a field to reduce embedding matrix size.
result Saec reduces embedding size by ~27x with no performance loss.
Graph embeddings have become a key and widely used technique within the field of graph mining, proving to be successful across a broad range of domains including social, citation, transportation and biological. Graph embedding techniques aim to automatically create a low-dimensional representation of a given graph, whi…
Hermite polynomials improve private data generation by reducing feature count.
problem Infinite-dimensional features in kernel mean embedding are impractical for private data generation.
method Replace random features with Hermite polynomial features, leveraging their ordered nature.
result Hermite polynomial features yield a more accurate approximation of kernel mean embedding with fewer features.
Study removes bias from chest X-ray embeddings using orthogonalization.
problem Reduces bias in chest X-ray embeddings due to protected features.
method Orthogonalization technique to remove protected feature effects.
result Orthogonalization removes bias and makes predictions of protected attributes infeasible.
NIS learns optimal embedding sizes for recommendation models.
problem Finding optimal embedding sizes for large-scale recommendation models.
method Neural Input Search (NIS) uses reinforcement learning to automatically find optimal vocabulary sizes and embedding dimensions.
result NIS improves prediction accuracy by 6.8% on Recall@1 and 1.8% on ROC-AUC.
GEM improves recommendation by capturing complex feature interactions.
problem Capturing complex high-order interaction signals in feature-based recommendation models.
method Integrates graph convolution networks to generate high-order embeddings and combines with FM-based models.
result Significant improvement in recommendation performance over baselines.
A novel method extracts topological features from word embeddings for text classification.
problem High dimensional and noisy text representations in natural language processing.
method Persistent homology for topological data analysis on word embeddings.
result Topological features outperform conventional text mining features on long textual documents.
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.
AN2VEC disentangles feature and structural information in social networks.
problem Difficulty in separating feature and structural information in social networks.
method Graph Convolutional Networks (GCN) Variational Autoencoder for disentangled node embeddings.
result AN2VEC captures joint information of structure and features better than unshared information.
Quantum kernels can be efficiently embedded into classical feature spaces.
problem Can all quantum kernels be efficiently embedded into classical feature spaces?
method Invoking computational universality and using techniques like random Fourier features, the authors show that certain classes of quantum kernels can be efficiently embedded.
result For shift-invariant and composition kernels, embedding quantum kernels are universal and efficient.
Feature extraction and dimension reduction for networks is critical in a wide variety of domains. Efficiently and accurately learning features for multiple graphs has important applications in statistical inference on graphs. We propose a method to jointly embed multiple undirected graphs. Given a set of graphs, the jo…
Paper proposes FKR-F2E to make kernel regression fair.
problem Mitigating demographic biases in kernel methods.
method Fair feature embedding in kernel space.
result FKR-F2E achieves lower prediction disparity. Task2Vec creates task embeddings for meta-learning.
problem Creating a framework for selecting feature extractors for new tasks.
method Process images through a probe network to compute task embeddings based on Fisher information matrix.
result Task embeddings predict task similarities and feature extractor performance.
MCSAE improves speaker embedding by focusing on both high- and low-level features.
problem Reduced effect of low-level features in speaker embedding encoding.
method Masked cross self-attentive encoding using ResNet with multi-layer aggregation and random masking regularization.
result Improved speaker embedding with equal error rate of 2.63% and minimum detection cost function of 0.1453.
ADEC addresses feature randomness and drift in autoencoder-based clustering.
problem Clustering autoencoders learn unreliable pseudo-labels, distorting latent space and feature randomness.
method Adversarial training to balance reconstruction loss and clustering objective.
result ADEC outperforms state-of-the-art autoencoder-based clustering methods.
Paper explores understanding of neural source code embeddings.
problem Lack of understanding of contents and characteristics of code2vec embeddings.
method Small case study using code2vec embeddings to create binary SVM classifiers and compare performance with handcrafted features.
result Code2vec embeddings perform similarly to handcrafted features and have more evenly distributed information gains.
We present a novel event embedding algorithm for crime data that can jointly capture time, location, and the complex free-text component of each event. The embedding is achieved by regularized Restricted Boltzmann Machines (RBMs), and we introduce a new way to regularize by imposing a ℓ1 penalty on the conditiona…
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.
Zero-shot audio classification using class label embeddings.
problem Classifying audio without labeled data.
method Bilinear model with audio feature embeddings and class label embeddings.
result Achieved accuracy up to 39.7% for natural audio categories.
Improves speaker verification for variable-duration utterances using a feature pyramid module.
problem Improving robustness for variable-duration utterances in speaker verification.
method Integrates a feature pyramid module into multi-scale aggregation to enhance speaker-discriminative information from multiple layers.
result Improves performance for both short and long utterances compared to state-of-the-art approaches.
AGE improves graph embedding by smoothing features and iteratively enhancing node embeddings.
problem Challenges in attributed graph embedding, especially in preserving optimal low-pass characteristics and robustness.
method AGE, a novel framework combining Laplacian smoothing and adaptive encoding, addresses these issues.
result AGE consistently outperforms state-of-the-art methods on node clustering and link prediction tasks.
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' …
TGAT learns node embeddings for evolving graphs, capturing both static and temporal features.
problem Learning node embeddings for dynamic graphs with evolving topological structures and temporal patterns.
method Temporal Graph Attention (TGAT) layer using self-attention and functional time encoding.
result TGAT model can inductively infer node embeddings for new and observed nodes as the graph evolves.
MBExplainer provides explanations for models combining graph embeddings and tabular features.
problem Explaining models using a mix of graph embeddings and tabular features.
method Model-agnostic approach using Shapley values and Monte Carlo Tree Search.
result MBExplainer efficiently finds human-readable explanations for model predictions.
Paper improves image retrieval quality using nonlinear rank approximations.
problem Improving image retrieval quality in high-dimensional feature spaces.
method Computes normalized approximated ranks, converts to similarities, and uses them in a new loss function.
result Significant improvement in image retrieval quality on multiple datasets.
DVE models dynamic changes in feature embeddings for better sequence-aware applications.
problem Dynamic characterization of feature variations in time-varying data.
method Dynamic Variational Embedding (DVE) using recurrent neural networks.
result DVE models intrinsic nature and temporal variation of nodes effectively.
ReliefE ranks features faster and better in high-dimensional data.
problem Feature ranking in high-dimensional spaces.
method Adapting Relief algorithms to manifold embeddings.
result ReliefE outperforms traditional Relief algorithms in feature ranking.
Proposes DP-MERF for privacy-preserving synthetic data generation.
problem Privacy-preserving data generation for synthetic datasets.
method Differentially private mean embeddings with random features.
result Achieves better privacy-utility trade-offs than existing methods.
Metric learning aims at learning a distance which is consistent with the semantic meaning of the samples. The problem is generally solved by learning an embedding for each sample such that the embeddings of samples of the same category are compact while the embeddings of samples of different categories are spread-out i…
In this note we discuss a common misconception, namely that embeddings are always used to reduce the dimensionality of the item space. We show that when we measure dimensionality in terms of information entropy then the embedding of sparse probability distributions, that can be used to represent sparse features or data…
Paper proposes a method to refine embeddings efficiently.
problem Efficiently refining embeddings after their creation.
method Uses a Domain Adversarial Network (DAN) with constraints.
result Significantly outperforms state-of-the-art unsupervised algorithms.
Sequence feature embedding is a challenging task due to the unstructuredness of sequence, i.e., arbitrary strings of arbitrary length. Existing methods are efficient in extracting short-term dependencies but typically suffer from computation issues for the long-term. Sequence Graph Transform (SGT), a feature embedding …
Modern deep transfer learning approaches have mainly focused on learning generic feature vectors from one task that are transferable to other tasks, such as word embeddings in language and pretrained convolutional features in vision. However, these approaches usually transfer unary features and largely ignore more stru…
HGNN learns augmented features for deep multi-task learning.
problem Feature learning for deep multi-task learning.
method Hierarchical Graph Neural Network (HGNN) with two levels of graph neural networks.
result Significant performance improvement in classification tasks.
Caps2NE learns node embeddings in graphs using capsule layers.
problem Learning low-dimensional node embeddings in graph data.
method Caps2NE uses a two-capsule layer architecture with a routing process to aggregate neighbors' features.
result Caps2NE achieves state-of-the-art performance on node classification tasks.
Enhances forecasting of complex systems using FKMD.
problem Forecasting high-dimensional dynamical systems with unknown features.
method Featurized Koopman Mode Decomposition (FKMD) using delay embedding and learned Mahalanobis distance.
result Improves prediction accuracy for various complex systems.
Locally Linear Embedding improves psychiatric diagnosis accuracy from fMRI data.
problem Improving psychiatric diagnosis accuracy from fMRI data.
method Locally Linear Embedding of BOLD time-series data to optimise feature selection using LOOCV.
result Embedded fMRI gave highly diagnostic performances (> 80%) on eleven publicly-available datasets.
Advances deep network embedding through multi-filtering GCN.
problem Existing attribute embedding methods fail to capture different aspects of node features.
method Multi-filtering Graph Convolution Neural Network (GCN) framework.
result Significant improvement in link prediction and node classification tasks with limited training data.
This paper studies clustering and embedding in high-dimensional Gaussian mixture block models.
problem Clustering and embedding in high-dimensional Gaussian mixture block models.
method Spectral clustering and embedding algorithms for graphs sampled from Gaussian mixture block models.
result Performance analysis of spectral clustering and embedding algorithms for 2-component spherical Gaussian mixtures.
Embed nodes with multi-scale attributes for robust network analysis.
problem Capturing complex node attributes across different scales.
method Multi-scale attributed node embedding (AE & MUSAE) using Skip-gram approach.
result Proves node-feature mutual information is implicitly factorized by embeddings.
Paper tackles zero-shot activity recognition using video features and text embeddings.
problem Zero-shot activity recognition with videos.
method Auto-encoder model for multimodal joint embedding, 3D convolutional action recognition for visual features, GloVe word embeddings for textual features.
result Improved zero-shot recognition results with top-n accuracy and mean Nearest Neighbor Overlap.
LASE improves local network structure visualization by targeting locally low-dimensional regions.
problem Global spectral embedding fails to capture local geometric features in sparse, transitive networks.
method Local Adjacency Spectral Embedding (LASE) using weighted spectral decomposition.
result LASE reveals locally low-dimensional structure, improving local reconstruction and visualization.
Paper explores applying TDA to text classification, improving model performance.
problem Applying TDA to text classification is challenging due to the complexity of text geometry.
method Used word embeddings and TF-IDF vectors to extract topological features from text.
result Topological features improve classification results, especially in ensemble models.
A new framework CL embeds features and labels for multi-label classification.
problem Exponential growth of output space in multi-label classification.
method Compact Learning (CL) framework that embeds features and labels simultaneously.
result CMLL maximizes label-feature dependency and minimizes label space loss.
The widespread availability of electronic health records (EHRs) promises to usher in the era of personalized medicine. However, the problem of extracting useful clinical representations from longitudinal EHR data remains challenging. In this paper, we explore deep neural network models with learned medical feature embe…
HGCN uses hyperbolic geometry to improve graph node embeddings.
problem Distortion in Euclidean embeddings of real-world graphs.
method Derives GCN operations in hyperbolic space and maps Euclidean features to hyperbolic embeddings.
result HGCN achieves up to 63.1% error reduction in ROC AUC for link prediction.
Proposes an ensemble framework for outlier detection with embedded feature selection.
problem Improving performance of outlier detection in noisy data.
method Unified feature selection and outlier detection, thresholded self-paced learning, alternate algorithm.
result The proposed framework ODEFS outperforms existing methods on real-world datasets.
HeteGCN improves text classification with efficient, scalable graph models.
problem Text classification with large datasets and features, especially in small labeled sets.
method HeteGCN combines PTE and TextGCN, using heterogeneous graphs and feature embeddings.
result HeteGCN achieves better performance and scalability compared to existing methods.