Citation Recommendation
MasterSet: A Benchmark for Must-Cite Citation Recommendation
A large-scale benchmark for identifying papers that researchers must cite, built from 150,000+ AI/ML papers across 15 leading venues.
I am an Assistant Professor of Computer Science at Northern Illinois University (NIU). I received my Ph.D. in Computer Science from Virginia Tech in December 2023, where I was advised by Prof. Chang-Tien Lu at the Sanghani Center for Artificial Intelligence and Data Analytics.
I study how machine learning reasons over structure, from graph learning and neural algorithmic reasoning to combinatorial and mixed-integer nonlinear optimization and graph-based retrieval-augmented generation. I also work on AI for science: retrieval over the scientific literature, such as finding the papers a researcher must cite, and machine learning for planetary science. With my students I apply these ideas to software vulnerability detection and to testing how far large language models can be trusted. Feel free to reach out if you see potential alignment and are interested in collaborating.
At NIU, I co-founded the NIU AI and organize the AI & ML research seminar series. NIU students can subscribe here to participate.
I am hiring undergraduate research assistants and PhD students to work on AI and Machine Learning.
Notice to New/Current NIU Graduate Students:
Thesis/Dissertation Committee Requests:
Students who would like me to serve on their committee are expected to participate in my research seminar during the semesters they are working with me. Regular participation allows me to follow your progress and give meaningful input at your proposal and defense.
Citation Recommendation
A large-scale benchmark for identifying papers that researchers must cite, built from 150,000+ AI/ML papers across 15 leading venues.
Neural Combinatorial Optimization
Solving Network Interdiction Problems with Graph Neural Networks
Graph Neural Network
Deep Equilibrium Model for Node-Edge Co-Evolution Graph Neural Network
Curated, annotated reading lists on GitHub, each organized around one question about its field and refreshed from my paper collection.
A few years ago I was the applicant. Now I read the applications. Here is what actually carries information for me, what carries none, and what quietly works against you.
Intellectual independence and a refusal to leave important things as black boxes: two things I hope my students carry into their research.
A Turing-complete Transformer inherits Kleene-style self-reference, but the self it refers to is the prompt, not the weights. Notes on what that does and does not say about recursive self-improvement.
Kleene’s recursion theorem, the Y combinator, and a contraction mapping all give you x = f(x). They answer different questions, and it helps to keep them apart before talking about self-improving AI.
The students who get the most out of me are doing something that looks a lot like prompt engineering — whether or not they would describe it that way.