The 26th International Conference on Algorithmic Learning Theory (ALT 2015) will be held in Banff, Canada, during October 4–6, 2015. The conference is on the theoretical foundations of machine learning. The conference will be co-located with the 18th International Conference on Discovery Science (DS 2015).
Topics of Interest: We invite submissions with theoretical and algorithmic contributions to new or already existing learning problems including but are not limited to:
- Comparison of the strength of learning models and the design and evaluation
of novel algorithms for learning problems in established learning-theoretic
settings such as
- Statistical learning theory
- On-line learning
- Inductive inference
- Query models
- Unsupervised learning
- Semi-supervised and active learning
- Stochastic optimization
- High dimensional and non-parametric inference
- Exploration-Exploitation tradeoff, bandit theory
- Reinforcement learning, planning
- Learning with additional constraints, e.g, communication, time or memory budget, or privacy.
- Analysis of the theoretical properties of existing algorithms. Families of
algorithms could include
- Kernel-based methods, SVM
- Bayesian networks
- Graph- and/or manifold-based methods
- methods for latent-variable estimation and/or clustering
- decision tree methods
- information-based methods.
- Definition and analysis of new learning models. Models might identify and formalize classes of learning problems inadequately addressed by existing theory or capture salient properties of important concrete applications.
We are also interested in papers that include viewpoints that are new to the ALT community. We welcome experimental and algorithmic papers provided they are relevant to the focus of the conference by elucidating theoretical results, or by pointing out interesting and not well understood behavior that could stimulate theoretical analysis.
Format. The submitted paper should be no longer than 15 pages in the standard format for Springer-Verlag's Lecture Notes in Artificial Intelligence series. The 15 page limit includes title, abstract, acknowledgements, references, illustrations and any other parts of the paper; appendixes bypassing the page limit are not allowed.
Submission Mode. In a departure from previous years, this year the ALT reviewing process will be double blind. Authors should ensure that the submission does not include author names and affiliations. Acknowledgements should not be included in the submission version of the paper, and prior work by the authors should be referred to in the third person. Papers that do not satisfy these guidelines will not be reviewed.
Policy. Each submitted paper will be reviewed by the members of the programme committee and be judged on clarity, significance and originality. Joint submissions to other conferences with published proceedings are not allowed. Papers that have appeared in or are under review for journals or other conferences are not appropriate for ALT 2015. However, it is acceptable to submit to ALT work that has been made available as a technical report (or similar, e.g. on http://www.arxiv.org) without citing it.
Proceedings. All accepted papers will be published as a volume in the Lecture Notes in Artificial Intelligence, Springer-Verlag, and will be available at the conference. Full versions of selected papers of ALT 2015 will be invited to a special issue of the journal Theoretical Computer Science (Elsevier).
E.M. Gold Award. One scholarship of EUR 555 will be awarded to a student author of an excellent paper. Please mark student submissions on the title page. Note that this paper can be coauthored by other researchers.
|Full paper submission:||11 May 2015|
|Author notification:||26 June 2015|
|Camera-ready papers Due:||14 July 2015|
|Conference:||4–6 October 2015|
Submission. Submission. Authors can submit their papers electronically via our submission page through Easychair, which will be opened for submissions in April 2015.
Queries. For queries please contact the PC co-chairs via the email firstname.lastname@example.org