Search arXiv⌕ Search

arXiv subjects

Tao Zhang

Publications and source records attributed to Tao Zhang.

At least 433 records · Page 24Linked to original sources
arXiv2023

ReIDTrack: Multi-Object Track and Segmentation Without Motion

In recent years, dominant Multi-object tracking (MOT) and segmentation (MOTS) methods mainly follow the tracking-by-detection paradigm. Transformer-based end-to-end (E2E) solutions bring some ideas to MOT and MOTS, but they cannot achieve a new state-of-the-art (SOTA) performance in major MOT and MOTS benchmarks. Detection and association are two main modules of the tracking-by-detection paradigm. Association techniques mainly depend on the combination of motion and appearance information. As deep learning has been recently developed, the performance of the detection and appearance model is rapidly improved. These trends made us consider whether we can achieve SOTA based on only high-performance detection and appearance model. Our paper mainly focuses on exploring this direction based on CBNetV2 with Swin-B as a detection model and MoCo-v2 as a self-supervised appearance model. Motion information and IoU mapping were removed during the association. Our method wins 1st place on the MOTS track and wins 2nd on the MOT track in the CVPR2023 WAD workshop. We hope our simple and effective method can give some insights to the MOT and MOTS research community. Source code will be released under this git repository

cs.CV↗
arXiv2023

Efficient Exploration Using Extra Safety Budget in Constrained Policy Optimization

Reinforcement learning (RL) has achieved promising results on most robotic control tasks. Safety of learning-based controllers is an essential notion of ensuring the effectiveness of the controllers. Current methods adopt whole consistency constraints during the training, thus resulting in inefficient exploration in the early stage. In this paper, we propose an algorithm named Constrained Policy Optimization with Extra Safety Budget (ESB-CPO) to strike a balance between the exploration efficiency and the constraints satisfaction. In the early stage, our method loosens the practical constraints of unsafe transitions (adding extra safety budget) with the aid of a new metric we propose. With the training process, the constraints in our optimization problem become tighter. Meanwhile, theoretical analysis and practical experiments demonstrate that our method gradually meets the cost limit's demand in the final training stage. When evaluated on Safety-Gym and Bullet-Safety-Gym benchmarks, our method has shown its advantages over baseline algorithms in terms of safety and optimality. Remarkably, our method gains remarkable performance improvement under the same cost limit compared with baselines.

cs.RO↗
arXiv2023

Colossal magnetoresistance in Ti lightly-doped Cr2Se3 single crystals with layered structure

Stoichiometric Cr2Se3 single crystals are particular layer-structured antiferromagnets which possess noncolinear spin configuration, weak ferromagnetic moments, moderate magnetoresistance (MR ~ 14.3%), and bad metallic conductivity below the antiferromagnetic phase transition temperature. Here, we report an interesting >16000% colossal magnetoresistance (CMR) effect in Ti (1.5 atomic percent) lightly-doped Cr2Se3 single crystals. Such a CMR is approximately 1143 times larger than that of the stoichiometric Cr2Se3 crystals and is rarely observed in layered antiferromagnets and is attributed to the frustrated spin configuration. Moreover, the Ti doping not only dramatically changes the electronic conductivity of the Cr2Se3 crystal from a bad metal to a semiconductor with a gap of ~ 15 meV, but also induces a change of the magnetic anisotropy of the Cr2Se3 crystal from strong out-of-plane to weak in plane. Further, magnetotransport measurements reveal that the low-field MR scales with the square of the reduced magnetization, which is a signature of CMR materials. The layered Ti:Cr2Se3 with CMR effect could be used as 2D heterostructure building blocks to provide colossal negative MR in spintronic devices.

cond-mat.mtrl-sci↗
arXiv2023

Search for light dark matter from atmosphere in PandaX-4T

We report a search for light dark matter produced through the cascading decay of $η$ mesons, which are created as a result of inelastic collisions between cosmic rays and Earth's atmosphere. We introduce a new and general framework, publicly accessible, designed to address boosted dark matter specifically, with which a full and dedicated simulation including both elastic and quasi-elastic processes of Earth attenuation effect on the dark matter particles arriving at the detector is performed. In the PandaX-4T commissioning data of 0.63 tonne$\cdot$year exposure, no significant excess over background is observed. The first constraints on the interaction between light dark matter generated in the atmosphere and nucleus through a light scalar mediator are obtained. The lowest excluded cross-section is set at $5.9 \times 10^{-37}{\rm cm^2}$ for dark matter mass of $0.1$ MeV$/c^2$ and mediator mass of 300 MeV$/c^2$. The lowest upper limit of $η$ to dark matter decay branching ratio is $1.6 \times 10^{-7}$.

