arXiv subjects

Yanli Chen

Publications and source records attributed to Yanli Chen.

15 recordsLinked to original sources

arXiv2026

Beyond QA Matching: Perturbation-Response Fingerprinting via Probability Distributions for Large Language Models

Large language models are often instruction-tuned, specialized, quantized, or otherwise transformed, making fine-grained provenance difficult. In this paper, we introduce BReF, a training-free fingerprint that compares how probability distributions over four answer-option labels A/B/C/D move under controlled textual perturbations. For each pair of models, BReF selects 25 jointly responsive probes and compares their perturbation log-ratio (PLR) response directions by global cosine similarity. On a unified benchmark with 34 checkpoints, 22 documented direct-parent relations, and 411 suspect-candidate pairs, BReF retrieves the documented parent in 22/22 cases (MRR=1.0000), with DP-DF AUC 1.0000. Same-family discrimination is harder (DP-SF AUC 0.8969), and paired tests show a significant exact-retrieval gain over a magnitude-only Top-25 control. Together with static, random-probe, permutation, calibration, and transformation-level controls, the results show that strong pooled separation does not guarantee correct parent ranking among closely related checkpoints, verifying the superiority of our work.

cs.CR↗

arXiv2025

Topological pumping of light governed by Fibonacci numbers

Topological pumping refers to transfer of a physical quantity governed by the systemtopology, resulting in quantized amounts of the transferred quantities. It is a ubiqui-tous wave phenomenon typically considered subject to exactly periodic adiabatic vari-ation of the system parameters. Recently, proposals for generalizing quasi-periodictopological pumping and identifying possible physical settings for its implementa-tion have emerged. In a strict sense, pumping with incommensurate frequencies canonly manifest over infinite evolution distances, raising a fundamental question aboutits observability in real-world finite-dimensional systems. Here we demonstrate thatbi-chromatic topological pumping with two frequencies, whose ratio is an irrationalnumber, can be viewed as the convergence limit of pumping with two commensuratefrequencies representing the best rational approximations of that irrational number. In our experiment, this phenomenon is observed as the displacement of a light beamcenter in photorefractive crystals induced by two optical lattices. The longitudinalperiods of the lattices, that in the paraxial approximation emulate two pumping fre-quencies, are related as Fibonacci numbers, successively approaching the golden ratio. We observed that a one-cycle displacement of the beam center at each successiveapproximation is determined by the relation between successive Fibonacci numbers,while the average direction of propagation (emulating average pumping velocity) ofthe beam is determined by the golden ratio.

physics.optics↗

arXiv2022

PhotoRedshift-MML: a multimodal machine learning method for estimating photometric redshifts of quasars

We propose a Multimodal Machine Learning method for estimating the Photometric Redshifts of quasars (PhotoRedshift-MML for short), which has long been the subject of many investigations. Our method includes two main models, i.e. the feature transformation model by multimodal representation learning, and the photometric redshift estimation model by multimodal transfer learning. The prediction accuracy of the photometric redshift was significantly improved owing to the large amount of information offered by the generated spectral features learned from photometric data via the MML. A total of 415,930 quasars from Sloan Digital Sky Survey (SDSS) Data Release 17, with redshifts between 1 and 5, were screened for our experiments. We used |Δz| = |(z_phot-z_spec)/(1+z_spec)| to evaluate the redshift prediction and demonstrated a 4.04% increase in accuracy. With the help of the generated spectral features, the proportion of data with |Δz| < 0.1 can reach 84.45% of the total test samples, whereas it reaches 80.41% for single-modal photometric data. Moreover, the Root Mean Square (RMS) of |Δz| is shown to decreases from 0.1332 to 0.1235. Our method has the potential to be generalized to other astronomical data analyses such as galaxy classification and redshift prediction. The algorithm code can be found at https://github.com/HongShuxin/PhotoRedshift-MML .

astro-ph.GA↗

arXiv2022

Identifying outliers in astronomical images with unsupervised machine learning

Astronomical outliers, such as unusual, rare or unknown types of astronomical objects or phenomena, constantly lead to the discovery of genuinely unforeseen knowledge in astronomy. More unpredictable outliers will be uncovered in principle with the increment of the coverage and quality of upcoming survey data. However, it is a severe challenge to mine rare and unexpected targets from enormous data with human inspection due to a significant workload. Supervised learning is also unsuitable for this purpose since designing proper training sets for unanticipated signals is unworkable. Motivated by these challenges, we adopt unsupervised machine learning approaches to identify outliers in the data of galaxy images to explore the paths for detecting astronomical outliers. For comparison, we construct three methods, which are built upon the k-nearest neighbors (KNN), Convolutional Auto-Encoder (CAE)+ KNN, and CAE + KNN + Attention Mechanism (attCAE KNN) separately. Testing sets are created based on the Galaxy Zoo image data published online to evaluate the performance of the above methods. Results show that attCAE KNN achieves the best recall (78%), which is 53% higher than the classical KNN method and 22% higher than CAE+KNN. The efficiency of attCAE KNN (10 minutes) is also superior to KNN (4 hours) and equal to CAE+KNN(10 minutes) for accomplishing the same task. Thus, we believe it is feasible to detect astronomical outliers in the data of galaxy images in an unsupervised manner. Next, we will apply attCAE KNN to available survey datasets to assess its applicability and reliability.

