Searcharxiv⌕ Search

arXiv subjects

Tao Tang

Publications and source records attributed to Tao Tang.

At least 91 records · Page 5Linked to original sources

Learning Self-Regularized Adversarial Views for Self-Supervised Vision Transformers

Automatic data augmentation (AutoAugment) strategies are indispensable in supervised data-efficient training protocols of vision transformers, and have led to state-of-the-art results in supervised learning. Despite the success, its development and application on self-supervised vision transformers have been hindered by several barriers, including the high search cost, the lack of supervision, and the unsuitable search space. In this work, we propose AutoView, a self-regularized adversarial AutoAugment method, to learn views for self-supervised vision transformers, by addressing the above barriers. First, we reduce the search cost of AutoView to nearly zero by learning views and network parameters simultaneously in a single forward-backward step, minimizing and maximizing the mutual information among different augmented views, respectively. Then, to avoid information collapse caused by the lack of label supervision, we propose a self-regularized loss term to guarantee the information propagation. Additionally, we present a curated augmentation policy search space for self-supervised learning, by modifying the generally used search space designed for supervised learning. On ImageNet, our AutoView achieves remarkable improvement over RandAug baseline (+10.2% k-NN accuracy), and consistently outperforms sota manually tuned view policy by a clear margin (up to +1.3% k-NN accuracy). Extensive experiments show that AutoView pretraining also benefits downstream tasks (+1.2% mAcc on ADE20K Semantic Segmentation and +2.8% mAP on revisited Oxford Image Retrieval benchmark) and improves model robustness (+2.3% Top-1 Acc on ImageNet-A and +1.0% AUPR on ImageNet-O). Code and models will be available at https://github.com/Trent-tangtao/AutoView.

cs.CV↗

Room temperature spin-orbit torque efficiency and magnetization switching in SrRuO3-based heterostructures

Spin-orbit torques (SOTs) from transition metal oxides (TMOs) in conjunction with magnetic materials have recently attracted tremendous attention for realizing high-efficient spintronic devices. SrRuO3 is a promising candidate among TMOs due to its large and tunable SOT-efficiency as well as high conductivity and chemical stability. However, a further study for benchmarking the SOT-efficiency and realizing SOT-driven magnetization switching in SrRuO3 is still highly desired so far. Here, we systematically study the SOT properties of high-quality SrRuO3 thin film heterostructuring with different magnetic alloys of both IMA and PMA configuration by the harmonic Hall voltage technique. Our results indicate that SrRuO3 possesses pronounced SOT-efficiency of about 0.2 at room temperature regardless of the magnetic alloys, which is comparable to typical heavy metals (HMs). Furthermore, we achieve SOT-driven magnetization switching with a low threshold current density of 3.8x10^10 A/m^2, demonstrating the promising potential of SrRuO3 for practical devices. By making a comprehensive comparison with HMs, our work unambiguously benchmarks the SOT properties and concludes the advantages of SrRuO3, which may bring more diverse choices for SOT applications by utilizing hybrid-oxide/metal and all-oxide systems.

cond-mat.mtrl-sci↗

Anisotropic linear and nonlinear charge-spin conversion in topological semimetal SrIrO3

Over the past decade, utilizing spin currents in the linear response of electric field to manipulate magnetization states via spin-orbit torques (SOTs) is one of the core concepts for realizing a multitude of spintronic devices. Besides the linear regime, recently, nonlinear charge-spin conversion under the square of electric field has been recognized in a wide variety of materials with nontrivial spin textures, opening an emerging field of nonlinear spintronics. Here, we report the investigation of both linear and nonlinear charge-spin conversion in one single topological semimetal SrIrO3(110) thin film that hosts strong spin-orbit coupling and nontrivial spin textures in the momentum space. In the nonlinear regime, the observation of crystalline direction dependent response indicates the presence of anisotropic surface states induced spin-momentum locking near the Fermi level. Such anisotropic spin textures also give rise to spin currents in the linear response regime, which mainly contributes to the fieldlike SOT component. Our work demonstrates the power of combination of linear and nonlinear approaches in understanding and utilizing charge-spin conversion in topological materials.

cond-mat.mtrl-sci↗

Limits of epidemic prediction using SIR models

The Susceptible-Infectious-Recovered (SIR) equations and their extensions comprise a commonly utilized set of models for understanding and predicting the course of an epidemic. In practice, it is of substantial interest to estimate the model parameters based on noisy observations early in the outbreak, well before the epidemic reaches its peak. This allows prediction of the subsequent course of the epidemic and design of appropriate interventions. However, accurately inferring SIR model parameters in such scenarios is problematic. This article provides novel, theoretical insight on this issue of practical identifiability of the SIR model. Our theory provides new understanding of the inferential limits of routinely used epidemic models and provides a valuable addition to current simulate-and-check methods. We illustrate some practical implications through application to a real-world epidemic data set.

