Skip to main content

Thank you for visiting nature.com. You are using a browser version with limited support for CSS. To obtain the best experience, we recommend you use a more up to date browser (or turn off compatibility mode in Internet Explorer). In the meantime, to ensure continued support, we are displaying the site without styles and JavaScript.

Advertisement

Nature Communications
  • View all journals
  • Search
  • My Account Login
  • Content Explore content
  • About the journal
  • Publish with us
  • Sign up for alerts
  • RSS feed
  1. nature
  2. nature communications
  3. articles
  4. article
Design of robust networks via reinforcement learning prompts the emergence of multi-backbones
Download PDF
Download PDF
  • Article
  • Open access
  • Published: 20 March 2026

Design of robust networks via reinforcement learning prompts the emergence of multi-backbones

  • Bingyu Zhu  ORCID: orcid.org/0009-0006-5668-61971,
  • Tianchen Zhu1,
  • Jianxi Gao  ORCID: orcid.org/0000-0002-3952-208X2,
  • Shlomo Havlin  ORCID: orcid.org/0000-0002-9974-59203 &
  • …
  • Daqing Li  ORCID: orcid.org/0000-0001-9166-351X1,4 

Nature Communications , Article number:  (2026) Cite this article

  • 2611 Accesses

  • 1 Altmetric

  • Metrics details

We are providing an unedited version of this manuscript to give early access to its findings. Before final publication, the manuscript will undergo further editing. Please note there may be errors present which affect the content, and all legal disclaimers apply.

Subjects

  • Complex networks
  • Computational science
  • Computer science

Abstract

Network robustness design is a significant engineering task in complex systems including urban planning, communication programming, and chip designing. With the embedded vulnerability of complex networks, the relationship between network topology and its robustness remains unknown, presenting a significant challenge in designing robust networks. Existing approaches—ranging from empirical manual designs, statistically-driven rules to optimization via Monte Carlo simulations, struggle to meet the design demands of robust networks under multidimensional attacks. Here, we introduce a general framework for designing robust networks based on AI reinforcement learning. This framework establishes an interactive environment between network attack strategies and design models, enabling the learning of effective robustness design strategies against attacks. Our framework enables effective design of robust networks, for a given cost, surpassing existing methods. Notably, we find that during the design process, the network may develop suitable multi-backbones that mitigate its current vulnerability, offering insight into higher-order relations in real-world networks. Our approach can be adopted to various network design scenarios, which provides an integrative intelligent solution for designing robust complex systems.

Similar content being viewed by others

Robustness and resilience of complex networks

Article 08 January 2024

Study on the robust control of higher-order networks

Article Open access 27 February 2025

Examining indicators of complex network vulnerability across diverse attack scenarios

Article Open access 24 October 2023

Data availability

The data used for training and testing the RL agent, the trained neural network parameters, the real networks data, the designed networks data, and corresponding source code are available at https://github.com/Zhu-BY/Design_Robust_Network.

Code availability

All codes used for training, network design based on the trained model, and backbone structure analysis in this research can be freely accessed at: https://github.com/Zhu-BY/Design_Robust_Network.

