PageSourceSearch

https://wjerry5.github.io/

html wjerry5.github.io collected 2026-10-03 10:10:26 UTC 9,599 bytes, 214 lines download raw bytes

1<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1//EN"
2  "http://www.w3.org/TR/xhtml11/DTD/xhtml11.dtd">
3<html xmlns="http://www.w3.org/1999/xhtml" xml:lang="en">
4<head>
5<meta name="generator" content="jemdoc, see http://jemdoc.jaboc.net/" />
6<meta http-equiv="Content-Type" content="text/html;charset=utf-8" />
7<link rel="stylesheet" href="jemdoc.css" type="text/css" />
8<title>Ruijie Wang (王睿杰) </title>
9</head>
10<body>
11<table summary="Table for page layout." id="tlayout">
12<tr valign="top">
13  <td id="layout-menu">
14    <div class="menu-category">Ruijie Wang</div>
15    <div class="menu-item"><a href="index.html" class="current">Home</a></div>
16    <div class="menu-item"><a href="publications.html">Research</a></div>
17    <div class="menu-item"><a href="services.html">Services</a></div>
18    <div class="menu-item"><a href="awards.html">Honors</a></div>
19    <div class="menu-item"><a href="hiring.html">Hiring 招生</a></div>
20  </td>
21
22<td id="layout-content">
23<div id="toptitle">
24<h1>Ruijie Wang (王睿杰) </h1>
25</div>
26
27<table class="imgtable">
28<tr>
29<td>
30<a href="http://wjerry5.github.io"><img src="photos/ruijie.jpg" alt="alt text" width="160px" /></a>&nbsp;
31</td>
32<td align="left">
33<p>
34<strong>Tenure-Track Professor</strong><br />
35<a href="https://scse.buaa.edu.cn/">The School of Computer Science and Engineering</a><br />
36<a href="https://www.buaa.edu.cn/">Beihang University</a><br />
37E-mail: <i>ruijiew</i> [AT] buaa.edu.cn<br />
38Beihang University New Main Building Block B1130<br />
39No. 37 Xueyuan Road, Haidian District, Beijing, P.R. China, 100191
40</p>
41<div class="menu-item">
42<a href="https://scse.buaa.edu.cn/info/1078/12025.htm">中文简介</a>
43</div>
44</td>
45</tr>
46</table>
47
48<h2>About me</h2>
49
50<p>
51Welcome to my homepage! I am a Tenure-Track Professor at
52<a href="https://scse.buaa.edu.cn/">the School of Computer Science and Engineering</a>
53of <a href="https://www.buaa.edu.cn/">Beihang University</a>.
54</p>
55
56<p>
57I obtained my Ph.D. from the
58<a href="https://cs.illinois.edu">Department of Computer Science</a> at
59<a href="https://illinois.edu">University of Illinois at Urbana-Champaign (UIUC)</a>
60in 2023. I was fortunate to have Prof.
61<a href="http://abdelzaher.cs.illinois.edu">Tarek F. Abdelzaher</a> as my advisor
62and grateful for the mentorship from Prof.
63<a href="http://hanj.cs.illinois.edu">Jiawei Han</a> and Prof.
64<a href="http://tonghanghang.org">Hanghang Tong</a>.
65</p>
66
67<p>
68Prior to UIUC, I received my bachelor degree from the
69<a href="http://www.cs.sjtu.edu.cn/">Computer Science Department</a> in
70<a href="https://www.sjtu.edu.cn">Shanghai Jiao Tong University</a> in 2019,
71where I had the privilege of conducting research under the guidance of Prof.
72<a href="http://iwct.sjtu.edu.cn/Personal/xwang8/">Xinbing Wang</a> and Prof.
73<a href="http://wnzhang.net/">Weinan Zhang</a>.
74</p>
75
76<p>
77My research focuses on
78<strong>trustworthy and efficient AI in open and dynamic environments</strong>,
79at the intersection of language, graph, and time-series data. I develop
80multimodal foundation models and systems that harness structured knowledge for
81reliable perception, reasoning, and decision-making, with applications in
82recommender systems, agents, and AI for science. The recent topics I am working
83on include:
84</p>
85
86<ul>
87  <li><p>Reinforcement learning for large language model alignment and fine-tuning (e.g., RLHF, RLVR)</p></li>
88  <li><p>Agentic AI and complex reasoning</p></li>
89  <li><p>Graph-centric multimodal foundation models</p></li>
90  <li><p>Graph machine learning and large language models for scientific computing</p></li>
91</ul>
92
93<div class="infoblock">
94<div class="blockcontent">
95<p>
96<strong>Prospective students</strong>: We are constantly looking for well
97motivated students at all level (Undergrad/Intern/M.S./Ph.D.) to work with me.
98If you are interested in our research, please feel free to reach out to me
99(ruijiew [AT] buaa.edu.cn).
100<a href="hiring.html"><font color="blue"><strong>Hiring Details</strong></font></a>
101</p>
102</div>
103</div>
104
105<!-- <h2>Research Interests</h2> -->
106
107<h2><strong>News</strong></h2>
108
109<div class="infoblock">
110<div class="blockcontent">
111<ul>
112
113  <li><p><strong>Sept 2026</strong>
113 One paper on efficient LLM personalization was accepted at TMLR 2026.</p></li>
114
115  <li><p><strong>Aug 2026</strong>  Papers were accepted at IEEE TKDE, ECML-PKDD, ICDM, and EMNLP. Congratulations to all the authors!</p></li>
116
117  <li><p><strong>Aug 2026</strong>  We will host a tutorial at Ubicomp 2026 on LLM Personalization and Continual Learning.</p></li>
118
119  <li><p><strong>Aug 2026</strong>  We hosted a tutorial at KDD 2026 on "<a href="https://llm-personalization-tutorial.github.io">From Generic Intelligence to Personalized AI: A Tutorial on Foundations of LLM Personalization</a>".</p></li>
120
121  <li><p><strong>May 2026</strong>  Three papers on graph continual learning, efficient LLM reasoning, and graph of thought were accepted at KDD 2026.</p></li>
122
123  <li><p><strong>Apr 2026</strong>  One paper on efficient LLM reasoning was accepted at ICML 2026.</p></li>
124
125  <li><p><strong>Apr 2026</strong>  One paper on robust graph-text alignment on TAGs was accepted at SIGIR 2026.</p></li>
126
127  <li><p><strong>Nov 2025</strong>  One paper on cross-modal LLM alignment was accepted at KDD 2026.</p></li>
128
129  <li><p><strong>Nov 2025</strong>  One paper on agentic temporal graph analysis was accepted for oral presentation at AAAI 2026.</p></li>
130
131  <!--
132  <li><p><strong>Sept 2025</strong> I was elected as an Executive Member of CCF Expert Committee on Big Data (CCF大数据专家委员会执行委员).</p></li>
133  -->
134
135  <li><p><strong>Aug 2025</strong>  Papers were accepted at EMNLP 2025 and CIKM 2025.</p></li>
136
137  <li><p><strong>June 2025</strong> Our paper RestoreML on test time training won Best Paper Award in IEEE DCOSS 2025.</p></li>
138
139  <li><p><strong>May 2025</strong>  One paper on synthetic preference data generation was accepted at ACL 2025.</p></li>
140
141  <li><p><strong>May 2025</strong>
141  One paper on polynomial graph filters for scalable GAD was accepted at KDD 2025.</p></li>
142
143  <li><p><strong>Jan 2025</strong>  One paper on agentic continual pre-training was accepted at NAACL 2025.</p></li>
144
145  <li><p><strong>Dec 2024</strong>  A paper on synthetic sensing data generation was accepted at Infocom 2025.</p></li>
146
147  <li><p><strong>Sept 2024</strong> Two paper were accepted by NeurIPS 2024 and Sensys 2024 respectively.</p></li>
148
149  <li><p><strong>July 2024</strong> Our tutorial proposal <a href="cikm2024-tutorial/" target="_blank">"Towards Efficient Temporal Graph Learning: Algorithms, Frameworks, and Tools"</a> was accepted by CIKM 2024 Tutorial Track.</p></li>
150
151  <li><p><strong>May 2024</strong>  We host a challenge Characterizing User Behavior in Social Networks: Propagation, Prediction, and Sensemaking in IEEE BigData Cup 2024.</p></li>
152
153  <li><p><strong>March 2024</strong>  Two papers were accepted by SIGIR 2024.</p></li>
154
155  <li><p><strong>Jan 2024</strong>  One paper was accepted by WWW 2024.</p></li>
156
157  <li><p><strong>Sept 2023</strong> Two papers were accepted by NeurIPS 2023.</p></li>
158
159  <li><p><strong>May 2023</strong>  We have launched the <a href="https://incas.csl.illinois.edu" target="_blank" rel="external">Anotomy of Conflict Tools</a>, featuring a range of end-to-end real-time social network analysis capabilities. Feel free to submit your own task and check our anaysis result!</p></li>
160
161  <li><p><strong>May 2023</strong>  One paper was accepted by ACL 2023.</p></li>
162
163  <li><p><strong>Jan 2023</strong>  One paper was accepted by WWW 2023.</p></li>
164
165  <li><p>...</p></li>
166</ul>
167</div>
168</div>
169
170<h2><strong>Experiences</strong></h2>
171
172<ul>
173  <li><p><strong>July 2025-Present</strong>, <strong>Beihang University</strong>, Tenure-Track Professor, Beijing, China.</p></li>
174
175  <li><p><strong>Aug 2024-June 2025</strong>, <strong>Amazon SFAI</strong>, Applied Scientist II, CA, USA. Research topic: LLM Post-Training and Alignment.</p></li>
176
177  <li><p><strong>Jan 2024-Aug 2024</strong>, <strong>CS@UIUC</strong>, Postdoctoral Research Associate, IL, USA.</p></li>
178
179  <li><p><strong>Jan 2023-Aug 2024</strong>, <strong>SRC Research Scholars Program</strong>, Research Scholar, IL, USA. Research topic: Efficient Graph Learning on Large-scale Graphs.</p></li>
180
181  <li><p><strong>July 2019-Dec 2023</strong>, <strong>CS@UIUC</strong>, Research Assistant, IL, USA.</p></li>
182
183  <li><p><strong>May 2022-Oct 2022</strong>, <strong>Amazon Search (A9)</strong>, Applied Scientist Intern, Search and NLP group, Palo Alto, CA, USA. Research topic: Cross-lingual Transfer.</p></li>
184
185  <li><p><strong>May 2021-Sept 2022</strong>, <strong>Amazon Search (A9)</strong>, Applied Scientist Intern, Search and NLP group, Palo Alto, CA, USA. Research topic: KG-based Recommendation.</p></li>
186
187  <li><p><strong>Jul 2017-June 2019</strong>, <strong>Shanghai Jiao Tong University</strong>, Research Assistant, IIoT Lab, Shanghai, China. Research topic: Academic Data Mining.</p></li>
188</ul>
189
190</td>
191</tr>
192</table>
193
194
195<!-- <div id="extreme" style="visibility:hidden">
196  
196<script src="http://t1.extreme-dm.com/f.js" id="eXF-handesy-0" async="async" defer="defer"></script>
196
197</div> -->
198
199
200<script
201  type="text/javascript"
202  id="clustrmaps"
203  src="//cdn.clustrmaps.com/map_v2.js?cl=0e1633&amp;w=300&amp;t=tt&amp;d=I1ahhYOJEcRqEdswuMHdTSB918FCQAJRdpNi4ETEFVk&amp;co=0b4975&amp;cmo=3acc3a&amp;cmn=ff5353&amp;ct=cdd4d9">
204</script>
204
205
206<!-- 
206<script type="text/javascript" id="mapmyvisitors" src="//mapmyvisitors.com/map.js?d=R4Bk4txcwyiD0g4md6a3LVLSF6g6XAOYF75uSnLPOGQ&cl=ffffff&w=a"></script>
206 -->
207
208</body>
209</html>
210
211
2126.9
213xiaozhang
2141.21

Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.