Events
Bayesian design principles for frequentist sequential learning
ESD Research Seminar by Yunbei Xu – We develop a general theory to optimise the frequentist regret for sequential learning problems, where efficient bandit and reinforcement learning algorithms can be derived from unified Bayesian principles.
Need to relax – but perhaps later? Reflections on modelling sparsity and mixed-binary nonconvex optimisation problems
ESD Research Seminar by Immanuel M. Bomze – This talk will advocate the necessity of research efforts in the quest for global solutions and strong rigorous bounds for quality guarantees, showcased on one of the nowadays most popular domains – cardinality-constrained models.
Quantum machine learning: What’s happening, what’s hard, and what’s next
ESD Research Seminar by Kishor Bharti – This talk will provide an introduction to quantum machine learning, a summary of its current status, the challenges it faces, and what lies ahead.
Exploration and optimisation of black-box functions with safety guarantees
ESD Research Seminar by Jonathan Scarlett – The exploration and optimisation of black-box functions is of broad interest in domains such as hyperparameter tuning, robotics, scientific discovery, and more.
Quantum algorithms and their applications in finance
ESD Research Seminar by Alessandro Luongo – This talk will explore new quantum algorithms and the challenges they face in real-world applications of quantum computing.
Learning and solving games in the presence of teams
ESD Research Seminar by Ling Chun Kai – One challenge in multiagent environments is the presence of teams — groups of agents acting in a coordinated fashion that distinguish themselves from individuals. This talk touches on two situations where teams are prevalent.
Weighted fair division: Additive preferences and beyond
ESD Research Seminar by Warut Suksompong – Fair resource allocation is a fundamental problem in society, with applications ranging from inheritance division to ministry allocation. While the fair division literature typically assumes that all agents have the same entitlement to the resource, several practical applications involve agents with varying entitlements represented by weights.
It’s all in the mix: Wasserstein machine learning with mixed features
ESD Research Seminar by Aras Selvi – This work demonstrates that mixed-feature problems can indeed be solved in polynomial time.
The fundamental theorem of normal play
ESD Research Seminar by Urban Larsson – Combinatorial Game Theory is the branch of Mathematics and Computer Science that studies two-player games with perfect and complete information; there is no chance, and there are no hidden moves.
Near-field communications: What will be different?
ESD Research Seminar by Yuanwei Liu – The design dilemma of “What will be different between near-field communications (NFC) and far-field communications (FFC)?” is discussed from four perspectives in this talk.
