Kim, Sunghun
NAVER Cloud (South Korea) · The Hong Kong University of Science and Technology (Guangzhou)
7 papers on CoChatORCID 0000-0003-4478-9720
Most cited papers
- Verified
StarGAN: Unified Generative Adversarial Networks for Multi-domain Image-to-Image Translation
Choi, Y., Choi, M., Kim, M., Ha, J.-W., Kim, S., & Choo, J. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition
Generative Adversarial Networks and Image SynthesisDomain Adaptation and Few-Shot Learning
Cited by 4,163
- Verified
A survey on large language models for code generation
Jiang, J., Wang, F., Shen, J., Kim, S., & Kim, S. (2024) · arXiv
Software Engineering ResearchTopic Modeling
Cited by 257
- Verified · note
A Survey on Large Language Models for Code Generation
Jiang, J., Wang, F., Shen, J., Kim, S., & Kim, S. (2026) · ACM Transactions on Software Engineering and Methodology
Software Engineering ResearchTopic Modeling
Cited by 251
- Verified
A Survey on Mixture of Experts
Cai, W., Jiang, J., Wang, F., Tang, J., Kim, S., & Huang, J. (2024)
Advanced Neural Network ApplicationsTopic Modeling
Cited by 92
- Verified
ReflexiCoder: Teaching Large Language Models to Self-Reflect on Generated Code and Self-Correct It via Reinforcement Learning
Jiang, J., Shen, J., Kim, S., Yoo, K. M., Kim, J., & Kim, S. (2026) · arXiv
Software Engineering ResearchTeaching and Learning Programming
Cited by 8
- Verified
DTRec: Learning Dynamic Reasoning Trajectories for Sequential Recommendation
Shao, Y., Zhou, P., Wang, S., Zhang, W., Cai, X., & Kim, S. (2025) · arXiv
Recommender Systems and TechniquesInformation Retrieval and Search Behavior
Cited by 0
- Verified
DTRec: Learning Dynamic Reasoning Trajectories for Sequential Recommendation
Shao, Y., Zhou, P., Wang, S., Zhang, W., Kim, S., & Cai, X. (2026) · Proceedings of the ACM Web Conference 2026
Recommender Systems and TechniquesInformation Retrieval and Search Behavior
Cited by 0
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free