Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

Pauline Luc

dblp:190/7256 · DBLP profile ↗
← Back
9ranked-venue papers
2as first author
6since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 8 · 2 first-author · 5 since 2021Graphics, computer vision, multimedia, augmented reality and games · 6 · 2 first-author · 4 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
6 papers
Video understanding and tracking · 32% Language models and text generation · 17% Optimization for machine learning · 13%
Interdisciplinary, comprehensive, and emerging computing
1 paper
Medical and health informatics · 50% Environmental and earth informatics · 50%

Topics — the 18 heaviest of 20, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › Video understanding and tracking › video modeling
video foundation model
0.912025
SciVid: Cross-Domain Evaluation of Video Models in Scientific Applications · ICCV 2025
Machine learning › Transfer learning and domain adaptation › few-shot learning
cross-modal few-shot learning
0.612022
Flamingo: a Visual Language Model for Few-Shot Learning · NeurIPS 2022
Natural language and speech › Language models and text generation
in-context learning
0.612022
Flamingo: a Visual Language Model for Few-Shot Learning · NeurIPS 2022
Natural language and speech › Language models and text generation
multimodal language model
0.612022
Flamingo: a Visual Language Model for Few-Shot Learning · NeurIPS 2022
Computer vision › Vision and language
vision-language model
0.612022
Flamingo: a Visual Language Model for Few-Shot Learning · NeurIPS 2022
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning › self-supervised representation learning
multimodal self-supervised learning
0.512021
Broaden Your Views for Self-Supervised Video Learning · ICCV 2021
Computer vision › Video understanding and tracking
video representation learning
0.512021
Broaden Your Views for Self-Supervised Video Learning · ICCV 2021
Machine learning › Optimization for machine learning
hyperparameter optimization
0.412020
Fully Parallel Hyperparameter Search: Reshaped Space-Filling · ICML 2020
Machine learning › Optimization for machine learning › hyperparameter optimization
parallel hyperparameter optimization
0.412020
Fully Parallel Hyperparameter Search: Reshaped Space-Filling · ICML 2020
Computer vision › Video understanding and tracking › video instance segmentation
future instance segmentation
0.312018
Predicting Future Instance Segmentation by Forecasting Convolutional Features · ECCV (9) 2018
Computer vision › Segmentation and scene understanding › video segmentation
future semantic segmentation prediction
0.312017
Predicting Deeper into the Future of Semantic Segmentation · ICCV 2017
Computer vision › Segmentation and scene understanding
semantic segmentation
0.312017
Predicting Deeper into the Future of Semantic Segmentation · ICCV 2017
Computer vision › Video understanding and tracking
video prediction
0.312017
Predicting Deeper into the Future of Semantic Segmentation · ICCV 2017
Environmental and earth informatics
weather forecasting
0.312025
SciVid: Cross-Domain Evaluation of Video Models in Scientific Applications · ICCV 2025
Computer vision › Vision and language
visual question answering
0.212022
Flamingo: a Visual Language Model for Few-Shot Learning · NeurIPS 2022
Computer vision › Video understanding and tracking
video classification
0.112021
Broaden Your Views for Self-Supervised Video Learning · ICCV 2021
Machine learning › Generative modeling › generative adversarial network
GAN training
0.112020
Fully Parallel Hyperparameter Search: Reshaped Space-Filling · ICML 2020
Computer vision › Segmentation and scene understanding
instance segmentation
0.112018
Predicting Future Instance Segmentation by Forecasting Convolutional Features · ECCV (9) 2018

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

