Searcharxiv⌕ Search

arXiv subjects

Hao Zhang

Publications and source records attributed to Hao Zhang.

At least 1,081 records · Page 60Linked to original sources

Exceptional surface-enhanced Rotation Sensing with Robustness in an optical microcavity

Exceptional points (EPs) are special singularities of non-Hermitian Hamiltonians. At an EP, two or more eigenvalues and the corresponding eigenstates coalesce. Recently, EP-based optical gyroscope near an EP was extensively investigated to improve the response to rotation. However, the highly resultant dimensionality in the eigenstate space causing from the EP-based system is sensitivity to more external perturbations, that is, the great response at EPs requires strict implementation conditions. To solve this problem, a new non-Hermitian structure was proposed that realizes an exceptional surface (EP surface) constructed of numerous EPs embedded in a high-dimensional parameter space. With respect to the isolated EPs, non-Hermitian EP surface provides additional degrees of freedom to permit the undesired perturbations (such as fabrication errors) shifts along the EP surface which corresponds to the robustness. On the other hand, the rotation will force the system away from these EPs obtaining a sensitivity enhancement of three orders of magnitude, compared to the traditional Sagnac effect rotation detecting. The EP surface system has a potential to combine robustness with enhanced sensitivity of the rotation.

physics.optics↗

GDPNet: Refining Latent Multi-View Graph for Relation Extraction

Relation Extraction (RE) is to predict the relation type of two entities that are mentioned in a piece of text, e.g., a sentence or a dialogue. When the given text is long, it is challenging to identify indicative words for the relation prediction. Recent advances on RE task are from BERT-based sequence modeling and graph-based modeling of relationships among the tokens in the sequence. In this paper, we propose to construct a latent multi-view graph to capture various possible relationships among tokens. We then refine this graph to select important words for relation prediction. Finally, the representation of the refined graph and the BERT-based sequence representation are concatenated for relation extraction. Specifically, in our proposed GDPNet (Gaussian Dynamic Time Warping Pooling Net), we utilize Gaussian Graph Generator (GGG) to generate edges of the multi-view graph. The graph is then refined by Dynamic Time Warping Pooling (DTWPool). On DialogRE and TACRED, we show that GDPNet achieves the best performance on dialogue-level RE, and comparable performance with the state-of-the-arts on sentence-level RE.

cs.CL↗

Observation of 4- and 6-magnon bound-states in the spin-anisotropic frustrated antiferromagnet FeI$_2$

Spin-waves e.g. magnons are the conventional elementary excitations of ordered magnets. However, other possibilities exist. For instance, magnon bound-states can arise due to attractive magnon-magnon interactions and drastically impact the static and dynamic properties of materials. Here, we demonstrate a zoo of distinct multi-magnon quasiparticles in the frustrated spin-1 triangular antiferromagnet FeI$_2$ using time-domain terahertz spectroscopy. The energy-magnetic field excitation spectrum contains signatures of one-, two-, four- and six-magnon bound-states, which we analyze using an exact diagonalization approach for a dilute gas of interacting magnons. The two-magnon single-ion bound states occur due to strong anisotropy and the preponderance of even higher order excitations arises from the tendency of the single-ion bound states to themselves form bound states due to their very flat dispersion. This menagerie of tunable interacting quasiparticles provides a unique platform in a condensed matter setting that is reminiscent of the few-body quantum phenomena central to cold-atom, nuclear, and particle physics experiments.

cond-mat.str-el↗

BSP-Net: Generating Compact Meshes via Binary Space Partitioning

