Search Results for author:
Found 11 papers, 9 papers with code
LoRA Training in the NTK Regime has No Spurious Local Minima
Low-rank adaptation (LoRA) has become the standard approach for parameter-efficient fine-tuning of large language models (LLM), but our theoretical understanding of LoRA has been limited.
Image Clustering Conditioned on Text Criteria
Classical clustering methods do not provide users with direct control of the clustering results, and the clustering results may not be consistent with the relevant criterion that a user has in mind.
Rotation and Translation Invariant Representation Learning with Implicit Neural Representations
In many computer vision applications, images are acquired with arbitrary or random rotations and translations, and in such setups, it is desirable to obtain semantic representations disentangled from the image orientation.
Robust Probabilistic Time Series Forecasting
Probabilistic time series forecasting has played critical role in decision-making processes due to its capability to quantify uncertainties.
Neural Tangent Kernel Analysis of Deep Narrow Neural Networks
The tremendous recent progress in analyzing the training dynamics of overparameterized neural networks has primarily focused on wide networks and therefore does not sufficiently address the role of depth in deep learning.
WGAN with an Infinitely Wide Generator Has No Spurious Stationary Points
Generative adversarial networks (GAN) are a widely used class of deep generative models, but their minimax training dynamics are not understood very well.
ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems and GANs
Despite remarkable empirical success, the training dynamics of generative adversarial networks (GAN), which involves solving a minimax game using stochastic gradients, is still poorly understood.
ODE Analysis of Stochastic Gradient Methods with Optimism and Anchoring for Minimax Problems
Despite remarkable empirical success, the training dynamics of generative adversarial networks (GAN), which involves solving a minimax game using stochastic gradients, is still poorly understood.
Plug-and-Play Methods Provably Converge with Properly Trained Denoisers
Plug-and-play (PnP) is a non-convex framework that integrates modern denoising priors, such as BM3D or deep learning-based denoisers, into ADMM or other proximal algorithms.
Operator Splitting Performance Estimation: Tight contraction factors and optimal parameter selection
We propose a methodology for studying the performance of common splitting methods through semidefinite programming.
Optimization and Control 47H05 47H09 68Q25 90C22 90C25 90C30 90C60
Splitting with Near-Circulant Linear Systems: Applications to Total Variation CT and PET
Many imaging problems, such as total variation reconstruction of X-ray computed tomography (CT) and positron-emission tomography (PET), are solved via a convex optimization problem with near-circulant, but not actually circulant, linear systems.
Optimization and Control
