An adaptive algorithm is an algorithm that changes its behavior at the time it is run, based on information available and on a priori defined reward mechanism. Such information could be the story of recently received data, information on the available computational resources, or other run-time acquired information related to the environment in which it operates. Among the most used adaptive algorithms is the Widrow-Hoff’s least mean squares, which represents a class of stochastic gradient-descent algorithms used in adaptive filtering and machine learning. In adaptive filtering the LMS is used to mimic a desired filter by finding the filter coefficients that relate to producing the least mean square of the error signal. For example, stable partition, using no additional memory is O but given O memory, it can be O in time. As implemented by the C++ Standard Library, is adaptive and so it acquires as much memory as it can get and applies the algorithm using that available memory. Another example is adaptive sort, whose behavior changes upon the presortedness of its input. An example of an adaptive algorithm in radar systems is the constant false alarm rate detector. In machine learning and optimization, many algorithms are adaptive or have adaptive variants, which usually means that the algorithm parameters are automatically adjusted according to statistics about the optimisation thus far. Examples include adaptive simulated annealing, adaptive coordinate descent, AdaBoost, and adaptive quadrature. In data compression, adaptive coding algorithms such as Adaptive Huffman coding or Prediction by partial matching can take a stream of data as input, and adapt their compression technique based on the symbols that they have already encountered. In signal processing, the Adaptive Transform Acoustic Codingcodec used in MiniDisc recorders is called "adaptive" because the window length can change according to the nature of the sound being compressed, to try to achieve the best-sounding compression strategy.
