Ruipeng Liu

Ruipeng Liu

PhD Candidate @ Syracuse University

Sitemap

A list of all the posts and pages found on the site. For you robots out there, there is an XML version available for digesting as well.

Pages

Posts

Future Blog Post

less than 1 minute read

Published:

This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.

Blog Post number 4

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 3

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 2

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

Blog Post number 1

less than 1 minute read

Published:

This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.

portfolio

publications

On the Feasibility of Single-Pass Full-Capacity Learning in Linear Threshold Neurons with Binary Input Vectors

Published in ICML 2024, 2024

This paper proves that single-pass full-capacity learning rules satisfying the span rule constraint do not exist for linear threshold neurons with binary input vectors. The result establishes a fundamental limitation on simultaneously achieving single-pass learning and maximal memory capacity in this setting.

Recommended citation: Liu, R., He, B., Tahir, N., & Katz, G. E. (2024). On the feasibility of single-pass full-capacity learning in linear threshold neurons with binary input vectors. In Proceedings of the 41st International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 235, pp. 31119–31130). PMLR.
Download Paper | Download Bibtex

Linearithmic Clean-up for Vector-Symbolic Key-Value Memory with Kroneker Rotation Products

Published in NeSy, 2025

This paper introduces a new Vector-Symbolic Architecture (VSA) codebook representation based on Kroneker Rotation Products (krop), enabling clean-up operations with linearithmic O(N log N) time complexity instead of the quadratic complexity typical in existing approaches. The method preserves comparable memory capacity while significantly improving scalability for vector-symbolic key-value memory systems.

Recommended citation: Liu, R., Qiu, Q., Khan, S., & Katz, G. E. (2025). Linearithmic clean-up for vector-symbolic key-value memory with Kroneker Rotation Products. In Proceedings of the 19th International Conference on Neurosymbolic Learning and Reasoning (Proceedings of Machine Learning Research, Vol. 284, pp. 1107–1118). PMLR.
Download Paper | Download Bibtex

Lipschitz-Regularized Critic Leads to Policy Robustness Against Transition Dynamics Uncertainty

Published in FLAIRS 2026, 2026

This paper studies how Lipschitz regularization of the critic can improve policy robustness under transition dynamics uncertainty.

Recommended citation: Chen, X., Liu, R., Gan, Z., & Katz, G. E. (2026). Lipschitz-regularized critic leads to policy robustness against transition dynamics uncertainty. In Proceedings of the 39th Florida Artificial Intelligence Research Society Conference. Preprint available at arXiv:2404.13879.
Download Paper

talks

teaching

Teaching Experience, 2023

Teaching Assistant, Syracuse University, 2023

CIS 477: Introduction to Analysis of Algorithms; CIS 667: Introduction to Artificial Intelligence