Polygonal meshes are ubiquitous in the digital 3D domain, yet they have only played a minor role in the deep learning revolution. Leading methods for learning generative models of shapes rely on implicit functions, and generate meshes only after expensive iso-surfacing routines. To overcome these challenges, we are inspired by a classical spatial data structure from computer graphics, Binary Space Partitioning (BSP), to facilitate 3D learning. The core ingredient of BSP is an operation for recursive subdivision of space to obtain convex sets. By exploiting this property, we devise BSP-Net, a network that learns to represent a 3D shape via convex decomposition. Importantly, BSP-Net is unsupervised since no convex shape decompositions are needed for training. The network is trained to reconstruct a shape using a set of convexes obtained from a BSP-tree built on a set of planes. The convexes inferred by BSP-Net can be easily extracted to form a polygon mesh, without any need for iso-surfacing. The generated meshes are compact (i.e., low-poly) and well suited to represent sharp geometry; they are guaranteed to be watertight and can be easily parameterized. We also show that the reconstruction quality by BSP-Net is competitive with state-of-the-art methods while using much fewer primitives. Code is available at https://github.com/czq142857/BSP-NET-original.

cs.CV↗

Ada-Segment: Automated Multi-loss Adaptation for Panoptic Segmentation

Panoptic segmentation that unifies instance segmentation and semantic segmentation has recently attracted increasing attention. While most existing methods focus on designing novel architectures, we steer toward a different perspective: performing automated multi-loss adaptation (named Ada-Segment) on the fly to flexibly adjust multiple training losses over the course of training using a controller trained to capture the learning dynamics. This offers a few advantages: it bypasses manual tuning of the sensitive loss combination, a decisive factor for panoptic segmentation; it allows to explicitly model the learning dynamics, and reconcile the learning of multiple objectives (up to ten in our experiments); with an end-to-end architecture, it generalizes to different datasets without the need of re-tuning hyperparameters or re-adjusting the training process laboriously. Our Ada-Segment brings 2.7% panoptic quality (PQ) improvement on COCO val split from the vanilla baseline, achieving the state-of-the-art 48.5% PQ on COCO test-dev split and 32.9% PQ on ADE20K dataset. The extensive ablation studies reveal the ever-changing dynamics throughout the training process, necessitating the incorporation of an automated and adaptive learning strategy as presented in this paper.

cs.CV↗

In Situ Epitaxy of Pure Phase Ultra-Thin InAs-Al Nanowires for Quantum Devices

Hybrid semiconductor-superconductor InAs-Al nanowires with uniform and defect-free crystal interfaces are one of the most promising candidates used in the quest for Majorana zero modes (MZMs). However, InAs nanowires often exhibit a high density of randomly distributed twin defects and stacking faults, which result in an uncontrolled and non-uniform InAs-Al interface. Furthermore, this type of disorder can create potential inhomogeneity in the wire, destroy the topological gap, and form trivial sub-gap states mimicking MZM in transport experiments. Further study shows that reducing the InAs nanowire diameter from growth can significantly suppress the formation of these defects and stacking faults. Here, we demonstrate the in situ growth of ultra-thin InAs nanowires with epitaxial Al film by molecular-beam epitaxy. Our InAs diameter (~ 30 nm) is only one-third of the diameters (~ 100 nm) commonly used in literatures. The ultra-thin InAs nanowires are pure phase crystals for various different growth directions, suggesting a low level of disorder. Transmission electron microscopy confirms an atomically sharp and uniform interface between the Al shell and the InAs wire. Quantum transport study on these devices resolves a hard induced superconducting gap and $2e^-$ periodic Coulomb blockade at zero magnetic field, a necessary step for future MZM experiments. A large zero bias conductance peak with a peak height reaching 80% of $2e^2/h$ is observed.

cond-mat.mtrl-sci↗

AdaCoSeg: Adaptive Shape Co-Segmentation with Group Consistency Loss

We introduce AdaCoSeg, a deep neural network architecture for adaptive co-segmentation of a set of 3D shapes represented as point clouds. Differently from the familiar single-instance segmentation problem, co-segmentation is intrinsically contextual: how a shape is segmented can vary depending on the set it is in. Hence, our network features an adaptive learning module to produce a consistent shape segmentation which adapts to a set. Specifically, given an input set of unsegmented shapes, we first employ an offline pre-trained part prior network to propose per-shape parts. Then, the co-segmentation network iteratively and} jointly optimizes the part labelings across the set subjected to a novel group consistency loss defined by matrix ranks. While the part prior network can be trained with noisy and inconsistently segmented shapes, the final output of AdaCoSeg is a consistent part labeling for the input set, with each shape segmented into up to (a user-specified) K parts. Overall, our method is weakly supervised, producing segmentations tailored to the test set, without consistent ground-truth segmentations. We show qualitative and quantitative results from AdaCoSeg and evaluate it via ablation studies and comparisons to state-of-the-art co-segmentation methods.

