arXiv subjects

Rui Li

Publications and source records attributed to Rui Li.

At least 181 records · Page 10Linked to original sources

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↗

arXiv2025

Hardware-Aware Parallel Prompt Decoding for Memory-Efficient Acceleration of LLM Inference

The auto-regressive decoding of Large Language Models (LLMs) results in significant overheads in their hardware performance. While recent research has investigated various speculative decoding techniques for multi-token generation, these efforts have primarily focused on improving processing speed such as throughput. Crucially, they often neglect other metrics essential for real-life deployments, such as memory consumption and training cost. To overcome these limitations, we propose a novel parallel prompt decoding that requires only $0.0002$% trainable parameters, enabling efficient training on a single A100-40GB GPU in just 16 hours. Inspired by the human natural language generation process, $PPD$ approximates outputs generated at future timesteps in parallel by using multiple prompt tokens. This approach partially recovers the missing conditional dependency information necessary for multi-token generation, resulting in up to a 28% higher acceptance rate for long-range predictions. Furthermore, we present a hardware-aware dynamic sparse tree technique that adaptively optimizes this decoding scheme to fully leverage the computational capacities on different GPUs. Through extensive experiments across LLMs ranging from MobileLlama to Vicuna-13B on a wide range of benchmarks, our approach demonstrates up to 2.49$\times$ speedup and maintains a minimal runtime memory overhead of just $0.0004$%. More importantly, our parallel prompt decoding can serve as an orthogonal optimization for synergistic integration with existing speculative decoding, showing up to $1.22\times$ further speed improvement. Our code is available at https://github.com/hmarkc/parallel-prompt-decoding.

cs.LG↗

arXiv2025

Ricci Flow on Weighted Digraphs with Balancing Factor

Ricci curvature and Ricci flow have proven to be powerful tools for analyzing the geometry of discrete structures, particularly on undirected graphs, where they have been applied to tasks ranging from community detection to graph representation learning. However, their development on directed graphs remains limited, with Ricci flow being especially underexplored. In this work, we introduce a rigorous formulation of Ricci flow on directed weighted graphs, which evolves edge weights while preserving distances, and establish both the existence and uniqueness of its solutions. To capture the essence of asymmetry in directed networks and to enhance the capability of modeling more flexible structures, we incorporate a node-wise balancing factor that regulates between outflow and inflow. Building on the continuous Ricci flow evolution framework, we propose a discrete Ricci flow algorithm that is applicable to numerical computing. Numerical studies on various directed graph examples demonstrate the capacity of the proposed flow to reveal structural asymmetry and dynamic evolutions.

math.DG↗

arXiv2025

Using Deep Learning Methods to Detect for Ultra-diffuse Galaxies in KiDS

Ultra-diffuse Galaxies (UDGs) are a subset of Low Surface Brightness Galaxies (LSBGs), showing mean effective surface brightness fainter than $24\ \rm mag\ \rm arcsec^{-2}$ and a diffuse morphology, with effective radii larger than 1.5 kpc. Due to their elusiveness, traditional methods are challenging to be used over large sky areas. Here we present a catalog of ultra-diffuse galaxy (UDG) candidates identified in the full 1350 deg$^2$ area of the Kilo-Degree Survey (KiDS) using deep learning. In particular, we use a previously developed network for the detection of low surface brightness systems in the Sloan Digital Sky Survey \citep[LSBGnet,][]{su2024lsbgnet} and optimised for UDG detection. We train this new UDG detection network for KiDS (UDGnet-K), with an iterative approach, starting from a small-scale training sample. After training and validation, the UGDnet-K has been able to identify $\sim3300$ UDG candidates, among which, after visual inspection, we have selected 545 high-quality ones. The catalog contains independent re-discovery of previously confirmed UDGs in local groups and clusters (e.g NGC 5846 and Fornax), and new discovered candidates in about 15 local systems, for a total of 67 {\it bona fide} associations. Besides the value of the catalog {\it per se} for future studies of UDG properties, this work shows the effectiveness of an iterative approach to training deep learning tools in presence of poor training samples, due to the paucity of confirmed UDG examples, which we expect to replicate for upcoming all-sky surveys like Rubin Observatory, Euclid and the China Space Station Telescope.

astro-ph.GA↗

arXiv2025

AI-Driven Adaptive Air Transit Network with Modular Aerial Pods

This paper presents an adaptive air transit network leveraging modular aerial pods and artificial intelligence (AI) to address urban mobility challenges. Passenger demand, forecasted from AI models, serves as input parameters for a Mixed-Integer Nonlinear Programming (MINLP) optimization model that dynamically adjusts pod dispatch schedules and train lengths in response to demand variations. The results reveal a complex interplay of factors, including demand levels, headway bounds, train configurations, and fleet sizes, which collectively influence network performance and service quality. The proposed system demonstrates the importance of dynamic adjustments, where modularity mitigates capacity bottlenecks and improves operational efficiency. Additionally, the framework enhances energy efficiency and optimizes resource utilization through flexible and adaptive scheduling. This framework provides a foundation for a responsive and sustainable urban air mobility solution, supporting the shift from static planning to agile, data-driven operations.

