Researcher profile

Peng Jin

Peng Jin contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
16works
0followers
12topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

16 published item(s)

preprint2026arXiv

Echo-LoRA: Parameter-Efficient Fine-Tuning via Cross-Layer Representation Injection

Parameter-efficient fine-tuning (PEFT) has become a practical route for adapting large language models to downstream tasks, with LoRA-style methods being particularly attractive because they are inexpensive to train and easy to deploy. Most LoRA variants, however, revise the update rule within the weight space of each layer and leave the intermediate representations formed by deeper layers largely unused. We propose Echo-LoRA, a cross-layer representation injection method for parameter-efficient fine-tuning. During training, Echo-LoRA collects boundary hidden states from deeper source layers, aggregates them into a sample-level echo representation, and uses lightweight projection and gating networks to inject the resulting signal into shallow LoRA or DoRA modules. Answer-only masking, masked distillation, and stochastic routing are used to keep this auxiliary path stable and to reduce the gap between training and inference. On eight commonsense reasoning benchmarks, Echo-LoRA exceeds the reported LoRA baselines by 5.7 percentage points on average across LLaMA-7B, LLaMA2-7B, and LLaMA3-8B. Under reproduced LoRA baselines in our unified implementation, the average gain is 3.0 points; when combined with DoRA, the gain is 2.7 points. The Echo path is discarded after training, so the deployed model keeps the original low-rank LoRA/DoRA form and adds neither inference-time parameters nor inference computation.

preprint2024arXiv

A dynamic thermal sensing mechanism with reconfigurable expanded-plane structures

The precise measurement of temperature is crucial in various fields such as biology, medicine, industrial automation, energy management, and daily life applications. While in most scenarios, sensors with a fixed thermal conductivity inevitably mismatch the analogous parameter of the medium being measured, thus causing the distortion and inaccurate detection of original temperature fields. Despite recent efforts on addressing the parameter-mismatch issue, all current solutions are constrained to a fixed working medium whereas a more universal sensor should function in a variety of scenes. Here, we report a dynamic thermal sensor capable of highly accurate measurements in diverse working environments. Remarkably, thanks to the highly tunable thermal conductivity of the expanded-plane structure, this sensor works effect on background mediums with a wide range of conductivity. Such a development greatly enhances the robustness and adaptability of thermal sensors, setting a solid foundation for applications in multi-physical sensing scenarios.

preprint2024arXiv

Click Metamaterials: Fast Acquisition of Thermal Conductivity and Functionality Diversities

Material science is an important foundation of modern society development, covering significant areas like chemosynthesis and metamaterials. Click chemistry provides a simple and efficient paradigm for achieving molecular diversity by incorporating modified building blocks into compounds. In contrast, most metamaterial designs are still case by case due to lacking a fundamental mechanism for achieving reconfigurable thermal conductivities, largely hindering design flexibility and functional diversity. Here, we propose a universal concept of click metamaterials for fast realizing various thermal conductivities and functionalities. Tunable hollow-filled unit cells are constructed to mimic the modified building blocks in click chemistry. Different hollow-filled arrays can generate convertible thermal conductivities from isotropy to anisotropy, allowing click metamaterials to exhibit adaptive thermal functionalities. The straightforward structures enable full-parameter regulation and simplify engineering preparation, making click metamaterials a promising candidate for practical use in other diffusion and wave systems.

preprint2022arXiv

An Intriguing Property of Geophysics Inversion

