Researcher profile

Qiang Chen

Qiang Chen contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

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

18 published item(s)

preprint2026arXiv

LEGATO: Good Identity Unlearning Is Continuous

Machine unlearning has become a crucial role in enabling generative models trained on large datasets to remove sensitive, private, or copyright-protected data. However, existing machine unlearning methods face three challenges in learning to forget identity of generative models: 1) inefficient, where identity erasure requires fine-tuning all the model's parameters; 2) limited controllability, where forgetting intensity cannot be controlled and explainability is lacking; 3) catastrophic collapse, where the model's retention capability undergoes drastic degradation as forgetting progresses. Forgetting has typically been handled through discrete and unstable updates, often requiring full-model fine-tuning and leading to catastrophic collapse. In this work, we argue that identity forgetting should be modeled as a continuous trajectory, and introduce LEGATO - Learn to ForgEt Identity in GenerAtive Models via Trajectory-consistent Neural Ordinary Differential Equations. LEGATO augments pre-trained generators with fine-tunable lightweight Neural ODE adapters, enabling smooth, controllable forgetting while keeping the original model weights frozen. This formulation allows forgetting intensity to be precisely modulated via ODE step size, offering interpretability and robustness. To further ensure stability, we introduce trajectory consistency constraints that explicitly prevent catastrophic collapse during unlearning. Extensive experiments across in-domain and out-of-domain identity unlearning benchmarks show that LEGATO achieves state-of-the-art forgetting performance, avoids catastrophic collapse and reduces fine-tuned parameters.

preprint2026arXiv

Programmable ultra-broadband photonic chaos platform enabled by microwave-chaos-driven electro-optic frequency combs

Optical chaos holds great promise for secure communication, LiDAR, and reinforcement learning. However, its scalability has long been constrained by an intrinsic trade-off between bandwidth and the number of parallel chaotic channels. Here, we introduce a programmable "chaos-on-comb" architecture that overcomes this limitation using standard electro-optic components. By heterodyning a delayed-feedback chaotic laser with a continuous-wave reference, a broadband chaotic microwave signal is generated to simultaneously drive a cascaded electro-optic comb, imprinting chaotic dynamics across all comb lines and merging them into an ultra-broadband chaotic continuum. Then, incorporating spectrum slicing enables flexible extraction of parallel chaotic channels with preserved statistical independence and per-channel programmability. As a result, we demonstrate a single-channel ultra-broadband optical chaos with an effective bandwidth of 543.8 GHz, and a broadband terahertz noise source with an excess noise ratio of 52.99 \pm 2.85 dB to validate its flatness. Furthermore, we employ the uncorrelated parallel chaos for ultrafast photonic decision-making in a 256-armed bandit problem, achieving a favourable power-law scaling exponent of 0.86. Our work paves the way toward programmable, reconfigurable, and application-ready photonic chaos systems.

preprint2026arXiv

Test-time generative augmentation for medical image segmentation

Medical image segmentation is critical for clinical diagnosis, treatment planning, and monitoring, yet segmentation models often struggle with uncertainties stemming from occlusions, ambiguous boundaries, and variations in imaging devices. Traditional test-time augmentation (TTA) techniques typically rely on predefined geometric and photometric transformations, limiting their adaptability and effectiveness in complex medical scenarios. In this study, we introduced Test-Time Generative Augmentation (TTGA), a novel augmentation strategy specifically tailored for medical image segmentation at inference time. Different from conventional augmentation strategies that suffer from excessive randomness or limited flexibility, TTGA leverages a domain-fine-tuned generative model to produce contextually relevant and diverse augmentations tailored to the characteristics of each test image. Built upon diffusion model inversion, a masked null-text inversion method is proposed to enable region-specific augmentations during sampling. Furthermore, a dual denoising pathway is designed to balance precise identity preservation with controlled variability. We demonstrate the efficacy of our TTGA through extensive experiments across three distinct segmentation tasks spanning nine datasets. Our results consistently demonstrate that TTGA not only improves segmentation accuracy (with DSC gains ranging from 0.1% to 2.3% over the baseline) but also offers pixel-wise error estimation (with DSC gains ranging from 1.1% to 29.0% over the baseline). The source code and demonstration are available at: https://github.com/maxiao0234/TTGA.