stat.AP↗

Discrete energy analysis of the third-order variable-step BDF time-stepping for diffusion equations

This is one of our series works on discrete energy analysis of the variable-step BDF schemes. In this part, we present stability and convergence analysis of the third-order BDF (BDF3) schemes with variable steps for linear diffusion equations, see e.g. [SIAM J. Numer. Anal., 58:2294-2314] and [Math. Comp., 90: 1207-1226] for our previous works on the BDF2 scheme. To this aim, we first build up a discrete gradient structure of the variable-step BDF3 formula under the condition that the adjacent step ratios are less than 1.4877, by which we can establish a discrete energy dissipation law. Mesh-robust stability and convergence analysis in the $L^2$ norm are then obtained. Here the mesh robustness means that the solution errors are well controlled by the maximum time-step size but independent of the adjacent time-step ratios. We also present numerical tests to support our theoretical results.

math.NA↗

Detecting Outlier Patterns with Query-based Artificially Generated Searching Conditions

In the age of social computing, finding interesting network patterns or motifs is significant and critical for various areas such as decision intelligence, intrusion detection, medical diagnosis, social network analysis, fake news identification, national security, etc. However, sub-graph matching remains a computationally challenging problem, let alone identifying special motifs among them. This is especially the case in large heterogeneous real-world networks. In this work, we propose an efficient solution for discovering and ranking human behavior patterns based on network motifs by exploring a user's query in an intelligent way. Our method takes advantage of the semantics provided by a user's query, which in turn provides the mathematical constraint that is crucial for faster detection. We propose an approach to generate query conditions based on the user's query. In particular, we use meta paths between nodes to define target patterns as well as their similarities, leading to efficient motif discovery and ranking at the same time. The proposed method is examined on a real-world academic network, using different similarity measures between the nodes. The experiment result demonstrates that our method can identify interesting motifs, and is robust to the choice of similarity measures.

cs.SI↗

The Nonequilibrium Mechanism of Noise Enhancer synergizing with Activator in HIV Latency Reactivation

Noise-modulating chemicals can synergize with transcriptional activators in reactivating latent HIV to eliminate latent HIV reservoirs. To understand the underlying biomolecular mechanism, we investigate a previous two-gene-state model and identify two necessary conditions for the synergy: an assumption of inhibition effect of transcription activators on noise enhancers; and frequent transitions to the gene non-transcription-permissive state. We then develop a loop-four-gene-state model with Tat transcription/translation and find that drug synergy is mainly determined by the magnitude and direction of energy input into the genetic regulatory kinetics of the HIV promoter. The inhibition effect of transcription activators is actually a phenomenon of energy dissipation in the nonequilibrium gene transition system. Overall, the loop-four-state model demonstrates that energy dissipation plays a crucial role in HIV latency reactivation, which might be useful for improving drug effects and identifying other synergies on lentivirus latency reactivation.

q-bio.SC↗

Energy plus maximum bound preserving Runge-Kutta methods for the Allen-Cahn equation

It is difficult to design high order numerical schemes which could preserve both the maximum bound property (MBP) and energy dissipation law for certain phase field equations. Strong stability preserving (SSP) Runge-Kutta methods have been developed for numerical solution of hyperbolic partial differential equations in the past few decades, where strong stability means the non-increasing of the maximum bound of the underlying solutions. However, existing framework of SSP RK methods can not handle nonlinear stabilities like energy dissipation law. The aim of this work is to extend this SSP theory to deal with the nonlinear phase field equation of the Allen-Cahn type which typically satisfies both maximum bound preserving (MBP) and energy dissipation law. More precisely, for Runge-Kutta time discretizations, we first derive a general necessary and sufficient condition under which MBP is satisfied; and we further provide a necessary condition under which the MBP scheme satisfies energy dissipation.

math.NA↗

A decreasing upper bound of energy for time-fractional phase-field equations

In this article, we study the energy dissipation property of time-fractional Allen-Cahn equation. We propose a decreasing upper bound of energy that decreases with respect to time and coincides with the original energy at $t = 0$ and as $t$ tends to $\infty$. This upper bound can also be viewed as a nonlocal-in-time modified energy, the summation of the original energy and an accumulation term due to the memory effect of time fractional derivative. In particular, this indicates that the original energy indeed decays w.r.t. time in a small neighborhood at $t=0$. We illustrate the theory mainly with the time-fractional Allen-Cahn equation, but it could be applied to other time-fractional phase-field models such as the Cahn-Hilliard equation. On the discrete level, the first-order L1 and second-order L2 schemes for time-fractional Allen-Cahn equation have similar decreasing modified energies, so that the stability can be established. Some numerical results are provided to illustrate the behavior of this modified energy and to verify our theoretical results.

