Xu He

Xu He

Auto-generated profile, based on publicly available information

Xu He

Noah’s Ark Laboratory

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 April 2023
Verified
Conference Paper
Open access
BHBowei He
Bowei He
XHXu He
Xu He
YZYingxue Zhang
Yingxue Zhang
RTRuiming Tang
Ruiming Tang
CMChen Ma
Chen Ma
Personalized recommender systems have been widely studied and deployed to reduce information overload and satisfy users’ diverse needs. However, conventional recommendation models solely conduct a one-time training-test fashion and can hardly adapt to evolving demands, considering user preference shifts and ever-increasing users and items in the real world. To tackle such challenges, the streaming recommendation is proposed and has attracted great attention recently. Among these, continual graph learning is widely regarded as a promising approach for the streaming recommendation by academia and industry. However, existing methods either rely on the historical data replay which is often not practical under increasingly strict data regulations, or can seldom solve the over-stability issue. To overcome these difficulties, we propose a novel Dynamically Expandable Graph Convolution (DEGC) algorithm from a model isolation perspective for the streaming recommendation which is orthogonal to previous methods. Based on the motivation of disentangling outdated short-term preferences from useful long-term preferences, we design a sequence of operations including graph convolution pruning, refining, and expanding to only preserve beneficial long-term preference-related parameters and extract fresh short-term preferences. Moreover, we model the temporal user preference, which is utilized as user embedding initialization, for better capturing the individual-level preference shifts. Extensive experiments on the three most representative GCN-based recommendation models and four industrial datasets demonstrate the effectiveness and robustness of our method.

21 October 2023
Verified
Conference Paper
Open access
BHBowei He
Bowei He
XHXu He
Xu He
RZRenrui Zhang
Renrui Zhang
YZYingxue Zhang
Yingxue Zhang
RTRuiming Tang
Ruiming Tang
CMChen Ma
Chen Ma

7 September 2024
Verified
Book Chapter
Closed access
PDF file
QCQuanlin Chen
Quanlin Chen
JHJing Huo
Jing Huo
YCYiyu Chen
Yiyu Chen
TDTianyu Ding
Tianyu Ding
Yang GaoYang Gao
Yang Gao
XHXu He
Xu He

1 August 2024
Verified
Conference Paper
Open access
PDF file
PGPengjie Gu
Pengjie Gu
MZMengchen Zhao
Mengchen Zhao
XHXu He
Xu He
YCYi Cai
Yi Cai
BABo An
Bo An
In an approval-based committee election, the goal is to select a committee consisting of k out of m candidates, based on n voters who each approve an arbitrary number of the candidates. The core of such an election consists of all committees that satisfy a certain stability property which implies proportional representation. In particular, committees in the core cannot be "objected to" by a coalition of voters who is underrepresented. The notion of the core was proposed in 2016, but it has remained an open problem whether it is always non-empty. We prove that core committees always exist when k ≤ 8, for any number of candidates m and any number of voters n, by showing that the Proportional Approval Voting (PAV) rule, proposed by Thiele in 1895, always satisfies the core when k ≤ 7 and always selects at least one committee in the core when k = 8. We also develop an artificial rule based on recursive application of PAV, and use it to show that the core is non-empty whenever there are m ≤ 15 candidates, for any committee size k ≤ m and any number of voters n. These results are obtained with the help of computer search using linear programs.