References

  1. Strogatz, S. H. Exploring complex networks. Nature 410, 268–276 (2001).

    Google Scholar 

  2. Boccaletti, S., Latora, V., Moreno, Y., Chavez, M. & Hwang, D.-U. Complex networks: structure and dynamics. Phys. Rep. 424, 175–308 (2006).

    Google Scholar 

  3. Gao, J., Buldyrev, S. V., Havlin, S. & Stanley, H. E. Robustness of a network of networks. Phys. Rev. Lett. 107, 195701 (2011).

    Google Scholar 

  4. De Domenico, M. et al. Mathematical formulation of multilayer networks. Phys. Rev. X 3, 041022 (2013).

    Google Scholar 

  5. Scarinci, R., Markov, I. & Bierlaire, M. Network design of a transport system based on accelerating moving walkways. Transp. Res. Part C. 80, 310–328 (2017).

    Google Scholar 

  6. Venkataraman, N. L. & Kumar, R. Design and analysis of application specific network on chip for reliable custom topology. Comput. Netw. 158, 69–76 (2019).

    Google Scholar 

  7. Boyken, S. E. et al. De novo design of protein homo-oligomers with modular hydrogen-bond network–mediated specificity. Science 352, 680–687 (2016).

    Google Scholar 

  8. Elhayatmy, G., Dey, N. & Ashour, A. S. Internet of things based wireless body area network in healthcare. In Internet of Things and Big Data Analytics Toward Next-Generation Intelligence, 3–20 (Springer International Publishing, 2018).

  9. Albert, R., Jeong, H. & Barabási, A.-L. Error and attack tolerance of complex networks. Nature 406, 378–382 (2000).

    Google Scholar 

  10. Motter, A. E. & Lai, Y.-C. Cascade-based attacks on complex networks. Phys. Rev. E 66, 065102 (2002).

    Google Scholar 

  11. Buldyrev, S. V., Parshani, R., Paul, G., Stanley, H. E. & Havlin, S. Catastrophic cascade of failures in interdependent networks. Nature 464, 1025–1028 (2010).

    Google Scholar 

  12. Wang, W., Yang, S., Stanley, H. E. & Gao, J. Local floods induce large-scale abrupt failures of road networks. Nat. Commun. 10, 2114 (2019).

    Google Scholar 

  13. Gao, J., Barzel, B. & Barabási, A.-L. Universal resilience patterns in complex networks. Nature 530, 307–312 (2016).

    Google Scholar 

  14. Liu, X. et al. Network resilience. Phys. Rep. 971, 1–108 (2022).

    Google Scholar 

  15. Radicchi, F. & Bianconi, G. Redundant interdependencies boost the robustness of multiplex networks. Phys. Rev. X 7, 011013 (2017).

    Google Scholar 

  16. Beygelzimer, A., Grinstein, G., Linsker, R. & Rish, I. Improving network robustness by edge modification. Phys. A 357, 593–612 (2005).

    Google Scholar 

  17. Zhao, J. & Xu, K. Enhancing the robustness of scale-free networks. J. Phys. A 42, 195003 (2009).

    Google Scholar 

  18. Cao, X.-B., Hong, C., Du, W.-B. & Zhang, J. Improving the network robustness against cascading failures by adding links. Chaos, Solit. Fractals 57, 35–40 (2013).

    Google Scholar 

  19. Zheng, Y. et al. Spatial planning of urban communities via deep reinforcement learning. Nat. Comput. Sci. 3, 748–762 (2023).

    Google Scholar 

  20. Mirhoseini, A. et al. A graph placement methodology for fast chip design. Nature 594, 207–212 (2021).

    Google Scholar 

  21. Watson, J. L. et al. De novo design of protein structure and function with RFdiffusion. Nature 620, 1089–1100 (2023).

    Google Scholar 

  22. Carchiolo, V., Grassia, M., Longheu, A., Malgeri, M. & Mangioni, G. Network robustness improvement via long-range links. Comput. Soc. Netw. 6, 1–16 (2019).

    Google Scholar 

  23. Alenazi, M. J., Cetinkaya, E. K. & Sterbenz, J. P. Cost-efficient algebraic connectivity optimisation of backbone networks. Opt. Switch. Netw. 14, 107–116 (2014).

    Google Scholar 

  24. Paul, G., Tanizawa, T., Havlin, S. & Stanley, H. E. Optimization of robustness of complex networks. Eur. Phys. J. B 38, 187–191 (2004).

    Google Scholar 

  25. Valente, A. X., Sarkar, A. & Stone, H. A. Two-peak and three-peak optimal complex networks. Phys. Rev. Lett. 92, 118702 (2004).

    Google Scholar 

  26. Alenazi, M. J., Cetinkaya, E. K. & Sterbenz, J. P. Cost-constrained and centrality-balanced network design improvement. In Proc. 6th International Workshop on Reliable Networks Design and Modeling (RNDM) 194–201 (IEEE, 2014).

  27. Herrmann, H. J., Schneider, C. M., Moreira, A. A., Andrade, J. S. & Havlin, S. Onion-like network topology enhances robustness against malicious attacks. J. Stat. Mech. 2011, P01027 (2011).

    Google Scholar 

  28. Zeng, A. & Liu, W. Enhancing network robustness against malicious attacks. Phys. Rev. E 85, 066130 (2012).

    Google Scholar 

  29. Buesser, P., Daolio, F. & Tomassini, M. Optimizing the robustness of scale-free networks with simulated annealing. in Adaptive and Natural Computing Algorithms 167–176 (Springer, 2011).

  30. Artime, O. et al. Robustness and resilience of complex networks. Nat. Rev. Phys. 6, 114–131 (2024).

    Google Scholar 

  31. Rubinstein, R. Y. & Kroese, D. P. Simulation and the Monte Carlo Method (John Wiley & Sons, 2016).

  32. Ashlock, D. Evolutionary Computation for Modeling and Optimization (Springer, 2006).

  33. Ong, Y.-S., Zhou, Z. & Lim, D. Curse and blessing of uncertainty in evolutionary algorithm using approximation. In Proc. IEEE International Conference on Evolutionary Computation 2928–2935 (IEEE, 2006).

  34. Fan, C., Zeng, L., Sun, Y. & Liu, Y.-Y. Finding key players in complex networks through deep reinforcement learning. Nat. Mach. Intell. 2, 317–324 (2020).

    Google Scholar 

  35. Zhang, J. & Wang, B. Dismantling complex networks by a neural model trained from tiny networks. In Proc. 31st ACM International Conference on Information & Knowledge Management 2559–2568 (ACM, 2022).

  36. Grassia, M., De Domenico, M. & Mangioni, G. Machine learning dismantling and early-warning signals of disintegration in complex systems. Nat. Commun. 12, 5190 (2021).

    Google Scholar 

  37. Schneider, C. M., Moreira, A. A., Andrade, J. S., Havlin, S. & Herrmann, H. J. Mitigation of malicious attacks on networks. Proc. Natl. Acad. Sci. Usa. 108, 3838–3841 (2011).

    Google Scholar 

  38. Eswaran, K. P. & Tarjan, R. E. Augmentation problems. SIAM J. Comput. 5, 653–665 (1976).

    Google Scholar 

  39. Schulman, J., Moritz, P., Levine, S., Jordan, M. I. & Abbeel, P. High-dimensional continuous control using generalized advantage estimation. 4th International Conference on Learning Representations (2016).

  40. Schulman, J., Wolski, F., Dhariwal, P., Radford, A., & Klimov, O. Proximal policy optimization algorithms. Preprint at https://arxiv.org/abs/1707.06347 (2017).

  41. Holme, P., Kim, B. J., Yoon, C. N. & Han, S. K. Attack vulnerability of complex networks. Phys. Rev. E 65, 056109 (2002).

    Google Scholar 

  42. Morone, F. & Makse, H. A. Influence maximization in complex networks through optimal percolation. Nature 524, 65–68 (2015).

    Google Scholar 

  43. Ren, X.-L., Gleinig, N., Helbing, D. & Antulov-Fantulin, N. Generalized network dismantling. Proc. Natl. Acad. Sci. USA 116, 6554–6559 (2019).

    Google Scholar 

  44. Braunstein, A., Dall’Asta, L., Semerjian, G. & Zdeborová, L. Network dismantling. Proc. Natl. Acad. Sci. USA 113, 12368–12373 (2016).

    Google Scholar 

  45. Bertsimas, D. & Tsitsiklis, J. Simulated annealing. Stat. Sci. 8, 10–15 (1993).

    Google Scholar 

  46. Barabási, A.-L. & Albert, R. Emergence of scaling in random networks. Science 286, 509–512 (1999).

    Google Scholar 

  47. Latora, V. & Marchiori, M. Efficient behavior of small-world networks. Phys. Rev. Lett. 87, 198701 (2001).

    Google Scholar 

  48. Rousseeuw, P. J. Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J. Comput. Appl. Math. 20, 53–65 (1987).

    Google Scholar 

  49. Squartini, T., van Lelyveld, I. & Garlaschelli, D. Early-warning signals of topological collapse in interbank networks. Sci. Rep. 3, 3357 (2013).

    Google Scholar 

  50. Bauch, C. T., Sigdel, R., Pharaon, J. & Anand, M. Early warning signals of regime shifts in coupled human–environment systems. Proc. Natl. Acad. Sci. USA 113, 14560–14567 (2016).

    Google Scholar 

  51. Dakos, V. & Bascompte, J. Critical slowing down as early warning for the onset of collapse in mutualistic communities. Proc. Natl. Acad. Sci. USA 111, 17546–17551 (2014).

    Google Scholar 

  52. Zhou, D. & Elmokashfi, A. Network recovery based on system crash early warning in a cascading failure model. Sci. Rep. 8, 7443 (2018).

    Google Scholar 

  53. Smith, A. M. et al. Competitive percolation strategies for network recovery. Sci. Rep. 9, 11843 (2019).

    Google Scholar 

  54. Pan, X. & Wang, H. Resilience of and recovery strategies for weighted networks. PLoS ONE 13, e0203894 (2018).

    Google Scholar 

  55. Carlson, J. M. & Doyle, J. Highly optimized tolerance: robustness and design in complex systems. Phys. Rev. Lett. 84, 2529–2532 (2000).

    Google Scholar 

  56. Doyle, J. C. et al. The “robust yet fragile” nature of the Internet. Proc. Natl. Acad. Sci. USA 102, 14497–14502 (2005).

    Google Scholar 

  57. Carlson, J. M. & Doyle, J. Complexity and robustness. Proc. Natl. Acad. Sci. USA 99, 2538–2545 (2002).

    Google Scholar 

  58. Cohen, R., Erez, K., ben-Avraham, D. & Havlin, S. Breakdown of the Internet under intentional attack. Phys. Rev. Lett. 86, 3682–3685 (2001).

    Google Scholar 

  59. University of Washington CSE. Rocketfuel: an ISP topology mapping engine. Available at https://research.cs.washington.edu/networking/rocketfuel/ (2024).

  60. Reis, S. D. S. et al. Avoiding catastrophic failure in correlated networks of networks. Nat. Phys. 10, 762–767 (2014).

    Google Scholar 

  61. Smart, A. G., Amaral, L. A. N. & Ottino, J. M. Cascading failure and robustness in metabolic networks. Proc. Natl. Acad. Sci. USA 105, 13223–13228 (2008).

    Google Scholar 

  62. Duan, J., Li, D. & Huang, H.-J. Reliability of the traffic network against cascading failures with individuals acting independently or collectively. Transp. Res. Part C. 147, 104017 (2023).

    Google Scholar 

  63. Schneider, C. M., Yazdani, N., Araújo, N. A. M., Havlin, S. & Herrmann, H. J. Towards designing robust coupled networks. Sci. Rep. 3, 1969 (2013).

    Google Scholar 

  64. Zeng, G. et al. Multiple metastable network states in urban traffic. Proc. Natl. Acad. Sci. USA 117, 17528–17534 (2020).

    Google Scholar 

  65. Duan, J. et al. Spatiotemporal dynamics of traffic bottlenecks yields an early signal of heavy congestions. Nat. Commun. 14, 8002 (2023).

    Google Scholar 

  66. Marculescu, R. & Bogdan, P. The chip is the network: toward a science of network-on-chip design. Found. Trends Electron. Des. Autom. 2, 371–461 (2009).

    Google Scholar 

  67. Liu, Y. et al. Large-scale network lifetime inference based on universal scaling function. IEEE Internet Things J. 11, 23123–23139 (2024).

    Google Scholar 

  68. Daqing, L., Kosmidis, K., Bunde, A. & Havlin, S. Dimension of spatially embedded networks. Nat. Phys. 7, 481–484 (2011).

    Google Scholar 

  69. Liu, Q., Allamanis, M., Brockschmidt, M. & Gaunt, A. Constrained graph variational autoencoders for molecule design. Advances in Neural Information Processing Systems 31 https://doi.org/10.48550/arXiv.1805.09076 (2018).

  70. Khailany, B. et al. Accelerating chip design with machine learning. IEEE Micro 40, 23–32 (2020).

    Google Scholar 

  71. Mureddu, M. Representation of the German transmission grid for renewable energy sources impact analysis. Preprint at https://arxiv.org/abs/1612.05532 (2016).

  72. Šubelj, L. & Bajec, M. Robust network community detection using balanced propagation. Eur. Phys. J. B 81, 353–362 (2011).

    Google Scholar 

  73. Latora, V., Nicosia, V. & Russo, G. Complex Networks: Principles, Methods and Applications (Cambridge University Press, 2017).

  74. Tornatore, M. et al. A survey on network resiliency methodologies against weather-based disruptions. In Proc. 8th International Workshop on Resilient Networks Design and Modeling (RNDM) 23–34 (IEEE, 2016).

  75. Hadzilacos, V. & Toueg, S. A Modular Approach to Fault-Tolerant Broadcasts and Related Problems (Cornell University, Department of Computer Science, 1994).

  76. Morris, J., Kroening, D. & Koopman, P. Fault tolerance tradeoffs in moving from decentralized to centralized embedded systems. In International Conference on Dependable Systems and Networks 377–386 (IEEE, 2004).

  77. Moussa, N., Hamidi-Alaoui, Z. & El Alaoui, A. E. B. CFTM: a centralized fault tolerant mechanism for wireless sensor networks. In Proc. 5th International Conference on Optimization and Applications (ICOA) 1–6 (IEEE, 2019).

  78. Yuan, X., Hu, Y., Stanley, H. E. & Havlin, S. Eradicating catastrophic collapse in interdependent networks via reinforced nodes. Proc. Natl. Acad. Sci. USA 114, 3311–3315 (2017).

    Google Scholar 

  79. Kfir-Cohen, Y., Vaknin Ben Porath, D. & Havlin, S. Optimization of robustness based on reinforced nodes in a modular network. Europhys. Lett. 137, 41003 (2022).

    Google Scholar 

  80. Oh, S. J., Schiele, B. & Fritz, M. Towards reverse-engineering black-box neural networks. In Explainable AI: Interpreting, Explaining and Visualizing Deep Learning 121–144 (Springer, 2019).

  81. Yu, T. et al. Meta-world: a benchmark and evaluation for multi-task and meta reinforcement learning. Conference on Robot Learning 1094–1100 (PMLR, 2020).

  82. Grover, A., Al-Shedivat, M., Gupta, J., Burda, Y. & Edwards, H. Learning policy representations in multiagent systems. In International Conference on Machine Learning 1802–1811 (PMLR, 2018).

  83. Tampuu, A. et al. Multiagent cooperation and competition with deep reinforcement learning. PLoS ONE 12, e0172395 (2017).

    Google Scholar 

  84. Duan, K. et al. A comprehensive study on large-scale graph training: Benchmarking and rethinking. Adv. Neural Inf. Process. Syst. 35, 5376–5389 (2022).

    Google Scholar 

  85. Gupta, V. et al. GraphScale: a framework to enable machine learning over billion-node graphs. In Proc. 33rd ACM International Conference on Information and Knowledge Management 4514–4521 (ACM, 2024).

  86. Xu, H. et al. Learning to reduce the scale of large graphs: a comprehensive survey. ACM Trans. Knowl. Discov. Data 19, 1–25 (2025).

    Google Scholar 

  87. Zeng, H., Zhou, H., Srivastava, A., Kannan, R. & Prasanna, V. GraphSAINT: Graph sampling based inductive learning method. In International Conference on Learning Representations (ICLR) (OpenReview.net, 2020).

  88. Chu, T., Qu, S. & Wang, J. Large-scale multi-agent reinforcement learning using image-based state representation. In Proc. IEEE 55th Conference on Decision and Control (CDC) 7592–7597 (IEEE, 2016).

  89. Ma, C., Li, A., Du, Y., Dong, H. & Yang, Y. Efficient and scalable reinforcement learning for large-scale network control. Nat. Mach. Intell. 6, 1006–1020 (2024).

    Google Scholar 

  90. Chu, T., Wang, J., Codecà, L. & Li, Z. Multi-agent deep reinforcement learning for large-scale traffic signal control. IEEE Trans. Intell. Transp. Syst. 21, 1086–1095 (2019).

    Google Scholar 

  91. Jin, Y., Wei, S., Yuan, J. & Zhang, X. Hierarchical and stable multiagent reinforcement learning for cooperative navigation control. IEEE Trans. Neural Netw. Learn. Syst. 34, 90–103 (2021).

    Google Scholar 

  92. Tan, T., Chu, T. & Wang, J. Multi-agent bootstrapped deep Q-network for large-scale traffic signal control. In Proc. IEEE Conference on Control Technology and Applications (CCTA) 358–365 (IEEE, 2020).

  93. Christianos, F., Papoudakis, G., Rahman, M. A. & Albrecht, S. V. Scaling multi-agent reinforcement learning with selective parameter sharing. In International Conference on Machine Learning 1989–1998 (PMLR, 2021).

  94. Li, Y.-P., Tan, S.-Y., Deng, Y. & Wu, J. Attacker-defender game from a network science perspective. Chaos 28, 051102 (2018).

    Google Scholar 

  95. Chaoqi, F. et al. Attack-defense game for critical infrastructure considering the cascade effect. Reliab. Eng. Syst. Saf. 216, 107958 (2021).

    Google Scholar 

  96. Wu, Y., Guo, P., Wang, Y. & Zio, E. Attack-defense game modeling framework from a vulnerability perspective to protect critical infrastructure systems. Reliab. Eng. Syst. Saf. 256, 110740 (2025).

    Google Scholar 

  97. Chen, K., Nguyen, T. & Hassanaly, M. Adversarial Multi-Agent Reinforcement Learning for Proactive False Data Injection Detection. Preprint at https://arxiv.org/abs/2411.12130 (2024).

  98. Brody, S., Alon, U. & Yahav, E. How attentive are graph attention networks? International Conference on Learning Representations (OpenReview.net, 2022).

  99. He, K., Zhang, X., Ren, S. & Sun, J. Deep residual learning for image recognition. In Proc. IEEE Conference on Computer Vision and Pattern Recognition 770–778 (IEEE, 2016).

  100. Watts, D. J. & Strogatz, S. H. Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998).

    Google Scholar 

  101. Arnaboldi, V., Conti, M., Passarella, A. & Pezzoni, F. Analysis of ego network structure in online social networks. In Proc. International Conference on Privacy, Security, Risk and Trust and 2012 International Conference on Social Computing 31–40 (IEEE, 2012).

  102. DeJordy, R. & Halgin, D. Introduction to Ego Network Analysis (Boston College and the Winston Center for Leadership & Ethics, 2008).

  103. Bonacich, P. Some unique properties of eigenvector centrality. Soc. Netw. 29, 555–564 (2007).

    Google Scholar 

  104. Kitsak, M. et al. Identification of influential spreaders in complex networks. Nat. Phys. 6, 888–893 (2010).

    Google Scholar 

  105. Ahmed, M., Seraj, R. & Islam, S. M. S. The k-means algorithm: a comprehensive survey and performance evaluation. Electronics 9, 1295 (2020).

    Google Scholar 

  106. Darvariu, V.-A., Hailes, S. & Musolesi, M. Goal-directed graph construction using reinforcement learning. Proc. R. Soc. A 477, 20210168 (2021).

    Google Scholar 

  107. Yang, S., Kaili, M., Wang, B., Yu, T. & Zha, H. Learning to boost resilience of complex networks via neural edge rewiring. Trans. Mach. Learn. Res. (2023).

  108. Hu, Q., Li, R., Deng, Q., Zhao, Y. & Li, R. Enhancing network by reinforcement learning and neural confined local search. In Proc. Thirty-Second International Joint Conference on Artificial Intelligence 2122–2132 (International Joint Conferences on Artificial Intelligence, 2023).