cs.CV↗

arXiv2022

Classifying Galaxy Morphologies with Few-Shot Learning

The taxonomy of galaxy morphology is critical in astrophysics as the morphological properties are powerful tracers of galaxy evolution. With the upcoming Large-scale Imaging Surveys, billions of galaxy images challenge astronomers to accomplish the classification task by applying traditional methods or human inspection. Consequently, machine learning, in particular supervised deep learning, has been widely employed to classify galaxy morphologies recently due to its exceptional automation, efficiency, and accuracy. However, supervised deep learning requires extensive training sets, which causes considerable workloads; also, the results are strongly dependent on the characteristics of training sets, which leads to biased outcomes potentially. In this study, we attempt Few-shot Learning to bypass the two issues. Our research adopts the dataset from Galaxy Zoo Challenge Project on Kaggle, and we divide it into five categories according to the corresponding truth table. By classifying the above dataset utilizing few-shot learning based on Siamese Networks and supervised deep learning based on AlexNet, VGG_16, and ResNet_50 trained with different volumes of training sets separately, we find that few-shot learning achieves the highest accuracy in most cases, and the most significant improvement is $21\%$ compared to AlexNet when the training sets contain 1000 images. In addition, to guarantee the accuracy is no less than 90\%, few-shot learning needs $\sim$6300 images for training, while ResNet_50 requires 13000 images. Considering the advantages stated above, foreseeably, few-shot learning is suitable for the taxonomy of galaxy morphology and even for identifying rare astrophysical objects, despite limited training sets consisting of observational data only.

astro-ph.GA↗

arXiv2022

The MSXF TTS System for ICASSP 2022 ADD Challenge

This paper presents our MSXF TTS system for Task 3.1 of the Audio Deep Synthesis Detection (ADD) Challenge 2022. We use an end to end text to speech system, and add a constraint loss to the system when training stage. The end to end TTS system is VITS, and the pre-training self-supervised model is wav2vec 2.0. And we also explore the influence of the speech speed and volume in spoofing. The faster speech means the less the silence part in audio, the easier to fool the detector. We also find the smaller the volume, the better spoofing ability, though we normalize volume for submission. Our team is identified as C2, and we got the fourth place in the challenge.

cs.SD↗

arXiv2021

Beijing ZKJ-NPU Speaker Verification System for VoxCeleb Speaker Recognition Challenge 2021

In this report, we describe the Beijing ZKJ-NPU team submission to the VoxCeleb Speaker Recognition Challenge 2021 (VoxSRC-21). We participated in the fully supervised speaker verification track 1 and track 2. In the challenge, we explored various kinds of advanced neural network structures with different pooling layers and objective loss functions. In addition, we introduced the ResNet-DTCF, CoAtNet and PyConv networks to advance the performance of CNN-based speaker embedding model. Moreover, we applied embedding normalization and score normalization at the evaluation stage. By fusing 11 and 14 systems, our final best performances (minDCF/EER) on the evaluation trails are 0.1205/2.8160% and 0.1175/2.8400% respectively for track 1 and 2. With our submission, we came to the second place in the challenge for both tracks.

cs.SD↗

arXiv2021

Analysis of the time-domain PML problem for Maxwell's equations in a waveguide

This paper is concerned with the mathematical analysis of the time-domain electromagnetic scattering problem in an infinite rectangular waveguide. A transparent boundary condition is developed to reformulate the problem into an equivalent initial boundary value problem in a bounded domain. The well-posedness and stability are obtained for the reduced problem. The perfectly matched layer method is studied to truncate the waveguide. It is shown that the truncated problem attains a unique solution. Moreover, an explicit error estimate is given between the solutions of the original scattering problem and the truncated problem. Based on the estimate, the stability and exponential convergence are established for the truncated problem. The optimal bound is achieved for the error with explicit dependence on the parameters of the perfectly matched layer.

math.AP↗

arXiv2020

A fast algorithm for the electromagnetic scattering from a large rectangular cavity in three dimensions

The paper is concerned with the three-dimensional electromagnetic scattering from a large open rectangular cavity that is embedded in a perfectly electrically conducting infinite ground plane. By introducing a transparent boundary condition, the scattering problem is formulated into a boundary value problem in the bounded cavity. Based on the Fourier expansions of the electric field, the Maxwell equation is reduced to one-dimensional ordinary differential equations for the Fourier coefficients. A fast algorithm, employing the fast Fourier transform and the Gaussian elimination, is developed to solve the resulting linear system for the cavity which is filled with either a homogeneous or a layered medium. In addition, a novel scheme is designed to evaluate rapidly and accurately the Fourier transform of singular integrals. Numerical experiments are presented for large cavities to demonstrate the superior performance of the proposed method.

