Searcharxiv⌕ Search

arXiv subjects

Yang Shen

Publications and source records attributed to Yang Shen.

At least 73 records · Page 4Linked to original sources
arXiv2025

Differentiation of Distinct Single Atoms via Multi-Defocus Fusion Method

High-angle annular dark-field scanning transmission electron microscopy (HAADF-STEM) is a vital tool for characterizing single-atom catalysts (SACs). However, reliable elemental identification of different atoms remains challenging because the signal intensity of HAADF depends strongly on defocus and other imaging parameters, potentially ruining the Z-contrast of atoms at different depths. In this work, we investigated the influence of the vertical position of atoms (defocus), support thickness, interatomic height, convergence and collection angles via multi-slice simulations on a model system of Fe/Pt atoms on amorphous carbon supports. Our calculation shows that at a convergence angle of 28 mrad, a defocus of 4.6 nm can cause Fe and Pt atoms indistinguishable. At a larger convergence angle, this critical indistinguishable defocus can be even shorter. To address this limitation, we propose a Multi-Defocus Fusion (MDF) method, retrieving the Z-contrast from serial images from multiple defocus. Experimental validation on a Fe/Pt SAC sample confirms the effectiveness of MDF, yielding clearly separated intensity histograms corresponding to Fe and Pt atoms. This work presents a robust, easy-to-implement strategy for accurate single-atom identification, offering valuable guidance for the accelerated screening and rational design of high-performance SACs.

cond-mat.mtrl-sci↗
arXiv2025

Why the hyperbolic polaritons are hyperbolic?

Polaritons travelling along a hyperbolic medium's surface have recently sparked significant interest in nanophotonics for the unprecedented manipulation ability on light at the nanoscale in a planar way, promising potential nano-optical applications, especially in two-dimensional circuitry. Despite of being named hyperbolic polaritons, the hyperbolic nature has not been thoroughly revealed since an analytical description of the Iso-frequency contour is still elusive. In this work, we proposed an analytical form for describing the iso-frequency contour of the hyperbolic polaritons, showcasing their strictly hyperbolic nature. Such an analytical form is obtained based on the focusing behavior of the hyperbolic polaritons and verified by both the published data from commonly used hyperbolic media systems of the hyperbolic polaritons and our own experimental characterizations on a hyperbolic metamaterial film. By presenting a concise and intuitive physical image, this work may provide a groundbreaking methodology in developing novel hyperbolic polaritons based optical devices.

physics.optics↗
arXiv2025

Tinkering Against Scaling

The ascent of scaling in artificial intelligence research has revolutionized the field over the past decade, yet it presents significant challenges for academic researchers, particularly in computational social science and critical algorithm studies. The dominance of large language models, characterized by their extensive parameters and costly training processes, creates a disparity where only industry-affiliated researchers can access these resources. This imbalance restricts academic researchers from fully understanding their tools, leading to issues like reproducibility in computational social science and a reliance on black-box metaphors in critical studies. To address these challenges, we propose a "tinkering" approach that is inspired by existing works. This method involves engaging with smaller models or components that are manageable for ordinary researchers, fostering hands-on interaction with algorithms. We argue that tinkering is both a way of making and knowing for computational social science and a way of knowing for critical studies, and fundamentally, it is a way of caring that has broader implications for both fields.

cs.CY↗
arXiv2025

Decentralized Handover Parameter Optimization with MARL for Load Balancing in 5G Networks

In cellular networks, cell handover refers to the process where a device switches from one base station to another, and this mechanism is crucial for balancing the load among different cells. Traditionally, engineers would manually adjust parameters based on experience. However, the explosive growth in the number of cells has rendered manual tuning impractical. Existing research tends to overlook critical engineering details in order to simplify handover problems. In this paper, we classify cell handover into three types, and jointly model their mutual influence. To achieve load balancing, we propose a multi-agent-reinforcement-learning (MARL)-based scheme to automatically optimize the parameters. To reduce the agent interaction costs, a distributed training is implemented based on consensus approximation of global average load, and it is shown that the approximation error is bounded. Experimental results show that our proposed scheme outperforms existing benchmarks in balancing load and improving network performance.

cs.NI↗
arXiv2025

Efficient Token Compression for Vision Transformer with Spatial Information Preserved

