arXiv subjects

Rong Du

Publications and source records attributed to Rong Du.

At least 19 recordsLinked to original sources

arXiv2026

Rongzai agent: A Large Language Model-Based Autonomous Assistant for Rietveld Refinement of Neutron Diffraction Data

Neutron diffraction (ND) is an indispensable technique for determining atomic positions (especially light elements) and thus serves as a critical probe for revealing microscopic structures in materials science. However, traditional Rietveld refinement of ND data relies heavily on manual operation of specialized software, which is time-consuming, labor-intensive, and highly dependent on user expertise, severely hindering automated analysis. The automation of Rietveld refinement has long been a long-standing and challenging problem in crystallography. To address this challenge, this paper presents the Dr.Sai-Rongzai agent, an autonomous refinement assistant based on a large language model (LLM), a specialist knowledge base, and the GSAS-II refinement engine, achieving for the first time an intelligent refinement that integrates knowledge-driven decision-making. The agent accomplishes a fully automated workflow from natural language task parsing to autonomous decision-making, execution of refinement strategies, and report generation. Evaluation on five representative samples shows that the Rongzai agent achieves lower Rwp values than human specialists on three samples (2.88% vs. 4.42%, 5.06% vs. 5.40%, 7.60% vs. 9.00%), while on the other two samples its results are very close to those of the specialists. The agent is currently deployed at the China Spallation Neutron Source (CSNS) and is open for external user registration, providing an intelligent and user-friendly analytical tool for materials research. This work fully leverages the cutting-edge advantages of LLM, offers a new path to solve the long-standing problem of automated refinement, takes a key step toward intelligent and fully automated crystallographic analysis, and holds great potential to accelerate AI for Science discoveries in neutron-based materials characterization.

cond-mat.mtrl-sci↗

arXiv2026

Private Speech Classification without Collapse: Stabilized DP Training and Offline Distillation

We study example-level private supervised speech classification under a practical release constraint: training may access privileged side information, but the released model must be audio-only. This setting is important because speech systems can often exploit richer side information during development, whereas deployment and release require a lightweight unimodal model with auditable privacy guarantees. Using DP-SGD on the private dataset $D_{\text{priv}}$, we identify a strong-privacy failure mode ($\epsilon \le 1$) on imbalanced tasks, where training may collapse to a near single-class predictor, a phenomenon that overall accuracy can obscure. We therefore emphasize Macro-F1, balanced accuracy, and a simple collapse diagnostic. This failure is especially problematic in our release setting because a collapsed private teacher cannot provide useful supervision for the downstream audio-only student. To address this setting under strong privacy, we propose a two-stage protocol: (i) train a (possibly multimodal) DP teacher on $D_{\text{priv}}$, and (ii) distill an audio-only student on a fixed, recording-disjoint auxiliary dataset $D_{\text{aux}}$ using one-shot offline teacher probability outputs, releasing only the student. The DP guarantee applies only to $D_{\text{priv}}$; we make no DP claim for $D_{\text{aux}}$, and privacy of the released student with respect to $D_{\text{priv}}$ follows by post-processing. We frame this setting as involving four coupled bottlenecks: speech-induced optimization instability under DP-SGD, minority-class erosion under clipping and noise, teacher over-reliance on privileged modalities unavailable at deployment, and train--deploy modality mismatch. We address them with a DP-stabilizing acoustic front-end (DSAF), minibatch-adaptive bounded loss reweighting (AW-DP), privileged-modality dropout, and offline teacher-to-student distillation.

cs.SD↗

arXiv2026

G-type antiferromagnetic structure in Rb1-xV2Te2O

Altermagnetism, known for its non-relativistic spin-split band structures with yet compensated moments, is being intensively investigated. Discovering new altermagnetic materials with characteristics suitable for practical use remains an important ongoing task. Recently a metallic room-temperature altermagnet candidate Rb1-xV2Te2O with a layered structure and d-wave spin symmetry has been reported based on experimental results from the spin-resolved photoemission spectroscopy and scanning tunnelling microscopy/spectroscopy (STM/STS) measurements. Here we report neutron powder diffraction (NPD) investigations on the magnetic structure of Rb1-xV2Te2O, which shows a G-type antiferromagnetic structure below the transition temperature of 337 K. The result is different from the original theoretical expectation, which might lead to new insights on the physics of this altermagnet candidate.

