Searcharxiv⌕ Search

arXiv subjects

Zhen Liang

Publications and source records attributed to Zhen Liang.

46 records · Page 3Linked to original sources

Credit Assignment for Trained Neural Networks Based on Koopman Operator Theory

Credit assignment problem of neural networks refers to evaluating the credit of each network component to the final outputs. For an untrained neural network, approaches to tackling it have made great contributions to parameter update and model revolution during the training phase. This problem on trained neural networks receives rare attention, nevertheless, it plays an increasingly important role in neural network patch, specification and verification. Based on Koopman operator theory, this paper presents an alternative perspective of linear dynamics on dealing with the credit assignment problem for trained neural networks. Regarding a neural network as the composition of sub-dynamics series, we utilize step-delay embedding to capture snapshots of each component, characterizing the established mapping as exactly as possible. To circumvent the dimension-difference problem encountered during the embedding, a composition and decomposition of an auxiliary linear layer, termed minimal linear dimension alignment, is carefully designed with rigorous formal guarantee. Afterwards, each component is approximated by a Koopman operator and we derive the Jacobian matrix and its corresponding determinant, similar to backward propagation. Then, we can define a metric with algebraic interpretability for the credit assignment of each network component. Moreover, experiments conducted on typical neural networks demonstrate the effectiveness of the proposed method.

cs.LG↗

Safety Verification for Neural Networks Based on Set-boundary Analysis

Neural networks (NNs) are increasingly applied in safety-critical systems such as autonomous vehicles. However, they are fragile and are often ill-behaved. Consequently, their behaviors should undergo rigorous guarantees before deployment in practice. In this paper we propose a set-boundary reachability method to investigate the safety verification problem of NNs from a topological perspective. Given an NN with an input set and a safe set, the safety verification problem is to determine whether all outputs of the NN resulting from the input set fall within the safe set. In our method, the homeomorphism property of NNs is mainly exploited, which establishes a relationship mapping boundaries to boundaries. The exploitation of this property facilitates reachability computations via extracting subsets of the input set rather than the entire input set, thus controlling the wrapping effect in reachability analysis and facilitating the reduction of computation burdens for safety verification. The homeomorphism property exists in some widely used NNs such as invertible NNs. Notable representations are invertible residual networks (i-ResNets) and Neural ordinary differential equations (Neural ODEs). For these NNs, our set-boundary reachability method only needs to perform reachability analysis on the boundary of the input set. For NNs which do not feature this property with respect to the input set, we explore subsets of the input set for establishing the local homeomorphism property, and then abandon these subsets for reachability computations. Finally, some examples demonstrate the performance of the proposed method.

cs.AI↗

PR-PL: A Novel Transfer Learning Framework with Prototypical Representation based Pairwise Learning for EEG-Based Emotion Recognition

Affective brain-computer interfaces based on electroencephalography (EEG) is an important branch in the field of affective computing. However, individual differences and noisy labels seriously limit the effectiveness and generalizability of EEG-based emotion recognition models. In this paper, we propose a novel transfer learning framework with Prototypical Representation based Pairwise Learning (PR-PL) to learn discriminative and generalized prototypical representations for emotion revealing across individuals and formulate emotion recognition as pairwise learning for alleviating the reliance on precise label information. Extensive experiments are conducted on two benchmark databases under four cross-validation evaluation protocols (cross-subject cross-session, cross-subject within-session, within-subject cross-session, and within-subject within-session). The experimental results demonstrate the superiority of the proposed PR-PL against the state-of-the-arts under all four evaluation protocols, which shows the effectiveness and generalizability of PR-PL in dealing with the ambiguity of EEG responses in affective studies. The source code is available at https://github.com/KAZABANA/PR-PL.

cs.HC↗

Gap sequences and Topological properties of Bedford-McMullen sets

In this paper, we study the topological properties and the gap sequences of Bedford-McMullen sets. First, we introduce a topological condition, the component separation condition (CSC), and a geometric condition, the exponential rate condition (ERC). Then we prove that the CSC implies the ERC, and that both of them are sufficient conditions for obtaining the asymptotic estimate of gap sequences. We also explore topological properties of Bedford-McMullen sets and prove that all normal Bedford-McMullen sets with infinitely many connected components satisfy the CSC, from which we obtain the asymptotic estimate of the gap sequences of Bedford-McMullen sets without any restrictions. Finally, we apply our result to Lipschitz equivalence.

math-ph↗

EEGFuseNet: Hybrid Unsupervised Deep Feature Characterization and Fusion for High-Dimensional EEG with An Application to Emotion Recognition

