arXiv subjects

Qingyang Li

Publications and source records attributed to Qingyang Li.

At least 19 recordsLinked to original sources

arXiv2026

ELUCID-DESI II. Revealing dark matter mass, tidal, and velocity (MTV) fields using galaxy group phase information

We introduce a novel method for reconstructing the cosmic mass, tidal, and velocity (MTV) fields over the redshift range $0 < z < 0.6$ using the phase information of galaxy groups. This approach replaces the explicit theoretical bias correction typically needed to relate galaxy groups to the underlying dark matter density field with a simulation-calibrated statistical mapping, reducing a major source of systematic uncertainty and making the method directly applicable to spectroscopic redshift surveys such as the DESI Bright Galaxy Survey (BGS). We evaluate the performance of our MTV reconstruction pipeline with mock redshift surveys that include a comprehensive set of observational selection effects. The galaxy groups used as tracers are identified with an extended halo-based group finder applied to the DESI mock galaxy catalogue with an apparent magnitude limit of $m_z < 19.65$, yielding a galaxy number comparable to that of the DESI BGS faint sample ($m_r < 20.175$). Our tests show that the reconstructed velocities are accurate and unbiased, with a residual dispersion of $\sim 120\ \mathrm{km\,s^{-1}}$ across the redshift bins. The recovered velocity field allows us to shift galaxy groups to their real-space positions, thereby correcting for the Kaiser effect. By iteratively applying this Kaiser correction to the galaxy groups, we further reconstruct the tidal field and the mass-density distribution. The reconstruction is stable with respect to the grid resolution. Overall, our results demonstrate that this group-based phase-space reconstruction provides a robust pathway to recovering the dark matter MTV fields, with strong prospects for application to DESI BGS data.

astro-ph.CO↗

arXiv2026

Restoring Collaborative Signals in Semantic-ID Generative Recommendation via Personalized Natural Language

Making LLM-based generative recommendation models stronger and more personalized through natural language and explicit reasoning is a widely anticipated yet still unsolved goal. Such models cast recommendation as autoregressively generating an item's semantic-ID (SID), a short tuple of discrete codes, so that recommending well reduces to emitting the right SID. In this setting the model verbalizes its knowledge poorly, and text and SID tokens live in misaligned embedding spaces. Deep reasoning therefore rarely turns into a correct SID, and enabling explicit "thinking" often gives no gain or even hurts. The deeper cause is that a compact SID cannot hold content and collaborative signal at once: the two compete, and collaboration loses. Because a mis-predicted SID is a wrong recommendation, this caps accuracy directly. Costly multi-round training barely helps, and few methods try to supply the missing signal at inference time. What is missing is a reliable channel that carries collaborative signal into SID generation. We therefore propose a framework, guided by personalized natural language, that adds hierarchical collaborative cues as the model generates, without altering the backbone or retraining the SIDs. Rather than mapping language onto SIDs directly, it uses language to attach analyzable links between collaborative patterns and their audiences, restoring the collaborative signal that SIDs miss. The result is consistent gains in recommendation accuracy, grounding generation in collaborative structure at inference time rather than relying on explicit reasoning or retraining.

cs.IR↗

arXiv2026

OxygenREC-v2: Internalizing Discrimination into Generative Recommendation

Generative recommendation unifies retrieval and ranking within a single model by autoregressively decoding semantic identifier (SID) sequences. Yet reliably incorporating behavior signals from clicks, cart additions, and orders remains challenging. Existing approaches either jointly optimize generative and discriminative objectives, requiring delicate trade-offs, or use a separate ranker as a post-hoc reinforcement-learning reward, risking out-of-distribution scoring and reward misalignment. We propose OxygenREC-v2, a generative recommender that Internalizes Discrimination into Generative Recommendation (IDGR). Rather than adding a separate discriminative objective, OxygenREC-v2 uses logged behavior to condition generation and supervise training. During pre-training, a behavior instruction conditions generation on the target behavior. During post-training, future interaction behaviors are exploited as privileged knowledge in our entropy-aware trajectory optimization self-distillation framework, enabling reward-model-free policy optimization. Throughout both training stages, OxygenREC-v2 maintains a single unified backbone. We implement OxygenREC-v2 as a 3B-parameter, 1B-activated MoE and deploy it on JD.com's large-scale e-commerce platform. Across multiple online A/B tests, OxygenREC-v2 improves user click-through conversion rate (UCTCVR) by 1.6--4.4% and GMV by 2.8--6.8% over OxygenREC-v1.

