arXiv subjects

Rui Li

Publications and source records attributed to Rui Li.

At least 163 records · Page 9Linked to original sources

arXiv2026

Efficient Sequential Recommendation for Long Term User Interest Via Personalization

Recent years have witnessed success of sequential modeling, generative recommender, and large language model for recommendation. Though the scaling law has been validated for sequential models, it showed inefficiency in computational capacity when considering real-world applications like recommendation, due to the non-linear(quadratic) increasing nature of the transformer model. To improve the efficiency of the sequential model, we introduced a novel approach to sequential recommendation that leverages personalization techniques to enhance efficiency and performance. Our method compresses long user interaction histories into learnable tokens, which are then combined with recent interactions to generate recommendations. This approach significantly reduces computational costs while maintaining high recommendation accuracy. Our method could be applied to existing transformer based recommendation models, e.g., HSTU and HLLM. Extensive experiments on multiple sequential models demonstrate its versatility and effectiveness. Source code is available at \href{https://github.com/facebookresearch/PerSRec}{https://github.com/facebookresearch/PerSRec}.

cs.IR↗

arXiv2025

Electromagnetically-Induced Transparency Bridges Disconnected Light-Harvesting Networks

The energy-transfer efficiency of the natural photosynthesis system seems to be perfectly optimized during the evolution for millions of years. However, how to enhance the efficiency in the artificial light-harvesting systems is still unclear. In this paper, we investigate the energy-transfer process in the photosystem I (PSI). When there is no effective coupling between the outer antenna (OA) and the reaction center (RC), the two light-harvesting networks are disconnected and thus the energy transfer is inefficient. In order to repair these disconnected networks, we introduce a bridge with three sites between them. We find that by modulating the level structure of the 3-site bridge to be resonant, the energy transfer via the dark state will be enhanced and even outperform the original PSI. Our discoveries may shed light on the designing mechanism of artificial light-harvesting systems.

physics.optics↗

arXiv2025

LabUtopia: High-Fidelity Simulation and Hierarchical Benchmark for Scientific Embodied Agents

Scientific embodied agents play a crucial role in modern laboratories by automating complex experimental workflows. Compared to typical household environments, laboratory settings impose significantly higher demands on perception of physical-chemical transformations and long-horizon planning, making them an ideal testbed for advancing embodied intelligence. However, its development has been long hampered by the lack of suitable simulator and benchmarks. In this paper, we address this gap by introducing LabUtopia, a comprehensive simulation and benchmarking suite designed to facilitate the development of generalizable, reasoning-capable embodied agents in laboratory settings. Specifically, it integrates i) LabSim, a high-fidelity simulator supporting multi-physics and chemically meaningful interactions; ii) LabScene, a scalable procedural generator for diverse scientific scenes; and iii) LabBench, a hierarchical benchmark spanning five levels of complexity from atomic actions to long-horizon mobile manipulation. LabUtopia supports 30 distinct tasks and includes more than 200 scene and instrument assets, enabling large-scale training and principled evaluation in high-complexity environments. We demonstrate that LabUtopia offers a powerful platform for advancing the integration of perception, planning, and control in scientific-purpose agents and provides a rigorous testbed for exploring the practical capabilities and generalization limits of embodied intelligence in future research.

cs.RO↗

arXiv2025

Total and dark mass from observations of galaxy centers with Machine Learning

The galaxy total mass inside the effective radius encode important information on the dark matter and galaxy evolution model. Total "central" masses can be inferred via galaxy dynamics or with gravitational lensing, but these methods have limitations. We propose a novel approach, based on Random Forest, to make predictions on the total and dark matter content of galaxies using simple observables from imaging and spectroscopic surveys. We use catalogs of multi-band photometry, sizes, stellar mass, kinematic "measurements" (features) and dark matter (targets) of simulated galaxies, from Illustris-TNG100 hydrodynamical simulation, to train a Mass Estimate machine Learning Algorithm (Mela). We separate the simulated sample in passive early-type galaxies (ETGs), both "normal" and "dwarf", and active late-type galaxies (LTGs) and show that the mass estimator can accurately predict the galaxy dark masses inside the effective radius in all samples. We finally test the mass estimator against the central mass estimates of a series of low redshift (z$\leq$0.1) datasets, including SPIDER, MaNGA/DynPop and SAMI dwarf galaxies, derived with standard dynamical methods based on Jeans equations. Dynamical masses are reproduced within 0.30 dex ($\sim2σ$), with a limited fraction of outliers and almost no bias. This is independent of the sophistication of the kinematical data collected (fiber vs. 3D spectroscopy) and the dynamical analysis adopted (radial vs. axisymmetric Jeans equations, virial theorem). This makes Mela a powerful alternative to predict the mass of galaxies of massive stage-IV surveys' datasets.

