Representation Learning
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 14
- 평가표
- 5
- 보존된 평가 기록
- 11
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:
- Representation Learning: A Review and New Perspectives - Bengio et al. (2012)
- A Few Words on Representation Learning - Thalles Silva
<span style="color:grey; opacity: 0.6">( Image credit: Visualizing and Understanding Convolutional Networks )</span>
기법
관련 논문에서 소개한 기법입니다. 이 태스크에서의 평가 여부는 평가 결과에서 확인하세요.
Magnification Prior Contrastive Similarity
Self-supervised pre-training method to learn efficient representations without labels on histopathology medical images utilizing magnification factors.
Metrix
A generic way of representing and interpolating labels, which allows straightforward extension of any kind of mixup to deep metric learning for a large class of loss functions.
NeuroTactic
NeuroTactic is a model for theorem proving which leverages graph neural networks to represent the theorem and premises, and applies graph contrastive learning for pre-training. Specifically, premise selection is designed as a pretext task for the graph contrastive learning approach. The learned representations are then used for the downstream task, tactic prediction
Graph Contrastive Pre-training for Effective Theorem Reasoning
Poincaré Embeddings
Poincaré Embeddings learn hierarchical representations of symbolic data by embedding them into hyperbolic space -- or more precisely into an $n$-dimensional Poincaré ball. Due to the underlying hyperbolic geometry, this allows for learning of parsimonious representations of symbolic data by simultaneously capturing hierarchy and similarity. Embeddings are learnt based on Riemannian optimization.
Poincaré Embeddings for Learning Hierarchical Representations
Pose Contrastive Learning
Please enter a description about the method here
Domain Knowledge-Informed Self-Supervised Representations for Workout Form Assessment
Pose Disentangling
A method to disentangle pose from other factors in a scene.
Domain Knowledge-Informed Self-Supervised Representations for Workout Form Assessment
RESCAL-RP
RESCAL model trained with a relation prediction objective on top of the 1vsAll loss
SMITH
SMITH, or Siamese Multi-depth Transformer-based Hierarchical Encoder, is a Transformer-based model for document representation learning and matching. It contains several design choices to adapt self-attention models for long text inputs. For the model pre-training, a masked sentence block language modeling task is used in addition to the original masked word language model task used in BERT, to capture sentence block relations within a document. Given a sequence of sentence block representation, the document level Transformers learn the contextual representation for each sentence block and the final document representation.
TABBIE
TABBIE is a pretraining objective (corrupt cell detection) that learns exclusively from tabular data. Unlike other approaches, TABBIE provides embeddings of all table substructures (cells, rows, and columns). TABBIE can be seen as a table embedding model trained to detect corrupted cells, inspired by the ELECTRA objective function.
TuckER-RP
TuckER model trained with a relation prediction objective on top of the 1vsAll loss
VC R-CNN
VC R-CNN is an unsupervised feature representation learning method, which uses Region-based Convolutional Neural Network (R-CNN) as the visual backbone, and the causal intervention as the training objective. Given a set of detected object regions in an image (e.g., using Faster R-CNN), like any other unsupervised feature learning methods (e.g., word2vec), the proxy training objective of VC R-CNN is to predict the contextual objects of a region. However, they are fundamentally different: the prediction of VC R-CNN is by using causal intervention: P(Y|do(X)), while others are by using the conventional likelihood: P(Y|X). This is also the core reason why VC R-CNN can learn "sense-making" knowledge like chair can be sat -- while not just "common" co-occurrences such as the chair is likely to exist if table is observed.
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.