skip to content

Department of Computer Science and Technology

Read more at: Revisiting the Optimality of Word Lengths

Revisiting the Optimality of Word Lengths

Friday, 26 January, 2024 - 12:00 to 13:00

Zipf posited that wordforms are optimized to minimize utterances’ communicative costs. He supported this claim by showing that words’ lengths are inversely correlated with their frequencies. This correlation, however, is only expected if one assumes that a words’ communicative cost is given by its length. We explore this...


Read more at: Title to be confirmed

Title to be confirmed

Friday, 26 January, 2024 - 12:00 to 13:00

Abstract not available


Read more at: Faster Minimum Bayes Risk Decoding with Confidence-based Pruning

Faster Minimum Bayes Risk Decoding with Confidence-based Pruning

Friday, 19 January, 2024 - 12:00 to 13:00

Minimum Bayes risk (MBR) decoding outputs the hypothesis with the highest expected utility over the model distribution for some utility function. It has been shown to improve accuracy over beam search in conditional language generation problems and especially neural machine translation, in both human and automatic...


Read more at: Efficiency by Construction

Efficiency by Construction

Friday, 24 November, 2023 - 12:00 to 13:00

Across linguistic theories, human language structures are represented by graphs (e.g., Chomsky, 1957, Tesnière, 1959, Chomsky, 1995). Much research has focused on the mapping between such graphs and the actual sequences expressing utterances, but less attention has been paid to the shapes that the graphs themselves take...


Read more at: Collaborative Pretraining on Evolving Pretraining and Small Manageable Tasks

Collaborative Pretraining on Evolving Pretraining and Small Manageable Tasks

Friday, 20 October, 2023 - 12:00 to 13:00

Pretraining is monolithic. In this talk, I will discuss a collaborative approach to pertaining, by iterative model merging (originally fusing). We will then discuss making evaluation reliable and efficient, to allow anyone to evaluate. We might mention the BabyLM challenge, of pretraining models with human feasible amount...


Read more at: Fairness Evaluation in Generative NLP

Fairness Evaluation in Generative NLP

Friday, 1 December, 2023 - 12:00 to 13:00

The largest shifts in NLP over the past five years have been the shift to reliance on large pre-trained models (with the advent of the Transformer), followed by the shift to using generative rather than discriminative language models. These shifts each come with serious challenges for ensuring fairness in an NLP system...


Read more at: Avoiding AI's "Moore's Law": Why we are building a ladder to the moon

Avoiding AI's "Moore's Law": Why we are building a ladder to the moon

Friday, 3 November, 2023 - 15:00 to 16:00

An informal talk around LLM at scale, efficiency and open ML problems we are currently working on at Cohere For AI. I will present some background, some grumpy thoughts about how we can get away from the painfully inefficient formula of just scaling capacity. I'll plan on leaving plenty of time for discussion. Sara Hooker...


Read more at: Numerical Reasoning in Natural Language Processing

Numerical Reasoning in Natural Language Processing

Friday, 10 November, 2023 - 12:00 to 13:00

Numerical reasoning is a fundamental skill for language models to understand textual input in tasks such as text generation, question answering, and fact checking. The predominant approach for enhancing numerical reasoning has been scaling—larger models trained on more data tend to perform better on relevant benchmarks...


Read more at: Natural Language Processing for Text-to-Speech Synthesis

Natural Language Processing for Text-to-Speech Synthesis

Friday, 27 October, 2023 - 12:00 to 13:00

In this talk, we will cover the domain of text-to-speech synthesis with a focus on natural language processing. We will explore the challenges of NLP for TTS and look at some of the methods for overcoming these challenges. This talk is not heavily technical and does not require a background in computational linguistics...


Read more at: Title to be confirmed

Title to be confirmed

Friday, 17 November, 2023 - 12:00 to 13:00

Abstract not available