arXiv subjects

Zhiyuan Li

Publications and source records attributed to Zhiyuan Li.

At least 199 records · Page 11Linked to original sources

arXiv2025

Search for MeV-Scale Axionlike Particles and Dark Photons with PandaX-4T

Axionlike particles (ALPs) and dark photons (DPs) are viable dark matter particle candidates. We have searched for possible ALP/DP signals in the PandaX-4T liquid xenon detector using 440 kg$\cdot$yr of data. A binned likelihood fit is constructed to search for possible mono-energetic peaks induced by the absorption processes between ALPs/DPs and atomic electrons of xenon. A detailed temporal model of decays associated with xenon isotopes is introduced to constrain the number of background events. No signal excess over background expectations is observed, and we have established the most stringent exclusion limits for most ALP/DP masses across the range of 150 keV/$c^2$ to 1 MeV/$c^2$. The improvement is particularly significant within the mass range of \text{150-400}~keV/$c^2$, with the average factor of 3.5 compared to previous results.

hep-ex↗

arXiv2025

Reasoning with Latent Thoughts: On the Power of Looped Transformers

Large language models have shown remarkable reasoning abilities and scaling laws suggest that large parameter count, especially along the depth axis, is the primary driver. In this work, we make a stronger claim -- many reasoning problems require a large depth but not necessarily many parameters. This unlocks a novel application of looped models for reasoning. Firstly, we show that for many synthetic reasoning problems like addition, $p$-hop induction, and math problems, a $k$-layer transformer looped $L$ times nearly matches the performance of a $kL$-layer non-looped model, and is significantly better than a $k$-layer model. This is further corroborated by theoretical results showing that many such reasoning problems can be solved via iterative algorithms, and thus, can be solved effectively using looped models with nearly optimal depth. Perhaps surprisingly, these benefits also translate to practical settings of language modeling -- on many downstream reasoning tasks, a language model with $k$-layers looped $L$ times can be competitive to, if not better than, a $kL$-layer language model. In fact, our empirical analysis reveals an intriguing phenomenon: looped and non-looped models exhibit scaling behavior that depends on their effective depth, akin to the inference-time scaling of chain-of-thought (CoT) reasoning. We further elucidate the connection to CoT reasoning by proving that looped models implicitly generate latent thoughts and can simulate $T$ steps of CoT with $T$ loops. Inspired by these findings, we also present an interesting dichotomy between reasoning and memorization, and design a looping-based regularization that is effective on both fronts.

cs.CL↗

arXiv2025

Prediction for close approaches with terrestrial planets of asteroids from the main belt

Potentially Hazardous Asteroids (PHAs), a special subset of Near-Earth Objects, are both dangerous and scientifically valuable. PHAs that truly undergo close approaches with the Earth (dubbed CAPHAs) are of particular interest and extensively studied. The concept and study of CAPHA can be extended to other Solar system planets, which have significant implications for future planet-based observations and explorations. In this work, we conduct numerical simulations that incorporate the Yarkovsky effect to study the transformation of main belt asteroids into CAPHAs of terrestrial planets, using precise nominal timesteps, especially to ensure the reliability of the results for Mercury and Venus. Our simulations predict a total of 1893 Mercury-CAPHAs, 3014 Venus-CAPHAs, 3791 Earth-CAPHAs and 18066 Mars-CAPHAs, with an occurrence frequency of about 1, 9, 15 and 66 per year, respectively. The values for Mars-CAPHAs are consistent with our previous work, which were based on simulations with a larger nominal timestep. The predicted occurrence frequency and velocity distribution of Earth-CAPHAs are in reasonable agreement with the observed population of Earth-CAPHAs. We also find that certain asteroids can be caught in close approach with different planets at different times, raising an interesting possibility of using them as transportation between terrestrial planets in the future.

astro-ph.EP↗

arXiv2025

Megrez-Omni Technical Report

