LogoLogo
Continuum WebsiteContinuum ApplicationsContinuum KnowledgeAxolotl Platform
Continuum Knowledge
Continuum Knowledge
  • Continuum
  • Data
    • Datasets
      • Pre Training Data
      • Types of Fine Tuning
      • Self Instruct Paper
      • Self-Alignment with Instruction Backtranslation
      • Systematic Evaluation of Instruction-Tuned Large Language Models on Open Datasets
      • Instruction Tuning
      • Instruction Fine Tuning - Alpagasus
      • Less is More For Alignment
      • Enhanced Supervised Fine Tuning
      • Visualising Data using t-SNE
      • UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction
      • Training and Evaluation Datasets
      • What is perplexity?
  • MODELS
    • Foundation Models
      • The leaderboard
      • Foundation Models
      • LLama 2 - Analysis
      • Analysis of Llama 3
      • Llama 3.1 series
      • Google Gemini 1.5
      • Platypus: Quick, Cheap, and Powerful Refinement of LLMs
      • Mixtral of Experts
      • Mixture-of-Agents (MoA)
      • Phi 1.5
        • Refining the Art of AI Training: A Deep Dive into Phi 1.5's Innovative Approach
      • Phi 2.0
      • Phi-3 Technical Report
  • Training
    • The Fine Tuning Process
      • Why fine tune?
        • Does Fine-Tuning LLMs on New Knowledge Encourage Hallucinations?
        • Explanations in Fine Tuning
      • Tokenization
        • Tokenization Is More Than Compression
        • Tokenization - SentencePiece
        • Tokenization explore
        • Tokenizer Choice For LLM Training: Negligible or Crucial?
        • Getting the most out of your tokenizer for pre-training and domain adaptation
        • TokenMonster
      • Parameter Efficient Fine Tuning
        • P-Tuning
          • The Power of Scale for Parameter-Efficient Prompt Tuning
        • Prefix-Tuning: Optimizing Continuous Prompts for Generation
        • Harnessing the Power of PEFT: A Smarter Approach to Fine-tuning Pre-trained Models
        • What is Low-Rank Adaptation (LoRA) - explained by the inventor
        • Low Rank Adaptation (Lora)
        • Practical Tips for Fine-tuning LMs Using LoRA (Low-Rank Adaptation)
        • QLORA: Efficient Finetuning of Quantized LLMs
        • Bits and Bytes
        • The Magic behind Qlora
        • Practical Guide to LoRA: Tips and Tricks for Effective Model Adaptation
        • The quantization constant
        • QLORA: Efficient Finetuning of Quantized Language Models
        • QLORA and Fine-Tuning of Quantized Language Models (LMs)
        • ReLoRA: High-Rank Training Through Low-Rank Updates
        • SLoRA: Federated Parameter Efficient Fine-Tuning of Language Models
        • GaLora: Memory-Efficient LLM Training by Gradient Low-Rank Projection
      • Hyperparameters
        • Batch Size
        • Padding Tokens
        • Mixed precision training
        • FP8 Formats for Deep Learning
        • Floating Point Numbers
        • Batch Size and Model loss
        • Batch Normalisation
        • Rethinking Learning Rate Tuning in the Era of Language Models
        • Sample Packing
        • Gradient accumulation
        • A process for choosing the learning rate
        • Learning Rate Scheduler
        • Checkpoints
        • A Survey on Efficient Training of Transformers
        • Sequence Length Warmup
        • Understanding Training vs. Evaluation Data Splits
        • Cross-entropy loss
        • Weight Decay
        • Optimiser
        • Caching
      • Training Processes
        • Extending the context window
        • PyTorch Fully Sharded Data Parallel (FSDP)
        • Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolation
        • YaRN: Efficient Context Window Extension of Large Language Models
        • Sliding Window Attention
        • LongRoPE
        • Reinforcement Learning
        • An introduction to reinforcement learning
        • Reinforcement Learning from Human Feedback (RLHF)
        • Direct Preference Optimization: Your Language Model is Secretly a Reward Model
  • INFERENCE
    • Why is inference important?
      • Grouped Query Attention
      • Key Value Cache
      • Flash Attention
      • Flash Attention 2
      • StreamingLLM
      • Paged Attention and vLLM
      • TensorRT-LLM
      • Torchscript
      • NVIDIA L40S GPU
      • Triton Inference Server - Introduction
      • Triton Inference Server
      • FiDO: Fusion-in-Decoder optimised for stronger performance and faster inference
      • Is PUE a useful measure of data centre performance?
      • SLORA
  • KNOWLEDGE
    • Vector Databases
      • A Comprehensive Survey on Vector Databases
      • Vector database management systems: Fundamental concepts, use-cases, and current challenges
      • Using the Output Embedding to Improve Language Models
      • Decoding Sentence-BERT
      • ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERT
      • SimCSE: Simple Contrastive Learning of Sentence Embeddings
      • Questions Are All You Need to Train a Dense Passage Retriever
      • Improving Text Embeddings with Large Language Models
      • Massive Text Embedding Benchmark
      • RocketQAv2: A Joint Training Method for Dense Passage Retrieval and Passage Re-ranking
      • LLM2Vec: Large Language Models Are Secretly Powerful Text Encoders
      • Embedding and Fine-Tuning in Neural Language Models
      • Embedding Model Construction
      • Demystifying Embedding Spaces using Large Language Models
      • Fine-Tuning Llama for Multi-Stage Text Retrieval
      • Large Language Model Based Text Augmentation Enhanced Personality Detection Model
      • One Embedder, Any Task: Instruction-Finetuned Text Embeddings
      • Vector Databases are not the only solution
      • Knowledge Graphs
        • Harnessing Knowledge Graphs to Elevate AI: A Technical Exploration
        • Unifying Large Language Models and Knowledge Graphs: A Roadmap
      • Approximate Nearest Neighbor (ANN)
      • High Dimensional Data
      • Principal Component Analysis (PCA)
      • Vector Similarity Search - HNSW
      • FAISS (Facebook AI Similarity Search)
      • Unsupervised Dense Retrievers
    • Retrieval Augmented Generation
      • Retrieval-Augmented Generation for Large Language Models: A Survey
      • Fine-Tuning or Retrieval?
      • Revolutionising Information Retrieval: The Power of RAG in Language Models
      • A Survey on Retrieval-Augmented Text Generation
      • REALM: Retrieval-Augmented Language Model Pre-Training
      • Retrieve Anything To Augment Large Language Models
      • Generate Rather Than Retrieve: Large Language Models Are Strong Context Generators
      • Active Retrieval Augmented Generation
      • DSPy: LM Assertions: Enhancing Language Model Pipelines with Computational Constraints
      • DSPy: Compiling Declarative Language Model Calls
      • DSPy: In-Context Learning for Extreme Multi-Label Classification
      • Optimizing Instructions and Demonstrations for Multi-Stage Language Model Programs
      • HYDE: Revolutionising Search with Hypothetical Document Embeddings
      • Enhancing Recommender Systems with Large Language Model Reasoning Graphs
      • Retrieval Augmented Generation (RAG) versus fine tuning
      • RAFT: Adapting Language Model to Domain Specific RAG
      • Summarisation Methods and RAG
      • Lessons Learned on LLM RAG Solutions
      • Stanford: Retrieval Augmented Language Models
      • Overview of RAG Approaches with Vector Databases
      • Mastering Chunking in Retrieval-Augmented Generation (RAG) Systems
    • Semantic Routing
    • Resource Description Framework (RDF)
  • AGENTS
    • What is agency?
      • Rephrase and Respond: Let Large Language Models Ask Better Questions for Themselves
      • Types of Agents
      • The risk of AI agency
      • Understanding Personality in Large Language Models: A New Frontier in AI Psychology
      • AI Agents - Reasoning, Planning, and Tool Calling
      • Personality and Brand
      • Agent Interaction via APIs
      • Bridging Minds and Machines: The Legacy of Newell, Shaw, and Simon
      • A Survey on Language Model based Autonomous Agents
      • Large Language Models as Agents
      • AI Reasoning: A Deep Dive into Chain-of-Thought Prompting
      • Enhancing AI Reasoning with Self-Taught Reasoner (STaR)
      • Exploring the Frontier of AI: The "Tree of Thoughts" Framework
      • Toolformer: Revolutionising Language Models with API Integration - An Analysis
      • TaskMatrix.AI: Bridging Foundational AI Models with Specialised Systems for Enhanced Task Completion
      • Unleashing the Power of LLMs in API Integration: The Rise of Gorilla
      • Andrew Ng's presentation on AI agents
      • Making AI accessible with Andrej Karpathy and Stephanie Zhan
  • Regulation and Ethics
    • Regulation and Ethics
      • Privacy
      • Detecting AI Generated content
      • Navigating the IP Maze in AI: The Convergence of Blockchain, Web 3.0, and LLMs
      • Adverse Reactions to generative AI
      • Navigating the Ethical Minefield: The Challenge of Security in Large Language Models
      • Navigating the Uncharted Waters: The Risks of Autonomous AI in Military Decision-Making
  • DISRUPTION
    • Data Architecture
      • What is a data pipeline?
      • What is Reverse ETL?
      • Unstructured Data and Generatve AI
      • Resource Description Framework (RDF)
      • Integrating generative AI with the Semantic Web
    • Search
      • BM25 - Search Engine Ranking Function
      • BERT as a reranking engine
      • BERT and Google
      • Generative Engine Optimisation (GEO)
      • Billion-scale similarity search with GPUs
      • FOLLOWIR: Evaluating and Teaching Information Retrieval Models to Follow Instructions
      • Neural Collaborative Filtering
      • Federated Neural Collaborative Filtering
      • Latent Space versus Embedding Space
      • Improving Text Embeddings with Large Language Models
    • Recommendation Engines
      • On Interpretation and Measurement of Soft Attributes for Recommendation
      • A Survey on Large Language Models for Recommendation
      • Model driven recommendation systems
      • Recommender AI Agent: Integrating Large Language Models for Interactive Recommendations
      • Foundation Models for Recommender Systems
      • Exploring the Impact of Large Language Models on Recommender Systems: An Extensive Review
      • AI driven recommendations - harming autonomy?
    • Logging
      • A Taxonomy of Anomalies in Log Data
      • Deeplog
      • LogBERT: Log Anomaly Detection via BERT
      • Experience Report: Deep Learning-based System Log Analysis for Anomaly Detection
      • Log-based Anomaly Detection with Deep Learning: How Far Are We?
      • Deep Learning for Anomaly Detection in Log Data: A Survey
      • LogGPT
      • Adaptive Semantic Gate Networks (ASGNet) for log-based anomaly diagnosis
  • Infrastructure
    • The modern data centre
      • Enhancing Data Centre Efficiency: Strategies to Improve PUE
      • TCO of NVIDIA GPUs and falling barriers to entry
      • Maximising GPU Utilisation with Kubernetes and NVIDIA GPU Operator
      • Data Centres
      • Liquid Cooling
    • Servers and Chips
      • The NVIDIA H100 GPU
      • NVIDIA H100 NVL
      • Lambda Hyperplane 8-H100
      • NVIDIA DGX Servers
      • NVIDIA DGX-2
      • NVIDIA DGX H-100 System
      • NVLink Switch
      • Tensor Cores
      • NVIDIA Grace Hopper Superchip
      • NVIDIA Grace CPU Superchip
      • NVIDIA GB200 NVL72
      • Hopper versus Blackwell
      • HGX: High-Performance GPU Platforms
      • ARM Chips
      • ARM versus x86
      • RISC versus CISC
      • Introduction to RISC-V
    • Networking and Connectivity
      • Infiniband versus Ethernet
      • NVIDIA Quantum InfiniBand
      • PCIe (Peripheral Component Interconnect Express)
      • NVIDIA ConnectX InfiniBand adapters
      • NVMe (Non-Volatile Memory Express)
      • NVMe over Fabrics (NVMe-oF)
      • NVIDIA Spectrum-X
      • NVIDIA GPUDirect
      • Evaluating Modern GPU Interconnect
      • Scalable Hierarchical Aggregation and Reduction Protocol (SHARP)
      • Next-generation networking in AI environments
      • NVIDIA Collective Communications Library (NCCL)
    • Data and Memory
      • NVIDIA BlueField Data Processing Units (DPUs)
      • Remote Direct Memory Access (RDMA)
      • High Bandwidth Memory (HBM3)
      • Flash Memory
      • Model Requirements
      • Calculating GPU memory for serving LLMs
      • Transformer training costs
      • GPU Performance Optimisation
    • Libraries and Complements
      • NVIDIA Base Command
      • NVIDIA AI Enterprise
      • CUDA - NVIDIA GTC 2024 presentation
      • RAPIDs
      • RAFT
    • Vast Data Platform
      • Vast Datastore
      • Vast Database
      • Vast Data Engine
      • DASE (Disaggregated and Shared Everything)
      • Dremio and VAST Data
    • Storage
      • WEKA: A High-Performance Storage Solution for AI Workloads
      • Introduction to NVIDIA GPUDirect Storage (GDS)
        • GDS cuFile API
      • NVIDIA Magnum IO GPUDirect Storage (GDS)
      • Vectors in Memory
