Search arXiv⌕ Search

arXiv subjects

Chao Zhang

Publications and source records attributed to Chao Zhang.

At least 811 records · Page 45Linked to original sources

Self-Supervised Consistent Quantization for Fully Unsupervised Image Retrieval

Unsupervised image retrieval aims to learn an efficient retrieval system without expensive data annotations, but most existing methods rely heavily on handcrafted feature descriptors or pre-trained feature extractors. To minimize human supervision, recent advance proposes deep fully unsupervised image retrieval aiming at training a deep model from scratch to jointly optimize visual features and quantization codes. However, existing approach mainly focuses on instance contrastive learning without considering underlying semantic structure information, resulting in sub-optimal performance. In this work, we propose a novel self-supervised consistent quantization approach to deep fully unsupervised image retrieval, which consists of part consistent quantization and global consistent quantization. In part consistent quantization, we devise part neighbor semantic consistency learning with codeword diversity regularization. This allows to discover underlying neighbor structure information of sub-quantized representations as self-supervision. In global consistent quantization, we employ contrastive learning for both embedding and quantized representations and fuses these representations for consistent contrastive regularization between instances. This can make up for the loss of useful representation information during quantization and regularize consistency between instances. With a unified learning objective of part and global consistent quantization, our approach exploits richer self-supervision cues to facilitate model learning. Extensive experiments on three benchmark datasets show the superiority of our approach over the state-of-the-art methods.

cs.CV↗

ATOMS: ALMA Three-millimeter Observations of Massive Star-forming regions -- XI. From inflow to infall in hub-filament systems

We investigate the presence of hub-filament systems in a large sample of 146 active proto-clusters, using H$^{13}$CO$^{+}$ J=1-0 molecular line data obtained from the ATOMS survey. We find that filaments are ubiquitous in proto-clusters, and hub-filament systems are very common from dense core scales ($\sim$0.1 pc) to clump/cloud scales ($\sim$1-10 pc). The proportion of proto-clusters containing hub-filament systems decreases with increasing dust temperature ($T_d$) and luminosity-to-mass ratios ($L/M$) of clumps, indicating that stellar feedback from H{\sc ii} regions gradually destroys the hub-filament systems as proto-clusters evolve. Clear velocity gradients are seen along the longest filaments with a mean velocity gradient of 8.71 km s$^{-1}$pc$^{-1}$ and a median velocity gradient of 5.54 km s$^{-1}$pc$^{-1}$. We find that velocity gradients are small for filament lengths larger than $\sim$1~pc, probably hinting at the existence of inertial inflows, although we cannot determine whether the latter are driven by large-scale turbulence or large-scale gravitational contraction. In contrast, velocity gradients below $\sim$1~pc dramatically increase as filament lengths decrease, indicating that the gravity of the hubs or cores starts to dominate gas infall at small scales. We suggest that self-similar hub-filament systems and filamentary accretion at all scales may play a key role in high-mass star formation.

astro-ph.GA↗

Supersolid phases of lattice dipoles tilted in three-dimensions

By means of quantum Monte Carlo simulations we study phase diagrams of dipolar bosons in a square optical lattice. The dipoles in the system are parallel to each other and their orientation can be fixed in any direction of the three-dimensional space. Starting from experimentally tunable parameters like scattering length and dipolar interaction strength, we derive the parameters entering the effective Hamiltonian. Depending on the direction of the dipoles, various types of supersolids (e.g. checkerboard, stripe) and solids (checkerboard, stripe, diagonal stripe, and an incompressible phase) can be stabilized. Remarkably, we find a cluster supersolid characterized by the formation of horizontal clusters of particles. These clusters order along a direction at an angle with the horizontal. Moreover, we find what we call a grain-boundary superfluid. In this phase, regions with solid order are separated by extended defects -- grain boundaries -- which support superfluidity. We also investigate the robustness of the stripe supersolid against thermal fluctuations. Finally, we comment on the experimental realization of the phases found.

cond-mat.quant-gas↗

Image Deformation Estimation via Multi-Objective Optimization

