LxMLS 2017 will take place July 20-27 at Instituto Superior Técnico (IST), a leading Engineering and Science school in Portugal. It is organized jointly by IST, the Instituto de Telecomunicações, the Instituto de Engenharia de Sistemas e Computadores, Investigação e Desenvolvimento em Lisboa (INESC-ID), Unbabel, and Priberam Labs.
Click here for information about past editions (LxMLS 2011, LxMLS 2012, LxMLS 2013, LxMLS 2014, LxMLS 2015, LxMLS 2016) and to watch the videos of the lectures (2011, 2012, 2013, 2014).
Our target audience is:
Researchers and graduate students in the fields of NLP and Computational Linguistics;
Computer scientists who have interests in statistics and machine learning;
Industry practitioners who desire a more in depth understanding of these subjects.
Features of LxMLS:
No deep previous knowledge of ML or NLP is required, but the attendants are assumed to have at least some basic background on probabilities and programming;
Recommended reading is provided one month in advance, see the labs guide of 2016 as reference;
Includes a strong practical component;
A day zero is scheduled to review basic concepts and introduce the necessary tools for implementation exercises;
Days will be divided into tutorials and practical sessions (see schedule);
Both basic (e.g linear classifiers) and advanced topics (e.g. deep learning) will be covered;
Instructors are leading researchers in machine learning. More Information..
Instituto Superior Técnico, Lisbon, Room P9, Mathematics Building, Friday, June 30th, 15:00h
Quantum searches are used to localize a specific element within the Hilbert space. Usually such element is a base state, or a small subspace of the Hilbert space. We expand this set by searching for a path in a maze between two specific vertices using quantum walks. A particular type of maze we use is a chain of connected stars. We show, that having M stars, each of them containing N spikes, we can find the whole path in O(M N^1/2) steps. Standard choice of the initial state in a large, albeit phase-modulated superposition leads to the usual Grover search. However, such state is usually hard to prepare and a choice of a ocalized state is preferred. In such case we show, that it is possible to find the path with the same efficiency (up to a multiplicative constant) successively, by starting on the first star and uncovering successive stars by short searches of O(N^1/2) steps.
Quantum Computation and Information Seminar
Support: Phys-Info (IT), SQIG (IT) and CAMGSD, with support from FCT and FEDER, namely via the Doctoral Programme in the Physics and Mathematics of Information (DP-PMI), and projects UID/EEA/50008/2013, QuNet, ProQuNet, and NQuN. More Information..