Powered by GitBook
LogoLogo

Continuum - Accelerated Artificial Intelligence

  • Continuum Website
  • Axolotl Platform

Copyright Continuum Labs - 2023

On this page
  • Now, let's dive deeper into PCA and how it works
  • Another explanation
  • And another explanation
  • Unsupervised Learning Method
  • A numerical example

Was this helpful?

  1. KNOWLEDGE
  2. Vector Databases

Principal Component Analysis (PCA)

PreviousHigh Dimensional DataNextVector Similarity Search - HNSW

Last updated 1 year ago

Was this helpful?

In this video, the speaker discusses the concept of Principal Component Analysis (PCA) as a powerful technique for analysing and understanding high dimensional datasets.

The first example of a large complex dataset that Principal Component Analysis (PCA) was applied to came from a research article titled "Genes mirror geography within Europe".

In this study, the researchers collected genotypes of 3,192 individuals of European ancestry, measuring approximately 500,000 SNP (Single Nucleotide Polymorphism) loci for each individual. This results in a large data matrix with dimensions 3,192 (n) by 500,000 (m).

To analyse this high-dimensional dataset, the researchers employed PCA, a dimensionality reduction technique.

PCA projects the high-dimensional data onto a lower-dimensional space while preserving the most important information. In this case, the researchers projected the data onto a 2-dimensional space defined by the first two principal components (PC1 and PC2).