cs.IR↗

arXiv2026

CSST large-scale structure analysis pipeline: IV. Cosmic Voids Identified from Galaxy Group Samples as Probes of the Large-scale Structure

Because groups are directly associated with halos, they allow for considerably simpler theoretical modeling than approaches based on individual galaxies. We therefore propose to use voids identified in galaxy group catalogs, referred to as group-voids, to investigate the cosmic large-scale structure (LSS). Using the reference mock galaxy redshift survey (MGRS) designed for the Chinese Space-station Survey Telescope (CSST), we build two galaxy group catalogs representing ideal and realistic scenarios, derived from galaxy samples with 100\% and roughly 30\% spectroscopic redshift completeness, respectively. We then identify voids in these two mock group catalogs, as well as in the underlying halo catalog, and measure two void statistics, the void size function (VSF) and the void density profile, within five redshift intervals spanning $z=0$ to $1.0$. We compare the statistics obtained from two kinds of voids: those defined by galaxy groups (group-voids) and those defined by dark matter halos (halo-voids). In the void-finding process, we adopt the brightest central galaxy (BCG) as the group center to improve the accuracy of the inferred void centers. Our analysis shows that void statistics derived from group-voids with spectroscopic redshift completeness of at least 40\% can faithfully reproduce the corresponding statistics from halo-voids. Even when the redshift completeness of galaxies falls to as low as 30\%, we can still reliably describe group-voids via halo-voids by incorporating a redshift error term. This indicates that group-voids are a promising tool for probing LSS and offer a valuable complement to standard void studies, which is especially advantageous for emulator-based methods.

astro-ph.CO↗

arXiv2026

QoS Assurance Mechanism for 5G Network Slicing Based on the Deep Reinforcement Learning PPO Algorithm

With the increasing diversity of 5G service types and the intensifying dynamic fluctuations of network load, achieve differentiated quality of service assurance in a network slicing environment has become a key issue in resource management. To address this problem, this paper proposes a deep reinforcement learning mechanism for 5G network slicing quality of service assurance based on the traditional proximal policy optimization actor-critic framework. First, the slicing resource allocation is modeled as a constrained Markov decision process, jointly considering the collaborative optimization of bandwidth, computing, and wireless resources. Meanwhile, a graph attention network and bidirectional long short-term memory are introduced to extract topological correlations and temporal service features, combined with an adaptive Lagrangian penalty and dynamic reward shaping mechanism, to comprehensively optimize delay, throughput, reliability, fairness, and slice isolation performance. Experimental results show that the proposed method outperforms existing baseline models in terms of quality of service satisfaction rate, delay control, resource utilization, and convergence stability.

cs.NI↗

arXiv2026

Dynamic Adaptive Attention and Supervised Contrastive Learning: A Novel Hybrid Framework for Text Sentiment Classification

The exponential growth of user-generated movie reviews on digital platforms has made accurate text sentiment classification a cornerstone task in natural language processing. Traditional models, including standard BERT and recurrent architectures, frequently struggle to capture long-distance semantic dependencies and resolve ambiguous emotional expressions in lengthy review texts. This paper proposes a novel hybrid framework that seamlessly integrates dynamic adaptive multi-head attention with supervised contrastive learning into a BERT-based Transformer encoder. The dynamic adaptive attention module employs a global context pooling vector to dynamically regulate the contribution of each attention head, thereby focusing on critical sentiment-bearing tokens while suppressing noise. Simultaneously, the supervised contrastive learning branch enforces tighter intra-class compactness and larger inter-class separation in the embedding space. Extensive experiments on the IMDB dataset demonstrate that the proposed model achieves competitive performance with an accuracy of 94.67\%, outperforming strong baselines by 1.5--2.5 percentage points. The framework is lightweight, efficient, and readily extensible to other text classification tasks.

cs.CL↗

arXiv2026

Galaxy populations in groups and clusters-II. Conditional luminosity functions at redshifts from z~1 to z~0

