SOTAVerified

Representation Learning

Representation Learning is a process in machine learning where algorithms extract meaningful patterns from raw data to create representations that are easier to understand and process. These representations can be designed for interpretability, reveal hidden features, or be used for transfer learning. They are valuable across many fundamental machine learning tasks like image classification and retrieval.

Deep neural networks can be considered representation learning models that typically encode information which is projected into a different subspace. These representations are then usually passed on to a linear classifier to, for instance, train a classifier.

Representation learning can be divided into:

  • Supervised representation learning: learning representations on task A using annotated data and used to solve task B
  • Unsupervised representation learning: learning representations on a task in an unsupervised way (label-free data). These are then used to address downstream tasks and reducing the need for annotated data when learning news tasks. Powerful models like GPT and BERT leverage unsupervised representation learning to tackle language tasks.

More recently, self-supervised learning (SSL) is one of the main drivers behind unsupervised representation learning in fields like computer vision and NLP.

Here are some additional readings to go deeper on the task:

( Image credit: Visualizing and Understanding Convolutional Networks )

Papers

Showing 23312340 of 10580 papers

TitleStatusHype
Applying Unsupervised Semantic Segmentation to High-Resolution UAV Imagery for Enhanced Road Scene ParsingCode0
Learning with Mixture of Prototypes for Out-of-Distribution DetectionCode1
Advancing Graph Representation Learning with Large Language Models: A Comprehensive Survey of Techniques0
A generalized decision tree ensemble based on the NeuralNetworks architecture: Distributed Gradient Boosting Forest (DGBF)0
BECLR: Batch Enhanced Contrastive Few-Shot LearningCode1
Towards an Information Theoretic Framework of Context-Based Offline Meta-Reinforcement LearningCode1
A Graph is Worth K Words: Euclideanizing Graph using Pure TransformerCode1
Stereographic Spherical Sliced Wasserstein DistancesCode0
Multi-modal Causal Structure Learning and Root Cause Analysis0
Bootstrapping Audio-Visual Segmentation by Strengthening Audio Cues0
Show:102550
← PrevPage 234 of 1058Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1SciNCLAvg.81.8Unverified
2SPECTERAvg.80Unverified
3CiteomaticAvg.76Unverified
4Sci-DeCLUTRAvg.66.6Unverified
5SciBERTAvg.59.6Unverified
6CiteBERTAvg.58.8Unverified
7BioBERTAvg.58.8Unverified
#ModelMetricClaimedVerifiedStatus
1top_model_weights_with_3d_21:1 Accuracy0.75Unverified
#ModelMetricClaimedVerifiedStatus
1Resnet 18Accuracy (%)97.05Unverified
#ModelMetricClaimedVerifiedStatus
1Morphological NetworkAccuracy97.3Unverified
#ModelMetricClaimedVerifiedStatus
1Max Margin ContrastiveSilhouette Score0.56Unverified