Cost function adaptation: a stochastic gradient algorithm for data echo cancellation

A family of stochastic gradient algorithms and their behaviour in the data echo cancellation work platform are presented. The cost function adaptation algorithms use an error exponent update strategy based on an absolute error mapping, which is updated at every iteration. The quadratic and nonquadratic cost functions are special cases of the new family. Several possible realisations are introduced using these approaches. The noisy error problem is discussed and the digital recursive filter estimator is proposed. The simulation outcomes confirm the effectiveness of the proposed family of algorithms.

Adaptive data echo cancellation using cost function adaptation

For a digital echo canceller it is desirable to reduce the adaptation time, during which the transmission of useful data is not possible. LMS is a non-optimal algorithm in this case as the signals involved are statistically non-Gaussian. Walach and Widrow (IEEE Trans. Inform. Theory 30 (2) (March 1984) 275-283) investigated the use of a power of 4, while other research established algorithms with arbitrary integer (Pei and Tseng, IEEE J. Selected Areas Commun. 12(9)(December 1994) 1540-1547) or non-quadratic power (Shah and Cowan, IEE.Proc.-Vis. Image Signal Process. 142 (3) (June 1995) 187-191). This paper suggests that continuous and automatic, adaptation of the error exponent gives a more satisfactory result. The family of cost function adaptation (CFA) stochastic gradient algorithm proposed allows an increase in convergence rate and, an improvement of residual error. As special case the staircase CFA algorithm is first presented, then the smooth CFA is developed. Details of implementations are also discussed. Results of simulation are provided to show the properties of the proposed family of algorithms. (C) 2000 Elsevier Science B.V. All rights reserved.

Improved conjugate gradient implementation for least squares support vector machines

As a promising method for pattern recognition and function estimation, least squares support vector machines (LS-SVM) express the training in terms of solving a linear system instead of a quadratic programming problem as for conventional support vector machines (SVM). In this paper, by using the information provided by the equality constraint, we transform the minimization problem with a single equality constraint in LS-SVM into an unconstrained minimization problem, then propose reduced formulations for LS-SVM. By introducing this transformation, the times of using conjugate gradient (CG) method, which is a greatly time-consuming step in obtaining the numerical solution, are reduced to one instead of two as proposed by Suykens et al. (1999). The comparison on computational speed of our method with the CG method proposed by Suykens et al. and the first order and second order SMO methods on several benchmark data sets shows a reduction of training time by up to 44%. (C) 2011 Elsevier B.V. All rights reserved.

Semi batch learning with store management using enhanced conjugate gradient

This paper explores the performance of sliding-window based training, termed as semi batch, using multilayer perceptron (MLP) neural network in the presence of correlated data. The sliding window training is a form of higher order instantaneous learning strategy without the need of covariance matrix, usually employed for modeling and tracking purposes. Sliding-window framework is implemented to combine the robustness of offline learning algorithms with the ability to track online the underlying process of a function. This paper adopted sliding window training with recent advances in conjugate gradient direction with application of data store management e.g. simple distance measure, angle evaluation and the novel prediction error test. The simulation results show the best convergence performance is gained by using store management techniques. © 2012 Springer-Verlag.

Keeping a sense of proportion but losing all perspective: a critique of Gorard's notion of the 'Politician's Error'

