❌

Normal view

Received — 27 May 2026 ⏭

Mode-as-Sequence: Translating Multimodal Motion Prediction into Unified Sequential Mode Modeling

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zikang Zhou · Haibo Hu · Xinhong Chen · Yifan Zhang · Nan Guan · Yung-Hui Li · Chun Jason Xue · Jianping Wang
26 May 2026 at 12:00
arXiv:2605.24037v1 Announce Type: cross Abstract: Multimodal motion forecasting is inherently under-supervised: each training scene provides only one realized future, yet multiple plausible futures exist. This sparse supervision often leads to mode collapse (redundant hypotheses and insufficient mode coverage) and unreliable confidence ranking when predicting a small set of trajectories. We propose Mode-as-Sequence, a unified decoding framework that translates an unordered mode set into an ordered mode sequence and explicitly models mode-to-mode dependency. Under this framework, we develop two complementary instantiations. ModeSeq performs recurrent mode decoding, where each mode is generated conditioned on the previously generated modes, encouraging diverse, non-redundant hypotheses with calibrated confidence ordering. To remove the mode-by-mode autoregressive bottleneck, we further propose Parallel ModeSeq, which preserves the same causal dependency using masked mode-to-mode self-attention while decoding all modes in a single forward pass, enabling efficient large-$K$ inference and scalable joint-scene prediction. To learn representative modes and calibrated confidence under sparse labels, we introduce Early-Match-Take-All (EMTA) and its joint-scene extension MA-EMTA, together with a lightweight ranking regularizer that reduces confidence inversions. Extensive experiments on large-scale benchmarks demonstrate consistent improvements in both ranking-oriented metrics and best-of-K accuracy across datasets, horizons, and object types. In the Waymo Open Dataset challenges, ModeSeq achieves 1st place in the 2024 LiDAR-free motion prediction track, and Parallel ModeSeq achieves 1st place in the 2025 Interaction Prediction Challenge, validating the effectiveness of Mode-as-Sequence for both accuracy and efficiency.

CollectionLoRA: Collecting 50 Effects in 1 LoRA via Multi-Teacher On-Policy Distillation

✇cs.AI, q-bio.NC updates on arXiv.org
By: Fangtai Wu · Hailong Guo · Shijie Huang · Jiayi Song · Yubo Huang · Mushui Liu · Zhao Wang · Yunlong Yu · Jiaming Liu · Ruihua Huang
26 May 2026 at 12:00
arXiv:2605.25378v1 Announce Type: cross Abstract: Customized image editing aims to equip pre-trained diffusion models with specific visual effects using limited paired data, typically via Low-Rank Adaptation (LoRA). As the number of desired effects grows, storing and dynamically loading numerous these effect LoRAs significantly increases deployment overhead. Furthermore, current pipelines typically cascade these effect LoRAs with acceleration modules for fast generation, which triggers severe parameter interference and results in concept bleeding and style degradation. We propose CollectionLoRA, a multi-teacher on-policy distillation framework capable of distilling the concepts of up to 50 different effect LoRAs along with few-step generation capabilities into a single LoRA. This fundamentally resolves the feature interference issue and significantly reduces deployment costs. Specifically, the method introduces (i) a Probabilistic Dual-Stream Routing mechanism that enables the model to randomly switch between data sources during training, effectively enhancing its generalization in unseen scenarios; (ii) an Asymmetric Orthogonal Prompting strategy to achieve concept isolation within the prompt space; (iii) a Coarse-to-Fine Distillation Objective to mitigate the distribution gap between the teacher and student models. Extensive evaluations show that CollectionLoRA distills all customized effects and few-step generation into a single LoRA, reducing deployment overhead while achieving concept fidelity comparable to or better than independently trained teacher models.

Automated Place Preference Paradigm for Optogenetic Stimulation of the Pedunculopontine Nucleus Reveals Motor Arrest-Linked Preference Behavior

