PGEL learns embeddings to diversify protein motifs while maintaining biological function.
problem Generating diverse protein structures while preserving biological function.
method Embedding learning framework that enhances motif diversity in a diffusion model's frozen denoiser.
result PGEL achieves greater structural diversity, better designability, and improved self-consistency compared to partial diffusion.
Deep learning system generates new Chinese fonts via style variables.
problem Efficiently design new Chinese fonts.
method End-to-end deep learning system generating new style fonts via interpolation of latent style-related embedding variables.
result Smooth transition between different font styles achieved.
MEI model improves knowledge graph completion by efficiently modeling interactions between embeddings.
problem Efficiently modeling interactions between knowledge graph embeddings to predict missing links.
method MEI divides embeddings into partitions and uses Tucker and block term formats to model interactions efficiently.
result Achieves state-of-the-art performance on link prediction tasks.
Heterophily affects GNN robustness; separating ego- and neighbor-embeddings improves defense.
problem The robustness of GNNs to adversarial attacks.
method Formalized relation between heterophily and GNN robustness; empirical analysis; design principles for improved robustness.
result Separating ego- and neighbor-embeddings increases GNN robustness.
DeepGG generates graph distributions for drug discovery and molecular design.
problem Learning graph distributions for various applications.
method Improved deep graph generator based on deep state machines with graph and node embeddings.
result The state machine design favors specific graph distributions.
EPINE enhances network embedding by improving adjacency matrix-based high-order proximity.
problem Inaccurate and poorly designed calculation of high-order proximity in network embedding.
method EPINE redefines high-order proximity intuitively and proposes a scalable algorithm for accurate calculation.
result EPINE outperforms existing methods in network reconstruction, link prediction, and node classification.
TinyCNN accelerates CNN models on embedded FPGA with 15x speedup.
problem Limited memory on embedded FPGAs restricts CNN performance.
method Software and hardware design tool for FPGA resource-aware CNN accelerator.
result 3% accuracy loss with 15.75x speedup on image classification.
NMIXX fine-tunes embeddings for finance, outperforming general models in Korean.
problem Financial embeddings struggle in low-resource languages like Korean.
method Fine-tuned with 18.8K triplets, hard negatives, and translations.
result NMIXX achieves gains of +0.10 on English FinSTS and +0.22 on KorFinSTS.
The recent advances in deep neural networks (DNNs) make them attractive for embedded systems. However, it can take a long time for DNNs to make an inference on resource-constrained computing devices. Model compression techniques can address the computation issue of deep inference on embedded devices. This technique is …
Network representation learning in low dimensional vector space has attracted considerable attention in both academic and industrial domains. Most real-world networks are dynamic with addition/deletion of nodes and edges. The existing graph embedding methods are designed for static networks and they cannot capture evol…
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…
Network embedding, which learns low-dimensional vector representation for nodes in the network, has attracted considerable research attention recently. However, the existing methods are incapable of handling billion-scale networks, because they are computationally expensive and, at the same time, difficult to be accele…
Graph neural networks struggle with heterophily, but new designs improve their performance.
problem Graph neural networks struggle with heterophily (networks where connected nodes may have different class labels and dissimilar features).
method Ego- and neighbor-embedding separation, higher-order neighborhoods, and combination of intermediate representations.
result The identified designs increase the accuracy of GNNs by up to 40% and 27% over models without them on synthetic and real networks with heterophily, respectively.
Enhances graph classification with multiple graphs.
problem Improving graph classification accuracy with multiple graphs.
method Graph fusion embedding using encoder embedding.
result The method consistently improves classification accuracy for large vertex sets.
The paper examines the consistency of item embeddings in recommendation systems.
problem The relevance of averaging item embeddings for user or concept representation.
method Proposes an expected precision score to measure consistency and analyzes it theoretically and empirically.
result Real-world averages are less consistent for recommendation compared to theoretical assumptions.
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.
We present a novel method named Latent Semantic Imputation (LSI) to transfer external knowledge into semantic space for enhancing word embedding. The method integrates graph theory to extract the latent manifold structure of the entities in the affinity space and leverages non-negative least squares with standard simpl…
Enhances LightGCN for credit bond recommendations with dynamic node embeddings.
problem Challenges in static embeddings for rapidly evolving user interests in finance.
method Causal graph convolution for dynamic node embeddings over chronological user-item interactions.
result Significantly enhances LightGCN performance in financial product recommendations.
New test for conditional independence using kernel embeddings.
problem Testing conditional independence in high-dimensional settings.
method Analytic kernel embeddings, asymptotic distribution.
result New test outperforms existing methods in high-dimensional settings.
ALPINE predicts links in networks by querying the most informative pairs.
problem Predicting links in partially observed networks efficiently.
method Active learning using network embedding.
result ALPINE achieves significant link prediction accuracy with fewer queries.
The performance of many network learning applications crucially hinges on the success of network embedding algorithms, which aim to encode rich network information into low-dimensional vertex-based vector representations. This paper considers a novel variational formulation of network embeddings, with special focus on …
Text classification is a challenging problem which aims to identify the category of texts. In the process of training, word embeddings occupy a large part of parameters. Under the limitation of limited computing resources, it indirectly limits the ability of subsequent network designs. In order to reduce the number of …
FEET protocol evaluates foundation models across three scenarios.
problem Lack of standardized evaluation protocols for foundation models.
method Structured evaluation protocol across three use cases: frozen, few-shot, and fine-tuned embeddings.
result Demonstrates comprehensive assessment of foundation models' effectiveness.
Generates low-dimensional node vectors for graphs with privacy while preserving structural preferences.
problem Publishing graph node vectors can leak sensitive individual information.
method SE-PrivGEmb, a skip-gram based technique with a unified noise tolerance mechanism and negative sampling probabilities.
result Our method outperforms existing methods in structural equivalence and link prediction tasks.
In this paper, we introduce a novel layer designed to be used as the output of pre-trained neural networks in the context of classification. Based on Associative Memories, this layer can help design Deep Neural Networks which support incremental learning and that can be (partially) trained in real time on embedded devi…
This paper examines linear embeddings for high-dimensional Bayesian optimization, identifying and addressing issues to improve performance.
problem Scaling Bayesian optimization to high-dimensional spaces while maintaining sample efficiency.
method Study and empirical evaluation of linear embeddings for BO, addressing design choices and their impact on performance.
result Properly addressing issues in linear embeddings significantly improves their efficacy in BO.
In this paper we present a unified framework for modeling multi-relational representations, scoring, and learning, and conduct an empirical study of several recent multi-relational embedding models under the framework. We investigate the different choices of relation operators based on linear and bilinear transformatio…
A quantum model classifies financial sentiment by mapping text chunks to quantum circuits.
problem Classifying financial texts with high accuracy and preserving semantic information.
method Chunked diagrams are mapped to quantum circuits, with a Transformer encoder and type embeddings added for context.
result The hybrid model improves sentiment classification over a simple averaging baseline.
PyKEEN 1.0 simplifies KGE model creation and optimization.
problem Training and evaluating knowledge graph embeddings (KGEs).
method Composes KGEMs with various interaction models, training approaches, and loss functions. Implements automatic memory optimization and extensive HPO functionalities.
result PyKEEN 1.0 streamlines KGE model creation and optimization.
RNE tackles scalable recommendation for billion-scale scenarios.
problem Designing a scalable recommendation system for diverse and dynamic user interests.
method RNE uses a diversity- and dynamics-aware neighbor sampling method for scalable network embedding.
result RNE achieves high-quality and diverse results on a billion-scale user-item graph.
Word embeddings are a popular approach to unsupervised learning of word relationships that are widely used in natural language processing. In this article, we present a new set of embeddings for medical concepts learned using an extremely large collection of multimodal medical data. Leaning on recent theoretical insigh…
Network embedding has proved extremely useful in a variety of network analysis tasks such as node classification, link prediction, and network visualization. Almost all the existing network embedding methods learn to map the node IDs to their corresponding node embeddings. This design principle, however, hinders the ex…
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…
Proposes PKG embedding for e-commerce products.
problem Learning product intrinsic relations for e-commerce applications.
method Self-attention-enhanced distributed representation learning model from raw data.
result Compared favorably to baselines in knowledge completion and downstream tasks.
Generative model designs drug combinations for improved efficacy and reduced side effects.
problem Designing effective drug combinations to overcome resistance and reduce side effects.
method Developed a deep generative model using HVGAE and a novel reward system.
result Network-principled drug combinations show reduced toxicity and potential for new strategies.
Well-quasi-orders proved on embedded planar graphs.
problem Proving well-quasi-orders on embedded planar graphs.
method Careful analysis and extensions of classical methods for embedded minor relations.
result Embedded minor relations are well-quasi-orders on various classes of embedded planar graphs.
New algorithm converts data into sub-gaussian designs efficiently.
problem Efficiently converting large datasets into sub-gaussian random designs for robust performance.
method Algorithmic Gaussianization through sketching and averaging, using LESS embeddings.
result Efficient data sketches nearly indistinguishable from sub-gaussian designs.
Semantic segmentation remains a computationally intensive algorithm for embedded deployment even with the rapid growth of computation power. Thus efficient network design is a critical aspect especially for applications like automated driving which requires real-time performance. Recently, there has been a lot of resea…
Paper debiases text embeddings using context injection.
problem Text embeddings capture and perpetuate biases.
method Review 19 embedding models, quantify biases, and test context injection.
result Higher performing models are more prone to biases but better at incorporating context.
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 mSoftMax(XYT), optimizing cross entropy. result Achieves higher or comparable accuracy to existing methods with lower computational time.
EGORSE optimizes high-dimensional problems using random and supervised embeddings.
problem Efficiently solving computationally expensive high-dimensional optimization problems.
method EGORSE combines random and supervised linear embeddings for adaptive optimization.
result EGORSE outperforms state-of-the-art methods in high-dimensional optimization.
In this paper, we propose Dynamic Self-Attention (DSA), a new self-attention mechanism for sentence embedding. We design DSA by modifying dynamic routing in capsule network (Sabouretal.,2017) for natural language processing. DSA attends to informative words with a dynamic weight vector. We achieve new state-of-the-art …
Graph embedding is an effective method to represent graph data in a low dimensional space for graph analytics. Most existing embedding algorithms typically focus on preserving the topological structure or minimizing the reconstruction errors of graph data, but they have mostly ignored the data distribution of the laten…
Paper tackles embedding attributed sequences in unsupervised learning.
problem Mining tasks over attributed sequences with dependencies between sequences and attributes.
method Proposes a deep multimodal learning framework, NAS, for unsupervised learning of attributed sequences.
result NAS produces task-independent embeddings for various mining tasks on real-world datasets.
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.
Acoustic word embeddings --- fixed-dimensional vector representations of arbitrary-length words --- have attracted increasing interest in query-by-example spoken term detection. Recently, on the fact that the orthography of text labels partly reflects the phonetic similarity between the words' pronunciation, a multi-vi…
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.
CogMol designs novel drug-like molecules for SARS-CoV-2 targets.
problem Designing efficient drugs for novel viral proteins.
method End-to-end framework combining VAE, controlled sampling, and predictors.
result Highly selective and affinity molecules for SARS-CoV-2 targets.