cond-mat.mtrl-sci↗

arXiv2025

Dual Utilization of Perturbation for Stream Data Publication under Local Differential Privacy

Stream data from real-time distributed systems such as IoT, tele-health, and crowdsourcing has become an important data source. However, the collection and analysis of user-generated stream data raise privacy concerns due to the potential exposure of sensitive information. To address these concerns, local differential privacy (LDP) has emerged as a promising standard. Nevertheless, applying LDP to stream data presents significant challenges, as stream data often involves a large or even infinite number of values. Allocating a given privacy budget across these data points would introduce overwhelming LDP noise to the original stream data. Beyond existing approaches that merely use perturbed values for estimating statistics, our design leverages them for both perturbation and estimation. This dual utilization arises from a key observation: each user knows their own ground truth and perturbed values, enabling a precise computation of the deviation error caused by perturbation. By incorporating this deviation into the perturbation process of subsequent values, the previous noise can be calibrated. Following this insight, we introduce the Iterative Perturbation Parameterization (IPP) method, which utilizes current perturbed results to calibrate the subsequent perturbation process. To enhance the robustness of calibration and reduce sensitivity, two algorithms, namely Accumulated Perturbation Parameterization (APP) and Clipped Accumulated Perturbation Parameterization (CAPP) are further developed. We prove that these three algorithms satisfy $w$-event differential privacy while significantly improving utility. Experimental results demonstrate that our techniques outperform state-of-the-art LDP stream publishing solutions in terms of utility, while retaining the same privacy guarantee.

cs.CR↗

arXiv2025

Multi-class Item Mining under Local Differential Privacy

Item mining, a fundamental task for collecting statistical data from users, has raised increasing privacy concerns. To address these concerns, local differential privacy (LDP) was proposed as a privacy-preserving technique. Existing LDP item mining mechanisms primarily concentrate on global statistics, i.e., those from the entire dataset. Nevertheless, they fall short of user-tailored tasks such as personalized recommendations, whereas classwise statistics can improve task accuracy with fine-grained information. Meanwhile, the introduction of class labels brings new challenges. Label perturbation may result in invalid items for aggregation. To this end, we propose frameworks for multi-class item mining, along with two mechanisms: validity perturbation to reduce the impact of invalid data, and correlated perturbation to preserve the relationship between labels and items. We also apply these optimized methods to two multi-class item mining queries: frequency estimation and top-$k$ item mining. Through theoretical analysis and extensive experiments, we verify the effectiveness and superiority of these methods.

cs.CR↗

arXiv2025

Uniform vector bundles over $\mathbb{P}^4$

There is a long-standing conjecture which states that every uniform algebraic vector bundle of rank $r<2n$ on the $n$-dimensional projective space $\mathbb{P}^n$ over an algebraically closed field of characteristic $0$ is homogeneous. This conjecture is valid for $n\leq3$. In this paper, we classify all uniform vector bundles of rank $r<8$ over $\mathbb{P}^4$ and show that the conjecture holds for $n=4$.

math.AG↗

arXiv2025

Privacy for Free: Leveraging Local Differential Privacy Perturbed Data from Multiple Services

Local Differential Privacy (LDP) has emerged as a widely adopted privacy-preserving technique in modern data analytics, enabling users to share statistical insights while maintaining robust privacy guarantees. However, current LDP applications assume a single service gathering perturbed information from users. In reality, multiple services may be interested in collecting users' data, which poses privacy burdens to users as more such services emerge. To address this issue, this paper proposes a framework for collecting and aggregating data based on perturbed information from multiple services, regardless of their estimated statistics (e.g., mean or distribution) and perturbation mechanisms. Then for mean estimation, we introduce the Unbiased Averaging (UA) method and its optimized version, User-level Weighted Averaging (UWA). The former utilizes biased perturbed data, while the latter assigns weights to different perturbed results based on perturbation information, thereby achieving minimal variance. For distribution estimation, we propose the User-level Likelihood Estimation (ULE), which treats all perturbed results from a user as a whole for maximum likelihood estimation. Experimental results demonstrate that our framework and constituting methods significantly improve the accuracy of both mean and distribution estimation.

cs.CR↗

arXiv2024

Prospects for Systematic Planetary Nebulae Detection with the Census of the Local Universe Narrowband Survey