✇cs.AI, q-bio.NC updates on arXiv.org
By: Guanghui Li · Xingfei Hou · Zhenxiang Zhao
26 May 2026 at 12:00
arXiv:2601.12054v4 Announce Type: replace Abstract: Understanding how the brain integrates motor suppression with motivational processes remains a fundamental question in neuroscience. The rostral Pedunculopontine nucleus, a brainstem structure involved in motor control, has been shown to induce transient motor arrest upon optogenetic or electrical stimulation. However, our current understanding of its potential role in linking motor suppression with motivational or reinforcement-related processes is still insufficient. To further explore the effects induced by PPN stimulations and infer the potential mechanism underlying its role involved in both motor and emotional regulation, we developed a fully automated, low-cost system combining real-time animal tracking with closed-loop optogenetic stimulation, using the OpenMV Cam H7 Plus and embedded neural network models. The system autonomously detects the rat's position and triggers optical stimulation upon entry into a predefined region of interest, enabling unbiased, unsupervised behavioral assays. Optogenetic activation of CaMKIIa-expressing neurons in the rostral PPN reliably induced transient motor arrest. When motor arrest was spatially paired with a defined region of interest, rats developed a robust place preference after limited training. These results suggest that rostral PPN activation can couple motor inhibition with reinforcement-related behavioral circuitry. Together, our work provides both a technical framework for scalable closed-loop neuroscience experiments and preliminary evidence that the rostral PPN may participate in coordinating motor suppression with motivational processes.

Membership Inference Attacks on Tokenizers of Large Language Models

✇cs.AI, q-bio.NC updates on arXiv.org
By: Meng Tong · Yuntao Du · Kejiang Chen · Weiming Zhang · Ninghui Li
26 May 2026 at 12:00
arXiv:2510.05699v4 Announce Type: replace-cross Abstract: Membership inference attacks (MIAs) are widely used to assess the privacy risks associated with machine learning models. However, when these attacks are applied to pre-trained large language models (LLMs), they encounter significant challenges, including mislabeled samples, distribution shifts, and discrepancies in model size between experimental and real-world settings. To address these limitations, we introduce tokenizers as a new attack vector for membership inference. Specifically, a tokenizer converts raw text into tokens for LLMs. Unlike full models, tokenizers can be efficiently trained from scratch, thereby avoiding the aforementioned challenges. In addition, the tokenizer's training data is typically representative of the data used to pre-train LLMs. Despite these advantages, the potential of tokenizers as an attack vector remains unexplored. To this end, we present the first study on membership leakage through tokenizers and explore five attack methods to infer dataset membership. Extensive experiments on millions of Internet samples reveal the vulnerabilities in the tokenizers of state-of-the-art LLMs. To mitigate this emerging risk, we further propose an adaptive defense. Our findings highlight tokenizers as an overlooked yet critical privacy threat, underscoring the urgent need for privacy-preserving mechanisms specifically designed for them.

Memorize Theorems, Not Instances: Probing SFT Generalization through Mathematical Reasoning

✇cs.AI, q-bio.NC updates on arXiv.org
By: Ruiying Peng · Mengyu Yang · Jing Lei · Xiaohui Li · Xueyu Wu · Xinlei Chen
26 May 2026 at 12:00
arXiv:2605.09270v2 Announce Type: replace-cross Abstract: Supervised Fine-Tuning (SFT) is widely used for task-specific adaptation, yet recent work shows it systematically undermines reasoning generalization. We argue the root cause is not memorization itself, but its target: vanilla SFT drives models to exploit and memorize spurious surface correlations in problem-solution pairs, leaving them brittle to superficial input variations. To address this, we propose Theorem-SFT, which reorients supervision toward explicit theorem application by teaching models how rules are invoked rather than what answers look like. Theorem-SFT yields consistent gains across benchmarks and model families: +8.8% on MATH (LLaMA3.2-3B-Instruct) and +20.27% on GeoQA (Qwen2.5-VL-7B-Instruct) without modality-specific re-training. Fine-tuning MLP layers alone matches full-layers performance, implicating feed-forward components as the primary locus of reasoning rules. Our findings reframe the debate: Generalization failures stem not from memorization as a mechanism, but from memorizing the wrong inductive targets.

SURGE: Surrogate Gradient Adaptation in Binary Neural Networks

