Paper tackles continual reinforcement learning challenges with diversity exploration and adversarial self-correction.
problem Challenges in learning new tasks sequentially due to catastrophic forgetting.
method Develops an end-to-end framework (CDAN) combining unsupervised diversity exploration and adversarial self-correction.
result Final result outperforms baseline by 18.35% in NSD and 0.61 in average reward.
This paper introduces a new system for discovering patterns in morphogenetic systems using modular architecture and unsupervised learning.
problem Discovering novel patterns in morphogenetic systems is challenging and often relies on manual tuning.
method Introduces a hierarchical, modular architecture for unsupervised learning of diverse representations combined with goal exploration algorithms.
result The new system efficiently adapts diversity search towards user preferences with minimal feedback.
SKADA-bench evaluates unsupervised DA methods across diverse modalities.
problem Evaluating unsupervised DA methods on diverse modalities with realistic validation.
method Nested cross-validation and unsupervised model selection scores.
result Highlights the importance of realistic validation and provides practical guidance.
LEXA learns to discover and achieve goals in unseen environments.
problem Learning to solve diverse tasks in complex visual environments without supervision.
method LEXA learns a world model from image inputs and uses it to train an explorer and an achiever policy from imagined rollouts.
result LEXA solves tasks specified as goal images zero-shot without additional learning.
Unsupervised exploration and representation learning become increasingly important when learning in diverse and sparse environments. The information-theoretic principle of empowerment formalizes an unsupervised exploration objective through an agent trying to maximize its influence on the future states of its environme…
Self-play is an unsupervised training procedure which enables the reinforcement learning agents to explore the environment without requiring any external rewards. We augment the self-play setting by providing an external memory where the agent can store experience from the previous tasks. This enables the agent to come…
Framework discovers sub-goals for better exploration in RL tasks.
problem Improving exploration in sequential decision making under partial observability.
method Variational intrinsic control framework with information theoretic regularizer.
result Sub-goals discovered without explicit supervision lead to better exploration and sample efficiency.
Proposes MEDM to balance entropy minimization and diversity maximization for better domain adaptation.
problem Trivial solutions in entropy minimization for unsupervised domain adaptation.
method Introduces diversity maximization to balance with entropy minimization, controlled by deep embedded validation.
result MEDM outperforms state-of-the-art methods on four domain adaptation datasets.
Proposes DC3-GAN for diverse unsupervised conditional generation.
problem Low diversity in unsupervised conditional generation.
method Integrates encoder-generator pair with generator-encoder pair to enhance diversity.
result Improves clustering performance and disentanglement of latent variables.
Interprets how intrinsic motivation shapes behavior in RL agents.
problem Understanding how intrinsic motivation influences behavior in reinforcement learning agents.
method Analyzed five RL agents in procedurally generated environments using various interpretability techniques.
result Curiosity-driven agents exhibit broader and more dynamic attention than extrinsically motivated agents.
iRDM selects unlabeled samples for regression without labels, improving model accuracy.
problem Selecting unlabeled samples for regression without label information.
method Iterative representativeness-diversity maximization (iRDM).
result iRDM significantly outperforms supervised ALR, especially with limited labeled samples.
New method improves text classification without labeled target data.
problem Improving text classification under domain shift without labeled target data.
method Diversity-based generalization using multi-head attention with diversity constraints.
result Method matches state-of-the-art performance without labeled target data.
New framework uses unsupervised learning for efficient exploration in RL.
problem Efficient exploration in reinforcement learning with rich observations.
method Combines unsupervised learning and no-regret RL algorithms.
result Proves sample complexity for finding near-optimal policies.
A new algorithm learns diverse policies in reinforcement learning.
problem Learning diverse behaviors in reinforcement learning.
method Proposes Maximum Entropy Diverse Exploration (MEDE) algorithm.
result The set of policies learned by MEDE capture the same modalities as the optimal maximum entropy policy.
New method learns diverse solutions in reinforcement learning without gradient bias.
problem Lack of diverse solutions in reinforcement learning tasks.
method Maximizes state-action-based mutual information directly, using variational lower bound.
result Successfully learns an infinite set of diverse solutions.
BlosSOM improves data visualization for large datasets.
problem Insufficient performance of dimensionality reduction methods for large datasets.
method GPU-accelerated semi-supervised EmbedSOM algorithm.
result Produces high-quality visualizations with user control.
This thesis improves protein contact prediction using unsupervised and supervised methods.
problem Improving accuracy of protein contact prediction.
method Unsupervised and supervised deep learning methods.
result A scoring system called diversity score for measuring contact novelty.
DiCE uses diverse agents to explore and learn, avoiding local minima.
problem Local minima in RL due to limited exploration and correlated behavior.
method DiCE employs a group of heterogeneous agents to explore simultaneously and share experiences, with a diversity regularization mechanism.
result DiCE achieves substantial improvement over baselines in MuJoCo locomotion tasks.
Generative Adversarial Networks (GANs) have been shown to produce realistically looking synthetic images with remarkable success, yet their performance seems less impressive when the training set is highly diverse. In order to provide a better fit to the target data distribution when the dataset includes many different…
This paper shows how diverse tasks can make inefficient exploration in MTRL efficient.
problem The challenge of efficient exploration in Multitask Reinforcement Learning.
method A generic policy-sharing algorithm with myopic exploration design trained on diverse tasks.
result A generic policy-sharing algorithm with myopic exploration design can be sample-efficient in MTRL.
Improves exploration in reinforcement learning with diverse population.
problem Lack of diversity in reinforcement learning agents leads to limited exploration.
method Optimizes a population of agents using volume of behavioral manifold and online learning techniques.
result Improves exploration without sacrificing performance.
Framework improves agent's ability to learn from noisy images.
problem Agents tend to focus on distracting regions in unsupervised image-based goal exploration.
method Proposes a novel framework combining absolute Learning Progress with unsupervised image-based goal exploration.
result Agents successfully identify and ignore distracting regions, improving overall performance.
Single model detects abnormal samples across diverse tasks.
problem Detecting abnormal samples in machine learning.
method Introduced Diffusion Paths (DiffPath) using a single unconditional diffusion model.
result Single model performs OOD detection across diverse tasks.
BAE uses boosting to improve autoencoder ensembles for robust outlier detection.
problem Overfitting in autoencoders limits their effectiveness in unsupervised outlier detection.
method Boosting-based Autoencoder Ensemble (BAE) trains autoencoders sequentially with weighted sampling to reduce outliers and inject diversity.
result BAE outperforms state-of-the-art approaches in various outlier detection conditions.
Lecture note for data science students on machine learning basics and advanced topics.
problem No specific problem stated; preparing students for advanced machine learning.
method Introduction of basic machine learning concepts and advanced topics.
result Students are prepared to study advanced machine learning topics.
Agent learns diverse hierarchical structures in unknown environments.
problem Autonomous discovery and learning of diverse structures in unknown changing environments.
method Progressive construction of a Hierarchy of Observation Latent Models for Exploration Stratification (HOLMES).
result Agent can learn and reuse representations to progressively explore and discover diverse structures.
Unsupervised scheme ranks sentences in text documents based on semantic importance.
problem Ranking sentences in text documents without labeled data.
method Extracts essential words and phrases, constructs semantic phrase and sentence graphs, applies PageRank, combines scores, and optimizes for topic diversity.
result SSR outperforms individual judges and compares favorably with combined rankings on benchmarks.
Generative adversarial networks (GANs) can implicitly learn rich distributions over images, audio, and data which are hard to model with an explicit likelihood. We present a practical Bayesian formulation for unsupervised and semi-supervised learning with GANs. Within this framework, we use stochastic gradient Hamilton…
CPRA efficiently finds diverse solutions in CO problems using UL and parallelization.
problem Finding optimal solutions often requires diverse outcomes in real-world applications.
method CPRA, an UL-based framework, discovers shared representations to generate diverse solutions.
result CPRA outperforms existing UL-based solvers in generating diverse solutions.
We address the challenge of effective exploration while maintaining good performance in policy gradient methods. As a solution, we propose diverse exploration (DE) via conjugate policies. DE learns and deploys a set of conjugate policies which can be conveniently generated as a byproduct of conjugate gradient descent. …
Online feature selection has been an active research area in recent years. We propose a novel diverse online feature selection method based on Determinantal Point Processes (DPP). Our model aims to provide diverse features which can be composed in either a supervised or unsupervised framework. The framework aims to pro…
This paper tackles unsupervised AL for linear regression.
problem Optimally selecting samples to label from unlabeled data.
method Proposes a novel unsupervised pool-based AL approach considering informativeness, representativeness, and diversity.
result Demonstrated effectiveness on 14 datasets using three different linear regression models.
New method uses SHapley Additive Explanations to identify anomaly detectors with complementary behaviors.
problem Challenges in unsupervised anomaly detection due to diverse data distributions and lack of labels.
method Characterize anomaly detectors using SHapley Additive Explanations to measure feature importance and similarity.
result Detectors with similar explanations produce correlated anomaly scores, while those with divergent explanations are complementary.
Paper shows intrinsic motivation boosts exploration efficiency in HRL.
problem Efficient exploration and subgoal discovery in model-free HRL.
method Unsupervised learning over agent's experiences for subgoal discovery.
result Intrinsic motivation learning improves exploration efficiency.
Learning by children and animals occurs effortlessly and largely without obvious supervision. Successes in automating supervised learning have not translated to the more ambiguous realm of unsupervised learning where goals and labels are not provided. Barlow (1961) suggested that the signal that brains leverage for uns…
We propose MAD-GAN, an intuitive generalization to the Generative Adversarial Networks (GANs) and its conditional variants to address the well known problem of mode collapse. First, MAD-GAN is a multi-agent GAN architecture incorporating multiple generators and one discriminator. Second, to enforce that different gener…
New algorithm reduces regret with diverse contexts in bandits.
problem Impact of context diversity on stochastic linear contextual bandits.
method Design of LinUCB-d algorithm and analysis of its regret performance.
result Cumulative expected regret is bounded by a constant under diverse context assumption.
Neuromemristive systems (NMSs) currently represent the most promising platform to achieve energy efficient neuro-inspired computation. However, since the research field is less than a decade old, there are still countless algorithms and design paradigms to be explored within these systems. One particular domain that re…
Automated discovery of diverse self-organized patterns in complex systems.
problem Automated identification of interesting spatially localized patterns in self-organizing systems.
method Intrinsically motivated machine learning algorithms (POP-IMGEPs) combined with deep auto-encoders and CPPN primitives.
result Efficiency and effectiveness of the proposed method in discovering diverse patterns compared to baselines.
Labeling of sequential data is a prevalent meta-problem for a wide range of real world applications. While the first-order Hidden Markov Models (HMM) provides a fundamental approach for unsupervised sequential labeling, the basic model does not show satisfying performance when it is directly applied to real world probl…
EDU method finds diverse optimal solutions for expensive simulators.
problem Optimizing expensive black-box simulators for diverse solutions.
method EDU method searches for diverse locally-optimal solutions within a tolerance level.
result EDU yields a closed-form acquisition function facilitating efficient sequential queries.
Researchers use clustering to differentiate COVID-19 lung scans.
problem Identifying infected individuals with COVID-19.
method Applied unsupervised clustering techniques using PCA, K-Means++, and RCC.
result KM++ and RCC algorithms improved in clustering COVID-19 lung scans.
We study how to leverage off-the-shelf visual and linguistic data to cope with out-of-vocabulary answers in visual question answering task. Existing large-scale visual datasets with annotations such as image class labels, bounding boxes and region descriptions are good sources for learning rich and diverse visual conce…
Dual adversarial domain adaptation improves knowledge transfer between labeled and unlabeled domains.
problem Transfer knowledge from labeled to unlabeled domains using unsupervised methods.
method Adopt a discriminator with 2K-dimensional output for both domain-level and class-level alignments. Design a dual adversarial mechanism to pit two discriminators against each other.
result Our method outperforms state-of-the-art domain adaptation methods on real-world datasets.
ACE improves GFlowNet exploration efficiency by balancing complementary search strategies.
problem Efficient exploration of diverse high-probability regions in GFlowNets.
method Adaptive Complementary Exploration (ACE) trains a separate GFlowNet to search underexplored regions.
result Significantly improves approximation accuracy and diverse state discovery.
PaDGAN generates diverse, high-quality designs with improved performance.
problem Lack of diversity and performance improvement in generated designs.
method Integrates Determinantal Point Processes for diversity and quality, using GAN framework.
result PaDGAN generates higher quality designs with better diversity and without mode collapse.
Multivariate clustering in astrophysics is a recent development justified by the bigger and bigger surveys of the sky. The phylogenetic approach is probably the most unexpected technique that has appeared for the unsupervised classification of galaxies, stellar populations or globular clusters. On one side, this is a s…
DAC enhances exploration in reinforcement learning with entropy regularization.
problem Improving exploration efficiency in reinforcement learning.
method Sample-aware entropy regularization using replay buffer action distributions.
result DAC significantly outperforms existing algorithms in reinforcement learning tasks.