astro-ph.GA↗

arXiv2025

Mechanizing a Proof-Relevant Logical Relation for Timed Message-Passing Protocols

Semantic typing has become a powerful tool for program verification, applying the technique of logical relations as not only a proof method, but also a device for prescribing program behavior. In recent work, Yao et al. scaled semantic typing to the verification of timed message-passing protocols, which are prevalent in, e.g., IoT and real-time systems applications. The appeal of semantic typing in this context is precisely because of its ability to support typed and untyped program components alike -- including physical objects -- which caters to the heterogeneity of these applications. Another demand inherent to these applications is timing: constraining the time or time window within which a message exchange must happen. Yao et al. equipped their logical relation not only with temporal predicates, but also with computable trajectories, to supply the evidence that an inhabitant can step from one time point to another one. While Yao et al. provide the formalization for such a verification tool, it lacks a mechanization. Mechanizing the system would not only provide a machine proof for it, but also facilitate scalability for future extensions and applications. This paper tackles the challenge of mechanizing the resulting proof-relevant logical relation in a proof assistant. allowing trajectories to be interleaved, partitioned, and concatenated, while the intended equality on trajectories is the equality of their graphs when seen as processes indexed by time. Unfortunately, proof assistants based on intensional type theory only have modest support for such equations, forcing a prolific use of transports. This paper reports on the process of mechanizing Yao et al.'s results, comprising the logical relation, the algebra of computable trajectories with supporting lemmas, and the fundamental theorem of the logical relation, in the Rocq theorem prover.

cs.PL↗

arXiv2025

Theoretical study on excited states of ICl+ molecular ion considering spin-orbit coupling

The electronic structure of the ICl+ molecular ion is investigated by using high-level multireference configuration interaction (MRCI) method. To improve computational accuracy, Davidson corrections, spin-orbit coupling (SOC), and core-valence electron correlations effects are incorporated into the calculations. The potential energy curves (PECs) of 21 electronic states associated with the two lowest dissociation limits are obtained. The dipole moments (DMs) of the 21 electronic states of ICl+ are systematically studied, and the variations of DMs of the identical symmetry state in the avoided crossing regions are elucidated by analyzing the dominant electronic configuration. With the help of the calculated SOC matrix element, the interaction between crossing states can be elucidated. Spin-orbit coupling matrix elements involving the several states are calculated. By analyzing potential energy curves of these states and the nearby electronic states, the possible predissociation channels are provided. Based on the computed PECs, the spectroscopic constants of bound states are determined. The comparison of the spectroscopic constants including and excluding SOC effect indicates that the SOC effect has an obvious correction to the spectroscopic properties of low-lying states. Finally, the transition properties between excited states and the ground state are studied. Based on the computed transition dipole moments and Franck-Condon Factors, radiative lifetimes for the low-lying vibrational levels of excited states are evaluated.

physics.atom-ph↗

arXiv2025

Quantum Jump Approach for Photosynthetic Energy Transfer with Chemical Reaction and Fluorescence Loss

Recently, the coherent modified Redfield theory (CMRT) has been widely used to simulate the excitation-energy-transfer (EET) processes in photosynthetic systems. However, the numerical simulation of the CMRT is computationally expensive when dealing with large-scale systems, e.g. photosystem I (PSI) and II (PSII). On the other hand, the chemical reaction and fluorescence loss traditionally treated by the non-Hermitian Hamiltonian approach may result in significantly error in a wide range of parameters. To address these issues, we introduce a quantum jump approach (QJA) based on the CMRT to simulate the evolution of photosynthetic complexes including both the chemical reaction and fluorescence loss. The QJA shows higher accuracy and efficiency in simulating the EET processes. The QJA-CMRT approach may provide a powerful tool to design and optimize artificial photosynthetic systems, which benefits future innovation in the field of energy.

physics.chem-ph↗

arXiv2025

Asymptotic stability of planar entropy wave for 3-d Navier-Stokes equations in Eulerian coordinates