math.OC↗

arXiv2025

Image-based modelling of rock non-linear deformation under low-stress levels

Rock geophysical properties are widely reported to exhibit non-linear behaviours under low-stress conditions (below 10-20 MPa) before transitioning to the linear elastic stage, primarily due to the closure of microcracks and grain interfaces. Image-based modelling of rock deformation struggles to effectively characterise the microcrack closure effect because of the partial-volume effect, where image voxels are larger than microcracks and contain both pore and solid phases. This study presents a novel method to simulate non-linear rock deformation under elevated stress conditions. The method reconstructs digital rock models by treating partial-volume voxels as transitional phases that incorporate microcracks. By assigning intermediate elastic moduli and assuming that the pore portion within each partial-volume voxel deforms before the remaining solid content, the method employs the finite element method to simulate rock deformation and calculate the porosity of the deformed model. The method is tested on two Bentheimer sandstone models, and the results demonstrate its ability to predict the non-linear changes in porosity and elastic properties as the effective stress increases. This work provides a new pathway for image-based modelling of non-linear rock deformation considering the microcrack closure effect, offering valuable insights into the complex mechanical behaviour of rocks under confinement.

physics.geo-ph↗

arXiv2025

Reactive Chemistry at Unrestricted Coupled Cluster Level: High-throughput Calculations for Training Machine Learning Potentials

Accurately modeling chemical reactions at the atomistic level requires high-level electronic structure theory due to the presence of unpaired electrons and the need to properly describe bond breaking and making energetics. Commonly used approaches such as Density Functional Theory (DFT) frequently fail for this task due to deficiencies that are well recognized. However, for high-fidelity approaches, creating large datasets of energies and forces for reactive processes to train machine learning interatomic potentials or force fields is daunting. For example, the use of the unrestricted coupled cluster level of theory has previously been seen as unfeasible due to high computational costs, the lack of analytical gradients in many computational codes, and additional challenges such as constructing suitable basis set corrections for forces. In this work, we develop new methods and workflows to overcome the challenges inherent to automating unrestricted coupled cluster calculations. Using these advancements, we create a dataset of gas-phase reactions containing energies and forces for 3119 different organic molecules configurations calculated at the gold-standard level of unrestricted CCSD(T) (coupled cluster singles doubles and perturbative triples). With this dataset, we provide an analysis of the differences between the density functional and unrestricted CCSD(T) descriptions. We develop a transferable machine learning interatomic potential for gas-phase reactions, trained on unrestricted CCSD(T) data, and demonstrate the advantages of transitioning away from DFT data. Transitioning from training to DFT to training to UCCSD(T) datasets yields an improvement of more than 0.1 eV/Å in force accuracy and over 0.1 eV in activation energy reproduction.

physics.chem-ph↗

arXiv2025

Dovetail: A CPU/GPU Heterogeneous Speculative Decoding for LLM inference

With the continuous advancement in the performance of large language models (LLMs), their demand for computational resources and memory has significantly increased, which poses major challenges for efficient inference on consumer-grade devices and legacy servers. These devices typically feature relatively weaker GPUs and stronger CPUs. Although techniques such as parameter offloading and partial offloading can alleviate GPU memory pressure to some extent, their effectiveness is limited due to communication latency and suboptimal hardware resource utilization. To address this issue, we propose Dovetail, a lossless inference acceleration method that leverages the complementary characteristics of heterogeneous devices and the advantages of speculative decoding. Dovetail deploys a draft model on the GPU to perform preliminary predictions, while a target model running on the CPU validates these outputs. By reducing the granularity of data transfer, Dovetail significantly minimizes communication overhead. To further improve efficiency, we optimize the draft model specifically for heterogeneous hardware environments by reducing the number of draft tokens to lower parallel verification latency, increasing model depth to enhance predictive capabilities, and introducing a Dynamic Gating Fusion (DGF) mechanism to improve the integration of feature and embedding information. We conduct comprehensive evaluations of Dovetail across various consumer-grade GPUs, covering multiple tasks and mainstream models. Experimental results on 13B models demonstrate that Dovetail achieves inference speedups ranging from 1.79x to 10.1x across different devices, while maintaining consistency and stability in the distribution of generated texts.

cs.CL↗

arXiv2025

LogicCat: A Chain-of-Thought Text-to-SQL Benchmark for Complex Reasoning

