Search arXiv⌕ Search

arXiv subjects

Lei Wang

Publications and source records attributed to Lei Wang.

At least 937 records · Page 52Linked to original sources

Contrastive Learning based Hybrid Networks for Long-Tailed Image Classification

Learning discriminative image representations plays a vital role in long-tailed image classification because it can ease the classifier learning in imbalanced cases. Given the promising performance contrastive learning has shown recently in representation learning, in this work, we explore effective supervised contrastive learning strategies and tailor them to learn better image representations from imbalanced data in order to boost the classification accuracy thereon. Specifically, we propose a novel hybrid network structure being composed of a supervised contrastive loss to learn image representations and a cross-entropy loss to learn classifiers, where the learning is progressively transited from feature learning to the classifier learning to embody the idea that better features make better classifiers. We explore two variants of contrastive loss for feature learning, which vary in the forms but share a common idea of pulling the samples from the same class together in the normalized embedding space and pushing the samples from different classes apart. One of them is the recently proposed supervised contrastive (SC) loss, which is designed on top of the state-of-the-art unsupervised contrastive loss by incorporating positive samples from the same class. The other is a prototypical supervised contrastive (PSC) learning strategy which addresses the intensive memory consumption in standard SC loss and thus shows more promise under limited memory budget. Extensive experiments on three long-tailed classification datasets demonstrate the advantage of the proposed contrastive learning based hybrid networks in long-tailed classification.

cs.CV↗

Shift-and-Balance Attention

Attention is an effective mechanism to improve the deep model capability. Squeeze-and-Excite (SE) introduces a light-weight attention branch to enhance the network's representational power. The attention branch is gated using the Sigmoid function and multiplied by the feature map's trunk branch. It is too sensitive to coordinate and balance the trunk and attention branches' contributions. To control the attention branch's influence, we propose a new attention method, called Shift-and-Balance (SB). Different from Squeeze-and-Excite, the attention branch is regulated by the learned control factor to control the balance, then added into the feature map's trunk branch. Experiments show that Shift-and-Balance attention significantly improves the accuracy compared to Squeeze-and-Excite when applied in more layers, increasing more size and capacity of a network. Moreover, Shift-and-Balance attention achieves better or close accuracy compared to the state-of-art Dynamic Convolution.

cs.CV↗

Quantum Criticality in Twisted Transition Metal Dichalcogenides

In moiré heterostructures, gate-tunable insulating phases driven by electronic correlations have been recently discovered. Here, we use transport measurements to characterize the gate-driven metal-insulator transitions and the metallic phase in twisted WSe$_2$ near half filling of the first moiré subband. We find that the metal-insulator transition as a function of both density and displacement field is continuous. At the metal-insulator boundary, the resistivity displays strange metal behaviour at low temperature with dissipation comparable to the Planckian limit. Further into the metallic phase, Fermi-liquid behaviour is recovered at low temperature which evolves into a quantum critical fan at intermediate temperatures before eventually reaching an anomalous saturated regime near room temperature. An analysis of the residual resistivity indicates the presence of strong quantum fluctuations in the insulating phase. These results establish twisted WSe$_2$ as a new platform to study doping and bandwidth controlled metal-insulator quantum phase transitions on the triangular lattice.

cond-mat.mes-hall↗

Robust Collaborative Learning of Patch-level and Image-level Annotations for Diabetic Retinopathy Grading from Fundus Image

Diabetic retinopathy (DR) grading from fundus images has attracted increasing interest in both academic and industrial communities. Most convolutional neural network (CNN) based algorithms treat DR grading as a classification task via image-level annotations. However, these algorithms have not fully explored the valuable information in the DR-related lesions. In this paper, we present a robust framework, which collaboratively utilizes patch-level and image-level annotations, for DR severity grading. By an end-to-end optimization, this framework can bi-directionally exchange the fine-grained lesion and image-level grade information. As a result, it exploits more discriminative features for DR grading. The proposed framework shows better performance than the recent state-of-the-art algorithms and three clinical ophthalmologists with over nine years of experience. By testing on datasets of different distributions (such as label and camera), we prove that our algorithm is robust when facing image quality and distribution variations that commonly exist in real-world practice. We inspect the proposed framework through extensive ablation studies to indicate the effectiveness and necessity of each motivation. The code and some valuable annotations are now publicly available.

