Researcher profile

Jun Yin

Jun Yin contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
16works
0followers
15topics
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

Power Reinforcement Post-Training of Text-to-Image Models with Super-Linear Advantage Shaping

Recently, post-training methods based on reinforcement learning, with a particular focus on Group Relative Policy Optimization (GRPO), have emerged as the robust paradigm for further advancement of text-to-image (T2I) models. However, these methods are often prone to reward hacking, wherein models exploit biases in imperfect reward functions rather than yielding genuine performance gains. In this work, we identify that normalization could lead to miscalibration and directly removing the prompt-level standard deviation term yields an optimal policy ascent direction that is linear in the advantage but still limits the separation of genuine signals from noise. To mitigate the above issues, we propose Super-Linear Advantage Shaping (SLAS) by revisiting the functional update from an information geometry perspective. By extending the Fisher-Rao information metric with advantage-dependent weighting, SLAS introduces a non-linear geometric structure that reshapes the local policy space. This design relaxes constraints along high-advantage directions to amplify informative updates, while tightening those in low-advantage regions to suppress illusory gradients. In addition, batch-level normalization is applied to stabilize training under varying reward scales. Extensive evaluations demonstrate that SLAS consistently surpasses the DanceGRPO baseline across multiple backbones and benchmarks. In particular, it yields faster training dynamics, improved out-of-domain performance on GenEval and UniGenBench++, and enhanced robustness to model scaling, while mitigating reward hacking and preserving semantic and compositional fidelity in generations.

preprint2024arXiv

Chirality tuning and reversing with resonant phase-change metasurfaces

Dynamic control of circular dichroism in photonic structures is critically important for compact spectrometers, stereoscopic displays, and information processing exploiting multiple degrees of freedom. Metasurfaces can help miniaturize chiral devices but only produce static and limited chiral responses. While external stimuli are able to tune resonances, their modulations are often weak, and reversing continuously the sign of circular dichroism is extremely challenging. Here, we demonstrate dynamically tunable chiral response of resonant metasurfaces supporting chiral bound states in the continuum combining them with phase-change materials. Phase transition between amorphous and crystalline phases allows to control chiral response and vary chirality rapidly from -0.947 to +0.958 backward and forward via chirality continuum. Our demonstrations underpin the rapid development of chiral photonics and its applications.

preprint2022arXiv

MASNet:Improve Performance of Siamese Networks with Mutual-attention for Remote Sensing Change Detection Tasks

Siamese networks are widely used for remote sensing change detection tasks. A vanilla siamese network has two identical feature extraction branches which share weights, these two branches work independently and the feature maps are not fused until about to be sent to a decoder head. However we find that it is critical to exchange information between two feature extraction branches at early stage for change detection task. In this work we present Mutual-Attention Siamese Network (MASNet), a general siamese network with mutual-attention plug-in, so to exchange information between the two feature extraction branches. We show that our modification improve the performance of siamese networks on multi change detection datasets, and it works for both convolutional neural network and visual transformer.

preprint2022arXiv

RPT++: Customized Feature Representation for Siamese Visual Tracking

While recent years have witnessed remarkable progress in the feature representation of visual tracking, the problem of feature misalignment between the classification and regression tasks is largely overlooked. The approaches of feature extraction make no difference for these two tasks in most of advanced trackers. We argue that the performance gain of visual tracking is limited since features extracted from the salient area provide more recognizable visual patterns for classification, while these around the boundaries contribute to accurately estimating the target state. We address this problem by proposing two customized feature extractors, named polar pooling and extreme pooling to capture task-specific visual patterns. Polar pooling plays the role of enriching information collected from the semantic keypoints for stronger classification, while extreme pooling facilitates explicit visual patterns of the object boundary for accurate target state estimation. We demonstrate the effectiveness of the task-specific feature representation by integrating it into the recent and advanced tracker RPT. Extensive experiments on several benchmarks show that our Customized Features based RPT (RPT++) achieves new state-of-the-art performances on OTB-100, VOT2018, VOT2019, GOT-10k, TrackingNet and LaSOT.

