BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//hackathonmaxxing//EN
CALSCALE:GREGORIAN
X-WR-CALNAME:Hackathons in New York
BEGIN:VEVENT
UID:luma:evt-teNgbSnTHezHnrA@hackathonmaxxing
DTSTAMP:20261122T162751Z
DTSTART:20261203T220000Z
DTEND:20261204T010000Z
SUMMARY:AI/ML Lecture & Networking @ Intuit
URL:https://lu.ma/fh6d4yil?utm_source=hackathonmaxxing&utm_medium=referral&utm_campaign=new-york
LOCATION:Intuit Inc\, New York\, NY
DESCRIPTION:A monthly ML research colloquium by the New York Machine Learning Research Guild — this session in collaboration with our partner\, Intuit.\n\nLong Context and Retrieval\n\nRohun Agrawal · PhD Candidate\, Computer Science\, Columbia University · NSF Graduate Research Fellow\n\nLeon Li · PhD Candidate\, Computer Science\, NYU Courant · Modal\n\nTopic: Advances in Architectures for Long Context and Retrieval\n\nLong-context inference is bottlenecked by the growing KV cache\, in both memory and latency. However\, existing KV cache compression methods either lose accuracy or must prefill the entire context before they can compress it. We introduce Latent Context Language Models (LCLMs)\, a family of encoder-decoder compressors trained end-to-end at scale that map long inputs to a short sequence of latent tokens before the decoder consumes them. LCLMs establish a new Pareto frontier in accuracy versus latency and memory over KV cache compression\, while unlocking new capabilities such as agents that skim a compressed context and expand relevant segments on demand\, and nearly lossless online compaction of the model's own outputs during generation. For grounding language models in large document corpora\, Retrieval-Augmented Generation (RAG) is the ubiquitous solution\, yet it relies on a brittle lookup that can't be trained end-to-end and slows generation by prefilling long contexts. We introduce Retrieval Layers\, learnable sparse cross-attention layers that retrieve external text in latent space and Pareto-dominate RAG on accuracy versus latency.\n\nAbout Rohun\n\nRohun Agrawal is a PhD candidate in computer science at Columbia University\, co-advised by Micah Goldblum and Pavel Izmailov\, and an NSF Graduate Research Fellow. Rohun's research pushes the temporal horizons of machine learning models: extending the future horizon through planning with world models\, and the past horizon through efficient large-scale memory retrieval.\n\nRecent work includes\n\nClosing the train–test gap in world models fo https://lu.ma/fh6d4yil?utm_source=hackathonmaxxing&utm_medium=referral&utm_campaign=new-york
END:VEVENT
END:VCALENDAR
