Yuyi Wang

Yuyi Wang

Auto-generated profile, based on publicly available information

Yuyi Wang

ETH Zurich Switzerland

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
27 March 2022 in Journal of Theoretical Probability
Verified
Journal Article
Closed access
PDF file
JAJianhang Ai
Jianhang Ai
OKOndřej Kuželka
Ondřej Kuželka
YWYuyi Wang
Yuyi Wang

7 September 2018
Verified
Book Chapter
Closed access
PDF file
GAGeorgia Avarikioti
Georgia Avarikioti
GJGerrit Janssen
Gerrit Janssen
YWYuyi Wang
Yuyi Wang
RWRoger Wattenhofer
Roger Wattenhofer

14 April 2017
Verified
Book Chapter
Closed access
PDF file
YEYuval Emek
Yuval Emek
YSYaacov Shapiro
Yaacov Shapiro
YWYuyi Wang
Yuyi Wang

16 August 2021 in Physical Review Applied
Verified
Journal Article
Closed access
PDF file
FYFei-Fei Yan
Fei-Fei Yan
ZXZhen-Peng Xu
Zhen-Peng Xu
QLQiang Li
Qiang Li
JWJun-Feng Wang
Jun-Feng Wang
JZJi-Yang Zhou
Ji-Yang Zhou
GGGuang-Can Guo
Guang-Can Guo
Great challenges are encountered when solving problems based on continuously generated data streams due to the online data input fashion and limited memory space. Quantum properties are helpful in dealing with stream data. In this work, we design and experimentally implement a quantum streaming algorithm (QSA) with various lengths of input data in a single-defect spin system in silicon carbide at room temperature. We explore the schemes with trusted advice on the output results during the algorithm execution. Quite contrary to the classical case, outdated advice is still useful in the quantum case, as revealed by a proper performance function. Our work demonstrates the advantage of the QSA, which would be useful for investigating complex online problems. The room-temperature solid-state spin platform based on such a technological material opens the door for scalable quantum-information processing.

4 May 2022 in Statistics & Probability Letters
Verified
Journal Article
Closed access
JAJianhang Ai
Jianhang Ai
OKOndřej Kuželka
Ondřej Kuželka
YWYuyi Wang
Yuyi Wang

14 June 2020 in arXiv
Verified
Preprint
Open access
PDF file
ZHZhen Han
Zhen Han
YMYunpu Ma
Yunpu Ma
YWYuyi Wang
Yuyi Wang
SGStephan Günnemann
Stephan Günnemann
VTVolker Tresp
Volker Tresp
The Hawkes process has become a standard method for modeling self-exciting event sequences with different event types. A recent work has generalized the Hawkes process to a neurally self-modulating multivariate point process, which enables the capturing of more complex and realistic impacts of past events on future events. However, this approach is limited by the number of possible event types, making it impossible to model the dynamics of evolving graph sequences, where each possible link between two nodes can be considered as an event type. The number of event types increases even further when links are directional and labeled. To address this issue, we propose the Graph Hawkes Neural Network that can capture the dynamics of evolving graph sequences and can predict the occurrence of a fact in a future time instance. Extensive experiments on large-scale temporal multi-relational databases, such as temporal knowledge graphs, demonstrate the effectiveness of our approach.