BZPEERReading, trust and collaboration for research
Menu

Discover

GraphFollow connections around a paper, topic or saved view.

Workspaces

HomePick up where your research flow left off.InboxHandle requests, replies and notifications from one place.CollectionsCurate reading lists, evidence sets and shareable dossiers.ResearchSee your private provenance graph, trail and imports.CollaborationMove from discovery into focused discussion rooms.PublishDraft, preview and publish full-text research articles.

Network

ExpertsFind specialists worth following or asking for help.CommunitiesJoin research circles organized around shared work.PartnersSee external organizations active around the same topics.

Opportunities

ListingsBrowse roles, calls and collaborations with clearer fit signals.

Account

Log inReturn to your reading and collaboration workspace.Create accountStart saving work, following people and joining teams.
Log inCreate account

Researcher profile

Yifan Li

Yifan Li contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate
Artificial IntelligenceComputer VisionDatabaseseess.SPMachine Learningphysics.chem-phComputer Science and Game Theorycond-mat.mes-hallcond-mat.mtrl-scicond-mat.stat-mechcond-mat.str-elData Structures and Algorithmseess.SYHardware Architecturehep-thmath-phmath.MPmath.QAnucl-exphysics.ins-detquant-phSystems and Control

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
15works
0followers
22topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

15 published item(s)

preprint2026arXiv

Adaptive Context Matters: Towards Provable Multi-Modality Guidance for Super-Resolution

Super-resolution (SR) is a severely ill-posed problem with inherent ambiguity, as widely recognized in both empirical and theoretical studies. Although recent semantic-guided and multi-modal SR methods exploit large models or external priors to enhance semantic alignment, the fusion of heterogeneous modalities remains insufficiently understood in practice and theory. In this work, we provide the first theoretical modeling of multi-modal SR, revealing that prior methods are bottlenecked by sub-optimal modality utilization. Our analysis shows that the generalization risk bound can be improved by strengthening the alignment between modality weights and their effective contributions, while reducing representation complexity. This theoretical insight inspires us to propose the novel Multi-Modal Mixture-of-Experts Super-Resolution framework (M$^3$ESR) that employs generalization-oriented dynamic modality fusion for accurate risk control and modality contribution optimization. In detail, we propose a novel spatially dynamic modality weighting module and a temporally adaptive modality temperature scheduling mechanism, enabling flexible and adaptive spatial-temporal modality weighting for effective risk control. Extensive experiments demonstrate that our M$^3$ESR significantly boosts generalization and semantic consistency performances, which confirms our superiority.

0 citations0 reviewsNo code linkedOpen access
preprint2026arXiv

PepSpecBench: A Unified Evaluation Benchmark for Peptide Tandem Mass Spectrometry Prediction

Tandem mass spectrometry provides a high-throughput framework for identifying and quantifying proteins in complex biological samples. In computational proteomics, predicting peptide MS/MS spectra is a critical task, enabling downstream applications such as large-scale peptide identification and quantification. While deep learning architectures have substantially improved prediction accuracy, three evaluation challenges obscure the true progress of the field. First, inconsistent data preprocessing and incompatible model output spaces hinder fair model comparison. Second, flawed data splitting strategies can permit hidden sequence leakage and inflate reported performance. Third, existing evaluations typically lack comprehensive cross-species benchmarking and systematic assessment of model robustness to influential experimental conditions. To address these challenges, we propose PepSpecBench, a unified benchmark for peptide MS/MS spectrum prediction. PepSpecBench standardizes data preprocessing across complementary public datasets, enforces a strict backbone-disjoint splitting strategy to eliminate sequence leakage, and evaluates diverse architectures within a shared fragment-ion representation space. It further introduces a comprehensive multi-species evaluation suite and physically grounded metadata perturbation probes to assess model robustness and instrument awareness. We uncover previously unrecognized performance discrepancies and robustness limitations across six representative models, providing actionable insights for future model design, evaluation and practical deployment.

0 citations0 reviewsNo code linkedOpen access
preprint2025arXiv

Ab Initio Melting Properties of Water and Ice from Machine Learning Potentials