Inversion techniques are widely used to reconstruct subsurface physical properties (e.g., velocity, conductivity) from surface-based geophysical measurements (e.g., seismic, electric/magnetic (EM) data). The problems are governed by partial differential equations (PDEs) like the wave or Maxwell's equations. Solving geophysical inversion problems is challenging due to the ill-posedness and high computational cost. To alleviate those issues, recent studies leverage deep neural networks to learn the inversion mappings from measurements to the property directly. In this paper, we show that such a mapping can be well modeled by a very shallow (but not wide) network with only five layers. This is achieved based on our new finding of an intriguing property: a near-linear relationship between the input and output, after applying integral transform in high dimensional space. In particular, when dealing with the inversion from seismic data to subsurface velocity governed by a wave equation, the integral results of velocity with Gaussian kernels are linearly correlated to the integral of seismic data with sine kernels. Furthermore, this property can be easily turned into a light-weight encoder-decoder network for inversion. The encoder contains the integration of seismic data and the linear transformation without need for fine-tuning. The decoder only consists of a single transformer block to reverse the integral of velocity. Experiments show that this interesting property holds for two geophysics inversion problems over four different datasets. Compared to much deeper InversionNet, our method achieves comparable accuracy, but consumes significantly fewer parameters.

preprint2022arXiv

Extremely Weak Supervision Inversion of Multi-physical Properties

Multi-physical inversion plays a critical role in geophysics. It has been widely used to infer various physical properties~(such as velocity and conductivity). Among those inversion problems, some are explicitly governed by partial differential equations~(PDEs), while others are not. Without explicit governing equations, conventional multi-physical inversion techniques will not be feasible and data-driven inversion requires expensive full labels. To overcome this issue, we develop a new data-driven multi-physics inversion technique with extremely weak supervision. Our key finding is that the pseudo labels can be constructed by learning the local relationship among geophysical properties at very sparse well-logging locations. We explore a multi-physics inversion problem from two distinct measurements~(seismic and EM data) to three geophysical properties~(velocity, conductivity, and CO$_2$ saturation). Our results show that we are able to invert for properties without explicit governing equations. Moreover, the label data on three geophysical properties can be significantly reduced by 50 times~(from 100 down to only 2 locations).

preprint2022arXiv

Unsupervised Learning of Full-Waveform Inversion: Connecting CNN and Partial Differential Equation in a Loop

This paper investigates unsupervised learning of Full-Waveform Inversion (FWI), which has been widely used in geophysics to estimate subsurface velocity maps from seismic data. This problem is mathematically formulated by a second order partial differential equation (PDE), but is hard to solve. Moreover, acquiring velocity map is extremely expensive, making it impractical to scale up a supervised approach to train the mapping from seismic data to velocity maps with convolutional neural networks (CNN). We address these difficulties by integrating PDE and CNN in a loop, thus shifting the paradigm to unsupervised learning that only requires seismic data. In particular, we use finite difference to approximate the forward modeling of PDE as a differentiable operator (from velocity map to seismic data) and model its inversion by CNN (from seismic data to velocity map). Hence, we transform the supervised inversion task into an unsupervised seismic data reconstruction task. We also introduce a new large-scale dataset OpenFWI, to establish a more challenging benchmark for the community. Experiment results show that our model (using seismic data alone) yields comparable accuracy to the supervised counterpart (using both seismic data and velocity map). Furthermore, it outperforms the supervised model when involving more seismic data.

preprint2021arXiv

Robust Kalman filter-based dynamic state estimation of natural gas pipeline networks

To obtain the accurate transient states of the big scale natural gas pipeline networks under the bad data and non-zero mean noises conditions, a robust Kalman filter-based dynamic state estimation method is proposed using the linearized gas pipeline transient flow equations in this paper. Firstly, the dynamic state estimation model is built. Since the gas pipeline transient flow equations are less than the states, the boundary conditions are used as supplementary constraints to predict the transient states. To increase the measurement redundancy, the zero mass flow rate constraints at the sink nodes are taken as virtual measurements. Secondly, to ensure the stability under bad data condition, the robust Kalman filter algorithm is proposed by introducing a time-varying scalar matrix to regulate the measurement error variances correctly according to the innovation vector at every time step. At last, the proposed method is applied to a 30-node gas pipeline networks in several kinds of measurement conditions. The simulation shows that the proposed robust dynamic state estimation can decrease the effects of bad data and achieve better estimating results.

preprint2020arXiv

Adding A Filter Based on The Discriminator to Improve Unconditional Text Generation

