ANNOUNCEMENT

NOBEL PRIZE 2026

This year's laureates, their fields, and the discoveries that earned them the prize.Live nowSee the winners
Moonbase
← Back to Awards
NSFDirectorate for Computer and Information Science and Engineering

CAREER: Efficient Architectures and Algorithms for Language Modeling

Active
Institution
Massachusetts Institute of Technology, MA
Principal investigator
Yoon H Kim
Funding
$600K
Duration
2025–2030
Open portfolio

Moonbase score

Still being scored

Abstract

Large language models (LLMs) have led to significant progress in natural language processing (NLP) and artificial intelligence more broadly, and have the potential to become a broad technology with applications across myriad domains. However, current LLMs rely on computationally expensive architectures and algorithms. This CAREER project aims to develop new methods for efficient, architecture-aware algorithms for language modeling that is expected to make existing LLM applications more efficient, enable new applications, and broaden access. To achieve these goals, this project will develop new methods that span the entire training and deployment pipeline, including: (1) architectural primitives that can overcome the computational inefficiencies transformers, (2) efficient training algorithms that will reduce the amount of resources required to train and finetune LMs, and (3) quantization algorithms along with flexible kernels that can better utilize the computational resources of modern hardware. This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.

LOADING MOONBASE SCORE

Directorate for Computer and Information Science and EngineeringCAREER-Faculty Erly Career DevRobust IntelligenceROBUST INTELLIGENCEefficientlanguagearchitecturesalgorithmstransformersnew methodslmsllms

Questions for Massachusetts Institute of Technology

Answered by the team behind this research.

Same institution, same topic, scored first.