cs.CV↗

Accurate Measurement of the Gap of Graphene/hBN Moiré Superlattice through Photocurrent Spectroscopy

Monolayer graphene aligned with hexagonal boron nitride (hBN) develops a gap at the charge neutrality point (CNP). This gap has previously been extensively studied by electrical transport through thermal activation measurements. Here, we report the determination of the gap size at the CNP of graphene/hBN superlattice through photocurrent spectroscopy study. We demonstrate two distinct measurement approaches to extract the gap size. A maximum of ~ 14 meV gap is observed for devices with a twist angle of less than 1 degree. This value is significantly smaller than that obtained from thermal activation measurements, yet larger than the theoretically predicted single-particle gap. Our results suggest that lattice relaxation and moderate electron-electron interaction effects may enhance the CNP gap in hBN/graphene superlattice.

cond-mat.mes-hall↗

DeepStyle: User Style Embedding for Authorship Attribution of Short Texts

Authorship attribution (AA), which is the task of finding the owner of a given text, is an important and widely studied research topic with many applications. Recent works have shown that deep learning methods could achieve significant accuracy improvement for the AA task. Nevertheless, most of these proposed methods represent user posts using a single type of feature (e.g., word bi-grams) and adopt a text classification approach to address the task. Furthermore, these methods offer very limited explainability of the AA results. In this paper, we address these limitations by proposing DeepStyle, a novel embedding-based framework that learns the representations of users' salient writing styles. We conduct extensive experiments on two real-world datasets from Twitter and Weibo. Our experiment results show that DeepStyle outperforms the state-of-the-art baselines on the AA task.

cs.CL↗

AIBench Training: Balanced Industry-Standard AI Training Benchmarking

Earlier-stage evaluations of a new AI architecture/system need affordable benchmarks. Only using a few AI component benchmarks like MLPerfalone in the other stages may lead to misleading conclusions. Moreover, the learning dynamics are not well understood, and the benchmarks' shelf-life is short. This paper proposes a balanced benchmarking methodology. We use real-world benchmarks to cover the factors space that impacts the learning dynamics to the most considerable extent. After performing an exhaustive survey on Internet service AI domains, we identify and implement nineteen representative AI tasks with state-of-the-art models. For repeatable performance ranking (RPR subset) and workload characterization (WC subset), we keep two subsets to a minimum for affordability. We contribute by far the most comprehensive AI training benchmark suite. The evaluations show: (1) AIBench Training (v1.1) outperforms MLPerfTraining (v0.7) in terms of diversity and representativeness of model complexity, computational cost, convergent rate, computation, and memory access patterns, and hotspot functions; (2) Against the AIBench full benchmarks, its RPR subset shortens the benchmarking cost by 64%, while maintaining the primary workload characteristics; (3) The performance ranking shows the single-purpose AI accelerator like TPU with the optimized TensorFlowframework performs better than that of GPUs while losing the latter's general support for various AI models. The specification, source code, and performance numbers are available from the AIBench homepage https://www.benchcouncil.org/aibench-training/index.html.

cs.AI↗

Network Representation Learning: From Traditional Feature Learning to Deep Learning

Network representation learning (NRL) is an effective graph analytics technique and promotes users to deeply understand the hidden characteristics of graph data. It has been successfully applied in many real-world tasks related to network science, such as social network data processing, biological information processing, and recommender systems. Deep Learning is a powerful tool to learn data features. However, it is non-trivial to generalize deep learning to graph-structured data since it is different from the regular data such as pictures having spatial information and sounds having temporal information. Recently, researchers proposed many deep learning-based methods in the area of NRL. In this survey, we investigate classical NRL from traditional feature learning method to the deep learning-based model, analyze relationships between them, and summarize the latest progress. Finally, we discuss open issues considering NRL and point out the future directions in this field.