We investigate the large-time asymptotic behavior toward the planar entropy wave for the three-dimensional Navier-Stokes equations in Eulerian coordinates, considering two types of initial perturbations -- with and without the assumption that the integral of the initial perturbation is zero. Generic perturbations generate diffusion waves, and structural conditions fail for multi-dimensional Navier-Stokes equations in Eulerian coordinates. These two aspects have posed significant challenges and left the problem unresolved for years. On one hand, since \cite{LX}, the study of the entropy wave has been based on the left-right structural conditions. Without these structural conditions, the decay rates of lower-order terms become too slow to close the {\it a priori} assumption. On the other hand, the presence of diffusion waves yields problematic error terms in the perturbation system. In this work, we introduce a new transformation to ensure that both left-right structural conditions hold for the perturbation system. Additionally, using the fact that the derivative of the entropy wave maintains a fixed sign, we employ well-designed weighted energy estimates to control the slowly decaying terms. This enables us to establish asymptotic stability and derive the optimal decay rate. Furthermore, we address the case of initial perturbations with the zero mass condition and obtain the optimal decay rate by additionally developing a Poincaré type inequality and a key cancellation.

math.AP↗

arXiv2025

FedP$^2$EFT: Federated Learning to Personalize PEFT for Multilingual LLMs

Federated learning (FL) has enabled the training of multilingual large language models (LLMs) on diverse and decentralized multilingual data, especially on low-resource languages. To improve client-specific performance, personalization via the use of parameter-efficient fine-tuning (PEFT) modules such as LoRA is common. This involves a personalization strategy (PS), such as the design of the PEFT adapter structures (e.g., in which layers to add LoRAs and what ranks) and choice of hyperparameters (e.g., learning rates) for fine-tuning. Instead of manual PS configuration, we propose FedP$^2$EFT, a federated learning-to-personalize method for multilingual LLMs in cross-device FL settings. Unlike most existing PEFT structure selection methods, which are prone to overfitting low-data regimes, FedP$^2$EFT collaboratively learns the optimal personalized PEFT structure for each client via Bayesian sparse rank selection. Evaluations on both simulated and real-world multilingual FL benchmarks demonstrate that FedP$^2$EFT largely outperforms existing personalized fine-tuning methods, while complementing other existing FL methods.

cs.CL↗

arXiv2025

High-fidelity all-microwave CZ gate with partial erasure-error detection via a transmon coupler

Entangling gates between neighboring physical qubits are essential for quantum error correction. Implementing them in an all-microwave manner simplifies signal routing and control apparatus of superconducting quantum processors. We propose and experimentally demonstrate an all-microwave controlled-Z (CZ) gate that achieves high fidelity while suppressing residual ZZ interactions. Our approach utilizes a fixed-frequency transmon coupler and multi-path coupling, thereby sufficiently reducing the net transverse interaction between data transmons to suppress residual ZZ interactions. The controlled phase arises from the dispersive frequency shift of the $|gf\rangle$$\unicode{x2013}$$|eg\rangle$ transition between the coupler and one of the data transmons conditioned on the state of the other data transmon. Driving the transitions at the midpoint of two dispersively shifted resonance frequencies induces state-dependent geometric phases to achieve the CZ gate. Crucially, with this scheme, we can maintain a small net transverse interaction between two data transmons while increasing the coupling between the data and coupler transmons to accelerate the CZ-gate speed. Additionally, we measure the coupler state after the gate to detect a subset of decoherence-induced failures that occur during the gate operation. These events constitute erasure errors with known locations, enabling erasure-aware quantum error-correcting codes to improve future logical qubit performance.

quant-ph↗

arXiv2025

Personalized Interpolation: Achieving Efficient Conversion Estimation with Flexible Optimization Windows

Optimizing conversions is crucial in modern online advertising systems, enabling advertisers to deliver relevant products to users and drive business outcomes. However, accurately predicting conversion events remains challenging due to variable time delays between user interactions (e.g., impressions or clicks) and the actual conversions. These delays vary substantially across advertisers and products, necessitating flexible optimization windows tailored to specific conversion behaviors. To address this, we propose a novel \textit{Personalized Interpolation} method that extends existing models based on fixed conversion windows to support flexible advertiser-specific optimization windows. Our method enables accurate conversion estimation across diverse delay distributions without increasing system complexity. We evaluate the effectiveness of the proposed approach through extensive experiments using a real-world ads conversion model. Our results show that this method achieves both high prediction accuracy and improved efficiency compared to existing solutions. This study demonstrates the potential of our Personalized Interpolation method to improve conversion optimization and support a wider range of advertising strategies in large-scale online advertising systems.

