arXiv subjects

Tao Wang

Publications and source records attributed to Tao Wang.

At least 343 records · Page 19Linked to original sources

arXiv2024

Data-Driven Decentralized Control Design for Discrete-Time Large-Scale Systems

In this paper, a data-driven approach is developed for controller design for a class of discrete-time large-scale systems, where a large-scale system can be expressed in an equivalent data-driven form and the decentralized controllers can be parameterized by the data collected from its subsystems, i.e., system state, control input, and interconnection input. Based on the developed data-driven method and the Lyapunov approach, a data-driven semi-definite programming problem is constructed to obtain decentralized stabilizing controllers. The proposed approach has been validated on a mass-spring chain model, with the significant advantage of avoiding extensive modeling processes.

eess.SY↗

arXiv2024

Observer-Based Safety Monitoring of Nonlinear Dynamical Systems with Neural Networks via Quadratic Constraint Approach

The safety monitoring for nonlinear dynamical systems with embedded neural network components is addressed in this paper. The interval-observer-based safety monitor is developed consisting of two auxiliary neural networks derived from the neural network components of the dynamical system. Due to the presence of nonlinear activation functions in neural networks, we use quadratic constraints on the global sector to abstract the nonlinear activation functions in neural networks. By combining a quadratic constraint approach for the activation function with Lyapunov theory, the interval observer design problem is transformed into a series of quadratic and linear programming feasibility problems to make the interval observer operate with the ability to correctly estimate the system state with estimation errors within acceptable limits. The applicability of the proposed method is verified by simulation of the lateral vehicle control system.

eess.SY↗

arXiv2024

Synergy-Guided Regional Supervision of Pseudo Labels for Semi-Supervised Medical Image Segmentation

Semi-supervised learning has received considerable attention for its potential to leverage abundant unlabeled data to enhance model robustness. Pseudo labeling is a widely used strategy in semi supervised learning. However, existing methods often suffer from noise contamination, which can undermine model performance. To tackle this challenge, we introduce a novel Synergy-Guided Regional Supervision of Pseudo Labels (SGRS-Net) framework. Built upon the mean teacher network, we employ a Mix Augmentation module to enhance the unlabeled data. By evaluating the synergy before and after augmentation, we strategically partition the pseudo labels into distinct regions. Additionally, we introduce a Region Loss Evaluation module to assess the loss across each delineated area. Extensive experiments conducted on the LA dataset have demonstrated superior performance over state-of-the-art techniques, underscoring the efficiency and practicality of our framework.

cs.CV↗

arXiv2024

Pattern Integration and Enhancement Vision Transformer for Self-Supervised Learning in Remote Sensing

Recent self-supervised learning (SSL) methods have demonstrated impressive results in learning visual representations from unlabeled remote sensing images. However, most remote sensing images predominantly consist of scenographic scenes containing multiple ground objects without explicit foreground targets, which limits the performance of existing SSL methods that focus on foreground targets. This raises the question: Is there a method that can automatically aggregate similar objects within scenographic remote sensing images, thereby enabling models to differentiate knowledge embedded in various geospatial patterns for improved feature representation? In this work, we present the Pattern Integration and Enhancement Vision Transformer (PIEViT), a novel self-supervised learning framework designed specifically for remote sensing imagery. PIEViT utilizes a teacher-student architecture to address both image-level and patch-level tasks. It employs the Geospatial Pattern Cohesion (GPC) module to explore the natural clustering of patches, enhancing the differentiation of individual features. The Feature Integration Projection (FIP) module further refines masked token reconstruction using geospatially clustered patches. We validated PIEViT across multiple downstream tasks, including object detection, semantic segmentation, and change detection. Experiments demonstrated that PIEViT enhances the representation of internal patch features, providing significant improvements over existing self-supervised baselines. It achieves excellent results in object detection, land cover classification, and change detection, underscoring its robustness, generalization, and transferability for remote sensing image interpretation tasks.

cs.CV↗

arXiv2024

Revisiting Network Perturbation for Semi-Supervised Semantic Segmentation

