Proposes a method to generate semantically meaningful adversarial examples.
problem Challenges in creating semantically meaningful adversarial examples.
method Captures semantics via manifold learning, perturbs using Gram-Schmidt process, and imposes adversarial constraints.
result Effectively generates adversarial examples that evade existing defenses.
This work provides uncertainty intervals for semantic latent variables in disentangled latent spaces.
problem Challenges in providing meaningful uncertainty quantification for semantic information in disentangled latent spaces.
method Uses quantile regression to output heuristic uncertainty intervals, calibrates these intervals to contain true latent values, and propagates them through the generator.
result Reliably communicates semantically meaningful, principled, and instance-adaptive uncertainty in image super-resolution and image completion.
Generative model uses graphs to create natural-sounding code.
problem Creating semantically meaningful source code with syntactic and semantic constraints.
method Graph representation for intermediate state, interleaves grammar-driven expansion with graph augmentation and neural message passing.
result Generative model outperforms baselines in generating natural-sounding code.
Unsupervised segmentation learns features without labels, improving accuracy.
problem Discover and localize semantically meaningful categories in images without annotations.
method Separates feature learning from cluster compactification; distills unsupervised features into discrete semantic labels using a contrastive loss function.
result Significant improvement over prior state of the art on semantic segmentation challenges.
Weakly-supervised RL identifies meaningful tasks, improving performance in complex environments.
problem Learning to efficiently explore and distinguish between meaningful and irrelevant tasks.
method Weak supervision to automatically disentangle meaningful tasks from a large space of nonsensical tasks.
result The learned subspace of meaningful tasks leads to substantial performance gains, especially in complex environments.
The paper tests deep music embeddings for semantic consistency.
problem Ensuring deep music embeddings capture meaningful musical semantics.
method Proposes a systematic method to test deep music representations for semantic consistency, considering both input audio space and latent deep space.
result Distance consistency between related points is maintained in both input audio space and latent deep space.
Service robots learn new tasks more efficiently with ISI, improving query performance and reducing training time.
problem Incremental learning of semantic concepts in multi-relational embeddings for service robots.
method Incremental Semantic Initialization (ISI) that allows new semantic concepts to be initialized in relation to previously learned embeddings.
result ISI improves immediate query performance by 41.4% and reduces the number of epochs to approach model convergence by 78.2%.
Advocates Tversky's model for image similarity learning.
problem Learning Tversky similarity measures from image data.
method Computational approach using Tversky's ratio model.
result Performs well compared to existing methods on image datasets.
Proposes FBFAN to defend against adversarial attacks by learning semantic features.
problem Vulnerability of deep neural networks to adversarial attacks.
method Featurized Bidirectional Generative Adversarial Networks (FBGAN) that learns semantic features and filters non-semantic perturbations.
result FBGAN effectively reconstructs adversarial data to denoised data, improving classifier performance.
ML-VAE learns disentangled representations from grouped data.
problem Learning disentangled representations from grouped observations with minimal supervision.
method Multi-Level Variational Autoencoder (ML-VAE) that separates latent representation at group and observation levels.
result ML-VAE learns meaningful disentanglement of grouped data and enables manipulation of latent representation.
Proposes MorphMine for unsupervised morpheme segmentation to improve word embeddings.
problem Lack of semantic information in word-level analysis for infrequent and out-of-vocabulary words.
method MorphMine applies a parsimony criterion to hierarchically segment words into the fewest number of morphemes.
result MorphMine segments words into human-verified morphemes and improves word embedding quality.
Introduces PCG for better counterfactual explanations in vision models.
problem Ambiguity in latent-space optimization methods for counterfactual explanations.
method Constructs counterfactuals by tracing geodesics under a perceptually Riemannian metric.
result PCG outperforms baselines and reveals hidden failure modes.
This work prevents variational autoencoders from collapsing by adding an auxiliary decoder.
problem Variational autoencoders can collapse into autodecoders, losing semantic information.
method Adding an auxiliary decoder to regularize the latent space.
result Auxiliary decoders increase semantic information in the latent space and reconstructions.
The paper improves semantic interpolation in latent spaces of implicit models.
problem Interpolating between latent points in implicit models requires careful distributional matching.
method Proposes modifying the prior code distribution to concentrate more probability mass near the origin.
result Linear interpolation paths are shortest and pass through high-density regions, improving sample quality and semantics.
A new method improves topic modeling accuracy using semantic filtering.
problem Improving topic modeling accuracy in text documents.
method Three-step process: generate word/word-pair, apply TF-IDF, merge similar semantic pairs.
result Improves topic accuracy by up to 12.99% compared to state-of-the-art models.
VASE learns disentangled representations that generalize across domains.
problem Learning new knowledge from diverse data sources while preserving old knowledge.
method VASE uses shared embeddings and Minimum Description Length principle to disentangle representations.
result VASE achieves better cross-domain inference and disentangled representations.
Hierarchical model learns progressively abstract representations.
problem Learning meaningful hierarchical latent structures.
method Adversarial training for generative and inference models.
result Minimizing Jensen-Shanon divergence minimizes reconstruction error.
Enhances cooperative multi-task SemCom for distributed users.
problem Performance degradation in cooperative multi-tasking due to negative information transfer.
method Federated learning (FL) with semantic-aware task clustering.
result Constructive cooperation across distributed users with semantic-aware task clustering.
LLMs show surprising confidence in their answers, beyond just tokens.
problem LLMs lack meaningful confidence estimates for their responses.
method Semantic calibration test based on local loss optimality and equivalence classes.
result Base LLMs are semantically calibrated across tasks, contrary to expectations.
Expanding self-supervised learning to diverse domains reveals Rotation's semantic superiority.
problem Limited self-supervised learning experiments on diverse domains.
method Experimented on various domains (satellite, textural, biological) using popular self-supervised methods.
result Rotation task is semantically most meaningful, with other tasks relying on distribution rather than semantic understanding.
Improves GANs by sampling meaningful points from latent manifold.
problem Lack of semantic information in GANs' prior distribution.
method Local Coordinate Coding (LCC) for sampling and improved generator approximation.
result Improves GANs' performance in generating realistic data.
StylEx trains a GAN to explain classifier decisions in StyleSpace.
problem Creating meaningful image-specific explanations for classifier decisions.
method Training a StyleGAN to learn a classifier-specific StyleSpace, incorporating the classifier model.
result StylEx finds attributes that align with semantic ones and generates human-interpretable explanations.
Contrastive Code Representation Learning improves code summarization and type inference.
problem Code representations are sensitive to edits, hindering downstream semantic understanding tasks.
method ContraCode: a contrastive pre-training task that learns code functionality.
result Contrastive pre-training improves code summarization and type inference accuracy.
New method uses cycle consistency to enforce invariance in latent space.
problem Learning meaningful and independent factors of variation in datasets.
method Two separate latent subspaces, cycle consistency constraints, deep information bottleneck.
result Identifies more meaningful factors leading to sparser and interpretable models.
Quantum machine learns faster by reverse annealing on AQCs.
problem Training RBMs on AQCs is hard due to low qubit connectivity.
method Embedding RBM nodes to virtual qubits, semantic quantum search, reverse annealing schedule.
result Reverse annealing accelerates RBM training and improves reconstruction scores.
SAMI learns disentangled representations from data.
problem Learning disentangled representations from data.
method Combines diffusion models and VAEs to learn disentangled representations.
result SAMI learns disentangled representations that are interpretable and useful.
Tile2Vec learns spatially meaningful representations without labels.
problem Lack of unsupervised methods for geospatial data.
method Unsupervised representation learning using the distributional hypothesis.
result Tile2Vec improves performance in spatial classification tasks.
Word2Vec captures musical relationships in complex polyphonic music.
problem Capturing meaningful relationships in musical contexts.
method Skip-gram version of word2vec applied to music slices from a large corpus.
result Word2Vec embeddings reveal functional chord and harmonic associations.
ISDA augments deep networks by adding semantic transformations.
problem Improving deep network generalization through semantic data augmentation.
method ISDA augments deep feature space by estimating covariance and drawing random vectors.
result ISDA consistently improves deep model performance on various datasets.
New framework aims to make neural network explanations more reliable.
problem Current interpretability methods rely on intuition and lack falsifiability.
method Proposes a framework for strongly falsifiable interpretability research.
result Falsifiable interpretability methods can generate meaningful advances in understanding DNNs.
Import2vec creates embeddings for software libraries to improve learning tasks.
problem Developing semantic representations for software libraries.
method Applied word embedding techniques from NLP to library packages.
result Library vectors capture meaningful relationships among libraries.
New method extracts biological concepts from cell microscopy images.
problem Extracting meaningful concepts from vision foundation models trained on cell microscopy images.
method Sparse dictionary learning (DL) combined with PCA whitening pre-processing.
result Successfully retrieved biologically meaningful concepts like cell types and genetic perturbations.
Improved generalization with semantic perturbations using normalizing flows.
problem Overfitting in deep neural networks training.
method Use normalizing flows for generating semantically meaningful perturbations in latent space.
result Achieved 96.6% test accuracy on CIFAR-10 with ResNet-18, outperforming existing methods.
DCR improves interpretability of concept-based models by using neural networks to build rule structures.
problem Inability of concept-based models to provide transparent decision processes.
method DCR uses neural networks to build syntactic rule structures using concept embeddings and executes these rules on concept truth degrees.
result DCR improves interpretability by up to 25% on challenging benchmarks and discovers meaningful logic rules.
Enhances interpolation paths in latent space using particle filters.
problem Generating meaningful interpolations between data points in latent space.
method Introduces a discriminator network to guide particle filter sampling of interpolation paths.
result Improved variability and stronger drift towards high data density areas.
Hierarchical nucleation patterns emerge in deep neural network layers.
problem Understanding the generation of meaningful representations in deep neural networks.
method Analysis of the probability density of ImageNet dataset across hidden layers.
result Density peaks in subsequent layers mirror the semantic hierarchy of concepts, resembling nucleation process.
TLMG4Eth combines language and graph models for Ethereum fraud detection.
problem Current fraud detection methods fail to consider semantic and similarity patterns in Ethereum transactions.
method TLMG4Eth uses a transaction language model and graph-based methods to capture semantic, similarity, and structural features.
result TLMG4Eth detects anomalies in Ethereum transactions more effectively than existing methods.
This paper improves search efficiency by augmenting autoencoder encodings.
problem Improving search speed and relevance in information retrieval.
method Gradient Augmented Information Retrieval with Autoencoders and Semantic Hashing.
result Gradient Augmented Search (GSA) enhances TF-IDF-based systems.
The semantic map calibrates uncertainty from language model probabilities.
problem Uncertainty in language model probabilities for professional decisions.
method Prespecified semantic map linking probabilities of verbal responses to probabilities of declared states.
result Language-derived probabilities outperform printed numerical probabilities and recover valid uncertainty coverage.
MONet learns to decompose scenes into meaningful components without supervision.
problem Learning meaningful scene decompositions without labeled data.
method MONet combines a VAE and recurrent attention network to learn decompositions of 3D scenes.
result MONet can learn to represent 3D scenes into meaningful components like objects and background.
SFAVEL distills features from language models for fact verification without annotations.
problem Fact verification with semantically meaningful and compact features.
method Self-supervised pretraining using contrastive loss with language models.
result Achieved state-of-the-art results on FB15k-237 and FEVER.
New method learns low-dimensional representations of AI-generated treatments.
problem Representing AI-generated treatments without losing semantic meaning.
method Double kernel representation learning with alternating minimization.
result Efficiently learned representations guide generative models and facilitate adaptive online experiments.
Unsupervised method discovers interpretable directions in GAN latent space.
problem Discovering interpretable directions in GAN latent space without supervision.
method Model-agnostic procedure to identify directions corresponding to semantic manipulations.
result Findings include directions for background removal and competitive saliency detection performance.
CRC method provides tighter uncertainty intervals for CT images.
problem Expressing uncertainty in CT images in clinically meaningful terms.
method Semantically adaptive CRC procedure leveraging length minimization.
result Valid coverage of ground-truth images with tighter uncertainty intervals.
Proposes a new method to optimize graph neural network architectures on heterogeneous information networks.
problem Weaknesses in instability and inflexibility of existing graph neural architecture search methods.
method Partial Message Meta Multigraph search (PMMM) using a differentiable framework to search for a meaningful meta multigraph.
result Significantly more stable and effective than state-of-the-art heterogeneous GNNs.
Hierarchical density embeddings capture word relationships with uncertainty.
problem Capturing semantic relationships and uncertainty in word embeddings.
method Learn hierarchical representations through probability density encapsulation, using simple loss functions and distance metrics.
result State-of-the-art performance on WordNet and Hyperlex datasets.
Wi-Fringe recognizes named gestures using WiFi CSI without training data.
problem Lack of training data for WiFi-based gesture recognition.
method WiFi CSI values paired with activity names for recognition.
result Wi-Fringe detects activities with or without training data.
Linear Discriminant Analysis (LDA) is a well-known method for dimensionality reduction and classification. Previous studies have also extended the binary-class case into multi-classes. However, many applications, such as object detection and keyframe extraction cannot provide consistent instance-label pairs, while LDA …