cs.LG↗

arXiv2025

A Survey on Deep Text Hashing: Efficient Semantic Text Retrieval with Binary Representation

With the rapid growth of textual content on the Internet, efficient large-scale semantic text retrieval has garnered increasing attention from both academia and industry. Text hashing, which projects original texts into compact binary hash codes, is a crucial method for this task. By using binary codes, the semantic similarity computation for text pairs is significantly accelerated via fast Hamming distance calculations, and storage costs are greatly reduced. With the advancement of deep learning, deep text hashing has demonstrated significant advantages over traditional, data-independent hashing techniques. By leveraging deep neural networks, these methods can learn compact and semantically rich binary representations directly from data, overcoming the performance limitations of earlier approaches. This survey investigates current deep text hashing methods by categorizing them based on their core components: semantic extraction, hash code quality preservation, and other key technologies. We then present a detailed evaluation schema with results on several popular datasets, followed by a discussion of practical applications and open-source tools for implementation. Finally, we conclude by discussing key challenges and future research directions, including the integration of deep text hashing with large language models to further advance the field. The project for this survey can be accessed at https://github.com/hly1998/DeepTextHashing.

cs.IR↗

arXiv2025

Beyond Benchmarks: The Economics of AI Inference

The inference cost of Large Language Models (LLMs) has become a critical factor in determining their commercial viability and widespread adoption. This paper introduces a quantitative ``economics of inference'' framework, treating the LLM inference process as a compute-driven intelligent production activity. We analyze its marginal cost, economies of scale, and quality of output under various performance configurations. Based on empirical data from WiNEval-3.0, we construct the first ``LLM Inference Production Frontier,'' revealing three principles: diminishing marginal cost, diminishing returns to scale, and an optimal cost-effectiveness zone. This paper not only provides an economic basis for model deployment decisions but also lays an empirical foundation for the future market-based pricing and optimization of AI inference resources.

cs.AI↗

arXiv2025

Eye-Tracking, Mouse Tracking, Stimulus Tracking,and Decision-Making Datasets in Digital Pathology

Interpretation of giga-pixel whole-slide images (WSIs) is an important but difficult task for pathologists. Their diagnostic accuracy is estimated to average around 70%. Adding a second pathologist does not substantially improve decision consistency. The field lacks adequate behavioral data to explain diagnostic errors and inconsistencies. To fill in this gap, we present PathoGaze1.0, a comprehensive behavioral dataset capturing the dynamic visual search and decision-making processes of the full diagnostic workflow during cancer diagnosis. The dataset comprises 18.69 hours of eye-tracking, mouse interaction, stimulus tracking, viewport navigation, and diagnostic decision data (EMSVD) collected from 19 pathologists interpreting 397 WSIs. The data collection process emphasizes ecological validity through an application-grounded testbed, called PTAH. In total, we recorded 171,909 fixations, 263,320 saccades, and 1,867,362 mouse interaction events. In addition, such data could also be used to improve the training of both pathologists and AI systems that might support human experts. All experiments were preregistered at https://osf.io/hj9a7, and the complete dataset along with analysis code is available at https://go.osu.edu/pathogaze.

cs.CV↗

arXiv2025

Towards Straggler-Resilient Split Federated Learning: An Unbalanced Update Approach

Split Federated Learning (SFL) enables scalable training on edge devices by combining the parallelism of Federated Learning (FL) with the computational offloading of Split Learning (SL). Despite its great success, SFL suffers significantly from the well-known straggler issue in distributed learning systems. This problem is exacerbated by the dependency between Split Server and clients: the Split Server side model update relies on receiving activations from clients. Such synchronization requirement introduces significant time latency, making straggler a critical bottleneck to the scalability and efficiency of the system. To mitigate this problem, we propose MU-SplitFed, a straggler-resilient SFL algorithm in zeroth-order optimization that decouples training progress from straggler delays via a simple yet effective unbalanced update mechanism. By enabling the server to perform $τ$ local updates per client round, MU-SplitFed achieves a convergence rate of $O(\sqrt{d/(τT)})$ for non-convex objectives, demonstrating a linear speedup of $τ$ in communication rounds. Experiments demonstrate that MU-SplitFed consistently outperforms baseline methods with the presence of stragglers and effectively mitigates their impact through adaptive tuning of $τ$. The code for this project is available at https://github.com/Johnny-Zip/MU-SplitFed.

