Zobrazeno 1 - 10
of 345
pro vyhledávání: '"Wang, Yanhao"'
With increasing concerns and regulations on data privacy, fine-tuning pretrained language models (PLMs) in federated learning (FL) has become a common paradigm for NLP tasks. Despite being extensively studied, the existing methods for this problem st
Externí odkaz:
http://arxiv.org/abs/2409.00116
The sliding window model of computation captures scenarios in which data are continually arriving in the form of a stream, and only the most recent $w$ items are used for analysis. In this setting, an algorithm needs to accurately track some desired
Externí odkaz:
http://arxiv.org/abs/2406.07953
The $k$-Maximum Inner Product Search ($k$MIPS) serves as a foundational component in recommender systems and various data mining tasks. However, while most existing $k$MIPS approaches prioritize the efficient retrieval of highly relevant items for us
Externí odkaz:
http://arxiv.org/abs/2402.13858
Autor:
Teng, Long, Wang, Yanhao
Community search is a problem aimed at searching for densely connected subgraphs within a network based on query conditions, which has recently attracted significant attention. However, most previous community search studies have overlooked the coexi
Externí odkaz:
http://arxiv.org/abs/2402.07601
Temporal bipartite graphs are widely used to denote time-evolving relationships between two disjoint sets of nodes, such as customer-product interactions in E-commerce and user-group memberships in social networks. Temporal butterflies, $(2,2)$-bicli
Externí odkaz:
http://arxiv.org/abs/2310.11886
Learned indexes fit machine learning (ML) models to the data and use them to make query operations more time and space-efficient. Recent works propose using learned spatial indexes to improve spatial query performance by optimizing the storage layout
Externí odkaz:
http://arxiv.org/abs/2310.04268
Autor:
Ganjam, Suhas, Wang, Yanhao, Lu, Yao, Banerjee, Archan, Lei, Chan U, Krayzman, Lev, Kisslinger, Kim, Zhou, Chenyu, Li, Ruoshui, Jia, Yichen, Liu, Mingzhao, Frunzio, Luigi, Schoelkopf, Robert J.
The performance of superconducting quantum circuits for quantum computing has advanced tremendously in recent decades; however, a comprehensive understanding of relaxation mechanisms does not yet exist. In this work, we utilize a multimode approach t
Externí odkaz:
http://arxiv.org/abs/2308.15539
Normalized-cut graph partitioning aims to divide the set of nodes in a graph into $k$ disjoint clusters to minimize the fraction of the total edges between any cluster and all other clusters. In this paper, we consider a fair variant of the partition
Externí odkaz:
http://arxiv.org/abs/2307.12065
Autor:
Wang, Ying, Wang, Yanhao
Influence maximization (IM) aims to find seed users on an online social network to maximize the spread of information about a target product through word-of-mouth propagation among all users. Prior IM methods mostly focus on maximizing the overall in
Externí odkaz:
http://arxiv.org/abs/2301.11527
Diversity maximization aims to select a diverse and representative subset of items from a large dataset. It is a fundamental optimization task that finds applications in data summarization, feature selection, web search, recommender systems, and else
Externí odkaz:
http://arxiv.org/abs/2301.02053