An Important Corollary for the Fast Solution of Dynamic Maximal Clique Enumeration Problems. - Neal Lawton (CoRR, 2014)

A Forest Mixture Bound for Block-Free Parallel Inference. - Neal Lawton; Greg Ver Steeg; Aram Galstyan (UAI, 2018)

Neural Architecture Search for Parameter-Efficient Fine-tuning of Large Pre-trained Language Models. - Neal Lawton; Anoop Kumar; Govind Thattai; Aram Galstyan; Greg Ver Steeg (ACL (Findings), 2023)

QuAILoRA: Quantization-Aware Initialization for LoRA. - Neal Lawton; Aishwarya Padmakumar; Judith Gaspers; Jack FitzGerald; Anoop Kumar; Greg Ver Steeg; Aram Galstyan (ENLSP, 2024)

Learning Morphisms with Gauss-Newton Approximation for Growing Networks. - Neal Lawton; Aram Galstyan; Greg Ver Steeg (CoRR, 2024)

A Comparison of Independent and Joint Fine-tuning Strategies for Retrieval-Augmented Generation. - Neal Lawton; Alfy Samuel; Anoop Kumar; Daben Liu (CoRR, 2025)