Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Browse By

All Optimization and Machine Learning Algorithms

Procedures that search for the best answer or learn it from examples by improving a candidate step by step. Gradient descent and backpropagation adjust the parameters of a model to reduce its error, k-means clustering groups observations around central points, and genetic algorithms and simulated annealing borrow ideas from natural selection and from the cooling of metal to search large spaces of possible solutions for a good one.

All Optimization and Machine Learning Algorithms
Filter Results5 entries
Sources
Backpropagation, Wikipedia
Has Member: Backpropagation, Lead
Quote, Has Member: Backpropagation, Lead
In machine learning, backpropagation is a gradient computation method commonly used for training a neural network in computing parameter updates.
View the Source
Wikipedia: Gradient Descent
Wikimedia FoundationHas Member: Gradient Descent, Lead
Quote, Has Member: Gradient Descent, Lead
Gradient descent is a method for unconstrained mathematical optimization.
View the Source
Wikipedia: K-means clustering
Wikimedia FoundationHas Member: K-Means Clustering, Lead
Quote, Has Member: K-Means Clustering, Lead
k-means clustering is a method of vector quantization, originally from signal processing, that aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean (cluster centers or cluster centroid).
View the Source
Wikipedia: Genetic algorithm
Wikimedia FoundationHas Member: Genetic Algorithm, Lead
Quote, Has Member: Genetic Algorithm, Lead
A genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA) in computer science and operations research.
View the Source
Wikipedia: Simulated annealing
Wikimedia FoundationHas Member: Simulated Annealing, Lead
Quote, Has Member: Simulated Annealing, Lead
Simulated annealing (SA) is a probabilistic technique for approximating the global optimum of a given function.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.