The resulting visualisation reveals that the relative location of individuals in the reduced gene space closely mirrors their geographic origins within Europe. This finding suggests that genetic variation among Europeans is strongly influenced by their geographic location and ancestral background.

Now, let's dive deeper into PCA and how it works

Principal Component Analysis (PCA) is a statistical technique that aims to reduce the dimensionality of a dataset while retaining most of its variation.

It does so by identifying a new set of variables, called principal components (PCs), which are linear combinations of the original variables.

These PCs are orthogonal (uncorrelated) to each other and are ordered by the amount of variance they explain in the data.

The first principal component (PC1) is the direction in the high-dimensional space along which the data varies the most.

The second principal component (PC2) is orthogonal to PC1 and captures the second most significant direction of variation, and so on.

By projecting the data onto these PCs, we can effectively reduce the dimensionality of the dataset while preserving its most important features.

To implement PCA, the following steps are typically followed:

  1. Standardise the data: Ensure that all variables have zero mean and unit variance to avoid any single variable dominating the analysis due to its scale.

  2. Compute the covariance matrix: Calculate the covariance matrix of the standardised data, which captures the pairwise relationships between variables.

  3. Find the eigenvectors and eigenvalues: Compute the eigenvectors and eigenvalues of the covariance matrix. The eigenvectors represent the directions of the principal components, while the corresponding eigenvalues indicate the amount of variance explained by each PC.

  4. Sort the eigenvectors: Order the eigenvectors by their associated eigenvalues in descending order. The eigenvector with the highest eigenvalue becomes PC1, the second highest becomes PC2, and so on.

  5. Project the data: Transform the original data by projecting it onto the selected PCs. This step reduces the dimensionality of the data while preserving the most significant information.

