I build things, break things, and write what I learn.
Currently exploring:
- → LLMs
- → DevOps
- → Systems
DOCKER

Docker is an open-source platform that allows developers to build, package, and run applications in containers. Containers are lightweight, standalone, and executable units that include everything …
LLM Data Preprocessing

LLM Data Preprocessing Preprocessing text data is one of the most important steps in training Large Language Models (LLMs). The first step in this process is tokenization — the act of converting raw …
LLM Introduction

What is an LLM? LLM stands for Large Language Model. An LLM is a type of artificial intelligence model designed to understand, generate, and interact using human language. It learns patterns, …
Positional & Input Embeddings (Data Preprocessing)

📘3. Positional Embeddings 🧠 Why Do We Need Positional Embeddings? In embedding layer, the same tokens get mapped to the same vector representation. That means the model naturally has no idea about …
Token Embeddings (Data Preprocessing)

🧠2.Token Embeddings in LLMs They’re also often called vector embeddings or word embeddings. 🔤 From Tokens to Token Embeddings Before a model can “read” anything, it first breaks text into smaller …
GIT - Global Information Tracker

- What is Git? Git is a distributed version control system (DVCS) that helps track changes in code and coordinate work between multiple people. It works locally on your machine and allows you to: …
SSH - Secure Shell

SSH (Secure Shell) is a cryptographic network(encryption and decryption) protocol that allows secure communication between a client and a server over an unsecured network. It encrypts all data sent …
Who am I??

Hi Everyone !!! This time, I want to introduce myself as WHO AM I. I should have done this earlier, but since it's never too late, here is a little introduction of WHO I AM. My name is Angel Vyas, …
DS - BST

Binary Search Tree (BST) in Data Structures A Binary Search Tree (BST) is a special kind of binary tree where each node follows a specific ordering property: Left Subtree: Contains nodes with values …
DS - Graph Traversal Algorithms

In Data Structures (DS), BFS (Breadth-First Search) and DFS (Depth-First Search) are two fundamental graph traversal algorithms used to explore nodes in a graph or tree. Breadth-First Search (BFS) BFS …