✇cs.AI, q-bio.NC updates on arXiv.org
By: Haoyu Huang · Boyu Liu · Linlin Yang · Yanjing Li · Yuguang Yang · Xuhui Liu · Canyu Chen · Zhongqian Fu · Baochang Zhang
26 May 2026 at 12:00
arXiv:2605.10989v3 Announce Type: replace-cross Abstract: The training of Binary Neural Networks (BNNs) is fundamentally based on gradient approximation for non-differentiable binarization operations (e.g., sign function). However, prevailing methods including the Straight-Through Estimator (STE) and its improved variants, rely on hand-crafted designs that suffer from gradient mismatch problem and information loss induced by fixed-range gradient clipping. To address this, we propose SURrogate GradiEnt Adaptation (SURGE), a novel learnable gradient compensation framework with theoretical grounding. SURGE mitigates gradient mismatch through auxiliary backpropagation. Specifically, we design a Dual-Path Gradient Compensator (DPGC) that constructs a parallel full-precision auxiliary branch for each binarized layer, decoupling gradient flow via output decomposition during backpropagation. DPGC enables bias-reduced gradient estimation by leveraging the full-precision branch to estimate components beyond STE's first-order approximation. To further enhance training stability, we introduce an Adaptive Gradient Scaler (AGS) based on an optimal scale factor to dynamically balance inter-branch gradient contributions via norm-based scaling. Experiments on image classification, object detection, and language understanding tasks demonstrate that SURGE performs best over state-of-the-art methods.

Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension

✇cs.AI, q-bio.NC updates on arXiv.org
By: Hong Qian · Xiang Shu · Xiang Xia · Xuhui Liu · Yangde Fu · Bei Liang · Huibin Wang · Liang Dou
26 May 2026 at 12:00
arXiv:2605.23473v2 Announce Type: replace-cross Abstract: Bayesian optimization is widely employed for optimizing complex black-box functions but struggles with the curse of dimensionality. Random embedding, as a dimension reduction strategy, simplifies tasks that possess the effective dimension by optimizing within a low-dimensional subspace. However, determining the effective dimension of a task in advance remains a significant challenge, which influences the selection of the subspace dimensionality and the optimization performance. Traditional methods use fixed subspace dimensions provided by experts or rely on trial and error to estimate subspace dimensions with resources consumed. To this end, this paper proposes an automated random embedding for high-dimensional Bayesian optimization with unknown effective dimension, called Dynamic Shared Embedding Bayesian Optimization (DSEBO). DSEBO starts with a low dimension and switches to a higher subspace if the solutions in the current subspace show preliminary convergence. DSEBO dynamically determines the dimension of the next subspace based on the quality of the solutions in different subspaces and shares the queried solutions with the new subspace for a better initialization. Theoretically, we derive a regret bound for DSEBO and demonstrate that DSEBO can better balance approximation and optimization errors. Extensive experiments on functions with dimensionality of varying magnitudes and real-world tasks with unknown effective dimensions reveal that, compared with state-of-the-art methods, alternating optimization across different subspaces results in significant improvements in high-dimensional optimization, both in terms of optimization regret and time.

CoSPlay: Cooperative Self-Play at Test-Time with Self-Generated Code and Unit Test

✇cs.AI, q-bio.NC updates on arXiv.org
By: Zhangyi Hu · Chenhui Liu · Tian Huang · Jindong Li · Yang Yang · Jiemin Wu · Zining Zhong · Menglin Yang · Yutao Yue
26 May 2026 at 12:00
arXiv:2605.23491v2 Announce Type: replace-cross Abstract: Recently, Reinforcement Learning with Verifiable Rewards (RLVR) and Test-Time Scaling (TTS) have advanced LLM code generation through executable verification. Yet Ground-Truth Unit Tests (GT UTs) remain a bottleneck: SOTA RLVR methods require them for costly training, while existing TTS methods lose competitiveness without them. This motivates GT-free TTS, where existing methods directly use self-generated UTs to refine and select code candidates. Yet such UTs are often noisy or spuriously coupled with wrong code, and UT quality in turn cannot be validated without reliable code. The key challenge is therefore to jointly improve both. To this end, we present CoSPlay, a GT-free, training-free framework that jointly improves codes and UTs through cooperative self-play. It first explores diverse solution ideas and identifies their potential failure modes to produce discriminative UT ideas. It then uses bidirectional pass-count signals from the Code-UT execution matrix to iteratively prune or fix weak codes and refresh or replace unreliable UTs, letting the two pools co-evolve. Finally, when multiple codes remain tied at the highest pass count, it picks the final code from the largest output-consensus cluster, since correct codes agree on the same inputs while wrong codes diverge. Experiments on four challenging benchmarks show that CoSPlay on Qwen2.5-7B-Instruct improves average BoN from 22.1% to 33.2% and UT accuracy from 14.6% to 78.3%, matching or surpassing the RLVR model CURE-7B. When applied to CURE-7B, it further improves BoN by 5.7%. CoSPlay also generalizes across diverse backbones and outperforms GT-free TTS baselines under comparable token budgets, with continued gains as the budget scales up. These results suggest a scalable inference strategy for competitive code generation without any GT data.