By applying PCA to high-dimensional datasets, researchers can identify the most important features, visualise the data in a lower-dimensional space, and gain insights into the underlying patterns and structures.

PCA has wide-ranging applications in various fields, including biology, genetics, neuroscience, and many others, where high-dimensional data is becoming increasingly common.

Another explanation

Principal Component Analysis (PCA) is a method for compressing high-dimensional data into a lower-dimensional representation while preserving the essence of the original data.

The key steps in performing PCA are as follows

  1. Start with a high-dimensional dataset, such as single-cell RNA sequencing data, where each cell is represented by a vector of gene expression levels.

  2. Calculate the principal components (PCs) of the data. Each PC is a linear combination of the original variables (genes) that captures a certain amount of variation in the data.

  3. The first PC (PC1) captures the most variation, the second PC (PC2) captures the second most variation, and so on.

  4. Each gene is assigned a weight or "loading" for each PC, which represents the gene's influence on that PC. Genes with high loadings on a particular PC are the most important in driving the variation captured by that PC.

  5. To plot cells in the reduced-dimensional space, a score is calculated for each cell along each PC. This is done by multiplying the cell's expression level for each gene by the gene's loading for that PC and summing these products across all genes.

  6. The scores for the first two (or three) PCs are used as the coordinates for plotting each cell in a 2D (or 3D) scatter plot. Cells with similar expression profiles will cluster together in this reduced-dimensional space.