In semi-supervised semantic segmentation (SSS), weak-to-strong consistency regularization techniques are widely utilized in recent works, typically combined with input-level and feature-level perturbations. However, the integration between weak-to-strong consistency regularization and network perturbation has been relatively rare. We note several problems with existing network perturbations in SSS that may contribute to this phenomenon. By revisiting network perturbations, we introduce a new approach for network perturbation to expand the existing weak-to-strong consistency regularization for unlabeled data. Additionally, we present a volatile learning process for labeled data, which is uncommon in existing research. Building upon previous work that includes input-level and feature-level perturbations, we present MLPMatch (Multi-Level-Perturbation Match), an easy-to-implement and efficient framework for semi-supervised semantic segmentation. MLPMatch has been validated on the Pascal VOC and Cityscapes datasets, achieving state-of-the-art performance. Code is available from https://github.com/LlistenL/MLPMatch.

cs.CV↗

arXiv2024

Probing the He II re-Ionization ERa via Absorbing C IV Historical Yield (HIERACHY) II: Project Design, Current Status, and Examples of Initial Data Products

The He II reionization epoch is expected to take place at $z\sim3-5$. In this stage, the helium and metals in the inter-galactic medium (IGM) are further ionized with additional contributions from harder non-stellar sources, and some large-scale gravitationally bound systems approach virialization. The "Probing the He II re-Ionization ERa via Absorbing C IV Historical Yield (HIERACHY)" program utilizes high- and medium-resolution spectra of bright background quasars at $z\approx3.9-5.2$ to investigate Ly$α$, C IV, and other metal absorption lines during this epoch. Additionally, we employ narrow-band imaging to search for Ly$α$ emitters associated with C IV absorbers, alongside multi-wavelength observations to identify and study particularly intriguing cases. In this paper, we present the design of the HIERACHY program, its current status, major scientific goals, and examples of initial data products from completed Magellan/MIKE, MagE spectroscopy, and MDM imaging observations. We also provide a brief outlook on future multi-wavelength observations that may significantly impact the related science.

astro-ph.GA↗

arXiv2024

Security and Privacy on Generative Data in AIGC: A Survey

The advent of artificial intelligence-generated content (AIGC) represents a pivotal moment in the evolution of information technology. With AIGC, it can be effortless to generate high-quality data that is challenging for the public to distinguish. Nevertheless, the proliferation of generative data across cyberspace brings security and privacy issues, including privacy leakages of individuals and media forgery for fraudulent purposes. Consequently, both academia and industry begin to emphasize the trustworthiness of generative data, successively providing a series of countermeasures for security and privacy. In this survey, we systematically review the security and privacy on generative data in AIGC, particularly for the first time analyzing them from the perspective of information security properties. Specifically, we reveal the successful experiences of state-of-the-art countermeasures in terms of the foundational properties of privacy, controllability, authenticity, and compliance, respectively. Finally, we show some representative benchmarks, present a statistical analysis, and summarize the potential exploration directions from each of theses properties.

cs.CR↗

arXiv2024

Pseudo-labeling with Keyword Refining for Few-Supervised Video Captioning

Video captioning generate a sentence that describes the video content. Existing methods always require a number of captions (\eg, 10 or 20) per video to train the model, which is quite costly. In this work, we explore the possibility of using only one or very few ground-truth sentences, and introduce a new task named few-supervised video captioning. Specifically, we propose a few-supervised video captioning framework that consists of lexically constrained pseudo-labeling module and keyword-refined captioning module. Unlike the random sampling in natural language processing that may cause invalid modifications (\ie, edit words), the former module guides the model to edit words using some actions (\eg, copy, replace, insert, and delete) by a pretrained token-level classifier, and then fine-tunes candidate sentences by a pretrained language model. Meanwhile, the former employs the repetition penalized sampling to encourage the model to yield concise pseudo-labeled sentences with less repetition, and selects the most relevant sentences upon a pretrained video-text model. Moreover, to keep semantic consistency between pseudo-labeled sentences and video content, we develop the transformer-based keyword refiner with the video-keyword gated fusion strategy to emphasize more on relevant words. Extensive experiments on several benchmarks demonstrate the advantages of the proposed approach in both few-supervised and fully-supervised scenarios. The code implementation is available at https://github.com/mlvccn/PKG_VidCap

cs.CV↗

arXiv2024

DFA-GNN: Forward Learning of Graph Neural Networks by Direct Feedback Alignment

