This article reviews statistical methods for learning data representations.
problem Learning meaningful representations of data.
method Statistical perspective on unsupervised and supervised representation learning.
result Recent advances in representation learning from a statistical viewpoint.
Method learns state representations without supervision for Atari games.
problem Learning state representations without supervision.
method Maximizes mutual information across features of neural encoder.
result New benchmark for evaluating representation learning models.
This paper learns actionable representations for reinforcement learning.
problem Learning comprehensive representations in reinforcement learning.
method Focuses on goal-conditioned policies to learn salient, actionable representations.
result Actionable representations improve exploration and hierarchical reinforcement learning.
ICP separates and competes feature representations to learn diverse information.
problem Learning representations with diversified information.
method Information Competing Process (ICP) separates representations into parts with different mutual information constraints, forcing them to learn independently in a competitive environment.
result ICP facilitates obtaining diversified representations with rich information.
The paper formalizes criteria for non-spurious and disentangled representations using causal methods.
problem Formalizing criteria for non-spurious and disentangled representations in representation learning.
method Causal perspective, counterfactual quantities, observable consequences of causal assertions.
result Computable metrics for assessing representation learning based on observed data.
This paper explores the complexity of learning representations in contextual linear bandits.
problem Understanding the complexity of representation learning in contextual linear bandits.
method Systematic approach to representation learning in contextual linear bandits, focusing on instance-dependent perspective.
result Representation learning is fundamentally more complex than linear bandits, with some cases being arbitrarily harder.
Representation learning improves EHR data for healthcare tasks.
problem Transforming EHR data into useful representations for machine learning.
method Deep learning and disentangling underlying factors from EHR data.
result Better representations improve machine learning performance in healthcare.
Sparse coding improves reinforcement learning representations.
problem Improving representation learning in reinforcement learning.
method Developed a supervised sparse coding objective for policy evaluation.
result Sparse coding representations outperform tile-coding representations.
Robots learn state representation from demonstrations.
problem Robots need a compact state representation for efficient interaction.
method Imitation learning using a multi-head neural network.
result Trained representation improves performance and efficiency in reinforcement learning.
Generative models can learn better representations than supervised methods, study shows.
problem The limits of representation learning with label-based supervision.
method Information-theoretic analysis and experiments with GANs.
result Generative models can learn better representations than supervised methods.
This paper improves few-shot learning by reducing sample complexity using representation learning.
problem Reducing sample complexity for target tasks with limited data.
method Representation learning to pool all source task samples for target task learning.
result Representation learning can achieve substantial sample size reduction, bypassing the $Ω( rac{1}{T})$ barrier.
Proposes a new method to learn representations directly optimized for a task.
problem Learning representations optimized for unrelated tasks.
method Jointly learns representation and prediction function for a specific task.
result Learned representations outperform pre-trained ones and are more sample-efficient.
New framework improves reliability of learned representations by modeling uncertainty and structural constraints.
problem Uncertainty in learned representations treated as deterministic, leading to unreliable models.
method Proposes a principled framework for reliable representation learning with uncertainty-aware regularization and structural constraints.
result Improves stability, calibration, and robustness of learned representations.
Proposes a new method for medical diagnosis using network-based representation learning.
problem Improving medical diagnosis accuracy through better data representation.
method Heterogeneous network-based model and modified metapath2vec algorithm for learning latent node representations.
result Significant performance boost in symptom/disease classification and disease prediction tasks.
SRL learns low-dimensional state features for better control.
problem Learning abstract features for better control in robotics.
method Various SRL methods involving interaction with the environment.
result SRL helps overcome the curse of dimensionality and improves performance.
New model learns coupled representations for domains, intents, and slots.
problem Representation learning for domains, intents, and slots in spoken language understanding.
method Proposes a model that learns coupled representations by aggregating slot and intent representations based on their hierarchical relationships.
result Improved performance on contextual cross-domain reranking task.
New method uses bi-level optimization to learn useful representations for imitation learning.
problem Learning useful representations for multiple tasks in imitation learning settings.
method Formulates representation learning as a bi-level optimization problem.
result Bi-level optimization framework provides sample complexity benefits for imitation learning.
The paper shows how to learn causal representations with few environments and finite samples.
problem Learning causal representations from limited data and environments.
method Explicit, finite-sample guarantees with a logarithmic number of interventions.
result Consistent recovery of latent causal graph, mixing matrix, and unknown intervention targets.
This work learns latent representations to speed up exploration in complex environments.
problem Challenging exploration in high-dimensional state and action spaces with sparse rewards.
method Representation learning using prior experience to learn effective latent representations.
result Learned latent representations reduce the dimensionality of the search space for effective exploration.
Sparse representations improve reinforcement learning control policies.
problem Sparse representations are underused in reinforcement learning control.
method Incremental learning with sparse representations from neural networks, using distributional regularizers.
result Sparse representations avoid catastrophic interference and provide stable values for reinforcement learning.
This paper investigates learning sparse representations and action-value functions simultaneously in deep reinforcement learning.
problem Mitigating catastrophic interference and improving cumulative reward in deep reinforcement learning agents.
method Employing regularization techniques to learn sparse representations and action-value functions incrementally.
result Learning sparse representations can improve performance and robustness in deep reinforcement learning agents.
Advances fair representation learning for unknown third-party uses.
problem Mitigating unfair prediction outcomes when representations are used by third parties with unknown objectives.
method Adversarial representation learning to ensure fairness.
result Demonstrated fair transfer learning and maintained utility.
This paper reviews data representation learning from traditional methods to deep learning.
problem Learning the intrinsic structure of data.
method Investigates traditional and deep learning methods.
result Deep learning models have achieved top results in various tasks.
Paper addresses the disparity between sampled and mean representations in disentangled learning.
problem Disparity between sampled and mean representations in disentangled learning.
method Proposes a method to eliminate the disparity by proving and utilizing the relationship between total correlation of sampled and mean representations for multivariate normal distributions.
result Demonstrates that a factorized mean representation can have lower total correlation than the sampled representation.
New model-free algorithms learn representations for low-rank MDPs efficiently.
problem Learning representations in reinforcement learning for low-rank MDPs.
method Developed minimax representation learning objective and interleaved with reward-free exploration.
result Proven sample efficiency and scalability to complex environments.
This work improves understanding of reinforcement learning state representations.
problem Lack of precise characterization of how and when state representations generalize.
method Developed a bound on the generalization error based on effective dimension.
result Bound quantifies the tension between generalization and approximation.
GGAN improves audio representation learning with fewer labels.
problem Learning representations for specific tasks from unlabelled data.
method Guided Generative Adversarial Neural Network (GGAN).
result GGAN learns better representations with fewer labelled data.
Robust optimization improves deep learning feature representations.
problem Deep learning feature representations lack versatility and high-level encoding.
method Robust optimization as a prior for feature learning.
result Robust models learn approximately invertible, salient feature representations.
Subspace match fails to accurately assess neural network representations.
problem Understanding the learned representations of neural networks.
method Subspace match method to assess representation similarity.
result Representations with low subspace match can still be isomorphic.
New method learns stochastic process representations without exact reconstruction.
problem Learning exact representations of high-dimensional noisy stochastic processes.
method CReSP framework for contrastive learning of stochastic processes.
result Effective for learning representations of various stochastic processes.
Self-supervised and supervised methods learn similar intermediate visual representations but diverge in final layers.
problem Comparing self-supervised and supervised methods for visual learning.
method Comparison of contrastive self-supervised and supervised methods on simple image data.
result Contrastive and supervised methods learn similar intermediate representations but diverge in final layers.
Study presents a dataset and evaluation framework for representation learning in complex multimodal systems.
problem Lack of large-scale standard datasets for representation learning in complex multimodal systems.
method Implemented and compared several approaches to representation learning on a large-scale dataset for landing an airplane.
result Representations can be used for various applications including anomaly detection and optimal control.
DIM learns deep representations by maximizing mutual information, outperforming unsupervised methods.
problem Learning useful representations from unlabeled data.
method Maximizing mutual information between input and output of a deep neural network encoder, incorporating prior knowledge.
result DIM outperforms other unsupervised learning methods and competes with fully-supervised learning on classification tasks.
Paper proposes InfoAE for disentangled representation learning.
problem Learning disentangled representations from unlabeled data.
method InfoAE learns disentangled representation by maximizing mutual information.
result Achieved 98.9% test accuracy on MNIST with unsupervised training.
Proposes a deep learning method for effective data representation.
problem Constructing effective data representations for prediction.
method A deep dimension reduction approach to learning representations with sufficiency, low dimensionality, and disentanglement.
result The proposed deep nonparametric representation is consistent and performs better than existing methods.
Measures compositionality in machine learning representations.
problem Evaluating how compositional structure is reflected in learned representations.
method Measures compositionality by approximating true representation-producing models with composed primitives.
result Characterizes compositional structure in various settings.
New method learns action representations for better reinforcement learning.
problem Lack of structured action representations in reinforcement learning.
method Decomposes policy into action representation and action transformation components.
result Action representations improve generalization in large action spaces.
Survey categorizes methods for learning state representations in reinforcement learning.
problem Addressing challenges in complex observation spaces for sequential decision making.
method Categorizes six main classes of methods for learning state representations.
result Enhances understanding of state representation learning in reinforcement learning.
Toolbox provides datasets and metrics for state representation learning.
problem Lack of standard evaluation datasets, metrics and tasks for state representation learning.
method Provides a set of environments, data generators, robotic control tasks, metrics and tools.
result Facilitates iterative state representation learning and evaluation in reinforcement learning settings.
Framework learns portable representations for diverse tasks.
problem Creating task-independent abstract representations for diverse environments.
method Autonomously learns portable representations in egocentric space.
result Portable representations enable task-independent planning and transfer.
RELAX provides first attribution-based explanations for representations.
problem Lack of methods to explain what influences learned representations.
method RELAX, a first approach for attribution-based explanations of representations, measuring similarities in representation space.
result Significantly outperforms gradient-based baseline and models uncertainty in explanations.
This paper proposes a multi-view representation learning approach for robust node representations.
problem Learning robust node representations across multiple types of network views.
method Promotes collaboration between different views using an attention mechanism.
result The proposed approach outperforms existing methods for network representation learning.
Model learns set representations through optimized permutations.
problem Challenges in learning set representations due to permutation-invariance.
method Proposes a Permutation-Optimisation module to learn set permutations.
result Achieves state-of-the-art results on various set learning tasks.
Contrastive learning adapts to data intrinsic dimensions, learning low-dimensional representations.
problem Learning high-dimensional representations from multi-modal data.
method Multi-modal contrastive learning with temperature optimization.
result Contrastive learning adapts to intrinsic dimensions of data, not specified dimensions.
Optimal transport metric transfers deep network representations efficiently.
problem Efficiently transfer deep network representations for new tasks.
method Use optimal transport to quantify representation similarity and regularize student network.
result Optimal transport distance promotes similarity between teacher and student representations.
VTAB benchmarks diverse visual tasks to assess representation learning effectiveness.
problem Lack of a unified evaluation for general visual representations.
method Developed VTAB, a benchmark for diverse visual tasks, and evaluated many representation learning algorithms.
result VTAB revealed insights into the effectiveness of various representation learning methods.
Unified data representation learning improves non-parametric two-sample testing.
problem Improving non-parametric two-sample testing accuracy.
method Proposes RL-TST framework combining IRs and DRs for better test power.
result RL-TST outperforms existing methods by leveraging both IRs and DRs.
CaGAT learns context-aware edge representations for graph data.
problem Ignoring edge representation in GNNs.
method Unified Context-aware Adaptive Graph Attention Network (CaGAT) that learns both node and edge representations.
result CaGAT improves performance on semi-supervised learning tasks.