Demo Data from EDBT 2026 / reviewers in the wild / expert
Yuya Kobayashi
dblp:242/5085
· DBLP profile ↗
3ranked-venue papers
1as first author
2since 2021 · last 2025
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1
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
1 paper |
Generative modeling · 60% Trustworthy machine learning · 40% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Generative modeling › diffusion model › guided diffusion
classifier-free guidance |
0.9 | 1 | 2025 | Classifier-Free Guidance Inside the Attraction Basin May Cause Memorization · CVPR 2025 |
Machine learning › Generative modeling
diffusion model |
0.9 | 1 | 2025 | Classifier-Free Guidance Inside the Attraction Basin May Cause Memorization · CVPR 2025 |
Machine learning › Generative modeling › diffusion model
memorization in diffusion models |
0.9 | 1 | 2025 | Classifier-Free Guidance Inside the Attraction Basin May Cause Memorization · CVPR 2025 |
Machine learning › Trustworthy machine learning
privacy |
0.9 | 1 | 2025 | Classifier-Free Guidance Inside the Attraction Basin May Cause Memorization · CVPR 2025 |
Machine learning › Trustworthy machine learning › privacy
training data memorization |
0.9 | 1 | 2025 | Classifier-Free Guidance Inside the Attraction Basin May Cause Memorization · CVPR 2025 |
Methods — techniques the papers use, named apart from their topics
denoising trajectory analysis · 0.9classifier-free guidance · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Classifier-Free Guidance Inside the Attraction Basin May Cause MemorizationabstractDiffusion models are prone to exactly reproduce images from the training data. This exact reproduction of the training data is concerning as it can lead to copyright infringement and/or leakage of privacy-sensitive information. In this paper, we present a novel perspective on the memorization phenomenon and propose a simple yet effective approach to mitigate it. We argue that memorization occurs because of an attraction basin in the denoising process which steers the diffusion trajectory towards a memorized image. However, this can be mitigated by guiding the diffusion trajectory away from the attraction basin by not applying classifier-free guidance until an ideal transition point occurs from which classifier-free guidance is applied. This leads to the generation of non-memorized images that are high in image quality and well-aligned with the conditioning mechanism. To further improve on this, we present a new guidance technique, opposite guidance, that escapes the attraction basin sooner in the denoising process. We demonstrate the existence of attraction basins in various scenarios in which memorization occurs, and we show that our proposed approach successfully mitigates memorization. Our codebase is publicly available at https://github.com/SonyResearch/mitigating_memorization. Anubhav Jain 0002, Yuya Kobayashi, Takashi Shibuya 0001, Yuhta Takida, Nasir Memon, Julian Togelius, Yuki Mitsufuji |
CVPR | 2 |
| 2025 | Efficiency without Compromise: CLIP-aided Text-to-Image GANs with Increased DiversityabstractRecently, Generative Adversarial Networks (GANs) have been successfully scaled to billion-scale large text-to-image datasets. However, training such models entails a high training cost, limiting some applications and research usage. To reduce the cost, one promising direction is the incorporation of pre-trained models. The existing method of utilizing pre-trained models for a generator significantly reduced the training cost compared with the other large-scale GANs, but we found the model loses the diversity of generation for a given prompt by a large margin. To build an efficient and high-fidelity text-to-image GAN without compromise, we propose to use two specialized discriminators with Slicing Adversarial Networks (SANs) adapted for text-to-image tasks. Our proposed model, called SCAD, shows a notable enhancement in diversity for a given prompt with better sample fidelity. We also propose to use a metric called Per-Prompt Diversity (PPD) to evaluate the diversity of text-to-image models quantitatively. SCAD achieved a zero-shot FID competitive with the latest large-scale GANs at two orders of magnitude less training cost. Yuya Kobayashi, Yuhta Takida, Takashi Shibuya 0001, Yuki Mitsufuji |
IJCNN | 1 |
| 2019 | A Speech Data-Driven Stakeholder Analysis Methodology Based on the Stakeholder Graph ModelsabstractAmong the requirements elicitation activities, the stakeholder analysis is the main source of requirements. In this article, we propose a new model of data-driven stakeholder analysis, named SIG (Stakeholder Intention Graph), a semantic extension of property graph model that can represent the stakeholders' intentions and their relationships. To elicit the stakeholders' intentions from the speech data during meetings, we developed a system of structural analysis and SIG generation method from speech data. Based on the graph theory, we also propose an analysis methodology of stakeholders' intentions and their structure with both global and local graph analyses. We implemented a speech data-driven stakeholder analysis system on the graph database Neo4j. As the output, the analysis system automatically generates the stakeholder matrix from the speech data at the meetings. We applied the analysis method and system to the speech data of actual development meetings on the public service systems, and demonstrated the effectiveness of the proposed method. Yuta Shirasaki, Yuya Kobayashi, Mikio Aoyama |
COMPSAC (2) | 2 |