preprint2026arXiv

Tools as Continuous Flow for Evolving Agentic Reasoning

Large Language Models (LLMs) have demonstrated remarkable capabilities in orchestrating tools for reasoning tasks. However, existing methods rely on a step-wise paradigm that lacks a global perspective, which causes error accumulation over long horizons and restricts generalization to unseen tools. To overcome these limitations, we propose Tools as Continuous Flow for Evolving Agentic Reasoning (FlowAgent), which reconceptualizes tool chaining as continuous trajectory generation within a semantic space. To systematically evaluate this paradigm, we introduce the first plan-level closed-loop benchmark dedicated to plan-level agentic reasoning in dynamic real-world environments. Specifically, the proposed FlowAgent leverages conditional flow matching to generate continuous latent trajectories, providing a global planning perspective to ensure coherent and robust tool execution. Theoretically, we establish formal bounds on utility convergence and prove that our continuous formulation fundamentally guarantees robust generalization and error attenuation. Empirical evaluations show that FlowAgent achieves superior robustness and adaptability in long-horizon reasoning tasks.

preprint2024arXiv

MS-DETR: Efficient DETR Training with Mixed Supervision

DETR accomplishes end-to-end object detection through iteratively generating multiple object candidates based on image features and promoting one candidate for each ground-truth object. The traditional training procedure using one-to-one supervision in the original DETR lacks direct supervision for the object detection candidates. We aim at improving the DETR training efficiency by explicitly supervising the candidate generation procedure through mixing one-to-one supervision and one-to-many supervision. Our approach, namely MS-DETR, is simple, and places one-to-many supervision to the object queries of the primary decoder that is used for inference. In comparison to existing DETR variants with one-to-many supervision, such as Group DETR and Hybrid DETR, our approach does not need additional decoder branches or object queries. The object queries of the primary decoder in our approach directly benefit from one-to-many supervision and thus are superior in object candidate prediction. Experimental results show that our approach outperforms related DETR variants, such as DN-DETR, Hybrid DETR, and Group DETR, and the combination with related DETR variants further improves the performance.

preprint2023arXiv

Spinon continuum in the Heisenberg quantum chain compound Sr$_2$V$_3$O$_9$

Magnetic excitations in the spin chain candidate Sr$_2$V$_3$O$_9$ have been investigated by inelastic neutron scattering on a single crystal sample. A spinon continuum with a bandwidth of $\sim22$ meV is observed along the chain formed by alternating magnetic V$^{4+}$ and nonmagnetic V$^{5+}$ ions. Incipient magnetic Bragg peaks due to weak ferromagnetic interchain couplings emerge when approaching the magnetic transition at $T_N\sim 5.3$ K while the excitations remain gapless within the instrumental resolution. Comparisons to the Bethe ansatz, density matrix renormalization group (DMRG) calculations, and effective field theories confirm Sr$_2$V$_3$O$_9$ as a host of weakly coupled $S = 1/2$ chains dominated by antiferromagnetic intrachain interactions of $\sim7.1$(1) meV.

preprint2022arXiv

HIH: Towards More Accurate Face Alignment via Heatmap in Heatmap

Heatmap-based regression overcomes the lack of spatial and contextual information of direct coordinate regression, and has revolutionized the task of face alignment. Yet it suffers from quantization errors caused by neglecting subpixel coordinates in image resizing and network downsampling. In this paper, we first quantitatively analyze the quantization error on benchmarks, which accounts for more than 1/3 of the whole prediction errors for state-of-the-art methods. To tackle this problem, we propose a novel Heatmap In Heatmap(HIH) representation and a coordinate soft-classification (CSC) method, which are seamlessly integrated into the classic hourglass network. The HIH representation utilizes nested heatmaps to jointly represent the coordinate label: one heatmap called integer heatmap stands for the integer coordinate, and the other heatmap named decimal heatmap represents the subpixel coordinate. The range of a decimal heatmap makes up one pixel in the corresponding integer heatmap. Besides, we transfer the offset regression problem to an interval classification task, and CSC regards the confidence of the pixel as the probability of the interval. Meanwhile, CSC applying the distribution loss leverage the soft labels generated from the Gaussian distribution function to guide the offset heatmap training, which makes it easier to learn the distribution of coordinate offsets. Extensive experiments on challenging benchmark datasets demonstrate that our HIH can achieve state-of-the-art results. In particular, our HIH reaches 4.08 NME (Normalized Mean Error) on WFLW, and 3.21 on COFW, which exceeds previous methods by a significant margin.

