In recent years, there has been considerable attention and research on the higher-order interactions that are prevalent in various real-world networks. Hypergraphs, especially in the study of complex systems, are proved effective in capturing these interactions. To better characterize the model in reality, this paper proposes a theoretical model of node interdependent percolation in multiplex hypergraphs, considering “ weak ” interdependence. The proposed model includes pairwise and higher-order interactions, where the removal of nodes triggers cascading failures. However, interdependent nodes connected to failed nodes experience partial loss of connections due to “ weak” interdependence, reflecting the self-sustaining capabilities of real-world systems. Percolation theory is applied to the analysis to investigate the properties of the percolation threshold and phase transition. Both analysis and simulation results show that as the strength of interdependence between nodes weakens, the network transitions from a discontinuous to a continuous phase, thereby increasing its robustness.