← Search

Seunghun Lee

13 accepted papers

2026

TaskForce: Cooperative Multi-agent Reinforcement Learning for Multi-task Optimization

CVPR 2026

Multi-task learning (MTL) involves the simultaneous optimization of multiple task-specific losses, often leading to gradient conflicts and scale imbalances that result in negative transfer. While existing multi-task optimization methods attempt to mitigate these challenges, they either lack the stoc

Cited by 0SourceScholar
2025

LOMM: Latest Object Memory Management for Temporally Consistent Video Instance Segmentation

ICCV 2025poster

In this paper, we present Latest Object Memory Management (LOMM) for temporally consistent video instance segmentation that significantly improves long-term instance tracking. At the core of our method is Latest Object Memory (LOM), which robustly tracks and continuously updates the latest states of…

Cited by 0SourcePDFScholar
2025

Latent Bayesian Optimization via Autoregressive Normalizing Flows

ICLR 2025oral

Bayesian Optimization (BO) has been recognized for its effectiveness in optimizing expensive and complex objective functions. Recent advancements in Latent Bayesian Optimization (LBO) have shown promise by integrating generative models such as variational autoencoders (VAEs) to manage the complexity…

Cited by 1SourcePDFScholar
2025

PRESTO: Preimage-Informed Instruction Optimization for Prompting Black-Box LLMs

NeurIPS 2025poster

Large language models (LLMs) have achieved remarkable success across diverse domains, due to their strong instruction-following capabilities. This raised interest in optimizing instructions for black-box LLMs, whose internal parameters are inaccessible but popular for their strong performance and ea…

Cited by 0SourceScholar
2025

Style-Editor: Text-driven Object-centric Style Editing

CVPR 2025highlight

We present Text-driven object-centric style editing model named Style-Editor, a novel method that guides style editing at an object-centric level using textual inputs.The core of Style-Editor is our Patch-wise Co-Directional (PCD) loss, meticulously designed for precise object-centric editing that a…

Cited by 0SourcePDFScholar
2023

Advancing Bayesian Optimization via Learning Correlated Latent Space

NeurIPS 2023poster

Bayesian optimization is a powerful method for optimizing black-box functions with limited function evaluations. Recent works have shown that optimization in a latent space through deep generative models such as variational autoencoders leads to effective and efficient Bayesian optimization for stru…

2023

NuTrea: Neural Tree Search for Context-guided Multi-hop KGQA

NeurIPS 2023poster

Multi-hop Knowledge Graph Question Answering (KGQA) is a task that involves retrieving nodes from a knowledge graph (KG) to answer natural language questions. Recent GNN-based approaches formulate this task as a KG path searching problem, where messages are sequentially propagated from the seed nod…

2022

ADAS: A Direct Adaptation Strategy for Multi-Target Domain Adaptive Semantic Segmentation

CVPR 2022poster

In this paper, we present a direct adaptation strategy (ADAS), which aims to directly adapt a single model to multiple target domains in a semantic segmentation task without pretrained domain-specific models. To do so, we design a multi-target domain transfer network (MTDT-Net) that aligns visual at…

Cited by 29PDFcodeScholar
2021

DRANet: Disentangling Representation and Adaptation Networks for Unsupervised Cross-Domain Adaptation

CVPR 2021poster

In this paper, we present DRANet, a network architecture that disentangles image representations and transfers the visual attributes in a latent space for unsupervised cross-domain adaptation. Unlike the existing domain adaptation methods that learn associated features sharing a domain, DRANet prese…

Cited by 85PDFcodeScholar
2021

Metropolis-Hastings Data Augmentation for Graph Neural Networks

NeurIPS 2021poster

Graph Neural Networks (GNNs) often suffer from weak-generalization due to sparsely labeled data despite their promising results on various graph-based tasks. Data augmentation is a prevalent remedy to improve the generalization ability of models in many domains. However, due to the non-Euclidean nat…

Cited by 62SourcePDFScholar