Searcharxiv⌕ Search

arXiv subjects

Wenxiang Zhu

Publications and source records attributed to Wenxiang Zhu.

5 recordsLinked to original sources

GA-HEL: A Knowledge-Driven Expert System for Open-Set, Granularity-Aware Hierarchical Event Linking in Social Media

Social-media event intelligence requires a system to determine whether a post belongs to a registered event space, identify the supported hierarchy path, and stop at the deepest level warranted by the evidence. We formulate this requirement as open-set hierarchical event linking over frozen Storyline--Episode--Atomic Event Cards. GA-HEL implements a three-stage, knowledge-driven expert-system funnel: open-set scope control limits candidate exposure before hierarchical reasoning, hierarchy-aware decoders select a supported path and depth, and deterministic legal-path validation checks each record before database-compatible use. A 200-post Pilot supports task and mechanism development, while a separately annotated 497-post Expansion set evaluates transfer across four held-out Storylines and a hard-negative pool. Method implementations, prompts, Event Cards, candidate order, and six systems' predictions were frozen before Expansion Gold annotation. The resulting evaluation combines end-to-end hierarchical matching, open-set rejection, structural validation, ablation, cross-Storyline analysis, and an independent expert reannotation of a fixed audited subset. GA-HEL remains competitive with strong global full-card reasoning while providing explicit scope control and hierarchy-valid structured records. Error analysis identifies unsupported descent from Episode-level evidence to Atomic Events as the dominant remaining challenge. The task definition, frozen resource, and auditable protocol provide a reproducible foundation for scope-aware event intelligence. Code, Event Cards, labels, frozen predictions, and evaluation scripts are available at https://github.com/SHbiao/GAHEL_release.

cs.IR↗

When Inputs Receive No Score: Evaluating Open-Web Event Admission on the Complete Stream

A Web item can link to the correct event without contributing information worth organizing. Evaluating item-level admission therefore begins with complete inputs, including those a processing pipeline fails to score. We study how this upstream selection changes ranking comparisons and constrains operational decisions. Across six instruction-model backbones, three strategies, and 602 human-annotated evaluation items, systems score different populations with different class compositions. Comparing rankings on shared inputs separates these population differences from discrimination. Score availability also limits attainable retention: four configurations score only ten of twelve positive development items, making a 90% full-stream target unreachable by threshold adjustment. Paired precision experiments show that this constraint depends on execution configuration as well as model choice. Qwen scores the same number of evaluation items under INT4 and INT8, yet exchanges four scored items for four others. Extraction-recovery diagnostics further show that obtaining more scores can increase false acceptance under an unchanged threshold. We connect these observations through a complete-stream evaluation protocol that checks calibration feasibility and separates upstream score loss from decision loss. The resulting account explains which inputs a system can score, what its operating point can achieve, and what it actually admits.

cs.IR↗

A Snail Race Problem

Inspired by Problem 17 from the 2024 American Mathematics Competition (AMC) 10B, this work focuses on enumerating the distinct outcomes of a snail race with specified number of ties of a certain type. We begin by developing a recurrence relation and subsequently derive a closed-form formula for the number of possible outcomes using the exponential generating function method. Two special cases of the problem are considered in detail. Our analysis also explores the connections between the solution to this problem and the ordered Bell numbers, Stirling numbers of the second kind, and partial Bell polynomials.

math.CO↗

Continual Transfer Learning for Cross-Domain Click-Through Rate Prediction at Taobao

As one of the largest e-commerce platforms in the world, Taobao's recommendation systems (RSs) serve the demands of shopping for hundreds of millions of customers. Click-Through Rate (CTR) prediction is a core component of the RS. One of the biggest characteristics in CTR prediction at Taobao is that there exist multiple recommendation domains where the scales of different domains vary significantly. Therefore, it is crucial to perform cross-domain CTR prediction to transfer knowledge from large domains to small domains to alleviate the data sparsity issue. However, existing cross-domain CTR prediction methods are proposed for static knowledge transfer, ignoring that all domains in real-world RSs are continually time-evolving. In light of this, we present a necessary but novel task named Continual Transfer Learning (CTL), which transfers knowledge from a time-evolving source domain to a time-evolving target domain. In this work, we propose a simple and effective CTL model called CTNet to solve the problem of continual cross-domain CTR prediction at Taobao, and CTNet can be trained efficiently. Particularly, CTNet considers an important characteristic in the industry that models has been continually well-trained for a very long time. So CTNet aims to fully utilize all the well-trained model parameters in both source domain and target domain to avoid losing historically acquired knowledge, and only needs incremental target domain data for training to guarantee efficiency. Extensive offline experiments and online A/B testing at Taobao demonstrate the efficiency and effectiveness of CTNet. CTNet is now deployed online in the recommender systems of Taobao, serving the main traffic of hundreds of millions of active users.

cs.IR↗

Axially symmetric volume constrained anisotropic mean curvature flow

We study the long time existence theory for a non local flow associated to a free boundary problem for a trapped non liquid drop. The drop has free boundary components on two horizontal plates and its free energy is anisotropic and axially symmetric. For axially symmetric initial surfaces with sufficiently large volume, we show that the flow exists for all time. Numerical simulations of the curvature flow are presented.

math.DG↗