How to effectively and efficiently extract valid and reliable features from high-dimensional electroencephalography (EEG), particularly how to fuse the spatial and temporal dynamic brain information into a better feature representation, is a critical issue in brain data analysis. Most current EEG studies work in a task driven manner and explore the valid EEG features with a supervised model, which would be limited by the given labels to a great extent. In this paper, we propose a practical hybrid unsupervised deep convolutional recurrent generative adversarial network based EEG feature characterization and fusion model, which is termed as EEGFuseNet. EEGFuseNet is trained in an unsupervised manner, and deep EEG features covering both spatial and temporal dynamics are automatically characterized. Comparing to the existing features, the characterized deep EEG features could be considered to be more generic and independent of any specific EEG task. The performance of the extracted deep and low-dimensional features by EEGFuseNet is carefully evaluated in an unsupervised emotion recognition application based on three public emotion databases. The results demonstrate the proposed EEGFuseNet is a robust and reliable model, which is easy to train and performs efficiently in the representation and fusion of dynamic EEG features. In particular, EEGFuseNet is established as an optimal unsupervised fusion model with promising cross-subject emotion recognition performance. It proves EEGFuseNet is capable of characterizing and fusing deep features that imply comparative cortical dynamic significance corresponding to the changing of different emotion states, and also demonstrates the possibility of realizing EEG based cross-subject emotion recognition in a pure unsupervised manner.

cs.HC↗

Construction and box dimension of recurrent fractal interpolation surfaces

In this paper, we present a general framework to construct recurrent fractal interpolation surfaces (RFISs) on rectangular grids. Then we introduce bilinear RFISs, which are easy to be generated while there are no restrictions on interpolation points and vertical scaling factors. We also obtain the box dimension of bilinear RFISs under certain constraints, where the main assumption is that vertical scaling factors have uniform sums under a compatible partition.

math.MG↗

Turaev Hyperbolicity of Classical and Virtual Knots

By work of W. Thurston, knots and links in the 3-sphere are known to either be torus links, or to contain an essential torus in their complement, or to be hyperbolic, in which case a unique hyperbolic volume can be calculated for their complement. We employ a construction of Turaev to associate a family of hyperbolic 3-manifolds of finite volume to any classical or virtual link, even if non-hyperbolic. These are in turn used to define the Turaev volume of a link, which is the minimal volume among all the hyperbolic 3-manifolds associated via this Turaev construction. In the case of a classical link, we can also define the classical Turaev volume, which is the minimal volume among all the hyperbolic 3-manifolds associated via this Turaev construction for the classical projections only. We then investigate these new invariants.

math.GT↗

Synergistic Effect of One- and Two-dimensional Connected Coral-like Li$_{6.25}$Al$_{0.25}$La$_3$Zr$_2$O$_{12}$ in PEO-Based Composite Solid State Electrolyte

As one of the most promising next-generation energy storage device, lithium metal batteries have been extensively investigated. However, the poor safety issue and undesired lithium dendrites growth hinder the development of lithium metal batteries. The application of solid state electrolytes has attracted increasing attention as they can solve the safety issue and partly inhibit the growth of lithium dendrites. Polyethylene oxide (PEO)-based electrolytes are very promising due to their enhanced safety and excellent flexibility. However, PEO-based electrolytes suffer from low ionic conductivity at room temperature and can't effectively inhibit lithium dendrites at high temperature due to the intrinsic semi-crystalline properties and poor mechanical strength. In this work, a novel coral-like Li6.25Al0.25La3Zr2O12 (LALZO) is synthesized to use as an active ceramic filler in PEO. The PEO with LALZO coral (PLC) exhibits increased ionic conductivity and mechanical strength, which leads to the uniform deposition/stripping of lithium metal. The Li symmetric cells with PLC cycle for 1500 h without short circuit at 50 centidegree. The assembled LiFePO4/PLC/Li batteries display excellent cycling stability at both 60 and 50 centidegree. This work reveals that the electrochemical properties of organic and inorganic composite electrolyte can be effectively improved by tuning the microstructure of the filler, such as the coral-like LALZO architecture.

physics.chem-ph↗

Perfect Seismic Wave Absorbers for the 8th Magnitude Earthquakes

Most modern buildings and infrastructures are not designed to resist 8th magnitude earthquakes, for which studies on phononic crystals and local resonators reported so far are not particularly suited. We report a type of all-metallic decorated membrane resonators as deep subwavelength vibration dampers, which are modeled as meta-soil, that can block and even totally absorb underground seismic waves up to 8th magnitude earthquakes. Transmission attenuation exceeding 20 dB and absorption up to 98 % are numerically demonstrated for 1 Hz Rayleigh waves by a dozen rows of vertical underground wells filled with the meta-soil. A scaling law in the same form as the mass density law for airborne acoustic waves has been analytically derived and numerically verified.

physics.app-ph↗

TG-Hyperbolicity of Virtual Links

We extend the theory of hyperbolicity of links in the 3-sphere to tg-hyperbolicity of virtual links, using the fact that the theory of virtual links can be translated into the theory of links living in closed orientable thickened surfaces. When the boundary surfaces are taken to be totally geodesic, we obtain a tg-hyperbolic structure with a unique associated volume. We prove that all virtual alternating links are tg-hyperbolic. We further extend tg-hyperbolicity to several classes of non-alternating virtual links. We then consider bounds on volumes of virtual links and include a table for volumes of the 116 nontrivial virtual knots of four or fewer crossings, all of which, with the exception of the trefoil knot, turn out to be tg-hyperbolic.

math.GT↗