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

2885758631,150 · Jun 202019922001200920172026
48 results for label network embedding

Prototypical Networks improve multi-label classification accuracy.

problem Multi-label classification with nonlinear label dependencies.
method Formulate multi-label learning as class distribution in a non-linear embedding space. For each label, positive and negative embeddings are compactly distributed. Labels are inferred by measuring the distance to prototype positive or negative embeddings.
result Extensive experiments show improved accuracy compared to state-of-the-art algorithms.

LNEMLC embeds label network for multi-label classification.

problem Lack of effective adaptation and preservation of generalization abilities for unseen label combinations.
method LNEMLC embeds label network to extend input space for any base multi-label classifier.
result Statistically significant improvements over simple kNN baseline classifier.

Paper proposes M3S training for GCNs on graphs with few labels.

problem Learning graph embeddings with few labeled nodes is challenging.
method Multi-Stage Self-Supervised (M3S) Training Algorithm combining self-supervised learning.
result M3S Training Algorithm improves GCNs' generalization on graphs with few labeled nodes.

Unified model combines feature and label propagation for semi-supervised classification.

problem Combining feature and label propagation for effective semi-supervised classification.
method Unified Message Passing Model (UniMP) using Graph Transformer and masked label prediction.
result Obtains new state-of-the-art results in Open Graph Benchmark (OGB).

MetaTNE tackles few-shot novel labels in graphs, improving node classification.

problem Node classification on graphs with novel labels and limited training data.
method MetaTNE framework with structural, meta-learning, and optimization modules.
result MetaTNE significantly improves node classification over state-of-the-art methods.

InfoSEM infers gene regulatory networks without GT labels, improving performance.

problem Inferring GRNs from gene expression data with high accuracy and avoiding biases.
method InfoSEM uses deep generative models with informative priors (textual gene embeddings).
result InfoSEM outperforms existing models by 38.5% across four datasets.

Improved acoustic word embeddings using shared decoder in multi-view encoders.

problem Learning discriminative acoustic word embeddings from text labels.
method Combining Siamese multi-view encoders with a shared decoder network to maximize the relationship between acoustic and text embeddings.
result 11.1% relative improvement in average precision on acoustic word discrimination task with WSJ dataset.

Despite the advancement of supervised image recognition algorithms, their dependence on the availability of labeled data and the rapid expansion of image categories raise the significant challenge of zero-shot learning. Zero-shot learning (ZSL) aims to transfer knowledge from labeled classes into unlabeled classes to r…

2018-05-18abs ↗pdf ↗

KGNN-LS improves recommender systems using knowledge graphs and label smoothness.

problem Improving recommender systems through better user-item embeddings.
method KGNN-LS combines knowledge graphs, user-specific embeddings, and label smoothness regularization.
result KGNN-LS outperforms state-of-the-art baselines and handles cold-start scenarios.

We address the problem of domain generalization where a decision function is learned from the data of several related domains, and the goal is to apply it on an unseen domain successfully. It is assumed that there is plenty of labeled data available in source domains (also called as training domain), but no labeled dat…

2018-07-09abs ↗pdf ↗

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.

This paper tackles UDA by learning domain-invariant embeddings using distribution alignment and pseudo-labels.

problem Unsupervised domain adaptation between two visual domains.
method Shared deep encoder, Sliced-Wasserstein Distance, deep classifier, pseudo-labels for class alignment.
result Effective solution for training deep classification networks on source domain to generalize to target domain.

End-to-end deep metric learning tackles multi-label image classification.

problem Multi-label image classification problem.
method Two-way deep distance metric learning in a latent space with a reconstruction module.
result Our method outperforms state-of-the-arts on publicly available image datasets.

AUASE embeds dynamic networks with stability guarantees for node comparison.

problem Stability in dynamic network embeddings for comparing nodes across time.
method Attributed unfolded adjacency spectral embedding (AUASE) for stable unsupervised learning.
result AUASE provides significant improvements in link prediction and node classification.

CAGNN learns graph embeddings without labels by clustering and refining graph topology.

problem Learning graph embeddings without labeled data.
method Cluster-aware graph neural network (CAGNN) with self-supervised learning and topology refinement.
result CAGNN achieves significant improvements in node clustering accuracy.

Kernel and neural embeddings improve optimization and generalization in deep networks.

problem Improving optimization and generalization in deep neural networks.
method Investigated three kernel representations and their neural network approximations, comparing their optimization and generalization properties.
result Kernel and neural embeddings enhance both optimization and generalization in deep networks.

Study evaluates ZSL methods for unseen hashtag predictions from tweet text.