Download references

Acknowledgements

This work is supported by the National Natural Science Foundation of China (Grants 72225012, D.L.; 72288101, D.L.; and 71822101, D.L.), the National Key Research and Development Program of China (2023YFB4302901, D.L.), the Fundamental Research Funds for the Central Universities (D.L.).

Author information

Authors and Affiliations

  1. School of Reliability and Systems Engineering, Beihang University, Beijing, China

    Bingyu Zhu, Tianchen Zhu & Daqing Li

  2. Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, USA

    Jianxi Gao

  3. Department of Physics, Bar-Ilan University, Ramat Gan, Israel

    Shlomo Havlin

  4. Hangzhou International Innovation Institute, Beihang University, Hangzhou, China

    Daqing Li

Authors
  1. Bingyu Zhu
    View author publications

    Search author on:PubMed Google Scholar

  2. Tianchen Zhu
    View author publications

    Search author on:PubMed Google Scholar

  3. Jianxi Gao
    View author publications

    Search author on:PubMed Google Scholar

  4. Shlomo Havlin
    View author publications

    Search author on:PubMed Google Scholar

  5. Daqing Li
    View author publications

    Search author on:PubMed Google Scholar

Contributions

B.Z. and D.L. designed the main idea of the research; B.Z. and T.Z. designed the RL framework; B.Z. performed the experiments; B.Z., J.G., S.H. and D.L. conducted the theoretical analysis. All authors contributed to discussing the results and writing the manuscript.

