LGMar 10, 2024Code
Cooperative Classification and Rationalization for Graph GeneralizationLinan Yue, Qi Liu, Ye Liu et al.
Graph Neural Networks (GNNs) have achieved impressive results in graph classification tasks, but they struggle to generalize effectively when faced with out-of-distribution (OOD) data. Several approaches have been proposed to address this problem. Among them, one solution is to diversify training distributions in vanilla classification by modifying the data environment, yet accessing the environment information is complex. Besides, another promising approach involves rationalization, extracting invariant rationales for predictions. However, extracting rationales is difficult due to limited learning signals, resulting in less accurate rationales and diminished predictions. To address these challenges, in this paper, we propose a Cooperative Classification and Rationalization (C2R) method, consisting of the classification and the rationalization module. Specifically, we first assume that multiple environments are available in the classification module. Then, we introduce diverse training distributions using an environment-conditional generative network, enabling robust graph representations. Meanwhile, the rationalization module employs a separator to identify relevant rationale subgraphs while the remaining non-rationale subgraphs are de-correlated with labels. Next, we align graph representations from the classification module with rationale subgraph representations using the knowledge distillation methods, enhancing the learning signal for rationales. Finally, we infer multiple environments by gathering non-rationale representations and incorporate them into the classification module for cooperative learning. Extensive experimental results on both benchmarks and synthetic datasets demonstrate the effectiveness of C2R. Code is available at https://github.com/yuelinan/Codes-of-C2R.
CLJan 4, 2024Code
Text2MDT: Extracting Medical Decision Trees from Medical TextsWei Zhu, Wenfeng Li, Xing Tian et al.
Knowledge of the medical decision process, which can be modeled as medical decision trees (MDTs), is critical to build clinical decision support systems. However, the current MDT construction methods rely heavily on time-consuming and laborious manual annotation. In this work, we propose a novel task, Text2MDT, to explore the automatic extraction of MDTs from medical texts such as medical guidelines and textbooks. We normalize the form of the MDT and create an annotated Text-to-MDT dataset in Chinese with the participation of medical experts. We investigate two different methods for the Text2MDT tasks: (a) an end-to-end framework which only relies on a GPT style large language models (LLM) instruction tuning to generate all the node information and tree structures. (b) The pipeline framework which decomposes the Text2MDT task to three subtasks. Experiments on our Text2MDT dataset demonstrate that: (a) the end-to-end method basd on LLMs (7B parameters or larger) show promising results, and successfully outperform the pipeline methods. (b) The chain-of-thought (COT) prompting method \cite{Wei2022ChainOT} can improve the performance of the fine-tuned LLMs on the Text2MDT test set. (c) the lightweight pipelined method based on encoder-based pretrained models can perform comparably with LLMs with model complexity two magnititudes smaller. Our Text2MDT dataset is open-sourced at \url{https://tianchi.aliyun.com/dataset/95414}, and the source codes are open-sourced at \url{https://github.com/michael-wzhu/text2dt}.
NIMar 11
A Secure Splitting and Acceleration Strategy for TCP/QUIC in Interplanetary NetworksJianhao Yu, Ye Li, Qingfang Jiang et al.
Interplanetary networks (IPNs) present unique challenges such as extreme delay, high loss, and frequent disruptions that severely degrade the performance of conventional transport protocols like Transmission Control Protocol (TCP) and Quick UDP Internet Connection (QUIC). To address these issues, we propose a secure transport acceleration strategy tailored for IPNs. This strategy is founded on our Non-Transparent Secure Proxy (NTSP) architecture, which enables connection splitting for end-to-end encrypted flows while preserving application layer security. Based on the NTSP, we design an IPN-aware transport policy that combines (i) a rate-based congestion control algorithm exploiting the pre-scheduled nature of deep-space links to achieve stable and efficient bandwidth utilization, and (ii) an adaptive packet-level forward error correction scheme to provide low-latency loss recovery without retransmissions. Furthermore, we introduce a theoretically grounded backpressure flow control mechanism, deriving an analytical model for optimal buffer sizing to mitigate rate mismatch and prevent bufferbloat. The strategy is implemented in a prototype system, PEPspace, and evaluated in representative Earth-Moon scenarios. Results show near-capacity and stable goodput and substantially improved delivery performance compared with TCP/QUIC variants and existing Performance Enhancing Proxies, while maintaining low latency and robust data delivery across intermittent links. The NTSP architecture is further discussed as a foundational framework for future unified IP/DTN architectures, bridging a key architectural gap in heterogeneous space networks.
ASSep 8, 2020
AutoKWS: Keyword Spotting with Differentiable Architecture SearchBo Zhang, Wenfeng Li, Qingyuan Li et al.
Smart audio devices are gated by an always-on lightweight keyword spotting program to reduce power consumption. It is however challenging to design models that have both high accuracy and low latency for accurate and fast responsiveness. Many efforts have been made to develop end-to-end neural networks, in which depthwise separable convolutions, temporal convolutions, and LSTMs are adopted as building units. Nonetheless, these networks designed with human expertise may not achieve an optimal trade-off in an expansive search space. In this paper, we propose to leverage recent advances in differentiable neural architecture search to discover more efficient networks. Our searched model attains 97.2% top-1 accuracy on Google Speech Command Dataset v1 with only nearly 100K parameters.