trainable readout modules · 1.7pretrained video foundation models · 1.7pretrained vision encoder · 0.6pre-trained language model · 0.6interleaved multimodal pretraining · 0.6multi-view learning · 0.5contrastive learning · 0.5latin hypercube sampling · 0.4jittered sampling · 0.4cauchy transformation · 0.4
YearPublicationVenuePosition
2025 SciVid: Cross-Domain Evaluation of Video Models in Scientific Applications
abstract
In recent years, there has been a proliferation of spatiotemporal foundation models in different scientific disciplines. While promising, these models are often domain-specific and are only assessed within the particular applications for which they are designed. Given that many tasks can be represented as video modeling problems, video foundation models (ViFMs) hold considerable promise as general-purpose domain-agnostic approaches. However, it is not known whether the knowledge acquired on large-scale but potentially out-of-domain data can be effectively transferred across diverse scientific disciplines, and if a single, pretrained ViFM can be competitive with domain-specific baselines. To address this, we introduce SciVid, a comprehensive benchmark comprising five *Sci*entific *Vid*eo tasks, across medical computer vision, animal behavior, and weather forecasting. We adapt six leading ViFMs to SciVid using simple trainable readout modules, establishing strong baselines and demonstrating the potential for effective transfer learning. Specifically, we show that state-of-the-art results can be obtained in several applications by leveraging the general-purpose representations from ViFM backbones. Furthermore, our results reveal the limitations of existing ViFMs, and highlight opportunities for the development of generalizable models for high-impact scientific applications. We release our code at https://github.com/google-deepmind/scivid to facilitate further research in the development of ViFMs.
Yana Hasson, Pauline Luc, Liliane Momeni, Maks Ovsjanikov, Guillaume Le Moing, Alina Kuznetsova, Ira Ktena, Jennifer J. Sun, Skanda Koppula, Dilara Gokay, Joseph Heyward, Etienne Pot, Andrew Zisserman
ICCV2
2024 BootsTAP: Bootstrapped Training for Tracking-Any-Point
Carl Doersch, Pauline Luc, Yi Yang 0007, Dilara Gokay, Skanda Koppula, Ankush Gupta 0001, Joseph Heyward, Ignacio Rocco, Ross Goroshin, João Carreira 0001, Andrew Zisserman
ACCV (2)2
2022 Towards Learning Universal Audio Representations
abstract
The ability to learn universal audio representations that can solve diverse speech, music, and environment tasks can spur many applications that require general sound content understanding. In this work, we introduce a holistic audio representation evaluation suite (HARES) spanning 12 downstream tasks across audio domains and provide a thorough empirical study of recent sound representation learning systems on that benchmark. We discover that previous sound event classification or speech models do not generalize outside of their domains. We observe that more robust audio representations can be learned with the SimCLR objective; however, the model’s transferability depends heavily on the model architecture. We find the Slowfast architecture is good at learning rich representations required by different domains, but its performance is affected by the normalization scheme. Based on these findings, we propose a novel normalizer-free Slowfast NFNet and achieve state-of-the-art performance across all domains.
Luyu Wang, Pauline Luc, Yan Wu 0010, Adrià Recasens, Lucas Smaira, Andrew Brock, Andrew Jaegle, Jean-Baptiste Alayrac, Sander Dieleman, João Carreira 0001, Aäron van den Oord
ICASSP2
2022 Flamingo: a Visual Language Model for Few-Shot Learning
abstract
Building models that can be rapidly adapted to novel tasks using only a handful of annotated examples is an open challenge for multimodal machine learning research. We introduce Flamingo, a family of Visual Language Models (VLM) with this ability. We propose key architectural innovations to: (i) bridge powerful pretrained vision-only and language-only models, (ii) handle sequences of arbitrarily interleaved visual and textual data, and (iii) seamlessly ingest images or videos as inputs. Thanks to their flexibility, Flamingo models can be trained on large-scale multimodal web corpora containing arbitrarily interleaved text and images, which is key to endow them with in-context few-shot learning capabilities. We perform a thorough evaluation of our models, exploring and measuring their ability to rapidly adapt to a variety of image and video tasks. These include open-ended tasks such as visual question-answering, where the model is prompted with a question which it has to answer, captioning tasks, which evaluate the ability to describe a scene or an event, and close-ended tasks such as multiple-choice visual question-answering. For tasks lying anywhere on this spectrum, a single Flamingo model can achieve a new state of the art with few-shot learning, simply by prompting the model with task-specific examples. On numerous benchmarks, Flamingo outperforms models fine-tuned on thousands of times more task-specific data.
Jean-Baptiste Alayrac, Jeff Donahue, Pauline Luc, Antoine Miech, Iain Barr, Yana Hasson, Karel Lenc, Arthur Mensch, Katherine Millican, Malcolm Reynolds, Roman Ring, Eliza Rutherford, Serkan Cabi, Tengda Han, Zhitao Gong, Sina Samangooei, Marianne Monteiro, Jacob L. Menick, Sebastian Borgeaud, Andrew Brock, Aida Nematzadeh, Sahand Sharifzadeh, Mikolaj Binkowski, Ricardo Barreira, Oriol Vinyals, Andrew Zisserman, Karen Simonyan
NeurIPS3
2021 Broaden Your Views for Self-Supervised Video Learning
abstract
Most successful self-supervised learning methods are trained to align the representations of two independent views from the data. State-of-the-art methods in video are inspired by image techniques, where these two views are similarly extracted by cropping and augmenting the resulting crop. However, these methods miss a crucial element in the video domain: time. We introduce BraVe, a self-supervised learning framework for video. In BraVe, one of the views has access to a narrow temporal window of the video while the other view has a broad access to the video content. Our models learn to generalise from the narrow view to the general content of the video. Furthermore, BraVe processes the views with different backbones, enabling the use of alternative augmentations or modalities into the broad view such as optical flow, randomly convolved RGB frames, audio or their combinations. We demonstrate that BraVe achieves state-of-the-art results in self-supervised representation learning on standard video and audio classification benchmarks including UCF101, HMDB51, Kinetics, ESC-50 and AudioSet.
Adrià Recasens, Pauline Luc, Jean-Baptiste Alayrac, Luyu Wang, Florian Strub, Corentin Tallec, Mateusz Malinowski, Viorica Patraucean, Florent Altché, Michal Valko, Jean-Bastien Grill, Aäron van den Oord, Andrew Zisserman
ICCV2
2021 Game Plan: What AI can do for Football, and What Football can do for AI
abstract
The rapid progress in artificial intelligence (AI) and machine learning has opened unprecedented analytics possibilities in various team and individual sports, including baseball, basketball, and tennis. More recently, AI techniques have been applied to football, due to a huge increase in data collection by professional teams, increased computational power, and advances in machine learning, with the goal of better addressing new scientific challenges involved in the analysis of both individual players’ and coordinated teams’ behaviors. The research challenges associated with predictive and prescriptive football analytics require new developments and progress at the intersection of statistical learning, game theory, and computer vision. In this paper, we provide an overarching perspective highlighting how the combination of these fields, in particular, forms a unique microcosm for AI research, while offering mutual benefits for professional teams, spectators, and broadcasters in the years to come. We illustrate that this duality makes football analytics a game changer of tremendous value, in terms of not only changing the game of football itself, but also in terms of what this domain can mean for the field of AI. We review the state-of-the-art and exemplify the types of analysis enabled by combining the aforementioned fields, including illustrative examples of counterfactual analysis using predictive models, and the combination of game-theoretic analysis of penalty kicks with statistical learning of player attributes. We conclude by highlighting envisioned downstream impacts, including possibilities for extensions to other sports (real and virtual).
Karl Tuyls, Shayegan Omidshafiei, Paul Muller, Zhe Wang 0055, Jerome T. Connor, Daniel Hennes, Ian Graham, William Spearman, Tim Waskett, Dafydd Steele, Pauline Luc, Adrià Recasens, Alexandre Galashov, Gregory Thornton, Romuald Elie, Pablo Sprechmann, Pol Moreno, Kris Cao, Marta Garnelo, Praneet Dutta, Michal Valko, Nicolas Heess, Alex Bridgland, Julien Pérolat, Bart De Vylder, S. M. Ali Eslami, Mark Rowland 0001, Andrew Jaegle, Rémi Munos, Trevor Back, Razia Ahamed, Simon Bouton, Nathalie Beauguerlange, Jackson Broshear, Thore Graepel, Demis Hassabis
J. Artif. Intell. Res.11
2020 Fully Parallel Hyperparameter Search: Reshaped Space-Filling
abstract
Space-filling designs such as Low Discrepancy Sequence (LDS), Latin Hypercube Sampling (LHS) and Jittered Sampling (JS) were proposed for fully parallel hyperparameter search, and were shown to be more effective than random and grid search. We prove that LHS and JS outperform random search only by a constant factor. Consequently, we introduce a new sampling approach based on the reshaping of the search distribution, and we show both theoretically and numerically that it leads to significant gains over random search. Two methods are proposed for the reshaping: Recentering (when the distribution of the optimum is known), and Cauchy transformation (when the distribution of the optimum is unknown). The proposed methods are first validated on artificial experiments and simple real-world tests on clustering and Salmon mappings. Then we demonstrate that they drive performance improvement in a wide range of expensive artificial intelligence tasks, namely attend/infer/repeat, video next frame segmentation forecasting and progressive generative adversarial networks.
Marie-Liesse Cauwet, Camille Couprie, Julien Dehos, Pauline Luc, Jérémy Rapin, Morgane Rivière, Fabien Teytaud, Olivier Teytaud, Nicolas Usunier
ICML4
2018 Predicting Future Instance Segmentation by Forecasting Convolutional Features
Pauline Luc, Camille Couprie, Yann LeCun, Jakob Verbeek
ECCV (9)1
2017 Predicting Deeper into the Future of Semantic Segmentation
abstract
The ability to predict and therefore to anticipate the future is an important attribute of intelligence. It is also of utmost importance in real-time systems, e.g. in robotics or autonomous driving, which depend on visual scene understanding for decision making. While prediction of the raw RGB pixel values in future video frames has been studied in previous work, here we introduce the novel task of predicting semantic segmentations of future frames. Given a sequence of video frames, our goal is to predict segmentation maps of not yet observed video frames that lie up to a second or further in the future. We develop an autoregressive convolutional neural network that learns to iteratively generate multiple frames. Our results on the Cityscapes dataset show that directly predicting future segmentations is substantially better than predicting and then segmenting future RGB frames. Prediction results up to half a second in the future are visually convincing and are much more accurate than those of a baseline based on warping semantic segmentations using optical flow.
Pauline Luc, Natalia Neverova, Camille Couprie, Jakob Verbeek, Yann LeCun
ICCV1