In this work, we present the Megrez models, comprising a language model (Megrez-3B-Instruct) and a multimodal model (Megrez-3B-Omni). These models are designed to deliver fast inference, compactness, and robust edge-side intelligence through a software-hardware co-design approach. Megrez-3B-Instruct offers several advantages, including high accuracy, high speed, ease of use, and a wide range of applications. Building on Megrez-3B-Instruct, Megrez-3B-Omni is an on-device multimodal understanding LLM that supports image, text, and audio analysis. It achieves state-of-the-art accuracy across all three modalities and demonstrates strong versatility and robustness, setting a new benchmark for multimodal AI models.

cs.LG↗

arXiv2025

Position reconstruction and surface background model for the PandaX-4T detector

We report the position reconstruction methods and surface background model for the PandaX-4T dark matter direct search experiment. This work develops two position reconstruction algorithms: template matching (TM) method and photon acceptance function (PAF) method. Both methods determine the horizontal position of events based on the light pattern of secondary scintillation collected by the light sensors. After a comprehensive evaluation of resolution, uniformity, and robustness, the PAF method was selected for position reconstruction, while the TM method was employed for verification. The PAF method achieves a bulk event resolution of 1.0 mm and a surface event resolution of 4.4 mm for a typical $S2$ signal with a bottom charge of 1500 PE (about 14 keV). The uniformity is around 20\%. Robustness studies reveal average deviations of 5.1 mm and 8.8 mm for the commissioning run (Run0) and the first science run (Run1), respectively, due to the deactivation of certain PMTs. A data-driven surface background model is developed based on the PAF method. The surface background is estimated to be $0.09 \pm 0.06$ events for Run0 (0.54 tonne$\cdot$year) and $0.17 \pm 0.11$ events for Run1 (1.00 tonne$\cdot$year).

physics.ins-det↗

arXiv2025

Dark Matter Search Results from 1.54 Tonne$\cdot$Year Exposure of PandaX-4T

In this letter, we report the dark matter search results from the commissioning run and the first science run of the PandaX-4T experiment. A blind analysis is carried out on the entire data set. The data processing is improved compared to previous work, unifying the low-level signal reconstruction in a wide energy range up to 120 keV. With a total exposure of 1.54 tonne$\cdot$year, no significant excess of nuclear recoil events is found. The lowest 90% confidence level exclusion on the spin-independent cross section is $1.6 \times 10^{-47}\,\mathrm{cm}^2$ at a dark matter mass of 40 GeV$/c^2$. Our results represent the most stringent constraint for a dark matter mass above 100 GeV$/c^2$.

hep-ex↗

arXiv2025

Exploring New Physics with PandaX-4T Low Energy Electronic Recoil Data

New particles beyond the standard model of particle physics, such as axions, can be effectively searched through their interactions with electrons. We use the large liquid xenon detector PandaX-4T to search for novel electronic recoil signals induced by solar axions, neutrinos with anomalous magnetic moment, axionlike particles, dark photons, and light fermionic dark matter. A detailed background model is established using the latest datasets with 1.54 $\rm ton \cdot yr$ exposure. No significant excess above the background has been observed, and we have obtained competitive constraints for axion couplings, neutrino magnetic moment, and fermionic dark matter interactions.

hep-ex↗

arXiv2025

Inverse source problem of sub-diffusion of variable exponent

This work investigates both direct and inverse problems of the variable-exponent sub-diffusion model, which attracts increasing attentions in both practical applications and theoretical aspects. Based on the perturbation method, which transfers the original model to an equivalent but more tractable form, the analytical extensibility of the solutions and the weak unique continuation principle are proved, which results in the uniqueness of the inverse space-dependent source problem from local internal observation. Then, based on the variational identity connecting the inversion input data with the unknown source function, we propose a weak norm and prove the conditional stability for the inverse problem in this norm. The iterative thresholding algorithm and Nesterov iteration scheme are employed to numerically reconstruct the smooth and non-smooth sources, respectively. Numerical experiments are performed to investigate their effectiveness.

math.NA↗

arXiv2025

A Survey of RWKV