We investigate the efficacy of a systematic planetary nebula (PN) search in the Census of the Local Universe (CLU) narrowband (H$\alpha$) survey that covers a considerably larger sky region of above declination $-20^\circ$ than most previous surveys. Using PNe observed by the Isaac Newton Telescope Photometric H$\alpha$ Survey (IPHAS) as validation, we are able to visually recover 432 out of 441 cataloged PNe (98\%) within the CLU dataset, with 5 sources having unusable CLU images and 4 missed due to limitations of imaging quality. Moreover, the reference PNe are conventionally divided into three PN classes in decreasing order of identification confidence given their spectra and morphologies. We record consistently high recovery rate across all classes: 95\% of True, 71\% of Likely, and 81\% of Possible sources are readily recovered. To further demonstrate the ability of CLU to find new PNe, we undertake a preliminary search of compact PNe within a sub-region of the validation catalog, mainly utilizing the significance of narrow-band colors ($\Sigma$) as a metric for identification. In a $200\,\rm deg^2$ region, we search the CLU source catalog and find 31 PN candidates after automated and visual scrutiny, of which 12 are new sources not appearing in previous studies. As a demonstration of our ongoing follow-up campaign, we present medium-resolution optical spectra of six candidates and notice that four of them show emission signatures characteristic of confirmed PNe. As we refine our selection methods, CLU promises to provide a systematic catalog of PNe spanning $2/3$ of the sky.

astro-ph.SR↗

arXiv2024

On the Relation between the Inclination Angle of the Accretion Disk and the Broad-line Region in Active Galactic Nuclei

Models of active galactic nuclei often invoke a close physical association between the broad-line region and the accretion disk. We evaluate this theoretical expectation by investigating the relationship between the inclination angle of the BLR ($\theta_\mathrm{BLR}$) and the inclination angle of the inner accretion disk ($\theta_\mathrm{disk}$). For a sample of eight active galactic nuclei that have published values of $\theta_\mathrm{BLR}$ estimated from dynamical modeling of the BLR based on velocity-resolved reverberation mapping experiments, we analyze high-quality, joint XMM-Newton and NuSTAR X-ray observations to derive new, robust measurements of $\theta_\mathrm{disk}$ through broadband (0.3--78\,keV) reflection spectroscopy. We find a strong, positive correlation between $\theta_\mathrm{BLR}$ and $\theta_\mathrm{disk}$ (Pearson correlation coefficient 0.856, $p$-value 0.007), although Monte Carlo simulations indicate that the level of significance is only marginal ($<3\,\sigma$). Nevertheless, the nearly linear relation between $\theta_\mathrm{BLR}$ and $\theta_\mathrm{disk}$ suggests of a possible physical alignment between the accretion disk and the BLR. Future studies with a larger and more homogeneous sample are needed to confirm the correlation and refine our understanding of the structure and dynamics of the central regions of active galaxies.

astro-ph.HE↗

arXiv2024

Designing a Dataset for Convolutional Neural Networks to Predict Space Groups Consistent with Extinction Laws

In this paper, a dataset of one-dimensional powder diffraction patterns was designed with new strategy to train Convolutional Neural Networks for predicting space groups. The diffraction pattern was calculated based on lattice parameters and Extinction Laws, instead of the traditional approach of generating it from a crystallographic database. This paper demonstrates that the new strategy is more effective than the conventional method. As a result, the model trained on the cubic and tetragonal training set from the newly designed dataset achieves prediction accuracy that matches the theoretical maximums calculated based on Extinction Laws. These results demonstrate that machine learning-based prediction can be both physically reasonable and reliable. Additionally, the model trained on our newly designed dataset shows excellent generalization capability, much better than the one trained on a traditionally designed dataset.

cs.NE↗

arXiv2024

On uniform and nonhomogeneous vector bundles over Grassmannians

We demonstrate the existence of a uniform and nonhomogeneous vector bundle $E$ of rank $(n-d)(m+1)-1$ over Grassmannian $\mathbb{G}(d,n)$, where $m>d$ and $1\le d \le n-d-1$ with a $\mathbb{P}$-homogeneity degree $h(E)=d$. Particularly, we establish an upper bound of $3(n-d)-2$ for the uniform-homogeneous shreshold of $\mathbb{G}(d,n)$. Additionally, we construct indecomposable uniform vector bundles of rank $(d+2)(n-d)+d-2+\sum\limits_{i=0}^p\tbinom{d-1+p-i}{p-i}(1+i)-\tbinom{p+d}{p}$ that are nonhomogeneous over $\mathbb{G}(d,n)$.

