Reading view

Transketolase-like 1 potentiates PD-1 blockade in hepatocellular carcinoma by glycolysis to prime dendritic cell lactylation

By: Hengsong Cao · Tian Huang · Yue Chai · Zhengqing Lu · Shipeng Dai · Danyang Xu · Yanshu He · Na Yu · Yuliang Wang · Ziyuan Liu · Yidong Xia · Jie Zhao · Hongyu Wang · Dawei Rong · Yuchen Xie · Chongyu Wang · Pengyu Chen · Juyue Zhou · Li Liu · Zhuozheng Li · Hanyuan Liu · Xiao Li · Xuehao Wang · Weiwei Tang · Yongxiang Xia

27 September 2026 at 18:00

Signal Transduct Target Ther. 2026 Sep 28;11(1):418. doi: 10.1038/s41392-026-02875-2.

ABSTRACT

Hepatocellular carcinoma (HCC) exhibits a suboptimal response to immune checkpoint blockade (ICB) therapy; to overcome this resistance, we aimed to delineate key immune resistance factors via multi-omics analysis, develop strategies to block their immunosuppressive axes, and engineer a targeted nanosystem to enhance immunotherapy efficacy against PD-1 resistance in HCC. Using transcriptomic and proteomic data from anti-PD-1-treated HCC patients, along with functional validation in murine models and mechanistic molecular and cell biology studies, we identified transketolase-like 1 (TKTL1) as a dual-nature biomarker where overexpression predicted poor baseline prognosis yet enhanced response to ICB. Mechanistically, TKTL1 diverts glucose flux into glycolysis rather than pentose phosphate pathway (PPP), recruiting USP9X to deubiquitinate and stabilize HIF-1α, which upregulates HK2 to amplify glycolytic output and lactate accumulation. This metabolic rewiring orchestrates dual immunosuppressive circuits through HIF-1α-driven CCL4 secretion recruiting PD-L1^high dendritic cells (DCs), coupled with lactate-induced TRIM28^K408 lactylation that stabilizes PD-L1 by blocking ubiquitin-mediated degradation. We engineered a hepatoma-membrane-coated MnO₂ nanosystem (CQLH) co-delivering a TKTL1 inhibitor and lactate oxidase, which disrupted the TKTL1-HIF-1α-HK2 axis, depleted lactate, and reprogrammed the tumor microenvironment, thereby enhanced anti-PD-1 therapy to suppress tumor growth, especially in TKTL1^high tumors. These findings define a critical "TKTL1-glycolysis-lactate-DC" axis driving anti-PD-1 sensitivity in HCC, position TKTL1 as both a potential biomarker for ICB response and a tractable therapeutic target, and demonstrate that the targeted CQLH nanosystem overcomes resistance and enhances anti-PD-1 efficacy, offering a precision immunotherapeutic strategy for TKTL1^high HCC.

PMID:42802226 | PMC:PMC13616917 | DOI:10.1038/s41392-026-02875-2

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.