Single-Cell Annotation Vulnerable to Companion Cell Removal
Key takeaways
- Single-cell annotation tools relying on neighborhood refinement are vulnerable to manipulation.
- Removing non-target "companion" cells can alter refined labels without changing the target cell.
- Structured removal methods are more effective at manipulating annotations than random removal.
- The composition of the query cohort is a critical, yet overlooked, attack surface.
Who benefits
Summary
This study introduces CohortHijack, an audit revealing that single-cell annotation tools relying on neighborhood refinement are vulnerable to manipulation through the removal of non-target "companion" cells. It shows that even small removals can change refined labels while preserving the target cell's expression profile.
Why it matters
Bioinformaticians and researchers using single-cell annotation tools must be aware of this vulnerability, as manipulated cohort composition could lead to incorrect cell type assignments, impacting downstream biological interpretations and drug discovery efforts.
How to implement this in your domain
- 1Review existing single-cell annotation pipelines for reliance on neighborhood-based refinement.
- 2Implement robustness audits like CohortHijack to test annotation stability against cohort perturbations.
- 3Consider using annotation methods that are less dependent on local neighborhood context or ensemble voting.
- 4Develop strategies to detect and mitigate potential "hijacking" attempts in single-cell datasets.
- 5Educate research teams on the potential for subtle data manipulations to affect annotation outcomes.
Original post by Arash Vashagh, Yasmin Vashagh
"arXiv:2608.05900v1 Announce Type: new Abstract: Many single-cell annotation tools refine an initial cell label using nearby cells or cluster-level voting. We study whether this refinement can be manipulated without changing the target cell. We introduce CohortHijack, a robustness…"
View on XOriginally posted by Arash Vashagh, Yasmin Vashagh on X · view source
Want to go deeper?
Turn these trends into skills with Learnijoy's hands-on AI & tech courses.
Explore coursesMore in AI Research
Early Stopping Reduces Operations in Binary Neural Networks
This paper introduces a post-training early-stopping mechanism for binary neural networks that significantly reduces the number of accumulation operations. By predicting the final sign of a neuron's output early, the method removes up to 86.6% of accumulation terms in deep convolutions with minimal accuracy drop, making binary networks more efficient for constrained deployments.
SkillTFM Enables Training-Free Adaptation for Tabular Foundation Models
SkillTFM is a novel training-free system that adapts Tabular Foundation Models (TFMs) to new tasks by evolving agentic skills rather than parameter updates. It uses a verifiable skill bank with boundary evidence identification and gated skill evolution, significantly improving AUC and addressing distribution shifts and heterogeneous feature semantics.
New WAIT Algorithm Extension Optimizes LLM Inference for Bursty Workloads
Researchers propose a lightweight extension to the WAIT algorithm that dynamically adapts to bursty LLM request arrivals without prior traffic knowledge. Simulations show this modified algorithm achieves higher throughput than state-of-the-art methods like Sarathi-Serve, ORCA, and vLLM in low arrival-rate shift scenarios while maintaining comparable latency.