❌

Normal view

Received today β€” 7 October 2026 ⏭

Inositol Metabolism Modulates Inflammatory Injury in Acute Pancreatitis via the ISYNA1-NETs Axis

βœ‡(Multiomics OR Omics) AND (Pancreatic)
By: Fei Han Β· Xinyi Liu Β· Yinghong Fan Β· Lin Chen Β· Xiaolei Shi Β· Yaning Wang Β· Weiming Xiao Β· Guotao Lu Β· Keyan Wu Β· Tianqi Xia Β· Jinqiang Zhuang Β· Runfeng Sun
27 September 2026 at 18:00

J Inflamm Res. 2026 Sep 22;19:606503. doi: 10.2147/JIR.S606503. eCollection 2026.

ABSTRACT

BACKGROUND: Neutrophil extracellular traps (NETs) were key factors mediating inflammatory injury in acute pancreatitis (AP). To this end, there was an urgent need to identify precise and effective therapeutic targets that modulate NETs formation, providing new ideas for the prevention and treatment of AP pancreatitis injury.

GAP: To address this gap, we investigated the potential involvement of the myo-inositol metabolism in modulating NETs and inflammatory damage during AP.

METHODS: Multi-omics analysis identified myo-inositol metabolism as critical. We then established the in vitro NETs model using phorbol-12-myristate-13-acetate (PMA) to investigate the role and regulatory mechanism of inositol-3-phosphate synthase 1 (ISYNA1) on NETs formation. Finally, the findings were validated in the classic AP mouse model to verify the correlation between myo-inositol metabolism and AP pathogenesis.

RESULTS: Multiple omics analyses showed that the myo-inositol metabolic pathway is the most significant, and the key enzyme ISYNA1 involved in myo-inositol synthesis was significantly reduced. ISYNA1 was significantly downregulated in both the in vitro NETs model and in neutrophils infiltrating the pancreatic tissue of AP mice. Meanwhile, exogenous supplementation of ISYNA1 or myo-inositol significantly inhibited the NETs formation in vitro and inflammatory injury in AP mice. Mechanistically, downregulation of ISYNA1 led to reduced myo-inositol synthesis, thereby promoting NETs formation via modulation of the PI3K/AKT pathway.

CONCLUSION: ISYNA1 and myo-inositol metabolism were among the key links that regulated NETs formation and inflammatory injury in AP. Therefore, enhancing ISYNA1 and myo-inositol metabolism might serve as a potential intervention target for treating acute organ injury in AP.

PMID:42801157 | PMC:PMC13615823 | DOI:10.2147/JIR.S606503

Received β€” 2 April 2026 ⏭

Byzantine-Robust and Communication-Efficient Distributed Training: Compressive and Cyclic Gradient Coding

βœ‡cs.AI, q-bio.NC updates on arXiv.org
By: Chengxi Li Β· Youssef Allouah Β· Rachid Guerraoui Β· Mikael Skoglund Β· Ming Xiao
1 April 2026 at 12:00
arXiv:2603.28780v1 Announce Type: cross Abstract: In this paper, we study the problem of distributed training (DT) under Byzantine attacks with communication constraints. While prior work has developed various robust aggregation rules at the server to enhance robustness to Byzantine attacks, the existing methods suffer from a critical limitation in that the solution error does not diminish when the local gradients sent by different devices vary considerably, as a result of data heterogeneity among the subsets held by different devices. To overcome this limitation, we propose a novel DT method, cyclic gradient coding-based DT (LAD). In LAD, the server allocates the entire training dataset to the devices before training begins. In each iteration, it assigns computational tasks redundantly to the devices using cyclic gradient coding. Each honest device then computes local gradients on a fixed number of data subsets and encodes the local gradients before transmitting to the server. The server aggregates the coded vectors from the honest devices and the potentially incorrect messages from Byzantine devices using a robust aggregation rule. Leveraging the redundancy of computation across devices, the convergence performance of LAD is analytically characterized, demonstrating improved robustness against Byzantine attacks and significantly lower solution error. Furthermore, we extend LAD to a communication-efficient variant, compressive and cyclic gradient coding-based DT (Com-LAD), which further reduces communication overhead under constrained settings. Numerical results validate the effectiveness of the proposed methods in enhancing both Byzantine resilience and communication efficiency.
Received β€” 25 February 2026 ⏭

Heterogeneity-Aware Client Sampling for Optimal and Efficient Federated Learning

βœ‡cs.AI, q-bio.NC updates on arXiv.org
By: Shudi Weng Β· Chao Ren Β· Ming Xiao Β· Mikael Skoglund
24 February 2026 at 13:00
arXiv:2505.11304v3 Announce Type: replace-cross Abstract: Federated learning (FL) commonly involves clients with diverse communication and computational capabilities. Such heterogeneity can significantly distort the optimization dynamics and lead to objective inconsistency, where the global model converges to an incorrect stationary point potentially far from the pursued optimum. Despite its critical impact, the joint effect of communication and computation heterogeneity has remained largely unexplored, due to the intrinsic complexity of their interaction. In this paper, we reveal the fundamentally distinct mechanisms through which heterogeneous communication and computation drive inconsistency in FL. To the best of our knowledge, this is the first unified theoretical analysis of general heterogeneous FL, offering a principled understanding of how these two forms of heterogeneity jointly distort the optimization trajectory under arbitrary choices of local solvers. Motivated by these insights, we propose Federated Heterogeneity-Aware Client Sampling, FedACS, a universal method to eliminate all types of objective inconsistency. We theoretically prove that FedACS converges to the correct optimum at a rate of $O(1/\sqrt{R})$, even in dynamic heterogeneous environments. Extensive experiments across multiple datasets show that FedACS outperforms state-of-the-art and category-specific baselines by 4.3%-36%, while reducing communication costs by 22%-89% and computation loads by 14%-105%, respectively.
Received β€” 17 February 2026 ⏭

Heterogeneity-Aware Client Sampling for Optimal and Efficient Federated Learning

βœ‡cs.AI, q-bio.NC updates on arXiv.org
By: Shudi Weng Β· Chao Ren Β· Ming Xiao Β· Mikael Skoglund
17 February 2026 at 13:00
arXiv:2505.11304v2 Announce Type: replace-cross Abstract: Federated learning (FL) commonly involves clients with diverse communication and computational capabilities. Such heterogeneity can significantly distort the optimization dynamics and lead to objective inconsistency, where the global model converges to an incorrect stationary point potentially far from the pursued optimum. Despite its critical impact, the joint effect of communication and computation heterogeneity has remained largely unexplored, due to the intrinsic complexity of their interaction. In this paper, we reveal the fundamentally distinct mechanisms through which heterogeneous communication and computation drive inconsistency in FL. To the best of our knowledge, this is the first unified theoretical analysis of general heterogeneous FL, offering a principled understanding of how these two forms of heterogeneity jointly distort the optimization trajectory under arbitrary choices of local solvers. Motivated by these insights, we propose Federated Heterogeneity-Aware Client Sampling, FedACS, a universal method to eliminate all types of objective inconsistency. We theoretically prove that FedACS converges to the correct optimum at a rate of $O(1/\sqrt{R})$, even in dynamic heterogeneous environments. Extensive experiments across multiple datasets show that FedACS outperforms state-of-the-art and category-specific baselines by 4.3%-36%, while reducing communication costs by 22%-89% and computation loads by 14%-105%, respectively.
There are no more articles
❌