ATIC Promotes LIHC Progression and Serves as an Independent Prognostic Marker: A Pan-cancer Transcriptomic Analysis

✇Omics in Hepatocellular
By: Hui Li · Wentao Zhang · Xiaojie Zhou · Weiming Wu · Fuwen Yao · Haojie Zhong · Naiyang Zhan · JianWei Chen · Yongqiang Zhan · Xinping Yang
19 May 2026 at 18:00

Curr Mol Med. 2026 May 11. doi: 10.2174/0115665240438824260113042223. Online ahead of print.

ABSTRACT

BACKGROUND: 5-aminoimidazole-4-carboxamide ribonucleotide formyltransferase/ IMP cyclohydrolase(ATIC) is a 64-kDa bifunctional enzyme, 5-aminoimidazole- 4-carboxamide ribonucleotide formyltransferase (AICART) and IMP cyclohydrolase, respectively. catalyzes the last two steps of the purine ab initio biosynthetic pathway. ATIC has been implicated in cancer progression, but its pan-cancer profile and specific prognostic utility in liver hepatocellular carcinoma (LIHC) remain incompletely defined.

METHODS: We analyzed TCGA RNA-seq data across 33 tumor types to assess ATIC expression, diagnostic performance (ROC/AUC), and prognostic associations (OS, DSS, PFI). We correlated ATIC expression with immune infiltration, TMB, MSI, and predicted neoantigen load, and constructed a LIHC-specific prognostic nomogram integrating ATIC and clinicopathologic features. Enrichment analyses (STRING, GO/KEGG, GSEA) and pharmacogenomic correlations (GDSC, CTRP) were performed to explore mechanisms and drug sensitivities.

RESULTS: ATIC was significantly upregulated in 16 tumor types, including LIHC (p<0.001). Pan-cancer ROC analyses showed high diagnostic accuracy in several cancers (examples: CHOL AUC=1.000, LIHC AUC=0.936, LUAD AUC=0.947). High ATIC expression associated with poorer OS in ACC, HNSC, LIHC, and PAAD (eg, LIHC: HR=1.39(1.04-1.85), p=0.028). In LIHC, ATIC correlated with advanced T stage, higher grade, elevated AFP, and shorter OS. Multivariable Cox regression identified ATIC expression and pathological T stage as independent predictors; time-dependent ROC for the LIHC nomogram showed AUCs of 0.711, 0.649, and 0.653 at 1, 3, and 5 years, respectively. GSEA indicated enrichment of PI3K-AKT-mTOR, MYC targets, and cell-cycle pathways in ATIC-high LIHC. High ATIC expression correlated with predicted increased sensitivity to sorafenib, doxorubicin, cisplatin, epothilone, and mitomycin in the TCGA-LIHC cohort.

DISCUSSION: ATIC upregulation across cancers links to tumor progression, immune modulation, and prognosis (LIHC), suggesting oncogenic roles in pan-cancer contexts. TCGA multi-omics show ATIC associates with immune/molecular subtypes, MSI/TMB/neoantigens, and predicts drug sensitivity, indicating diagnostic/prognostic potential.

CONCLUSION: ATIC is broadly upregulated across cancers and functions as an independent prognostic biomarker in LIHC. The ATIC-integrated nomogram shows modest predictive accuracy for LIHC survival. Our results implicate ATIC in oncogenic signaling (PI3K-AKT-mTOR, MYC, and cell-cycle) and suggest ATIC as a candidate biomarker to guide targeted and chemotherapeutic strategies in LIHC. Further in vitro and in vivo validation is warranted.

