A new perspective on the competitiveness of nations

The capability of firms to survive and to have a competitive advantage in global markets depends on, amongst other things, the efficiency of public institutions, the excellence of educational, health and communications infrastructures, as well as on the political and economic stability of their home country. The measurement of competitiveness and strategy development is thus an important issue for policy-makers. Despite many attempts to provide objectivity in the development of measures of national competitiveness, there are inherently subjective judgments that involve, for example, how data sets are aggregated and importance weights are applied. Generally, either equal weighting is assumed in calculating a final index, or subjective weights are specified. The same problem also occurs in the subjective assignment of countries to different clusters. Developed as such, the value of these type indices may be questioned by users. The aim of this paper is to explore methodological transparency as a viable solution to problems created by existing aggregated indices. For this purpose, a methodology composed of three steps is proposed. To start, a hierarchical clustering analysis is used to assign countries to appropriate clusters. In current methods, country clustering is generally based on GDP. However, we suggest that GDP alone is insufficient for purposes of country clustering. In the proposed methodology, 178 criteria are used for this purpose. Next, relationships between the criteria and classification of the countries are determined using artificial neural networks (ANNs). ANN provides an objective method for determining the attribute/criteria weights, which are, for the most part, subjectively specified in existing methods. Finally, in our third step, the countries of interest are ranked based on weights generated in the previous step. Beyond the ranking of countries, the proposed methodology can also be used to identify those attributes that a given country should focus on in order to improve its position relative to other countries, i.e., to transition from its current cluster to the next higher one

Magnification Control in Self-Organizing Maps and Neural Gas

We consider different ways to control the magnification in self-organizing maps (SOM) and neural gas (NG). Starting from early approaches of magnification control in vector quantization, we then concentrate on different approaches for SOM and NG. We show that three structurally similar approaches can be applied to both algorithms: localized learning, concave-convex learning, and winner relaxing learning. Thereby, the approach of concave-convex learning in SOM is extended to a more general description, whereas the concave-convex learning for NG is new. In general, the control mechanisms generate only slightly different behavior comparing both neural algorithms. However, we emphasize that the NG results are valid for any data dimension, whereas in the SOM case the results hold only for the one-dimensional case.Comment: 24 pages, 4 figure

State estimation for delayed neural networks

Copyright [2005] IEEE. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Brunel University's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to [email protected]. By choosing to view this document, you agree to all provisions of the copyright laws protecting it.In this letter, the state estimation problem is studied for neural networks with time-varying delays. The interconnection matrix and the activation functions are assumed to be norm-bounded. The problem addressed is to estimate the neuron states, through available output measurements, such that for all admissible time-delays, the dynamics of the estimation error is globally exponentially stable. An effective linear matrix inequality approach is developed to solve the neuron state estimation problem. In particular, we derive the conditions for the existence of the desired estimators for the delayed neural networks. We also parameterize the explicit expression of the set of desired estimators in terms of linear matrix inequalities (LMIs). Finally, it is shown that the main results can be easily extended to cope with the traditional stability analysis problem for delayed neural networks. Numerical examples are included to illustrate the applicability of the proposed design method

Adaptive Normalized Risk-Averting Training For Deep Neural Networks

This paper proposes a set of new error criteria and learning approaches, Adaptive Normalized Risk-Averting Training (ANRAT), to attack the non-convex optimization problem in training deep neural networks (DNNs). Theoretically, we demonstrate its effectiveness on global and local convexity lower-bounded by the standard $L_p$-norm error. By analyzing the gradient on the convexity index $\lambda$, we explain the reason why to learn $\lambda$ adaptively using gradient descent works. In practice, we show how this method improves training of deep neural networks to solve visual recognition tasks on the MNIST and CIFAR-10 datasets. Without using pretraining or other tricks, we obtain results comparable or superior to those reported in recent literature on the same tasks using standard ConvNets + MSE/cross entropy. Performance on deep/shallow multilayer perceptrons and Denoised Auto-encoders is also explored. ANRAT can be combined with other quasi-Newton training methods, innovative network variants, regularization techniques and other specific tricks in DNNs. Other than unsupervised pretraining, it provides a new perspective to address the non-convex optimization problem in DNNs.Comment: AAAI 2016, 0.39%~0.4% ER on MNIST with single 32-32-256-10 ConvNets, code available at https://github.com/cauchyturing/ANRA

Ranking to Learn: Feature Ranking and Selection via Eigenvector Centrality

In an era where accumulating data is easy and storing it inexpensive, feature selection plays a central role in helping to reduce the high-dimensionality of huge amounts of otherwise meaningless data. In this paper, we propose a graph-based method for feature selection that ranks features by identifying the most important ones into arbitrary set of cues. Mapping the problem on an affinity graph-where features are the nodes-the solution is given by assessing the importance of nodes through some indicators of centrality, in particular, the Eigen-vector Centrality (EC). The gist of EC is to estimate the importance of a feature as a function of the importance of its neighbors. Ranking central nodes individuates candidate features, which turn out to be effective from a classification point of view, as proved by a thoroughly experimental section. Our approach has been tested on 7 diverse datasets from recent literature (e.g., biological data and object recognition, among others), and compared against filter, embedded and wrappers methods. The results are remarkable in terms of accuracy, stability and low execution time.Comment: Preprint version - Lecture Notes in Computer Science - Springer 201

Effective skill refinement: Focusing on process to ensure outcome

In contrast to the abundance of motor skill acquisition and performance research, there is a paucity of work which addresses how athletes with an already learnt and well-established skill may go about making a subtle change, or refinement, to that skill. Accordingly, the purpose of this review paper is to provide a comprehensive overview of current understanding pertaining to such practice. Specifically, this review addresses deliberately initiated refinements to closed and self-paced skills (e.g., javelin throwing, golf swing and horizontal jumps). In doing so, focus is directed to three fundamental considerations within applied coaching practice and future research endeavours; the intended outcomes, process and evaluative measures of skill refinement. Conclusions suggest that skill refinement is not the same as skill acquisition or performing already learnt skills with high-levels of automaticity. Due to the complexity of challenge faced, refinements are best addressed as an interdisciplinary solution, with objective measures informing coach decision making