TZTianxin Zu

Tianxin Zu

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Tianxin Zu has a total of 9 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    iFlow - An Interactive Max-Flow Min-Cut Algorithms Visualizer

    by Muyang Ye, Tianrui Xia, Tianxin Zu, Qian Wang, David Kempe

    The Max-Flow/Min-Cut problem is a fundamental tool in graph theory, with applications in many domains, including data mining, image segmentation, transportation planning, and many types of assignment problems, in addition to being an essential building block for many other algorithms. The Ford-Fulkerson Algorithm for Max-Flow/Min-Cut and its variants are therefore commonly taught in undergraduate and beginning graduate algorithms classes. However, these algorithms - and in particular the so-called residual graphs they utilize - often pose significant challenges for students. To help students achieve a deeper understanding, we developed iFlow, an interactive visualization tool for the Ford-Fulkerson Algorithm and its variants. iFlow lets users design or import flow networks, and execute the algorithm by hand. In particular, the user can select an augmentation path and amount, and then update the residual graph. The user is given detailed feedback on mistakes, and can also have iFlow auto-complete each step, to use it as a demonstration tool while still in the initial learning stages. iFlow has been made publicly available and open-sourced. We deployed iFlow in an undergraduate algorithms class, and collected students' self-reported learning benefits via an optional survey. All respondents considered the tool at least somewhat useful and engaging, with most rating it either as useful/engaging or very useful/engaging. Students also generally reported a significant increase in understanding of the algorithm.


  • Open Access

    Accelerating Deep Neural Network guided MCTS using Adaptive Parallelism

    by Yuan Meng, Qian Wang, Tianxin Zu, Viktor Prasanna

    Deep Neural Network guided Monte-Carlo Tree Search (DNN-MCTS) is a powerful class of AI algorithms. The DNN operations are highly parallelizable, but tree search operations are sequential and often become the system bottleneck. Existing MCTS parallel schemes on CPU platforms either exploit data parallelism but sacrifice memory access latency, or take advantage of local cache for low-latency accesses but constrain the search to a single thread. This work analyzes the tradeoff of these parallel schemes, and proposes an adaptive parallel scheme that optimally chooses the MCTS component’s parallel scheme on the CPU. Additionally, an efficient method for searching the optimal communication batch size when the CPU interfaces with DNN operations on an accelerator(GPU) is proposed. Using a DNN-MCTS algorithm on board game benchmarks, we show that our work is able to adaptively generate the best-performing parallel implementation, leading to a range of 1.5 × −3 × speedup compared with the baseline methods.

  • Open Access

    X-Norm: Exchanging Normalization Parameters for Bimodal Fusion

    by Yufeng Yin, Jiashu Xu, Tianxin Zu, Mohammad Soleymani

    Multimodal learning aims to process and relate information from different modalities to enhance the model’s capacity for perception. Current multimodal fusion mechanisms either do not align the feature spaces closely or are expensive for training and inference. In this paper, we present X-Norm, a novel, simple and efficient method for bimodal fusion that generates and exchanges limited but meaningful normalization parameters between the modalities implicitly aligning the feature spaces. We conduct extensive experiments on two tasks of emotion and action recognition with different architectures including Transformer-based and CNN-based models using IEMOCAP and MSP-IMPROV for emotion recognition and EPIC-KITCHENS for action recognition. The experimental results show that X-Norm achieves comparable or superior performance compared to the existing methods including early and late fusion, Gradient-Blending (G-Blend) [44], Tensor Fusion Network, [48] and Multimodal Transformer [40], with a relatively low training cost.