Demo Data from EDBT 2026 / reviewers in the wild / expert
Minje Jang
dblp:177/9373
· DBLP profile ↗
2ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 1 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.
| Computer graphics and multimedia
1 paper |
Rendering · 100% | |
| Theoretical computer science
1 paper |
Algorithms and data structures · 100% | |
| Artificial intelligence
2 papers |
Learning theory · 56% Representation and self-supervised learning · 44% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Rendering
physically based rendering |
0.8 | 1 | 2024 | SwitchLight: Co-Design of Physics-Driven Architecture and Pre-training Framework for Human Portrait Relighting · CVPR 2024 |
Rendering › relighting
portrait relighting |
0.8 | 1 | 2024 | SwitchLight: Co-Design of Physics-Driven Architecture and Pre-training Framework for Human Portrait Relighting · CVPR 2024 |
Rendering
reflectance modeling |
0.8 | 1 | 2024 | SwitchLight: Co-Design of Physics-Driven Architecture and Pre-training Framework for Human Portrait Relighting · CVPR 2024 |
Rendering
relighting |
0.8 | 1 | 2024 | SwitchLight: Co-Design of Physics-Driven Architecture and Pre-training Framework for Human Portrait Relighting · CVPR 2024 |
Machine learning › Learning theory
sample complexity |
0.3 | 1 | 2017 | Optimal Sample Complexity of M-wise Data for Top-K Ranking · NIPS 2017 |
Algorithms and data structures
ranking |
0.3 | 1 | 2017 | Optimal Sample Complexity of M-wise Data for Top-K Ranking · NIPS 2017 |
Algorithms and data structures › ranking
top-k ranking |
0.3 | 1 | 2017 | Optimal Sample Complexity of M-wise Data for Top-K Ranking · NIPS 2017 |
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
self-supervised representation learning |
0.2 | 1 | 2024 | SwitchLight: Co-Design of Physics-Driven Architecture and Pre-training Framework for Human Portrait Relighting · CVPR 2024 |
Methods — techniques the papers use, named apart from their topics
cook-torrance reflectance model · 1.5self-supervised pretraining · 0.8self-supervised pre-training · 0.8spectral methods · 0.6plackett-luce model · 0.6maximum likelihood estimation · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | SwitchLight: Co-Design of Physics-Driven Architecture and Pre-training Framework for Human Portrait RelightingabstractWe introduce a co-designed approach for human portrait relighting that combines a physics-guided architecture with a pretraining framework. Drawing on the Cook-Torrance reflectance model, we have meticulously configured the architecture design to precisely simulate light-surface interactions. Furthermore, to overcome the limitation of scarce high-quality lightstage data, we have developed a self-supervised pretraining strategy. This novel combination of accurate physical modeling and expanded training dataset establishes a new benchmark in relighting realism. Minje Jang, Wonjun Yoon, Jisoo Lee, Donghyun Na, Sanghyun Woo |
CVPR | 2 |
| 2017 | Optimal Sample Complexity of M-wise Data for Top-K RankingabstractWe explore the top-K rank aggregation problem in which one aims to recover a consistent ordering that focuses on top-K ranked items based on partially revealed preference information. We examine an M-wise comparison model that builds on the Plackett-Luce (PL) model where for each sample, M items are ranked according to their perceived utilities modeled as noisy observations of their underlying true utilities. As our result, we characterize the minimax optimality on the sample size for top-K ranking. The optimal sample size turns out to be inversely proportional to M. We devise an algorithm that effectively converts M-wise samples into pairwise ones and employs a spectral method using the refined data. In demonstrating its optimality, we develop a novel technique for deriving tight $\ell_\infty$ estimation error bounds, which is key to accurately analyzing the performance of top-K ranking algorithms, but has been challenging. Recent work relied on an additional maximum-likelihood estimation (MLE) stage merged with a spectral method to attain good estimates in $\ell_\infty$ error to achieve the limit for the pairwise model. In contrast, although it is valid in slightly restricted regimes, our result demonstrates a spectral method alone to be sufficient for the general M-wise model. We run numerical experiments using synthetic data and confirm that the optimal sample size decreases at the rate of 1/M. Moreover, running our algorithm on real-world data, we find that its applicability extends to settings that may not fit the PL model. Minje Jang, Sunghyun Kim 0001, Changho Suh, Sewoong Oh |
NIPS | 1 |