Some key points about PCA

  • The PCs are orthogonal (perpendicular) to each other, meaning they capture independent sources of variation in the data.

  • The number of PCs is equal to the number of original variables (genes), but in practice, most of the variation in the data is often captured by the first few PCs.

  • PCA is an unsupervised method, meaning it does not use any information about cell types or other labels in finding the principal components.

  • The loadings can be used to identify genes that are important in distinguishing different cell types or states along each PC.

To assess the quality of a PCA, one can use diagnostic plots such as a scree plot, which shows the amount of variation captured by each PC. A good PCA will have most of the variation captured by the first few PCs, with subsequent PCs capturing diminishing amounts of variation.

What is a Scree Plot?

A scree plot is a diagnostic tool used in Principal Component Analysis (PCA) to visualise the importance of each principal component.

It plots the amount of variation each PC captures from the data.

Typically, the PCs are ordered on the x-axis in descending order of their variance contribution, with the corresponding amount of variation explained on the y-axis.

This plot is crucial for determining the number of PCs that should be retained for further analysis. A common approach is to look for the "elbow" in the scree plot, a point after which the marginal gain in explained variance significantly drops, indicating that subsequent PCs contribute less to the explanation of data variation.

By effectively using a scree plot, researchers can ensure they are capturing the most meaningful components of their data, while also simplifying its complexity.

And another explanation

Principal Component Analysis (PCA) is a method for combining variables in a way that simplifies the analysis and maximises the amount of information retained in the combined variables.

The main goal of PCA is to reduce the dimensionality of a dataset while preserving as much of the original variation as possible.

The basic idea behind PCA is to find the optimal linear combination of variables that accounts for the maximum amount of variability in the data. This linear combination is represented by the following equation:

Combined Variable = α₁ × Variable₁ + α₂ × Variable₂ + ... + αₙ × Variableₙ

The coefficients α₁, α₂, ..., αₙ are called weights or loadings, and they determine the importance of each variable in the combined variable. PCA aims to find the optimal values for these weights that maximise the variance of the combined variable.

PCA finds the optimal weights by computing the covariance matrix of the data and then finding its eigenvectors.

The eigenvector with the largest eigenvalue contains the optimal weights for the linear combination that maximises the variance of the combined variable.

What is an eigenvector?