The Receptance Weighted Key Value (RWKV) model offers a novel alternative to the Transformer architecture, merging the benefits of recurrent and attention-based systems. Unlike conventional Transformers, which depend heavily on self-attention, RWKV adeptly captures long-range dependencies with minimal computational demands. By utilizing a recurrent framework, RWKV addresses some computational inefficiencies found in Transformers, particularly in tasks with long sequences. RWKV has recently drawn considerable attention for its robust performance across multiple domains. Despite its growing popularity, no systematic review of the RWKV model exists. This paper seeks to fill this gap as the first comprehensive review of the RWKV architecture, its core principles, and its varied applications, such as natural language generation, natural language understanding, and computer vision. We assess how RWKV compares to traditional Transformer models, highlighting its capability to manage long sequences efficiently and lower computational costs. Furthermore, we explore the challenges RWKV encounters and propose potential directions for future research and advancement. We consistently maintain the related open-source materials at: https://github.com/MLGroupJLU/RWKV-Survey.

cs.CL↗

arXiv2024

Searching for Neutrinoless Double-Beta Decay of $^{136}$Xe with PandaX-4T

We report the search for neutrinoless double-beta decay of $^{136}$Xe from the PandaX-4T experiment with a 3.7-tonne natural xenon target. The data reconstruction and the background modeling are optimized in the MeV energy region. A blind analysis is performed with data from the commissioning run and the first science run. No significant excess of signal over the background is observed. A lower limit on the half-life of $^{136}$Xe neutrinoless double-beta decay is established to be $2.1 \times 10^{24}$~yr at the 90\% confidence level, with a $^{136}$Xe exposure of 44.6~kg$\cdot$year. Our result represents the most stringent constraint from a natural xenon detector to date.

nucl-ex↗

arXiv2024

Robust detection of hot intragroup medium in optically selected, poor galaxy groups by eROSITA

Over the last several decades, extensive research has been conducted on the baryon cycles within cosmic structures, encompassing a broad mass range from dwarf galaxies to galaxy clusters. However, a notable gap in understanding the cosmic baryon cycle is the poor galaxy groups with halo masses around $10^{13}\ M_{\odot}$ (e.g., McGaugh et al. 2010). Poor galaxy groups, like our own Local Group, are prevalent throughout the universe, yet robust detection of their hot, X-ray emitting intragroup medium (IGrM) has remained elusive. The presence of this hot IGrM is crucial for addressing the long-standing "missing baryons" problem. Previous ROSAT-based studies were limited by a small number of X-ray bright samples, thus restricting the scope of their findings. Here we show a robust detection of this hot IGrM in a large, optically selected poor groups sample, based on the stacked X-ray images from the eROSITA Final Equatorial Depth Survey. These groups are identified in DESI LS with a mass range of log($M_\mathrm{halo}/h^{-1}M_{\odot}$) = 11.5-13.5 and a redshift range of z = 0.1-0.5. Additionally, our results indicate that despite its presence in virtually groups at all sizes, this gas component is still not sufficient to recover the universal baryon fraction, and hence the "missing baryons" problem still persists in poor galaxy groups.

astro-ph.GA↗

arXiv2024

AgentMixer: Multi-Agent Correlated Policy Factorization

In multi-agent reinforcement learning, centralized training with decentralized execution (CTDE) methods typically assume that agents make decisions based on their local observations independently, which may not lead to a correlated joint policy with coordination. Coordination can be explicitly encouraged during training and individual policies can be trained to imitate the correlated joint policy. However, this may lead to an \textit{asymmetric learning failure} due to the observation mismatch between the joint and individual policies. Inspired by the concept of correlated equilibrium, we introduce a \textit{strategy modification} called AgentMixer that allows agents to correlate their policies. AgentMixer combines individual partially observable policies into a joint fully observable policy non-linearly. To enable decentralized execution, we introduce \textit{Individual-Global-Consistency} to guarantee mode consistency during joint training of the centralized and decentralized policies and prove that AgentMixer converges to an $ε$-approximate Correlated Equilibrium. In the Multi-Agent MuJoCo, SMAC-v2, Matrix Game, and Predator-Prey benchmarks, AgentMixer outperforms or matches state-of-the-art methods.

cs.MA↗

arXiv2024

The Seeds of the FUTURE Sprout from History: Fuzzing for Unveiling Vulnerabilities in Prospective Deep-Learning Libraries