math.AG↗

arXiv2024

Uniform (d+1)-bundle over the Grassmannian G(d,n)

This paper is dedicated to the classification of uniform vector bundles of rank $d+1$ over the Grassmannian $G(d,n)$ ($d\le n-d$) over an algebraically closed field in characteristic $0$. Specifically, we show that all uniform vector bundles with rank $d+1$ over $G(d,n)$ are homogeneous.

math.AG↗

arXiv2024

Interactive Trimming against Evasive Online Data Manipulation Attacks: A Game-Theoretic Approach

With the exponential growth of data and its crucial impact on our lives and decision-making, the integrity of data has become a significant concern. Malicious data poisoning attacks, where false values are injected into the data, can disrupt machine learning processes and lead to severe consequences. To mitigate these attacks, distance-based defenses, such as trimming, have been proposed, but they can be easily evaded by white-box attackers. The evasiveness and effectiveness of poisoning attack strategies are two sides of the same coin, making game theory a promising approach. However, existing game-theoretical models often overlook the complexities of online data poisoning attacks, where strategies must adapt to the dynamic process of data collection. In this paper, we present an interactive game-theoretical model to defend online data manipulation attacks using the trimming strategy. Our model accommodates a complete strategy space, making it applicable to strong evasive and colluding adversaries. Leveraging the principle of least action and the Euler-Lagrange equation from theoretical physics, we derive an analytical model for the game-theoretic process. To demonstrate its practical usage, we present a case study in a privacy-preserving data collection system under local differential privacy where a non-deterministic utility function is adopted. Two strategies are devised from this analytical model, namely, Tit-for-tat and Elastic. We conduct extensive experiments on real-world datasets, which showcase the effectiveness and accuracy of these two strategies.

cs.CR↗

arXiv2024

Pinched theorem and the reverse Yau's inequalities for compact K\"{a}hler-Einstein manifolds

For a compact K\"{a}hler-Einstein manifold $M$ of dimension $n\ge 2$, we explicitly write the expression $-c_1^n(M)+\frac{2(n+1)}{n}c_2(M)c_1^{n-2}(M)$ in the form of certain integral on the holomorphic sectional curvature and its average at a fixed point in $M$ using the invariant theory. As applications, we get a reverse Yau's inequality and improve the classical $\frac{1}{4}$-pinched theorem and negative $\frac{1}{4}$-pinched theorem for compact K\"{a}hler-Einstein manifolds to smaller pinching constant depending only on the dimension and the first Chern class of $M$. If $M$ is not with positive or negative holomorphic sectional curvature, then there exists a point $x\in M$ such that the average of the holomorphic sectional curvature at $x$ vanishes. In particular, we characterise the $2$-dimensional complex torus by certain curvature condition. Moreover, we confirm Yau's conjecture for positive holomorphic sectional curvature and Siu-Yang's conjecture for negative holomorphic sectional curvature even for higher dimensions if the absolute value of the holomorphic sectional curvature is small enough. Finally, using the reverse Yau's inequality, we can judge if a projective manifold doesn't carry any hermitian metric with negative holomorphic sectional curvature.

math.DG↗

arXiv2024

The Reliability of Accretion Disk Inclination Derived from X-ray Spectroscopy of Active Galaxies

The inclination angle of substructures in active galaxies gives insights into physical components from scales of the vicinity of the central black hole to the entire host galaxy. We use the self-consistent reflection spectral model \textsc{RELXILL} to measure the inclination of the inner region of accretion disks with broadband ($0.3-78\,\rm keV$) X-ray observations, systematically studying the reliability of this methodology. To test the capability of the model to return statistically consistent results, we analyze multi-epoch, joint XMM-Newton and NuSTAR data of the narrow-line Seyfert~1 galaxy I\,Zwicky\,1 and the broad-line radio galaxy 3C\,382, which exhibit different degrees of spectral complexity and reflection features. As expected, we find that adding more data for analysis narrows the confidence interval and that multi-epoch, joint observations return optimal measurements; however, even single-epoch data can be well-fitted if the reflection component is sufficiently dominant. Mock spectra are used to test the capability of \textsc{RELXILL} to recover input parameters from typical single-epoch, joint observations. We find that inclination is well-recovered at 90\% confidence, with improved constraints at higher reflection fraction and higher inclination. Higher iron abundance and corona temperature tighten the constraints as well, but the effect is not as significant as a higher reflection fraction. The spin, however, have little effect in reflection-based inclination measurements. We conclude that broadband reflection spectroscopy can reliably measure inner accretion disk inclination.