cs.DC↗

arXiv2025

Neutron source-based event reconstruction algorithm in large liquid scintillator detectors

We developed an event reconstruction algorithm, applicable to large liquid scintillator detectors, built primarily upon neutron calibration data. We employ a likelihood method using photon detection time and charge information from individual photomultiplier tubes. Detector response tables in the likelihood function were derived from americium-carbon neutron source events, 2.2~MeV $γ$-ray events from cosmic-ray muon spallation neutrons, and laser calibration events. This algorithm can reconstruct the event position, energy, and also has capability to differentiate particle types for events within the energy range of reactor neutrinos. Using the detector simulation of the Jiangmen Underground Neutrino Observatory (JUNO) experiment as a large liquid scintillator detector example, we demonstrate that the presented reconstruction algorithm has a reconstructed position accuracy within $\pm$4~cm, and a reconstructed energy non-uniformity under 0.5\% throughout the central detector volume. The vertex resolution for positron events at 1~MeV is estimated to be around 9~cm, and the energy resolution is confirmed to be comparable to that in the JUNO official publication. Furthermore, the algorithm can eliminate 80\% (45\%) of $α$-particle (fast-neutron) events while maintaining a positron event selection efficiency of approximately 99\%.

physics.ins-det↗

arXiv2025

LLM-REVal: Can We Trust LLM Reviewers Yet?

The rapid advancement of large language models (LLMs) has inspired researchers to integrate them extensively into the academic workflow, potentially reshaping how research is practiced and reviewed. While previous studies highlight the potential of LLMs in supporting research and peer review, their dual roles in the academic workflow and the complex interplay between research and review bring new risks that remain largely underexplored. In this study, we focus on how the deep integration of LLMs into both peer-review and research processes may influence scholarly fairness, examining the potential risks of using LLMs as reviewers by simulation. This simulation incorporates a research agent, which generates papers and revises, alongside a review agent, which assesses the submissions. Based on the simulation results, we conduct human annotations and identify pronounced misalignment between LLM-based reviews and human judgments: (1) LLM reviewers systematically inflate scores for LLM-authored papers, assigning them markedly higher scores than human-authored ones; (2) LLM reviewers persistently underrate human-authored papers with critical statements (e.g., risk, fairness), even after multiple revisions. Our analysis reveals that these stem from two primary biases in LLM reviewers: a linguistic feature bias favoring LLM-generated writing styles, and an aversion toward critical statements. These results highlight the risks and equity concerns posed to human authors and academic research if LLMs are deployed in the peer review cycle without adequate caution. On the other hand, revisions guided by LLM reviews yield quality gains in both LLM-based and human evaluations, illustrating the potential of the LLMs-as-reviewers for early-stage researchers and enhancing low-quality papers.

cs.CL↗

arXiv2025

CAM: A Constructivist View of Agentic Memory for LLM-Based Reading Comprehension

Current Large Language Models (LLMs) are confronted with overwhelming information volume when comprehending long-form documents. This challenge raises the imperative of a cohesive memory module, which can elevate vanilla LLMs into autonomous reading agents. Despite the emergence of some heuristic approaches, a systematic design principle remains absent. To fill this void, we draw inspiration from Jean Piaget's Constructivist Theory, illuminating three traits of the agentic memory -- structured schemata, flexible assimilation, and dynamic accommodation. This blueprint forges a clear path toward a more robust and efficient memory system for LLM-based reading comprehension. To this end, we develop CAM, a prototype implementation of Constructivist Agentic Memory that simultaneously embodies the structurality, flexibility, and dynamicity. At its core, CAM is endowed with an incremental overlapping clustering algorithm for structured memory development, supporting both coherent hierarchical summarization and online batch integration. During inference, CAM adaptively explores the memory structure to activate query-relevant information for contextual response, akin to the human associative process. Compared to existing approaches, our design demonstrates dual advantages in both performance and efficiency across diverse long-text reading comprehension tasks, including question answering, query-based summarization, and claim verification.

cs.CL↗