Paper proposes nearly unsupervised hashcode learning for relation extraction.
problem Relation extraction from text, especially in biomedical domains.
method Optimized hashcode representations learned from data points without class labels, followed by supervised classification.
result Significant accuracy improvements over state-of-the-art methods.
A new text representation model combines CNN and VAE for better semantic extraction.
problem Difficult to effectively extract semantic features and distinguish polysemy in text data.
method Integrates CNN for feature extraction and VAE for consistent Gaussian distribution.
result The model outperforms traditional classification algorithms in text classification tasks.
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.
Proposes a framework to extract ordered eigenfunctions from contextual kernels.
problem Lack of exact spectral decomposition in existing methods.
method Modular building blocks for compatibility with contextual kernels and scalability.
result Extracted eigenfunctions provide effective importance scores for feature selection.
Efficiently extracts linear dynamics from complex observations.
problem Learning policies directly from rich, high-dimensional observations.
method Modeling linear dynamics in a hidden subspace and developing an efficient algorithm.
result Successfully extracts linear dynamics from rich observations.
Neural networks enhance relation extraction from biomedical literature.
problem Automated extraction of relations between biomedical concepts.
method Use of multichannel architectures in deep neural networks with biomedical ontologies.
result State-of-the-art results in relation extraction tasks.
Extract common latent factors from graphs for better representation learning.
problem Graph-level representation learning challenges due to limited labeled data and poor negative sample selection.
method Graph-wise Common Latent Factor Extraction (GCFX) using deepGCFX model.
result Improved graph-level and node-level tasks performance compared to state-of-the-art methods.
ExpBERT uses natural language explanations to improve text interpretation.
problem Improving text interpretation for relation extraction tasks.
method Fine-tuning BERT on MultiNLI to interpret natural language explanations.
result ExpBERT matches a BERT baseline but requires less labeled data and improves performance.
We present a novel method that can learn a graph representation from multivariate data. In our representation, each node represents a cluster of data points and each edge represents the subset-superset relationship between clusters, which can be mutually overlapped. The key to our method is to use formal concept analys…
Sound event detection systems typically consist of two stages: extracting hand-crafted features from the raw audio waveform, and learning a mapping between these features and the target sound events using a classifier. Recently, the focus of sound event detection research has been mostly shifted to the latter stage usi…
Feature extraction has gained increasing attention in the field of machine learning, as in order to detect patterns, extract information, or predict future observations from big data, the urge of informative features is crucial. The process of extracting features is highly linked to dimensionality reduction as it impli…
AA extracts archetypes from data for clear feature extraction.
problem Non-convex optimization problem in AA.
method Computational procedure extracting archetypes as convex combinations of data.
result AA offers interpretable representations for high-dimensional data.
Extract symbolic models from deep learning with inductive biases.
problem Interpreting and discovering physical principles from deep neural networks.
method Introduce strong inductive biases in GNNs, encourage sparse latent representations, apply symbolic regression.
result Extracted symbolic equations from neural networks, including known force laws and new analytic formulas.
Slot Attention extracts object-centric representations from images.
problem Learning distributed representations that don't capture natural scene composition.
method Slot Attention module interfaces with CNN outputs to produce task-dependent abstract slots.
result Slot Attention enables generalization to unseen compositions.
Unified framework for unsupervised concept extraction simplifies guarantees.
problem Establishing guarantees for unsupervised concept extraction.
method Unified theoretical framework, meta-theorem for identifiability.
result Simplifies the task of proving guarantees for concept extraction.
W-RNN improves text classification by extracting serialized text semantics.
problem Semantic constraint in sparse representation classification methods.
method Weighted RNN using word vectors and recurrent neural networks.
result W-RNN outperforms other methods in precision, recall, F1, and loss values.
Probabilistic models learned as density estimators can be exploited in representation learning beside being toolboxes used to answer inference queries only. However, how to extract useful representations highly depends on the particular model involved. We argue that tractable inference, i.e. inference that can be compu…
Extracts high-quality monolingual datasets from web crawl data.
problem Improving text representation quality through larger corpora.
method Automated pipeline using deduplication and language identification, augmented with filtering for high-quality documents.
result Extracted massive high-quality monolingual datasets from Common Crawl.
The paper studies multi-view representation learning with generalization guarantees and a new regularizer.
problem Distributed multi-view representation learning with correct estimation at a decoder.
method Generalization bounds using relative entropy and MDL, data-dependent Gaussian mixture priors.
result Data-dependent Gaussian mixture priors lead to good performance and outperform existing methods.
New walk extraction strategies improve node embeddings in KGs.
problem Improving node embeddings in knowledge graphs.
method Proposed five different walk extraction strategies to complement basic random walks.
result The n-gram strategy performs best on average for node classification tasks.
FLARe model forecasts Alzheimer's progression using learned latent representations.
problem Forecasting Alzheimer's disease progression at the patient level.
method Generates a sequence of latent representations from longitudinal data across multiple modalities, incorporating time horizon.
result Outperforms baseline in forecasting accuracy and F1 score, robustly handling missing visits.
HiGraphDTI learns drug and target representations from molecular graphs to predict DTIs.
problem Inaccurate drug-target interaction prediction due to insufficient chemical information extraction.
method Hierarchical graph representation learning to extract chemical information from atoms, motifs, and molecules.
result HiGraphDTI outperforms state-of-the-art methods in DTI prediction and interaction interpretation.
IsoNN learns graph representations without node order constraints.
problem Lack of interpretability and erratic performance in graph classification due to node-orderless property.
method IsoNN uses graph matching with subgraph templates to learn isomorphic features and break node-order.
result IsoNN achieves superior performance on graph classification tasks compared to existing methods.
Extract class-specific subnetworks from neural models for better understanding and improved explanations.
problem Understanding and explaining the complex behavior of deep neural networks.
method For each semantic class, extract a class-specific subnetwork with a compressed structure that maintains comparable performance.
result Extracted subnetworks improve explanation saliency and adversarial example detection.
A new modal autoencoder improves feature extraction by constraining the decoder.
problem Improving autoencoder performance through regularization.
method Proposed a modal autoencoder (MAE) by orthogonalizing the readout weight matrix.
result Extracted functionally independent features that perform better in classification tasks.
In this paper, we propose a deep multimodal fusion network to fuse multiple modalities (face, iris, and fingerprint) for person identification. The proposed deep multimodal fusion algorithm consists of multiple streams of modality-specific Convolutional Neural Networks (CNNs), which are jointly optimized at multiple fe…
The quality of data representation in deep learning methods is directly related to the prior model imposed on the representations; however, generally used fixed priors are not capable of adjusting to the context in the data. To address this issue, we propose deep predictive coding networks, a hierarchical generative mo…
Networks have been a general tool for representing, analyzing, and modeling relational data arising in several domains. One of the most important aspect of network analysis is community detection or network clustering. Until recently, the major focus have been on discovering community structure in single (i.e., monople…
Proposes RLAR for efficient labeled data classification with robust margin and manifold structure.
problem Clear margin representation and data manifold structure difficulty in linear discriminant methods.
method Introduces retargeted regression for adaptive margin learning and locality-aware strategy for compact data manifold.
result RLAR outperforms state-of-the-art approaches in UCI and benchmark data sets.
Model uses LLM features to predict stock returns effectively.
problem Predicting stock returns from text data.
method Structured Event Representation (SER) model with attention mechanisms.
result SER-based model outperforms existing models in stock return prediction.
TIPRDC anonymizes data features to protect privacy while retaining useful information.
problem Privacy concerns from crowdsourced data hinder deep learning applications.
method Hybrid training method combining adversarial and mutual information estimation.
result Feature extractor hides private information while preserving original data features.
New approach extracts AI model representations for steering and monitoring.
problem Understanding and steering AI models' internal knowledge representation.
method Feature learning advances for scalable linear concept representations.
result Concept representations enable steering and monitoring of AI models.
We consider an online decision making setting known as contextual bandit problem, and propose an approach for improving contextual bandit performance by using an adaptive feature extraction (representation learning) based on online clustering. Our approach starts with an off-line pre-training on unlabeled history of co…
GenIE extracts structured text with fewer errors and more entities.
problem Closed information extraction with errors and limited entities.
method End-to-end autoregressive generation with bi-level constraints.
result State-of-the-art performance on closed information extraction.
Paper proposes a method to extract style features from unlabeled data.
problem Extracting fine-grained features like styles from unlabeled data.
method Contrastive conditioned variational autoencoders with mutual information constraints.
result The method efficiently extracts style features from real-world natural image datasets.
In this paper, we present a technique for unsupervised learning of visual representations. Specifically, we train a model for foreground and background classification task, in the process of which it learns visual representations. Foreground and background patches for training come af- ter mining for such patches from …
A new framework converts EEG signals between subjects and tasks.
problem Noise and variability in EEG data hinder generalizable signal extraction.
method Contrastive Split-Latent Permutation Autoencoder (CSLP-AE) framework.
result The CSLP-AE framework enables zero-shot conversion between unseen subjects.
Transformer learns graph structure better with subgraph info.
problem Transformer struggles with structural similarity in graph learning.
method Structure-Aware Transformer with subgraph attention.
result Improves graph prediction benchmarks significantly.
We consider the classification problem for compact Lie groups G⊂U(n) which are generated by a single conjugacy class with a fixed number N of distinct eigenvalues. We give an explicit classification when N=3, and apply this to extract information about Galois representations and braid group representations.
Paper uses deep learning to make predictions transparently.
problem Lack of transparency in DNN predictions.
method Extracts latent variables from trained DNNs for unified analysis.
result Improved prediction accuracy and transparency.
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.
Graphs are general and powerful data representations which can model complex real-world phenomena, ranging from chemical compounds to social networks; however, effective feature extraction from graphs is not a trivial task, and much work has been done in the field of machine learning and data mining. The recent advance…
FedMCC learns from distributed data to cluster and extract features.
problem Learning from distributed data and clustering.
method Federated Momentum Contrastive Clustering (FedMCC) framework.
result FedMCC outperforms existing methods in linear evaluation and semi-supervised learning.
CNNs improve medical image classification with few samples.
problem Classifying medical images with limited training data.
method Transfer learning using CNNs, representation extraction, and a novel metric for performance prediction.
result CNN-based transfer learning outperforms feature-based methods with high correlation to test set performance.
Automatically extracts features from time series data for improved forecasting.
problem Manual feature selection for time series forecasting is inefficient and prone to errors.
method Extracts features from time series using recurrence plots and computer vision algorithms.
result Automatically extracted features lead to highly comparable and sometimes superior forecasting performance.
q-VAE extracts disentangled latent spaces for robot control and dynamic systems.
problem Disentangled representation learning for latent spaces in robotics.
method Proposes q-VAE based on Tsallis statistics, improving disentanglement and latent dynamics.
result Improves disentangled representation while maintaining data reconstruction accuracy.
We consider the task of unsupervised extraction of meaningful latent representations of speech by applying autoencoding neural networks to speech waveforms. The goal is to learn a representation able to capture high level semantic content from the signal, e.g.\ phoneme identities, while being invariant to confounding l…
SPEDER extracts state-action abstraction from dynamics for reinforcement learning.
problem Curse of dimensionality and limited applicability of spectral methods.
method Spectral Decomposition Representation (SPEDER) that extracts state-action abstraction from dynamics without policy dependence.
result Theoretical analysis establishes sample efficiency in online and offline settings.