Aditya Chatterjee's Blog, page 23

Understanding AdaDelta: An Adaptive Learning Rate Optimization Algorithm

Table of ContentsIntroductionThe Challenge of Learning Rate in OptimizationUnderstanding AdaDeltaAdvantages of AdaDeltaConclusion1. Introduction

In the realm of deep learning and neural networks, finding an optimal learning rate is a crucial aspect of training models efficiently and effectively. Traditional optimization algorithms, such as Stochastic Gradient Descent (SGD), require manual tuning of the learning rate, which can be a challenging and time-consuming process. To address this...

Min / Max Heap in C++ using STL

In this article at OpenGenus, we are going to study and explore Min / Max Heap in C++ using STL. We will see their definition, usage and how we are going to apply them to solve various complex problems in C++ language.

TABLE OF CONTENTSINTRODUCTIONMIN HEAPPRIORTY QUEUEIMPLEMETATION OF MIN HEAP USING C++ STLMAX HEAPIMPLEMENTATION OF MAX HEAP USING C++ STLEXAMPLETIME AND SPACE COMPLEXITY.INTRODUCTION

In a Heap, a unique type of tree-based data structure, the tree is a complete binary tr...

RMSprop (Root Mean Square Propagation)

Abstract

RMSprop (Root Mean Square Propagation) is a widely used optimization algorithm in machine learning, adapting the learning rate for each parameter based on historical gradients. This article at OpenGenus provides an overview of RMSprop's workings using analogies, and its advantages over traditional gradient descent and AdaGrad. It concludes with insights into some disadvantages, current applications and future prospects for refining and extending it in diverse machine learning domains.

T...

Math Functions in SQL/MySQL

This article at OpenGenus will demonstrate the numeric/Math function and their roles in mathematical operations with syntax and example using MySQL query.These functions are used for mathematical calculation in Data Analysis and Computer programming.

These Numeric/Math functions are:

ABS()AVG()ASIN()ACOS()ATAN() /ATAN2()COUNT()COS()COT()CEIL()/CEILING()DIV()DEGREES()EXP()FLOOR()GREATEST()LOG()LOG2()LOG10()LN()MOD()PI()POW()/POWER()RAND()ROUND()SUM()SQRT()SIN()SIGN()TA...

He initialization in Deep Learning

Table of ContentsIntroductionWeight initializationThe Problem of Poor InitializationThe Intuition behind He InitializationBenefits of He InitializationFaster ConvergenceImproved PerformanceRobustnessWidely ApplicableFacilitating Deep ArchitecturesPractical ImplementationConclusionIntroduction

He initialization, also known as Kaiming Initialization, is a widely used technique in deep learning for initializing the weights of neural networks. It was introduced by Kaiming He et al....

Floyd Warshall Algorithm in C++

Floyd Warshall Algorithm is one of the famous graph algorithm for finding shortest path between a node to every other node. In this article at OpenGenus, we have implemented Floyd Warshall Algorithm in C++ programming language.

Table of contents:

what is shortest path?AlgorithmPseudocodeStep by step C++ Implementation of Floyd-Warshall algorithmComplete Implementation in C++Time and space complexitiesApplicationsWHAT IS SHORTEST PATH?

Any path that takes least amount of edge weight is c...

7 Different Prompting Techniques

Table of ContentsIntroductionBasic PromptingFormattingBasic Best PracticesAdvanced Prompting TechniquesZero-Shot PromptingFew-Shot PromptingChain-of-thought (CoT) PromptingSelf-consistencyGenerated Knowledge PromptingTree of Thoughts (ToT)Retrieval Augmented Generation (RAG)Introduction

In the wake of OpenAI's groundbreaking release of ChatGPT, the immense potential of large language models (LLMs) has become evident, showcasing their ability to automate tasks across a wide s...

Entrepreneurship: From Classroom to Boardroom

Introduction

Every thriving business starts from a seed - an idea. As a student, the moment this seed takes root can be exhilarating, yet equally daunting. The thrill lies in the potential to effect change, to disrupt the status quo and make a difference. On the flip side, the fear resides in the unknown - the complexities of running a business, societal pressures, the haunting specter of failure, and the puzzle of securing funding. This blog explores these challenges from the perspective of a s...

Mutex and critical section

In this article at OpenGenus, we have explained the concept of Mutex and critical section along with a C++ code for demonstration.

Table of contents:

Why using threads?What is a critical section?C++ ImplementationWhy using threads?

Working on multiple processes is characterized by two things:

Concurrency: where two or more processes work on separate things doing different things at the same time.Isolation: Processes are isolated from one another; meaning their memory is separate (so if o...

Linear Search in Python using OOP Concepts

Table of contents:

IntroductionUnderstanding Linear SearchOOP ConceptsImplementing Linear Search using OOPExample UsageConclusionIntroduction

Linear search is a basic searching algorithm that sequentially examines each element in a list to find the target value. While not the most efficient search algorithm for large datasets, it serves as a fundamental concept in computer science and is essential to understand. In this article at OpenGenus, we will explore how to implement the linear se...