Liquid water exhibits several important anomalous properties in the vicinity of the melting temperature ($T_{\mathrm{m}}$) of ice Ih, including a higher density than ice and a density maximum at 4~$^{\circ}$C. Experimentally, an isotope effect on $T_{\mathrm{m}}$ is observed: the melting temperature of H$_2$O is approximately 4~K lower than that of D$_2$O. This difference can only be explained by nuclear quantum effects (NQEs), which can be accurately captured using path integral molecular dynamics (PIMD). Here we run PIMD simulations driven by Deep Potential (DP) models trained on data from density functional theory (DFT) based on SCAN, revPBE0-D3, SCAN0, and revPBE-D3 and a DP model trained on the MB-pol potential. We calculate the \tm of ice, the density discontinuity at melting, and the temperature of density maximum ($T_{\mathrm{dm}}$) of the liquid. We find that the model based on MB-pol agrees well with experiment. The models based on DFT incorrectly predict that NQEs lower $T_{\mathrm{m}}$. For the density discontinuity, SCAN and SCAN0 predict values close to the experimental result, while revPBE-D3 and revPBE0-D3 significantly underestimate it. Additionally, the models based on SCAN and SCAN0 correctly predict that the $T_{\mathrm{dm}}$ is higher than $T_{\mathrm{m}}$, while those based on revPBE-D3 and revPBE0-D3 predict the opposite. We attribute the deviations of the DFT-based models from experiment to the overestimation of hydrogen bond strength. Our results set the stage for more accurate simulations of aqueous systems grounded on DFT.

0 citations0 reviewsNo code linkedOpen access
preprint2025arXiv

Assessment of First-Principles Methods in Modeling the Melting Properties of Water

First-principles simulations have played a crucial role in deepening our understanding of the thermodynamic properties of water, and machine learning potentials (MLPs) trained on these first-principles data widen the range of accessible properties. However, the capabilities of different first-principles methods are not yet fully understood due to the lack of systematic benchmarks, the underestimation of the uncertainties introduced by MLPs, and the neglect of nuclear quantum effects (NQEs). Here, we systematically assess first-principles methods by calculating key melting properties using path integral molecular dynamics (PIMD) driven by Deep Potential (DP) models trained on data from density functional theory (DFT) with SCAN, revPBE0-D3, SCAN0 and revPBE-D3 functionals, as well as from the MB-pol potential. We find that MB-pol is in qualitatively good agreement with the experiment in all properties tested, whereas the four DFT functionals incorrectly predict that NQEs increase the melting temperature. SCAN and SCAN0 slightly underestimate the density change between water and ice upon melting, but revPBE-D3 and revPBE0-D3 severely underestimate it. Moreover, SCAN and SCAN0 correctly predict that the maximum liquid density occurs at a temperature higher than the melting point, while revPBE-D3 and revPBE0-D3 predict the opposite behavior. Our results highlight limitations in widely used first-principles methods and call for a reassessment of their predictive power in aqueous systems.

0 citations0 reviewsNo code linkedOpen access
preprint2024arXiv

Temporal Adaptive RGBT Tracking with Modality Prompt

RGBT tracking has been widely used in various fields such as robotics, surveillance processing, and autonomous driving. Existing RGBT trackers fully explore the spatial information between the template and the search region and locate the target based on the appearance matching results. However, these RGBT trackers have very limited exploitation of temporal information, either ignoring temporal information or exploiting it through online sampling and training. The former struggles to cope with the object state changes, while the latter neglects the correlation between spatial and temporal information. To alleviate these limitations, we propose a novel Temporal Adaptive RGBT Tracking framework, named as TATrack. TATrack has a spatio-temporal two-stream structure and captures temporal information by an online updated template, where the two-stream structure refers to the multi-modal feature extraction and cross-modal interaction for the initial template and the online update template respectively. TATrack contributes to comprehensively exploit spatio-temporal information and multi-modal information for target localization. In addition, we design a spatio-temporal interaction (STI) mechanism that bridges two branches and enables cross-modal interaction to span longer time scales. Extensive experiments on three popular RGBT tracking benchmarks show that our method achieves state-of-the-art performance, while running at real-time speed.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

$\rm ^{83}Rb$/$\rm ^{83m}Kr$ production and cross-section measurement with 3.4 MeV and 20 MeV proton beams

