← Search

Dohyun Kwon

9 accepted papers

2025

Overcoming Spurious Solutions in Semi-Dual Neural Optimal Transport: A Smoothing Approach for Learning the Optimal Transport Plan

ICML 2025poster

We address the convergence problem in learning the Optimal Transport (OT) map, where the OT Map refers to a map from one distribution to another while minimizing the transport cost. Semi-dual Neural OT, a widely used approach for learning OT Maps with neural networks, often generates spurious soluti…

Cited by 0SourcePDFScholar
2024

Maximum Entropy Inverse Reinforcement Learning of Diffusion Models with Energy-Based Models

NeurIPS 2024oral

We present a maximum entropy inverse reinforcement learning (IRL) approach for improving the sample quality of diffusion generative models, especially when the number of generation time steps is small. Similar to how IRL trains a policy based on the reward function learned from expert demonstrations…

2024

Memorization Capacity for Additive Fine-Tuning with Small ReLU Networks

UAI 2024poster

Fine-tuning large pre-trained models is a common practice in machine learning applications, yet its mathematical analysis remains largely unexplored. In this paper, we study fine-tuning through the lens of memorization capacity. Our new measure, the Fine-Tuning Capacity (FTC), is defined as the maxi…

Cited by 0SourcePDFScholar
2024

On Penalty Methods for Nonconvex Bilevel Optimization and First-Order Stochastic Approximation

ICLR 2024spotlight

In this work, we study first-order algorithms for solving Bilevel Optimization (BO) where the objective functions are smooth but possibly nonconvex in both levels and the variables are restricted to closed convex sets. As a first step, we study the landscape of BO through the lens of penalty methods…

Cited by 27SourcePDFScholar
2024

On The Complexity of First-Order Methods in Stochastic Bilevel Optimization

ICML 2024poster

We consider the problem of finding stationary points in Bilevel optimization when the lower-level problem is unconstrained and strongly convex. The problem has been extensively studied in recent years; the main technical challenge is to keep track of lower-level solutions $y^*(x)$ in response to the…

Cited by 6SourcePDFScholar
2023

A Fully First-Order Method for Stochastic Bilevel Optimization

ICML 2023oral

We consider stochastic unconstrained bilevel optimization problems when only the first-order gradient oracles are available. While numerous optimization methods have been proposed for tackling bilevel problems, existing methods either tend to require possibly expensive calculations regarding Hessian…

Cited by 82SourcePDFScholar
2023

Complexity of Block Coordinate Descent with Proximal Regularization and Applications to Wasserstein CP-dictionary Learning

ICML 2023poster

We consider the block coordinate descent methods of Gauss-Seidel type with proximal regularization (BCD-PR), which is a classical method of minimizing general nonconvex objectives under constraints that has a wide range of practical applications. We theoretically establish the worst-case complexity…

Cited by 4SourcePDFScholar
2022

Score-based Generative Modeling Secretly Minimizes the Wasserstein Distance

NeurIPS 2022accept

Score-based generative models are shown to achieve remarkable empirical performances in various applications such as image generation and audio synthesis. However, a theoretical understanding of score-based diffusion models is still incomplete. Recently, Song et al. showed that the training objectiv…

2018

Self-Adaptive Machine Learning Operating Systems for Security Applications

ICASSP 2018accepted

This paper proposes a reliable and self-adaptive operating system management policy for CCTV-based security applications which controls arrival image compression rates. After receiving image sequences via CCTV cameras, the system enqueues the sequences of images and processes them for face recogniti…

Cited by 0SourceScholar