Corresponding author

Correspondence to Daqing Li.

Ethics declarations

Competing interests

The authors declare no competing interests.

Peer review

Peer review information

Nature Communications thanks the anonymous reviewers for their contribution to the peer review of this work. A peer review file is available.

Additional information

Publisher’s note Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Supplementary information

Supplementary Information (download PDF )

Transparent Peer Review file (download PDF )

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License, which permits any non-commercial use, sharing, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if you modified the licensed material. You do not have permission under this licence to share adapted material derived from this article or parts of it. The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by-nc-nd/4.0/.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhu, B., Zhu, T., Gao, J. et al. Design of robust networks via reinforcement learning prompts the emergence of multi-backbones. Nat Commun (2026). https://doi.org/10.1038/s41467-026-70745-0

Download citation

  • Received: 28 November 2024

  • Accepted: 26 February 2026

  • Published: 20 March 2026

  • DOI: https://doi.org/10.1038/s41467-026-70745-0

Share this article

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Download PDF

Advertisement

Explore content

  • Research articles
  • Reviews & Analysis
  • News & Comment
  • Videos
  • Collections
  • Subjects
  • Follow us on Facebook
  • Follow us on X
  • Sign up for alerts
  • RSS feed

About the journal

  • Aims & Scope
  • Editors
  • Journal Information
  • Open Access Fees and Funding
  • Calls for Papers
  • Editorial Values Statement
  • Journal Metrics
  • Editors' Highlights
  • Contact
  • Editorial policies
  • Top Articles

