arXiv subjects

Hong Liu

Publications and source records attributed to Hong Liu.

At least 343 records · Page 19Linked to original sources

arXiv2021

Anomalous drag in electron-hole condensates with granulated order

We explain the strong interlayer drag resistance observed at low temperatures in bilayer electron-hole systems in terms of an interplay between local electron-hole-pair condensation and disorder-induced carrier density variations. Smooth disorder drives the condensate into a granulated phase where interlayer coherence is formed only in well separated and disconnected regions, or grains, and the densities of electrons and holes accidentally match. The drag resistance is then dominated by Andreev scattering of charge carries between layers at the grains that transfers momentum between layers. We show that this scenario can account for the observed dependence of the drag resistivity on temperature, and on the average charge imbalance between layers.

cond-mat.mes-hall↗

arXiv2021

Bound entanglement in thermalized states and black hole radiation

We study the mixed-state entanglement structure of chaotic quantum many-body systems at late times using the recently developed $\textit{equilibrium approximation}$. A rich entanglement phase diagram emerges when we generalize this technique to evaluate the logarithmic negativity for various universality classes of macroscopically thermalized states. Unlike in the infinite temperature case, when we impose energy constraints at finite temperature, the phase diagrams for the logarithmic negativity and the mutual information become distinct. In particular, we identify a regime where the negativity is extensive but the mutual information is sub-extensive, indicating a large amount of $\textit{bound entanglement}$. When applied to evaporating black holes, these results imply that there is quantum entanglement within the Hawking radiation long before the Page time, although this entanglement may not be distillable into EPR pairs.

hep-th↗

arXiv2021

Nested cycles with no geometric crossings

In 1975, Erdős asked the following question: what is the smallest function $f(n)$ for which all graphs with $n$ vertices and $f(n)$ edges contain two edge-disjoint cycles $C_1$ and $C_2$, such that the vertex set of $C_2$ is a subset of the vertex set of $C_1$ and their cyclic orderings of the vertices respect each other? We prove the optimal linear bound $f(n)=O(n)$ using sublinear expanders.

math.CO↗

arXiv2021

Fractional Helly theorem for Cartesian products of convex sets

Helly's theorem and its variants show that for a family of convex sets in Euclidean space, local intersection patterns influence global intersection patterns. A classical result of Eckhoff in 1988 provided an optimal fractional Helly theorem for axis-aligned boxes, which are Cartesian products of line segments. Answering a question raised by Bárány and Kalai, and independently Lew, we generalize Eckhoff's result to Cartesian products of convex sets in all dimensions. In particular, we prove that given $α\in (1-\frac{1}{t^d},1]$ and a finite family $\mathcal{F}$ of Cartesian products of convex sets $\prod_{i\in[t]}A_i$ in $\mathbb{R}^{td}$ with $A_i\subset \mathbb{R}^d$ if at least $α$-fraction of the $(d+1)$-tuples in $\mathcal{F}$ are intersecting then at least $(1-(t^d(1-α))^{1/(d+1)})$-fraction of sets in $\mathcal{F}$ are intersecting. This is a special case of a more general result on intersections of $d$-Leray complexes. We also provide a construction showing that our result on $d$-Leray complexes is optimal. Interestingly the extremal example is representable as a family of cartesian products of convex sets, implying the bound $α>1-\frac{1}{t^d}$ and the fraction $(1-(t^d(1-α))^{1/(d+1)})$ above are also best possible. The well-known optimal construction for fractional Helly theorem for convex sets in $\mathbb{R}^d$ does not have $(p,d+1)$-condition for sublinear $p$. Inspired by this we give constructions showing that, somewhat surprisingly, imposing additional $(p,d+1)$-condition has negligible effect on improving the quantitative bounds in neither the fractional Helly theorem for convex sets nor Cartesian products of convex sets. Our constructions offer a rich family of distinct extremal configurations for fractional Helly theorem, implying in a sense that the optimal bound is stable.

math.CO↗