Token compression is essential for reducing the computational and memory requirements of transformer models, enabling their deployment in resource-constrained environments. In this work, we propose an efficient and hardware-compatible token compression method called Prune and Merge. Our approach integrates token pruning and merging operations within transformer models to achieve layer-wise token compression. By introducing trainable merge and reconstruct matrices and utilizing shortcut connections, we efficiently merge tokens while preserving important information and enabling the restoration of pruned tokens. Additionally, we introduce a novel gradient-weighted attention scoring mechanism that computes token importance scores during the training phase, eliminating the need for separate computations during inference and enhancing compression efficiency. We also leverage gradient information to capture the global impact of tokens and automatically identify optimal compression structures. Extensive experiments on the ImageNet-1k and ADE20K datasets validate the effectiveness of our approach, achieving significant speed-ups with minimal accuracy degradation compared to state-of-the-art methods. For instance, on DeiT-Small, we achieve a 1.64$\times$ speed-up with only a 0.2\% drop in accuracy on ImageNet-1k. Moreover, by compressing segmenter models and comparing with existing methods, we demonstrate the superior performance of our approach in terms of efficiency and effectiveness. Code and models have been made available at https://github.com/NUST-Machine-Intelligence-Laboratory/prune_and_merge.

cs.CV↗
arXiv2025

LatexBlend: Scaling Multi-concept Customized Generation with Latent Textual Blending

Customized text-to-image generation renders user-specified concepts into novel contexts based on textual prompts. Scaling the number of concepts in customized generation meets a broader demand for user creation, whereas existing methods face challenges with generation quality and computational efficiency. In this paper, we propose LaTexBlend, a novel framework for effectively and efficiently scaling multi-concept customized generation. The core idea of LaTexBlend is to represent single concepts and blend multiple concepts within a Latent Textual space, which is positioned after the text encoder and a linear projection. LaTexBlend customizes each concept individually, storing them in a concept bank with a compact representation of latent textual features that captures sufficient concept information to ensure high fidelity. At inference, concepts from the bank can be freely and seamlessly combined in the latent textual space, offering two key merits for multi-concept generation: 1) excellent scalability, and 2) significant reduction of denoising deviation, preserving coherent layouts. Extensive experiments demonstrate that LaTexBlend can flexibly integrate multiple customized concepts with harmonious structures and high subject fidelity, substantially outperforming baselines in both generation quality and computational efficiency. Our code will be publicly available.

cs.CV↗
arXiv2025

Multi-Agent Coordination across Diverse Applications: A Survey

Multi-agent coordination studies the underlying mechanism enabling the trending spread of diverse multi-agent systems (MAS) and has received increasing attention, driven by the expansion of emerging applications and rapid AI advances. This survey outlines the current state of coordination research across applications through a unified understanding that answers four fundamental coordination questions: (1) what is coordination; (2) why coordination; (3) who to coordinate with; and (4) how to coordinate. Our purpose is to explore existing ideas and expertise in coordination and their connections across diverse applications, while identifying and highlighting emerging and promising research directions. First, general coordination problems that are essential to varied applications are identified and analyzed. Second, a number of MAS applications are surveyed, ranging from widely studied domains, e.g., search and rescue, warehouse automation and logistics, and transportation systems, to emerging fields including humanoid and anthropomorphic robots, satellite systems, and large language models (LLMs). Finally, open challenges about the scalability, heterogeneity, and learning mechanisms of MAS are analyzed and discussed. In particular, we identify the hybridization of hierarchical and decentralized coordination, human-MAS coordination, and LLM-based MAS as promising future directions.

cs.MA↗
arXiv2024

Penrose transformation on flag domains

Building on our recent work, we construct the Penrose transformations of the cohomology groups of homogeneous line bundles on flag domains $D = G_\R / T$, where $G_\R$ is of Hermitian type. We provide sufficient conditions for the injectivity of the Penrose transformation and identify conditions under which the Penrose transformation of the automorphic cohomology groups on compact quotients of flag domains is an isomorphism. Finally, we prove that the higher automorphic cohomology groups of certain homogeneous line bundles are isomorphic to the groups of automorphic forms on the Hermitian symmetric domain, and we apply this result to the cup products of the automorphic cohomology groups.

math.AG↗
arXiv2024

Customized Generation Reimagined: Fidelity and Editability Harmonized

Customized generation aims to incorporate a novel concept into a pre-trained text-to-image model, enabling new generations of the concept in novel contexts guided by textual prompts. However, customized generation suffers from an inherent trade-off between concept fidelity and editability, i.e., between precisely modeling the concept and faithfully adhering to the prompts. Previous methods reluctantly seek a compromise and struggle to achieve both high concept fidelity and ideal prompt alignment simultaneously. In this paper, we propose a Divide, Conquer, then Integrate (DCI) framework, which performs a surgical adjustment in the early stage of denoising to liberate the fine-tuned model from the fidelity-editability trade-off at inference. The two conflicting components in the trade-off are decoupled and individually conquered by two collaborative branches, which are then selectively integrated to preserve high concept fidelity while achieving faithful prompt adherence. To obtain a better fine-tuned model, we introduce an Image-specific Context Optimization} (ICO) strategy for model customization. ICO replaces manual prompt templates with learnable image-specific contexts, providing an adaptive and precise fine-tuning direction to promote the overall performance. Extensive experiments demonstrate the effectiveness of our method in reconciling the fidelity-editability trade-off.