The widespread application of large language models (LLMs) underscores the importance of deep learning (DL) technologies that rely on foundational DL libraries such as PyTorch and TensorFlow. Despite their robust features, these libraries face challenges with scalability and adaptation to rapid advancements in the LLM community. In response, tech giants like Apple and Huawei are developing their own DL libraries to enhance performance, increase scalability, and safeguard intellectual property. Ensuring the security of these libraries is crucial, with fuzzing being a vital solution. However, existing fuzzing frameworks struggle with target flexibility, effectively testing bug-prone API sequences, and leveraging the limited available information in new libraries. To address these limitations, we propose FUTURE, the first universal fuzzing framework tailored for newly introduced and prospective DL libraries. FUTURE leverages historical bug information from existing libraries and fine-tunes LLMs for specialized code generation. This strategy helps identify bugs in new libraries and uses insights from these libraries to enhance security in existing ones, creating a cycle from history to future and back. To evaluate FUTURE's effectiveness, we conduct comprehensive evaluations on three newly introduced DL libraries. Evaluation results demonstrate that FUTURE significantly outperforms existing fuzzers in bug detection, success rate of bug reproduction, validity rate of code generation, and API coverage. Notably, FUTURE has detected 148 bugs across 452 targeted APIs, including 142 previously unknown bugs. Among these, 10 have been assigned CVE IDs. Additionally, FUTURE detects 7 bugs in PyTorch, demonstrating its ability to enhance security in existing libraries in reverse.

cs.SE↗

arXiv2024

Broadcast Graph Is NP-complete

The broadcast model is widely used to describe the process of information dissemination from a single node to all nodes within an interconnected network. In this model, a graph represents the network, where vertices correspond to nodes and edges to communication links. The efficiency of this broadcasting process is evaluated by the broadcast time, the minimum discrete time units required to broadcast from a given vertex. Determining the broadcast time is referred to as the problem Broadcast Time. The set of vertices with the minimum broadcast time among the graph is called the broadcast center. Identifying this center or determining its size are both proven to be NP-hard. For a graph with n vertices, the minimum broadcast time is at least ceil(log2 n). The Broadcast Graph problem asks in a graph of n vertices, whether the broadcast time from any vertex equals ceil(log2 n). Extensive research over the past 50 years has focused on constructing broadcast graphs, which are optimal network topologies for one-to-all communication efficiency. However, the computational complexity of the Broadcast Graph problem has rarely been the subject of study. We believe that the difficulty lies in the mapping reduction for an NP-completeness proof. Consequently, we must construct broadcast graphs for yes-instances and non-broadcast graphs for no-instances. The most closely related result is the NP-completeness of Broadcast Time proved by Slater et al. in 1981. More recently, Fomin et al. has proved that Broadcast Time is fixed-parameter tractable. In this paper, we prove that Broadcast Graph is NP-complete by proving a reduction from Broadcast Time. We also improve the results on the complexity of the broadcast center problem. We show Broadcast Center Size is in delta^2_p, and is DP-hard, implying a complexity upper bound of delta^2_p-complete and a lower bound of DP-hard.

cs.DM↗

arXiv2024

Understanding Warmup-Stable-Decay Learning Rates: A River Valley Loss Landscape Perspective

Training language models currently requires pre-determining a fixed compute budget because the typical cosine learning rate schedule depends on the total number of steps. In contrast, the Warmup-Stable-Decay (WSD) schedule uses a constant learning rate to produce a main branch of iterates that can in principle continue indefinitely without a pre-specified compute budget. Then, given any compute budget, one can branch out from the main branch at a proper time with a rapidly decaying learning rate to produce a strong model. Empirically, WSD generates a non-traditional loss curve: the loss remains elevated during the stable phase but sharply declines during the decay phase. Towards explaining this phenomenon, we conjecture that pretraining loss exhibits a river valley landscape, which resembles a deep valley with a river at its bottom. Under this assumption, we show that during the stable phase, the iterate undergoes large oscillations due to the high learning rate, yet it progresses swiftly along the river. During the decay phase, the rapidly dropping learning rate minimizes the iterate's oscillations, moving it closer to the river and revealing true optimization progress. Therefore, the sustained high learning rate phase and fast decaying phase are responsible for progress in the river and the mountain directions respectively, and are both critical. Our analysis predicts phenomenons consistent with empirical observations and shows that this landscape can emerge from pretraining on a simple bi-gram dataset. Inspired by the theory, we introduce WSD-S, a variant of WSD that reuses previous checkpoints' decay phases and keeps only one main branch, where we resume from a decayed checkpoint. WSD-S empirically outperforms WSD and Cyclic-Cosine in obtaining multiple language model checkpoints across various compute budgets in a single run for parameters scaling from 0.1B to 1.2B.