$\rm ^{83m}Kr$, with a short lifetime, is an ideal calibration source for liquid xenon or liquid argon detectors. The $\rm ^{83m}Kr$ isomer can be generated through the decay of $\rm ^{83} Rb$ isotope which is usually produced by proton beams bombarding natural krypton atoms. In this paper, we report a successful production of $\rm ^{83}Rb/^{83m}Kr$ with a proton beam energy of 3.4 MeV, and the first measurement of the production rate with such low energy proton beams. Another production attempt is performed using the newly available 20 MeV proton beam in China, and the measured production rate is consistent with previous measurements. The produced $\rm ^{83m}Kr$ source has been successfully injected into the PandaX-II liquid xenon detector, yielding enough statistics for detector calibration.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Deep Learning Based DOA Estimation for Hybrid Massive MIMO Receive Array with Overlapped Subarrays

To improve the accuracy of direction-of-arrival (DOA) estimation, a deep learning (DL)-based method called CDAE-DNN is proposed for hybrid analog and digital (HAD) massive MIMO receive array with overlapped subarray (OSA) architecture in this paper. In the proposed method, the sample covariance matrix (SCM) is first input to a convolution denoise autoencoder (CDAE) to remove the approximation error, then the output of CDAE is imported to a fully-connected (FC) network to get the estimation result. Based on the simulation results, the proposed CDAE-DNN has great performance advantages over traditional MUSIC algorithm and CNN-based method, especially in the situations with low signal to noise ratio (SNR) and low snapshot numbers. And the OSA architecture has also been shown to significantly improve the estimation accuracy compared to non-overlapped subarray (NOSA) architecture. In addition, the Cramer-Rao lower bound (CRLB) for the HAD-OSA architecture is presented.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Distributed Processing of k Shortest Path Queries over Dynamic Road Networks

The problem of identifying the k-shortest paths (KSPs for short) in a dynamic road network is essential to many location-based services. Road networks are dynamic in the sense that the weights of the edges in the corresponding graph constantly change over time, representing evolving traffic conditions. Very often such services have to process numerous KSP queries over large road networks at the same time, thus there is a pressing need to identify distributed solutions for this problem. However, most existing approaches are designed to identify KSPs on a static graph in a sequential manner (i.e., the (i+1)-th shortest path is generated based on the i-th shortest path), restricting their scalability and applicability in a distributed setting. We therefore propose KSP-DG, a distributed algorithm for identifying k-shortest paths in a dynamic graph. It is based on partitioning the entire graph into smaller subgraphs, and reduces the problem of determining KSPs into the computation of partial KSPs in relevant subgraphs, which can execute in parallel on a cluster of servers. A distributed two-level index called DTLP is developed to facilitate the efficient identification of relevant subgraphs. A salient feature of DTLP is that it indexes a set of virtual paths that are insensitive to varying traffic conditions, leading to very low maintenance cost in dynamic road networks. This is the first treatment of the problem of processing KSP queries over dynamic road networks. Extensive experiments conducted on real road networks confirm the superiority of our proposal over baseline methods.

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

LQoCo: Learning to Optimize Cache Capacity Overloading in Storage Systems

Cache plays an important role to maintain high and stable performance (i.e. high throughput, low tail latency and throughput jitter) in storage systems. Existing rule-based cache management methods, coupled with engineers' manual configurations, cannot meet ever-growing requirements of both time-varying workloads and complex storage systems, leading to frequent cache overloading. In this paper, we for the first time propose a light-weight learning-based cache bandwidth control technique, called \LQoCo which can adaptively control the cache bandwidth so as to effectively prevent cache overloading in storage systems. Extensive experiments with various workloads on real systems show that LQoCo, with its strong adaptability and fast learning ability, can adapt to various workloads to effectively control cache bandwidth, thereby significantly improving the storage performance (e.g. increasing the throughput by 10\%-20\% and reducing the throughput jitter and tail latency by 2X-6X and 1.5X-4X, respectively, compared with two representative rule-based methods).

0 citations0 reviewsNo code linkedOpen access
preprint2022arXiv

