VLDB 2026 Research / reviewers in the wild / expert
Prafull Sharma
dblp:224/2474
· DBLP profile ↗
10ranked-venue papers
4as first author
7since 2021 · last 2026
0009-0000-2468-0088ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 8 · 3 first-author · 6 since 2021Graphics, computer vision, multimedia, augmented reality and games · 6 · 3 first-author · 5 since 2021Security and privacy · 1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Digital Red Queen: Adversarial Program Evolution in Core War with LLMsabstractLarge language models (LLMs) are increasingly used to evolve solutions to problems. However, most LLM-evolution frameworks solve static optimization problems, overlooking the open-ended adversarial dynamics that characterize real-world evolutionary processes. Here, we study Digital Red Queen (DRQ), a simple self-play algorithm that embraces these "Red Queen" dynamics via a changing objective. DRQ uses an LLM to evolve assembly programs (warriors) which compete for control of a virtual machine in the game of Core War, a Turing-complete environment studied in artificial life and connected to cybersecurity. In each round of DRQ, the model evolves a new warrior to defeat all previous ones. Over many rounds, warriors become increasingly general (relative to a set of held-out human warriors). Interestingly, across independent runs, we observe a convergence pressure toward a single generalpurpose behavioral strategy, much like convergent evolution in nature. Our work positions Core War as a rich, controllable sandbox for studying adversarial adaptation in artificial systems and for evaluating LLM-based evolution methods. More broadly, the simplicity and effectiveness of DRQ suggest that similarly minimal self-play approaches could prove useful in practical multi-agent adversarial domains, like real-world cybersecurity or combating drug resistance. Akarsh Kumar, Ryan Bahlous-Boldi, Prafull Sharma, Phillip Isola, Sebastian Risi, Yujin Tang, David Ha |
GECCO | 3 |
| 2025 | MARBLE: Material Recomposition and Blending in CLIP-SpaceabstractEditing materials of objects in images based on exemplar images is an active area of research in computer vision and graphics. We propose MARBLE, a method for performing material blending and recomposing fine-grained material properties by finding material embeddings in CLIP-space and using that to control pre-trained text-to-image models. We improve exemplar-based material editing by finding a block in the denoising UNet responsible for material attribution. Given two material exemplar-images, we find directions in the CLIP-space for blending the materials. Further, we can achieve parametric control over fine-grained material attributes such as roughness, metallic, transparency, and glow using a shallow network to predict the direction for the desired material attribute change. We perform qualitative and quantitative analysis to demonstrate the efficacy of our proposed method. We also present the ability of our method to perform multiple edits in a single forward pass and applicability to painting. Ta Ying Cheng, Prafull Sharma, Mark Boss, Varun Jampani |
CVPR | 2 |
| 2024 | Alchemist: Parametric Control of Material Properties with Diffusion ModelsabstractWe propose a method to control material attributes of objects like roughness, metallic, albedo, and transparency in real images. Our method capitalizes on the generative prior of text-to-image models known for photorealism, employing a scalar value and instructions to alter low-level material properties. Addressing the lack of datasets with controlled material attributes, we generated an object-centric synthetic dataset with physically-based materials. Finetuning a modified pretrained text-to-image model on this synthetic dataset enables us to edit material properties in real-world images while preserving all other attributes. We show the potential application of our model to material edited NeRFs. Prafull Sharma, Varun Jampani, Yuanzhen Li, Xuhui Jia, Dmitry Lagun, Frédo Durand, William T. Freeman, Mark J. Matthews |
CVPR | 1 |
| 2024 | ZeST: Zero-Shot Material Transfer from a Single Image
Ta Ying Cheng, Prafull Sharma, Andrew Markham, Agathoniki Trigoni, Varun Jampani |
ECCV (1) | 2 |
| 2023 | Neural Groundplans: Persistent Neural Scene Representations from a Single Image
Prafull Sharma, Ayush Tewari, Yilun Du, Sergey Zakharov, Rares Ambrus, Adrien Gaidon, William T. Freeman, Frédo Durand, Josh Tenenbaum, Vincent Sitzmann |
ICLR | 1 |
| 2023 | Materialistic: Selecting Similar Materials in ImagesabstractSeparating an image into meaningful underlying components is a crucial first step for both editing and understanding images. We present a method capable of selecting the regions of a photograph exhibiting the same material as an artist-chosen area. Our proposed approach is robust to shading, specular highlights, and cast shadows, enabling selection in real images. As we do not rely on semantic segmentation (different woods or metal should not be selected together), we formulate the problem as a similarity-based grouping problem based on a user-provided image location. In particular, we propose to leverage the unsupervised DINO [Caron et al. 2021] features coupled with a proposed Cross-Similarity Feature Weighting module and an MLP head to extract material similarities in an image. We train our model on a new synthetic image dataset, that we release. We show that our method generalizes well to real-world images. We carefully analyze our model's behavior on varying material properties and lighting. Additionally, we evaluate it against a hand-annotated benchmark of 50 real photographs. We further demonstrate our model on a set of applications, including material editing, in-video selection, and retrieval of object photographs with similar materials. Prafull Sharma, Julien Philip, Michaël Gharbi, William T. Freeman, Frédo Durand, Valentin Deschaintre |
ACM Trans. Graph. | 1 |
| 2021 | What You Can Learn by Staring at a Blank WallabstractWe present a passive non-line-of-sight method that infers the number of people or activity of a person from the observation of a blank wall in an unknown room. Our technique analyzes complex imperceptible changes in indirect illumination in a video of the wall to reveal a signal that is correlated with motion in the hidden part of a scene. We use this signal to classify between zero, one, or two moving people, or the activity of a person in the hidden scene. We train two convolutional neural networks using data collected from 20 different scenes, and achieve an accuracy of ≈ 94% for both tasks in unseen test environments and real-time online settings. Unlike other passive non-line-of-sight methods, the technique does not rely on known occluders or controllable light sources, and generalizes to unknown rooms with no recalibration. We analyze the generalization and robustness of our method with both real and synthetic data, and study the effect of the scene parameters on the signal quality.1 Prafull Sharma, Miika Aittala, Yoav Y. Schechner, Antonio Torralba 0001, Gregory W. Wornell, William T. Freeman, Frédo Durand |
ICCV | 1 |
| 2019 | Computational Mirrors: Blind Inverse Light Transport by Deep Matrix FactorizationabstractWe recover a video of the motion taking place in a hidden scene by observing changes in indirect illumination in a nearby uncalibrated visible region. We solve this problem by factoring the observed video into a matrix product between the unknown hidden scene video and an unknown light transport matrix. This task is extremely ill-posed, as any non-negative factorization will satisfy the data. Inspired by recent work on the Deep Image Prior, we parameterize the factor matrices using randomly initialized convolutional neural networks trained in a one-off manner, and show that this results in decompositions that reflect the true motion in the hidden scene. Miika Aittala, Prafull Sharma, Lukas Murmann, Adam B. Yedidia, Gregory W. Wornell, William T. Freeman, Frédo Durand |
NeurIPS | 2 |
| 2018 | On the Importance of Label Quality for Semantic SegmentationabstractConvolutional networks (ConvNets) have become the dominant approach to semantic image segmentation. Producing accurate, pixel-level labels required for this task is a tedious and time consuming process; however, producing approximate, coarse labels could take only a fraction of the time and effort. We investigate the relationship between the quality of labels and the performance of ConvNets for semantic segmentation. We create a very large synthetic dataset with perfectly labeled street view scenes. From these perfect labels, we synthetically coarsen labels with different qualities and estimate human-hours required for producing them. We perform a series of experiments by training ConvNets with a varying number of training images and label quality. We found that the performance of ConvNets mostly depends on the time spent creating the training labels. That is, a larger coarsely-annotated dataset can yield the same performance as a smaller finely-annotated one. Furthermore, fine-tuning coarsely pre-trained ConvNets with few finely-annotated labels can yield comparable or superior performance to training it with a large amount of finely-annotated labels alone, at a fraction of the labeling cost. We demonstrate that our result is also valid for different network architectures, and various object classes in an urban scene. Aleksandar Zlateski, Ronnachai Jaroensri, Prafull Sharma, Frédo Durand |
CVPR | 3 |
| 2018 | K-means++ vs. Behavioral Biometrics: One Loop to Rule Them All
Parimarjan Negi, Prafull Sharma, Bahman Bahmani |
NDSS | 2 |