The free-form deformation model can represent a wide range of non-rigid deformations by manipulating a control point lattice over the image. However, due to a large number of parameters, it is challenging to fit the free-form deformation model directly to the deformed image for deformation estimation because of the complexity of the fitness landscape. In this paper, we cast the registration task as a multi-objective optimization problem (MOP) according to the fact that regions affected by each control point overlap with each other. Specifically, by partitioning the template image into several regions and measuring the similarity of each region independently, multiple objectives are built and deformation estimation can thus be realized by solving the MOP with off-the-shelf multi-objective evolutionary algorithms (MOEAs). In addition, a coarse-to-fine strategy is realized by image pyramid combined with control point mesh subdivision. Specifically, the optimized candidate solutions of the current image level are inherited by the next level, which increases the ability to deal with large deformation. Also, a post-processing procedure is proposed to generate a single output utilizing the Pareto optimal solutions. Comparative experiments on both synthetic and real-world images show the effectiveness and usefulness of our deformation estimation method.

cs.CV↗

Sparse Conditional Hidden Markov Model for Weakly Supervised Named Entity Recognition

Weakly supervised named entity recognition methods train label models to aggregate the token annotations of multiple noisy labeling functions (LFs) without seeing any manually annotated labels. To work well, the label model needs to contextually identify and emphasize well-performed LFs while down-weighting the under-performers. However, evaluating the LFs is challenging due to the lack of ground truths. To address this issue, we propose the sparse conditional hidden Markov model (Sparse-CHMM). Instead of predicting the entire emission matrix as other HMM-based methods, Sparse-CHMM focuses on estimating its diagonal elements, which are considered as the reliability scores of the LFs. The sparse scores are then expanded to the full-fledged emission matrix with pre-defined expansion functions. We also augment the emission with weighted XOR scores, which track the probabilities of an LF observing incorrect entities. Sparse-CHMM is optimized through unsupervised learning with a three-stage training pipeline that reduces the training difficulty and prevents the model from falling into local optima. Compared with the baselines in the Wrench benchmark, Sparse-CHMM achieves a 3.01 average F1 score improvement on five comprehensive datasets. Experiments show that each component of Sparse-CHMM is effective, and the estimated LF reliabilities strongly correlate with true LF F1 scores.

cs.CL↗

Learning Efficient Vision Transformers via Fine-Grained Manifold Distillation

In the past few years, transformers have achieved promising performances on various computer vision tasks. Unfortunately, the immense inference overhead of most existing vision transformers withholds their from being deployed on edge devices such as cell phones and smart watches. Knowledge distillation is a widely used paradigm for compressing cumbersome architectures via transferring information to a compact student. However, most of them are designed for convolutional neural networks (CNNs), which do not fully investigate the character of vision transformer (ViT). In this paper, we utilize the patch-level information and propose a fine-grained manifold distillation method. Specifically, we train a tiny student model to match a pre-trained teacher model in the patch-level manifold space. Then, we decouple the manifold matching loss into three terms with careful design to further reduce the computational costs for the patch relationship. Equipped with the proposed method, a DeiT-Tiny model containing 5M parameters achieves 76.5% top-1 accuracy on ImageNet-1k, which is +2.0% higher than previous distillation approaches. Transfer learning results on other classification benchmarks and downstream vision tasks also demonstrate the superiority of our method over the state-of-the-art algorithms.

cs.CV↗

Matrix Infinitely Divisible Series: Tail Inequalities and Their Applications

In this paper, we study tail inequalities of the largest eigenvalue of a matrix infinitely divisible (i.d.) series, which is a finite sum of fixed matrices weighted by i.d. random variables. We obtain several types of tail inequalities, including Bennett-type and Bernstein-type inequalities. This allows us to further bound the expectation of the spectral norm of a matrix i.d. series. Moreover, by developing a new lower-bound function for $Q(s)=(s+1)\log(s+1)-s$ that appears in the Bennett-type inequality, we derive a tighter tail inequality of the largest eigenvalue of the matrix i.d. series than the Bernstein-type inequality when the matrix dimension is high. The resulting lower-bound function is of independent interest and can improve any Bennett-type concentration inequality that involves the function $Q(s)$. The class of i.d. probability distributions is large and includes Gaussian and Poisson distributions, among many others. Therefore, our results encompass the existing work \cite{tropp2012user} on matrix Gaussian series as a special case. Lastly, we show that the tail inequalities of a matrix i.d. series have applications in several optimization problems including the chance constrained optimization problem and the quadratic optimization problem with orthogonality constraints. In addition, we also use the resulting tail bounds to show that random matrices constructed from i.d. random variables satisfy the restricted isometry property (RIP) when it acts as a measurement matrix in compressed sensing.

