Aditya Chatterjee's Blog, page 65

Backpropagation vs Gradient Descent

Hello everybody, I'll illustrate in this article two important concepts in our journey of neural networks and deep learning. Welcome to Backpropagation and Gradient Descent tutorial and the differences between the two.

Table of content:

Difference between Backpropagation and Gradient DescentRecap how NN worksBackpropagation algorithmGradient Descent algorithmTypes of Gradient Descent1. Difference between Backpropagation and Gradient Descent

Following table summarizes the differences betwe...

Oppermann's conjecture

In this article, we have explored Oppermann's conjecture and implemented a program in an attempt to prove or disprove it. This is an important conjecture for prime numbers.

Table of contentsDefinitionsAlgorithmTime complexityA way of implementation1. Definitions

A conjecture is synonymous with hypothesis and consists in having no proof yet to be verified as true of false. It starts from a real fact and it has a rule for it.

A prime number is a number that is only divisible to 1 and itself...

Open Addressing - a collision handling method in Hash Tables

In this article, we have explored Open Addressing which is a collision handling method in Hash Tables. We have explored the 3 different types of Open Addressing as well. It is also known as Closed Hashing.

Table of ContentsIntroduction to HashingHandling CollisionOpen AddressingLinear ProbingQuadratic ProbingDouble HashingComparison of Three Collision Handling TechniquesAdvantages of Open AddressingIntroduction to Hashing

Hashing:
A method used for storing, finding, and sorting data i...

Non-Tail Recursion

In this article, we will be in depth discussing about Non-Tail Recursion. The basic algorithm, its time complexity, space complexity, advantages and disadvantages of using a non-tail recursive function in a code.

Table of contents:IntroductionTypes of recursionNon-Tail RecursionTime and Space ComplexityComparison between Non-Tail Recursion and LoopTail Recursion vs. Non-Tail RecursionWhich one should I use?ConclusionIntroduction

In a program, recursion is realized by using a mechanism...

EfficientNet [model architecture]

Many applications of ConvNets require higher accuracy, and higher accuracy requires more parameters to learn and bigger networks, while the current SOTA (State of the art) Convnet have hit the memory limit it is time to look for more efficient ways to improve the accuracy. For that, we introduce in this article the EfficientNet model that suggests an efficient way for improving the performance of Convnets.

Table of contentScaling a ConvnetCompound ScalingEfficientNet architectureEfficientNe...

Recursion in Java

This article will dive into the basic introduction to recursion, and how it is implemented in Java.

Table of contents

What is Recursion?Rules to RecursionRecursion in ContentPros and Cons of RecursionConclusionWhat is Recursion?

Recursion is the use of the word inside the definition, or in other words, the function calls itself.

While this may seem confusing at a glance, recursion is actually a very convenient way to organize and simplify your code to make it easier for you and others to ...

K-th Largest Element in Array

In this article, We will discuss 4 different approaches to find the kth largest element in the given array.

Table of Content:Problem StatementApproach 1Approach 2Approach 3Approach 4Problem Statement:

We are given an Array arr and an integer k. We are required to find the kth largest element in the Array.

Examplearr = {5, 4, 1, 8, 3, 6, 9}
k = 5
Output: 4

Explanation : We can see that 9 is the largest element and 8 is the second largest and 6 is the third largest element in the Array....

Shannon Fano coding

In this article we are going to talk about the classic data compression algorithm called "Shannon-Fano code."

Table of contents:

What is a Shannon-Fano code?How Shannon-Fano encoding works? (includes Algorithm and Example)Implementing the Solution (Python code)Implementing the Solution (C++ code)How the Code works?Purpose of Shannon Fano codingAdvantages and Disadvantages of Shannon Fano codingWhat is a Shannon-Fano code?

A Shannon-Fano code is simply a method of encoding information.

...

Top K Frequent Words

In this article, we will study about different approaches to solve the problem "Top K Frequent Words". This will involve the concept of Priority Queue, Trie and Bucket Sort.

Content:Problem StatementSolution using:
2.1. Priority Queue
2.2. Trie and Bucket SortProblem Statement:

We are given an array of strings words and an integer k, we have to return k strings which has highest frequency.

We need to return the answer which should be sorted by the frequency from highest to lowest and the wo...

Top K Heavy Hitters System Design

In This article, we will learn and explore about the System Design of Top K Heavy Hitters. This feature is used to get Top K elements in a set of elements and is frequently used in real systems. Several different approaches exist.

Table of content -IntroductionFunctional RequirementsNon-Functional RequirementsHash table, single hostHash table, multiple hostsHash table, multiple hosts, partitioningCount-min sketchHigh-level ArchitectureData flow, fast pathData flow, slow pathMapReduce...