Deterministic and Heuristic
Machine Learning Fundamentals (related topic)
Deterministic Models in Machine Learning typically refer to models where, given a specific input, the output is always the same. This determinism arises from the model's structure and the fixed set of rules it follows. Supervised Learning models, especially those dealing with labeled data, often exhibit deterministic behavior. For instance:
Supervised Learning with Labeled Inputs: The source describes supervised learning as using labeled inputs that are deterministic (not random) and discrete (a set number of choices/options) [1]. This suggests that in supervised learning, the model's training relies on clearly defined inputs and corresponding outputs, leading to a deterministic mapping between them.
Regression Techniques: Examples like linear regression and polynomial regression aim to establish a clear mathematical relationship between input and output variables. Once the model is trained, providing the same input will always result in the same predicted output.
Classification with Clear Boundaries: In classification tasks, if the model is trained on data with well-defined decision boundaries, it can exhibit deterministic behavior. For instance, in a simple spam detection model, an email with specific keywords might always be classified as spam.
Heuristic Models, on the other hand, often involve elements of randomness or approximation. Unsupervised learning, working with unlabeled data, might lean towards heuristic approaches. For example:
Unsupervised Learning with Randomness: The source describes unsupervised learning as working with unlabeled data and inputs that are stochastic (agents' actions are random) and continuous (choices/options are infinite) [1]. This implies that the model's learning process incorporates inherent randomness, leading to a less deterministic and more heuristic approach.
Clustering Techniques: In clustering algorithms like k-means, the initial cluster centroids are often randomly assigned, and the assignment of data points to clusters can change across iterations. This randomness contributes to a heuristic element in the model.
Approximation in Complex Data: When dealing with complex and high-dimensional data, some unsupervised learning models might use heuristics or approximations to simplify the problem and find meaningful patterns.