Kwangjun Ahn

Orcid: 0000-0001-5516-5775

According to our database1, Kwangjun Ahn authored at least 32 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Improved Sample Complexity of Imitation Learning for Barrier Model Predictive Control.
CoRR, 2024

Adam with model exponential moving average is effective for nonconvex optimization.
CoRR, 2024

Does SGD really happen in tiny subspaces?
CoRR, 2024

Understanding Adam Optimizer via Online Learning of Updates: Adam is FTRL in Disguise.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

How to Escape Sharp Minima with Random Perturbations.
Proceedings of the Forty-first International Conference on Machine Learning, 2024

Linear attention is (maybe) all you need (to understand Transformer optimization).
Proceedings of the Twelfth International Conference on Learning Representations, 2024

2023
A Unified Approach to Controlling Implicit Regularization via Mirror Descent.
J. Mach. Learn. Res., 2023

Smooth Model Predictive Control with Applications to Statistical Learning.
CoRR, 2023

How to escape sharp minima.
CoRR, 2023

Transformers learn to implement preconditioned gradient descent for in-context learning.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Learning threshold neurons via edge of stability.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

The Crucial Role of Normalization in Sharpness-Aware Minimization.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Model Predictive Control via On-Policy Imitation Learning.
Proceedings of the Learning for Dynamics and Control Conference, 2023

2022
Understanding Nesterov's Acceleration via Proximal Point Method.
Proceedings of the 5th Symposium on Simplicity in Algorithms, 2022

Mirror Descent Maximizes Generalized Margin and Can Be Implemented Efficiently.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Reproducibility in Optimization: Theoretical Framework and Limits.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Agnostic Learnability of Halfspaces via Logistic Loss.
Proceedings of the International Conference on Machine Learning, 2022

Understanding the unstable convergence of gradient descent.
Proceedings of the International Conference on Machine Learning, 2022

One-Pass Learning via Bridging Orthogonal Gradient Descent and Recursive Least-Squares.
Proceedings of the 61st IEEE Conference on Decision and Control, 2022

2021
Riemannian Perspective on Matrix Factorization.
CoRR, 2021

Efficient constrained sampling via the mirror-Langevin algorithm.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm.
Proceedings of the Conference on Learning Theory, 2021

2020
From Proximal Point Method to Nesterov's Acceleration.
CoRR, 2020

On Tight Convergence Rates of Without-replacement SGD.
CoRR, 2020

SGD with shuffling: optimal rates without component convexity and large epoch requirements.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

From Nesterov's Estimate Sequence to Riemannian Acceleration.
Proceedings of the Conference on Learning Theory, 2020

A Simpler Strong Refutation of Random k-XOR.
Proceedings of the Approximation, 2020

2019
Community Recovery in Hypergraphs.
IEEE Trans. Inf. Theory, 2019

2018
Hypergraph Spectral Clustering in the Weighted Stochastic Block Model.
IEEE J. Sel. Top. Signal Process., 2018

Binary Rating Estimation with Graph Side Information.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Computing the maximum matching width is NP-hard.
CoRR, 2017

Information-theoretic limits of subspace clustering.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017


  Loading...