Searcharxiv⌕ Search

arXiv subjects

Yang Zhou

Publications and source records attributed to Yang Zhou.

At least 487 records · Page 27Linked to original sources

Entanglement on multiple $S^2$ boundaries in Chern-Simons theory

Topological entanglement structure amongst disjoint torus boundaries of three manifolds have already been studied within the context of Chern-Simons theory. In this work, we study the topological entanglement due to interaction between the quasiparticles inside three-manifolds with one or more disjoint $S^2$ boundaries in SU($N$) Chern-Simons theory. We focus on the world-lines of quasiparticles (Wilson lines), carrying SU($N$) representations, creating four punctures on every $S^2$. We compute the entanglement entropy by partial tracing some of the boundaries. In fact, the entanglement entropy depends on the SU($N$) representations on these four-punctured $S^2$ boundaries. Further, we observe interesting features on the GHZ-like and W-like entanglement structures. Such a distinction crucially depends on the multiplicity of the irreducible representations in the tensor product of SU($N$) representations.

hep-th↗

SceneGraphNet: Neural Message Passing for 3D Indoor Scene Augmentation

In this paper we propose a neural message passing approach to augment an input 3D indoor scene with new objects matching their surroundings. Given an input, potentially incomplete, 3D scene and a query location, our method predicts a probability distribution over object types that fit well in that location. Our distribution is predicted though passing learned messages in a dense graph whose nodes represent objects in the input scene and edges represent spatial and structural relationships. By weighting messages through an attention mechanism, our method learns to focus on the most relevant surrounding scene context to predict new scene objects. We found that our method significantly outperforms state-of-the-art approaches in terms of correctly predicting objects missing in a scene based on our experiments in the SUNCG dataset. We also demonstrate other applications of our method, including context-based 3D object recognition and iterative scene generation.

cs.CV↗

Higher-genus wall-crossing in Landau-Ginzburg theory

For a Fermat quasi-homogeneous polynomial, we study the associated weighted Fan-Jarvis-Ruan-Witten theory with narrow insertions. We prove a wall-crossing formula in all genera via localization on a master space, which is constructed by introducing an additional tangent vector to the moduli problem. This is a Landau-Ginzburg theory analogue of the higher-genus quasi-map wall-crossing formula proved by Ciocan-Fontanine and Kim. It generalizes the genus-$0$ result by Ross-Ruan and the genus-$1$ result by Guo-Ross.

math.AG↗

$3d$ One-form Mixed Anomaly and Entanglement Entropy

We study mixed anomaly between $G_1$ and $G_2$ of one-form finite symmetry $G_1\times G_2$ in $3d$ Chern-Simons theories. We assign a quantum entanglement structure to two linked $G$-symmetry lines (Wilson loops) and compute the entanglement entropy $S[G]$. We find a measure of the mixed anomaly by computing $S[G_1\times G_2]-S[G_1]-S[G_2]$.

hep-th↗

Entanglement of Purification for Multipartite States and its Holographic Dual

We introduce a new information-theoretic measure of multipartite quantum/classical correlations $Δ_P$, by generalizing the entanglement of purification to multipartite states. We provide proofs of its various properties, focusing on several entropic inequalities, in generic quantum systems. In particular, it turns out that the multipartite entanglement of purification gives an upper bound on multipartite mutual information, which is a generalization of quantum mutual information in the spirit of relative entropy. After that, motivated by a tensor network description of the AdS/CFT correspondence, we also define a holographic dual of multipartite entanglement of purification $Δ_W$, as a sum of minimal areas of codimension-2 surfaces which divide the entanglement wedge into multi-pieces. We prove that this geometrical quantity satisfies all properties we proved for the multipartite entanglement of purification. These agreements strongly support the $Δ_{P}=Δ_{W}$ conjecture. We also show that the multipartite entanglement of purification gives an upper bound on multipartite squashed entanglement, which is a promising measure of multipartite quantum entanglement. We discuss potential saturation of multipartite squashed entanglement onto multipartite mutual information in holographic CFTs and its applications.