cs.CV↗
arXiv2024

Numerical study of bi-layer two-orbital model for La$_{3}$Ni$_{2}$O$_{7}$ on a plaquette ladder

The recently discovered high-$T_c$ superconductivity in La$_{3}$Ni$_{2}$O$_{7}$ with $T_c \approx 80K$ provides another intriguing platform to explore the microscopic mechanism of unconventional superconductivity. In this work, we study a previously proposed bi-layer two-orbital model Hamiltonian for La$_{3}$Ni$_{2}$O$_{7}$ [Y. Shen, et al, Chinese Physics Letters 40, 127401 (2023)] on a plaquette ladder, which is a minimum setup with two-dimensional characteristic. We employ large-scale Density Matrix Renormalization Group calculations to accurately determine the ground state of the model. We determine the density, magnetic structure, and the pairing property of the model. We find that with large effective inter-layer anti-ferromagnetic exchange for the 3$d_{z^2}$ orbital, both spin, charge, and pairing correlation display quasi-long-range behavior, which could be viewed as a precursor of possible true long-range order in the two dimensional limit. Interestingly, sign oscillation for the pairing correlation are observed for both the 3$d_{x^2-y^2}$ and 3$d_{z^2}$ orbitals, indicating the presence of possible pair density wave in the system. Even though we only study the model on a quasi one-dimensional plaquette ladder geometry due to the computational difficulty, the results on the spin, charge, and pairing correlation provide valuable insight in the clarification of the properties of La$_{3}$Ni$_{2}$O$_{7}$ in the future.

cond-mat.str-el↗
arXiv2024

Equivariant Blurring Diffusion for Hierarchical Molecular Conformer Generation

How can diffusion models process 3D geometries in a coarse-to-fine manner, akin to our multiscale view of the world? In this paper, we address the question by focusing on a fundamental biochemical problem of generating 3D molecular conformers conditioned on molecular graphs in a multiscale manner. Our approach consists of two hierarchical stages: i) generation of coarse-grained fragment-level 3D structure from the molecular graph, and ii) generation of fine atomic details from the coarse-grained approximated structure while allowing the latter to be adjusted simultaneously. For the challenging second stage, which demands preserving coarse-grained information while ensuring SE(3) equivariance, we introduce a novel generative model termed Equivariant Blurring Diffusion (EBD), which defines a forward process that moves towards the fragment-level coarse-grained structure by blurring the fine atomic details of conformers, and a reverse process that performs the opposite operation using equivariant networks. We demonstrate the effectiveness of EBD by geometric and chemical comparison to state-of-the-art denoising diffusion models on a benchmark of drug-like molecules. Ablation studies draw insights on the design of EBD by thoroughly analyzing its architecture, which includes the design of the loss function and the data corruption process. Codes are released at https://github.com/Shen-Lab/EBD .

cs.LG↗
arXiv2024

Frequency-dependent squeezing via Einstein-Podolsky-Rosen entanglement based on silicon nitride microring resonators

Significant efforts have been made to enhance the performance of displacement sensors limited by quantum noise, such as gravitational wave detectors. Techniques like frequency-dependent squeezing have overcome the standard quantum limit in optomechanical force measurements, leading to substantial overall progress. These advancements, coupled with major developments in integrated photonics, have paved the way for the emergence of integrated Kerr quantum frequency combs (QFCs). A platform has been established for designing EPR entangled quantum frequency combs using on-chip silicon nitride microring resonators, enabling thorough analysis and optimization of entanglement performance, as well as effective noise reduction adjustments. This platform, incorporating the quantum dynamics of Kerr nonlinear microresonators, supports at least 12 continuous-variable quantum modes in the form of 6 simultaneous two-mode squeezed pairs (EPR entangled pairs). Additionally, by selecting the detection angle of the idler mode, a single-mode squeezed state is generated in the signal mode. Given the frequency-dependent nature of the detection angle, frequency-dependent squeezing is achieved. A comparative analysis of the results under different dispersion conditions is also conducted.

quant-ph↗
arXiv2024

Risk Aggregation and Allocation in the Presence of Systematic Risk via Stable Laws