cs.CV↗

Sequential Transmission Matrix Evaluation Via Spatiotemporal Transmitted Modes Decomposition

The transmission matrix (TM) is a representation to describe the light scattering process through a scattering medium. The degree of control elements in TM is correlated with the capacity of evaluating enormous equations with tremendous number of unknow parameters, which seriously restricts the efficiency and accuracy of TM, and thus further confines applications such as image recovery. To completely remove this restriction, we propose decomposing TM and sequentially acquiring the dimension reduced decompositions regarding to the time and space invariance nature of transmitted field behind scattering medium. This proposed approach would not only have the ability to achieve high dimension transmission matrix with fully controllable elements, but also brings optimized signal-to-noise ratio during evaluation processing, which provides researchers a way to reach maximal focusing efficiency or image reconstruction resolution.

physics.optics↗

FAME: 3D Shape Generation via Functionality-Aware Model Evolution

We introduce a modeling tool which can evolve a set of 3D objects in a functionality-aware manner. Our goal is for the evolution to generate large and diverse sets of plausible 3D objects for data augmentation, constrained modeling, as well as open-ended exploration to possibly inspire new designs. Starting with an initial population of 3D objects belonging to one or more functional categories, we evolve the shapes through part recombination to produce generations of hybrids or crossbreeds between parents from the heterogeneous shape collection. Evolutionary selection of offsprings is guided both by a functional plausibility score derived from functionality analysis of shapes in the initial population and user preference, as in a design gallery. Since cross-category hybridization may result in offsprings not belonging to any of the known functional categories, we develop a means for functionality partial matching to evaluate functional plausibility on partial shapes. We show a variety of plausible hybrid shapes generated by our functionality-aware model evolution, which can complement existing datasets as training data and boost the performance of contemporary data-driven segmentation schemes, especially in challenging cases. Our tool supports constrained modeling, allowing users to restrict or steer the model evolution with functionality labels. At the same time, unexpected yet functional object prototypes can emerge during open-ended exploration owing to structure breaking when evolving a heterogeneous collection.

cs.GR↗

COALESCE: Component Assembly by Learning to Synthesize Connections

We introduce COALESCE, the first data-driven framework for component-based shape assembly which employs deep learning to synthesize part connections. To handle geometric and topological mismatches between parts, we remove the mismatched portions via erosion, and rely on a joint synthesis step, which is learned from data, to fill the gap and arrive at a natural and plausible part joint. Given a set of input parts extracted from different objects, COALESCE automatically aligns them and synthesizes plausible joints to connect the parts into a coherent 3D object represented by a mesh. The joint synthesis network, designed to focus on joint regions, reconstructs the surface between the parts by predicting an implicit shape representation that agrees with existing parts, while generating a smooth and topologically meaningful connection. We employ test-time optimization to further ensure that the synthesized joint region closely aligns with the input parts to create realistic component assemblies from diverse input parts. We demonstrate that our method significantly outperforms prior approaches including baseline deep models for 3D shape synthesis, as well as state-of-the-art methods for shape completion.

cs.CV↗

Semi-supervised URL Segmentation with Recurrent Neural Networks Pre-trained on Knowledge Graph Entities

Breaking domain names such as openresearch into component words open and research is important for applications like Text-to-Speech synthesis and web search. We link this problem to the classic problem of Chinese word segmentation and show the effectiveness of a tagging model based on Recurrent Neural Networks (RNNs) using characters as input. To compensate for the lack of training data, we propose a pre-training method on concatenated entity names in a large knowledge database. Pre-training improves the model by 33% and brings the sequence accuracy to 85%.

cs.CL↗

Exact resummation of the Holstein-Primakoff expansion and differential equation approach to operator square-roots