preprint2021arXiv

DCCRGAN: Deep Complex Convolution Recurrent Generator Adversarial Network for Speech Enhancement

Generative adversarial network (GAN) still exists some problems in dealing with speech enhancement (SE) task. Some GAN-based systems adopt the same structure from Pixel-to-Pixel directly without special optimization. The importance of the generator network has not been fully explored. Other related researches change the generator network but operate in the time-frequency domain, which ignores the phase mismatch problem. In order to solve these problems, a deep complex convolution recurrent GAN (DCCRGAN) structure is proposed in this paper. The complex module builds the correlation between magnitude and phase of the waveform and has been proved to be effective. The proposed structure is trained in an end-to-end way. Different LSTM layers are used in the generator network to sufficiently explore the speech enhancement performance of DCCRGAN. The experimental results confirm that the proposed DCCRGAN outperforms the state-of-the-art GAN-based SE systems.

preprint2021arXiv

Uniformly most reliable three-terminal graph of dense graphs

A graph $G$ with $k$ specified target vertices in vertex set is a $k$-terminal graph. The $k$-terminal reliability is the connection probability of the fixed $k$ target vertices in a $k$-terminal graph when every edge of this graph survives independently with probability $p$. For the class of two-terminal graphs with a large number of edges, Betrand, Goff, Graves and Sun constructed a locally most reliable two-terminal graph for $p$ close to $1$, and illustrated by a counterexample that this locally most reliable graph is not the uniformly most reliable two-terminal graph. At the same time, they also determined that there is a uniformly most reliable two-terminal graph in the class obtained by deleting an edge from the complete graph with two target vertices. This article focuses on the uniformly most reliable three-terminal graph of dense graphs with $n$ vertices and $m$ edges. First, we give the locally most reliable three-terminal graphs of $n$ and $m$ in certain ranges for $p$ close to $0$ and $1$. Then, it is proved that there is no uniformly most reliable three-terminal graph with specific $n$ and $m$, where $n\geq7$ and $\binom{n}{2}-\lfloor\frac{n-3}{2}\rfloor\leq m\leq\binom{n}{2}-2$. Finally, some uniformly most reliable graphs are given for $n$ vertices and $m$ edges, where $4\leq n\leq 6$ and $m=\binom{n}{2}-2$ or $n\geq5$ and $m=\binom{n}{2}-1$.

preprint2020arXiv

Convergence of eigenvector empirical spectral distribution of sample covariance matrices

The eigenvector empirical spectral distribution (VESD) is a useful tool in studying the limiting behavior of eigenvalues and eigenvectors of covariance matrices. In this paper, we study the convergence rate of the VESD of sample covariance matrices to the deformed Marčenko-Pastur (MP) distribution. Consider sample covariance matrices of the form $Σ^{1/2} X X^* Σ^{1/2}$, where $X=(x_{ij})$ is an $M\times N$ random matrix whose entries are independent random variables with mean zero and variance $N^{-1}$, and $Σ$ is a deterministic positive-definite matrix. We prove that the Kolmogorov distance between the expected VESD and the deformed MP distribution is bounded by $N^{-1+ε}$ for any fixed $ε>0$, provided that the entries $\sqrt{N}x_{ij}$ have uniformly bounded 6th moments and $|N/M-1|\ge τ$ for some constant $τ>0$. This result improves the previous one obtained in \cite{XYZ2013}, which gave the convergence rate $O(N^{-1/2})$ assuming $i.i.d.$ $X$ entries, bounded 10th moment, $Σ=I$ and $M<N$. Moreover, we also prove that under the finite $8$th moment assumption, the convergence rate of the VESD is $O(N^{-1/2+ε})$ almost surely for any fixed $ε>0$, which improves the previous bound $N^{-1/4+ε}$ in \cite{XYZ2013}.