cs.IT↗

Detection of gravitational wave mixed polarization with single space-based detectors

General Relativity predicts only two tensor polarization modes for gravitational waves while at most six possible polarization modes are allowed in general metric theory of gravity. The number of polarization modes is determined by the specific modified theory of gravity. Therefore, the determination of polarization modes can be used to test gravitational theory. We introduce a concrete data analysis pipeline for a space-based detector such as LISA to detect the polarization modes of gravitational waves. This method can be used for monochromatic gravitational waves emitted from any compact binary system with known sky position and frequency to detect mixtures of tensor and extra polarization modes. We use the source J0806.3+1527 with one-year simulation data as an example to show that this approach is capable of probing pure and mixed polarizations without knowing the exact polarization modes. We also find that the ability of detection of extra polarization depends on the gravitational wave source location and the amplitude of non-tensorial components.

gr-qc↗

jTrans: Jump-Aware Transformer for Binary Code Similarity

Binary code similarity detection (BCSD) has important applications in various fields such as vulnerability detection, software component analysis, and reverse engineering. Recent studies have shown that deep neural networks (DNNs) can comprehend instructions or control-flow graphs (CFG) of binary code and support BCSD. In this study, we propose a novel Transformer-based approach, namely jTrans, to learn representations of binary code. It is the first solution that embeds control flow information of binary code into Transformer-based language models, by using a novel jump-aware representation of the analyzed binaries and a newly-designed pre-training task. Additionally, we release to the community a newly-created large dataset of binaries, BinaryCorp, which is the most diverse to date. Evaluation results show that jTrans outperforms state-of-the-art (SOTA) approaches on this more challenging dataset by 30.5% (i.e., from 32.0% to 62.5%). In a real-world task of known vulnerability searching, jTrans achieves a recall that is 2X higher than existing SOTA baselines.

cs.CR↗

Minimising Biasing Word Errors for Contextual ASR with the Tree-Constrained Pointer Generator

Contextual knowledge is essential for reducing speech recognition errors on high-valued long-tail words. This paper proposes a novel tree-constrained pointer generator (TCPGen) component that enables end-to-end ASR models to bias towards a list of long-tail words obtained using external contextual information. With only a small overhead in memory use and computation cost, TCPGen can structure thousands of biasing words efficiently into a symbolic prefix-tree and creates a neural shortcut between the tree and the final ASR output to facilitate the recognition of the biasing words. To enhance TCPGen, we further propose a novel minimum biasing word error (MBWE) loss that directly optimises biasing word errors during training, along with a biasing-word-driven language model discounting (BLMD) method during the test. All contextual ASR systems were evaluated on the public Librispeech audiobook corpus and the data from the dialogue state tracking challenges (DSTC) with the biasing lists extracted from the dialogue-system ontology. Consistent word error rate (WER) reductions were achieved with TCPGen, which were particularly significant on the biasing words with around 40\% relative reductions in the recognition error rates. MBWE and BLMD further improved the effectiveness of TCPGen and achieved more significant WER reductions on the biasing words. TCPGen also achieved zero-shot learning of words not in the audio training set with large WER reductions on the out-of-vocabulary words in the biasing list.

cs.CL↗

A deep machine learning potential for atomistic simulation of Fe-Si-O systems under Earth's outer core conditions