astro-ph.HE↗

arXiv2023

Fourier Neural Network Approximation of Transition Densities in Finance

This paper introduces FourNet, a novel single-layer feed-forward neural network (FFNN) method designed to approximate transition densities for which closed-form expressions of their Fourier transforms, i.e. characteristic functions, are available. A unique feature of FourNet lies in its use of a Gaussian activation function, enabling exact Fourier and inverse Fourier transformations and drawing analogies with the Gaussian mixture model. We mathematically establish FourNet's capacity to approximate transition densities in the $L_2$-sense arbitrarily well with finite number of neurons. The parameters of FourNet are learned by minimizing a loss function derived from the known characteristic function and the Fourier transform of the FFNN, complemented by a strategic sampling approach to enhance training. We derive practical bounds for the $L_2$ estimation error and the potential pointwise loss of nonnegativity in FourNet for $d$-dimensions ($d\ge 1$), highlighting its robustness and applicability in practical settings. FourNet's accuracy and versatility are demonstrated through a wide range of dynamics common in quantitative finance, including L\'{e}vy processes and the Heston stochastic volatility models-including those augmented with the self-exciting Queue-Hawkes jump process.

q-fin.CP↗

arXiv2023

Differential Aggregation against General Colluding Attackers

Local Differential Privacy (LDP) is now widely adopted in large-scale systems to collect and analyze sensitive data while preserving users' privacy. However, almost all LDP protocols rely on a semi-trust model where users are curious-but-honest, which rarely holds in real-world scenarios. Recent works show poor estimation accuracy of many LDP protocols under malicious threat models. Although a few works have proposed some countermeasures to address these attacks, they all require prior knowledge of either the attacking pattern or the poison value distribution, which is impractical as they can be easily evaded by the attackers. In this paper, we adopt a general opportunistic-and-colluding threat model and propose a multi-group Differential Aggregation Protocol (DAP) to improve the accuracy of mean estimation under LDP. Different from all existing works that detect poison values on individual basis, DAP mitigates the overall impact of poison values on the estimated mean. It relies on a new probing mechanism EMF (i.e., Expectation-Maximization Filter) to estimate features of the attackers. In addition to EMF, DAP also consists of two EMF post-processing procedures (EMF* and CEMF*), and a group-wise mean aggregation scheme to optimize the final estimated mean to achieve the smallest variance. Extensive experimental results on both synthetic and real-world datasets demonstrate the superior performance of DAP over state-of-the-art solutions.

cs.CR↗

arXiv2022

A Linkage-based Doubly Imbalanced Graph Learning Framework for Face Clustering

In recent years, benefiting from the expressive power of Graph Convolutional Networks (GCNs), significant breakthroughs have been made in face clustering area. However, rare attention has been paid to GCN-based clustering on imbalanced data. Although imbalance problem has been extensively studied, the impact of imbalanced data on GCN- based linkage prediction task is quite different, which would cause problems in two aspects: imbalanced linkage labels and biased graph representations. The former is similar to that in classic image classification task, but the latter is a particular problem in GCN-based clustering via linkage prediction. Significantly biased graph representations in training can cause catastrophic over-fitting of a GCN model. To tackle these challenges, we propose a linkage-based doubly imbalanced graph learning framework for face clustering. In this framework, we evaluate the feasibility of those existing methods for imbalanced image classification problem on GCNs, and present a new method to alleviate the imbalanced labels and also augment graph representations using a Reverse-Imbalance Weighted Sampling (RIWS) strategy. With the RIWS strategy, probability-based class balancing weights could ensure the overall distribution of positive and negative samples; in addition, weighted random sampling provides diverse subgraph structures, which effectively alleviates the over-fitting problem and improves the representation ability of GCNs. Extensive experiments on series of imbalanced benchmark datasets synthesized from MS-Celeb-1M and DeepFashion demonstrate the effectiveness and generality of our proposed method. Our implementation and the synthesized datasets will be openly available on https://github.com/espectre/GCNs_on_imbalanced_datasets.

cs.CV↗