Text-to-SQL is a critical task in natural language processing that aims to transform natural language questions into accurate and executable SQL queries. In real-world scenarios, these reasoning tasks are often accompanied by complex mathematical computations, domain knowledge, and hypothetical reasoning scenarios. However, existing large-scale Text-to-SQL datasets typically focus on business logic and task logic, neglecting critical factors such as vertical domain knowledge, complex mathematical reasoning, and hypothetical reasoning, which are essential for realistically reflecting the reasoning demands in practical applications and completing data querying and analysis. To bridge this gap, we introduce LogicCat, the first Text-to-SQL benchmark dataset specifically designed for complex reasoning and chain-of-thought parsing, encompassing physics, arithmetic, commonsense, and hypothetical reasoning scenarios. LogicCat comprises 4,038 English questions paired 12,114 detailed chain-of-thought reasoning steps, spanning 45 databases across diverse domains, significantly surpassing existing datasets in complexity. Experimental results demonstrate that LogicCat substantially increases the task difficulty for current state-of-the-art models to at most 33.20% execution accuracy, indicating that this task remains exceptionally challenging. The advancement of LogicCat represents a crucial step toward developing systems suitable for real-world enterprise data analysis and autonomous query generation. We have released our dataset code at https://github.com/Ffunkytao/LogicCat.

cs.CL↗

arXiv2025

LGBP-OrgaNet: Learnable Gaussian Band Pass Fusion of CNN and Transformer Features for Robust Organoid Segmentation and Tracking

Organoids replicate organ structure and function, playing a crucial role in fields such as tumor treatment and drug screening. Their shape and size can indicate their developmental status, but traditional fluorescence labeling methods risk compromising their structure. Therefore, this paper proposes an automated, non-destructive approach to organoid segmentation and tracking. We introduced the LGBP-OrgaNet, a deep learning-based system proficient in accurately segmenting, tracking, and quantifying organoids. The model leverages complementary information extracted from CNN and Transformer modules and introduces the innovative feature fusion module, Learnable Gaussian Band Pass Fusion, to merge data from two branches. Additionally, in the decoder, the model proposes a Bidirectional Cross Fusion Block to fuse multi-scale features, and finally completes the decoding through progressive concatenation and upsampling. SROrga demonstrates satisfactory segmentation accuracy and robustness on organoids segmentation datasets, providing a potent tool for organoid research.

cs.CV↗

arXiv2025

Optical+NIR analysis of a Newly Confirmed Einstein ring at z$\sim$1 from the Kilo-Degree Survey: Dark matter fraction, total and dark matter density slope and IMF

We report the spectroscopic confirmation of a bright blue Einstein ring in the Kilo Degree Survey (KiDS) footprint: the Einstein ``blue eye''. Spectroscopic data from X-Shooter at the Very Large Telescope (VLT) show that the lens is a typical early-type galaxy (ETG) at $z_l=0.9906$, while the background source is a Ly$α$ emitter at $z_s=2.823$. The reference lens modeling was performed on a high-resolution $Y-$band adaptive-optics image from HAWK-I at VLT. Assuming a singular isothermal ellipsoid (SIE) total mass density profile, we inferred an Einstein radius $R_{Ein}=10.47 \pm 0.06$ kpc. The average slope of the total mass density inside the Einstein radius, as determined by a joint analysis of lensing and isotropic Jeans equations is $γ_{tot}=2.14^{+0.06}_{-0.07}$, showing no systematic deviation from the slopes of lower redshift galaxies, This can be the evidence of ETGs developing through dry mergers plus moderate dissipationless accretion. Stellar population analysis with 8-band ($gri$ZYJHK$s$) photometries from KiDS and VIKING shows that the total stellar mass of the lens is $M*=(3.95\pm 0.35)\times 10^{11} M_\odot$ (Salpeter Initial Mass Function, IMF), implying a dark matter fraction inside the effective radius to be $f_{\rm DM}=0.307\pm 0.151$. We finally explored the dark matter halo slope and found a strong degeneracy with the dynamic stellar mass. Dark matter adiabatic contraction is needed to explain the posterior distribution of the slope unless IMF heavier than Salpeter is assumed.

astro-ph.GA↗

arXiv2025

Temporal Preference Optimization for Long-Form Video Understanding

