Adrian de Wynter
.
I am a principal applied scientist at Microsoft and a researcher (PGR) at the University of York. I work in projects related to natural language understanding/generation and fundamental problems in deep learning, such as reasoning and formal modelling of dialogue, like LLMs.
My primary interest is computation, and specifically, the study of reasoning as it relates to humans and machines. My approach is mainly intuitionistic in nature, contrasting with some other formalisms used in this field. In English: algorithms have provable guarantees of complexity and convergence via construction, and this proof must be closely-related to a computable (e.g., realistic, decidable, production) scenario. This gives meaningful answers about complex problems, while also circumventing mathematical results that are rarely seen in practice. For example, we recently used category theory to prove that some prompting strategies are objectively better than others; and that they would produce more preferrable outcomes by users.
I'm a strong proponent of training small and efficient models, as opposed to overspecified networks--which I call Jurassic networks. This matters! The power required to train these models translates into tons of carbon emitted into the atmosphere, and it's devastating to the environment. Although I showed that finding a globally optimal solution to this problem is generally undecidable, I have also proved that it is possible to find approximation algorithms that give near-optimal solutions in polynomial time--going as far as applying these results to BERT and reaching a (then) state-of-the-art on model compression. This last contribution was later adapted for quantum circuit optimization in a rather fantastic work by folks at ORNL.
Other of my research interests are related to recreational mathematics (especially about games), preserving endangered languages, and applications of LLMs to create inclusive environments to traditionally excluded groups in ML (e.g., neurodiverse individuals such as myself, non-English speakers, etcetera).
Last updated: Aug '24.
I've found it useful to have a series of "posts" on the work I do, to make it more accessible and share my passion for mathematics, especially since I don't have any social media (does LinkedIn count?)
I'm absolutely terrible at updating this site (record: 2 years), so bear with me.
Following Larry Wasserman's essay, I invite comments on the papers below. Feel free to email me.
For a longer, complete list of works see here.
For how to handle my last name's weird spelling rules, see here.
Some media coverage of the work I do, in case my posts remain as confusing as the original papers.
Contact: first-initial-full-last-name-including-tussenvoegsel (at) microsoft.com
Factoid: my ORCID (326797241) is a prime number; it is expressible as the sum of two squares (1715 and 17996); and it is the square root (hypothenuse) of the sum of two squares (61726280 and 320914791). Yay.