Keynote talk by Tomas Mikolov
Keynote talk by Tomas Mikolov
Complexity and simplicity in machine learning
Complexity and simplicity in machine learning
Czech Institute of Informatics, Robotics and Cybernetics
In this talk, I will argue that many phenomena studied in machine learning and natural language processing may be byproducts derived from simpler, more fundamental principles. There will never be a complete list of all rules in a given language, nor a complete list of objects or relationships. The language itself would better be viewed as an evolving, ever-changing complex system. This should be reflected in the machine learning models we use to describe it.
This talk will be given live during the GeCKo symposium (May 18th; 14:30, UTC+2). In order to watch it and participate in the discussion, you will need to register.