From the Publisher:
Genetic algorithms are playing an increasingly important role in studies of complex adaptive systems, ranging from adaptive agents in economic theory to the use of machine learning techniques in the design of complex devices such as aircraft turbines and integrated circuits. Adaptation in Natural and Artificial Systems is the book that initiated this field of study, presenting the theoretical foundations and exploring applications.
In its most familiar form, adaptation is a biological process, whereby organisms evolve by rearranging genetic material to survive in environments confronting them. In this now classic work, Holland presents a mathematical model that allows for the nonlinearity of such complex interactions. He demonstrates the model's universality by applying it to economics, physiological psychology, game theory, and artificial intelligence and then outlines the way in which this approach modifies the traditional views of mathematical genetics.
Initially applying his concepts to simply defined artificial systems with limited numbers of parameters, Holland goes on to explore their use in the study of a wide range of complex, naturally occuring processes, concentrating on systems having multiple factors that interact in nonlinear ways. Along the way he accounts for major effects of coadaptation and coevolution: the emergence of building blocks, or schemata, that are recombined and passed on to succeeding generations to provide, innovations and improvements.
John H. Holland is Professor of Psychology and Professor of Electrical Engineering and Computer Science at the University of Michigan. He is also Maxwell Professor at the Santa Fe Institute and isDirector of the University of Michigan/Santa Fe Institute Advanced Research Program.

Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence

This survey provides an overview of higher-order tensor decompositions, their applications, and available software. A tensor is a multidimensional or $N$-way array. Decompositions of higher-order tensors (i.e., $N$-way arrays with $N \geq 3$) have applications in psycho-metrics, chemometrics, signal processing, numerical linear algebra, computer vision, numerical analysis, data mining, neuroscience, graph analysis, and elsewhere. Two particular tensor decompositions can be considered to be higher-order extensions of the matrix singular value decomposition: CANDECOMP/PARAFAC (CP) decomposes a tensor as a sum of rank-one tensors, and the Tucker decomposition is a higher-order form of principal component analysis. There are many other tensor decompositions, including INDSCAL, PARAFAC2, CANDELINC, DEDICOM, and PARATUCK2 as well as nonnegative variants of all of the above. The N-way Toolbox, Tensor Toolbox, and Multilinear Engine are examples of software packages for working with tensors.

/pdf/tensor-decompositions-and-applications-46vl2ih5gn.pdf

Tensor Decompositions and Applications

/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

We discuss a multilinear generalization of the singular value decomposition. There is a strong analogy between several properties of the matrix and the higher-order tensor decomposition; uniqueness, link with the matrix eigenvalue decomposition, first-order perturbation effects, etc., are analyzed. We investigate how tensor symmetries affect the decomposition and propose a multilinear generalization of the symmetric eigenvalue decomposition for pair-wise symmetric tensors.

/pdf/a-multilinear-singular-value-decomposition-5egsfnmazm.pdf

A Multilinear Singular Value Decomposition

https://rss.onlinelibrary.wiley.com/doi/pdf/10.1111/j.2517-6161.1991.tb01825.x

Procrustes methods in the statistical analysis of shape

Recursive filter structures the Beurling-Lax theorem, Hankel forms and classical identification adaptive IIR filtering in signal processing and control stability of time-varying recursive filters gradient descent algorithms the Steiglitz-McBride family of algorithms hyperstable algorithms adaptive notch filters perspectives and open problems computations with lattice filters.

Adaptive IIR Filtering in Signal Processing and Control

The properties of digital all-pass filters are reviewed and a broad overview of the diversity of applications in digital filtering is provided. Starting with the definition and basic properties of a scalar all-pass function, a variety of structures satisfying the all-pass property are assembled, with emphasis placed on the concept of structural losslessness. Applications are then outlined in notch filtering, complementary filtering and filter banks, multirate filtering, spectrum and group-delay equalization, and Hilbert transformations. In all cases, the structural losslessness property induces very robust performance in the face of multiplier coefficient quantization. Finally, the state-space manifestations of the all-pass property are explored, and it is shown that many all-pass filter structures are devoid of limit cycle behavior and feature very low roundoff noise gain. >

/pdf/the-digital-all-pass-filter-a-versatile-signal-processing-593kdqvx76.pdf

The digital all-pass filter: a versatile signal processing building block

Recently the problem of determining the best, in the least-squares sense, rank-1 approximation to a higher-order tensor was studied and an iterative method that extends the well-known power method for matrices was proposed for its solution. This higher-order power method is also proposed for the special but important class of supersymmetric tensors, with no change. A simplified version, adapted to the special structure of the supersymmetric problem, is deemed unreliable, as its convergence is not guaranteed. The aim of this paper is to show that a symmetric version of the above method converges under assumptions of convexity (or concavity) for the functional induced by the tensor in question, assumptions that are very often satisfied in practical applications. The use of this version entails significant savings in computational complexity as compared to the unconstrained higher-order power method. Furthermore, a novel method for initializing the iterative process is developed which has been observed to yield an estimate that lies closer to the global optimum than the initialization suggested before. Moreover, its proximity to the global optimum is a priori quantifiable. In the course of the analysis, some important properties that the supersymmetry of a tensor implies for its square matrix unfolding are also studied.

http://www-public.it-sudparis.eu/~regalia/personal/articles/SIMAX-38741.pdf

On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors

A novel lattice-based adaptive infinite impulse response (IIR) notch filter is developed which features independent tuning of the notch frequency and attenuation bandwidth. The internal structure is based on planar rotators, ensuring reliable numerical behaviour and high processing rates in CORDIC environments. A simple update law allows a simpler implementation than previously proposed designs. Rather than minimizing an output error cost function, the algorithm is designed to achieve a stable associated differential equation, resulting in a globally convergent unbiased frequency estimator in the single sinusoid case, independent of the notch filter bandwidth. Using a second-order structure in the multiple sinusoid case, unbiased estimation of one of the input frequencies is achieved by thinning the notch bandwidth. The tracking behavior is superior to conventional output error designs, and the estimation of extremal frequencies is less prone to overflow instability than previously reported structures. >

An improved lattice-based adaptive IIR notch filter

The Akaike (1974) information criterion (AIC) and the minimum description length (MDL) are two well-known criteria for model order selection in the additive white noise case. Our aim is to study the influence on their behavior of a large gap between the signal and the noise eigenvalues and of the noise eigenvalue dispersion. Our results are mostly qualitative and serve to explain the behavior of the AIC and the MDL in some cases of great practical importance. We show that when the noise eigenvalues are not clustered sufficiently closely, then the AIC and the MDL may lead to overmodeling by ignoring an arbitrarily large gap between the signal and the noise eigenvalues. For fixed number of data samples, overmodeling becomes more likely for increasing the dispersion of the noise eigenvalues. For fixed dispersion, overmodeling becomes more likely for increasing the number of data samples. Undermodeling may happen in the cases where the signal and the noise eigenvalues are not well separated and the noise eigenvalues are clustered sufficiently closely. We illustrate our results by using simulations from the effective channel order determination area.

http://www-public.tem-tsp.eu/~regalia/personal/articles/sp-aug-01.pdf

Phillip A. Regalia

Papers

Adaptive IIR Filtering in Signal Processing and Control

The digital all-pass filter: a versatile signal processing building block

On the Best Rank-1 Approximation of Higher-Order Supersymmetric Tensors

An improved lattice-based adaptive IIR notch filter

On the behavior of information theoretic criteria for model order selection