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.
? Tutorial for this page

Marc Szafraniec

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

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

Artificial intelligence and machine learning · 6 · 2 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 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
3 papers
Representation and self-supervised learning · 59% Vision and language · 22% 3D vision · 11%
Software engineering, system software, and programming languages
2 papers
Program synthesis and code generation · 88% Program analysis · 12%
Computer graphics and multimedia
1 paper
Geometric modeling and processing · 100%

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

TopicWeightPapersLastEvidence papers
Computer vision › Vision and language
cross-modal alignment
0.912025
DINOv2 Meets Text: A Unified Framework for Image- and Pixel-Level Vision-Language Alignment · CVPR 2025
Machine learning › Representation and self-supervised learning › representation learning › visual representation learning
vision foundation model
0.912025
DINOv2 Meets Text: A Unified Framework for Image- and Pixel-Level Vision-Language Alignment · CVPR 2025
Machine learning › Representation and self-supervised learning › representation learning › embedding learning › joint embedding
joint embedding architecture
0.812024
You Don't Need Domain-Specific Data Augmentations When Scaling Self-Supervised Learning · NeurIPS 2024
Program synthesis and code generation
code translation
0.712023
Code Translation with Compiler Representations · ICLR 2023
Program synthesis and code generation
code generation with language models
0.512021
DOBF: A Deobfuscation Pre-Training Objective for Programming Languages · NeurIPS 2021
Geometric modeling and processing › shape correspondence
dense correspondence
0.412020
Continuous Surface Embeddings · NeurIPS 2020
Machine learning › Efficient and distributed learning › efficient training
compute-constrained training
0.212024
You Don't Need Domain-Specific Data Augmentations When Scaling Self-Supervised Learning · NeurIPS 2024
Program analysis › program representation
source code representation
0.112021
DOBF: A Deobfuscation Pre-Training Objective for Programming Languages · NeurIPS 2021
Computer vision › Face, body and person analysis › human pose estimation › 3d pose estimation
dense pose estimation
0.112020
Continuous Surface Embeddings · NeurIPS 2020

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

contrastive learning · 1.6self-supervised learning · 1.3text encoder alignment · 0.9lit training · 0.9machine translation · 0.7compiler intermediate representation · 0.7masked language modeling · 0.5surface embeddings · 0.4surface embedding · 0.4
YearPublicationVenuePosition
2025 DINOv2 Meets Text: A Unified Framework for Image- and Pixel-Level Vision-Language Alignment
abstract
Self-supervised visual foundation models produce powerful embeddings that achieve remarkable performance on a wide range of downstream tasks. However, unlike vision-language models such as CLIP [67], self-supervised visual features are not readily aligned with language, hindering their adoption in open-vocabulary tasks. Our method, named dino.txt, unlocks this new ability for DINOv2 [63], a widely used self-supervised visual encoder. We build upon the LiT training strategy [97], which trains a text encoder to align with a frozen vision model but leads to unsatisfactory results on dense tasks. We propose several key ingredients to improve performance on both global and dense tasks, such as concatenating the [CLS] token with the patch average to train the alignment and curating data using both text and image modalities. With these, we successfully train a CLIP-like model with only a fraction of the computational cost compared to CLIP while achieving state-of-the-art results in zero-shot classification and open-vocabulary semantic segmentation.
Cijo Jose, Théo Moutakanni, Dahyun Kang, Federico Baldassarre, Timothée Darcet, Hu Xu 0001, Daniel Li 0006, Marc Szafraniec, Michaël Ramamonjisoa, Maxime Oquab, Oriane Siméoni, Huy V. Vo, Patrick Labatut, Piotr Bojanowski
CVPR8
2024 You Don't Need Domain-Specific Data Augmentations When Scaling Self-Supervised Learning
abstract
Self-Supervised learning (SSL) with Joint-Embedding Architectures (JEA) has led to outstanding performances. All instantiations of this paradigm were trained using strong and well-established hand-crafted data augmentations, leading to the general belief that they are required for the proper training and performance of such models. On the other hand, generative reconstruction-based models such as BEIT and MAE or Joint-Embedding Predictive Architectures such as I-JEPA have shown strong performance without using data augmentations except masking. In this work, we challenge the importance of invariance and data-augmentation in JEAs at scale. By running a case-study on a recent SSL foundation model -- DINOv2 -- we show that strong image representations can be obtained with JEAs and only cropping without resizing provided the training data is large enough, reaching state-of-the-art results and using the least amount of augmentation in the literature. Through this study, we also discuss the impact of compute constraints on the outcomes of experimental deep learning research, showing that they can lead to very different conclusions.
Théo Moutakanni, Maxime Oquab, Marc Szafraniec, Maria Vakalopoulou, Piotr Bojanowski
NeurIPS3
2023 Code Translation with Compiler Representations
Marc Szafraniec, Baptiste Rozière, Hugh Leather, Patrick Labatut, François Charton, Gabriel Synnaeve
ICLR1
2021 DOBF: A Deobfuscation Pre-Training Objective for Programming Languages
abstract
Recent advances in self-supervised learning have dramatically improved the state of the art on a wide variety of tasks. However, research in language model pre-training has mostly focused on natural languages, and it is unclear whether models like BERT and its variants provide the best pre-training when applied to other modalities, such as source code. In this paper, we introduce a new pre-training objective, DOBF, that leverages the structural aspect of programming languages and pre-trains a model to recover the original version of obfuscated source code. We show that models pre-trained with DOBF significantly outperform existing approaches on multiple downstream tasks, providing relative improvements of up to 12.2% in unsupervised code translation, and 5.3% in natural language code search. Incidentally, we found that our pre-trained model is able to deobfuscate fully obfuscated source files, and to suggest descriptive variable names.
Marie-Anne Lachaux, Baptiste Rozière, Marc Szafraniec, Guillaume Lample
NeurIPS3
2020 Continuous Surface Embeddings
abstract
In this work, we focus on the task of learning and representing dense correspondences in deformable object categories. While this problem has been considered before, solutions so far have been rather ad-hoc for specific object types (i.e., humans), often with significant manual work involved. However, scaling the geometry understanding to all objects in nature requires more automated approaches that can also express correspondences between related, but geometrically different objects. To this end, we propose a new, learnable image-based representation of dense correspondences. Our model predicts, for each pixel in a 2D image, an embedding vector of the corresponding vertex in the object mesh, therefore establishing dense correspondences between image pixels and 3D object geometry. We demonstrate that the proposed approach performs on par or better than the state-of-the-art methods for dense pose estimation for humans, while being conceptually simpler. We also collect a new in-the-wild dataset of dense correspondences for animal classes and demonstrate that our framework scales naturally to the new deformable object categories.
Natalia Neverova, David Novotný, Marc Szafraniec, Vasil Khalidov, Patrick Labatut, Andrea Vedaldi
NeurIPS3
2017 Putting Self-Supervised Token Embedding on the Tables
abstract
Information distribution by electronic messages is a privileged means of transmission for many businesses and individuals, often under the form of plain-text tables. As their number grows, it becomes necessary to use an algorithm to extract text and numbers instead of a human. Usual methods are focused on regular expressions or on a strict structure in the data, but are not efficient when we have many variations, fuzzy structure or implicit labels. In this paper we introduce SC2T, a totally self-supervised model for constructing vector representations of tokens in semi-structured messages by using characters and context levels that address these issues. It can then be used for an unsupervised labeling of tokens, or be the basis for a semi-supervised information extraction system.
Marc Szafraniec, Gautier Marti, Philippe Donnat
ICMLA1