Using DESI SV3 spectroscopic group centrals and HSC photometric data, we measure conditional luminosity functions (CLFs) of central and satellite galaxies for red and blue populations in dark matter haloes spanning $M_h\sim10^{12}- 10^{15}M_{\odot}$ and $0<z<1$. HSC depth permits measurements to $M_r \approx -15$ at $0.2 \leqslant z < 0.5$ and $M_r \approx -17$ at $0.5 \leqslant z < 1.0$. We find satellite CLFs evolve weakly over $0<z<1$. Blue satellite CLFs are well described by a single Schechter function across halo masses and redshifts, with a nearly constant slope of $-1.25\lesssim \alpha\lesssim -1.2$. In contrast, red satellite CLFs exhibit a pronounced faint-end upturn in all halo mass and redshift bins, with little evolution in the faint-end slope ($-1.8\lesssim \alpha_f\lesssim -1.7$). The low-mass red sequence was therefore already established in clusters/groups by $z\sim1$. The lack of faint-end-slope evolution favors models where the steep upturn originates from early formation processes at $z\gtrsim2$, rather than environmental quenching after infall. Satellite characteristic magnitudes and central galaxy luminosities fade with time. Red central galaxies are consistent with passive evolution, whereas blue-central luminosity evolution is dominated by ongoing star formation. Satellites evolve more rapidly than predicted by simple stellar population models, highlighting environmental effects. Satellite quenched fractions as a function of stellar mass exhibit a minimum at $M_{*} \sim 10^9M_{\odot}$ that is consistent across halo masses and redshifts. We discuss possible interpretations of these results and their implications for galaxy formation and evolution.

astro-ph.GA↗

arXiv2026

MalMoE: Mixture-of-Experts Enhanced Encrypted Malicious Traffic Detection Under Graph Drift

Encryption has been commonly used in network traffic to secure transmission, but it also brings challenges for malicious traffic detection, due to the invisibility of the packet payload. Graph-based methods are emerging as promising solutions by leveraging multi-host interactions to promote detection accuracy. But most of them face a critical problem: Graph Drift, where the flow statistics or topological information of a graph change over time. To overcome these drawbacks, we propose a graph-assisted encrypted traffic detection system, MalMoE, which applies Mixture of Experts (MoE) to select the best expert model for drift-aware classification. Particularly, we design 1-hop-GNN-like expert models that handle different graph drifts by analyzing graphs with different features. Then, the redesigned gate model conducts expert selection according to the actual drift. MalMoE is trained with a stable two-stage training strategy with data augmentation, which effectively guides the gate on how to perform routing. Experiments on open-source, synthetic, and real-world datasets show that MalMoE can perform precise and real-time detection.

cs.CR↗

arXiv2026

ELUCID-DESI I: A Parallel MPI Implementation of the Initial Condition Solver for Large-Scale Reconstruction Simulations

We present a highly scalable, MPI-parallelized framework for reconstructing the initial cosmic density field, designed to meet the computational demands of next-generation cosmological simulations, particularly the upcoming ELUCID-DESI simulation based on DESI BGS data. Building upon the Hamiltonian Monte Carlo approach and the FastPM solver, our code employs domain decomposition to efficiently distribute memory between nodes. Although communication overhead increases the per-step runtime of the MPI version by roughly a factor of eight relative to the shared-memory implementation, our scaling tests-spanning different particle numbers, core counts, and node layouts-show nearly linear scaling with respect to both the number of particles and the number of CPU cores. Furthermore, to significantly reduce computational costs during the initial burn-in phase, we introduce a novel ``guess'' module that rapidly generates a high-quality initial density field. The results of the simulation test confirm substantial efficiency gains: for $256^3$ particles, 53 steps ($\sim$ 54 core hours) are saved, accelerating convergence by a factor of $\sim$ 18; for $1024^3$, 106 steps ($\sim$7500 core hours), achieving a speedup factor of $\sim$ 3. The total core hour gain grows with the number of particles, rendering large-volume reconstructions computationally practical for upcoming surveys, including our planned ELUCID-DESI reconstruction simulation with $4096^3$ particles. We estimate that achieving convergence for this scale (targeting DESI-BGS data) requires about 800 HMCMC steps ($\sim$ 5 million core hours). Our initial guess module will save approximately 360 steps ($\sim$2.3 million core hours), reducing the total computational time by about 45\%.

