arXiv subjects

Peng Jiang

Publications and source records attributed to Peng Jiang.

At least 127 records · Page 7Linked to original sources

arXiv2025

The FAST Globular Cluster Pulsar Survey (GC FANS)

By January 2025, 60 pulsars were discovered by the Five-hundred-meter Aperture Spherical radio Telescope globular cluster (GC) pulsar survey (GC FANS), with spin periods spanning 1.98 ms to 3960.72 ms. Of these, 55 are millisecond pulsars (MSPs; $P<30$ ms), while 34 are binaries with orbital periods spanning 0.12 days to 466.47 days. This paper describes GC FANS, a deep, thorough search for pulsars in 41 GCs in the FAST sky ($-14^\circ < δ< 65^\circ$) and describes new discoveries in 14 of them. We present updated timing solutions for M92A, NGC 6712A, M71A, and M71E, all of which are ``spider'' pulsars with short orbital periods. We present new timing solutions for M71B, C, and D. With orbital periods of $\sim$466 and 378 days, M71B and M71C are the widest known GC binaries; these systems resemble the normal wide MSP-He WD systems in the Galactic disk. With a spin period of 101 ms, M71D is in an eccentric ($e\sim$0.63) orbit with an 11-day period and a massive companion; the system has a total mass of $2.63 \pm 0.08 \, M_{\odot}$. These features and its large characteristic age suggest it is a double neutron star system (DNS) formed via massive binary evolution early in the cluster's history, akin to Galactic disk DNSs--unlike other candidate GC DNSs, which typically form dynamically. A comparative analysis of GC pulsar populations within FAST's sky reveals that most clusters (10 of 14) resemble the Galactic disk MSP population, likely due to lower stellar densities.

astro-ph.HE↗

arXiv2025

The Chinese Pulsar Timing Array data release I. Single pulsar noise analysis

The Chinese Pulsar Timing Array (CPTA) has collected observations from 57 millisecond pulsars using the Five-hundred-meter Aperture Spherical Radio Telescope (FAST) for close to three years, for the purpose of searching for gravitational waves (GWs). To robustly search for ultra-low-frequency GWs, pulsar timing arrays (PTAs) need to use models to describe the noise from the individual pulsars. We report on the results from the single pulsar noise analysis of the CPTA data release I (DR1). Conventionally, power laws in the frequency domain are used to describe pulsar red noise and dispersion measurement (DM) variations over time. Employing Bayesian methods, we found the choice of number and range of frequency bins with the highest evidence for each pulsar individually. A comparison between a dataset using DM piecewise measured (DMX) values and a power-law Gaussian process to describe the DM variations shows strong Bayesian evidence in favour of the power-law model. Furthermore, we demonstrate that the constraints obtained from four independent software packages are very consistent with each other. The short time span of the CPTA DR1, paired with the large sensitivity of FAST, has proved to be a challenge for the conventional noise model using a power law. This mainly shows in the difficulty to separate different noise terms due to their covariances with each other. Nineteen pulsars are found to display covariances between the short-term white noise and long-term red and DM noise. With future CPTA datasets, we expect that the degeneracy can be broken. Finally, we compared the CPTA DR1 results against the noise properties found by other PTA collaborations. While we can see broad agreement, there is some tension between different PTA datasets for some of the overlapping pulsars. This could be due to the differences in the methods and frequency range compared to the other PTAs.

astro-ph.HE↗

arXiv2025

Learning Cascade Ranking as One Network

Cascade Ranking is a prevalent architecture in large-scale top-k selection systems like recommendation and advertising platforms. Traditional training methods focus on single-stage optimization, neglecting interactions between stages. Recent advances have introduced interaction-aware training paradigms, but still struggle to 1) align training objectives with the goal of the entire cascade ranking (i.e., end-to-end recall of ground-truth items) and 2) learn effective collaboration patterns for different stages. To address these challenges, we propose LCRON, which introduces a novel surrogate loss function derived from the lower bound probability that ground truth items are selected by cascade ranking, ensuring alignment with the overall objective of the system. According to the properties of the derived bound, we further design an auxiliary loss for each stage to drive the reduction of this bound, leading to a more robust and effective top-k selection. LCRON enables end-to-end training of the entire cascade ranking system as a unified network. Experimental results demonstrate that LCRON achieves significant improvement over existing methods on public benchmarks and industrial applications, addressing key limitations in cascade ranking training and significantly enhancing system performance.