Optimal Measurement of Drone Swarm in RSS-based Passive Localization with Region Constraints

Passive geolocation by multiple unmanned aerial vehicles (UAVs) covers a wide range of military and civilian applications including rescue, wild life tracking and electronic warfare. The sensor-target geometry is known to significantly affect the localization precision. The existing sensor placement strategies mainly work on the cases without any constraints on the sensors locations. However, UAVs cannot fly/hover simply in arbitrary region due to realistic constraints, such as the geographical limitations, the security issues, and the max flying speed. In this paper, optimal geometrical configurations of UAVs in received signal strength (RSS)-based localization under region constraints are investigated. Employing the D-optimal criteria, i.e., minimizing the determinate of Fisher information matrix (FIM), such optimal problem is formulated. Based on the rigorous algebra and geometrical derivations, optimal and also closed form configurations of UAVs under different flying states are proposed. Finally, the effectiveness and practicality of the proposed configurations are demonstrated by simulation examples.

0 citations0 reviewsNo code linkedOpen access
preprint2021arXiv

Dynamic ordering transitions in charged solid

The phenomenon of group motion is common in nature, ranging from the schools of fish, birds and insects, to avalanches, landslides and sand drift. If we treat objects as collectively moving particles, such phenomena can be studied from a physical point of view, and the research on many-body systems has proved that marvelous effects can arise from the simplest individuals. The motion of numerous individuals presents different dynamic phases related to the ordering of the system. However, it is usually difficult to study the dynamic ordering and their transitions through experiments. Electron bubble states formed in a two-dimensional electron gas, as a type of electron solids, can be driven by an external electric field and provide a platform to study the dynamic collective behaviors. Here, we demonstrate that noise spectrum is a powerful method to investigate the dynamics of bubble states. We observed not only the phenomena from dynamically ordered and disordered structures, but also unexpected alternations between them. Our results show that a dissipative system can convert between chaotic structures and ordered structures when tuning global parameters, which is concealed in conventional transport measurements of resistance or conductance. Moreover, charging the objects to study electrical noise spectrum in collective motions can be an additional approach to revealing dynamic ordering transitions.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

RLCFR: Minimize Counterfactual Regret by Deep Reinforcement Learning

Counterfactual regret minimization (CFR) is a popular method to deal with decision-making problems of two-player zero-sum games with imperfect information. Unlike existing studies that mostly explore for solving larger scale problems or accelerating solution efficiency, we propose a framework, RLCFR, which aims at improving the generalization ability of the CFR method. In the RLCFR, the game strategy is solved by the CFR in a reinforcement learning framework. And the dynamic procedure of iterative interactive strategy updating is modeled as a Markov decision process (MDP). Our method, RLCFR, then learns a policy to select the appropriate way of regret updating in the process of iteration. In addition, a stepwise reward function is formulated to learn the action policy, which is proportional to how well the iteration strategy is at each step. Extensive experimental results on various games have shown that the generalization ability of our method is significantly improved compared with existing state-of-the-art methods.

0 citations0 reviewsNo code linkedOpen access
preprint2020arXiv

Top-k queries over digital traces

Recent advances in social and mobile technology have enabled an abundance of digital traces (in the form of mobile check-ins, association of mobile devices to specific WiFi hotspots, etc.) revealing the physical presence history of diverse sets of entities (e.g., humans, devices, and vehicles). One challenging yet important task is to identify k entities that are most closely associated with a given query entity based on their digital traces. We propose a suite of indexing techniques and algorithms to enable fast query processing for this problem at scale. We first define a generic family of functions measuring the association between entities, and then propose algorithms to transform digital traces into a lower-dimensional space for more efficient computation. We subsequently design a hierarchical indexing structure to organize entities in a way that closely associated entities tend to appear together. We then develop algorithms to process top-k queries utilizing the index. We theoretically analyze the pruning effectiveness of the proposed methods based on a mobility model which we propose and validate in real life situations. Finally, we conduct extensive experiments on both synthetic and real datasets at scale, evaluating the performance of our techniques both analytically and experimentally, confirming the effectiveness and superiority of our approach over other applicable approaches across a variety of parameter settings and datasets.

0 citations0 reviewsNo code linkedOpen access