<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithm on English AI Terms Dictionary</title><link>https://terms-en.ai-term-hub.com/en/tags/algorithm/</link><description>Recent content in Algorithm on English AI Terms Dictionary</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Sat, 18 Jul 2026 11:44:44 +0000</lastBuildDate><atom:link href="https://terms-en.ai-term-hub.com/en/tags/algorithm/index.xml" rel="self" type="application/rss+xml"/><item><title>Multiplicative weight update method</title><link>https://terms-en.ai-term-hub.com/en/terms/multiplicative_weight_update_method/</link><pubDate>Sat, 18 Jul 2026 10:08:53 +0000</pubDate><guid>https://terms-en.ai-term-hub.com/en/terms/multiplicative_weight_update_method/</guid><description>&lt;h2 id="definition">Definition&lt;/h2>
&lt;p>The multiplicative weight update method is a fundamental online learning algorithm used to make decisions in uncertain environments. It maintains a set of weights for different strategies or experts, updating them multiplicatively based on their past performance. Strategies that perform well have their weights increased, while poor performers see their weights decreased. This method is widely used in game theory, optimization, and machine learning for constructing efficient prediction algorithms with provable convergence guarantees.&lt;/p></description></item><item><title>Instance-based learning</title><link>https://terms-en.ai-term-hub.com/en/terms/instance_based_learning/</link><pubDate>Sat, 18 Jul 2026 10:02:49 +0000</pubDate><guid>https://terms-en.ai-term-hub.com/en/terms/instance_based_learning/</guid><description>&lt;h2 id="definition">Definition&lt;/h2>
&lt;p>Also known as memory-based learning, this technique does not build a generalized model during training. Instead, it stores the entire training dataset. When a prediction is needed, it finds the most similar instances (neighbors) in the stored data and uses their labels to determine the output. K-Nearest Neighbors (KNN) is the most common algorithm in this category.&lt;/p>
&lt;h3 id="summary">Summary&lt;/h3>
&lt;p>A lazy learning approach where predictions are made by comparing new inputs to stored training instances.&lt;/p></description></item><item><title>Co-training</title><link>https://terms-en.ai-term-hub.com/en/terms/co_training/</link><pubDate>Sat, 18 Jul 2026 09:49:31 +0000</pubDate><guid>https://terms-en.ai-term-hub.com/en/terms/co_training/</guid><description>&lt;h2 id="definition">Definition&lt;/h2>
&lt;p>This method leverages multiple distinct feature sets (views) of the same data points. Initially, two classifiers are trained on small labeled datasets from each view. They then predict labels for unlabeled data, selecting high-confidence predictions to augment the training set of the other classifier. This iterative process expands the effective training data size, improving generalization when labeled data is scarce but abundant unlabeled data exists.&lt;/p>
&lt;h3 id="summary">Summary&lt;/h3>
&lt;p>Co-training is a semi-supervised learning algorithm where two views of the data are used to train separate classifiers that iteratively label unlabeled data for each other.&lt;/p></description></item></channel></rss>