cs.IR↗

arXiv2025

Learning Monotonic Probabilities with a Generative Cost Model

In many machine learning tasks, it is often necessary for the relationship between input and output variables to be monotonic, including both strictly monotonic and implicitly monotonic relationships. Traditional methods for maintaining monotonicity mainly rely on construction or regularization techniques, whereas this paper shows that the issue of strict monotonic probability can be viewed as a partial order between an observable revenue variable and a latent cost variable. This perspective enables us to reformulate the monotonicity challenge into modeling the latent cost variable. To tackle this, we introduce a generative network for the latent cost variable, termed the Generative Cost Model (GCM), which inherently addresses the strict monotonic problem, and propose the Implicit Generative Cost Model (IGCM) to address the implicit monotonic problem. We further validate our approach with a numerical simulation of quantile regression and conduct multiple experiments on public datasets, showing that our method significantly outperforms existing monotonic modeling techniques. The code for our experiments can be found at https://github.com/tyxaaron/GCM.

cs.LG↗

arXiv2025

GAS: Generative Auto-bidding with Post-training Search

Auto-bidding is essential in facilitating online advertising by automatically placing bids on behalf of advertisers. Generative auto-bidding, which generates bids based on an adjustable condition using models like transformers and diffusers, has recently emerged as a new trend due to its potential to learn optimal strategies directly from data and adjust flexibly to preferences. However, generative models suffer from low-quality data leading to a mismatch between the condition, like return to go, and true action value, especially in long sequential decision-making. Besides, the majority preference in the dataset may hinder models' generalization ability on minority advertisers' preferences. While it is possible to collect high-quality data and retrain multiple models for different preferences, the high cost makes it unaffordable, hindering the advancement of auto-bidding into the era of large foundation models. To address this, we propose a flexible and practical Generative Auto-bidding scheme using post-training Search, termed GAS, to refine a base policy model's output and adapt to various preferences. We use weak-to-strong search alignment by training small critics for different preferences and an MCTS-inspired search to refine the model's output. Specifically, a novel voting mechanism with transformer-based critics trained with policy indications could enhance search alignment performance. Additionally, utilizing the search, we provide a fine-tuning method for high-frequency preference scenarios considering computational efficiency. Extensive experiments conducted on the real-world dataset and online A/B test on the Kuaishou advertising platform demonstrate the effectiveness of GAS, achieving significant improvements, e.g., 4.60% increment of target cost.

cs.AI↗

arXiv2025

Impact of a Deployed LLM Survey Creation Tool through the IS Success Model

Surveys are a cornerstone of Information Systems (IS) research, yet creating high-quality surveys remains labor-intensive, requiring both domain expertise and methodological rigor. With the evolution of large language models (LLMs), new opportunities emerge to automate survey generation. This paper presents the real-world deployment of an LLM-powered system designed to accelerate data collection while maintaining survey quality. Deploying such systems in production introduces real-world complexity, including diverse user needs and quality control. We evaluate the system using the DeLone and McLean IS Success Model to understand how generative AI can reshape a core IS method. This study makes three key contributions. To our knowledge, this is the first application of the IS Success Model to a generative AI system for survey creation. In addition, we propose a hybrid evaluation framework combining automated and human assessments. Finally, we implement safeguards that mitigate post-deployment risks and support responsible integration into IS workflows.

cs.HC↗

arXiv2025

Hierarchical Tree Search-based User Lifelong Behavior Modeling on Large Language Model

