arXiv:2311. 00260v2 Announce Type: replace-cross Abstract: In collaborative active learning, where multiple agents try to learn labels from a common hypothesis, we introduce an innovative framework for incentivized collaboration.
arXiv:2512.12870v2 Announce Type: replace-cross Abstract: Active Learning (AL) is commonly used in applications where labeling data is expensive or time-consuming. In practice, however, labels are of...
The paper investigates how the ability to synthesize arbitrary queries (membership queries) changes the sample complexity of active learning compared to the traditional pool-based setting. It shows that some hypothesis classes that only achieve polynomial error decay with pool-based queries become exponentially learnable when synthesis is allowed, revealing a significant gap in learning difficulty. The authors propose sufficient conditions, provide examples, and suggest a conjectural framework to identify classes that benefit from synthesized queries.
arXiv:2607. 04869v1 Announce Type: new Abstract: Motivated by real-world scenarios where malicious entities tamper with existing networks, we define a model where an adversary seeks to hide a set of \emph{corrupted vertices} inside a graph $G^*$.
arXiv:2606. 11130v1 Announce Type: new Abstract: We study the task of agnostically learning general (as opposed to homogeneous) ReLUs under the Gaussian distribution with respect to the squared loss.
The paper introduces a federated active learning (FAL) approach that tackles data privacy and label scarcity by coordinating query selection across clients. In low-budget scenarios, it finds that homogeneous (IID) data actually requires stronger coordination to avoid redundant queries, while heterogeneous data naturally yields diversity—a reversal of the usual federated learning narrative. The authors propose a new framework that aligns client data in a shared embedding space via federated representation learning, enabling globally coordinated active selection while keeping annotations local, and demonstrate that this method outperforms existing FAL methods even with larger annotation budgets.
The paper introduces Robust Fed-Q, a federated Q‑learning algorithm designed for settings where multiple agents interact with a shared Markov Decision Process and communicate through a central server. It combines model‑based and model‑free reinforcement learning techniques with a median‑of‑means strategy from robust statistics to handle a small fraction of adversarial agents. The authors prove that Robust Fed-Q achieves exact convergence to the optimal value function with high probability, attains near‑optimal finite‑time rates that benefit from collaboration, and requires only “~O(1)” communication rounds per guarantee.
The paper introduces ROTATE, a regret-driven open‑ended training framework that jointly improves an Ad Hoc Teamwork (AHT) agent and an adversarial teammate generator. Unlike traditional two‑stage pipelines, ROTATE alternates between enhancing the agent and generating teammates that specifically probe its collaboration weaknesses. Experiments on Overcooked and Level‑Based Foraging show that ROTATE outperforms existing baselines on unseen teammates, setting a new benchmark for robust, generalizable teamwork.
arXiv:2608. 03249v1 Announce Type: new Abstract: Cold-Start Active Learning (CSAL) aims to select a valuable subset from an unlabeled pool without any prior knowledge or human assistance.
arXiv:2405. 08921v2 Announce Type: replace Abstract: We focus on the online-based active learning (OAL) setting where an agent operates over a stream of observations and trades-off between the costly acquisition of information (labelled observations) and the cost of prediction errors.
arXiv:2409. 04111v2 Announce Type: replace Abstract: Vertical federated learning is a natural and elegant approach to integrate multi-view data vertically partitioned across devices (clients) while preserving their privacies.
The paper evaluates the cost‑effectiveness of consensus‑based learning (CBL) versus federated learning (FL) across seven medical datasets, three tasks, and eight modalities involving 3 to 23 clients. CBL achieves accuracy comparable to FL while dramatically cutting training time (15‑fold) and communication cost (60‑fold). The study suggests that CBL offers a more sustainable and democratized approach to deploying collaborative AI in real‑world healthcare settings.
Asynchronous federated learning improves scalability by updating the global model from a server-side buffer of client updates as they arrive, rather than waiting for all selected clients to finish. Wh...