preprint2022arXiv

Image Magnification Network for Vessel Segmentation in OCTA Images

Optical coherence tomography angiography (OCTA) is a novel non-invasive imaging modality that allows micron-level resolution to visualize the retinal microvasculature. The retinal vessel segmentation in OCTA images is still an open problem, and especially the thin and dense structure of the capillary plexus is an important challenge of this problem. In this work, we propose a novel image magnification network (IMN) for vessel segmentation in OCTA images. Contrary to the U-Net structure with a down-sampling encoder and up-sampling decoder, the proposed IMN adopts the design of up-sampling encoding and then down-sampling decoding. This design is to capture more low-level image details to reduce the omission of small structures. The experimental results on three open OCTA datasets show that the proposed IMN with an average dice score of 90.2% achieves the best performance in vessel segmentation of OCTA images. Besides, we also demonstrate the superior performance of IMN in cross-field image vessel segmentation and vessel skeleton extraction.

preprint2022arXiv

Improving Transferability for Domain Adaptive Detection Transformers

DETR-style detectors stand out amongst in-domain scenarios, but their properties in domain shift settings are under-explored. This paper aims to build a simple but effective baseline with a DETR-style detector on domain shift settings based on two findings. For one, mitigating the domain shift on the backbone and the decoder output features excels in getting favorable results. For another, advanced domain alignment methods in both parts further enhance the performance. Thus, we propose the Object-Aware Alignment (OAA) module and the Optimal Transport based Alignment (OTA) module to achieve comprehensive domain alignment on the outputs of the backbone and the detector. The OAA module aligns the foreground regions identified by pseudo-labels in the backbone outputs, leading to domain-invariant based features. The OTA module utilizes sliced Wasserstein distance to maximize the retention of location information while minimizing the domain gap in the decoder outputs. We implement the findings and the alignment modules into our adaptation method, and it benchmarks the DETR-style detector on the domain shift settings. Experiments on various domain adaptive scenarios validate the effectiveness of our method.

preprint2022arXiv

Label Adversarial Learning for Skeleton-level to Pixel-level Adjustable Vessel Segmentation

You can have your cake and eat it too. Microvessel segmentation in optical coherence tomography angiography (OCTA) images remains challenging. Skeleton-level segmentation shows clear topology but without diameter information, while pixel-level segmentation shows a clear caliber but low topology. To close this gap, we propose a novel label adversarial learning (LAL) for skeleton-level to pixel-level adjustable vessel segmentation. LAL mainly consists of two designs: a label adversarial loss and an embeddable adjustment layer. The label adversarial loss establishes an adversarial relationship between the two label supervisions, while the adjustment layer adjusts the network parameters to match the different adversarial weights. Such a design can efficiently capture the variation between the two supervisions, making the segmentation continuous and tunable. This continuous process allows us to recommend high-quality vessel segmentation with clear caliber and topology. Experimental results show that our results outperform manual annotations of current public datasets and conventional filtering effects. Furthermore, such a continuous process can also be used to generate an uncertainty map representing weak vessel boundaries and noise.

preprint2022arXiv

MixFormer: Mixing Features across Windows and Dimensions