The autoregressive language model (ALM) trained with maximum likelihood estimation (MLE) is widely used in unconditional text generation. Due to exposure bias, the generated texts still suffer from low quality and diversity. This presents statistically as a discrepancy between the real text and generated text. Some research shows a discriminator can detect this discrepancy. Because the discriminator can encode more information than the generator, discriminator has the potentiality to improve generator. To alleviate the exposure bias, generative adversarial networks (GAN) use the discriminator to update the generator's parameters directly, but they fail by being evaluated precisely. A critical reason for the failure is the difference between the discriminator input and the ALM input. We propose a novel mechanism by adding a filter which has the same input as the discriminator. First, discriminator detects the discrepancy signals and passes to filter directly (or by learning). Then, we use the filter to reject some generated samples with a sampling-based method. Thus, the original generative distribution is revised to reduce the discrepancy. Two ALMs, RNN-based and Transformer-based, are experimented. Evaluated precisely by three metrics, our mechanism consistently outperforms the ALMs and all kinds of GANs across two benchmark data sets.

preprint2020arXiv

Distributional Discrepancy: A Metric for Unconditional Text Generation

The purpose of unconditional text generation is to train a model with real sentences, then generate novel sentences of the same quality and diversity as the training data. However, when different metrics are used for comparing the methods of unconditional text generation, contradictory conclusions are drawn. The difficulty is that both the diversity and quality of the sample should be considered simultaneously when the models are evaluated. To solve this problem, a novel metric of distributional discrepancy (DD) is designed to evaluate generators based on the discrepancy between the generated and real training sentences. However, it cannot compute the DD directly because the distribution of real sentences is unavailable. Thus, we propose a method for estimating the DD by training a neural-network-based text classifier. For comparison, three existing metrics, bi-lingual evaluation understudy (BLEU) versus self-BLEU, language model score versus reverse language model score, and Fréchet embedding distance, along with the proposed DD, are used to evaluate two popular generative models of long short-term memory and generative pretrained transformer 2 on both syntactic and real data. Experimental results show that DD is significantly better than the three existing metrics for ranking these generative models.

preprint2020arXiv

Pavement Image Datasets: A New Benchmark Dataset to Classify and Densify Pavement Distresses

Automated pavement distresses detection using road images remains a challenging topic in the computer vision research community. Recent developments in deep learning has led to considerable research activity directed towards improving the efficacy of automated pavement distress identification and rating. Deep learning models require a large ground truth data set, which is often not readily available in the case of pavements. In this study, a labeled dataset approach is introduced as a first step towards a more robust, easy-to-deploy pavement condition assessment system. The technique is termed herein as the Pavement Image Dataset (PID) method. The dataset consists of images captured from two camera views of an identical pavement segment, i.e., a wide-view and a top-down view. The wide-view images were used to classify the distresses and to train the deep learning frameworks, while the top-down view images allowed calculation of distress density, which will be used in future studies aimed at automated pavement rating. For the wide view group dataset, 7,237 images were manually annotated and distresses classified into nine categories. Images were extracted using the Google Application Programming Interface (API), selecting street-view images using a python-based code developed for this project. The new dataset was evaluated using two mainstream deep learning frameworks: You Only Look Once (YOLO v2) and Faster Region Convolution Neural Network (Faster R-CNN). Accuracy scores using the F1 index were found to be 0.84 for YOLOv2 and 0.65 for the Faster R-CNN model runs; both quite acceptable considering the convenience of utilizing Google maps images.

preprint2020arXiv

Regularity of transition densities and ergodicity for affine jump-diffusion processes

In this paper we study the transition density and exponential ergodicity in total variation for an affine process on the canonical state space $\mathbb{R}_{\geq0}^{m}\times\mathbb{R}^{n}$. Under a Hörmander-type condition for diffusion components as well as a boundary non-attainment assumption, we derive the existence and regularity of the transition density for the affine process and then prove the strong Feller property. Moreover, we also show that under these and the additional subcritical conditions the corresponding affine process on the canonical state space is exponentially ergodic in the total variation distance. To prove existence and regularity of the transition density we derive some precise estimates for the real part of the characteristic function of the process. Our ergodicity result is a consequence of a suitable application of a Harris-type theorem based on a local Dobrushin condition combined with the regularity of the transition densities.

