SearcharxivSearch

arXiv subjects

Shuang Gao

Publications and source records attributed to Shuang Gao.

At least 19 recordsLinked to original sources

Rare Earth Ion Coupling Implements Attention-Like Reservoir Computing

We present a physical computing paradigm that harnesses the intrinsic nonlinear dynamics of rare earth doped core shell nanoparticles as a computational substrate. By directly exploiting cross relaxation and energy transfer upconversion processes, the system realizes a state dependent transfer function whose effective decay rate evolves with the instantaneous Er3+ population, which mathematically analogous to gating and attention mechanisms in recurrent neural networks. The three spectrally resolved emission channels inherently span disparate timescales, endowing the reservoir with native multitimescale feature extraction without auxiliary engineering. Under the reservoir computing framework, the coupled three channel system achieves a total memory capacity exceeding fourfold that of a single ion reservoir; capacity decomposition further reveals that the nonzero cross memory capacity is a direct signature of many body Tm3+@Er3+ coupling. On the Mackey Glass and Santa Fe chaotic benchmarks, the system attains normalized mean squared errors of 1.2x10-3 and 2.1x10-2, respectively, with only 125 virtual nodes. These results establish rare earth nanoparticles as a compelling platform for compact and hardware integrable neuromorphic computing, and introduce "inward evolution", the deliberate exploitation of intra material quantum dynamics, as a generalizable design principle for next generation physical computing systems.

physics.optics

A Decomposition Method for LQ Conditional McKean-Vlasov Control Problems with Random Coefficients

We propose a decomposition method for solving a general class of linear-quadratic (LQ) McKean-Vlasov control problems involving conditional expectations and random coefficients, where the system dynamics are driven by two independent Wiener processes. Unlike existing approaches in the literature for these problems, such as the extended stochastic maximum principle and the extended dynamic programming methods, which often involve additional technical complexities and sometimes impose restrictive conditions on control inputs, our approach decomposes the original McKean-Vlasov control problem into two decoupled stochastic optimal control problems, one of which has a constrained admissible control set. These auxiliary problems can be solved using classical methods. We establish an equivalence between the well-posedness and solvability of the auxiliary problems and those of the original problem, and show that the sum of the optimal controls of the auxiliary problems yields the optimal control of the original problem. Moreover, by applying a variational method, we characterize the optimal solution to the McKean-Vlasov control problem via two decoupled sets of (non-McKean-Vlasov) linear forward-backward stochastic differential equations, each corresponding to one of the auxiliary problems. Finally, we show that standard dynamic programming can also be applied to solve the resulting auxiliary problems.

math.OC

Price-Coordinated Mean Field Games with State Augmentation for Decentralized Battery Charging

This paper addresses the decentralized coordinated charging problem for a large population of battery storage agents (e.g. residential batteries, electrical vehicles, charging station batteries) using Mean Field Game (MFG). Agents are assumed to have affine dynamics and are coupled through a price that is continuous and monotonically increasing with respect to the difference between the average charging power and the grid's desired average charging power. An important modeling feature of the proposed framework is the state augmentation, that is, the charging power is treated as a state variable and its rate of change (i.e. the ramp rate) as the control input. The resulting MFG equilibrium is characterized by two nonlinearly coupled forward-backward differential equations. The existence and uniqueness of the MFG equilibrium is established for any continuous and monotonically increasing nonlinear price function without additional restrictions on the time horizon. Moreover, in the special case where the price is affine in the average charging power, we further simplify the characterization of the MFG equilibrium strategy via two separate Riccati equations, both of which admit unique positive semi-definite solutions without additional assumptions.

eess.SY

Transmission Neural Networks: Inhibitory and Excitatory Connections