math.NA↗

Heterogeneous Graph Learning for Explainable Recommendation over Academic Networks

With the explosive growth of new graduates with research degrees every year, unprecedented challenges arise for early-career researchers to find a job at a suitable institution. This study aims to understand the behavior of academic job transition and hence recommend suitable institutions for PhD graduates. Specifically, we design a deep learning model to predict the career move of early-career researchers and provide suggestions. The design is built on top of scholarly/academic networks, which contains abundant information about scientific collaboration among scholars and institutions. We construct a heterogeneous scholarly network to facilitate the exploring of the behavior of career moves and the recommendation of institutions for scholars. We devise an unsupervised learning model called HAI (Heterogeneous graph Attention InfoMax) which aggregates attention mechanism and mutual information for institution recommendation. Moreover, we propose scholar attention and meta-path attention to discover the hidden relationships between several meta-paths. With these mechanisms, HAI provides ordered recommendations with explainability. We evaluate HAI upon a real-world dataset against baseline methods. Experimental results verify the effectiveness and efficiency of our approach.

cs.SI↗

CenGCN: Centralized Convolutional Networks with Vertex Imbalance for Scale-Free Graphs

Graph Convolutional Networks (GCNs) have achieved impressive performance in a wide variety of areas, attracting considerable attention. The core step of GCNs is the information-passing framework that considers all information from neighbors to the central vertex to be equally important. Such equal importance, however, is inadequate for scale-free networks, where hub vertices propagate more dominant information due to vertex imbalance. In this paper, we propose a novel centrality-based framework named CenGCN to address the inequality of information. This framework first quantifies the similarity between hub vertices and their neighbors by label propagation with hub vertices. Based on this similarity and centrality indices, the framework transforms the graph by increasing or decreasing the weights of edges connecting hub vertices and adding self-connections to vertices. In each non-output layer of the GCN, this framework uses a hub attention mechanism to assign new weights to connected non-hub vertices based on their common information with hub vertices. We present two variants CenGCN\_D and CenGCN\_E, based on degree centrality and eigenvector centrality, respectively. We also conduct comprehensive experiments, including vertex classification, link prediction, vertex clustering, and network visualization. The results demonstrate that the two variants significantly outperform state-of-the-art baselines.

cs.LG↗

Asymptotic Analysis on the Sharp Interface Limit of the Time-Fractional Cahn--Hilliard Equation

In this paper, we aim to study the motions of interfaces and coarsening rates governed by the time-fractional Cahn--Hilliard equation (TFCHE). It is observed by many numerical experiments that the microstructure evolution described by the TFCHE displays quite different dynamical processes comparing with the classical Cahn--Hilliard equation, in particular, regarding motions of interfaces and coarsening rates. By using the method of matched asymptotic expansions, we first derive the sharp interface limit models. Then we can theoretically analyze the motions of interfaces with respect to different timescales. For instance, for the TFCHE with the constant diffusion mobility, the sharp interface limit model is a fractional Stefan problem at the time scale $t = O(1)$. However, on the time scale $t = O({\varepsilon}^{1/α} )$ the sharp interface limit model is a fractional Mullins--Sekerka model. Similar asymptotic regime results are also obtained for the case with one-sided degenerated mobility. Moreover, scaling invariant property of the sharp interface models suggests that the TFCHE with constant mobility preserves an $α/3$ coarsening rate and a crossover of the coarsening rates from $α/3$ to $α/4$ is obtained for the case with one-sided degenerated mobility, which are in good agreement with the numerical experiments.

math.AP↗

BossNAS: Exploring Hybrid CNN-transformers with Block-wisely Self-supervised Neural Architecture Search

A myriad of recent breakthroughs in hand-crafted neural architectures for visual recognition have highlighted the urgent need to explore hybrid architectures consisting of diversified building blocks. Meanwhile, neural architecture search methods are surging with an expectation to reduce human efforts. However, whether NAS methods can efficiently and effectively handle diversified search spaces with disparate candidates (e.g. CNNs and transformers) is still an open question. In this work, we present Block-wisely Self-supervised Neural Architecture Search (BossNAS), an unsupervised NAS method that addresses the problem of inaccurate architecture rating caused by large weight-sharing space and biased supervision in previous methods. More specifically, we factorize the search space into blocks and utilize a novel self-supervised training scheme, named ensemble bootstrapping, to train each block separately before searching them as a whole towards the population center. Additionally, we present HyTra search space, a fabric-like hybrid CNN-transformer search space with searchable down-sampling positions. On this challenging search space, our searched model, BossNet-T, achieves up to 82.5% accuracy on ImageNet, surpassing EfficientNet by 2.4% with comparable compute time. Moreover, our method achieves superior architecture rating accuracy with 0.78 and 0.76 Spearman correlation on the canonical MBConv search space with ImageNet and on NATS-Bench size search space with CIFAR-100, respectively, surpassing state-of-the-art NAS methods. Code: https://github.com/changlin31/BossNAS

