Searcharxiv⌕ Search

arXiv subjects

Ting Zhang

Publications and source records attributed to Ting Zhang.

At least 181 records · Page 10Linked to original sources

Protecting Celebrities from DeepFake with Identity Consistency Transformer

In this work we propose Identity Consistency Transformer, a novel face forgery detection method that focuses on high-level semantics, specifically identity information, and detecting a suspect face by finding identity inconsistency in inner and outer face regions. The Identity Consistency Transformer incorporates a consistency loss for identity consistency determination. We show that Identity Consistency Transformer exhibits superior generalization ability not only across different datasets but also across various types of image degradation forms found in real-world applications including deepfake videos. The Identity Consistency Transformer can be easily enhanced with additional identity information when such information is available, and for this reason it is especially well-suited for detecting face forgeries involving celebrities. Code will be released at \url{https://github.com/LightDXY/ICT_DeepFake}

cs.CV↗

General Facial Representation Learning in a Visual-Linguistic Manner

How to learn a universal facial representation that boosts all face analysis tasks? This paper takes one step toward this goal. In this paper, we study the transfer performance of pre-trained models on face analysis tasks and introduce a framework, called FaRL, for general Facial Representation Learning in a visual-linguistic manner. On one hand, the framework involves a contrastive loss to learn high-level semantic meaning from image-text pairs. On the other hand, we propose exploring low-level information simultaneously to further enhance the face representation, by adding a masked image modeling. We perform pre-training on LAION-FACE, a dataset containing large amount of face image-text pairs, and evaluate the representation capability on multiple downstream tasks. We show that FaRL achieves better transfer performance compared with previous pre-trained models. We also verify its superiority in the low-data regime. More importantly, our model surpasses the state-of-the-art methods on face analysis tasks including face parsing and face alignment.

cs.CV↗

Semi-Supervised Image-to-Image Translation using Latent Space Mapping

Recent image-to-image translation works have been transferred from supervised to unsupervised settings due to the expensive cost of capturing or labeling large amounts of paired data. However, current unsupervised methods using the cycle-consistency constraint may not find the desired mapping, especially for difficult translation tasks. On the other hand, a small number of paired data are usually accessible. We therefore introduce a general framework for semi-supervised image translation. Unlike previous works, our main idea is to learn the translation over the latent feature space instead of the image space. Thanks to the low dimensional feature space, it is easier to find the desired mapping function, resulting in improved quality of translation results as well as the stability of the translation model. Empirically we show that using feature translation generates better results, even using a few bits of paired data. Experimental comparisons with state-of-the-art approaches demonstrate the effectiveness of the proposed framework on a variety of challenging image-to-image translation tasks

cs.CV↗

Automatically Generating Counterfactuals for Relation Classification

The goal of relation classification (RC) is to extract the semantic relations between/among entities in the text. As a fundamental task in natural language processing, it is crucial to ensure the robustness of RC models. Despite the high accuracy current deep neural models have achieved in RC tasks, they are easily affected by spurious correlations. One solution to this problem is to train the model with counterfactually augmented data (CAD) such that it can learn the causation rather than the confounding. However, no attempt has been made on generating counterfactuals for RC tasks. In this paper, we formulate the problem of automatically generating CAD for RC tasks from an entity-centric viewpoint, and develop a novel approach to derive contextual counterfactuals for entities. Specifically, we exploit two elementary topological properties, i.e., the centrality and the shortest path, in syntactic and semantic dependency graphs, to first identify and then intervene on the contextual causal features for entities. We conduct a comprehensive evaluation on four RC datasets by combining our proposed approach with a variety of backbone RC models. The results demonstrate that our approach not only improves the performance of the backbones, but also makes them more robust in the out-of-domain test.

cs.CL↗

The Normalized Laplacian Spectrum Analysis of Fractal Mobius Octagonal Networks and its Applications

The study and calculation of spectrum of networks can be used to describe networks structure and quantify analysis of networks performance. The fractal Möbius octagonal networks, denoted by $Q_n$, is derived from the inverse identification of the opposite lateral edges of fractal linear octagonal networks. In this paper, the normalized Laplacian spectrum of $Q_n$ is determined by two matrices $\mathcal {L}_A$ and $\mathcal {L}_S$. As an important application of our results, some topological indices (multiplicative degree-Kirchhoff index, the number of spanning trees) formulas of $Q_n$ are obtained.

math.CO↗

Experimental investigation of quantum uncertainty relations with classical shadows

The quantum component in uncertainty relation can be naturally characterized by the quantum coherence of a quantum state, which is of paramount importance in quantum information science. Here, we experimentally investigate quantum uncertainty relations construed with relative entropy of coherence, $l_1$ norm of coherence and coherence of formation. In stead of quantum state tomographic technology, we employ the classical shadow algorithm for the detection of lower bounds in quantum uncertainty relations. With an all optical setup, we prepare a family of quantum states whose purity can be fully controlled. We experimentally explore the tightness of various lower bounds in different reference bases on the prepared states. Our results indicate the tightness of quantum coherence lower bounds dependents on the reference bases as well as the purity of quantum state.

quant-ph↗

Modified scattering for the one-dimensional Schrödinger equation with a subcritical dissipative nonlinearity

We study the asymptotic behavior in time of solutions to the one dimensional nonlinear Schrödinger equation with a subcritical dissipative nonlinearity $λ|u|^αu$, where $0<α<2$, and $λ$ is a complex constant satisfying $\text{Im} λ>\frac{α|\text{Re} λ|}{2\sqrt{ α+1}}$. For arbitrary large initial data, we present the uniform time decay estimates when $4/3<α<2$, and the large time asymptotics of the solution when $\frac{7+\sqrt{145}}{12}<α<2$. The proof is based on the vector fields method and a semiclassical analysis method.

math.AP↗

Mixed-signal data acquisition system for optically detected magnetic resonance of solid-state spins

We report a mixed-signal data acquisition (DAQ) system for optically detected magnetic resonance (ODMR) of solid-state spins. This system is designed and implemented based on a Field-Programmable-Gate-Array (FPGA) chip assisted with high-speed peripherals. The ODMR experiments often require high-speed mixed-signal data acquisition and processing for general and specific tasks. To this end, we realized a mixed-signal DAQ system which can acquire both analog and digital signals with precise hardware synchronization. The system consist of 4 analog channels (2 inputs and 2 outputs) and 16 optional digital channels works at up to 125 MHz clock rate. With this system, we performed general-purpose ODMR and advanced Lock-in detection experiments of nitrogen-vacancy (NV) centers, and the reported DAQ system shows excellent performance in both single and ensemble spin cases. This work provides a uniform DAQ solution for NV center quantum control system and could be easily extended to other spin-based systems.

quant-ph↗

Robust Mutual Learning for Semi-supervised Semantic Segmentation

Recent semi-supervised learning (SSL) methods are commonly based on pseudo labeling. Since the SSL performance is greatly influenced by the quality of pseudo labels, mutual learning has been proposed to effectively suppress the noises in the pseudo supervision. In this work, we propose robust mutual learning that improves the prior approach in two aspects. First, the vanilla mutual learners suffer from the coupling issue that models may converge to learn homogeneous knowledge. We resolve this issue by introducing mean teachers to generate mutual supervisions so that there is no direct interaction between the two students. We also show that strong data augmentations, model noises and heterogeneous network architectures are essential to alleviate the model coupling. Second, we notice that mutual learning fails to leverage the network's own ability for pseudo label refinement. Therefore, we introduce self-rectification that leverages the internal knowledge and explicitly rectifies the pseudo labels before the mutual teaching. Such self-rectification and mutual teaching collaboratively improve the pseudo label accuracy throughout the learning. The proposed robust mutual learning demonstrates state-of-the-art performance on semantic segmentation in low-data regime.

cs.CV↗

Experimental quantum state measurement with classical shadows

A crucial subroutine for various quantum computing and communication algorithms is to efficiently extract different classical properties of quantum states. In a notable recent theoretical work by Huang, Kueng, and Preskill [Nat. Phys. 16, 1050 (2020)], a thrifty scheme showed how to project the quantum state into classical shadows and simultaneously predict $M$ different functions of a state with only $\mathcal{O}(\log_2 M)$ measurements, independent of the system size and saturating the information-theoretical limit. Here, we experimentally explore the feasibility of the scheme in the realistic scenario with a finite number of measurements and noisy operations. We prepare a four-qubit GHZ state and show how to estimate expectation values of multiple observables and Hamiltonians. We compare the measurement strategies with uniform, biased, and derandomized classical shadows to conventional ones that sequentially measure each state function exploiting either importance sampling or observable grouping. We next demonstrate the estimation of nonlinear functions using classical shadows and analyze the entanglement of the prepared quantum state. Our experiment verifies the efficacy of exploiting (derandomized) classical shadows and sheds light on efficient quantum computing with noisy intermediate-scale quantum hardware.

quant-ph↗

Serrin-type regularity criteria for the 3D MHD equations via one velocity component and one magnetic component

In this paper, we consider the Cauchy problem to the 3D MHD equations. We show that the Serrin--type conditions imposed on one component of the velocity $u_{3}$ and one component of magnetic fields $b_{3}$ with $$ u_{3} \in L^{p_{0},1}(-1,0;L^{q_{0}}(B(2))),\ b_{3} \in L^{p_{1},1}(-1,0;L^{q_{1}}(B(2))), $$ $\frac{2}{p_{0}}+\frac{3}{q_{0}}=\frac{2}{p_{1}}+\frac{3}{q_{1}}=1$ and $3<q_{0},q_{1}<+\infty$ imply that the suitable weak solution is regular at $(0,0)$. The proof is based on the new local energy estimates introduced by Chae-Wolf (Arch. Ration. Mech. Anal. 2021) and Wang-Wu-Zhang (arXiv:2005.11906).

math.AP↗

Anisotropic g-Factor and Spin-Orbit Field in a Ge Hut Wire Double Quantum Dot

Holes in nanowires have drawn significant attention in recent years because of the strong spin-orbit interaction, which plays an important role in constructing Majorana zero modes and manipulating spin-orbit qubits. Here, from the strongly anisotropic leakage current in the spin blockade regime for a double dot, we extract the full g-tensor and find that the spin-orbit field is in plane with an azimuthal angle of 59° to the axis of the nanowire. The direction of the spin-orbit field indicates a strong spin-orbit interaction along the nanowire, which may have originated from the interface inversion asymmetry in Ge hut wires. We also demonstrate two different spin relaxation mechanisms for the holes in the Ge hut wire double dot: spin-flip cotunneling to the leads, and spin-orbit interaction within the double dot. These results help establish feasibility of a Ge-based quantum processor.

cond-mat.mes-hall↗

Activating Hidden Teleportation Power: Theory and Experiment

Ideal quantum teleportation transfers an unknown quantum state intact from one party Alice to the other Bob via the use of a maximally entangled state and the communication of classical information. If Alice and Bob do not share entanglement, the maximal average fidelity between the state to be teleported and the state received, according to a classical measure-and-prepare scheme, is upper bounded by a function $f_{\mathrm{c}}$ that is inversely proportional to the Hilbert space dimension. In fact, even if they share entanglement, the so-called teleportation fidelity may still be less than the classical threshold $f_{\mathrm{c}}$. For two-qubit entangled states, conditioned on a successful local filtering, the teleportation fidelity can always be activated, i.e., boosted beyond $f_{\mathrm{c}}$. Here, for all dimensions larger than two, we show that the teleportation power hidden in a subset of entangled two-qudit Werner states can also be activated. In addition, we show that an entire family of two-qudit rank-deficient states violates the reduction criterion of separability, and thus their teleportation power is either above the classical threshold or can be activated. Using hybrid entanglement prepared in photon pairs, we also provide the first proof-of-principle experimental demonstration of the activation of teleportation power hidden in this latter family of qubit states. The connection between the possibility of activating hidden teleportation power with the closely-related problem of entanglement distillation is discussed.

quant-ph↗

Efficient estimation of multipartite quantum coherence

Quantification of coherence lies at the heart of quantum information processing and fundamental physics. Exact evaluation of coherence measures generally needs a full reconstruction of the density matrix, which becomes intractable for large-scale multipartite systems. Here, we propose a systematic theoretical approach to efficiently estimating lower and upper bounds of coherence in multipartite states. Under the stabilizer formalism, the lower bound is determined by the spectrum estimation method with a small number of measurements and the upper bound is determined by a single measurement. We verify our theory with a four-qubit optical quantum system.We experimentally implement various multi-qubit entangled states, including the Greenberger-Horne-Zeilinger state, the cluster state, and the W state, and show how their coherence are efficiently inferred from measuring few observables.

quant-ph↗

CoCosNet v2: Full-Resolution Correspondence Learning for Image Translation

We present the full-resolution correspondence learning for cross-domain images, which aids image translation. We adopt a hierarchical strategy that uses the correspondence from coarse level to guide the fine levels. At each hierarchy, the correspondence can be efficiently computed via PatchMatch that iteratively leverages the matchings from the neighborhood. Within each PatchMatch iteration, the ConvGRU module is employed to refine the current correspondence considering not only the matchings of larger context but also the historic estimates. The proposed CoCosNet v2, a GRU-assisted PatchMatch approach, is fully differentiable and highly efficient. When jointly trained with image translation, full-resolution semantic correspondence can be established in an unsupervised manner, which in turn facilitates the exemplar-based image translation. Experiments on diverse translation tasks show that CoCosNet v2 performs considerably better than state-of-the-art literature on producing high-resolution images.

cs.CV↗

Bilinear Strichartz's type estimates in Besov spaces with application to inhomogeneous nonlinear biharmonic Schrödinger equation

In this paper, we consider the well-posedness of the inhomogeneous nonlinear biharmonic Schrödinger equation with spatial inhomogeneity coefficient $K(x)$ behaves like $\left|x\right|^{-b}$ for $0<b<\min \left\{\frac{N}{2},4\right\} $. We show the local well-posedness in the whole $H^s$-subcritical case, with $0<s\le2$. The difficulties of this problem come from the singularity of $K(x)$ and the lack of differentiability of the nonlinear term. To resolve this, we derive the bilinear Strichartz's type estimates for the nonlinear biharmonic Schrödinger equations in Besov spaces.

math.AP↗

Global solutions for $H^s$-critical nonlinear biharmonic Schrödinger equation

We consider the nonlinear biharmonic Schrödinger equation $$i\partial_tu+(Δ^2+μΔ)u+f(u)=0,\qquad (\text{BNLS})$$ in the critical Sobolev space $H^s(\R^N)$, where $N\ge1$, $μ=0$ or $-1$, $0<s<\min\{\fc N2,8\}$ and $f(u)$ is a nonlinear function that behaves like $λ\left|u\right|^αu$ with $λ\in\mathbb{C},α=\frac{8}{N-2s}$. We prove the existence and uniqueness of the global solutions to (BNLS) for the small initial data.

math.AP↗