cs.LG↗

arXiv2024

Bloch's conjecture for (anti-)autoequivalences on K3 surfaces

In this paper, we investigate Bloch's conjecture for autoequivalence on K3 surfaces. We introduce the notion of reflective autoequivalence of twisted K3 surfaces and prove Bloch's conjecture for such autoequivalences, thereby confirming the conjecture for all (anti-)symplectic autoequivalences of K3 surfaces with Picard number at least $3$. The main idea is that we find a Cartan-Dieudonné type decomposition of (anti)-symplectic autoequivalences. Our findings have several interesting consequences. Firstly, we verify Bloch's conjecture for (anti-)symplectic birational automorphisms of Bridgeland moduli space on a K3 surface with Picard number at least $3$. This notably implies that Bloch's conjecture holds for (anti)-symplectic birational automorphisms of finite order ($\neq 2,4$) on arbitrary hyper-Kähler varieties of $K3^{[n]}$-type. Secondly, we extend Huybrechts' work in \cite{Huy12} to twisted K3 surfaces. This extension enables us to affirm Bloch's conjecture for symplectic birational automorphisms on any hyper-Kähler variety of $K3^{[n]}$-type preserving a birational Lagrangian fibration. Finally, we prove the constant cycle property for the fixed loci of anti-symplectic involutions on hyper-Kähler varieties of $K3^{[n]}$-type, provided that $n \leq 2$ or the invariant sublattice has rank greater than $1$.

math.AG↗

arXiv2024

Simultaneous uniqueness for a coefficient inverse problem in one-dimensional fractional diffusion equation from an interior point measurement

This article is concerned with an inverse problem of simultaneously determining a spatially varying coefficient and a Robin coefficient for a one-dimensional fractional diffusion equation with a time-fractional derivative of order $α\in(0,1)$. We prove the uniqueness for the inverse problem by observation data at one interior point over a finite time interval, provided that a coefficient is known on a subinterval. Our proof is based on the uniqueness in the inverse spectracl problem for a Sturm-Liouville problem by means of the Weyl $m$-function and the spectral representation of the solution to an initial-boundary value problem for the fractional diffusion equation.

math.AP↗

arXiv2024

Simplicity Bias via Global Convergence of Sharpness Minimization

The remarkable generalization ability of neural networks is usually attributed to the implicit bias of SGD, which often yields models with lower complexity using simpler (e.g. linear) and low-rank features. Recent works have provided empirical and theoretical evidence for the bias of particular variants of SGD (such as label noise SGD) toward flatter regions of the loss landscape. Despite the folklore intuition that flat solutions are 'simple', the connection with the simplicity of the final trained model (e.g. low-rank) is not well understood. In this work, we take a step toward bridging this gap by studying the simplicity structure that arises from minimizers of the sharpness for a class of two-layer neural networks. We show that, for any high dimensional training data and certain activations, with small enough step size, label noise SGD always converges to a network that replicates a single linear feature across all neurons; thereby, implying a simple rank one feature matrix. To obtain this result, our main technical contribution is to show that label noise SGD always minimizes the sharpness on the manifold of models with zero loss for two-layer networks. Along the way, we discover a novel property -- a local geodesic convexity -- of the trace of Hessian of the loss at approximate stationary points on the manifold of zero loss, which links sharpness to the geometry of the manifold. This tool may be of independent interest.

cs.LG↗