Demo Data from VLDB 2026 / reviewers in the wild / expert
Peter Ebert Christensen
dblp:256/5458
· DBLP profile ↗
4ranked-venue papers
1as first author
3since 2021 · last 2025
0000-0003-1061-1609ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author · 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.
| Software engineering, system software, and programming languages
1 paper |
Program synthesis and code generation · 50% Debugging and program repair · 50% | |
| Artificial intelligence
1 paper |
Deep learning architectures and training · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Debugging and program repair
automated program repair |
0.4 | 1 | 2020 | Synthesize, Execute and Debug: Learning to Repair for Neural Program Synthesis · NeurIPS 2020 |
Program synthesis and code generation
neural program synthesis |
0.4 | 1 | 2020 | Synthesize, Execute and Debug: Learning to Repair for Neural Program Synthesis · NeurIPS 2020 |
Methods — techniques the papers use, named apart from their topics
neural program synthesis · 0.9neural program debugger · 0.9beam search · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A Template Is All You MemeabstractLuke Bates, Peter Ebert Christensen, Preslav Nakov, Iryna Gurevych. Proceedings of the 2025 Conference of the Nations of the Americas Chapter of the Association for Computational Linguistics: Human Language Technologies (Volume 1: Long Papers). 2025. Luke Bates, Peter Ebert Christensen, Preslav Nakov, Iryna Gurevych |
NAACL (Long Papers) | 2 |
| 2024 | Volumetric Disentanglement for 3D Scene ManipulationabstractRecently, advances in differential volumetric rendering enabled significant breakthroughs in the photo-realistic and fine-detailed reconstruction of complex 3D scenes, which is key for many virtual reality applications. However, in the context of augmented reality, one may also wish to effect semantic manipulations or augmentations of objects within a scene. To this end, we propose a volumetric framework for (i) disentangling or separating, the volumetric representation of a given foreground object from the background, and (ii) semantically manipulating the foreground object, as well as the background. Our framework takes as input a set of 2D masks specifying the desired foreground object for training views, together with the associated 2D views and poses, and produces a foreground-background disentanglement that respects the surrounding illumination, reflections, and partial occlusions, which can be applied to both training and novel views. Our method enables the separate control of pixel color and depth as well as 3D similarity transformations of both the foreground and background objects. We subsequently demonstrate our framework’s applicability on several downstream manipulation tasks, going beyond the placement and movement of foreground objects. These tasks include object camouflage, non-negative 3D object in-painting, 3D object translation, 3D object inpainting, and 3D text-based object manipulation. The project webpage is provided in https://sagiebenaim.github.io/volumetric-disentanglement/. Sagie Benaim, Frederik Warburg, Peter Ebert Christensen, Serge J. Belongie |
WACV | 3 |
| 2024 | Assessing Neural Network Robustness via Adversarial Pivotal TuningabstractThe robustness of image classifiers is essential to their deployment in the real world. The ability to assess this resilience to manipulations or deviations from the training data is thus crucial. These modifications have traditionally consisted of minimal changes that still manage to fool classifiers, and modern approaches are increasingly robust to them. Semantic manipulations that modify elements of an image in meaningful ways have thus gained traction for this purpose. However, they have primarily been limited to style, color, or attribute changes. While expressive, these manipulations do not make use of the full capabilities of a pretrained generative model. In this work, we aim to bridge this gap. We show how a pretrained image generator can be used to semantically manipulate images in a detailed, diverse, and photorealistic way while still preserving the class of the original image. Inspired by recent GAN-based image inversion methods, we propose a method called Adversarial Pivotal Tuning (APT). Given an image, APT first finds a pivot latent space input that reconstructs the image using a pretrained generator. It then adjusts the generator’s weights to create small yet semantic manipulations in order to fool a pretrained classifier. APT preserves the full expressive editing capabilities of the generative model. We demonstrate that APT is capable of a wide range of class-preserving semantic image manipulations that fool a variety of pretrained classifiers. Finally, we show that classifiers that are robust to other benchmarks are not robust to APT manipulations and suggest a method to improve them. Peter Ebert Christensen, Vésteinn Snæbjarnarson, Andrea Dittadi, Serge J. Belongie, Sagie Benaim |
WACV | 1 |
| 2020 | Synthesize, Execute and Debug: Learning to Repair for Neural Program SynthesisabstractThe use of deep learning techniques has achieved significant progress for program synthesis from input-output examples. However, when the program semantics become more complex, it still remains a challenge to synthesize programs that are consistent with the specification. In this work, we propose SED, a neural program generation framework that incorporates synthesis, execution, and debugging stages. Instead of purely relying on the neural program synthesizer to generate the final program, SED first produces initial programs using the neural program synthesizer component, then utilizes a neural program debugger to iteratively repair the generated programs. The integration of the debugger component enables SED to modify the programs based on the execution results and specification, which resembles the coding process of human programmers. On Karel, a challenging input-output program synthesis benchmark, SED reduces the error rate of the neural program synthesizer itself by a considerable margin, and outperforms the standard beam search for decoding. Kavi Gupta, Peter Ebert Christensen, Dawn Song |
NeurIPS | 2 |