Graph neural networks are recognized for their strong performance across various applications, with the backpropagation algorithm playing a central role in the development of most GNN models. However, despite its effectiveness, BP has limitations that challenge its biological plausibility and affect the efficiency, scalability and parallelism of training neural networks for graph-based tasks. While several non-BP training algorithms, such as the direct feedback alignment, have been successfully applied to fully-connected and convolutional network components for handling Euclidean data, directly adapting these non-BP frameworks to manage non-Euclidean graph data in GNN models presents significant challenges. These challenges primarily arise from the violation of the i.i.d. assumption in graph data and the difficulty in accessing prediction errors for all samples (nodes) within the graph. To overcome these obstacles, in this paper we propose DFA-GNN, a novel forward learning framework tailored for GNNs with a case study of semi-supervised learning. The proposed method breaks the limitations of BP by using a dedicated forward training mechanism. Specifically, DFA-GNN extends the principles of DFA to adapt to graph data and unique architecture of GNNs, which incorporates the information of graph topology into the feedback links to accommodate the non-Euclidean characteristics of graph data. Additionally, for semi-supervised graph learning tasks, we developed a pseudo error generator that spreads residual errors from training data to create a pseudo error for each unlabeled node. These pseudo errors are then utilized to train GNNs using DFA. Extensive experiments on 10 public benchmarks reveal that our learning framework outperforms not only previous non-BP methods but also the standard BP methods, and it exhibits excellent robustness against various types of noise and attacks.

cs.LG↗

arXiv2024

PANORAMIA: Privacy Auditing of Machine Learning Models without Retraining

We present PANORAMIA, a privacy leakage measurement framework for machine learning models that relies on membership inference attacks using generated data as non-members. By relying on generated non-member data, PANORAMIA eliminates the common dependency of privacy measurement tools on in-distribution non-member data. As a result, PANORAMIA does not modify the model, training data, or training process, and only requires access to a subset of the training data. We evaluate PANORAMIA on ML models for image and tabular data classification, as well as on large-scale language models.

cs.CR↗

arXiv2024

Exploring structure diversity in atomic resolution microscopy with graph neural networks

The emergence of deep learning (DL) has provided great opportunities for the high-throughput analysis of atomic-resolution micrographs. However, the DL models trained by image patches in fixed size generally lack efficiency and flexibility when processing micrographs containing diversified atomic configurations. Herein, inspired by the similarity between the atomic structures and graphs, we describe a few-shot learning framework based on an equivariant graph neural network (EGNN) to analyze a library of atomic structures (e.g., vacancies, phases, grain boundaries, doping, etc.), showing significantly promoted robustness and three orders of magnitude reduced computing parameters compared to the image-driven DL models, which is especially evident for those aggregated vacancy lines with flexible lattice distortion. Besides, the intuitiveness of graphs enables quantitative and straightforward extraction of the atomic-scale structural features in batches, thus statistically unveiling the self-assembly dynamics of vacancy lines under electron beam irradiation. A versatile model toolkit is established by integrating EGNN sub-models for single structure recognition to process images involving varied configurations in the form of a task chain, leading to the discovery of novel doping configurations with superior electrocatalytic properties for hydrogen evolution reactions. This work provides a powerful tool to explore structure diversity in a fast, accurate, and intelligent manner.

cond-mat.mtrl-sci↗

arXiv2024

Temporal-Enhanced Multimodal Transformer for Referring Multi-Object Tracking and Segmentation

Referring multi-object tracking (RMOT) is an emerging cross-modal task that aims to locate an arbitrary number of target objects and maintain their identities referred by a language expression in a video. This intricate task involves the reasoning of linguistic and visual modalities, along with the temporal association of target objects. However, the seminal work employs only loose feature fusion and overlooks the utilization of long-term information on tracked objects. In this study, we introduce a compact Transformer-based method, termed TenRMOT. We conduct feature fusion at both encoding and decoding stages to fully exploit the advantages of Transformer architecture. Specifically, we incrementally perform cross-modal fusion layer-by-layer during the encoding phase. In the decoding phase, we utilize language-guided queries to probe memory features for accurate prediction of the desired objects. Moreover, we introduce a query update module that explicitly leverages temporal prior information of the tracked objects to enhance the consistency of their trajectories. In addition, we introduce a novel task called Referring Multi-Object Tracking and Segmentation (RMOTS) and construct a new dataset named Ref-KITTI Segmentation. Our dataset consists of 18 videos with 818 expressions, and each expression averages 10.7 masks, which poses a greater challenge compared to the typical single mask in most existing referring video segmentation datasets. TenRMOT demonstrates superior performance on both the referring multi-object tracking and the segmentation tasks.

cs.CV↗

arXiv2024

Large Enhancement of Properties in Strained Lead-free Multiferroic Solid Solutions with Strong Deviation from Vegard's Law