astro-ph.GA↗

arXiv2025

Isolating Compiler Faults via Multiple Pairs of Adversarial Compilation Configurations

Compilers are fundamental to modern software development, making the effective identification and resolution of compiler faults essential. However, localizing these faults to specific source files remains highly challenging due to the complexity and scale of modern compiler infrastructures. In this study, we propose MultiConf, a novel approach that automatically isolates compiler faults by constructing multiple pairs of adversarial compilation configurations. Each adversarial compilation configuration pair consists of a failing configuration and its corresponding passing configuration, which differ in only a small number of fine-grained options. MultiConf generates failing configurations through a lightweight construction process and derives the corresponding passing configurations by selectively disabling bug-related fine-grained options. We then employ a Spectrum-Based Fault Localization (SBFL) formula to rank the suspiciousness of compiler source files. Each adversarial configuration pair independently produces a ranking, which is subsequently aggregated using a weighted voting scheme to derive a final suspiciousness ranking, enabling more accurate and robust fault localization. We evaluate MultiConf on a benchmark of 60 real-world GCC compiler bugs. The results demonstrate that MultiConf significantly outperforms existing compiler fault localization techniques in both effectiveness and efficiency. In particular, MultiConf successfully localizes 27 out of 60 bugs at the Top-1 file level, representing improvements of 35.0% and 28.6% over the two state-of-the-art approaches, Odfl(20) and Basic(21), respectively.

cs.SE↗

arXiv2025

Using a Sledgehammer to Crack a Nut? Revisiting Automated Compiler Fault Isolation

Background: Compilers are fundamental to software development, translating high-level source code into executable software systems. Faults in compilers can have severe consequences and thus effective localization and resolution of compiler bugs are crucial. Problem: In practice, developers often examine version history to identify and investigate bug-inducing commit (BIC) for fixing bugs. However, while numerous sophisticated Spectrum-Based Fault Localization (SBFL) techniques have been proposed for compiler fault isolation, their effectiveness has not been evaluated against the BIC-based strategies widely adopted in practice. Objective: This study aims to bridge this gap by directly comparing a BIC-based strategy, Basic, with representative SBFL techniques in the context of compiler fault localization. The BIC-based strategy closely aligns with common developer practices, as it directly identifies the BIC and treats the files modified in that commit as faulty candidates. Method: The Basic identifies the most recent good release and earliest bad release, and then employs a binary search to pinpoint the bug-inducing commit. All files modified in the identified commit are flagged as potentially faulty. We rigorously compare Basic against SBFL-based techniques using a benchmark consisting of 60 GCC bugs and 60 LLVM bugs. Result: Our analysis reveals that Basic performs comparably to, and in many cases outperforms, state-of-the-art SBFL-based techniques, particularly on the critical Top-1 and Top-5 ranking metrics. Conclusion: This study provides new insights into the practical effectiveness of SBFL-based techniques in real-world compiler debugging scenarios. We recommend that future research adopt Basic as a baseline when developing and evaluating new compiler fault isolation methods.

cs.SE↗

arXiv2025

DeepSeek-V3.2: Pushing the Frontier of Open Large Language Models

We introduce DeepSeek-V3.2, a model that harmonizes high computational efficiency with superior reasoning and agent performance. The key technical breakthroughs of DeepSeek-V3.2 are as follows: (1) DeepSeek Sparse Attention (DSA): We introduce DSA, an efficient attention mechanism that substantially reduces computational complexity while preserving model performance in long-context scenarios. (2) Scalable Reinforcement Learning Framework: By implementing a robust reinforcement learning protocol and scaling post-training compute, DeepSeek-V3.2 performs comparably to GPT-5. Notably, our high-compute variant, DeepSeek-V3.2-Speciale, surpasses GPT-5 and exhibits reasoning proficiency on par with Gemini-3.0-Pro, achieving gold-medal performance in both the 2025 International Mathematical Olympiad (IMO) and the International Olympiad in Informatics (IOI). (3) Large-Scale Agentic Task Synthesis Pipeline: To integrate reasoning into tool-use scenarios, we developed a novel synthesis pipeline that systematically generates training data at scale. This methodology facilitates scalable agentic post-training, yielding substantial improvements in generalization and instruction-following robustness within complex, interactive environments.

