The significance of Kasparov versus Deep Blue and the future of computer chess

Journal of the International Computer Chess Association (ICCA), March 1998
The significance of Kasparov versus Deep Blue and the future of computer chess
Dennis DeCoste

In this paper we argue that the recent Garry Kasparov vs. Deep Blue matches are significant for the field of artificial intelligence in several ways, including providing an example of valuable baseline benchmarks for more complex alternatives to contrast and justify themselves.

We will also briefly summarize some of the latest developments on computer chess research and highlight how our own work on a program called Chester tries to build on those developments to provide such justifications.

Another publication from the same category: Machine Learning and Data Science

IEEE Computing Conference 2018, London, UK

Regularization of the Kernel Matrix via Covariance Matrix Shrinkage Estimation

The kernel trick concept, formulated as an inner product in a feature space, facilitates powerful extensions to many well-known algorithms. While the kernel matrix involves inner products in the feature space, the sample covariance matrix of the data requires outer products. Therefore, their spectral properties are tightly connected. This allows us to examine the kernel matrix through the sample covariance matrix in the feature space and vice versa. The use of kernels often involves a large number of features, compared to the number of observations. In this scenario, the sample covariance matrix is not well-conditioned nor is it necessarily invertible, mandating a solution to the problem of estimating high-dimensional covariance matrices under small sample size conditions. We tackle this problem through the use of a shrinkage estimator that offers a compromise between the sample covariance matrix and a well-conditioned matrix (also known as the "target") with the aim of minimizing the mean-squared error (MSE). We propose a distribution-free kernel matrix regularization approach that is tuned directly from the kernel matrix, avoiding the need to address the feature space explicitly. Numerical simulations demonstrate that the proposed regularization is effective in classification tasks.