Publish with us

  • For authors
  • For Reviewers
  • Language editing services
  • Open access funding
  • Submit manuscript

Search

Advanced search

Quick links

  • Explore articles by subject
  • Find a job
  • Guide to authors
  • Editorial policies

Nature Communications (Nat Commun)

ISSN 2041-1723 (online)

nature.com footer links

About Nature Portfolio

  • About us
  • Press releases
  • Press office
  • Contact us

Discover content

  • Journals A-Z
  • Articles by subject
  • protocols.io
  • Nature Index

Publishing policies

  • Nature portfolio policies
  • Open access

Author & Researcher services

  • Reprints & permissions
  • Research data
  • Language editing
  • Scientific editing
  • Nature Masterclasses
  • Research Solutions

Libraries & institutions

  • Librarian service & tools
  • Librarian portal
  • Open research
  • Recommend to library

Advertising & partnerships

  • Advertising
  • Partnerships & Services
  • Media kits
  • Branded content

Professional development

  • Nature Awards
  • Nature Careers
  • Nature Conferences

Regional websites

  • Nature Africa
  • Nature China
  • Nature India
  • Nature Japan
  • Nature Middle East
  • Privacy Policy
  • Use of cookies
  • Legal notice
  • Accessibility statement
  • Terms & Conditions
  • Your US state privacy rights
Springer Nature

© 2026 Springer Nature Limited

Nature Briefing AI and Robotics

Sign up for the Nature Briefing: AI and Robotics newsletter — what matters in AI and robotics research, free to your inbox weekly.

Get the most important science stories of the day, free in your inbox. Sign up for Nature Briefing: AI and Robotics