❌

Reading view

RFC4 drives temozolomide resistance in glioblastoma by activating STK38-BECN1-dependent autophagy

Nat Commun. 2026 Mar 23. doi: 10.1038/s41467-026-70798-1. Online ahead of print.

ABSTRACT

Glioblastoma (GBM) remains a lethal brain tumor due to therapy resistance. While autophagy contributes to temozolomide (TMZ) resistance, its regulation is incompletely understood. This study investigates the role of replication factor RFC4, which is associated with poor prognosis and TMZ resistance in GBM. Multi-omics analyses and molecular experiments reveal that TMZ-induced chromatin accessibility enables transcription factor YY1 to bind the RFC4 promoter and upregulate its expression. RFC4, in turn, stabilizes the kinase STK38, which is essential for autophagosome formation. The RFC4-STK38 interaction facilitates BECN1 recruitment, thereby activating autophagy. Phosphorylation of STK38 at T444 stabilizes this complex, whereas a phospho-deficient mutant impairs autophagy. In vivo, RFC4 overexpression confers TMZ resistance, reversible by autophagy inhibition. Thus, our findings identify the RFC4-STK38-BECN1 axis as a mechanism underlying TMZ resistance and a potential target for precision therapy in GBM.

PMID:41872171 | DOI:10.1038/s41467-026-70798-1

  •  

DARC: Disagreement-Aware Alignment via Risk-Constrained Decoding

arXiv:2603.08145v1 Announce Type: cross Abstract: Preference-based alignment methods (e.g., RLHF, DPO) typically optimize a single scalar objective, implicitly averaging over heterogeneous human preferences. In practice, systematic annotator and user-group disagreement makes mean-reward maximization brittle and susceptible to proxy over-optimization. We propose **Disagreement-Aware Alignment via Risk-Constrained Decoding (DARC)**, a retraining-free inference-time method that frames response selection as distributionally robust, risk-sensitive decision making. Given multiple preference samples or scalable disagreement proxies, DARC reranks candidates by maximizing a *KL-robust (entropic)* satisfaction objective, and provides simple deployment controls that cap or penalize the corresponding entropic risk premium relative to the mean, enabling explicit risk budgets without retraining. We provide theoretical characterization linking this decoding rule to principled pessimism and KL-based distributionally robust optimization. Experiments on alignment benchmarks show that DARC reduces disagreement and tail risk while maintaining competitive average quality under noisy, heterogeneous feedback.
  •  

Efficient Semi-Supervised Adversarial Training via Latent Clustering-Based Data Reduction

arXiv:2501.10466v4 Announce Type: replace-cross Abstract: Learning robust models under adversarial settings is widely recognized as requiring a considerably large number of training samples. Recent work proposes semi-supervised adversarial training (SSAT), which utilizes external unlabeled or synthetically generated data and is currently the state of the art. However, SSAT requires substantial extra data to attain high robustness, resulting in prolonged training time and increased memory usage. In this paper, we propose data reduction strategies to improve the efficiency of SSAT by optimizing the amount of additional data incorporated. Specifically, we design novel latent clustering-based techniques to select or generate a small, critical subset of data samples near the model's decision boundary. While focusing on boundary-adjacent points, our methods maintain a balanced ratio between boundary and non-boundary data points, thereby avoiding overfitting. Comprehensive experiments across image benchmarks demonstrate that our methods can effectively reduce SSAT's data requirements and computational costs while preserving its strong robustness advantages. In particular, our latent-space selection scheme based on k-means clustering and our guided diffusion-based approach with LCG-KM are the most effective, achieving nearly identical robust accuracies with 5 times to 10 times less unlabeled data. When compared to full SSAT trained to convergence, our methods reduce total runtime by approximately 3 times to 4 times due to strategic prioritization of unlabeled data.
  •  

Discern Truth from Falsehood: Reducing Over-Refusal via Contrastive Refinement

arXiv:2603.03323v1 Announce Type: cross Abstract: Large language models (LLMs) aligned for safety often suffer from over-refusal, the tendency to reject seemingly toxic or benign prompts by misclassifying them as toxic. This behavior undermines models' helpfulness and restricts usability in sensitive or nuanced contexts. While prior work has proposed mitigation strategies such as data augmentation and activation steering, these approaches often face a trade-off: reducing over-refusal typically degrades the model's ability to reject genuinely harmful content. We argue that this issue arises from the ambiguous influence of toxic and seemingly toxic prompts on the model's learning dynamics. To address it, we introduce a preceding alignment stage, DCR: Discernment via Contrastive Refinement. Both theoretically and empirically, we demonstrate that contrastive refinement improves an LLM's capacity to distinguish truly toxic prompts from superficially toxic ones. Evaluation across diverse benchmarks shows that our method effectively reduces over-refusal while preserving the safety benefits of alignment. Importantly, it achieves this with minimal degradation of general capabilities, offering a more principled and robust direction for safety alignment.
  •  
❌