Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Taeeon Park

dblp:241/9857 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
4since 2021 · last 2025
0000-0001-5880-9740ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 5 · 2 first-author · 4 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.

Artificial intelligence
3 papers
Trustworthy machine learning · 62% Efficient and distributed learning · 13% Generative modeling · 13%
Computer graphics and multimedia
1 paper
Image and video processing · 100%

Topics — the 8 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
1.222023
Re-weighting Based Group Fairness Regularization via Classwise Robust Optimization · ICLR 2023
Fair Feature Distillation for Visual Recognition · CVPR 2021
Machine learning › Trustworthy machine learning › fairness › fair optimization
fairness regularization
0.712023
Re-weighting Based Group Fairness Regularization via Classwise Robust Optimization · ICLR 2023
Machine learning › Trustworthy machine learning › fairness
group fairness
0.712023
Re-weighting Based Group Fairness Regularization via Classwise Robust Optimization · ICLR 2023
Machine learning › Generative modeling
generative adversarial network
0.512021
GAN2GAN: Generative Noise Learning for Blind Denoising with Single Noisy Images · ICLR 2021
Machine learning › Efficient and distributed learning
model compression
0.512021
Fair Feature Distillation for Visual Recognition · CVPR 2021
Machine learning › Probabilistic and Bayesian machine learning
noise modeling
0.512021
GAN2GAN: Generative Noise Learning for Blind Denoising with Single Noisy Images · ICLR 2021
Image and video processing › image restoration › image denoising
blind image denoising
0.512021
GAN2GAN: Generative Noise Learning for Blind Denoising with Single Noisy Images · ICLR 2021
Image and video processing › image restoration
image denoising
0.512021
GAN2GAN: Generative Noise Learning for Blind Denoising with Single Noisy Images · ICLR 2021

Methods — techniques the papers use, named apart from their topics

generative adversarial network · 1.0robust optimization · 0.7reweighting · 0.7knowledge distillation · 0.5feature distillation · 0.5
YearPublicationVenuePosition
2025 FairDRO: Group fairness regularization via classwise robust optimization
Taeeon Park, Sangwon Jung, Sanghyuk Chun, Taesup Moon
Neural Networks1
2023 Re-weighting Based Group Fairness Regularization via Classwise Robust Optimization
Sangwon Jung, Taeeon Park, Sanghyuk Chun, Taesup Moon
ICLR2
2021 Fair Feature Distillation for Visual Recognition
Sangwon Jung, Donggyu Lee, Taeeon Park, Taesup Moon
CVPR3
2021 GAN2GAN: Generative Noise Learning for Blind Denoising with Single Noisy Images
Sungmin Cha, Taeeon Park, Byeongjoon Kim, Jongduk Baek, Taesup Moon
ICLR2
2020 Unsupervised Neural Universal Denoiser for Finite-Input General-Output Noisy Channel
abstract
We devise a novel neural network-based universal denoiser for the finite-input, general-output (FIGO) channel. Based on the assumption of known noisy channel densities, which is realistic in many practical scenarios, we train the network such that it can denoise as well as the best sliding window denoiser for any given underlying clean source data. Our algorithm, dubbed as Generalized CUDE (Gen-CUDE), enjoys several desirable properties; it can be trained in an unsupervised manner (solely based on the noisy observation data), has much smaller computational complexity compared to the previously developed universal denoiser for the same setting, and has much tighter upper bound on the denoising performance, which is obtained by a theoretical analysis. In our experiments, we show such tighter upper bound is also realized in practice by showing that Gen-CUDE achieves much better denoising results compared to other strong baselines for both synthetic and real underlying clean sequences.
Taeeon Park, Taesup Moon
AISTATS1