While local-window self-attention performs notably in vision tasks, it suffers from limited receptive field and weak modeling capability issues. This is mainly because it performs self-attention within non-overlapped windows and shares weights on the channel dimension. We propose MixFormer to find a solution. First, we combine local-window self-attention with depth-wise convolution in a parallel design, modeling cross-window connections to enlarge the receptive fields. Second, we propose bi-directional interactions across branches to provide complementary clues in the channel and spatial dimensions. These two designs are integrated to achieve efficient feature mixing among windows and dimensions. Our MixFormer provides competitive results on image classification with EfficientNet and shows better results than RegNet and Swin Transformer. Performance in downstream tasks outperforms its alternatives by significant margins with less computational costs in 5 dense prediction tasks on MS COCO, ADE20k, and LVIS. Code is available at \url{https://github.com/PaddlePaddle/PaddleClas}.

preprint2022arXiv

The consistent behavior of negative Poissons ratio with interlayer interactions

Negative Poissons ratio (NPR) is of great interest due to the novel applications in lots of fields. Films are the most commonly used form in practical applications, which involves multiple layers. However, the effect of interlayer interactions on the NPR is still unclear. In this study, based on first principles calculations, we systematically investigate the effect of interlayer interactions on the NPR by comparably studying single-layer graphene, few-layer graphene, h-BN, and graphene-BN heterostructure. It is found that they almost have the same geometry-strain response. Consequently, the NPR in bilayer graphene, triple-layer graphene, and graphene-BN heterostructure are consistent with that in single-layer graphene and h-BN. The fundamental mechanism lies in that the response to strain of the orbital coupling are consistent under the effect of interlayer interactions. The deep understanding of the NPR with the effect of interlayer interactions as achieved in this study is beneficial for the future design and development of micro-/nanoscale electromechanical devices with novel functions based on nanostructures.

preprint2021arXiv

G-MIND: An End-to-End Multimodal Imaging-Genetics Framework for Biomarker Identification and Disease Classification

We propose a novel deep neural network architecture to integrate imaging and genetics data, as guided by diagnosis, that provides interpretable biomarkers. Our model consists of an encoder, a decoder and a classifier. The encoder learns a non-linear subspace shared between the input data modalities. The classifier and the decoder act as regularizers to ensure that the low-dimensional encoding captures predictive differences between patients and controls. We use a learnable dropout layer to extract interpretable biomarkers from the data, and our unique training strategy can easily accommodate missing data modalities across subjects. We have evaluated our model on a population study of schizophrenia that includes two functional MRI (fMRI) paradigms and Single Nucleotide Polymorphism (SNP) data. Using 10-fold cross validation, we demonstrate that our model achieves better classification accuracy than baseline methods, and that this performance generalizes to a second dataset collected at a different site. In an exploratory analysis we further show that the biomarkers identified by our model are closely associated with the well-documented deficits in schizophrenia.

preprint2021arXiv

Gauge invariant canonical symplectic algorithms for real-time lattice strong-field quantum electrodynamics

A class of high-order canonical symplectic structure-preserving geometric algorithms are developed for high-quality simulations of the quantized Dirac-Maxwell theory based strong-field quantum electrodynamics (SFQED) and relativistic quantum plasmas (RQP) phenomena. The Lagrangian density of an interacting bispinor-gauge fields theory is constructed in a conjugate real fields form. The canonical symplectic form and canonical equations of this field theory are obtained by the general Hamilton's principle on cotangent bundle. Based on discrete exterior calculus, the gauge field components are discreted to form a cochain complex, and the bispinor components are naturally discreted on a staggered dual lattice as combinations of differential forms. With pull-back and push-forward gauge covariant derivatives, the discrete action is gauge invariant. A well-defined discrete canonical Poisson bracket generates a semi-discrete lattice canonical field theory (LCFT), which admits the canonical symplectic form, unitary property, gauge symmetry and discrete Poincaré subgroup. The Hamiltonian splitting method, Cayley transformation and symmetric composition technique are introduced to construct a class of high-order numerical schemes. These schemes involve two degenerate fermion flavors and are locally unconditional stable, which also preserve the geometric structures. Equipped with statistically quantization-equivalent ensemble models of the Dirac vacuum and non-trivial plasma backgrounds, the schemes are expected to have excellent performance in secular simulations of relativistic quantum effects. The algorithms are verified in detail by numerical energy spectra. Real-time LCFT simulations are successfully implemented for the nonlinear Schwinger mechanism induced $e$-$e^+$ pairs creation and vacuum Kerr effect, which open a new door toward high-quality simulations in SFQED and RQP.

preprint2020arXiv

Compact Global Descriptor for Neural Networks

Long-range dependencies modeling, widely used in capturing spatiotemporal correlation, has shown to be effective in CNN dominated computer vision tasks. Yet neither stacks of convolutional operations to enlarge receptive fields nor recent nonlocal modules is computationally efficient. In this paper, we present a generic family of lightweight global descriptors for modeling the interactions between positions across different dimensions (e.g., channels, frames). This descriptor enables subsequent convolutions to access the informative global features with negligible computational complexity and parameters. Benchmark experiments show that the proposed method can complete state-of-the-art long-range mechanisms with a significant reduction in extra computing cost. Code available at https://github.com/HolmesShuan/Compact-Global-Descriptor.

preprint2020arXiv

Fixed-Time Cooperative Tracking Control for Double-Integrator Multi-Agent Systems: A Time-Based Generator Approach

In this paper, both the fixed-time distributed consensus tracking and the fixed-time distributed average tracking problems for double-integrator-type multi-agent systems with bounded input disturbances are studied, respectively. Firstly, a new practical robust fixed-time sliding mode control method based on the time-based generator is proposed. Secondly, a fixed-time distributed consensus tracking observer for double-integrator-type multi-agent systems is designed to estimate the state disagreements between the leader and the followers under undirected and directed communication, respectively. Thirdly, a fixed-time distributed average tracking observer for double-integrator-type multi-agent systems is designed to measure the average value of reference signals under undirected communication. Note that both the observers for the distributed consensus tracking and the distributed average tracking are devised based on time-based generators and can be extended to that of high-order multi-agent systems trivially. Furthermore, by combing the fixed-time sliding mode control with the fixed-time observers, the fixed-time controllers are designed to solve the distributed consensus tracking and the distributed average tracking problems. Finally, a few numerical simulations are shown to verify the results.

preprint2020arXiv

Simulation of Skin Stretching around the Forehead Wrinkles in Rhytidectomy

Objective: Skin stretching around the forehead wrinkles is an important method in rhytidectomy. Proper parameters are required to evaluate the surgical effect. In this paper, a simulation method was proposed to obtain the parameters. Methods: Three-dimensional point cloud data with a resolution of 50 μm were employed. First, a smooth supporting contour under the wrinkled forehead was generated via b-spline interpolation and extrapolation to constrain the deformation of the wrinkled zone. Then, based on the vector formed intrinsic finite element (VFIFE) algorithm, the simulation was implemented in Matlab for the deformation of wrinkled forehead skin in the stretching process. Finally, the stress distribution and the residual wrinkles of forehead skin were employed to evaluate the surgical effect. Results: Although the residual wrinkles are similar when forehead wrinkles are finitely stretched, their stress distribution changes greatly. This indicates that the stress distribution in the skin is effective to evaluate the surgical effect, and the forehead wrinkles are easily to be overstretched, which may lead to potential skin injuries. Conclusion: The simulation method can predict stress distribution and residual wrinkles after forehead wrinkle stretching surgery, which can be potentially used to control the surgical process and further reduce risks of skin injury.

preprint2020arXiv

SpatialFlow: Bridging All Tasks for Panoptic Segmentation

Object location is fundamental to panoptic segmentation as it is related to all things and stuff in the image scene. Knowing the locations of objects in the image provides clues for segmenting and helps the network better understand the scene. How to integrate object location in both thing and stuff segmentation is a crucial problem. In this paper, we propose spatial information flows to achieve this objective. The flows can bridge all sub-tasks in panoptic segmentation by delivering the object's spatial context from the box regression task to others. More importantly, we design four parallel sub-networks to get a preferable adaptation of object spatial information in sub-tasks. Upon the sub-networks and the flows, we present a location-aware and unified framework for panoptic segmentation, denoted as SpatialFlow. We perform a detailed ablation study on each component and conduct extensive experiments to prove the effectiveness of SpatialFlow. Furthermore, we achieve state-of-the-art results, which are $47.9$ PQ and $62.5$ PQ respectively on MS-COCO and Cityscapes panoptic benchmarks. Code will be available at https://github.com/chensnathan/SpatialFlow.