This paper extends the Transmission Neural Network model proposed by Gao and Caines in [1]-[3] to incorporate inhibitory connections and neurotransmitter populations. The extended network model contains binary neuronal states, transmission dynamics, and inhibitory and excitatory connections. Under technical assumptions, we establish the characterization of the firing probabilities of neurons, and show that such a characterization considering inhibitions can be equivalently represented by a neural network where each neuron has a continuous state of dimension 2. Moreover, we incorporated neurotransmitter populations into the modeling and establish the limit network model when the number of neurotransmitters at all synaptic connections go to infinity. Finally, sufficient conditions for stability and contraction properties of the limit network model are established.

cs.SI

Discrete-time linear quadratic stochastic control with equality-constrained inputs: Application to energy demand response

We investigate the discrete-time stochastic linear quadratic control problem for a population of cooperative agents under the hard equality constraint on total control inputs, motivated by demand response in renewable energy systems. We establish the optimal solution that respects hard equality constraints for systems with additive noise in the dynamics. The optimal control law is derived using dynamic programming and Karush-Kuhn-Tucker (KKT) conditions, and the resulting control solution depends on a discrete-time Riccati-like recursive equation. Application examples of coordinating the charging of a network of residential batteries to absorb excess solar power generation are demonstrated, and the proposed control is shown to achieve exact power tracking while considering individual State-of-Charge (SoC) objectives

eess.SY

Data-Driven Network LQG Mean Field Games with Heterogeneous Populations via Integral Reinforcement Learning

This paper establishes a data-driven solution for infinite horizon linear quadratic Gaussian Mean Field Games with network-coupled heterogeneous agent populations where the dynamics of the agents are unknown. The solution technique relies on Integral Reinforcement Learning and Kleinman's iteration for solving algebraic Riccati equations (ARE). The resulting algorithm uses trajectory data to generate network-coupled MFG strategies for agents and does not require parameters of agents' dynamics. Under technical conditions on the persistency of excitation and on the existence of unique stabilizing solution to the corresponding AREs, the learned network-coupled MFG strategies are shown to converge to their true values.

eess.SY

Transmission Neural Networks: Approximate Receding Horizon Control for Virus Spread on Networks

Transmission Neural Networks (TransNNs) proposed by Gao and Caines (2022) serve as both virus spread models over networks and neural network models with tuneable activation functions. This paper establishes that TransNNs provide upper bounds on the infection probability generated from the associated Markovian stochastic Susceptible-Infected-Susceptible (SIS) model with 2^n state configurations where n is the number of nodes in the network, and can be employed as an approximate model for the latter. Based on such an approximation, a TransNN-based receding horizon control approach for mitigating virus spread is proposed and we demonstrate that it allows significant computational savings compared to the dynamic programming solution to Markovian SIS model with 2^n state configurations, as well as providing less conservative control actions compared to the TransNN-based optimal control. Finally, numerical comparisons among (a) dynamic programming solutions for the Markovian SIS model, (b) TransNN-based optimal control and (c) the proposed TransNN-based receding horizon control are presented.

eess.SY

Linear-Quadratic Graphon Mean Field Games with Common Noise

This paper studies linear quadratic graphon mean field games (LQ-GMFGs) with common noise, in which a large number of agents are coupled via a weighted undirected graph. One special feature, compared with the well-studied graphon mean field games, is that the states of agents are described by the dynamic systems with the idiosyncratic noises and common noise. The limit LQ-GMFGs with common noise are formulated based on the assumption that these graphs lie in a sequence converging to a limit graphon. By applying the spectral decomposition method, the existence of solution for the formulated limit LQ-GMFGs is derived. Moreover, based on the adequate convergence assumptions, a set of $ε$-Nash equilibrium strategies for the finite large population problem is constructed.

math.OC

Transmission Neural Networks: Approximation and Optimal Control