cs.CL↗

arXiv2025

Unveiling the Sources of X-ray Luminosity in DESI Galaxy Groups: Insights from the SRG/eROSITA All-Sky Survey

We use the first eROSITA all-sky survey (eRASS1) to investigate the contributions of AGN and extended gas to the total X-ray luminosity ($L_X$) of galaxy groups with different halo masses ($M_h$) at different redshifts. The presence of AGN in their central galaxies is identified using multi-wavelength catalogs, including the X-ray counterparts, the ASKAP radio catalog, and the DESI spectroscopic measurements. We apply the stacking method to obtain sufficient statistics for the X-ray surface brightness profile and the $L_X$ for groups with different central AGN properties. We find that the X-ray groups exhibit the highest $L_X$, followed by groups with QSO, radio, BPT-AGN, and non-AGN centrals. Moreover, the $L_X$ of the $M_h \lesssim 10^{13}h^{-1}M_\odot$ groups is dominated by the central AGN, while the X-ray emission from extended gas tends to be more prominent in the $M_h \gtrsim 10^{13}h^{-1}M_\odot$ groups. In groups where the AGN play a major role in X-ray emission, the contribution from extended gas is minor, resulting in significant uncertainties concerning the extended X-ray emission. When the subset containing the X-ray detected counterparts is excluded, the extended gas component becomes easier to obtain. A correlation has been identified between the X-ray luminosity of the central AGN and extended gas. However, once we account for the positional offset, their correlation becomes less prominent. Currently, the results are not conclusive enough to confirm whether there is a connection between the AGN feedback and extended gas. However, they provide a new perspective on the feedback processes in the history of group assembly.

astro-ph.GA↗

arXiv2025

A semi-analytical mock galaxy catalog for the CSST extragalactic surveys from the Jiutian simulations

We introduce a mock galaxy catalog built for the CSST extragalactic surveys using the primary runs of the Jiutian $N$-body simulation suites. The catalogs are built by coupling the GAlaxy Evolution and Assembly (GAEA) semi-analytical model of galaxy formation with merger trees extracted from the simulations using the Hierarchical Bound-Tracing (HBT+) algorithm. The spectral energy distributions (SEDs) and broadband magnitudes are computed using the neural-network-based stellar population synthesizer StarDuster, which is trained on radiative transfer simulations to account for detailed galaxy geometry in modeling dust obscuration. Galaxy light-cones up to $z=5$ are subsequently generated with the BLiC light-cone builder which interpolates the properties of galaxies over time using an optimized interpolation scheme. The resulting catalogs exhibit good convergence in many statistical properties of the galaxy population produced from two different resolution simulations. The catalogs reproduce a number of observed galaxy properties across a range of galaxy mass and redshift, including the stellar mass functions, the luminosity function, gas mass fraction, galaxy size-mass relation and galaxy clustering. We also present the photometric and redshift distributions of galaxies expected to be observed in the CSST surveys.

astro-ph.GA↗

arXiv2025

An LLM-powered MILP modelling engine for workforce scheduling guided by expert knowledge

Formulating mathematical models from real-world decision problems is a core task in Operational Research, yet it typically requires considerable human expertise and effort, limiting practical application. Recent advances in large language models (LLMs) have sparked interest in automating this process from natural language descriptions. However, challenges including limited modelling expertise, dependence on large-scale training data, and hallucination affect the reliable application of LLMs in optimisation modelling. To address these challenges, we propose SMILO, an expert-knowledge-driven framework that integrates optimisation modelling expertise with LLMs to generate mixed-integer linear programming models. SMILO uses a three-stage architecture built on reusable modelling graphs and associated resources: identifying relevant modelling components, extracting instance-specific information using LLMs, and constructing models through expert-defined templates. This modular architecture separates information extraction from formula generation, enhancing modelling accuracy, transparency, and reproducibility. We demonstrate the implementation of our modelling framework using workforce scheduling problems spanning manufacturing, logistic, and service operations as illustrative cases. Experiments show that SMILO consistently generates correct models in 90% of test instances across five trials, outperforming one-step LLM baselines by at least 35%. This work offers a generalisable paradigm for integrating LLMs with expert knowledge across diverse decision-making contexts, advancing automation in optimisation modelling.