Operator square-roots are ubiquitous in theoretical physics. They appear, for example, in the Holstein-Primakoff representation of spin operators and in the Klein-Gordon equation. Often the use of a perturbative expansion is the only recourse when dealing with them. In this work we show that under certain conditions differential equations can be derived which can be used to find perturbatively inaccessible approximations to operator square-roots. Specifically, for the number operator $\hat n=\hat a^†a$ we show that the square-root $\sqrt{\hat n}$ near $\hat n=0$ can be approximated by a polynomial in $\hat n$. This result is unexpected because a Taylor expansion fails. A polynomial expression in $\hat n$ is possible because $\hat n$ is an operator, and its constituents $a$ and $a^†$ have a non-trivial commutator $[a,a^†]=1$ and do not behave as scalars. We apply our approach to the zero mass Klein-Gordon Hamiltonian in a constant magnetic field, and as a main application, the Holstein-Primakoff representation of spin operators, where we are able to find new expressions that are polynomial in bosonic operators. We prove that these new expressions exactly reproduce spin operators. Our expressions are manifestly Hermitian, which offer an advantage over other methods, such as the Dyson-Maleev representation.

cond-mat.str-el↗

PIE-NET: Parametric Inference of Point Cloud Edges

We introduce an end-to-end learnable technique to robustly identify feature edges in 3D point cloud data. We represent these edges as a collection of parametric curves (i.e.,lines, circles, and B-splines). Accordingly, our deep neural network, coined PIE-NET, is trained for parametric inference of edges. The network relies on a "region proposal" architecture, where a first module proposes an over-complete collection of edge and corner points, and a second module ranks each proposal to decide whether it should be considered. We train and evaluate our method on the ABC dataset, a large dataset of CAD models, and compare our results to those produced by traditional (non-learning) processing pipelines, as well as a recent deep learning based edge detector (EC-NET). Our results significantly improve over the state-of-the-art from both a quantitative and qualitative standpoint.

cs.CV↗

RegionTrack: A Trace-based Sound and Complete Checker to Debug Transactional Atomicity Violations and Non-Serializable Traces

Atomicity is a correctness criterion to reason about isolated code regions in a multithreaded program when they are executed concurrently. However, dynamic instances of these code regions, called transactions, may fail to behave atomically, resulting in transactional atomicity violations. Existing dynamic online atomicity checkers incur either false positives or false negatives in detecting transactions experiencing transactional atomicity violations. This paper proposes RegionTrack. RegionTrack tracks cross-thread dependences at the event, dynamic subregion, and transaction levels. It maintains both dynamic subregions within selected transactions and transactional happens-before relations through its novel timestamp propagation approach. We prove that RegionTrack is sound and complete in detecting both transactional atomicity violations and non-serializable traces. To the best of our knowledge, it is the first online technique that precisely captures the transitively closed set of happens-before relations over all conflicting events with respect to every running transaction for the above two kinds of issues. We have evaluated RegionTrack on 19 subjects of the DaCapo and the Java Grande Forum benchmarks. The empirical results confirm that RegionTrack precisely detected all those transactions which experienced transactional atomicity violations and identified all non-serializable traces. The overall results also show that RegionTrack incurred 1.10x and 1.08x lower memory and runtime overheads than Velodrome and 2.10x and 1.21x lower than Aerodrome, respectively. Moreover, it incurred 2.89x lower memory overhead than DoubleChecker. On average, Velodrome detected about 55% fewer violations than RegionTrack, which in turn reported about 3%-70% fewer violations than DoubleChecker.

cs.SE↗

Towards Accurate Predictions of Carrier Mobilities and Thermoelectric Performances in 2D Materials

