To differentiate the loss function in a Neural Network, there are four options Manual differentiation: It is labor intensive and often it is hard to calculate the closed form solution especially for complex function Symbolic differentiation: Like manual, it is also hard for complex function Numerical differentiation: Can handle complex function but may cause numerical […]

## My OMSCS journey

I started my MS in Computer Science at Georgia Tech in Spring 2019. Since then it has been a very challenging yet rewarding journey. Let me revisit the courses every semester. Database System Design Reinforcement Learning and Decision Making (Eventually dropped) Software Architecture and Design Graduate Introduction to Operating System Information Security Machine Learning for […]

## The Most Important Skill in the Future

Asking questions is the most important skill in the future. Finding the possible answers of the question is the next most important skill.

There are many flavors of games in Game Theory which are interesting from Machine Learning perspectives, especially from multi-agent Reinforcement Learning applications. Here is the summary of multiple game types are if MinMax algorithm works and what type of strategy one needs to employ.

Entropy is the fundamental unit of information in Information Theory and is extensively useful in Machine Learning. Let us introduce the concepts: Entropy, Joint Entropy, Mutual Information.

## Quick Sort

This class implements a QuickSort algorithm using Hoare Paritioning scheme. This partitionining scheme is slightly harder to implement but is more efficient than the Lamuto partitioning scheme. Avg Time-Complexity: O(nlogn) Worst Time-Complexity: O(n^2) Space complexity: O(1) Implementation in Java Unit Testing Now test a few cases and see if the implementation passes all of them […]

## Merge Sort (Draft)

## Binary Tree Traversal

A binary tree is one where each of its nodes has maximum two children nodes. These children are mostly known as Left and Right child. 1. In-order Traversal It goes from left child then current node then right childSo for the given tree above it will be: [2,17,7,19,3,100,25,36,1] 2. Pre-order Traversal It first deals with […]

First check out the problem description here on LeetCode. The Solution This is marked as a medium difficult problem. However if you know what in-order traversal does, it is a very simple problem. Here I just added a helper traverse() method. All the trick is done in the few lines inside the function. It checks […]

## Queue Data Structure

Discussion on the implementation of queue data structure