preprint2020arXiv

Dynamics for droplet-based electricity generators

The finding of droplet-based electricity generator (DEG), based on the moving boundary of electrical double layer, has triggered great research enthusiasm, and a breakthrough in instantaneous electric power density was achieved recently. However, the dynamic mechanism for such droplet-based electricity generators remains elusive, impeding optimization of the DEG for practical applications. Through comprehensive experiments, we developed a dynamic model of surface charge density that can explain the underlying mechanism for the DEGs. The spreading droplet in touch with the top electrode can be equivalently regarded as an additional part of the top plate of the DEG capacitor, and the change of droplet area causes the change of surface charge density of the plates, driving electrons to migrate between the two plates. The insight of the dynamic mechanism paves a way for optimal design and practical applications of DEGs

preprint2020arXiv

Leveraging Multi-level Dependency of Relational Sequences for Social Spammer Detection

Much recent research has shed light on the development of the relation-dependent but content-independent framework for social spammer detection. This is largely because the relation among users is difficult to be altered when spammers attempt to conceal their malicious intents. Our study investigates the spammer detection problem in the context of multi-relation social networks, and makes an attempt to fully exploit the sequences of heterogeneous relations for enhancing the detection accuracy. Specifically, we present the Multi-level Dependency Model (MDM). The MDM is able to exploit user&#39;s long-term dependency hidden in their relational sequences along with short-term dependency. Moreover, MDM fully considers short-term relational sequences from the perspectives of individual-level and union-level, due to the fact that the type of short-term sequences is multi-folds. Experimental results on a real-world multi-relational social network demonstrate the effectiveness of our proposed MDM on multi-relational social spammer detection.

preprint2020arXiv

Random band matrices in the delocalized phase, III: Averaging fluctuations

We consider a general class of symmetric or Hermitian random band matrices $H=(h_{xy})_{x,y \in \llbracket 1,N\rrbracket^d}$ in any dimension $d\ge 1$, where the entries are independent, centered random variables with variances $s_{xy}=\mathbb E|h_{xy}|^2$. We assume that $s_{xy}$ vanishes if $|x-y|$ exceeds the band width $W$, and we are interested in the mesoscopic scale with $1\ll W\ll N$. Define the {\it{generalized resolvent}} of $H$ as $G(H,Z):=(H - Z)^{-1}$, where $Z$ is a deterministic diagonal matrix with entries $Z_{xx}\in \mathbb C_+$ for all $x$. Then we establish a precise high-probability bound on certain averages of polynomials of the resolvent entries. As an application of this fluctuation averaging result, we give a self-contained proof for the delocalization of random band matrices in dimensions $d\ge 2$. More precisely, for any fixed $d\ge 2$, we prove that the bulk eigenvectors of $H$ are delocalized in certain averaged sense if $N\le W^{1+\frac{d}{2}}$. This improves the corresponding results in \cite{HeMa2018} under the assumption $N\ll W^{1+\frac{d}{d+1}}$, and in \cite{ErdKno2013,ErdKno2011} under the assumption $N\ll W^{1+\frac{d}{6}}$. For 1D random band matrices, our fluctuation averaging result was used in \cite{PartII,PartI} to prove the delocalization conjecture and bulk universality for random band matrices with $N\ll W^{4/3}$.

preprint2020arXiv

RPT: Learning Point Set Representation for Siamese Visual Tracking

While remarkable progress has been made in robust visual tracking, accurate target state estimation still remains a highly challenging problem. In this paper, we argue that this issue is closely related to the prevalent bounding box representation, which provides only a coarse spatial extent of object. Thus an effcient visual tracking framework is proposed to accurately estimate the target state with a finer representation as a set of representative points. The point set is trained to indicate the semantically and geometrically significant positions of target region, enabling more fine-grained localization and modeling of object appearance. We further propose a multi-level aggregation strategy to obtain detailed structure information by fusing hierarchical convolution layers. Extensive experiments on several challenging benchmarks including OTB2015, VOT2018, VOT2019 and GOT-10k demonstrate that our method achieves new state-of-the-art performance while running at over 20 FPS.