Large Language Models (LLMs) have garnered significant attention in Recommendation Systems (RS) due to their extensive world knowledge and robust reasoning capabilities. However, a critical challenge lies in enabling LLMs to effectively comprehend and extract insights from massive user behaviors. Current approaches that directly leverage LLMs for user interest learning face limitations in handling long sequential behaviors, effectively extracting interest, and applying interest in practical scenarios. To address these issues, we propose a Hierarchical Tree Search-based User Lifelong Behavior Modeling framework (HiT-LBM). HiT-LBM integrates Chunked User Behavior Extraction (CUBE) and Hierarchical Tree Search for Interest (HTS) to capture diverse interests and interest evolution of user. CUBE divides user lifelong behaviors into multiple chunks and learns the interest and interest evolution within each chunk in a cascading manner. HTS generates candidate interests through hierarchical expansion and searches for the optimal interest with process rating model to ensure information gain for each behavior chunk. Additionally, we design Temporal-Ware Interest Fusion (TIF) to integrate interests from multiple behavior chunks, constructing a comprehensive representation of user lifelong interests. The representation can be embedded into any recommendation model to enhance performance. Extensive experiments demonstrate the effectiveness of our approach, showing that it surpasses state-of-the-art methods.

cs.IR↗

arXiv2025

The FAST Ursa Major supergroup HI survey (FUMaS): catalog and HI mass function

Using the Five-hundred-meter Aperture Spherical radio Telescope (FAST), we have performed an Ursa Major supergroup HI Survey (FUMaS) covering the entire UMa region centered at RA=11$^h$59$^m$28$^s$.3, DEC=49$^\circ$05'18" with a radius of 7.5$^\circ$. We have obtained the most complete catalog of HI sources in the UMa supergroup, containing 178 HI sources with velocities in the range 625-1213.4 km s$^{-1}$ and masses in the range 10$^{6.0}$-10$^{10.1}$ M$_{\odot}$ assuming a distance of 17.4 Mpc. Among them, 55 HI sources were detected for the first time, of which 32 do not have known optical redshifts. For these 32 sources, we have searched the DESI Legacy Surveys and found optical counterparts for 25 of them (with optical images, but no redshifts), with the remaining 7 sources to be pure HI clouds without an optical counterpart. We detected HI distributions in some interacting systems and discussed four small groups in detail. We computed the HIMF of the UMa supergroup using the 1/V$_\mathrm{max}$ method and fitting it with the non-linear least squares (NLLS) and modified maximum likelihood (MML) methods. We obtained the following HIMF parameters: log$_{10}$($ϕ_*$/Mpc$^{-3}$) = -0.78 $\pm$ 0.15, $α$ = -1.05 $\pm$ 0.07 and log$_{10}$($M_*$/$M_{\odot}$) = 9.87 $\pm$ 0.19 for the NLLS method, and log$_{10}$($ϕ_*$/Mpc$^{-3}$) = -0.70 $\pm$ 0.11, $α$ = -1.05 $\pm$ 0.05 and log$_{10}$($M_*$/$M_{\odot}$) = 9.77 $\pm$ 0.13 for the MML method. This result is similar to that derived from the VLA blind survey, but the slope is steeper because we detected more low-mass galaxies. The slope is flatter than that of the global HIMF, which agrees with the theoretical prediction that galaxies in high-density regions are stripped of gas due to interactions.

astro-ph.GA↗

arXiv2025

Two-dimensional non-van der Waals niobium nitride nanosheets with high-temperature two-gap superconductivity

The exploration of the superconductivity in two-dimensional materials has garnered significant attention due to their promising low-power applications and fundamental scientific interest. Here, we report some novel stable non-van der Waals Nb$_x$N$_{x+1}$ ($x$ = 1-4) monolayers derived from the NbN bulk exfoliated along the (001) plane, as identified through first-principles calculations. Among these monolayers, Nb$_2$N$_3$, which crystallizes in the $P \overline{6} m2$ symmetry, stands out with an exceptional superconducting transition temperature of 77.8 K, setting a new high-$T_c$ benchmark for two-dimensional transition metal nitrides and binary compounds. Our detailed analysis reveals that the strong superconductivity in Nb$_2$N$_3$ is driven by phonon modes dominated by N vibrations, with significant electron-phonon coupling contributions from N-$p$ and Nb-$d$ electronic states. Using the anisotropic Migdal-Eliashberg framework, we further determine the two-gap nature of the superconductivity in the Nb$_2$N$_3$ monolayer, characterized by pronounced electron-phonon coupling and anisotropic energy gaps. These results advance our understanding of superconductivity in 2D transition metal nitride and highlight their potential for nanoscale superconducting applications.