problem Lack of labeled data for all possible hashtag labels in supervised training.
method Proposed a Zero Shot Learning (ZSL) paradigm to predict unseen hashtag labels.
result Demonstrated effectiveness and scalability of ZSL methods for unseen hashtag recommendations.

A new method embeds labels and group information for efficient multi-label classification.

problem Efficient multi-label classification with label sparsity and group structure.
method Identifies label groups, embeds labels and features in a low-dimensional space preserving sparsity and group structure.
result Our method outperforms state-of-the-art algorithms on benchmark datasets.

Proposes Group Loss for deep metric learning to improve clustering and image retrieval.

problem Improving deep metric learning for better clustering and image retrieval.
method Group Loss based on label-propagation method enforcing embedding similarity across all samples of a group.
result Shows state-of-the-art results on clustering and image retrieval on several datasets.

Method analyzes large-scale network data to detect communication pattern shifts.

problem Analyzing large-scale time-series network data is challenging.
method Temporal encoder embedding method using ground-truth or estimated vertex labels.
result Detects communication pattern shifts across all levels of network structure.

PanRep learns universal node embeddings for heterogeneous graphs.

problem Learning universal node embeddings for heterogeneous graphs.
method Graph Neural Network (GNN) model with four decoders capturing different properties.
result PanRep outperforms unsupervised and supervised methods in node classification and link prediction.

This work analyzes label embedding for large multiclass classification problems.

problem Label embedding for large multiclass classification problems.
method Analysis of label embedding in extreme multiclass classification, presenting an excess risk bound and showing a trade-off between computational and statistical efficiency.
result The statistical penalty for label embedding vanishes with sufficiently low coherence under the Massart noise condition.

Proposes ML-GCN for multi-label graph node classification using GCN and relaxed skip-gram model.

problem Loss of label correlations in multi-label graph node classification.
method Uses a GCN to embed node features and graph topology, generates random label vectors, and detects correlations using a skip-gram model.
result Significantly outperforms state-of-the-art methods on graph classification datasets.

CLEANN detects and mitigates neural network Trojans without labeled data.

problem Trojans in embedded neural networks that bypass detection during inference.
method Dictionary learning and sparse approximation for identifying Trojan triggers, lightweight algorithm/hardware co-design.
result Efficient real-time execution on resource-constrained platforms, competitive attack resiliency.

Interactive machine learning with weak supervision and pre-trained embeddings.

problem Training machine learning models with limited labeled data.
method Use pre-trained embeddings to define a distance function and extend source votes to nearby points.
result Significantly outperforms traditional weakly-supervised and fully-supervised methods.

Efficient label acquisition processes are key to obtaining robust classifiers. However, data labeling is often challenging and subject to high levels of label noise. This can arise even when classification targets are well defined, if instances to be labeled are more difficult than the prototypes used to define the cla…

2018-03-26abs ↗pdf ↗

Network Embeddings (NEs) map the nodes of a given network into dd-dimensional Euclidean space Rd\mathbb{R}^d. Ideally, this mapping is such that `similar' nodes are mapped onto nearby points, such that the NE can be used for purposes such as link prediction (if `similar' means being `more likely to be connected') or c…

2018-05-19abs ↗pdf ↗

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…

2017-02-22abs ↗pdf ↗

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…

2016-11-29abs ↗pdf ↗

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…

2018-04-17abs ↗pdf ↗

MPVAE learns latent embeddings and label correlations for multi-label classification.

problem Challenging task of predicting multiple targets with label correlations.
method Proposes MPVAE, a novel framework that learns latent embedding spaces and label correlations using a Multivariate Probit model.
result MPVAE outperforms state-of-the-art methods on various application domains and is robust under noisy settings.

A new method improves semi-supervised learning by handling tasks with different attribute spaces.

problem Existing methods assume tasks share the same attribute space, limiting their applicability.
method Meta-learning approach that embeds labeled and unlabeled data in task-specific spaces using neural networks.
result Improves test performance on tasks with small labeled data using unlabeled and various task data.

Despite the breakthroughs achieved by deep learning models in conventional supervised learning scenarios, their dependence on sufficient labeled training data in each class prevents effective applications of these deep models in situations where labeled training instances for a subset of novel classes are very sparse -…

2018-04-19abs ↗pdf ↗

The objective in extreme multi-label learning is to train a classifier that can automatically tag a novel data point with the most relevant subset of labels from an extremely large label set. Embedding based approaches make training and prediction tractable by assuming that the training label matrix is low-rank and hen…

2015-07-09abs ↗pdf ↗

BERT-based word embeddings improve active learning for text datasets.

problem Efficiently labelling large text datasets for machine learning.
method Evaluation of text representation mechanisms (BERT vs. bag of words) in active learning.
result BERT-based word embeddings significantly improve active learning performance.