activity
20232026
most citedThe Red Queen Gödel Machine: Co-Evolving Agents and Their Evaluators

2 citations · 4 across the 16 of their papers we have counts for

collaborators

18 papers

cs.AI2026

Self-Adapting Group of Experts for Multi-Agent Reasoning

Mohammad Atif Quamar, Nurbek Tastan, Karthik Nandakumar +1

Multi-agent systems bring together language model agents with different roles to propose, review, and refine solutions. Each agent's response depends on its model's capabilities, t…

cs.LG2026★ 2 cited

The Red Queen Gödel Machine: Co-Evolving Agents and Their Evaluators

Alex Iacob, Andrej Jovanović, William F. Shen +12

Self-improving agents are state-of-the-art on agentic coding benchmarks, yet their search methods assume a stationary evaluation criterion. This ignores a central feature of evolut…

cs.DC2026

PreLort: Prefix-Nested LoRA for Federated Fine-Tuning under Rank Heterogeneity

Muhammad Waseem, Nurbek Tastan, Andrej Jovanovic +4

Federated fine-tuning of large language models using parameter-efficient methods such as LoRA enables privacy-preserving adaptation of foundation models. Heterogeneous hardware res…

cs.LG2026

Class-wise Contribution Estimation via Logit Maximization for Federated Learning

Asim Ukaye, Nurbek Tastan, Mubarak Abdu-Aguye +1

Federated learning (FL) enables collaborative learning of computer vision models, where privacy and regulatory constraints prevent centralizing data across devices or organizations…

cs.CL2026

Response-Conditioned Parallel-to-Sequential Orchestration for Multi-Agent Systems

Nurbek Tastan, Alex Iacob, Lorenzo Sani +4

Multi-agent systems can solve complex tasks through collaboration between multiple Large Language Model agents. Existing collaboration frameworks typically operate in either a para…

cs.LG2026

Data-Free Contribution Estimation in Federated Learning using Gradient von Neumann Entropy

Asim Ukaye, Mubarak Abdu-Aguye, Nurbek Tastan +1

Client contribution estimation in Federated Learning is necessary for identifying clients' importance and for providing fair rewards. Current methods often rely on server-side vali…

cs.LG2026

MoSE: Mixture of Slimmable Experts for Efficient and Adaptive Language Models

Nurbek Tastan, Stefanos Laskaridis, Karthik Nandakumar +1

Mixture-of-Experts (MoE) models scale large language models efficiently by sparsely activating experts, but once an expert is selected, it is executed fully. Hence, the trade-off b…

cs.CV2025

SPDMark: Selective Parameter Displacement for Robust Video Watermarking

Samar Fares, Nurbek Tastan, Karthik Nandakumar

The advent of high-quality video generation models has amplified the need for robust watermarking schemes that can be used to reliably detect and track the provenance of generated…

cs.MA2025

Stochastic Self-Organization in Multi-Agent Systems

Nurbek Tastan, Samuel Horvath, Karthik Nandakumar

Multi-agent systems (MAS) based on Large Language Models (LLMs) have the potential to solve tasks that are beyond the reach of any single LLM. However, this potential can only be r…

cs.CV2025

MOLM: Mixture of LoRA Markers

Samar Fares, Nurbek Tastan, Noor Hussein +1

Generative models can generate photorealistic images at scale. This raises urgent concerns about the ability to detect synthetically generated images and attribute these images to…

cs.LG2025

LoFT: Low-Rank Adaptation That Behaves Like Full Fine-Tuning

Nurbek Tastan, Stefanos Laskaridis, Martin Takac +2

Large pre-trained models are commonly adapted to downstream tasks using parameter-efficient fine-tuning methods such as Low-Rank Adaptation (LoRA), which injects small trainable lo…

cs.LG2025

Aequa: Fair Model Rewards in Collaborative Learning via Slimmable Networks

Nurbek Tastan, Samuel Horvath, Karthik Nandakumar

Collaborative learning enables multiple participants to learn a single global model by exchanging focused updates instead of sharing data. One of the core challenges in collaborati…

cs.LG2025

A Framework for Double-Blind Federated Adaptation of Foundation Models

Nurbek Tastan, Karthik Nandakumar

Foundation models (FMs) excel in zero-shot tasks but benefit from task-specific adaptation. However, privacy concerns prevent data sharing among multiple data owners, and proprieta…

cs.LG2025

CYCle: Choosing Your Collaborators Wisely to Enhance Collaborative Fairness in Decentralized Learning

Nurbek Tastan, Samuel Horvath, Karthik Nandakumar

Collaborative learning (CL) enables multiple participants to jointly train machine learning (ML) models on decentralized data sources without raw data sharing. While the primary go…

cs.LG2024

FedPeWS: Personalized Warmup via Subnetworks for Enhanced Heterogeneous Federated Learning

Nurbek Tastan, Samuel Horvath, Martin Takac +1

Statistical data heterogeneity is a significant barrier to convergence in federated learning (FL). While prior work has advanced heterogeneous FL through better optimization object…

cs.LG2024

Redefining Contributions: Shapley-Driven Federated Learning

Nurbek Tastan, Samar Fares, Toluwani Aremu +2

Federated learning (FL) has emerged as a pivotal approach in machine learning, enabling multiple participants to collaboratively train a global model without sharing raw data. Whil…

cs.CV2024

Collaborative Learning of Anomalies with Privacy (CLAP) for Unsupervised Video Anomaly Detection: A New Baseline

Anas Al-lahham, Muhammad Zaigham Zaheer, Nurbek Tastan +1

Unsupervised (US) video anomaly detection (VAD) in surveillance applications is gaining more popularity recently due to its practical real-world applications. As surveillance video…

cs.CV2023★ 2 cited

A Coarse-to-Fine Pseudo-Labeling (C2FPL) Framework for Unsupervised Video Anomaly Detection

Anas Al-lahham, Nurbek Tastan, Zaigham Zaheer +1

Detection of anomalous events in videos is an important problem in applications such as surveillance. Video anomaly detection (VAD) is well-studied in the one-class classification…