cond-mat.supr-con↗

arXiv2025

Generative Auto-Bidding with Value-Guided Explorations

Auto-bidding, with its strong capability to optimize bidding decisions within dynamic and competitive online environments, has become a pivotal strategy for advertising platforms. Existing approaches typically employ rule-based strategies or Reinforcement Learning (RL) techniques. However, rule-based strategies lack the flexibility to adapt to time-varying market conditions, and RL-based methods struggle to capture essential historical dependencies and observations within Markov Decision Process (MDP) frameworks. Furthermore, these approaches often face challenges in ensuring strategy adaptability across diverse advertising objectives. Additionally, as offline training methods are increasingly adopted to facilitate the deployment and maintenance of stable online strategies, the issues of documented behavioral patterns and behavioral collapse resulting from training on fixed offline datasets become increasingly significant. To address these limitations, this paper introduces a novel offline Generative Auto-bidding framework with Value-Guided Explorations (GAVE). GAVE accommodates various advertising objectives through a score-based Return-To-Go (RTG) module. Moreover, GAVE integrates an action exploration mechanism with an RTG-based evaluation method to explore novel actions while ensuring stability-preserving updates. A learnable value function is also designed to guide the direction of action exploration and mitigate Out-of-Distribution (OOD) problems. Experimental results on two offline datasets and real-world deployments demonstrate that GAVE outperforms state-of-the-art baselines in both offline evaluations and online A/B tests. By applying the core methods of this framework, we proudly secured first place in the NeurIPS 2024 competition, 'AIGB Track: Learning Auto-Bidding Agents with Generative Models'.

cs.LG↗

arXiv2025

FEASTS Combined with Interferometry. III. The Low Column Density HI Around M51 and Possibility of Turbulent-mixing Gas Accretion

With a new joint-deconvolution pipeline, we combine the single-dish and interferometric atomic hydrogen (HI) data of M51 observed by the Five-hundred-meter Aperture Spherical radio Telescope (FAST) (FEASTS program) and the Very Large Array (VLA) (THINGS). The product data cube has a typical line width of $13\,\text{km}\,\text{s}^{-1}$ and a $2σ$ line-of-sight (LOS) sensitivity of HI column density $N_\text{HI}\sim3.2\times10^{18}\,\text{cm}^{-2}$ at a spatial resolution of ${\sim}18''$ (${\sim}0.7\,\text{kpc}$). Among the HI-detected LOSs extending to ${\sim}50\,\text{kpc}$, ${\sim}89\%$ consist of diffuse HI only, which is missed by previous VLA observations. The distribution of dense HI is reproduced by previous hydrodynamical simulations of this system, but the diffuse component is not, likely due to unresolved physics related to the interaction between the circumgalactic and interstellar media. With simple models, we find that these low-$N_\text{HI}$ structures could survive the background ultraviolet photoionization, but are susceptible to the thermal evaporation. We find a positive correlation between LOS velocity dispersion ($σ_v$) and $N_\text{HI}$ with a logarithmic index of ${\sim}0.5$. Based on existing turbulent mixing layer (TML) theories and simulations, we propose a scenario of hot gas cooling and accreting onto the disk through a TML, which could reproduce the observed power index of ${\sim}0.5$. We estimate the related cooling and accretion rates to be roughly one-third to two-thirds of the star-formation rate. A typical column density of diffuse HI (${\sim}10^{19}\,\text{cm}^{-2}$) can be accreted within $300\,\text{Myr}$, the interaction time scale previously estimated for the system. Such a gas accretion channel has been overlooked before, and may be important for gas-rich interacting systems and for high redshift galaxy evolution.