cs.SI↗

Distributed Algorithms that Solve Boolean Equations with Local and Differential Privacies

In this paper, we propose distributed algorithms that solve a system of Boolean equations over a network, where each node in the network possesses only one Boolean equation from the system. The Boolean equation assigned at any particular node is a {\em private} equation known to this node only, and the nodes aim to compute the exact set of solutions to the system without exchanging their local equations. We show that each private Boolean equation can be locally lifted to a linear algebraic equation under a basis of Boolean vectors, leading to a network linear equation that is distributedly solvable using existing distributed linear equation algorithms as a subroutine. A number of exact or approximate solutions to the induced linear equation are then computed at each node from different initial values. The solutions to the original Boolean equations are eventually computed locally via a Boolean vector search algorithm. We prove that given solvable Boolean equations, when the initial values of the nodes for the distributed linear equation solving step are i.i.d selected according to a uniform distribution in a high-dimensional cube, our algorithms return the exact solution set of the Boolean equations at each node with high probability. Furthermore, we present an algorithm for distributed verification of the satisfiability of Boolean equations, and prove its correctness. Finally, we show that by utilizing linear equation solvers with differential privacy to replace the in-network computing routines, the overall distributed Boolean equation algorithms can be made differentially private. Under the standard Laplace mechanism, we prove an explicit level of noises that can be injected in the linear equation steps for ensuring a prescribed level of differential privacy.

math.OC↗

Fast Evaporation Enabled Ultrathin Polymeric Coatings on Nanoporous Substrates for Highly Permeable Membranes

Membranes derived from ultrathin polymeric films are promising to meet fast separations, but currently available approaches to produce polymer films with greatly reduced thicknesses on porous supports still faces challenges. Here, defect-free ultrathin polymer covering films (UPCFs) are realized by a facile general approach of rapid solvent evaporation. By fast evaporating dilute polymer solutions, we realize ultrathin coating (~30 nm) of porous substrates exclusively on the top surface, forming UPCFs with a block copolymer of polystyrene-block-poly(2-vinyl pyridine) at room temperature or a homopolymer of poly(vinyl alcohol) (PVA) at elevated temperatures. With subsequent selective swelling to the block copolymer and crosslinking to PVA, the resulting bi-layered composite structures serve as highly permeable membranes delivering ~2-10 times higher permeability in ultrafiltration and pervaporation applications than state-of-the-art separation membranes with similar rejections and selectivities. This work opens up a new, facile avenue for the controllable fabrication of ultrathin coatings on porous substrates, which shows great potentials in membrane-based separations and other areas.

cond-mat.soft↗

Robust Output Feedback Stabilization of MIMO Invertible Nonlinear Systems with Output-Dependent Multipliers (extended version)

This note studies the robust output feedback stabilization problem of multi-input multi-output invertible nonlinear systems with output-dependent multipliers. An "ideal" state feedback is first designed under certain mild assumptions. Then, a set of extended low-power high-gain observers is systematically designed, providing a complete estimation of the "ideal" feedback law. This yields a robust output feedback stabilizer such that the origin of the closed-loop system is semiglobally asymptotically stable, while improving the numerical implementation with the power of high-gain parameters up to 2.

eess.SY↗

Coordinated Cyber-Attack Detection Model of Cyber-Physical Power System Based on the Operating State Data Link