arXiv2021

HAWK: Rapid Android Malware Detection through Heterogeneous Graph Attention Networks

Android is undergoing unprecedented malicious threats daily, but the existing methods for malware detection often fail to cope with evolving camouflage in malware. To address this issue, we present HAWK, a new malware detection framework for evolutionary Android applications. We model Android entities and behavioural relationships as a heterogeneous information network (HIN), exploiting its rich semantic metastructures for specifying implicit higher-order relationships. An incremental learning model is created to handle the applications that manifest dynamically, without the need for re-constructing the whole HIN and the subsequent embedding model. The model can pinpoint rapidly the proximity between a new application and existing in-sample applications and aggregate their numerical embeddings under various semantics. Our experiments examine more than 80,860 malicious and 100,375 benign applications developed over a period of seven years, showing that HAWK achieves the highest detection accuracy against baselines and takes only 3.5ms on average to detect an out-of-sample application, with the accelerated training time of 50x faster than the existing approach.

cs.CR↗

arXiv2021

AttentionGAN: Unpaired Image-to-Image Translation using Attention-Guided Generative Adversarial Networks

State-of-the-art methods in image-to-image translation are capable of learning a mapping from a source domain to a target domain with unpaired image data. Though the existing methods have achieved promising results, they still produce visual artifacts, being able to translate low-level information but not high-level semantics of input images. One possible reason is that generators do not have the ability to perceive the most discriminative parts between the source and target domains, thus making the generated images low quality. In this paper, we propose a new Attention-Guided Generative Adversarial Networks (AttentionGAN) for the unpaired image-to-image translation task. AttentionGAN can identify the most discriminative foreground objects and minimize the change of the background. The attention-guided generators in AttentionGAN are able to produce attention masks, and then fuse the generation output with the attention masks to obtain high-quality target images. Accordingly, we also design a novel attention-guided discriminator which only considers attended regions. Extensive experiments are conducted on several generative tasks with eight public datasets, demonstrating that the proposed method is effective to generate sharper and more realistic images compared with existing competitive models. The code is available at https://github.com/Ha0Tang/AttentionGAN.

cs.CV↗

arXiv2021

Optical Rashba effect in a monolithic light-emitting perovskite metasurface

The Rashba effect, i.e., the splitting of electronic spin-polarized bands in the momentum space of a crystal with broken inversion symmetry, has enabled the realization of spin-orbitronic devices, in which spins are manipulated by spin-orbit coupling. In optics, where the helicity of light polarization represents the spin degree of freedom for spin-momentum coupling, the optical Rashba effect is manifested by the splitting of optical states with opposite chirality in the momentum space. Previous realizations of the optical Rashba effect relied on passive devices determining either the propagation direction of surface plasmons or circularly polarized light into nanostructures, or the directional emission of polarized luminescence from metamaterials hybridized with light-emitting media. Here we demonstrate an active device underpinned by the optical Rashba effect, in which a monolithic halide perovskite metasurface emits highly directional chiral photoluminescence. An all-dielectric metasurface design with broken in-plane inversion symmetry is directly embossed into the high refractive index, light-emitting perovskite film, yielding a degree of circular polarization of photoluminescence of 40% at room temperature - more than one order of magnitude greater than in state of art chiral perovskites.

physics.optics↗

arXiv2021

Towards Robustness Against Natural Language Word Substitutions

Robustness against word substitutions has a well-defined and widely acceptable form, i.e., using semantically similar words as substitutions, and thus it is considered as a fundamental stepping-stone towards broader robustness in natural language processing. Previous defense methods capture word substitutions in vector space by using either $l_2$-ball or hyper-rectangle, which results in perturbation sets that are not inclusive enough or unnecessarily large, and thus impedes mimicry of worst cases for robust training. In this paper, we introduce a novel \textit{Adversarial Sparse Convex Combination} (ASCC) method. We model the word substitution attack space as a convex hull and leverages a regularization term to enforce perturbation towards an actual substitution, thus aligning our modeling better with the discrete textual space. Based on the ASCC method, we further propose ASCC-defense, which leverages ASCC to generate worst-case perturbations and incorporates adversarial training towards robustness. Experiments show that ASCC-defense outperforms the current state-of-the-arts in terms of robustness on two prevailing NLP tasks, \emph{i.e.}, sentiment analysis and natural language inference, concerning several attacks across multiple model architectures. Besides, we also envision a new class of defense towards robustness in NLP, where our robustly trained word vectors can be plugged into a normally trained model and enforce its robustness without applying any other defense techniques.