math.NA↗

arXiv2020

An adaptive finite element PML method for the open cavity scattering problems

Consider the electromagnetic scattering of a time-harmonic plane wave by an open cavity which is embedded in a perfectly electrically conducting infinite ground plane. This paper is concerned with the numerical solutions of the transverse electric and magnetic polarizations of the open cavity scattering problems. In each polarization, the scattering problem is reduced equivalently into a boundary value problem of the two-dimensional Helmholtz equation in a bounded domain by using the transparent boundary condition (TBC). An a posteriori estimate based adaptive finite element method with the perfectly matched layer (PML) technique is developed to solve the reduced problem. The estimate takes account both of the finite element approximation error and the PML truncation error, where the latter is shown to decay exponentially with respect to the PML medium parameter and the thickness of the PML layer. Numerical experiments are presented and compared with the adaptive finite element TBC method for both polarizations to illustrate the competitive behavior of the proposed method.

math.NA↗

arXiv2018

Intra-Frame Error Concealment Scheme using 3D Reversible Data Hiding in Mobile Cloud Environment

Data in mobile cloud environment are mainly transmitted via wireless noisy channels, which may result in transmission errors with a high probability due to its unreliable connectivity. For video transmission, unreliable connectivity may cause significant degradation of the content. Improving or keeping video quality over lossy channel is therefore a very important research topic. Error concealment with data hiding (ECDH) is an effective way to conceal the errors introduced by channels. It can reduce error propagation between neighbor blocks/frames comparing with the methods exploiting temporal/spatial correlations. The existing video ECDH methods often embed the motion vectors (MVs) into the specific locations. Nevertheless, specific embedding locations cannot resist against random errors. To compensate the unreliable connectivity in mobile cloud environment, in this paper, we present a video ECDH scheme using 3D reversible data hiding (RDH), in which each MV is repeated multiple times, and the repeated MVs are embedded into different macroblocks (MBs) randomly. Though the multiple embedding requires more embedding space, satisfactory trade-off between the introduced distortion and the reconstructed video quality can be achieved by tuning the repeating times of the MVs. For random embedding, the lost probability of the MVs decreases rapidly, resulting in better error concealment performance. Experimental results show that the PSNR values gain about 5dB at least comparing with the existing ECDH methods. Meanwhile, the proposed method improves the video quality significantly.

cs.MM↗

arXiv2018

Reversible Embedding to Covers Full of Boundaries

In reversible data embedding, to avoid overflow and underflow problem, before data embedding, boundary pixels are recorded as side information, which may be losslessly compressed. The existing algorithms often assume that a natural image has little boundary pixels so that the size of side information is small. Accordingly, a relatively high pure payload could be achieved. However, there actually may exist a lot of boundary pixels in a natural image, implying that, the size of side information could be very large. Therefore, when to directly use the existing algorithms, the pure embedding capacity may be not sufficient. In order to address this problem, in this paper, we present a new and efficient framework to reversible data embedding in images that have lots of boundary pixels. The core idea is to losslessly preprocess boundary pixels so that it can significantly reduce the side information. Experimental results have shown the superiority and applicability of our work.

cs.MM↗

arXiv2016

A weak Galerkin finite element method for Burgers' equation

We propose a weak Galerkin(WG) finite element method for solving the one-dimensional Burgers' equation. Based on a new weak variational form, both semi-discrete and fully-discrete WG finite element schemes are established and analyzed. We prove the existence of the discrete solution and derive the optimal order error estimates in the discrete $H^1$-norm and $L^2$-norm, respectively. Numerical experiments are presented to illustrate our theoretical analysis.

math.NA↗

arXiv2016

A weak finite element method for elliptic problems in one space dimension

We present a weak finite element method for elliptic problems in one space dimension. Our analysis shows that this method has more advantages than the known weak Galerkin method proposed for multi-dimensional problems, for example, it has higher accuracy and the derived discrete equations can be solved locally, element by element. We derive the optimal error estimates in the discrete $H^1$-norm, the $L_2$-norm and $L_\infty$-norm, respectively. Moreover, some superconvergence results are also given. Finally, numerical examples are provided to illustrate our theoretical analysis.

math.NA↗

arXiv2015

An Analysis of the Weak Finite Element Method for Convection-Diffusion Equations

We study the weak finite element method solving convection-diffusion equations. A weak finite element scheme is presented based on a spacial variational form. We established a weak embedding inequality that is very useful in the weak finite element analysis. The optimal order error estimates are derived in the discrete $H^1$-norm, the $L_2$-norm and the $L_\infty$-norm, respectively. In particular, the $H^1$-superconvergence of order $k+2$ is given under certain condition. Finally, numerical examples are provided to illustrate our theoretical analysis

math.NA↗