The interactions between electrons and lattice vibrational modes play the key role in determining the carrier transport properties, thermoelectric performance and other physical quantities related to phonons in semiconductors. However, for two-dimensional (2D) materials, the widely-used models for carrier transport only consider the interactions between electrons and some specific phonon modes, which usually leads to inaccruate predictions of electrons/phonons transport properties. In this work, comprehensive investigations on full electron-phonon couplings and their influences on carrier mobility and thermoelectric performances of 2D group-IV and V elemental monolayers were performed, and we also analyzed in details the selection rules on electron-phonon couplings using group-theory arguments. Our calculations revealed that, for the cases of shallow dopings where only intravalley scatterings are allowed, the contributions from optical phonon modes are significantly larger than those from acoustic phonon modes in group-IV elemental monolayers, and LA and some specific optical phonon modes contribute significantly to the total intravalley scatterings. When the doping increases and intervalley scatterings are allowed, the intervalley scatterings are much stronger than intravalley scatterings, and ZA/TA/LO phonon modes dominate the intervalley scatterings in monolayer Si, Ge and Sn. The dominant contributions to the total intervalley scatterings are ZA/TO in monolayer P, ZA/TO in monolayer As and TO/LO in monolayer Sb. Based on the thorough investigations on the full electron-phonon couplings, we predict accurately the carrier mobilities and thermoelectric figure of merits in these two elemental crystals, and reveal significant reductions when compared with the calculations based on the widely-used simplified model.

cond-mat.mtrl-sci↗

Hartley Spectral Pooling for Deep Learning

In most convolution neural networks (CNNs), downsampling hidden layers is adopted for increasing computation efficiency and the receptive field size. Such operation is commonly so-called pooling. Maximation and averaging over sliding windows (max/average pooling), and plain downsampling in the form of strided convolution are popular pooling methods. Since the pooling is a lossy procedure, a motivation of our work is to design a new pooling approach for less lossy in the dimensionality reduction. Inspired by the Fourier spectral pooling(FSP) proposed by Rippel et. al. [1], we present the Hartley transform based spectral pooling method in CNNs. Compared with FSP, the proposed spectral pooling avoids the use of complex arithmetic for frequency representation and reduces the computation. Spectral pooling preserves more structure features for network's discriminability than max and average pooling. We empirically show that Hartley spectral pooling gives rise to the convergence of training CNNs on MNIST and CIFAR-10 datasets.

cs.CV↗

Context Modeling with Evidence Filter for Multiple Choice Question Answering

Multiple-Choice Question Answering (MCQA) is a challenging task in machine reading comprehension. The main challenge in MCQA is to extract "evidence" from the given context that supports the correct answer. In the OpenbookQA dataset, the requirement of extracting "evidence" is particularly important due to the mutual independence of sentences in the context. Existing work tackles this problem by annotated evidence or distant supervision with rules which overly rely on human efforts. To address the challenge, we propose a simple yet effective approach termed evidence filtering to model the relationships between the encoded contexts with respect to different options collectively and to potentially highlight the evidence sentences and filter out unrelated sentences. In addition to the effective reduction of human efforts of our approach compared, through extensive experiments on OpenbookQA, we show that the proposed approach outperforms the models that use the same backbone and more training data; and our parameter analysis also demonstrates the interpretability of our approach.

cs.CL↗

Effects of intervalley scatterings in thermoelectric performance of band-convergent antimonene

The strategy of band convergence of multi-valley conduction bands or multi-peak valence bands has been widely used to search or improve thermoelectric materials. However, the phonon-assisted intervalley scatterings due to multiple band degeneracy are usually neglected in the thermoelectric community. In this work, we investigate the (thermo)electric properties of non-polar monolayer $β$- and $α$-antimonene considering full mode- and momentum-resolved electron-phonon interactions. We also analyze thoroughly the selection rules on electron-phonon matrix-elements using group-theory arguments. Our calculations reveal strong intervalley scattering between the nearly degenerate valley states in both $β$- and $α$-antimonene, and the commonly-used deformation potential approximation neglecting the dominant intervalley scattering gives inaccurate estimations of the electron-phonon scattering and thermoelectric transport properties. By considering full electron-phonon interactions based on the rigid-band approximation, we find that, the maximum value of the thermoelectric figure of merits $zT$ at room temperature reduces to 0.37 in $β$-antimonene, by a factor of 5.7 comparing to the value predicted based on the constant relaxation-time approximation method. Our work not only provides an accurate prediction of the thermoelectric performances of antimonenes that reveals the key role of intervalley scatterings in determining the electronic part of zT, but also showcases a computational framework for thermoelectric materials.

cond-mat.mtrl-sci↗