The Anatomy of Catastrophic Forgetting
We train a model on handwritten digit classification. 99% accuracy. Then we train the same model on a new task — say, fashion item recognition. We go back and test it on digits. 34% accuracy. It has c
Saptarshi’s Dev Journal
Personal chronicle of a Java engineer’s journey through the world of software development, where you’ll find in-depth articles that addresses real-world challenges and explores emerging technologies.
Latest articles
Key Math Concepts in Data Structures and Algorithms
At the core of data structures and algorithms are fundamental mathematical principles that guide their design and implementation. This article explores key math concepts essential for mastering data s
Demystifying Time and Space Complexity for Beginners
Imagine you've just created an algorithm, and it works lightning-fast on your brand-new computer. You're thrilled with the results and can't wait to share your success, so you ask your friend to give it a try. However, when your friend runs the same ...
What is Recursion? A Comprehensive Overview
A Problem Let’s start with a problem: I need to print first 10 natural numbers. There are several ways to solve this problem. But let's say we need to solve it using functions without using loops or calling a function more than once. The simplest way...
Cyclic Sort Made Simple: Learn the Basics and How It Works
Cyclic sort is an in-place and unstable sorting algorithm that is specifically designed to efficiently sort arrays where numbers are in a known range like from 1 to N. How does it work? Let’s take the following array as an example. We need to sort it...
How Insertion Sort Works: Simplified Explanation
Insertion sort is a simple comparison-based sorting algorithm that sorts by repeatedly inserting elements into their correct position. Let's explore how it works in detail. What is Insertion Sort? Insertion Sort is a comparison sort algorithm. It div...
Mastering Selection Sort: A Simple Explanation
Selection Sort is a simple sorting algorithm that repeatedly finds the smallest (or the largest) element from the unsorted part and moves it to its correct position. What is Selection Sort? Selection sort is a comparison sort algorithm. It repeatedly...
A Beginner's Guide to Bubble Sort Algorithm
Bubble sort (also called as Sinking Sort and Exchange Sort) is a straightforward sorting algorithm that operates by repeatedly comparing and swapping adjacent elements if they are in the wrong order. What is Bubble Sort? Bubble Sort is a comparison s...
Mastering Data Cleanup: Unleash the Power of OpenRefine
Step-by-step OpenRefine guide for cleaning numeric data and normalizing text with clustering, featuring GREL snippets and images.