PMID:42152649 | DOI:10.2174/0115665240438824260113042223

CD300ld on pathologically activated neutrophils promotes tumor immune suppression by binding phosphatidylserine on CD8<sup>+</sup> T cells

✇Nature Cancer
By: Chaoxiong Wang · Peixuan Zheng · Anhui Wang · Xinrui Fan · Tianxiang Li · Jingjing Hong · Runze Wang · Chunyan Zhang · Chaogui Luo · Weiwei Yang · Dong Gao · Adili Salai · Min Luo · Zhigang Lu · Dianfan Li · Moubin Lin · Jiayin Peng · Guohui Li · Shuo Han · Yun Zhao
15 May 2026 at 08:00

Nature Cancer, Published online: 15 May 2026; doi:10.1038/s43018-026-01169-4

Zhao and colleagues show that CD300ld, upregulated in pathologically activated neutrophils, mediates contact-dependent suppression of cytotoxic CD8+ T cells by binding to phosphatidylserine, inhibiting antitumor immune responses.

Induction of broadly neutralizing HIV antibodies by a two-step mechanism informs vaccine design

✇AAAS: Table of Contents
By: Ashwin N. Skelly · Harry B. Gristick · Hui Li · Edem Gavor · Andrew J. Connell · Edward F. Kreider · Lorie Marchitto · Michael P. Hogarty · Maddy L. Newby · Joel D. Allen · Weimin Liu · Anthony P. West · Kasirajan Ayyanathan · Mary S. Campion · Kaitlyn Winters · Colette G. Gordon · Rebecca A. Osbaldeston · Macy J. Akeley · Emily Lewis · Yingying Li · Ajay Singh · Kendra Cruickshank · Younghoon Park · Chengyan Zhao · Xuduo Li · Khaled Amereh · Elizabeth Van Itallie · John W. Carey · Amie Albertus · Andrew T. DeLaitsch · Jennifer R. Keeffe · Melinda G. Lituchy · Agnes A. Walsh · Daniel J. Morris · Rumi Habib · Frederic Bibollet-Ruche · Nitesh Mishra · Gabriel Avillion · Nicholas S. Koranda · Samantha J. Plante · Christian L. Martella · Jinery Lora · Eric J. D. Wang · Mark G. Lewis · Malcolm A. Martin · Michel C. Nussenzweig · Michael S. Seaman · Darrell J. Irvine · Kevin J. Wiehe · Barton F. Haynes · Kshitij Wagh · Bette Korber · Raiees Andrabi · Max Crispin · Drew Weissman · Pamela J. Bjorkman · Beatrice H. Hahn · George M. Shaw
7 May 2026 at 13:59
Science, Ahead of Print.

Pixelated quantum-dot superlattice LEDs

✇Nature - Issue - nature.com science feeds
By: Chengxi Zhang · Qingsen Zeng · Hui Li · Renjun Guo · Yue Yu · Linjie Dai · Lyudmila Turyanska · Zirui Liu · Jun Dai · Yingguo Yang · Yue Zhao · Jun Lu · Lin Wang · Lingmei Kong · Tze Chien Sum · Yuchen Wu · Tae-Woo Lee · Xuyong Yang
15 April 2026 at 08:00

Nature, Published online: 15 April 2026; doi:10.1038/s41586-026-10392-z

Scalable fabrication of ordered perovskite quantum dot superlattices enables high-efficiency, ultrahigh-resolution LEDs and active-matrix displays with greatly improved brightness, stability and device lifetime.

Imaging interface-controlled bulk oxygen spillover

✇Nature - Issue - nature.com science feeds
By: Weijue Wang · Hongbin Xu · Shuhui Liu · Xiaofeng Yang · Wei Liu · Yang-Gang Wang · Yanqiang Huang · Tao Zhang
15 April 2026 at 08:00

Nature, Published online: 15 April 2026; doi:10.1038/s41586-026-10324-x

In situ microscopic single-particle imaging demonstrates the significance of rationally engineered metal–support interfaces for activating the oxygen in bulk catalyst, helping elucidate reaction pathways in catalytic conversions.
There are no more articles
❌