Kersting, Kristian
Technische Universität Darmstadt
7 papers on CoChatORCID 0000-0002-2873-9152
Most cited papers
- Verified
Memory-R1: Enhancing Large Language Model Agents to Manage and Utilize Memories via Reinforcement Learning
Yan, S., Yang, X., Huang, Z., Nie, E., Ding, Z., Li, Z., Ma, X., Bi, J., Kersting, K., Pan, J. Z., et al. (2025) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 297
- Verified
Safe Latent Diffusion: Mitigating Inappropriate Degeneration in Diffusion Models
Schramowski, P., Brack, M., Deiseroth, B., & Kersting, K. (2023) · 2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR)
Generative Adversarial Networks and Image SynthesisAdversarial Robustness in Machine Learning
Cited by 219
- Verified
Predicting player churn in the wild
Hadiji, F., Sifa, R., Drachen, A., Thurau, C., Kersting, K., & Bauckhage, C. (2014) · 2014 IEEE Conference on Computational Intelligence and Games
Customer churn and segmentationDigital Games and Media
Cited by 154
- Verified
ChatGPT is fun, but it is not funny! Humor is still challenging Large Language Models
Jentzsch, S., & Kersting, K. (2023) · arXiv
Humor Studies and ApplicationsTopic Modeling
Cited by 84
- Verified
Causal Parrots: Large Language Models May Talk Causality But Are Not Causal
Zečević, M., Willig, M., Dhami, D. S., & Kersting, K. (2023) · arXiv
Bayesian Modeling and Causal InferenceLogic, Reasoning, and Knowledge
Cited by 64
- Verified
Compressing probabilistic Prolog programs
De Raedt, L., Kersting, K., Kimmig, A., Revoredo, K., & Toivonen, H. (2008) · Machine Learning
Bayesian Modeling and Causal InferenceLogic, Reasoning, and Knowledge
Cited by 40
- Verified
Mechanistic Design and Scaling of Hybrid Architectures
Poli, M., Thomas, A. W., Nguyen, E., Ponnusamy, P., Deiseroth, B., Kersting, K., Suzuki, T., Hie, B., Ermon, S., Ré, C., et al. (2024) · arXiv
Topic ModelingNatural Language Processing Techniques
Cited by 4
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free