← Search

Jaeyun Song

7 accepted papers

2026

Secure Inference for Diffusion Models via Unconditional Scores

ICLR 2026poster

As diffusion model-based services expand across various domains, safeguarding client data privacy has become increasingly critical. While fully homomorphic encryption and secure multi-party computation enable privacy-preserving inference, their high computational overhead poses challenges for large-…

Cited by 0SourceScholar
2024

A Simple Remedy for Dataset Bias via Self-Influence: A Mislabeled Sample Perspective

NeurIPS 2024poster

Learning generalized models from biased data is an important undertaking toward fairness in deep learning. To address this issue, recent studies attempt to identify and leverage bias-conflicting samples free from spurious correlations without prior knowledge of bias or an unbiased set. However, spur…

Cited by 2SourcePDFScholar
2023

Weavspeech: Data Augmentation Strategy For Automatic Speech Recognition Via Semantic-Aware Weaving

ICASSP 2023accepted

A cut-and-paste type of data augmentation strategy has attracted considerable attention in the vision community due to its simplicity and effectiveness in improving generalization performance. However, it is challenging for Automatic Speech Recognition (ASR) tasks to apply this type of augmentation…

Cited by 0SourceScholar
2022

GraphENS: Neighbor-Aware Ego Network Synthesis for Class-Imbalanced Node Classification

ICLR 2022poster

In many real-world node classification scenarios, nodes are highly class-imbalanced, where graph neural networks (GNNs) can be readily biased to major class instances. Albeit existing class imbalance approaches in other domains can alleviate this issue to some extent, they do not consider the impact…

Cited by 124SourcePDFScholar
2022

TAM: Topology-Aware Margin Loss for Class-Imbalanced Node Classification

ICML 2022spotlight

Learning unbiased node representations under class-imbalanced graph data is challenging due to interactions between adjacent nodes. Existing studies have in common that they compensate the minor class nodes ‘as a group’ according to their overall quantity (ignoring node connections in graph), which…