Existing coordinated cyber-attack detection methods have low detection accuracy and efficiency and poor generalization ability due to difficulties dealing with unbalanced attack data samples, high data dimensionality, and noisy data sets. This paper proposes a model for cyber and physical data fusion using a data link for detecting attacks on a Cyber-Physical Power System (CPPS). Two-step principal component analysis (PCA) is used for classifying the system's operating status. An adaptive synthetic sampling algorithm is used to reduce the imbalance in the categories' samples. The loss function is improved according to the feature intensity difference of the attack event, and an integrated classifier is established using a classification algorithm based on the cost-sensitive gradient boosting decision tree (CS-GBDT). The simulation results show that the proposed method provides higher accuracy, recall, and F-Score than comparable algorithms.

eess.SP↗

Robust I&I Adaptive Tracking Control of Systems with Nonlinear Parameterization: An ISS Perspective

This paper studies the immersion and invariance (I&I) adaptive tracking problem for a class of nonlinear systems with nonlinear parameterization in the ISS framework. Under some mild assumptions, a novel I&I adaptive control algorithm is proposed,leading to an interconnection of an ISS estimation error subsystem and an ISS tracking error subsystem. Using an ISS small-gain condition, the desired uniform global asymptotic stability of the resulting interconnected "error" system can be achieved and a sum-type strict Lyapunov function can be explicitly constructed. Taking advantage of this ISS-based design framework,it is shown that the corresponding robustness with respect to the input perturbation can be rendered to be ISS. To remove the need to solve the immersion manifold shaping PDE, a new filter-based approach is proposed, which preserves the ISS-based design framework. Finally, we demonstrate the validness of the proposed framework on a tracking problem for series elastic actuators.

math.OC↗

Robust Implementable Regulator Design of General Linear Systems

Robust implementable output regulator design approaches are studied for general linear continuous-time \mbox{systems} with periodically sampled measurements, consisting of both the regulation errors and extra measurements that are generally non-vanishing in steady state. A digital regulator is first developed via the conventional emulation-based approach, rendering the regulation errors asymptotically bounded with a small sampling period. We then develop a hybrid design framework by incorporating a generalized hold device, which transforms the original problem into the problem of designing an output feedback controller fulfilling two conditions for a discrete-time system. We show that such a controller can always be obtained by designing a discrete-time internal model, a discrete-time washout filter, and a discrete-time output feedback stabilizer. As a result, the regulation errors are shown to be globally exponentially convergent to zero, while the sampling period is fixed but can be arbitrarily large. This design framework is further developed for a multi-rate digital regulator with a large sampling period of the measurements and a small control execution period.

math.OC↗

HPC AI500: Representative, Repeatable and Simple HPC AI Benchmarking