cs.CV↗

A New Dataset, Poisson GAN and AquaNet for Underwater Object Grabbing

To boost the object grabbing capability of underwater robots for open-sea farming, we propose a new dataset (UDD) consisting of three categories (seacucumber, seaurchin, and scallop) with 2,227 images. To the best of our knowledge, it is the first 4K HD dataset collected in a real open-sea farm. We also propose a novel Poisson-blending Generative Adversarial Network (Poisson GAN) and an efficient object detection network (AquaNet) to address two common issues within related datasets: the class-imbalance problem and the problem of mass small object, respectively. Specifically, Poisson GAN combines Poisson blending into its generator and employs a new loss called Dual Restriction loss (DR loss), which supervises both implicit space features and image-level features during training to generate more realistic images. By utilizing Poisson GAN, objects of minority class like seacucumber or scallop could be added into an image naturally and annotated automatically, which could increase the loss of minority classes during training detectors to eliminate the class-imbalance problem; AquaNet is a high-efficiency detector to address the problem of detecting mass small objects from cloudy underwater pictures. Within it, we design two efficient components: a depth-wise-convolution-based Multi-scale Contextual Features Fusion (MFF) block and a Multi-scale Blursampling (MBP) module to reduce the parameters of the network to 1.3 million. Both two components could provide multi-scale features of small objects under a short backbone configuration without any loss of accuracy. In addition, we construct a large-scale augmented dataset (AUDD) and a pre-training dataset via Poisson GAN from UDD. Extensive experiments show the effectiveness of the proposed Poisson GAN, AquaNet, UDD, AUDD, and pre-training dataset.

cs.CV↗

Stability of the semi-implicit method for the Cahn-Hilliard equation with logarithmic potentials

We consider the two-dimensional Cahn-Hilliard equation with logarithmic potentials and periodic boundary conditions. We employ the standard semi-implicit numerical scheme which treats the linear fourth-order dissipation term implicitly and the nonlinear term explicitly. Under natural constraints on the time step we prove strict phase separation and energy stability of the semi-implicit scheme. This appears to be the first rigorous result for the semi-implicit discretization of the Cahn-Hilliard equation with singular potentials.

math.NA↗

Sharp convergence to steady states of Allen-Cahn

In our recent work we found a surprising breakdown of symmetry conservation: using standard numerical discretization with very high precision the computed numerical solutions corresponding to very nice initial data may converge to completely incorrect steady states due to the gradual accumulation of machine round-off error. We solved this issue by introducing a new Fourier filter technique for solutions with certain band gap properties. To further investigate the attracting basin of steady states we classify in this work all possible bounded nontrivial steady states for the Allen-Cahn equation. We characterize sharp dependence of nontrivial steady states on the diffusion coefficient and prove strict monotonicity of the associated energy. In particular, we establish a certain self-replicating property amongst the hierarchy of steady states and give a full classification of their energies and profiles. We develop a new modulation theory and prove sharp convergence to the steady state with explicit rates and profiles.

math.AP↗

On symmetry breaking of Allen-Cahn

We consider numerical solutions for the Allen-Cahn equation with standard double well potential and periodic boundary conditions. Surprisingly it is found that using standard numerical discretizations with high precision computational solutions may converge to completely incorrect steady states. This happens for very smooth initial data and state-of-the-art algorithms. We analyze this phenomenon and showcase the resolution of this problem by a new symmetry-preserving filter technique. We develop a new theoretical framework and rigorously prove the convergence to steady states for the filtered solutions.

math.AP↗

Numerical Energy Dissipation for Time-Fractional Phase-Field Equations

The numerical integration of phase-field equations is a delicate task which needs to recover at the discrete level intrinsic properties of the solution such as energy dissipation and maximum principle. Although the theory of energy dissipation for classical phase field models is well established, the corresponding theory for time-fractional phase-field models is still incomplete. In this article, we study certain nonlocal-in-time energies using the first-order stabilized semi-implicit L1 scheme. In particular, we will establish a discrete fractional energy law and a discrete weighted energy law. The extension for a $(2-α)$-order L1 scalar auxiliary variable scheme will be investigated. Moreover, we demonstrate that the energy bound is preserved for the L1 schemes with nonuniform time steps. Several numerical experiments are carried to verify our theoretical analysis.

math.NA↗