hep-th↗

Simplest Little Higgs Revisited: Hidden Mass Relation, Unitarity and Naturalness

We analyze the scalar potential of the Simplest Little Higgs (SLH) model in an approach consistent with the spirit of continuum effective field theory (CEFT). By requiring correct electroweak symmetry breaking (EWSB) with the $125\,\text{GeV}$ Higgs boson, we are able to derive a relation between the pseudo-axion mass $m_η$ and the heavy top mass $m_T$, which serves as a crucial test of the SLH mechanism. By requiring $m_η^2>0$ an upper bound on $m_T$ can be obtained for any fixed SLH global symmetry breaking scale $f$. We also point out that an absolute upper bound on $f$ can be obtained by imposing partial wave unitarity constraint, which in turn leads to absolute upper bounds of $m_T\lesssim 19\,\text{TeV}, m_η\lesssim 1.5\,\text{TeV}$ and $m_{Z'}\lesssim 48\,\text{TeV}$. We present the allowed region in the three-dimensional parameter space characterized by $f,t_β,m_T$, taking into account the requirement of valid EWSB and the constraint from perturbative unitarity. We also propose a strategy of analyzing the fine-tuning problem consistent with the spirit of CEFT and apply it to the SLH. We suggest that the scalar potential and fine-tuning analysis strategies adopted here should also be applicable to a wide class of Little Higgs and Twin Higgs models, which may reveal interesting relations as crucial tests of the related EWSB mechanism and provide a new perspective on assessing their degree of fine-tuning.

hep-ph↗

DeepMove: Learning Place Representations through Large Scale Movement Data

Understanding and reasoning about places and their relationships are critical for many applications. Places are traditionally curated by a small group of people as place gazetteers and are represented by an ID with spatial extent, category, and other descriptions. However, a place context is described to a large extent by movements made from/to other places. Places are linked and related to each other by these movements. This important context is missing from the traditional representation. We present DeepMove, a novel approach for learning latent representations of places. DeepMove advances the current deep learning based place representations by directly model movements between places. We demonstrate DeepMove's latent representations on place categorization and clustering tasks on large place and movement datasets with respect to important parameters. Our results show that DeepMove outperforms state-of-the-art baselines. DeepMove's representations can provide up to 15% higher than competing methods in matching rate of place category and result in up to 39% higher silhouette coefficient value for place clusters. DeepMove is spatial and temporal context aware. It is scalable. It outperforms competing models using much smaller training dataset (a month or 1/12 of data). These qualities make it suitable for a broad class of real-world applications.

cs.LG↗

VisemeNet: Audio-Driven Animator-Centric Speech Animation

We present a novel deep-learning based approach to producing animator-centric speech motion curves that drive a JALI or standard FACS-based production face-rig, directly from input audio. Our three-stage Long Short-Term Memory (LSTM) network architecture is motivated by psycho-linguistic insights: segmenting speech audio into a stream of phonetic-groups is sufficient for viseme construction; speech styles like mumbling or shouting are strongly co-related to the motion of facial landmarks; and animator style is encoded in viseme motion curve profiles. Our contribution is an automatic real-time lip-synchronization from audio solution that integrates seamlessly into existing animation pipelines. We evaluate our results by: cross-validation to ground-truth data; animator critique and edits; visual comparison to recent deep-learning lip-synchronization solutions; and showing our approach to be resilient to diversity in speaker and language.

cs.GR↗

Full 3D Reconstruction of Transparent Objects

Numerous techniques have been proposed for reconstructing 3D models for opaque objects in past decades. However, none of them can be directly applied to transparent objects. This paper presents a fully automatic approach for reconstructing complete 3D shapes of transparent objects. Through positioning an object on a turntable, its silhouettes and light refraction paths under different viewing directions are captured. Then, starting from an initial rough model generated from space carving, our algorithm progressively optimizes the model under three constraints: surface and refraction normal consistency, surface projection and silhouette consistency, and surface smoothness. Experimental results on both synthetic and real objects demonstrate that our method can successfully recover the complex shapes of transparent objects and faithfully reproduce their light refraction properties.

cs.GR↗

Non-Stationary Texture Synthesis by Adversarial Expansion

The real world exhibits an abundance of non-stationary textures. Examples include textures with large-scale structures, as well as spatially variant and inhomogeneous textures. While existing example-based texture synthesis methods can cope well with stationary textures, non-stationary textures still pose a considerable challenge, which remains unresolved. In this paper, we propose a new approach for example-based non-stationary texture synthesis. Our approach uses a generative adversarial network (GAN), trained to double the spatial extent of texture blocks extracted from a specific texture exemplar. Once trained, the fully convolutional generator is able to expand the size of the entire exemplar, as well as of any of its sub-blocks. We demonstrate that this conceptually simple approach is highly effective for capturing large-scale structures, as well as other non-stationary attributes of the input exemplar. As a result, it can cope with challenging textures, which, to our knowledge, no other existing method can handle.

cs.GR↗

Triplet-Center Loss for Multi-View 3D Object Retrieval

Most existing 3D object recognition algorithms focus on leveraging the strong discriminative power of deep learning models with softmax loss for the classification of 3D data, while learning discriminative features with deep metric learning for 3D object retrieval is more or less neglected. In the paper, we study variants of deep metric learning losses for 3D object retrieval, which did not receive enough attention from this area. First , two kinds of representative losses, triplet loss and center loss, are introduced which could learn more discriminative features than traditional classification loss. Then, we propose a novel loss named triplet-center loss, which can further enhance the discriminative power of the features. The proposed triplet-center loss learns a center for each class and requires that the distances between samples and centers from the same class are closer than those from different classes. Extensive experimental results on two popular 3D object retrieval benchmarks and two widely-adopted sketch-based 3D shape retrieval benchmarks consistently demonstrate the effectiveness of our proposed loss, and significant improvements have been achieved compared with the state-of-the-arts.

cs.CV↗

Entanglement on linked boundaries in Chern-Simons theory with generic gauge groups

We study the entanglement for a state on linked torus boundaries in $3d$ Chern-Simons theory with a generic gauge group and present the asymptotic bounds of Rényi entropy at two different limits: (i) large Chern-Simons coupling $k$, and (ii) large rank $r$ of the gauge group. These results show that the Rényi entropies cannot diverge faster than $\ln k$ and $\ln r$, respectively. We focus on torus links $T(2,2n)$ with topological linking number $n$. The Rényi entropy for these links shows a periodic structure in $n$ and vanishes whenever $n = 0 \text{ (mod } \textsf{p})$, where the integer $\textsf{p}$ is a function of coupling $k$ and rank $r$. We highlight that the refined Chern-Simons link invariants can remove such a periodic structure in $n$.

hep-th↗

Low Temperature-Mediated Enhancement of Photoacoustic Imaging Depth

We study the temperature dependence of the underlying mechanisms related to the signal strength and imaging depth in photoacoustic imaging. The presented theoretical and experimental results indicate that imaging depth can be improved by lowering the temperature of the intermediate medium that the laser passes through to reach the imaging target. We discuss the temperature dependency of optical and acoustic properties of the intermediate medium and their changes due to cooling. We demonstrate that the SNR improvement of the photoacoustic signal is mainly due to the reduction of Grüneisen parameter of the intermediate medium which leads to a lower level of background noise. These findings may open new possibilities toward the application of biomedical laser refrigeration.

physics.optics↗

Linking Entanglement and Discrete Anomaly

In $3d$ Chern-Simons theory, there is a discrete one-form symmetry, whose symmetry group is isomorphic to the center of the gauge group. We study the 't Hooft anomaly associated to this discrete one-form symmetry in theories with generic gauge groups, $A,B,C,D$-types. We propose to detect the discrete anomaly by computing the Hopf state entanglement in the subspace spanned by the symmetry generators and develop a systematical way based on the truncated modular S matrix. We check our proposal for many examples.

hep-th↗

Large-Scale 3D Shape Reconstruction and Segmentation from ShapeNet Core55

We introduce a large-scale 3D shape understanding benchmark using data and annotation from ShapeNet 3D object database. The benchmark consists of two tasks: part-level segmentation of 3D shapes and 3D reconstruction from single view images. Ten teams have participated in the challenge and the best performing teams have outperformed state-of-the-art approaches on both tasks. A few novel deep learning architectures have been proposed on various 3D representations on both tasks. We report the techniques used by each team and the corresponding performances. In addition, we summarize the major discoveries from the reported results and possible trends for the future work in the field.

cs.CV↗

Dynamical Anisotropic Response of Black Phosphorus under Magnetic Field

Black phosphorus (BP) has emerged as a promising material candidate for next generation electronic and optoelectronic devices due to its high mobility, tunable band gap and highly anisotropic properties. In this work, polarization resolved ultrafast mid-infrared transient reflection spectroscopy measurements are performed to study the dynamical anisotropic optical properties of BP under magnetic fields up to 9 T. The relaxation dynamics of photoexcited carrier is found to be insensitive to the applied magnetic field due to the broadening of the Landau levels and large effective mass of carriers. While the anisotropic optical response of BP decreases with increasing magnetic field, its enhancement due to the excitation of hot carriers is similar to that without magnetic field. These experimental results can be well interpreted by the magneto-optical conductivity of the Landau levels of BP thin film, based on an effective k*p Hamiltonian and linear response theory. These findings suggest attractive possibilities of multi-dimensional controls of anisotropic response (AR) of BP with light, electric and magnetic field, which further introduces BP to the fantastic magnetic field sensitive applications.

cond-mat.mtrl-sci↗

Who Will You Share a Ride With: Factors that Influence Trust of Potential Rideshare Partners

Ridesharing can save energy, reduce pollution, and alleviate congestion. Ridesharing systems allow peer-to-peer ride matching through mobile-phone applications. In many systems people have little information about the driver and co-riders. Trust heavily influences the usage of a ridesharing system, however, work in this area is limited. In this paper, we investigate the role of social media in shaping trust and delineate factors that influence the decisions of trust placed on a driver or co-rider. We design a ridesharing system where a rider can see the Instagram profile and 10 recent pictures of a co-rider and ask them to make judgments on six trust related questions. We discovered three important factors that shape trust forming: \textit{social proof}, \textit{social approval}, and \textit{self-disclosure}. These three factors account for 40\%, 33\%, and 13\% of the variance, and subsequent factors extracted accounted for substantially less variance. Using these three factors, we successfully build a trust prediction model with F-measure of 87.4\%, an improvement from 78.6\% on using all factors collected.

cs.SI↗

A Tube-and-Droplet-based Approach for Representing and Analyzing Motion Trajectories

Trajectory analysis is essential in many applications. In this paper, we address the problem of representing motion trajectories in a highly informative way, and consequently utilize it for analyzing trajectories. Our approach first leverages the complete information from given trajectories to construct a thermal transfer field which provides a context-rich way to describe the global motion pattern in a scene. Then, a 3D tube is derived which depicts an input trajectory by integrating its surrounding motion patterns contained in the thermal transfer field. The 3D tube effectively: 1) maintains the movement information of a trajectory, 2) embeds the complete contextual motion pattern around a trajectory, 3) visualizes information about a trajectory in a clear and unified way. We further introduce a droplet-based process. It derives a droplet vector from a 3D tube, so as to characterize the high-dimensional 3D tube information in a simple but effective way. Finally, we apply our tube-and-droplet representation to trajectory analysis applications including trajectory clustering, trajectory classification & abnormality detection, and 3D action recognition. Experimental comparisons with state-of-the-art algorithms demonstrate the effectiveness of our approach.

cs.CV↗