preprint2019arXiv

Electronic phase separation in topological surface states of rhombohedral graphite

Of the two stable forms of graphite, hexagonal (HG) and rhombohedral (RG), the former is more common and has been studied extensively. RG is less stable, which so far precluded its detailed investigation, despite many theoretical predictions about the abundance of exotic interaction-induced physics. Advances in van der Waals heterostructure technology have now allowed us to make high-quality RG films up to 50 graphene layers thick and study their transport properties. We find that the bulk electronic states in such RG are gapped and, at low temperatures, electron transport is dominated by surface states. Because of topological protection, the surface states are robust and of high quality, allowing the observation of the quantum Hall effect, where RG exhibits phase transitions between gapless semimetallic phase and gapped quantum spin Hall phase with giant Berry curvature. An energy gap can also be opened in the surface states by breaking their inversion symmetry via applying a perpendicular electric field. Moreover, in RG films thinner than 4 nm, a gap is present even without an external electric field. This spontaneous gap opening shows pronounced hysteresis and other signatures characteristic of electronic phase separation, which we attribute to emergence of strongly-correlated electronic surface states.

preprint2018arXiv

Stellar population synthesis of galaxies with chemical evolution model

The derivation of accurate stellar populations of galaxies is a non-trivial task because of the well-known age-metallicity degeneracy. We aim to break this degeneracy by invoking a chemical evolution model(CEM) for isolated disk galaxy, where its metallicity enrichment history(MEH) is modelled to be tightly linked to its star formation history(SFH). Our CEM has been successfully tested on several local group dwarf galaxies whose SFHs and MEHs have been both independently measured from deep color-magnitude diagrams of individual stars. By introducing the CEM into the stellar population fitting algorithm as a prior, we expect that the SFH of galaxies could be better constrained.

preprint2010arXiv

A Lower Bound on the Ground State Energy of Dilute Bose Gas

Consider an N-Boson system interacting via a two-body repulsive short-range potential $V$ in a three dimensional box $Λ$ of side length $L$. We take the limit $N, L \to \infty$ while keeping the density $ρ= N / L^3$ fixed and small. We prove a new lower bound for its ground state energy per particle $$\frac{E(N, Λ)}{N} \geq 4 πa ρ[ 1 - O(ρ^{1/3} |\log ρ|^3) ],$$ as $ρ\to 0$, where $a$ is the scattering length of $V$.

preprint2010arXiv

The local relaxation flow approach to universality of the local statistics for random matrices

We present a generalization of the method of the local relaxation flow to establish the universality of local spectral statistics of a broad class of large random matrices. We show that the local distribution of the eigenvalues coincides with the local statistics of the corresponding Gaussian ensemble provided the distribution of the individual matrix element is smooth and the eigenvalues ${x_j}_{j=1}^N$ are close to their classical location ${γ_j}_{j=1}^N$ determined by the limiting density of eigenvalues. Under the scaling where the typical distance between neighboring eigenvalues is of order 1/N, the necessary apriori estimate on the location of eigenvalues requires only to know that $\E |x_j - γ_j |^2 \le N^{-1-\e}$ on average. This information can be obtained by well established methods for various matrix ensembles. We demonstrate the method by proving local spectral universality for Wishart matrices.

preprint2008arXiv

The Ground State Energy of Dilute Bose Gas in Potentials with Positive Scattering Length

The leading term of the ground state energy/particle of a dilute gas of bosons with mass $m$ in the thermodynamic limit is $2π\hbar^2 a ρ/m$ when the density of the gas is $ρ$, the interaction potential is non-negative and the scattering length $a$ is positive. In this paper, we generalize the upper bound part of this result to any interaction potential with positive scattering length, i.e, $a>0$ and the lower bound part to some interaction potentials with shallow and/or narrow negative parts.