Arrow Research search

Author name cluster

Chenghou Jin

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

3 papers
1 author row

Possible papers

3

AAAI Conference 2026 Conference Paper

Invariant Feature Learning for Counterfactual Watch-time Prediction in Video Recommendation

  • Chenghou Jin
  • Yixin Ren
  • Hongxu Ma
  • Yewei Xia
  • Yi Guan
  • Hao Zhang
  • Jiandong Ding
  • Jihong Guan

Video recommendation systems heavily rely on user watch time feedback, making accurate watch time prediction a crucial task. However, this task inherently suffers from bias, as recommendation models tend to favor long-duration videos to maximize watch time. This issue, known as duration bias in the watch-time prediction context, can be explained from a causal perspective, where video duration acts as a confounder. Recent works address this bias using backdoor adjustment, isolating the direct effect of content on watch time from observational data. These methods typically discretize video duration into groups, estimate group-wise effects, and then aggregate them via a unified prediction model. However, this aggregation strategy is prone to model misspecification due to feature distribution shift across groups. In this paper, we reinterpret the problem through the lens of invariant learning and propose a novel framework: Duration-Invariant Feature Learning (DIFL). DIFL employs a kernel-based regularization that enforces representation invariance across duration groups, reducing sensitivity to group design and improving generalization. This enables more accurate modeling of the direct causal effect and making counterfactual inference. Extensive experiments on both public and real large-scale production datasets demonstrate the effectiveness of our approach, which achieves SOTA performance.

AIJ Journal 2024 Journal Article

PathLAD+: Towards effective exact methods for subgraph isomorphism problem

  • Yiyuan Wang
  • Chenghou Jin
  • Shaowei Cai

The subgraph isomorphism problem (SIP) is a challenging problem with wide practical applications. In the last decade, despite being a theoretical hard problem, researchers designed various algorithms for solving SIP. In this work, we propose five main strategies and develop an improved exact algorithm for SIP. First, we design a probing search procedure to try whether the search procedure can successfully obtain a solution at first sight. Second, we design a novel matching ordering strategy as a value-ordering heuristic, which uses some useful information obtained from the probing search procedure to preferentially select some promising target vertices. Third, we discuss the characteristics of different propagation methods in the context of SIP and present an adaptive propagation method to make a good balance between these methods. Moreover, to further improve the performance of solving large graphs, we propose an enhanced implementation of the edge constraint method and a domain limitation strategy, which aims to accelerate the search process. Experimental results on a broad range of classic and graph-database benchmarks show that our proposed algorithm performs better than several state-of-the-art algorithms for the SIP.

IJCAI Conference 2023 Conference Paper

PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphism Problem

  • Yiyuan Wang
  • Chenghou Jin
  • Shaowei Cai
  • Qingwei Lin

The subgraph isomorphism problem (SIP) is a challenging problem with wide practical applications. In the last decade, despite being a theoretical hard problem, researchers design various algorithms for solving SIP. In this work, we propose three main heuristics and develop an improved exact algorithm for SIP. First, we design a probing search procedure to try whether the search procedure can successfully obtain a solution at first sight. Second, we design a novel matching ordering as a value-ordering heuristic, which uses some useful information obtained from the probing search procedure to preferentially select some promising target vertices. Third, we discuss the characteristics of different propagation methods in the context of SIP and present an adaptive propagation method to make a good balance between these methods. Experimental results on a broad range of real-world benchmarks show that our proposed algorithm performs better than state-of-the-art algorithms for the SIP.

v2026.09.13