SearcharxivSearch

arXiv subjects

Xuehan Chen

Publications and source records attributed to Xuehan Chen.

2 recordsLinked to original sources

Beyond Affinity: A Benchmark of 1D, 2D, and 3D Methods Reveals Critical Trade-offs in Structure-Based Drug Design

Currently, the field of structure-based drug design is dominated by three main types of algorithms: search-based algorithms, deep generative models, and reinforcement learning. While existing works have typically focused on comparing models within a single algorithmic category, cross-algorithm comparisons remain scarce. In this paper, to fill the gap, we establish a benchmark to evaluate the performance of fifteen models across these different algorithmic foundations by assessing the pharmaceutical properties of the generated molecules and their docking affinities and poses with specified target proteins. We highlight the unique advantages of each algorithmic approach and offer recommendations for the design of future SBDD models. We emphasize that 1D/2D ligand-centric drug design methods can be used in SBDD by treating the docking function as a black-box oracle, which is typically neglected. Our evaluation reveals distinct patterns across model categories. 3D structure-based models excel in binding affinities but show inconsistencies in chemical validity and pose quality. 1D models demonstrate reliable performance in standard molecular metrics but rarely achieve optimal binding affinities. 2D models offer balanced performance, maintaining high chemical validity while achieving moderate binding scores. Through detailed analysis across multiple protein targets, we identify key improvement areas for each model category, providing insights for researchers to combine strengths of different approaches while addressing their limitations. All the code that are used for benchmarking is available in https://github.com/zkysfls/2025-sbdd-benchmark

cs.LG

On the Fairness Performance of NOMA-based Wireless Powered Communication Networks

The near-far problem causes severe throughput unfairness in wireless powered communication networks (WPCN). In this paper, we exploit non-orthogonal multiple access (NOMA) technology and propose a fairness-aware NOMA-based scheduling scheme to mitigate the near-far effect and to enhance the max-min fairness. Specifically, we sort all users according to their channel conditions and divide them into two groups, the interference group with high channel gains and the noninterference group with low channel gains. The power station (PS) concurrently transmits energy signals with the data transmissions of the users in the interference group. Thus, the users in the noninterference group can harvest more energy and achieve a higher throughput, while the users in the interference group degrade their performance due to the interfering signals from the PS. We then apply order statistic theory to analyze the achievable rates of ordered users, based on which all users are appropriately grouped for NOMA transmission to achieve the max-min fairness of the system. Meanwhile, the optimal number of interfered users that determines the set of users in each group, is derived. Our simulation results validate the significant improvement of both network fairness and throughput via the fairness-aware NOMA-based scheduling scheme.

cs.IT