astro-ph.GA↗

arXiv2025

The Chinese pulsar timing array data release I. Polarimetry for 56 millisecond pulsars

We present polarization pulse profiles for 56 millisecond pulsars (MSPs) monitored by the Chinese Pulsar Timing Array (CPTA) collaboration using the Five-hundred-meter Aperture Spherical radio Telescope (FAST). The observations centered at 1.25 GHz with a raw bandwidth of 500 MHz. Due to the high sensitivity ($\sim$16 K/Jy) of the FAST telescope and our long integration time, the high signal-to-noise ratio polarization profiles show features hardly detected before. Among 56 pulsars, the polarization profiles of PSRs J0406$+$3039, J1327$+$3423, and J2022$+$2534 were not previously reported. 80\% of MSPs in the sample show weak components below 3\% of peak flux, 25\% of pulsars show interpulse-like structures, and most pulsars show linear polarization position angle jumps. Six pulsars seem to be emitting for full rotation phase, with another thirteen pulsars being good candidates for such a 360$^\circ$ radiator. We find that the distribution of the polarization percentage in our sample is compatible with the normal pulsar distribution. Our detailed evaluation of the MSP polarization properties suggests that the wave propagation effects in the pulsar magnetosphere are important in shaping the MSP polarization pulse profiles.

astro-ph.HE↗

arXiv2025

XYScanNet: A State Space Model for Single Image Deblurring

Deep state-space models (SSMs), like recent Mamba architectures, are emerging as a promising alternative to CNN and Transformer networks. Existing Mamba-based restoration methods process visual data by leveraging a flatten-and-scan strategy that converts image patches into a 1D sequence before scanning. However, this scanning paradigm ignores local pixel dependencies and introduces spatial misalignment by positioning distant pixels incorrectly adjacent, which reduces local noise-awareness and degrades image sharpness in low-level vision tasks. To overcome these issues, we propose a novel slice-and-scan strategy that alternates scanning along intra- and inter-slices. We further design a new Vision State Space Module (VSSM) for image deblurring, and tackle the inefficiency challenges of the current Mamba-based vision module. Building upon this, we develop XYScanNet, an SSM architecture integrated with a lightweight feature fusion module for enhanced image deblurring. XYScanNet, maintains competitive distortion metrics and significantly improves perceptual performance. Experimental results show that XYScanNet enhances KID by $17\%$ compared to the nearest competitor.

cs.CV↗

arXiv2025

Orthus: Autoregressive Interleaved Image-Text Generation with Modality-Specific Heads

We introduce Orthus, an autoregressive (AR) transformer that excels in generating images given textual prompts, answering questions based on visual inputs, and even crafting lengthy image-text interleaved contents. Unlike prior arts on unified multimodal modeling, Orthus simultaneously copes with discrete text tokens and continuous image features under the AR modeling principle. The continuous treatment of visual signals minimizes the information loss for both image understanding and generation while the fully AR formulation renders the characterization of the correlation between modalities straightforward. The key mechanism enabling Orthus to leverage these advantages lies in its modality-specific heads -- one regular language modeling (LM) head predicts discrete text tokens and one diffusion head generates continuous image features conditioning on the output of the backbone. We devise an efficient strategy for building Orthus -- by substituting the Vector Quantization (VQ) operation in the existing unified AR model with a soft alternative, introducing a diffusion head, and tuning the added modules to reconstruct images, we can create an Orthus-base model effortlessly (e.g., within mere 72 A100 GPU hours). Orthus-base can further embrace post-training to better model interleaved images and texts. Empirically, Orthus surpasses competing baselines including Show-o and Chameleon across standard benchmarks, achieving a GenEval score of 0.58 and an MME-P score of 1265.8 using 7B parameters. Orthus also shows exceptional mixed-modality generation capabilities, reflecting the potential for handling intricate practical generation tasks.

cs.CV↗

arXiv2025