Transmission Neural Networks (TransNNs) introduced by Gao and Caines (2022) connect virus spread models over networks and neural networks with tuneable activation functions. This paper presents the approximation technique and the underlying assumptions employed by TransNNs in relation to the corresponding Markovian Susceptible-Infected-Susceptible (SIS) model with 2^n states, where n is the number of nodes in the network. The underlying infection paths are assumed to be stochastic with heterogeneous and time-varying transmission probabilities. We obtain the conditional probability of infection in the stochastic 2^n-state SIS epidemic model corresponding to each state configuration under mild assumptions, which enables control solutions based on Markov decision processes (MDP). Finally, MDP control with 2^n-state SIS epidemic models and optimal control with TransNNs are compared in terms of mitigating virus spread over networks through vaccination, and it is shown that TranNNs enable the generation of control laws with significant computational savings, albeit with more conservative control actions.

eess.SY

Linear Quadratic Mean Field Games with Quantile-Dependent Cost Coefficients

This paper studies a class of linear quadratic mean field games where the coefficients of quadratic cost functions depend on both the mean and the variance of the population's state distribution through its quantile function. Such a formulation allows for modelling agents that are sensitive to not only the population average but also the population variance. The corresponding mean field game equilibrium is identified, which involves solving two coupled differential equations: one is a Riccati equation and the other the variance evolution equation. Furthermore, the conditions for the existence and uniqueness of the mean field equilibrium are established. Finally, numerical results are presented to illustrate the behavior of two coupled differential equations and the performance of the mean field game solution.

math.OC

SGL: Structure Guidance Learning for Camera Localization

Camera localization is a classical computer vision task that serves various Artificial Intelligence and Robotics applications. With the rapid developments of Deep Neural Networks (DNNs), end-to-end visual localization methods are prosperous in recent years. In this work, we focus on the scene coordinate prediction ones and propose a network architecture named as Structure Guidance Learning (SGL) which utilizes the receptive branch and the structure branch to extract both high-level and low-level features to estimate the 3D coordinates. We design a confidence strategy to refine and filter the predicted 3D observations, which enables us to estimate the camera poses by employing the Perspective-n-Point (PnP) with RANSAC. In the training part, we design the Bundle Adjustment trainer to help the network fit the scenes better. Comparisons with some state-of-the-art (SOTA) methods and sufficient ablation experiments confirm the validity of our proposed architecture.

cs.CV

IH-ViT: Vision Transformer-based Integrated Circuit Appear-ance Defect Detection

For the problems of low recognition rate and slow recognition speed of traditional detection methods in IC appearance defect detection, we propose an IC appearance defect detection algo-rithm IH-ViT. Our proposed model takes advantage of the respective strengths of CNN and ViT to acquire image features from both local and global aspects, and finally fuses the two features for decision making to determine the class of defects, thus obtaining better accuracy of IC defect recognition. To address the problem that IC appearance defects are mainly reflected in the dif-ferences in details, which are difficult to identify by traditional algorithms, we improved the tra-ditional ViT by performing an additional convolution operation inside the batch. For the problem of information imbalance of samples due to diverse sources of data sets, we adopt a dual-channel image segmentation technique to further improve the accuracy of IC appearance defects. Finally, after testing, our proposed hybrid IH-ViT model achieved 72.51% accuracy, which is 2.8% and 6.06% higher than ResNet50 and ViT models alone. The proposed algorithm can quickly and accurately detect the defect status of IC appearance and effectively improve the productivity of IC packaging and testing companies.

cs.CV

A Real-Time Fusion Framework for Long-term Visual Localization

Visual localization is a fundamental task that regresses the 6 Degree Of Freedom (6DoF) poses with image features in order to serve the high precision localization requests in many robotics applications. Degenerate conditions like motion blur, illumination changes and environment variations place great challenges in this task. Fusion with additional information, such as sequential information and Inertial Measurement Unit (IMU) inputs, would greatly assist such problems. In this paper, we present an efficient client-server visual localization architecture that fuses global and local pose estimations to realize promising precision and efficiency. We include additional geometry hints in mapping and global pose regressing modules to improve the measurement quality. A loosely coupled fusion policy is adopted to leverage the computation complexity and accuracy. We conduct the evaluations on two typical open-source benchmarks, 4Seasons and OpenLORIS. Quantitative results prove that our framework has competitive performance with respect to other state-of-the-art visual localization solutions.