hep-ex↗
arXiv2023

Adversarial Attack with Raindrops

Deep neural networks (DNNs) are known to be vulnerable to adversarial examples, which are usually designed artificially to fool DNNs, but rarely exist in real-world scenarios. In this paper, we study the adversarial examples caused by raindrops, to demonstrate that there exist plenty of natural phenomena being able to work as adversarial attackers to DNNs. Moreover, we present a new approach to generate adversarial raindrops, denoted as AdvRD, using the generative adversarial network (GAN) technique to simulate natural raindrops. The images crafted by our AdvRD look very similar to the real-world raindrop images, statistically close to the distribution of true raindrop images, and more importantly, can perform strong adversarial attack to the state-of-the-art DNN models. On the other side, we show that the adversarial training using our AdvRD images can significantly improve the robustness of DNNs to the real-world raindrop attacks. Extensive experiments are carried out to demonstrate that the images crafted by AdvRD are visually and statistically close to the natural raindrop images, can work as strong attackers to DNN models, and also help improve the robustness of DNNs to raindrop attacks.

cs.CV↗
arXiv2023

DVIS: Decoupled Video Instance Segmentation Framework

Video instance segmentation (VIS) is a critical task with diverse applications, including autonomous driving and video editing. Existing methods often underperform on complex and long videos in real world, primarily due to two factors. Firstly, offline methods are limited by the tightly-coupled modeling paradigm, which treats all frames equally and disregards the interdependencies between adjacent frames. Consequently, this leads to the introduction of excessive noise during long-term temporal alignment. Secondly, online methods suffer from inadequate utilization of temporal information. To tackle these challenges, we propose a decoupling strategy for VIS by dividing it into three independent sub-tasks: segmentation, tracking, and refinement. The efficacy of the decoupling strategy relies on two crucial elements: 1) attaining precise long-term alignment outcomes via frame-by-frame association during tracking, and 2) the effective utilization of temporal information predicated on the aforementioned accurate alignment outcomes during refinement. We introduce a novel referring tracker and temporal refiner to construct the \textbf{D}ecoupled \textbf{VIS} framework (\textbf{DVIS}). DVIS achieves new SOTA performance in both VIS and VPS, surpassing the current SOTA methods by 7.3 AP and 9.6 VPQ on the OVIS and VIPSeg datasets, which are the most challenging and realistic benchmarks. Moreover, thanks to the decoupling strategy, the referring tracker and temporal refiner are super light-weight (only 1.69\% of the segmenter FLOPs), allowing for efficient training and inference on a single GPU with 11G memory. The code is available at \href{https://github.com/zhang-tao-whu/DVIS}{https://github.com/zhang-tao-whu/DVIS}.

cs.CV↗
arXiv2023

Emotion recognition based on multi-modal electrophysiology multi-head attention Contrastive Learning

Emotion recognition is an important research direction in artificial intelligence, helping machines understand and adapt to human emotional states. Multimodal electrophysiological(ME) signals, such as EEG, GSR, respiration(Resp), and temperature(Temp), are effective biomarkers for reflecting changes in human emotions. However, using electrophysiological signals for emotion recognition faces challenges such as data scarcity, inconsistent labeling, and difficulty in cross-individual generalization. To address these issues, we propose ME-MHACL, a self-supervised contrastive learning-based multimodal emotion recognition method that can learn meaningful feature representations from unlabeled electrophysiological signals and use multi-head attention mechanisms for feature fusion to improve recognition performance. Our method includes two stages: first, we use the Meiosis method to group sample and augment unlabeled electrophysiological signals and design a self-supervised contrastive learning task; second, we apply the trained feature extractor to labeled electrophysiological signals and use multi-head attention mechanisms for feature fusion. We conducted experiments on two public datasets, DEAP and MAHNOB-HCI, and our method outperformed existing benchmark methods in emotion recognition tasks and had good cross-individual generalization ability.

cs.MM↗
arXiv2023

Enhancing Cross-lingual Transfer via Phonemic Transcription Integration

Previous cross-lingual transfer methods are restricted to orthographic representation learning via textual scripts. This limitation hampers cross-lingual transfer and is biased towards languages sharing similar well-known scripts. To alleviate the gap between languages from different writing scripts, we propose PhoneXL, a framework incorporating phonemic transcriptions as an additional linguistic modality beyond the traditional orthographic transcriptions for cross-lingual transfer. Particularly, we propose unsupervised alignment objectives to capture (1) local one-to-one alignment between the two different modalities, (2) alignment via multi-modality contexts to leverage information from additional modalities, and (3) alignment via multilingual contexts where additional bilingual dictionaries are incorporated. We also release the first phonemic-orthographic alignment dataset on two token-level tasks (Named Entity Recognition and Part-of-Speech Tagging) among the understudied but interconnected Chinese-Japanese-Korean-Vietnamese (CJKV) languages. Our pilot study reveals phonemic transcription provides essential information beyond the orthography to enhance cross-lingual transfer and bridge the gap among CJKV languages, leading to consistent improvements on cross-lingual token-level tasks over orthographic-based multilingual PLMs.

cs.CL↗
arXiv2023

Learning to Branch in Combinatorial Optimization with Graph Pointer Networks

Branch-and-bound is a typical way to solve combinatorial optimization problems. This paper proposes a graph pointer network model for learning the variable selection policy in the branch-and-bound. We extract the graph features, global features and historical features to represent the solver state. The proposed model, which combines the graph neural network and the pointer mechanism, can effectively map from the solver state to the branching variable decisions. The model is trained to imitate the classic strong branching expert rule by a designed top-k Kullback-Leibler divergence loss function. Experiments on a series of benchmark problems demonstrate that the proposed approach significantly outperforms the widely used expert-designed branching rules. Our approach also outperforms the state-of-the-art machine-learning-based branch-and-bound methods in terms of solving speed and search tree size on all the test instances. In addition, the model can generalize to unseen instances and scale to larger instances.

cs.LG↗
arXiv2023

A Search for Light Fermionic Dark Matter Absorption on Electrons in PandaX-4T

We report a search on a sub-MeV fermionic dark matter absorbed by electrons with an outgoing active neutrino using the 0.63 tonne-year exposure collected by PandaX-4T liquid xenon experiment. No significant signals are observed over the expected background. The data are interpreted into limits to the effective couplings between such dark matter and electrons. For axial-vector or vector interactions, our sensitivity is competitive in comparison to existing astrophysical bounds on the decay of such dark matter into photon final states. In particular, we present the first direct detection limits for an axial-vector (vector) interaction which are the strongest in the mass range from 25 to 45 (35 to 50) keV/c$^2$.

hep-ex↗
arXiv2023

Privacy and Fairness in Federated Learning: on the Perspective of Trade-off

Federated learning (FL) has been a hot topic in recent years. Ever since it was introduced, researchers have endeavored to devise FL systems that protect privacy or ensure fair results, with most research focusing on one or the other. As two crucial ethical notions, the interactions between privacy and fairness are comparatively less studied. However, since privacy and fairness compete, considering each in isolation will inevitably come at the cost of the other. To provide a broad view of these two critical topics, we presented a detailed literature review of privacy and fairness issues, highlighting unique challenges posed by FL and solutions in federated settings. We further systematically surveyed different interactions between privacy and fairness, trying to reveal how privacy and fairness could affect each other and point out new research directions in fair and private FL.

cs.LG↗
arXiv2023

A Dynamic Adverse Selection Multiagent Model with Off-Menu Actions

In dynamic mechanism design literature, one critical aspect has been typically ignored-the agents' periodic participation, which they can adapt and plan strategically. We propose a framework for dynamic principal-multiagent problems, augmenting the classic model by incorporating agents' periodic coupled decisions on participation and regular action selections. The principal faces adverse selection and designs a mechanism comprising a task policy profile (defining evolving agent action menus), a coupling policy profile (affecting agent utilities), and an off-switch function profile (assigning rewards or penalties upon agent withdrawal). Firstly, we introduce payoff-flow conservation-a sufficient condition to ensure dynamic incentive compatibility for regular actions. Secondly, we formulate a unique process, persistence transformation, which integrates task policy's implicit functions, enabling a closed-form off-switch function derivation, hence securing sufficient conditions for agents' coupled decisions' incentive compatibility, aligning with the principal's preferences. Thirdly, we go beyond the traditional envelope theorem by presenting a necessary condition for incentive compatibility, leveraging the coupled optimality of principal-desired actions. This approach helps explicitly formulate both the coupling and off-switch functions. Finally, we establish envelope-like conditions exclusively on the task policies, facilitating the application of the first-order approach.

cs.GT↗
arXiv2023

1st Place Solution for PVUW Challenge 2023: Video Panoptic Segmentation

Video panoptic segmentation is a challenging task that serves as the cornerstone of numerous downstream applications, including video editing and autonomous driving. We believe that the decoupling strategy proposed by DVIS enables more effective utilization of temporal information for both "thing" and "stuff" objects. In this report, we successfully validated the effectiveness of the decoupling strategy in video panoptic segmentation. Finally, our method achieved a VPQ score of 51.4 and 53.7 in the development and test phases, respectively, and ultimately ranked 1st in the VPS track of the 2nd PVUW Challenge. The code is available at https://github.com/zhang-tao-whu/DVIS

cs.CV↗
arXiv2023

Differences in boundary behavior in the 3D vertex and Voronoi models

An important open question in the modeling of biological tissues is how to identify the right scale for coarse-graining, or equivalently, the right number of degrees of freedom. For confluent biological tissues, both vertex and Voronoi models, which differ only in their representation of the degrees of freedom, have effectively been used to predict behavior, including fluid-solid transitions and cell tissue compartmentalization, which are important for biological function. However, recent work in 2D has hinted that there may be differences between the two models in systems with heterotypic interfaces between two tissue types, and there is a burgeoning interest in 3D tissue models. Therefore, we compare the geometric structure and dynamic sorting behavior in mixtures of two cell types in both 3D vertex and Voronoi models. We find that while the cell shape indices exhibit similar trends in both models, the registration between cell centers and cell orientation at the boundary are significantly different between the two models. We demonstrate that these macroscopic differences are caused by changes to the cusp-like restoring forces introduced by the different representations of the degrees of freedom at the boundary, and that the Voronoi model is more strongly constrained by forces that are an artifact of the way the degrees of freedom are represented. This suggests that vertex models may be more appropriate for 3D simulations of tissues with heterotypic contacts.

q-bio.TO↗
arXiv2023

Photonic Integrated Neuro-Synaptic Core for Convolutional Spiking Neural Network

Neuromorphic photonic computing has emerged as a competitive computing paradigm to overcome the bottlenecks of the von-Neumann architecture. Linear weighting and nonlinear spiking activation are two fundamental functions of a photonic spiking neural network (PSNN). However, they are separately implemented with different photonic materials and devices, hindering the large-scale integration of PSNN. Here, we propose, fabricate and experimentally demonstrate a photonic neuro-synaptic chip enabling the simultaneous implementation of linear weighting and nonlinear spiking activation based on a distributed feedback (DFB) laser with a saturable absorber (DFB-SA). A prototypical system is experimentally constructed to demonstrate the parallel weighted function and nonlinear spike activation. Furthermore, a four-channel DFB-SA array is fabricated for realizing matrix convolution of a spiking convolutional neural network, achieving a recognition accuracy of 87% for the MNIST dataset. The fabricated neuro-synaptic chip offers a fundamental building block to construct the large-scale integrated PSNN chip.

physics.optics↗
arXiv2023

Extending structures for noncommutative Poisson bialgebras

We introduce the concept of braided noncommutative Poisson bialgebras. The theory of cocycle bicrossproducts for noncommutative Poisson bialgebras is developed. As an application, we solve the extending problem by using some non-abelian cohomology theory.

math.RA↗
arXiv2023

Accelerating the assembly of defect-free atomic arrays with maximum parallelisms

Defect-free atomic arrays have been demonstrated as a scalable and fully-controllable platform for quantum simulations and quantum computations. To push the qubit size limit of this platform further, we design an integrated measurement and feedback system, based on field programmable gate array (FPGA), to quickly assemble two-dimensional defect-free atomic array using maximum parallelisms. The total time cost of the rearrangement is first reduced by processing atom detection, atomic occupation analysis, rearrangement strategy formulation, and acousto-optic deflectors (AOD) driving signal generation in parallel in time. Then, by simultaneously moving multiple atoms in the same row (column), we save rearrangement time by parallelism in space. To best utilize these parallelisms, we propose a new algorithm named Tetris algorithm to reassemble atoms to arbitrary target array geometry from two-dimensional stochastically loaded atomic arrays. For an $L \times L$ target array geometry, the number of moves scales as $L$, and the total rearrangement time scales at most as $L^2$. We present the overall performance for different target geometries, and demonstrate a significant reduction in rearrangement time and the potential to scale up defect-free atomic array system to thousands of qubits.

physics.atom-ph↗