math.OC↗

arXiv2025

Facet: highly efficient E(3)-equivariant networks for interatomic potentials

Computational materials discovery is limited by the high cost of first-principles calculations. Machine learning (ML) potentials that predict energies from crystal structures are promising, but existing methods face computational bottlenecks. Steerable graph neural networks (GNNs) encode geometry with spherical harmonics, respecting atomic symmetries -- permutation, rotation, and translation -- for physically realistic predictions. Yet maintaining equivariance is difficult: activation functions must be modified, and each layer must handle multiple data types for different harmonic orders. We present Facet, a GNN architecture for efficient ML potentials, developed through systematic analysis of steerable GNNs. Our innovations include replacing expensive multi-layer perceptrons (MLPs) for interatomic distances with splines, which match performance while cutting computational and memory demands. We also introduce a general-purpose equivariant layer that mixes node information via spherical grid projection followed by standard MLPs -- faster than tensor products and more expressive than linear or gate layers. On the MPTrj dataset, Facet matches leading models with far fewer parameters and under 10% of their training compute. On a crystal relaxation task, it runs twice as fast as MACE models. We further show SevenNet-0's parameters can be reduced by over 25% with no accuracy loss. These techniques enable more than 10x faster training of large-scale foundation models for ML potentials, potentially reshaping computational materials discovery.

cond-mat.mtrl-sci↗

arXiv2025

Evolution of the Physical Properties of the Most Massive Galaxies in Clusters and their Protohalos

We investigated the evolution of the physical properties of the brightest galaxies in clusters and their protohalos from $z = 4$ to $z = 0$. Galaxy clusters and groups are identified using a halo-based group finder applied to the COSMOS2020 galaxy catalog. We construct evolution chains from low redshift clusters to higher redshift groups via the abundance matching method. The region of protohalos corresponding to clusters is defined on the basis of a characteristic radius. Our analysis encompasses a wide range of physical properties, including stellar mass, luminosity, star formation rate (SFR), specific star formation rate (sSFR), color ($g - r$), and stellar age. The evolution trends of the most massive galaxies (MMGs) in higher redshift groups and their corresponding protohalos are generally consistent. The stellar mass of MMGs shows an increasing trend across the entire redshift range. By considering the stellar mass growth as in-situ and ex-situ components, we find that in-situ star formation is efficient at $z \sim 2$, while ex-situ accretion becomes the primary growth channel at later times. At $z \gtrsim 2$, MMGs undergo an intense star formation phase of approximately $10^{2}\ \rm M_{\odot}yr^{-1}$, but are generally quenched at lower redshifts. Stellar age analysis suggests that most stars in MMGs formed at $z > 2$. Our results present a coherent picture of MMG evolution across cosmic epochs, which is broadly consistent with the current theoretical framework of galaxy formation and evolution. Moreover, our work provides an intriguing way to trace galaxy evolution through the construction of cluster evolutionary chains in observations.

astro-ph.GA↗

arXiv2025

Rethinking Selectivity in State Space Models: A Minimal Predictive Sufficiency Approach

State Space Models (SSMs), particularly recent selective variants like Mamba, have emerged as a leading architecture for sequence modeling, challenging the dominance of Transformers. However, the success of these state-of-the-art models largely relies on heuristically designed selective mechanisms, which lack a rigorous first-principle derivation. This theoretical gap raises questions about their optimality and robustness against spurious correlations. To address this, we introduce the Principle of Predictive Sufficiency, a novel information-theoretic criterion stipulating that an ideal hidden state should be a minimal sufficient statistic of the past for predicting the future. Based on this principle, we propose the Minimal Predictive Sufficiency State Space Model (MPS-SSM), a new framework where the selective mechanism is guided by optimizing an objective function derived from our principle. This approach encourages the model to maximally compress historical information without losing predictive power, thereby learning to ignore non-causal noise and spurious patterns. Extensive experiments on a wide range of benchmark datasets demonstrate that MPS-SSM not only achieves state-of-the-art performance, significantly outperforming existing models in long-term forecasting and noisy scenarios, but also exhibits superior robustness. Furthermore, we show that the MPS principle can be extended as a general regularization framework to enhance other popular architectures, highlighting its broad potential.

cs.LG↗