Using artificial neural-network machine learning (ANN-ML) to generate interatomic potentials has been demonstrated to be a promising approach to address the long-standing challenge of accuracy versus efficiency in molecular dynamics (MD) simulations. Here, taking the Fe-Si-O system as a prototype, we show that accurate and transferable ANN-ML potentials can be developed for reliable MD simulations of materials at high-pressure and high-temperature conditions of the Earth's outer core. The ANN-ML potential for Fe-Si-O system is trained by fitting to the energies and forces of related binaries and ternary liquid structures at high pressures and temperatures obtained by first-principles calculations based on density functional theory (DFT). We show that the generated ANN-ML potential describes well the structure and dynamics of liquid phases of this complex system. The efficient ANN-ML potential with DFT accuracy provides a promising scheme for accurate atomistic simulations of structures and dynamics of complex Fe-Si-O system in the Earth's outer core.

cond-mat.mtrl-sci↗

Revisiting PINNs: Generative Adversarial Physics-informed Neural Networks and Point-weighting Method

Physics-informed neural networks (PINNs) provide a deep learning framework for numerically solving partial differential equations (PDEs), and have been widely used in a variety of PDE problems. However, there still remain some challenges in the application of PINNs: 1) the mechanism of PINNs is unsuitable (at least cannot be directly applied) to exploiting a small size of (usually very few) extra informative samples to refine the networks; and 2) the efficiency of training PINNs often becomes low for some complicated PDEs. In this paper, we propose the generative adversarial physics-informed neural network (GA-PINN), which integrates the generative adversarial (GA) mechanism with the structure of PINNs, to improve the performance of PINNs by exploiting only a small size of exact solutions to the PDEs. Inspired from the weighting strategy of the Adaboost method, we then introduce a point-weighting (PW) method to improve the training efficiency of PINNs, where the weight of each sample point is adaptively updated at each training iteration. The numerical experiments show that GA-PINNs outperform PINNs in many well-known PDEs and the PW method also improves the efficiency of training PINNs and GA-PINNs.

cs.LG↗

Self-Training with Differentiable Teacher

Self-training achieves enormous success in various semi-supervised and weakly-supervised learning tasks. The method can be interpreted as a teacher-student framework, where the teacher generates pseudo-labels, and the student makes predictions. The two models are updated alternatingly. However, such a straightforward alternating update rule leads to training instability. This is because a small change in the teacher may result in a significant change in the student. To address this issue, we propose DRIFT, short for differentiable self-training, that treats teacher-student as a Stackelberg game. In this game, a leader is always in a more advantageous position than a follower. In self-training, the student contributes to the prediction performance, and the teacher controls the training process by generating pseudo-labels. Therefore, we treat the student as the leader and the teacher as the follower. The leader procures its advantage by acknowledging the follower's strategy, which involves differentiable pseudo-labels and differentiable sample weights. Consequently, the leader-follower interaction can be effectively captured via Stackelberg gradient, obtained by differentiating the follower's strategy. Experimental results on semi- and weakly-supervised classification and named entity recognition tasks show that our model outperforms existing approaches by large margins.

cs.CL↗

AcTune: Uncertainty-aware Active Self-Training for Semi-Supervised Active Learning with Pretrained Language Models

While pre-trained language model (PLM) fine-tuning has achieved strong performance in many NLP tasks, the fine-tuning stage can be still demanding in labeled data. Recent works have resorted to active fine-tuning to improve the label efficiency of PLM fine-tuning, but none of them investigate the potential of unlabeled data. We propose {\ours}, a new framework that leverages unlabeled data to improve the label efficiency of active PLM fine-tuning. AcTune switches between data annotation and model self-training based on uncertainty: it selects high-uncertainty unlabeled samples for active annotation and low-uncertainty ones for model self-training. Under this framework, we design (1) a region-aware sampling strategy that reduces redundancy when actively querying for annotations and (2) a momentum-based memory bank that dynamically aggregates the model's pseudo labels to suppress label noise in self-training. Experiments on 6 text classification datasets show that AcTune outperforms the strongest active learning and self-training baselines and improves the label efficiency of PLM fine-tuning by 56.2\% on average. Our implementation will be available at \url{https://github.com/yueyu1030/actune}.

cs.CL↗

Detecting electric charge with Extreme Mass Ratio Inspirals

