Activation function in Perceptron

Duration: 10 min

This video lesson is available to enrolled students.

Return to /learn/UPPSC-POLYTECHNIC-LECTURER-2025-CS/paper-2-soft-computing/artificial-intelligence-artificial-neural-networks/perceptron-and-activation-functions/asset-activation-function-in-perceptron after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. About Course: UPPSC Course Overview
  2. Interview Preparation & Guidance: Interview Preparation
  3. Paper 1 | General Hindi: भाषा, लिपि, ध्वनि, वर्ण, अक्षर, स्वर, व्यंजन, मात्रा और संयुक्ताक्षर, वर्तनी, वर्ण-विन्यास, अनुस्वार, अनुनासिक, चंद्रबिंदु और ‘र’ के रूप, शब्द, पद और शब्द-भेद, संज्ञा और सर्वनाम, विशेषण और क्रिया, लिंग, वचन, पुरुष और कारक, काल, वाच्य, वाक्य और वाक्य-भेद, वर्णमाला, समास, संधि, विलोम शब्द, पर्यायवाची शब्द, सामान्य अशुद्धियाँ, अनेक शब्दों के लिए एक शब्द, मुहावरे और लोकोक्तियाँ, अपठित गद्यांश और अपठित पद्यांश, Multi-Topic Content (Cross-Concept Material)
  4. Paper 2 | General Studies: State Wise GK, Polity, Geography, History, GK- Current Affairs
  5. Paper 1 | Programming Language: Language Design, C Fundamentals, Control Flow, Functions, Arrays & Pointers, Storage Classes, Structures & Enums, DMA, Macros, Scoping & File Handling, OOPS with C++
  6. Paper 1 | Database Management Systems: Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, SQL, Relational Calculus, Transaction Management, Concurrency Control, ORDBMS, NoSQL
  7. Paper 1 | Cyber Security: Society, Law & Ethics, Cyber Threats and Malware Attacks, Role of Internet and Web Services, Security in Mobile and Wireless Computing, Electronic Data Interchange and E-Commerce, Physical Security and Cryptography Basics, Intrusion Detection Systems (IDS), Cyber Safety and Security, Ethical Hacking
  8. Paper 1 | Computer Organization and Architecture: Basics of COA, Programming the Basic Computer, Cache Memory Organization, Input Output Organisation, Instr Formats & Modes, Register Transfer and Microoperations, Control Unit Design
  9. Paper 1 | Computer Networks: Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security
  10. Paper 1 | Design and Analysis of Algorithms: Algorithm Analysis, Time Complexity Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Advanced Algorithms
  11. Paper 1 | Data Structures: Introduction to DS, Array, Linked List, Stack, Queue, Tree, Graphs, Hashing
  12. Paper 1 | Discrete Structures and Theory of Logic: Permutation and Combination, Set Theory, Relations, Functions, Propositional and Predicate Logic, Graph Theory, Group Theory
  13. Paper 1 | Software Project Management: Software Project Management
  14. Paper 2 | Operating Systems: Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Threads & Process Creation, Deadlock, Memory Management, Virtual Memory, Disc Scheduling, File Management, Unix OS, Linux OS, Security
  15. Paper 2 | Compiler Design: Intro to Compilers, Lexical Analysis, Grammar & CFG, Syntax Analysis: Top-Down, Syntax Analysis: Bottom-Up, Semantic Analysis & SDT, Intermediate Code Gen, Code Optimization, Run Time Environment, Introduction to TOC, Deterministic FA (DFA), Non-Deterministic FA, Regular Expressions, Pushdown Automata & CFG, Complexity Theory
  16. Paper 2 | Artificial Intelligence & High Performance Computing: Approaches to AI, Search Algorithms, Game Playing, Knowledge Representation, Planning, Multi Agent Systems, Natural Language Processing, Emerging Tech Trends
  17. Paper 2 | Image Processing: Digital Image Fundamentals, Image Enhancement, Image Restoration, Color Image Processing, Image Compression
  18. Paper 2 | Software Engineering: Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  19. Paper 2 | Computer Graphics: Basics of Computer Graphics, 2-D Geometrical Transforms and Viewing, 3-D Object Representation, Geometric Transformations and Viewing
  20. Paper 2 | Web Technologies: Website, Browser & Services, Internet Fundamentals, Web Design & Development, Protocols & Services, Web Publishing & Hosting, Server Side & Security, Emerging Technologies, HTML Basics, JavaScript-Basics, Java
  21. Paper 2 | Soft Computing: Fuzzy Sets, Artificial Neural Networks, Genetic Algorithms
  22. Paper 2 | Distributed System: Distributed Systems
  23. UPPSC Live Class Recordings: UPPSC Polytechnic Lecturer 2025 (CS)
  24. Previous Year Papers:
  25. Mock Test:
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video provides an educational overview of activation functions in perceptrons, focusing on their role in neural networks. It begins by introducing two primary types of activation functions: the hard threshold function and the logistic (sigmoid) function. The hard threshold, shown in figure (a), produces a binary output—1 if the net input exceeds a certain threshold, and 0 otherwise. This type of function defines what is traditionally called a perceptron. In contrast, the logistic function, depicted in figure (b), generates a smooth S-shaped curve that maps inputs to values between 0 and 1, leading to the concept of a sigmoid perceptron. The video presents the mathematical formulation for activation: a_j = g(in_j) = g(∑ w_ij * a_i), where in_j is the weighted sum of inputs, and g represents the activation function. The discussion includes a diagram illustrating how inputs are weighted, summed, compared to a threshold (for the hard threshold function), and passed through an activation function. The video also highlights that perceptrons are single-layer feed-forward neural networks introduced by Frank Rosenblatt in 1957, based on the original MCP neuron model. The structure includes bias weights and input summation, with a decision rule: output 1 if the sum of weighted inputs is greater than or equal to the threshold, otherwise 0. The presentation uses visual aids such as graphs and diagrams to compare activation function behaviors and explain the computational flow within a perceptron unit. The content emphasizes how different activation functions lead to distinct types of neural units and influence the network's learning capabilities.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video introduces activation functions in neural networks, contrasting the hard threshold function (perceptron) and the logistic (sigmoid) function. It presents the mathematical formula a_j = g(in_j) = g(∑ w_ij * a_i), where in_j is the weighted sum of inputs and g is the activation function. Diagrams illustrate both functions graphically: figure (a) shows a step-like hard threshold, and figure (b) displays an S-shaped logistic curve. The on-screen text identifies the hard threshold as defining a perceptron and notes that the sigmoid function leads to the term 'sigmoid perceptron'. A schematic diagram of a perceptron unit includes bias weight w_0j and input summation, with labels such as 'Bias Weight' and 'a_j = g(in_j)' visible on the board.

  2. 2:00 – 5:00 02:00-05:00

    The video elaborates on the activation process in a perceptron, explaining that the output is determined by applying an activation function to the net input. It compares two types of functions: a hard threshold (figure a) and a logistic function (figure b), with the instructor pointing to each graph while discussing their differences. The formula a_j = g(in_j) = g(∑ w_i,j * a_i) is written on the board, and the term 'perceptron' is used for the hard threshold case while 'sigmoid perceptron' refers to the logistic function. The diagram includes a bias weight w_0j and input a_0 = 1, emphasizing the role of bias in the summation. The instructor highlights how these functions transform inputs into outputs, with the hard threshold producing binary results and the sigmoid providing a continuous range.

  3. 5:00 – 9:34 05:00-09:34

    The video explains the structure of a single-layer feed-forward neural network known as a perceptron, referencing Frank Rosenblatt's 1957 introduction and its basis on the MCP neuron model. A diagram shows inputs x1, x2, x3 being weighted by w1, w2, w3 and summed to produce Σ w_i x_i, which is then compared against a threshold. The output is 1 if the sum exceeds or equals the threshold, otherwise 0. This decision rule is written on screen as '1 if Σ w_i x_i >= threshold, else 0'. The discussion continues with a comparison of activation functions: the hard threshold (figure a) and logistic function (figure b), with the instructor pointing to each graph. The formula a_j = g(in_j) is reiterated, and components like bias weight w_0j and input a_0 = 1 are labeled. The video emphasizes how these functions determine the output behavior of neural units and introduces the concept of a sigmoid perceptron when using the logistic function.

The video systematically introduces activation functions in perceptrons, starting with the hard threshold function and contrasting it with the logistic (sigmoid) function. It presents both mathematical formulations and graphical representations to illustrate how these functions transform weighted inputs into outputs. The hard threshold function leads to binary output and defines a traditional perceptron, while the logistic function produces continuous outputs between 0 and 1, forming the basis of a sigmoid perceptron. The video emphasizes that these functions are central to determining how neural network units compute outputs and highlights the historical context of perceptrons, introduced by Frank Rosenblatt in 1957. Diagrams and on-screen equations support the explanation of input summation, bias weights, threshold comparison, and activation processes. The teaching progression moves from conceptual definitions to mathematical formalism and visual examples, reinforcing how different activation functions influence network behavior. The content is structured to help students understand the foundational differences between perceptron types and their implications for neural network design.

Loading lesson…