Show Notes
Jonny Brooks-Bartlett, Senior machine learning engineer at Spotify, gives a talk on his experiences as a data scientist and as machine learning engineer in top rated companies around the world. It's been almost 4 years since I left academia to work as a data scientist in industry. In that time I've worked in several teams at a couple of companies. I've also spoken to many other data scientists and consulted literature to get a better picture of the current landscape. In this presentation I take you on my journey from the point at which I decided to become a data scientist to now becoming a senior machine learning engineer at a global music streaming service, Spotify. I'll describe the projects I've worked on and do a bit of a deep dive into a ranking system that I built whilst working at Deliveroo. Finally I'll discuss some observations that I have about data science in general that I hope will give a better idea about how data science works in industry and how it differs from what one might do in an academic setting.
Brief bio: Jonny Brooks-Bartlett is a senior machine learning engineer at Spotify working on improving the search experience for customers. Outside of work Jonny is a keen science communicator delivering public talks on science maths and AI. He also enjoys sports and taking part in functional fitness competitions
More from Department of Statistics
A lecture exploring alternatives to using labeled training data. Labeled training data is often scarce, unavailable, or can be very costly to obtain. To circumvent this problem, there is a growing interest in developing methods that can exploit sources of information other than labeled data, such as weak-supervision and zero-shot learning. While these techniques obtained impressive accuracy in practice, both for vision and language domains, they come with no theoretical characterization of their accuracy. In a sequence of recent works, we develop a rigorous mathematical framework for constructing and analyzing algorithms that combine multiple sources of related data to solve a new learning task. Our learning algorithms provably converge to models that have minimum empirical risk with respect to an adversarial choice over feasible labelings for a set of unlabeled data, where the feasibility of a labeling is computed through constraints defined by estimated statistics of the sources. Notably, these methods do not require the related sources to have the same labeling space as the multiclass classification task. We demonstrate the effectiveness of our approach with experimentations on various image classification tasks.
A high-level overview of key areas of AI ethics and not-ethics, exploring the challenges of algorithmic decision-making, kinds of bias, and interpretability, linking these issues to problems of human-system interaction. Much attention is now being focused on AI Ethics and Safety, with the EU AI Act and other emerging legislation being proposed to identify and curb "AI risks" worldwide. Are such ethical concerns unique to AI systems - and not just digital systems in general?
A brief introduction to various legal and procedural ethical concepts and their applications within and beyond academia. It's all very well to talk about truth, beauty and justice for academic research ethics. But how do you do these things at a practical level? If you have a big idea, or stumble across something with important implications, what do you do with it? How do you make sure you've got appropriate safeguards without drowning in bureaucracy?
David Steinsaltz gives a lecture on the ethical issues in statistics using historical examples.
This seminar explains and illustrates the approach of Markov melding for joint analysis. Integrating multiple sources of data into a joint analysis provides more precise estimates and reduces the risk of biases introduced by using only partial data. However, it can be difficult to conduct a joint analysis in practice. Instead each data source is typically modelled separately, but this results in uncertainty not being fully propagated. We propose to address this problem using a simple, general method, which requires only small changes to existing models and software. We first form a joint Bayesian model based upon the original submodels using a generic approach we call "Markov melding". We show that this model can be fitted in submodel-specific stages, rather than as a single, monolithic model. We also show the concept can be extended to "chains of submodels", in which submodels relate to neighbouring submodels via common quantities. The relationship to the "cut distribution" will also be discussed. We illustrate the approach using examples from an A/H1N1 influenza severity evidence synthesis; integrated population models in ecology; and modelling uncertain-time-to-event data in hospital intensive care units.