Generalizability of local neural operator: example for elastodynamic problems

Local neural operator (LNO) conception has provided a feasible way for scientific computations. The LNO learns transient partial differential equations from random field samples, and then the pre-trained LNO solves practical problems on specific computational domains. For applications, we may ask: Are the training samples rich enough? To what extent can we trust the solutions obtained from pre-trained LNO models for unknown cases? The generalizability of LNO could answer these questions. Here, we propose to use two plain scalar features, the amplitude and wavenumber of the input functions, to indicate the richness of training samples and to evaluate the generalization error of pre-trained LNO. In elastodynamic practices, we find that isolated evolving wavenumber modes for Lamé-Navier equation caused the training dataset to lack mode diversity. By data supplementation and model fine-tuning targeting to the discovered lack modes, the pre-trained and fine-tuned LNO model solves Lamb problem correctly and efficiently. These results and the proposed generalization criteria provide a paradigm for LNO applications.

physics.comp-ph↗

arXiv2025

Discovery of a high-velocity cloud of the Milky Way as a potential dark galaxy

High-velocity clouds (HVCs) are composed of neutral hydrogen (HI) moving at velocities that deviate from the general rotational motion of the Milky Way. Currently, the origins of the HVCs remain poorly known due to the difficulty in determining their distance and the lack of any other suitable identification. Here we report the detection of a compact gas clump in HVC AC-I, which displays characteristics typical of a disk galaxy, named AC G185.0-11.5, using the HI observations. We estimated the distance of AC G185.0-11.5 to be about 277.7 kpc using the Baryonic Tully-Fisher relation and constrained its HI gas mass to be between 3.0*10^7 and 4.7*10^8 solar masses. The distance determination indicates that the HVC AC-I hosting AC G185.0-11.5 is an extragalactic object in the Local Group. The absence of molecular gas and an optical counterpart for AC G185.0-11.5 implies that it may be a rare dark galaxy.

astro-ph.GA↗

arXiv2025

BBQRec: Behavior-Bind Quantization for Multi-Modal Sequential Recommendation

Multi-modal sequential recommendation systems leverage auxiliary signals (e.g., text, images) to alleviate data sparsity in user-item interactions. While recent methods exploit large language models to encode modalities into discrete semantic IDs for autoregressive prediction, we identify two critical limitations: (1) Existing approaches adopt fragmented quantization, where modalities are independently mapped to semantic spaces misaligned with behavioral objectives, and (2) Over-reliance on semantic IDs disrupts inter-modal semantic coherence, thereby weakening the expressive power of multi-modal representations for modeling diverse user preferences. To address these challenges, we propose a Behavior-Bind multi-modal Quantization for Sequential Recommendation (BBQRec for short) featuring dual-aligned quantization and semantics-aware sequence modeling. First, our behavior-semantic alignment module disentangles modality-agnostic behavioral patterns from noisy modality-specific features through contrastive codebook learning, ensuring semantic IDs are inherently tied to recommendation tasks. Second, we design a discretized similarity reweighting mechanism that dynamically adjusts self-attention scores using quantized semantic relationships, preserving multi-modal synergies while avoiding invasive modifications to the sequence modeling architecture. Extensive evaluations across four real-world benchmarks demonstrate BBQRec's superiority over the state-of-the-art baselines.

cs.IR↗

arXiv2025

CHIME: A Compressive Framework for Holistic Interest Modeling

Modeling holistic user interests is important for improving recommendation systems but is challenged by high computational cost and difficulty in handling diverse information with full behavior context. Existing search-based methods might lose critical signals during behavior selection. To overcome these limitations, we propose CHIME: A Compressive Framework for Holistic Interest Modeling. It uses adapted large language models to encode complete user behaviors with heterogeneous inputs. We introduce multi-granular contrastive learning objectives to capture both persistent and transient interest patterns and apply residual vector quantization to generate compact embeddings. CHIME demonstrates superior ranking performance across diverse datasets, establishing a robust solution for scalable holistic interest modeling in recommendation systems.

cs.IR↗