Information Ranking and Power Laws on Trees

We study the situations when the solution to a weighted stochastic recursion has a power law tail. To this end, we develop two complementary approaches, the first one extends Goldie's (1991) implicit renewal theorem to cover recursions on trees; and the second one is based on a direct sample path large deviations analysis of weighted recursive random sums. We believe that these methods may be of independent interest in the analysis of more general weighted branching processes as well as in the analysis of algorithms

Fundamental concepts in management research and ensuring research quality : focusing on case study method

This paper discusses fundamental concepts in management research and ensuring research quality. It was presented at the European Academy of Management annual conference in 2008

Futures Studies in the Interactive Society

This book consists of papers which were prepared within the framework of the research project (No. T 048539) entitled Futures Studies in the Interactive Society (project leader: Éva Hideg) and funded by the Hungarian Scientific Research Fund (OTKA) between 2005 and 2009. Some discuss the theoretical and methodological questions of futures studies and foresight; others present new approaches to or procedures of certain questions which are very important and topical from the perspective of forecast and foresight practice. Each study was conducted in pursuit of improvement in futures fields

Representation Learning: A Review and New Perspectives

The success of machine learning algorithms generally depends on data representation, and we hypothesize that this is because different representations can entangle and hide more or less the different explanatory factors of variation behind the data. Although specific domain knowledge can be used to help design representations, learning with generic priors can also be used, and the quest for AI is motivating the design of more powerful representation-learning algorithms implementing such priors. This paper reviews recent work in the area of unsupervised feature learning and deep learning, covering advances in probabilistic models, auto-encoders, manifold learning, and deep networks. This motivates longer-term unanswered questions about the appropriate objectives for learning good representations, for computing representations (i.e., inference), and the geometrical connections between representation learning, density estimation and manifold learning