Luke Friedman

dblp:45/8727 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3Artificial intelligence and machine learning · 2 · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Representation and self-supervised learning · 71% Video understanding and tracking · 18% Vision and language · 5%
Theoretical computer science
2 papers
Computational complexity · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
masked autoencoder
1.522024
Extending Video Masked Autoencoders to 128 frames · NeurIPS 2024
VideoPrism: A Foundational Visual Encoder for Video Understanding · ICML 2024
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning › masked autoencoder
video masked autoencoder
1.522024
Extending Video Masked Autoencoders to 128 frames · NeurIPS 2024
VideoPrism: A Foundational Visual Encoder for Video Understanding · ICML 2024
Computer vision › Video understanding and tracking
video representation learning
0.812024
VideoPrism: A Foundational Visual Encoder for Video Understanding · ICML 2024
Computational complexity › algorithmic randomness
random strings
0.322013
Limits on the computational power of random strings · Inf. Comput. 2013
Limits on the Computational Power of Random Strings · ICALP (1) 2011
Machine learning › Efficient and distributed learning › token reduction
token downsampling
0.212024
Extending Video Masked Autoencoders to 128 frames · NeurIPS 2024
Computer vision › Vision and language › vision-language pretraining
video-language pre-training
0.212024
VideoPrism: A Foundational Visual Encoder for Video Understanding · ICML 2024
Computational complexity
resource-bounded computation
0.212013
Limits on the computational power of random strings · Inf. Comput. 2013
Computational complexity
kolmogorov complexity
0.012013
Limits on the computational power of random strings · Inf. Comput. 2013

Methods — techniques the papers use, named apart from their topics

tokenizer · 0.8token shuffling · 0.8masked autoencoding · 0.8masked autoencoder · 0.8global-local distillation · 0.8adaptive masking · 0.8
YearPublicationVenuePosition
2024 VideoPrism: A Foundational Visual Encoder for Video Understanding
abstract
We introduce VideoPrism, a general-purpose video encoder that tackles diverse video understanding tasks with a single frozen model. We pretrain VideoPrism on a heterogeneous corpus containing 36M high-quality video-caption pairs and 582M video clips with noisy parallel text (e.g., ASR transcripts). The pretraining approach improves upon masked autoencoding by global-local distillation of semantic video embeddings and a token shuffling scheme, enabling VideoPrism to focus primarily on the video modality while leveraging the invaluable text associated with videos. We extensively test VideoPrism on four broad groups of video understanding tasks, from web video question answering to CV for science, achieving state-of-the-art performance on 31 out of 33 video understanding benchmarks.
Long Zhao 0003, Nitesh Bharadwaj Gundavarapu, Liangzhe Yuan, Hao Zhou 0014, Shen Yan 0008, Jennifer J. Sun, Luke Friedman, Rui Qian 0003, Tobias Weyand, Yue Zhao 0006, Rachel Hornung, Florian Schroff, Ming-Hsuan Yang 0001, David A. Ross, Huisheng Wang, Hartwig Adam, Mikhail Sirotenko, Ting Liu 0005, Boqing Gong
ICML7
2024 Extending Video Masked Autoencoders to 128 frames
abstract
Video understanding has witnessed significant progress with recent video foundation models demonstrating strong performance owing to self-supervised pre-training objectives; Masked Autoencoders (MAE) being the design of choice. Nevertheless, the majority of prior works that leverage MAE pre-training have focused on relatively short video representations (16 / 32 frames in length) largely due to hardware memory and compute limitations that scale poorly with video length due to the dense memory-intensive self-attention decoding. One natural strategy to address these challenges is to subsample tokens to reconstruct during decoding (or decoder masking). In this work, we propose an effective strategy for prioritizing tokens which allows training on longer video sequences (128 frames) and gets better performance than, more typical, random and uniform masking strategies. The core of our approach is an adaptive decoder masking strategy that prioritizes the most important tokens and uses quantized tokens as reconstruction objectives. Our adaptive strategy leverages a powerful MAGVIT-based tokenizer that jointly learns the tokens and their priority. We validate our design choices through exhaustive ablations and observe improved performance of the resulting long-video (128 frames) encoders over short-video (32 frames) counterparts. With our long-video masked autoencoder (LVMAE) strategy, we surpass state-of-the-art on Diving48 by 3.9 points and EPIC-Kitchens-100 verb classification by 2.5 points while relying on a simple core architecture and video-only pre-training (unlike some of the prior works that require millions of labeled video-text pairs or specialized encoders).
Nitesh Bharadwaj Gundavarapu, Luke Friedman, Raghav Goyal, Chaitra Hegde, Eirikur Agustsson, Sagar Waghmare, Mikhail Sirotenko, Ming-Hsuan Yang 0001, Tobias Weyand, Boqing Gong, Leonid Sigal
NeurIPS2
2013 Limits on the computational power of random strings
Eric Allender, Luke Friedman, William I. Gasarch
Inf. Comput.2
2012 Reductions to the Set of Random Strings: The Resource-Bounded Case
Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff
MFCS3
2011 Limits on the Computational Power of Random Strings
Eric Allender, Luke Friedman, William I. Gasarch
ICALP (1)2