In the context of Principal Component Analysis (PCA), an eigenvector points in the direction of maximum variance in the data, and its corresponding eigenvalue quantifies the magnitude of this variance.

Each principal component is an eigenvector of the covariance matrix of the standardised data.

The corresponding eigenvalue represents the amount of variance in the data explained by that principal component.

The eigenvectors are orthogonal to each other, meaning they are uncorrelated and capture different directions of variability in the data.

When performing PCA, the eigenvectors are sorted in descending order based on their eigenvalues.

The eigenvector with the largest eigenvalue becomes the first principal component (PC1), the eigenvector with the second largest eigenvalue becomes the second principal component (PC2), and so on.

By selecting the top k eigenvectors, we can reduce the dimensionality of the data while retaining the most important information.

Several applications of PCA in biology

Reducing the number of variables: PCA can be used to combine correlated variables into fewer, more informative variables. For example, combining diastolic and systolic blood pressure into a single "blood pressure" variable and combining weight and height into a "body size" variable.

Identifying individuals with similar health profiles: By reducing many clinical variables to just two principal components (PC1 and PC2), it becomes easier to identify individuals with similar health profiles based on their proximity in a 2D plot of the principal component scores.

Analysing gene expression data: In datasets with thousands of genes measured across multiple individuals or single cells, PCA can be used to identify individuals or cells with similar gene expression profiles. By plotting the principal component scores in a 2D plot, distinct clusters can be identified, representing different cell types or cells undergoing specific biological processes.

In summary, PCA is a powerful tool for dimensionality reduction and data visualisation that helps in identifying patterns and relationships in high-dimensional datasets. By finding the optimal linear combination of variables that maximizes the variance of the combined variable, PCA allows for a more intuitive understanding of complex biological data.

Unsupervised Learning Method

Principal Component Analysis (PCA) is an unsupervised learning method, which means it does not require any prior knowledge of class labels or groupings in the data.

PCA aims to find the underlying structure and patterns in the data without being guided by a specific target variable or outcome.

This distinguishes PCA from supervised learning techniques, such as classification and regression, which rely on labeled data to learn a mapping between input features and output variables.

The unsupervised nature of PCA makes it particularly useful for exploratory data analysis, data visualisation, and feature extraction.

By identifying the principal components that capture the most variability in the data, PCA can help uncover hidden structures and relationships between variables, even when no explicit labels or categories are available.

A numerical example

Let's consider a simplified example using just three attributes from the heart disease dataset:

  1. age

  2. trestbps (resting blood pressure)

  3. chol (serum cholesterol)

Suppose we have the following data for five patients:

Patient
Age
Trestbps
Chol

1

50

120

200

2

60

140

220

3

55

130

180

4

65

150

240

5

45

110

190

Step 1: Standardise the data by subtracting the mean and dividing by the standard deviation for each attribute.

Step 2: Compute the covariance matrix of the standardised data.

Step 3: Find the eigenvectors and eigenvalues of the covariance matrix.

Suppose the eigenvectors and eigenvalues are:

Eigenvector 1: [0.58, 0.58, 0.58], Eigenvalue 1: 2.5
Eigenvector 2: [0.71, -0.71, 0], Eigenvalue 2: 0.8
Eigenvector 3: [-0.41, -0.41, 0.82], Eigenvalue 3: 0.2

Step 4: Sort the eigenvectors by their eigenvalues in descending order. In this case, the order is already correct.

Step 5: Project the standardised data onto the top k eigenvectors (principal components) to reduce dimensionality. Let's choose k=2.

The projected data points in the reduced 2D space (PC1, PC2) could be:

Patient
PC1
PC2

1

-1.2

-0.5

2

1.1

0.8

3

-0.3

-0.2

4

1.5

1.1

5

-1.1

-1.2

In this reduced space, patients with similar risk profiles will cluster together, making it easier to identify groups of patients with high or low risk of heart disease.

This simplified example demonstrates how PCA can be used to reduce the dimensionality of the heart disease dataset while preserving the most important information for analysis and visualization.

Page cover image