Editors' Introduction to [Algorithmic Learning Theory: 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010. Proceedings]

Learning theory is an active research area that incorporates ideas, problems, and techniques from a wide range of disciplines including statistics, artificial intelligence, information theory, pattern recognition, and theoretical computer science. The research reported at the 21st International Conference on Algorithmic Learning Theory (ALT 2010) ranges over areas such as query models, online learning, inductive inference, boosting, kernel methods, complexity and learning, reinforcement learning, unsupervised learning, grammatical inference, and algorithmic forecasting. In this introduction we give an overview of the five invited talks and the regular contributions of ALT 2010

Sign rank versus VC dimension

This work studies the maximum possible sign rank of $N \times N$ sign matrices with a given VC dimension $d$. For $d=1$, this maximum is {three}. For $d=2$, this maximum is $\tilde{\Theta}(N^{1/2})$. For $d >2$, similar but slightly less accurate statements hold. {The lower bounds improve over previous ones by Ben-David et al., and the upper bounds are novel.} The lower bounds are obtained by probabilistic constructions, using a theorem of Warren in real algebraic topology. The upper bounds are obtained using a result of Welzl about spanning trees with low stabbing number, and using the moment curve. The upper bound technique is also used to: (i) provide estimates on the number of classes of a given VC dimension, and the number of maximum classes of a given VC dimension -- answering a question of Frankl from '89, and (ii) design an efficient algorithm that provides an $O(N/\log(N))$ multiplicative approximation for the sign rank. We also observe a general connection between sign rank and spectral gaps which is based on Forster's argument. Consider the $N \times N$ adjacency matrix of a $\Delta$ regular graph with a second eigenvalue of absolute value $\lambda$ and $\Delta \leq N/2$. We show that the sign rank of the signed version of this matrix is at least $\Delta/\lambda$. We use this connection to prove the existence of a maximum class $C\subseteq\{\pm 1\}^N$ with VC dimension $2$ and sign rank $\tilde{\Theta}(N^{1/2})$. This answers a question of Ben-David et al.~regarding the sign rank of large VC classes. We also describe limitations of this approach, in the spirit of the Alon-Boppana theorem. We further describe connections to communication complexity, geometry, learning theory, and combinatorics.Comment: 33 pages. This is a revised version of the paper "Sign rank versus VC dimension". Additional results in this version: (i) Estimates on the number of maximum VC classes (answering a question of Frankl from '89). (ii) Estimates on the sign rank of large VC classes (answering a question of Ben-David et al. from '03). (iii) A discussion on the computational complexity of computing the sign-ran

Algorithmic learning theory : 21st International Conference, ALT 2010, Canberra, Australia, October 6-8, 2010, proceedings

This book constitutes the refereed proceedings of the 21th International Conference on Algorithmic Learning Theory, ALT 2010, held in Canberra, Australia, in October 2010, co-located with the 13th International Conference on Discovery Science, DS 2010. The 26 revised full papers presented together with the abstracts of 5 invited talks were carefully reviewed and selected from 44 submissions. The papers are divided into topical sections of papers on statistical learning; grammatical inference and graph learning; probably approximately correct learning; query learning and algorithmic teaching; on-line learning; inductive inference; reinforcement learning; and on-line learning and kernel methods

Algorithmic Learning Theory : 21st International Conference, ALT 2010 Canberra, Australia, October 6-8, 2010 Proceedings

This volume contains the papers presented at the 21st International Conference on Algorithmic Learning Theory (ALT 2010), which was held in Canberra, Australia, October 6-8, 2010. The conference was co-located with the 13th - International Conference on Discovery Science (DS 2010) and with the Machine Learning Summer School, which was held just before ALT 2010. The tech- cal program of ALT 2010, contained 26 papers selected from 44 submissions and have invited talks. The invited talks were presented in joint sessions of both conferences. ALT 2010 was dedicated to the theoretical foundations of machine learning and took place on the campus of the Australian National University, Canberra, Australia. ALT provides a forum for high-quality talks with a strong theore- cal background and scientific interchange in areas such as inductive inference, universal prediction, teaching models, grammatical inference, formal languages, inductive logic programming, query learning, complexity of learning, on-line learning and relative loss bounds, semi-supervised and unsupervised learning, clustering, active learning, statistical learning, support vector machines, Vapnik- Chervonenkis dimension, probably approximately correct learning, Bayesian and causal networks, boosting and bagging, information-based methods, minimum description length, Kolmogorov complexity, kernels, graph learning, decision tree methods, Markov decision processes, reinforcement learning, and real-world applications of algorithmic learning theory. DS 2010 was the 13th International Conference on Discovery Science and focused on the development and analysis of methods for intelligent data an- ysis, knowledge discovery and machine learning, as well as their application to scientific knowledge discovery. As is the tradition, it was co-located and held in parallel with Algorithmic Learning Theory

Manifesto for the Humanities: Transforming Doctoral Education in Good Enough Times

After a remarkable career in higher education, Sidonie Smith offers Manifesto for the Humanities as a reflective contribution to the current academic conversation over the place of the Humanities in the 21st century. Her focus is on doctoral education and opportunities she sees for its reform. Grounding this manifesto in background factors contributing to current “crises” in the humanities, Smith advocates for a 21st century doctoral education responsive to the changing ecology of humanistic scholarship and teaching. She elaborates a more expansive conceptualization of coursework and dissertation, a more robust, engaged public humanities, and a more diverse, collaborative, and networked sociality

Market Manipulation in Stock and Power Markets: A Study of Indicator-Based Monitoring and Regulatory Challenges

In recent years, algorithmic-based market manipulation in stock and power markets has considerably increased, and it is difficult to identify all such manipulation cases. This causes serious challenges for market regulators. This work highlights and lists various aspects of the monitoring of stock and power markets, using as test cases the regulatory agencies and regulatory policies in diverse regions, including Hong Kong, the United Kingdom, the United States and the European Union. Reported cases of market manipulations in the regions are examined. In order to help establish a relevant digital regulatory system, this work reviews and categorizes the indicators used to monitor the stock and power markets, and provides an in-depth analysis of the relationship between the indicators and market manipulation. This study specifically compiles a set of 10 indicators for detecting manipulation in the stock market, utilizing the perspectives of return rate, liquidity, volatility, market sentiment, closing price and firm governance. Additionally, 15 indicators are identified for detecting manipulation in the power market, utilizing the perspectives of market power (also known as pricing power or market structure), market conduct and market performance. Finally, the study elaborates on the current challenges in the regulation of stock and power markets in terms of parameter performance, data availability and technical requirements