preprint2020arXiv

Uniqueness in law for stable-like processes of variable order

Let $d\ge1$. Consider a stable-like operator of variable order \begin{align*} \mathcal{A}f(x) & =\int_{\mathbb{R}^{d} \backslash\{0\}} \left[f(x+h) -f(x) -\mathbf{1}_{\{|h|\le1\}}h \cdot\nabla f(x)\right]\frac{n(x,h)}{|h|^{d+α(x)}} \mathrm{d}h, \end{align*} where $0<\inf_{x}α(x) \le \sup_{x}α(x)<2$ and $n(x,h)$ satisfies \[ n(x,h)=n(x,-h),\quad0<κ_{1}\le n(x,h)\leκ_{2},\quad\forall x,h\in \mathbb{R}^{d}, \] with $κ_{1}$ and $κ_{2}$ being some positive constants. Under some further mild conditions on the functions $n(x,h)$ and $α(x)$, we show the uniqueness of solutions to the martingale problem for $\mathcal{A}$.

preprint2019arXiv

Boundary behavior of multi-type continuous-state branching processes with immigration

In this article we provide a sufficient condition for a continuous-state branching process with immigration (CBI process) to not hit its boundary, i.e. for non-extinction. Our result applies to arbitrary dimension $d \geq 1$ and is formulated in terms of an integrability condition for its immigration and branching mechanisms $F$ and $R$. The proof is based on a suitable comparison with one-dimensional CBI processes and an existing result for one-dimensional CBI processes. The same technique is also used to provide a sufficient condition for transience of multi-type CBI processes.

preprint2019arXiv

Stochastic equation and exponential ergodicity in Wasserstein distances for affine processes

This work is devoted to the study of conservative affine processes on the canonical state space $D = $R_+^m \times \R^n$, where $m + n > 0$. We show that each affine process can be obtained as the pathwise unique strong solution to a stochastic equation driven by Brownian motions and Poisson random measures. Then we study the long-time behavior of affine processes, i.e., we show that under first moment condition on the state-dependent and log-moment conditions on the state-independent jump measures, respectively, each subcritical affine process is exponentially ergodic in a suitably chosen Wasserstein distance. Moments of affine processes are studied as well.

preprint2018arXiv

Existence of densities for multi-type CBI processes

Let X be a multi-type continuous-state branching process with immigration (CBI process) on state space $\mathbb{R}^d$. Denote by $g_t$, $t \geq 0$, the law of $X_{t}$. We provide sufficient conditions under which $g_t$ has, for each $t > 0$, a density with respect to the Lebesgue measure. Such density has, by construction, some anisotropic Besov regularity. Our approach neither relies on the use of Malliavin calculus nor on the study of corresponding Laplace transform.

preprint2018arXiv

Existence of densities for stochastic differential equations driven by Lévy processes with anisotropic jumps

We study existence of densities for solutions to stochastic differential equations with Hölder continuous coefficients and driven by a $d$-dimensional Lévy process $Z=(Z_{t})_{t\geq 0}$, where, for $t>0$, the density function $f_{t}$ of $Z_{t}$ exists and satisfies, for some $(α_{i})_{i=1,\dots,d}\subset(0,2)$ and $C>0$, \begin{align*} \limsup\limits _{t \to 0}t^{1/α_{i}}\int\limits _{\mathbb{R}^{d}}|f_{t}(z+e_{i}h)-f_{t}(z)|dz\leq C|h|,\ \ h\in \mathbb{R},\ \ i=1,\dots,d. \end{align*} Here $e_{1},\dots,e_{d}$ denote the canonical basis vectors in $\mathbb{R}^{d}$. The latter condition covers anisotropic $(α_{1},\dots,α_{d})$-stable laws but also particular cases of subordinate Brownian motion. To prove our result we use some ideas taken from \citep{DF13}.