In 1999 Stephen Gorard published an article in this journal in which he provided a trenchant critique of what he termed the `politician's error' in analysing differences in educational attainment. The main consequence of this error, he argued, has been the production of misleading findings in relation to trends in educational performance over time that have, in turn, led to misguided and potentially damaging policy interventions. By using gender differences in educational attainment as a case study, this article begins by showing how Gorard's notion of the politician's error has been largely embraced and adopted uncritically by those within the field. However, the article goes on to demonstrate how Gorard's own preferred way of analysing such differences – by calculating and comparing proportionate changes in performance between groups – is also inherently problematic and can lead to the production of equally misleading findings. The article will argue that there is a need to develop a more reliable and valid way of measuring trends in educational performance over time and will show that one of the simplest ways of doing this is to make use of existing, and widely accepted, measures of effect size.

Dimension theory and nonstable K1 of quadratic modules

Employing Bak’s dimension theory, we investigate the nonstable quadratic K-group K1,2n(A, ) = G2n(A, )/E2n(A, ), n 3, where G2n(A, ) denotes the general quadratic group of rank n over a form ring (A, ) and E2n(A, ) its elementary subgroup. Considering form rings as a category with dimension in the sense of Bak, we obtain a dimension filtration G2n(A, ) G2n0(A, ) G2n1(A, ) E2n(A, ) of the general quadratic group G2n(A, ) such that G2n(A, )/G2n0(A, ) is Abelian, G2n0(A, ) G2n1(A, ) is a descending central series, and G2nd(A)(A, ) = E2n(A, ) whenever d(A) = (Bass–Serre dimension of A) is finite. In particular K1,2n(A, ) is solvable when d(A) <.

Equalisation with adaptive time lag

In an adaptive equaliser, the time lag is an important parameter that significantly influences the performance. Only with the optimum time lag that corresponds to the best minimum-mean-square-error (MMSE) performance, can there be best use of the available resources. Many designs, however, choose the time lag either based on preassumption of the channel or simply based on average experience. The relation between the MMSE performance and the time lag is investigated using a new interpretation of the MMSE equaliser, and then a novel adaptive time lag algorithm is proposed based on gradient search. The proposed algorithm can converge to the optimum time lag in the mean and is verified by the numerical simulations provided.

Quadratic Forms on Complex Random Matrices and Multiple-Antenna Systems

This research published in the foremost international journal in information theory and shows interplay between complex random matrix and multiantenna information theory. Dr T. Ratnarajah is leader in this area of research and his work has been contributed in the development of graduate curricula (course reader) in Massachusetts Institute of Technology (MIT), USA, By Professor Alan Edelman. The course name is "The Mathematics and Applications of Random Matrices", see http://web.mit.edu/18.338/www/projects.html

Error sensitive historical GIS: Identifying areal interpolation errors in time series data

Historical GIS has the potential to re-invigorate our use of statistics from historical censuses and related sources. In particular, areal interpolation can be used to create long-run time-series of spatially detailed data that will enable us to enhance significantly our understanding of geographical change over periods of a century or more. The difficulty with areal interpolation, however, is that the data that it generates are estimates which will inevitably contain some error. This paper describes a technique that allows the automated identification of possible errors at the level of the individual data values.

The Galactic metallicity gradient

We have previously published intermediate to hi,oh resolution spectroscopic observations of approximately 80 early B-type main-sequence stars situated in 19 Galactic open clusters/associations with Galactocentric distances distributed over 6 less than or equal to R-g less than or equal to 18 kpc. This current study collates and re-analyses these equivalent- width datasets using LTE and non-LTE model atmosphere techniques, in order to determine the stellar atmospheric parameters and abundance estimates for C, N, O, Mg, Al and Si. The latter should be representative of the present-day Galactic interstellar medium. Our extensive observational dataset permits the identification of sub-samples of stars with similar atmospheric parameters and of homogeneous subsets of lines. As such, this investigation represents the most extensive and systematic study of its kind to date. We conclude that the distribution of light elements (CI O, Mg & Si) in the Galactic disk can be represented by a linear, radial gradient of -0.07 +/- 0.01 dex kpc(-1) Our results for nitrogen and oxygen viz. (-0.09 +/- 0.01 dex kpc(-1) and -0.067 +/- 0.008 dex kpc(-1)) are in excellent agreement with that found from the study of HII regions. We have also examined our datasets for evidence of an abrupt discontinuity in the metallicity of the Galactic disk near a Galactocentric distance of 10 kpc (see Twarog et al. 1997). However, there is no evidence to suggest that our data would be better fitted with a two-zone model. Moreover, we observe a N/O gradient of -0.04 +/- 0.02 dex kpc(-1) which is consistent with that found for other spiral galaxies (Vila- Costas gr Edmunds 1993).