Despite significant advancements in video large multimodal models (video-LMMs), achieving effective temporal grounding in long-form videos remains a challenge for existing models. To address this limitation, we propose Temporal Preference Optimization (TPO), a novel post-training framework designed to enhance the temporal grounding capabilities of video-LMMs through preference learning. TPO adopts a self-training approach that enables models to differentiate between well-grounded and less accurate temporal responses by leveraging curated preference datasets at two granularities: localized temporal grounding, which focuses on specific video segments, and comprehensive temporal grounding, which captures extended temporal dependencies across entire video sequences. By optimizing on these preference datasets, TPO significantly enhances temporal understanding while reducing reliance on manually annotated data. Extensive experiments on three long-form video understanding benchmarks--LongVideoBench, MLVU, and Video-MME--demonstrate the effectiveness of TPO across two state-of-the-art video-LMMs. Notably, LLaVA-Video-TPO establishes itself as the leading 7B model on the Video-MME benchmark, underscoring the potential of TPO as a scalable and efficient solution for advancing temporal reasoning in long-form video understanding. Project page: https://ruili33.github.io/tpo_website.

cs.CV↗

arXiv2025

Low-energy effective Hamiltonian and end states of an inverted HgTe nanowire

The band inversion transition in a cylindrical HgTe nanowire is inducible via varying the nanowire radius. Here we derive the low-energy effective Hamiltonian describing the band structure of the HgTe nanowire close to the fundamental band gap. Because both the $E_{1}$ and $H_{1}$ subbands have quadratic dependence on $k_{z}$ when the gap closes, we need to consider at least three subbands, i.e., the $E_{1}$, $H_{1}$, and $H_{2}$ subbands, in building the effective Hamiltonian. The resulting effective Hamiltonian is block diagonal and each block is a $3\times3$ matrix. End states are found in the inverted regime when we solve the effective Hamiltonian with open boundary condition.

cond-mat.mes-hall↗

arXiv2025

Image-based modelling of elastic properties using unresolved rock images

The trade-off between image resolution and model field-of-view has long been a limitation for numerical simulations in digital rock models. A significant amount of sub-resolution pore space cannot be captured in the unresolved digital rock images, which hinders the accuracy of numerical simulations, especially those predicting the rock effective elastic properties. This work uses paired digital rock images at multiple resolutions to investigate the sub-resolution solid and pore fraction distributions. It demonstrates that the cumulative Beta distribution function can effectively represent the solid and pore fractions in unresolved rock images. Based on this finding, we propose a novel methodology to predict the sub-resolution pore fractions. Compared to the pore fractions extracted from paired Bentheimer sandstone images at resolutions of 2, 6, and 18um, the proposed method yields double-weighted mean absolute percentage errors (WWMAPE) of 3.67% (6um) and 13.78% (18um), significantly lower than the SLOT technique's errors of 24.55% (6um) and 59.33% (18um). By incorporating the modelled solid and pore fractions with effective medium theory, this work achieves improved predictions of effective elastic moduli and wave velocities across various rock types. This method has significant implications for conducting enhanced simulations of geophysical properties in unresolved rock models.

physics.geo-ph↗

arXiv2025

Explicit v.s. Implicit Memory: Exploring Multi-hop Complex Reasoning Over Personalized Information

In large language model-based agents, memory serves as a critical capability for achieving personalization by storing and utilizing users' information. Although some previous studies have adopted memory to implement user personalization, they typically focus on preference alignment and simple question-answering. However, in the real world, complex tasks often require multi-hop reasoning on a large amount of user information, which poses significant challenges for current memory approaches. To address this limitation, we propose the multi-hop personalized reasoning task to explore how different memory mechanisms perform in multi-hop reasoning over personalized information. We explicitly define this task and construct a dataset along with a unified evaluation framework. Then, we implement various explicit and implicit memory methods and conduct comprehensive experiments. We evaluate their performance on this task from multiple perspectives and analyze their strengths and weaknesses. Besides, we explore hybrid approaches that combine both paradigms and propose the HybridMem method to address their limitations. We demonstrate the effectiveness of our proposed model through extensive experiments. To benefit the research community, we release this project at https://github.com/nuster1128/MPR.

cs.AI↗

arXiv2025

Learn to Memorize: Optimizing LLM-based Agents with Adaptive Memory Framework

LLM-based agents have been extensively applied across various domains, where memory stands out as one of their most essential capabilities. Previous memory mechanisms of LLM-based agents are manually predefined by human experts, leading to higher labor costs and suboptimal performance. In addition, these methods overlook the memory cycle effect in interactive scenarios, which is critical to optimizing LLM-based agents for specific environments. To address these challenges, in this paper, we propose to optimize LLM-based agents with an adaptive and data-driven memory framework by modeling memory cycles. Specifically, we design an MoE gate function to facilitate memory retrieval, propose a learnable aggregation process to improve memory utilization, and develop task-specific reflection to adapt memory storage. Our memory framework empowers LLM-based agents to learn how to memorize information effectively in specific environments, with both off-policy and on-policy optimization. In order to evaluate the effectiveness of our proposed methods, we conduct comprehensive experiments across multiple aspects. To benefit the research community in this area, we release our project at https://github.com/nuster1128/learn_to_memorize.

cs.LG↗