Study the nonlinear activation functions most commonly used in backpropagation algorithms and other learning procedures.
Also find me here:
Baeldung Author
baeldung
This is the standard author on the site. Most articles are published by individual authors, with their own profiles, but when multiple people have a strong contribution, we publish collectively here.
Here's what I've written (so far):
Baeldung on Computer Science
- All
- Machine Learning (45)
- Algorithms (41)
- Networking (40)
- Programming (36)
- Math and Logic (30)
- OS (19)
- Computer Vision (19)
- Artificial Intelligence (19)
- Deep Learning (16)
- Trees (15)
- Data Structures (15)
- Security (14)
- Sorting (13)
- Latex (13)
- Software Architecture (11)
- Core Concepts (10)
- Graphs (8)
- Searching (6)
- Series (5)
- Web (4)
- Graph Traversal (4)
- Data Science (4)
- Path Finding (3)
- Graph Theory (3)
- Concurrency (1)
Implement Stack Using Two Queues
Filed under Data Structures, Programming
Learn how to implement a Stack data structure using two Queues.
The ABA Problem in Concurrency
Filed under Programming
Learn about the ABA problem; how it happens, what problems it can cause, and how to fix it.
Inadequacy of Linear Models: the Road to Nonlinear Functions
Filed under Artificial Intelligence
Explore the differences between linear and nonlinear problems, and how the former are inadequate in dealing with complex nonlinear problems.
Tries (Prefix Trees)
Filed under Data Structures, Trees
Learn how to implement a prefix tree data structure.
What Is a Monitor in Computer Science?
Filed under OS
Explore the concept of a monitor and then learn about its implementation in Java.
Connected Components in a Graph
Filed under Graphs
Explore a simple definition of connected component followed by a couple of simple and easy to understand examples
Difference Between Tree Depth and Height
Filed under Data Structures, Trees
A quick and practical explanation of differences between tree depth and height.
Understanding Space Complexity
Filed under Core Concepts
Learn how to analyze an algorithms space complexity