Ahmad Ghasemi
Graph algorithms and theoretical machine learning
Graph learning, minimax theory, and learning under dependence
Department of Electrical & Computer Engineering
University of Massachusetts Amherst
aghasemi (at) umass [dot] edu
I am a Postdoctoral Research Fellow and Adjunct Faculty in Electrical & Computer Engineering at the University of Massachusetts Amherst. My research is in the foundations of machine learning, with a focus on graph-structured learning, learning under dependence, and structure-aware complexity. I study how graph topology, statistical dependence, and problem geometry change the effective difficulty of estimation and generalization, and how these structural effects should inform both theory and algorithm design.
Quick pathways
- Theory overview (graph learning, minimax theory, learning under dependence): Open
- Systems / CPS / Edge AI overview (deployable ML, autonomy, resource-aware inference): Open
Much of my work starts from a simple observation: classical i.i.d. intuition often breaks down in the graph-structured and dependent settings that matter most in modern machine learning. In these regimes, nominal sample size can be a poor proxy for effective information, and performance may be limited by topology, dependence, or computational budget rather than model capacity alone. My goal is to characterize these limits clearly and use that understanding to develop sharper theory, better diagnostics, and evaluation protocols that remain meaningful in practice.
Active projects
-
Minimax limits of graph neural networks: characterizing when topology and dependence fundamentally limit generalization in message-passing architectures.
-
Deployable graph learning: low-rank and constrained training methods that control inference cost under latency, memory, and energy budgets.
-
Confidence-guided inference for large models (CGES): adaptive stopping rules that reduce compute while preserving reasoning accuracy.
-
Trustworthy autonomy in UAV systems (NSF CPS AERIAL): reliability metrics and validation protocols for learning-enabled autonomous swarms.
I welcome collaborations in graph algorithms, theoretical machine learning, graph learning, and learning under dependence.
news
| Jan 25, 2026 | Our paper, Minimax Sample Complexity of Graph Neural Networks: Lower Bounds and Structural Effects, has been accepted to ICLR 2026. Read the paper |
|---|---|
| Dec 15, 2025 | Our paper, CGES: Confidence-Guided Early Stopping for Efficient and Accurate Self-Consistency, was accepted to Efficient Reasoning @ NeurIPS 2025 as a Spotlight. Read the paper |
| Nov 25, 2025 | Our paper, Robust UAV Trajectory Design for Non-Uniform Coverage, was published in IEEE Communications Letters (Vol. 30, pp. 188-192, Nov. 2025). Read the paper |
| Jul 15, 2025 | Our NSF proposal, titled “AERIAL (AI-Embedded Responsive Intelligent Agents with Trajectory-Induced Digital Twin Learning” is awarded by National Science Foundation (NSF). Read the Award Details |
| Mar 25, 2025 | Our paper, Constant-Speed Trajectory Processes for Uniform Coverage in UAV Networks, appeared in the proceedings of the 59th Annual Conference on Information Sciences and Systems (CISS 2025). Read the paper |
| Feb 16, 2024 | Our paper on Tiny Graph Neural Network has been accepted for presentation at the 2024 TinyML Research Symposium! Read the paper |
| Jan 17, 2024 | Our paper, Adversarial Attacks on Graph Neural Networks Based Spatial Resource Management in P2P Wireless Communications, has been accepted to IEEE Transactions on Vehicular Technology. Read the paper |