Demo Data from SIGIR 2026 / reviewers in the wild / expert
Bihe Zhao
dblp:341/2036
· DBLP profile ↗
5ranked-venue papers
1as first author
5since 2021 · last 2026
0000-0001-8349-4533ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Security and privacy · 2 · 2 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.
| Network and information security
2 papers |
Privacy and data protection · 40% Digital forensics and information hiding · 40% Security and privacy of machine learning · 20% | |
| Artificial intelligence
2 papers |
Generative modeling · 84% Trustworthy machine learning · 16% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling › autoregressive model
autoregressive image generation |
0.9 | 1 | 2025 | BitMark: Watermarking Bitwise Autoregressive Image Generative Models · NeurIPS 2025 |
Security and privacy of machine learning › membership inference
dataset inference |
0.9 | 1 | 2025 | Unlocking Post-hoc Dataset Inference with Synthetic Data · ICML 2025 |
Digital forensics and information hiding › watermarking
image watermarking |
0.9 | 1 | 2025 | BitMark: Watermarking Bitwise Autoregressive Image Generative Models · NeurIPS 2025 |
Privacy and data protection › inference attack
training data inference |
0.9 | 1 | 2025 | Unlocking Post-hoc Dataset Inference with Synthetic Data · ICML 2025 |
Digital forensics and information hiding
watermarking |
0.9 | 1 | 2025 | BitMark: Watermarking Bitwise Autoregressive Image Generative Models · NeurIPS 2025 |
Machine learning › Trustworthy machine learning
AI safety |
0.3 | 1 | 2025 | BitMark: Watermarking Bitwise Autoregressive Image Generative Models · NeurIPS 2025 |
Machine learning › Generative modeling
model collapse |
0.3 | 1 | 2025 | BitMark: Watermarking Bitwise Autoregressive Image Generative Models · NeurIPS 2025 |
Machine learning › Generative modeling
synthetic data generation |
0.3 | 1 | 2025 | Unlocking Post-hoc Dataset Inference with Synthetic Data · ICML 2025 |
Methods — techniques the papers use, named apart from their topics
suffix-based completion · 1.7radioactive watermarking · 1.7post-hoc calibration · 1.7bitwise watermarking · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Watermark Degradation Across Model IterationsabstractModern image generative models are capable of producing photorealistic images that become increasingly indistinguishable from real data. As those images are published online, they are often scraped for subsequent training runs of new generative models. This practice of training on generated data has been shown to degrade model performance and amplify existing biases. A possible mitigation lies in embedding watermarks into generated content to identify synthetic content and enable data provenance. However, the persistence of watermarks through iterative training-generation cycles remains poorly understood. In this work, we investigate how image watermarks degrade across multiple generations of model training. We adopt a dataset inference framework that aggregates weak per-sample signals via statistical hypothesis testing, enabling reliable detection even when watermark traces are subtle. We observe disparate behavior across watermarking methods with one of them remaining highly detectable in subsequent generations, even when the watermarked training data constitutes only 1% of the training data, while other watermarks degrade severely throughout generations and have a finite lifetime. Our findings highlight the need for more robust watermarking methods that are designed to withstand retraining for reliable data provenance. Michel Meintz, Maitri Vignesh Shah, Bihe Zhao, Louis Kerner, Franziska Boenisch, Adam Dziedzic |
IH&MMSec | 3 |
| 2025 | Unlocking Post-hoc Dataset Inference with Synthetic DataabstractThe remarkable capabilities of Large Language Models (LLMs) can be mainly attributed to their massive training datasets, which are often scraped from the internet without respecting data owners’ intellectual property rights. Dataset Inference (DI) offers a potential remedy by identifying whether a suspect dataset was used in training, thereby enabling data owners to verify unauthorized use. However, existing DI methods require a private set—known to be absent from training—that closely matches the compromised dataset’s distribution. Such in-distribution, held-out data is rarely available in practice, severely limiting the applicability of DI. In this work, we address this challenge by synthetically generating the required held-out set. Our approach tackles two key obstacles: (1) creating high-quality, diverse synthetic data that accurately reflects the original distribution, which we achieve via a data generator trained on a carefully designed suffix-based completion task, and (2) bridging likelihood gaps between real and synthetic data, which is realized through post-hoc calibration. Extensive experiments on diverse text datasets show that using our generated data as a held-out set enables DI to detect the original training sets with high confidence, while maintaining a low false positive rate. This result empowers copyright owners to make legitimate claims on data usage and demonstrates our method’s reliability for real-world litigations. Our code is available at https://github.com/sprintml/PostHocDatasetInference. Bihe Zhao, Pratyush Maini, Franziska Boenisch, Adam Dziedzic |
ICML | 1 |
| 2025 | BitMark: Watermarking Bitwise Autoregressive Image Generative ModelsabstractState-of-the-art text-to-image models generate photorealistic images at an unprecedented speed. This work focuses on models that operate in a bitwise autoregressive manner over a discrete set of tokens that is practically infinite in size. However, their impressive generative power comes with a growing risk: as their outputs increasingly populate the Internet, they are likely to be scraped and reused as training data—potentially by the very same models. This phenomenon has been shown to lead to model collapse, where repeated training on generated content, especially from the models’ own previous versions, causes a gradual degradation in performance. A promising mitigation strategy is watermarking, which embeds human-imperceptible yet detectable signals into generated images—enabling the identification of generated content. In this work, we introduce BitMark, a robust bitwise watermarking framework. Our method embeds a watermark directly at the bit level of the token stream during the image generation process. Our bitwise watermark subtly influences the bits to preserve visual fidelity and generation speed while remaining robust against a spectrum of removal techniques. Furthermore, it exhibits high radioactivity, i.e., when watermarked generated images are used to train another image generative model, this second model’s outputs will also carry the watermark. The radioactive traces remain detectable even when only fine-tuning diffusion or image autoregressive models on images watermarked with our BitMark. Overall, our approach provides a principled step toward preventing model collapse in image generative models by enabling reliable detection of generated outputs. The code is available at https://github.com/sprintml/BitMark. Louis Kerner, Michel Meintz, Bihe Zhao, Franziska Boenisch, Adam Dziedzic |
NeurIPS | 3 |
| 2025 | GRAMSSAT: An efficient label inference attack against two-party split learning based on gradient matching and semi-supervised learning
Xinyan Gao, Bihe Zhao, Zhenyu Guan 0002, Song Bian 0001 |
J. Inf. Secur. Appl. | 3 |
| 2023 | New Finding and Unified Framework for Fake Image DetectionabstractRecently, fake face images generated by generative adversarial network (GAN) have been widely spread in social networks, raising serious social concerns and security risks. To identify the fake images, the top priority is to find what properties make the fake images different from the real images. In this letter, we reveal an important observation about real/fake images, i.e., the GAN generated fake images contain stronger non-local self-similarity than the real images. Motivated by this observation, we propose a simple yet effective non-local attention based fake image detection network, namely NAFID, to distinguish GAN generated fake images from real images. Specifically, we develop a non-local feature extraction (NFE) module to extract the non-local features of the real/fake images, followed by a multi-stage classification module to distinguish the images with the extracted non-local features. Experimental results on various datasets demonstrate the superiority of our NAFID over state-of-the-art (SOTA) face forgery detection methods. More importantly, since the NFE module is independent from classification, we can plug it into any other forgery detection models. The results show that the NFE module can consistently improve the detection accuracy of other models, which verifies the universality of the proposed method. Xin Deng 0002, Bihe Zhao, Zhenyu Guan 0002, Mai Xu |
IEEE Signal Process. Lett. | 2 |