Recent years witness a trend of applying large-scale distributed deep learning algorithms (HPC AI) in both business and scientific computing areas, whose goal is to speed up the training time to achieve a state-of-the-art quality. The HPC AI benchmarks accelerate the process. Unfortunately, benchmarking HPC AI systems at scale raises serious challenges. This paper presents a representative, repeatable and simple HPC AI benchmarking methodology. Among the seventeen AI workloads of AIBench Training -- by far the most comprehensive AI Training benchmarks suite -- we choose two representative and repeatable AI workloads. The selected HPC AI benchmarks include both business and scientific computing: Image Classification and Extreme Weather Analytics. To rank HPC AI systems, we present a new metric named Valid FLOPS, emphasizing both throughput performance and a target quality. The specification, source code, datasets, and HPC AI500 ranking numbers are publicly available from \url{https://www.benchcouncil.org/HPCAI500/}.

cs.PF↗

Tropical Tensor Network for Ground States of Spin Glasses

We present a unified exact tensor network approach to compute the ground state energy, identify the optimal configuration, and count the number of solutions for spin glasses. The method is based on tensor networks with the Tropical Algebra defined on the semiring. Contracting the tropical tensor network gives the ground state energy; differentiating through the tensor network contraction gives the ground state configuration; mixing the tropical algebra and the ordinary algebra counts the ground state degeneracy. The approach brings together the concepts from graphical models, tensor networks, differentiable programming, and quantum circuit simulation, and easily utilizes the computational power of graphical processing units (GPUs). For applications, we compute the exact ground state energy of Ising spin glasses on square lattice up to 1024 spins, on cubic lattice up to 216 spins, and on 3 regular random graphs up to 220 spins, on a single GPU; We obtain exact ground state energy of (+/-)J Ising spin glass on the chimera graph of D-Wave quantum annealer of 512 qubits in less than 100 seconds and investigate the exact value of the residual entropy of (+/-)J spin glasses on the chimera graph; Finally, we investigate ground-state energy and entropy of 3-state Potts glasses on square lattices up to size 18 x 18. Our approach provides baselines and benchmarks for exact algorithms for spin glasses and combinatorial optimization problems, and for evaluating heuristic algorithms and mean-field theories.

cond-mat.stat-mech↗

Dark matter, $Z^{\prime}$, vector-like quark at the LHC and $b\to s μμ$ anomaly

Combining the $b\to sμ^+μ^-$ anomaly and dark matter observables, we study the capability of LHC to test dark matter, $Z^{\prime}$, and vector-like quark. We focus on a local $U(1)_{L_μ-L_τ}$ model with a vector-like $SU(2)_L$ doublet quark $Q$ and a complex singlet scalar whose lightest component $X_I$ is a candidate of dark matter. After imposing relevant constraints, we find that the $b\to sμ^+μ^-$ anomaly and the relic abundance of dark matter favor $m_{X_I}< 350$ GeV and $m_{Z^{\prime}}< 450$ GeV for $m_Q<$ 2 TeV and $m_{X_R}<$ 2 TeV (the heavy partner of $m_{X_I}$). The current searches for jets and missing transverse momentum at the LHC sizably reduce the mass ranges of the vector-like quark, and $m_Q$ is required to be larger than 1.7 TeV. Finally, we discuss the possibility of probing these new particles at the high luminosity LHC via the QCD process $pp \to D\bar{D}$ or $pp \to U\bar{U}$ followed by the decay $D\to s (b) Z'X_I$ or $U \to u (c) Z' X_I$ and then $Z'\toμ^+μ^-$. Taking a benchmark point of $m_Q$=1.93 TeV, $m_{Z^\prime}=170$ GeV, and $m_{X_I}=$ 145 GeV, we perform a detailed Monte Carlo simulation, and find that such benchmark point can be accessible at the 14 TeV LHC with an integrated luminosity 3000 fb$^{-1}$.

hep-ph↗

Modeling Method for the Coupling Relations of Microgrid Cyber-Physical Systems Driven by Hybrid Spatiotemporal Events

The essence of the microgrid cyber-physical system (CPS) lies in the cyclical conversion of information flow and energy flow. Most of the existing coupling models are modeled with static networks and interface structures, in which the closed-loop data flow characteristic is not fully considered. It is difficult for these models to accurately describe spatiotemporal deduction processes, such as microgrid CPS attack identification, risk propagation, safety assessment, defense control, and cascading failure. To address this problem, a modeling method for the coupling relations of microgrid CPS driven by hybrid spatiotemporal events is proposed in the present work. First, according to the topological correlation and coupling logic of the microgrid CPS, the cyclical conversion mechanism of information flow and energy flow is analyzed, and a microgrid CPS architecture with multi-agents as the core is constructed. Next, the spatiotemporal evolution characteristic of the CPS is described by hybrid automata, and the task coordination mechanism of the multi-agent CPS terminal is designed. On this basis, a discrete-continuous correlation and terminal structure characteristic representation method of the CPS based on heterogeneous multi-groups are then proposed. Finally, four spatiotemporal events, namely state perception, network communication, intelligent decision-making, and action control, are defined. Considering the constraints of the temporal conversion of information flow and energy flow, a microgrid CPS coupling model is established, the effectiveness of which is verified by simulating false data injection attack (FDIA) scenarios.

eess.SP↗