In order to properly manage risk, practitioners must understand the aggregate risks they are exposed to. Additionally, to properly price policies and calculate bonuses the relative riskiness of individual business units must be well understood. Certainly, Insurers and Financiers are interested in the properties of the sums of the risks they are exposed to and the dependence of risks therein. Realistic risk models however must account for a variety of phenomena: ill-defined moments, lack of elliptical dependence structures, excess kurtosis and highly heterogeneous marginals. Equally important is the concern over industry-wide systematic risks that can affect multiple business lines at once. Many techniques of varying sophistication have been developed with all or some of these problems in mind. We propose a modification to the classical individual risk model that allows us to model company-wide losses via the class of Multivariate Stable Distributions. Stable Distributions incorporate many of the unpleasant features required for a realistic risk model while maintaining tractable aggregation and dependence results. We additionally compute the Tail Conditional Expectation of aggregate risks within the model and the corresponding allocations.

q-fin.RM↗
arXiv2024

Stochastic Loss Reserving: Dependence and Estimation

Nowadays insurers have to account for potentially complex dependence between risks. In the field of loss reserving, there are many parametric and non-parametric models attempting to capture dependence between business lines. One common approach has been to use additive background risk models (ABRMs) which provide rich and interpretable dependence structures via a common shock model. Unfortunately, ABRMs are often restrictive. Models that capture necessary features may have impractical to estimate parameters. For example models without a closed-form likelihood function for lack of a probability density function (e.g. some Tweedie, Stable Distributions, etc). We apply a modification of the continuous generalised method of moments (CGMM) of [Carrasco and Florens, 2000] which delivers comparable estimators to the MLE to loss reserving. We examine models such as the one proposed by [Avanzi et al., 2016] and a related but novel one derived from the stable family of distributions. Our CGMM method of estimation provides conventional non-Bayesian estimates in the case where MLEs are impractical.

stat.ME↗
arXiv2024

Geometric Pooling: maintaining more useful information

Graph Pooling technology plays an important role in graph node classification tasks. Sorting pooling technologies maintain large-value units for pooling graphs of varying sizes. However, by analyzing the statistical characteristic of activated units after pooling, we found that a large number of units dropped by sorting pooling are negative-value units that contain useful information and can contribute considerably to the final decision. To maintain more useful information, a novel pooling technology, called Geometric Pooling (GP), was proposed to contain the unique node features with negative values by measuring the similarity of all node features. We reveal the effectiveness of GP from the entropy reduction view. The experiments were conducted on TUdatasets to show the effectiveness of GP. The results showed that the proposed GP outperforms the SOTA graph pooling technologies by 1%\sim5% with fewer parameters.

cs.CV↗
arXiv2024

Demonstration of a variational quantum eigensolver with a solid-state spin system under ambient conditions

Quantum simulators offer the potential to utilize the quantum nature of a physical system to study another physical system. In contrast to conventional simulation, which experiences an exponential increase in computational complexity, quantum simulation cost increases only linearly with increasing size of the problem, rendering it a promising tool for applications in quantum chemistry. The variational-quantum-eigensolver algorithm is a particularly promising application for investigating molecular electronic structures. For its experimental implementation, spin-based solid-state qubits have the advantage of long decoherence time and high-fidelity quantum gates, which can lead to high accuracy in the ground-state finding. This study uses the nitrogen-vacancy-center system in diamond to implement the variational-quantum-eigensolver algorithm and successfully finds the eigenvalue of a specific Hamiltonian without the need for error-mitigation techniques. With a fidelity of 98.9% between the converged state and the ideal eigenstate, the demonstration provides an important step toward realizing a scalable quantum simulator in solid-state spin systems.

quant-ph↗
arXiv2024

Robust optimal investment and consumption strategies with portfolio constraints and stochastic environment

We investigate a continuous-time investment-consumption problem with model uncertainty in a general diffusion-based market with random model coefficients. We assume that a power utility investor is ambiguity-averse, with the preference to robustness captured by the homothetic multiplier robust specification, and the investor's investment and consumption strategies are constrained to closed convex sets. To solve this constrained robust control problem, we employ the stochastic Hamilton-Jacobi-Bellman-Isaacs equations, backward stochastic differential equations, and bounded mean oscillation martingale theory. Furthermore, we show the investor incurs (non-negative) utility loss, i.e. the loss in welfare, if model uncertainty is ignored. When the model coefficients are deterministic, we establish formally the relationship between the investor's robustness preference and the robust optimal investment-consumption strategy and the value function, and the impact of investment and consumption constraints on the investor's robust optimal investment-consumption strategy and value function. Extensive numerical experiments highlight the significant impact of ambiguity aversion, consumption and investment constraints, on the investor's robust optimal investment-consumption strategy, utility loss, and value function. Key findings include: 1) short-selling restriction always reduces the investor's utility loss when model uncertainty is ignored; 2) the effect of consumption constraints on utility loss is more delicate and relies on the investor's risk aversion level.

q-fin.PM↗