cs.CL↗

arXiv2021

Phase-change perovskite tunable microlaser

Since the invention of the laser, adoption of new gain media and device architectures has provided solutions to a variety of applications requiring specific power, size, spectral, spatial, and temporal tunability. Here we introduce a fundamentally new type of tunable semiconductor laser based on a phase-change perovskite metasurface that acts simultaneously as gain medium and optical cavity. As a proof of principle demonstration, we fabricate a subwavelength-thin perovskite metasurface supporting bound states in the continuum (BICs). Upon the perovskite structural phase transitions, both its refractive index and gain vary substantially, inducing fast (1.35 nm/K rate) and broad spectral tunability (>15 nm in the near-infrared), deterministic spatial mode hopping between polarization vortexes, and hysteretic optical bistability of the microlaser. These features highlight the uniqueness of phase-change perovskite tunable lasers, which may find wide applications in compact and low-cost optical multiplexers, sensors, memories, and LIDARs.

physics.optics↗

arXiv2021

On systems of maximal quantum chaos

A remarkable feature of chaos in many-body quantum systems is the existence of a bound on the quantum Lyapunov exponent. An important question is to understand what is special about maximally chaotic systems which saturate this bound. Here we provide further evidence for the `hydrodynamic' origin of chaos in such systems, and discuss hallmarks of maximally chaotic systems. We first provide evidence that a hydrodynamic effective field theory of chaos we previously proposed should be understood as a theory of maximally chaotic systems. We then emphasize and make explicit a signature of maximal chaos which was only implicit in prior literature, namely the suppression of exponential growth in commutator squares of generic few-body operators. We provide a general argument for this suppression within our chaos effective field theory, and illustrate it using SYK models and holographic systems. We speculate that this suppression indicates that the nature of operator scrambling in maximally chaotic systems is fundamentally different to scrambling in non-maximally chaotic systems. We also discuss a simplest scenario for the existence of a maximally chaotic regime at sufficiently large distances even for non-maximally chaotic systems.

hep-th↗

arXiv2021

Multistate Tuning of Third Harmonic Generation in Fano-Resonant Hybrid Dielectric Metasurfaces

Hybrid dielectric metasurfaces have emerged as a promising approach to enhancing near field confinement and thus achieving high optical nonlinearity using low loss dielectrics. Additional flexibility in design and fabrication of hybrid metasurfaces allows dynamic control of light, which is value-added for a wider range of applications. Here, we demonstrate a tunable and efficient third harmonic generation (THG) via hybrid metasurfaces with phase change material Ge2Sb2Te5 (GST) deposited on top of amorphous silicon nanostructutes. Fano resonance is excited to confine the incident light inside the hybrid metasurfaces, and an experimental quality factor ($Q$-factor) of 125 is achieved at the fundamental pump wavelength around 1210 nm. We demonstrate the switching between a turn-on state of Fano resonance in the amorphous state of GST and a turn-off state in its crystalline state and also gradual multistate tuning of THG emission at its intermediate state. We achieve a high THG conversion efficiency of $η = 2.9*10^{-6}$ %, which is more than ~32 times of that of a GST-based Fabry-Pèrot cavity under a similar pump laser power, thanks to the enhanced field confinement due to the Fano resonance. Our results show the strong potential of GST-based hybrid dielectric metasurfaces for efficient and tunable nonlinear optical devices.

physics.optics↗

arXiv2021

Scaling behavior of density gradient accelerated mixing rate in shock bubble interaction

Variable-density mixing in shock bubble interaction, a canonical flow of Richtermyer-Meshkov instability, is studied by the high-resolution simulation. While the dissipation mainly controls the passive scalar mixing rate, an objective definition of variable-density mixing rate characterizing the macroscopic mixing formation is still lacking, and the fundamental behavior of mixing rate evolution is not yet well understood. Here, we first show that the variable-density mixing of shock bubble interaction is distinctly different from the previous observations in the passive scalar mixing. The widely-accepted hyperbolic conservation of the first moment of concentration in the scalar mixing, i.e., the conservation of the mean concentration, is violated in variable-density flows. We further combine the compositional transport equation and the divergence relation for the miscible flows to provide the evidence that the existence of density gradient accelerated mixing rate, decomposed by the accelerated dissipation term and redistributed diffusion term, contributes to the anomalous decrease or increase of the mean concentration depending on Atwood number. Further analyzing a number of simulations for the cylindrical or spherical bubbles under a broad range of shock Mach numbers, Reynolds numbers, and Peclet numbers, the density gradient accelerated mixing rate exhibits weak dependent on Peclet numbers, and identifies an Atwood number range with high mixing rate, which can be theoretically predicted based on the mode of hyperbolic conservation violation behavior.

physics.flu-dyn↗

arXiv2020

Bi-directional Exponential Angular Triplet Loss for RGB-Infrared Person Re-Identification

RGB-Infrared person re-identification (RGB-IR Re- ID) is a cross-modality matching problem, where the modality discrepancy is a big challenge. Most existing works use Euclidean metric based constraints to resolve the discrepancy between features of images from different modalities. However, these methods are incapable of learning angularly discriminative feature embedding because Euclidean distance cannot measure the included angle between embedding vectors effectively. As an angularly discriminative feature space is important for classifying the human images based on their embedding vectors, in this paper, we propose a novel ranking loss function, named Bi-directional Exponential Angular Triplet Loss, to help learn an angularly separable common feature space by explicitly constraining the included angles between embedding vectors. Moreover, to help stabilize and learn the magnitudes of embedding vectors, we adopt a common space batch normalization layer. The quantitative and qualitative experiments on the SYSU-MM01 and RegDB dataset support our analysis. On SYSU-MM01 dataset, the performance is improved from 7.40% / 11.46% to 38.57% / 38.61% for rank-1 accuracy / mAP compared with the baseline. The proposed method can be generalized to the task of single-modality Re-ID and improves the rank-1 accuracy / mAP from 92.0% / 81.7% to 94.7% / 86.6% on the Market-1501 dataset, from 82.6% / 70.6% to 87.6% / 77.1% on the DukeMTMC-reID dataset. Code: https://github.com/prismformore/expAT

cs.CV↗

arXiv2020

Asymptotic Structure for the Clique Density Theorem

The famous Erdős-Rademacher problem asks for the smallest number of $r$-cliques in a graph with the given number of vertices and edges. Despite decades of active attempts, the asymptotic value of this extremal function for all $r$ was determined only recently, by Reiher [Annals of Mathematics, 184 (2016) 683--707]. Here we describe the asymptotic structure of all almost extremal graphs. This task for $r=3$ was previously accomplished by Pikhurko and Razborov [Combinatorics, Probability and Computing, 26 (2017) 138--160].

math.CO↗

arXiv2020

Multi-Scale Cascading Network with Compact Feature Learning for RGB-Infrared Person Re-Identification

RGB-Infrared person re-identification (RGB-IR Re-ID) aims to match persons from heterogeneous images captured by visible and thermal cameras, which is of great significance in the surveillance system under poor light conditions. Facing great challenges in complex variances including conventional single-modality and additional inter-modality discrepancies, most of the existing RGB-IR Re-ID methods propose to impose constraints in image level, feature level or a hybrid of both. Despite the better performance of hybrid constraints, they are usually implemented with heavy network architecture. As a matter of fact, previous efforts contribute more as pioneering works in new cross-modal Re-ID area while leaving large space for improvement. This can be mainly attributed to: (1) lack of abundant person image pairs from different modalities for training, and (2) scarcity of salient modality-invariant features especially on coarse representations for effective matching. To address these issues, a novel Multi-Scale Part-Aware Cascading framework (MSPAC) is formulated by aggregating multi-scale fine-grained features from part to global in a cascading manner, which results in a unified representation containing rich and enhanced semantic features. Furthermore, a marginal exponential centre (MeCen) loss is introduced to jointly eliminate mixed variances from intra- and inter-modal examples. Cross-modality correlations can thus be efficiently explored on salient features for distinctive modality-invariant feature learning. Extensive experiments are conducted to demonstrate that the proposed method outperforms all the state-of-the-art by a large margin.

cs.CV↗

arXiv2020

Extremal density for sparse minors and subdivisions

We prove an asymptotically tight bound on the extremal density guaranteeing subdivisions of bounded-degree bipartite graphs with a mild separability condition. As corollaries, we answer several questions of Reed and Wood on embedding sparse minors. Among others, $\bullet$ $(1+o(1))t^2$ average degree is sufficient to force the $t\times t$ grid as a topological minor; $\bullet$ $(3/2+o(1))t$ average degree forces every $t$-vertex planar graph as a minor, and the constant $3/2$ is optimal, furthermore, surprisingly, the value is the same for $t$-vertex graphs embeddable on any fixed surface; $\bullet$ a universal bound of $(2+o(1))t$ on average degree forcing every $t$-vertex graph in any nontrivial minor-closed family as a minor, and the constant 2 is best possible by considering graphs with given treewidth.

math.CO↗

arXiv2020

Meta-learning Transferable Representations with a Single Target Domain

Recent works found that fine-tuning and joint training---two popular approaches for transfer learning---do not always improve accuracy on downstream tasks. First, we aim to understand more about when and why fine-tuning and joint training can be suboptimal or even harmful for transfer learning. We design semi-synthetic datasets where the source task can be solved by either source-specific features or transferable features. We observe that (1) pre-training may not have incentive to learn transferable features and (2) joint training may simultaneously learn source-specific features and overfit to the target. Second, to improve over fine-tuning and joint training, we propose Meta Representation Learning (MeRLin) to learn transferable features. MeRLin meta-learns representations by ensuring that a head fit on top of the representations with target training data also performs well on target validation data. We also prove that MeRLin recovers the target ground-truth model with a quadratic neural net parameterization and a source distribution that contains both transferable and source-specific features. On the same distribution, pre-training and joint training provably fail to learn transferable features. MeRLin empirically outperforms previous state-of-the-art transfer learning algorithms on various real-world vision and NLP transfer learning benchmarks.

cs.LG↗

arXiv2020

Guided multi-branch learning systems for sound event detection with sound separation

In this paper, we describe in detail our systems for DCASE 2020 Task 4. The systems are based on the 1st-place system of DCASE 2019 Task 4, which adopts weakly-supervised framework with an attention-based embedding-level pooling module and a semi-supervised learning approach named guided learning. This year, we incorporate multi-branch learning (MBL) into the original system to further improve its performance. MBL uses different branches with different pooling strategies (including instance-level and embedding-level strategies) and different pooling modules (including attention pooling, global max pooling or global average pooling modules), which share the same feature encoder of the model. Therefore, multiple branches pursuing different purposes and focusing on different characteristics of the data can help the feature encoder model the feature space better and avoid over-fitting. To better exploit the strongly-labeled synthetic data, inspired by multi-task learning, we also employ a sound event detection branch. To combine sound separation (SS) with sound event detection (SED), we fuse the results of SED systems with SS-SED systems which are trained using separated sound output by an SS system. The experimental results prove that MBL can improve the model performance and using SS has great potential to improve the performance of SED ensemble system.

cs.SD↗