TDTyler Derr

Tyler Derr

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Tyler Derr has a total of 213 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    RAD: Rule-Augmented Relational Anomaly Detection

    byĀ Noah Dahle, Anne Tumlin, Ngoc Tran, Xenofon Koutsoukos, Tyler Derr

  • Open Access

    A survey of graph unlearning

    byĀ Anwar Said, Ngoc N. Tran, Yuying Zhao, Tyler Derr, Mudassir Shabbir, Waseem Abbas, Xenofon Koutsoukos

  • Open Access

    Model Routing for Large Language Models: A Unified Taxonomy and Survey

    byĀ Wang Wei, Tiankai Yang, Xiangbo Gao, Chan-Wei Hu, Reuben Luera, Runzhou Liu, Nigel Fernandez, Li Li, Lunyiu Nie, Bo Ni, et al.

    The landscape of LLMs is increasingly defined not by any single model, but by heterogeneous models that differ in scale, specialization, cost, latency, and reliability. This heterogeneity gives rise to a fundamental question at inference time: which model should be used for a given input? Model routing addresses this by selecting, composing, or orchestrating models at inference time, with the goal of achieving strong task performance while respecting operational constraints. Despite the growing importance and rapid progress, existing works remain fragmented across disparate objectives, input signals, levels of granularity, and learning paradigms, making it difficult to compare approaches or identify which design choices are most appropriate for a given setting. In this work, we study existing LLM routing approaches and propose a few intuitive taxonomies that serve as a fundamental basis for understanding and developing better techniques for model routing. In particular, we unify work on routing by introducing a multi-dimensional taxonomy that decomposes routing along four orthogonal dimensions: routing objectives (why to route), routing inputs (what information informs the decision), routing granularity (at what level routing occurs), and learning regime (how the routing policy is learned). We then use the proposed taxonomies to systematically categorize and compare representative methods. Additionally, we identify key challenges that remain to be addressed and potential opportunities to solve them. Finally, our proposed taxonomies unify existing approaches and distill key facets of the routing problem, providing a foundation for both researchers and practitioners.

  • Top Cited Papers
    Open Access

    Towards Trustworthy Retrieval Augmented Generation for Large Language Models: A Survey

    byĀ Bo Ni, Zheyuan Liu, Yongjia Lei, Leyao Wang, Yuying Zhao, Xueqi Cheng, Qingkai Zeng, Xin Dong, Yinglong Xia, Krishnaram Kenthapadi, et al.

    Retrieval-Augmented Generation (RAG) enhances AI-generated content by integrating external knowledge, improving relevance, and reducing hallucinations. However, RAG also introduces risks related to reliability, safety, privacy, fairness, explainability, and accountability, which impact trustworthiness. While various methods aim to address these concerns, a unified framework is lacking. This survey bridges that gap by presenting a comprehensive roadmap for trustworthy RAG systems. We provide a structured analysis of key challenges, existing solutions, and future directions across these aspects. We further organize the field around how the retrieval and generation stages and the six trustworthiness dimensions interact, demonstrating their synergies and trade-offs through a controlled cross-dimensional analysis. Additionally, we highlight downstream applications where trustworthy RAG can make a significant impact, encouraging further research and adoption in real-world AI systems.


  • Open Access

    Personalized Auto-Research: Towards a True AI Co-Scientist

    byĀ Bo Ni, Franck Derononcourt, Hongjie Chen, Yu Wang, Nesreen Ahmed, Zhengzhong Tu, Tyler Derr, Ryan Rossi

  • Open Access

    Hop-Affinity-Based Graph Decomposition and Adaptive Model Routing for HeterogeneousGraph Learning

    byĀ Archudha Arjunasamy, Rathipriya Easwaramoorthy, Tyler Derr

    Graph Neural Networks (GNNs) are highly effective at capturing structural patterns in graphstructured data; however, most existing architectures employ a single message-passing mechanism across an entire graph, assuming uniform structural behavior. Many real-world networks exhibit a mixture of homophilic and heterophilic regions, where node relationships vary across local neighborhoods. Such structural heterogeneity limits the effectiveness of graph-wide learning strategies and motivates region-aware graph modeling. This paper proposes Hop Affinity based Context Analysis (HACA), a framework that identifies structural contexts and enables region-specific model selection within a graph. HACA performs multi-hop affinity analysis to characterize a node based on neighbourhood hops, distinguishing dominant homophilic, heterophilic and mixed-affinity regions. Based on the identified context, the framework associates specialized GNN models with different regions. A routing mechanism assigns node predictions according to inferred regional characteristics, enabling localized adaptation without imposing a single representation function over the entire graph. The framework is evaluated on benchmark datasets spanning varying graph sizes and homophily–heterophily distributions. Results indicate that region-aware prediction provides measurable improvements over graph-wide homophilyoriented baselines and competitive performance on heterophilic graphs. Analysis on large-scale heterophilic datasets confirms the effectiveness of region-wise decomposition and specialized model assignment, suggesting a pathway toward adaptive graph learning.

  • Reachability-Based Formal Verification of Graph Neural Networks with Node and Edge Features

    byĀ Anne M. Tumlin, Ben Wooding, Zhenxuan Shao, Diego Manzanas Lopez, Tyler Derr, Taylor T. Johnson


  • Top Cited Papers
    Open Access

    A Survey of Mamba

    byĀ Haohao Qu, Liangbo Ning, Rui An, Wenqi Fan, Tyler Derr, Hui Liu, Xin Xu, Qing Li

    Deep learning (DL), as a vital technique, has sparked a notable revolution in artificial intelligence (AI), resulting in a great change in human lifestyles. As one of the most representative DL techniques, the Transformer architecture has empowered numerous advanced models, especially the large language models (LLMs) that comprise billions of parameters, becoming a cornerstone in deep learning. Despite the impressive achievements, Transformers still face inherent limitations, particularly the time-consuming inference resulting from the quadratic computation complexity of attention calculation. Recently, a novel architecture named Mamba , drawing inspiration from classical state space models (SSMs), has emerged as a promising alternative for building foundation models, delivering comparable modeling abilities to Transformers while preserving near-linear scalability concerning sequence length. This has sparked an increasing number of studies actively exploring Mamba's potential to achieve impressive performance across diverse domains. Given such rapid evolution, there is a critical need for a systematic review that consolidates existing Mamba-empowered models, offering a comprehensive understanding of this emerging model architecture. In this survey, we therefore conduct an in-depth investigation of recent Mamba-associated studies, covering three main aspects: the advancements of Mamba-based models , the techniques of adapting Mamba to diverse data , and the applications where Mamba can excel . Specifically, we first review the foundational knowledge of various representative deep learning models and the details of Mamba-1&2 as preliminaries. Then, to showcase the significance of Mamba for AI, we comprehensively review the related studies focusing on Mamba models’ architecture design, data adaptability, and applications. Finally, we present a discussion of current limitations and explore various promising research directions to provide deeper insights for future investigations.


  • Open Access

    Referral Required: When AI Blocks Access to Human Doctors

    byĀ Tyler Derr

    As AI systems evolve from support tools to decision-making elements in clinical workflows, a pivotal shift is occurring in how care is accessed. This paper considers a speculative but increasingly plausible scenario: what if seeing a human physician in the future requires a referral from an AI system? Just as insurers gate access to specialists through primary care referrals, we envision AI care access systems—powered by large language models (LLMs)—serving as arbiters of whether patients may proceed to any human clinician. We examine risks along this path—particularly around opacity, inequity, and denial at scale—and propose a roadmap for building systems that support explainability, appealability, and ethical oversight. We introduce the concept of medicolegal LLMs: agents optimized not only for accuracy, but for accountable refusal. Finally, we outline a system-level blueprint for trustworthy AI care access decision systems, integrating evidence grounding, uncertainty quantification, transparent policies, audit logging, and responsive escalation to ensure that automation supports rather than obstructs access to care.

  • Open Access

    A Survey on Signed Network Reconstruction Modeling and Its Applications

    byĀ Aikta Arya, Pradumn Kumar Pandey, Niloy Ganguly, Tyler Derr

    The proliferation in the use of Online Social Networks has revolutionized information sharing and consumption, leading to the development of advanced techniques such as link prediction, recommendation systems, community detection, node classification, and network representation learning. However, the availability and quality of real-world datasets for testing these algorithms pose challenges. Synthetic signed datasets generated through signed network reconstruction models offer alternatives for algorithm testing and experimentation. This survey presents an overview of state-of-the-art signed network reconstruction modeling techniques, evaluates their performance through rigorous experimental analysis, explores real-world applications, discusses challenges and open research problems, and guides future research efforts in the field. By consolidating knowledge and providing insights into existing models, this survey contributes to advancing the understanding and improvement of signed network reconstruction modeling. Various research papers discussed in this survey along with publicly available links to their codes are available at: https://github.com/Aikta-Arya/Signed-Network-Reconstruction-Modeling .