We consider extreme mass ratio inspirals during which an electrically charged compact object with mass $m_p$ and the charge to mass ratio $q$ inspirals around a Schwarzschild black hole of mass $M$. Using the Teukolsky and generalized Sasaki-Nakamura formalisms for the gravitational and electromagnetic perturbations around a Schwarzschild black hole, we numerically calculate the energy flux of both gravitational and electromagnetic waves induced by a charged particle moving in circular orbits. With one year observation of these extreme mass ratio inspirals, we show that space-based gravitational wave detector such as the Laser Interferometer Space Antenna can detect the charge to mass ratio as small as $q\sim 10^{-3}$.

gr-qc↗

Evaluation of cosmogenic production of $^{39}Ar$ and $^{42}Ar$ for rare-event physics using underground argon

Underground argon (UAr) with lower cosmogenic activities of $^{39}Ar$ and $^{42}Ar$ has been planned as a detector in detecting scintillation light and charge collection using time projection chambers for dark matter searches and as a veto detector in suppressing backgrounds for neutrinoless double beta decay (0$νββ$) experiments. Long-lived radioactive isotopes, $^{39}Ar$ and $^{42}Ar$, can also be produced on the surface when UAr is pumped out from a deep well. Understanding the production of long-lived isotopes in Ar is important for utilizing UAr for dark matter and 0$νββ$ experiments in terms of its production, transportation, and storage. Ar exposure to cosmic rays at sea-level is simulated using Geant4 for a given cosmic ray muon, neutron, and proton energy spectrum. We report the simulated cosmogenic production rates of $^{39}Ar$, $^{42}Ar$, and other long-lived isotopes at sea-level from fast neutrons, high energy muons, and high energy protons. Total production rates of 938.53/kg$_{Ar}\cdot$day and 5.81$\times$10$^{-3}$/kg$_{Ar}\cdot$day for $^{39}$Ar and $^{42}$Ar are found from our simulation. Utilizing these production rates, we set a time limit of 954 days constrained by the production of $^{39}$Ar for UAr to be on the surface before it compromises the sensitivity for a dark matter experiment. Similarly, a time limit of 1702 days constrained by the production of $^{42}$Ar is found for a 0$νββ$ experiment.

physics.ins-det↗

Practical considerations for the effect of finite coverage on the azimuthal dependence of global spin alignment

The global spin alignment of vector mesons is a powerful probe to study the vorticity field of the system produced in non-central relativistic heavy-ion collisions. Since the experimental observables of global spin alignment are sensitive to many factors, proper corrections are need to be taken care of when measuring the global spin alignment of vector mesons. In this paper, we propose a method to correct the effect of finite pseudo-rapidity coverage when extract the azimuthal dependence of spin alignment parameter $ρ_{00}$. The effects of the finite pseudo-rapidity coverage on the azimuthal dependence of $ϕ$ meson spin alignment and the potentially exist intrinsic spin alignment effects are taken into consideration. The method presented in this paper is verified in a Monte-Carlo simulation, it allows the measurements of azimuthal dependence of global spin alignment to be conducted properly and accurately.

nucl-th↗

Boundedness of differential transforms for Poisson semigroups generated by Bessel operators

In this paper we analyze the convergence of the following type of series \begin{equation*} T_N f(x)=\sum_{j=N_1}^{N_2} v_j\Big(\mathcal{P}_{a_{j+1}} f(x)-\mathcal{P}_{a_{j}} f(x)\Big),\quad x\in \mathbb R_+, \end{equation*} where $\{\mathcal{P}_t \}_{t>0}$ is the Poisson semigroup of the Bessel operator $\displaystyle Δ_λ:=-{d^2\over dx^2}-{2λ\over x}{d\over dx}$ with $λ$ being a positive constant, $N=(N_1, N_2)\in \mathbb Z^2$ with $N_1<N_2,$ $\{v_j\}_{j\in \mathbb Z}$ is a bounded real sequences and $\{a_j\}_{j\in \mathbb Z}$ is an increasing real sequence. {Our analysis will consist in the boundedness, in $L^p(\mathbb{R}_+)$ and in $BMO(\mathbb{R}_+)$, of the operators $T_N$ and its maximal operator $ T^*f(x)= sup_N \abs{T_N f(x)}.$} It is also shown that the local size of the maximal differential transform operators is the same with the order of a singular integral for functions $f$ having local support.

math.CA↗