Efforts to combine the advantages of multiple systems to enhance functionlities through solid solution design present a great challenge due to the constraint imposed by the classical Vegard law. Here, we successfully navigate this trade off by leveraging the synergistic effect of chemical doping and strain engineering in solid solution system of BiFeO3 BaTiO3. Unlike bulks, a significant deviation from the Vegard law accompanying with enhanced multiferroism is observed in the strained solid solution epitaxial films, where we achieve a pronounced tetragonality, enhanced saturated magnetization, substantial polarization, high ferroelectric Curie temperature, all while maintaining impressively low leakage current. These characteristics surpass the properties of their parent BiFeO3 and BaTiO3 films. Moreover, the superior ferroelectricity has never been reported in corresponding bulks. These findings underscore the potential of strained BiFeO3 BaTiO3 films as lead-free, room-temperature multiferroics.

cond-mat.mtrl-sci↗

arXiv2024

Graph Propagation Transformer for Graph Representation Learning

This paper presents a novel transformer architecture for graph representation learning. The core insight of our method is to fully consider the information propagation among nodes and edges in a graph when building the attention module in the transformer blocks. Specifically, we propose a new attention mechanism called Graph Propagation Attention (GPA). It explicitly passes the information among nodes and edges in three ways, i.e. node-to-node, node-to-edge, and edge-to-node, which is essential for learning graph-structured data. On this basis, we design an effective transformer architecture named Graph Propagation Transformer (GPTrans) to further help learn graph data. We verify the performance of GPTrans in a wide range of graph learning experiments on several benchmark datasets. These results show that our method outperforms many state-of-the-art transformer-based graph models with better performance. The code will be released at https://github.com/czczup/GPTrans.

cs.LG↗

arXiv2024

Electromagnetic and hadronic decay of fully heavy tetraquark

In this study, we compute the electromagnetic and hadronic decay widths of the S-wave fully heavy tetraquark $T_{4Q}$ ($Q=c$ or $b$) at lowest order in $α_s$ and $v$, in the framework of nonrelativistic QCD. The short-distance coefficients are determined through the standard procedure of matching. The nonperturbative long-distance matrix elements are related to the phenomenological four-body Schrödinger wave functions at the origin, whose values are taken from literature. The branching fractions are predicted to be around $10^{-4}$ and $10^{-7}-10^{-6}$ for the $T_{4c}$ hadronic decay and electromagnetic decay, respectively. Combing our results with the $T_{4c}$ production cross sections at the LHC, we also predict the event numbers for various decay channels. With integrated luminosity $\mathcal{L}=100 \,{\rm fb}^{-1}$, it is expected that the event numbers can reach $10^3$ for $T_{4c}\to γγ$, and $10^6$ for $T_{4c}\to {\rm LH}$, at the LHC. The detecting prospect is promising. In addition, the decay widths of $T_{4b}$ are estimated based on simple dimensional analysis as well as velocity scaling rule.

hep-ph↗

arXiv2024

Cheeger type inequalities associated with isocapacitary constants on graphs

In this paper, we introduce Cheeger type constants via isocapacitary constants introduced by Maz'ya to estimate first Dirichlet, Neumann and Steklov eigenvalues on a finite subgraph of a graph. Moreover, we estimate the bottom of the spectrum of the Laplace operator and the Dirichlet-to-Neumann operator for an infinite subgraph. Estimates for higher-order Steklov eigenvalues on a finite or infinite subgraph are also proved.

math.DG↗

arXiv2024

General relativistic stochastic thermodynamics

Based on the recent work [1,2], we formulate the first law and the second law of stochastic thermodynamics in the framework of general relativity. These laws are established for a charged Brownian particle moving in a heat reservoir and subjecting to an external electromagnetic field in generic stationary spacetime background, and in order to maintain general covariance, they are presented respectively in terms of the divergences of the energy current and the entropy density current. The stability of the equilibrium state is also analyzed.

gr-qc↗

arXiv2024

A simple explanation of the absence of the spherical nuclei with the hidden-color states

Inspired by the EMC effect, the Cd puzzle and the SU3-IBM, a hypothesis can be given for a nucleus, that only the nucleus itself is a trivial (0,0) representation of the SU(3) group, which leads to the simple conclusion that spherical nucleus does not exist and the spherical mean field is not allowed. The key conclusion is that the whole nucleus should have many hidden-color states, and the quark-gluon degrees of freedom are required even at the low-energy excitation of the nucleus.

nucl-th↗