cs.CV

Fixed-Point Centrality for Networks

This paper proposes a family of network centralities called fixed-point centralities. This centrality family is defined via the fixed point of permutation equivariant mappings related to the underlying network. Such a centrality notion is immediately extended to define fixed-point centralities for infinite graphs characterized by graphons. Variation bounds of such centralities with respect to the variations of the underlying graphs and graphons under mild assumptions are established. Fixed-point centralities connect with a variety of different models on networks including graph neural networks, static and dynamic games on networks, and Markov decision processes.

eess.SY

Transmission Neural Networks: From Virus Spread Models to Neural Networks

This work connects models for virus spread on networks with their equivalent neural network representations. Based on this connection, we propose a new neural network architecture, called Transmission Neural Networks (TransNNs) where activation functions are primarily associated with links and are allowed to have different activation levels. Furthermore, this connection leads to the discovery and the derivation of three new activation functions with tunable or trainable parameters. Moreover, we prove that TransNNs with a single hidden layer and a fixed non-zero bias term are universal function approximators. Finally, we present new fundamental derivations of continuous time epidemic network models based on TransNNs.

cs.LG

Pose Refinement with Joint Optimization of Visual Points and Lines

High-precision camera re-localization technology in a pre-established 3D environment map is the basis for many tasks, such as Augmented Reality, Robotics and Autonomous Driving. The point-based visual re-localization approaches are well-developed in recent decades, but are insufficient in some feature-less cases. In this paper, we design a complete pipeline for camera pose refinement with points and lines, which contains the innovatively designed line extracting CNN named VLSE, the line matching and the pose optimization approaches. We adopt a novel line representation and customize a hybrid convolution block based on the Stacked Hourglass network, to detect accurate and stable line features on images. Then we apply a geometric-based strategy to obtain precise 2D-3D line correspondences using epipolar constraint and reprojection filtering. A following point-line joint cost function is constructed to optimize the camera pose with the initial coarse pose from the pure point-based localization. Sufficient experiments are conducted on open datasets, i.e, line extractor on Wireframe and YorkUrban, localization performance on InLoc duc1 and duc2, to confirm the effectiveness of our point-line joint pose optimization method.

cs.CV

Stationary Cost Nodes in Infinite Horizon LQG-GMFGs

An analysis of infinite horizon linear quadratic Gaussian (LQG) Mean Field Games is given within the general framework of Graphon Mean Field Games (GMFG) on dense infinite graphs (or networks) introduced in Caines and Huang (2018). For a class of LQG-GMFGs, analytical expressions are derived for the infinite horizon Nash values at the nodes of the infinite graph. Furthermore, under specific conditions on the network and the initial population means, it is shown that the nodes with strict local maximal infinite network degree are also nodes with strict local minimal cost at equilibrium.

eess.SY

Hardware-algorithm collaborative computing with photonic spiking neuron chip based on integrated Fabry-Pérot laser with saturable absorber

Photonic neuromorphic computing has emerged as a promising avenue toward building a low-latency and energy-efficient non-von-Neuman computing system. Photonic spiking neural network (PSNN) exploits brain-like spatiotemporal processing to realize high-performance neuromorphic computing. However, the nonlinear computation of PSNN remains a significant challenging. Here, we proposed and fabricated a photonic spiking neuron chip based on an integrated Fabry-Pérot laser with a saturable absorber (FP-SA) for the first time. The nonlinear neuron-like dynamics including temporal integration, threshold and spike generation, refractory period, and cascadability were experimentally demonstrated, which offers an indispensable fundamental building block to construct the PSNN hardware. Furthermore, we proposed time-multiplexed spike encoding to realize functional PSNN far beyond the hardware integration scale limit. PSNNs with single/cascaded photonic spiking neurons were experimentally demonstrated to realize hardware-algorithm collaborative computing, showing capability in performing classification tasks with supervised learning algorithm, which paves the way for multi-layer PSNN for solving complex tasks.

cs.ET