Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
63works
0followers
34topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

63 published item(s)

preprint2026arXiv

Hyperspectral Image Classification via Efficient Global Spectral Supertoken Clustering

Hyperspectral image classification demands spatially coherent predictions and precise boundary delineation. Yet prevailing superpixel-based methods face an inherent contradiction: clustering aggregates similar pixels into regions, but the subsequent classifier operates pixel-wise, undermining regional consistency. Consequently, existing approaches do not guarantee region-level, boundary-aligned classification. To address this limitation, we propose the Dual-stage Spectrum-Constrained Clustering-based Classifier (DSCC), an end-to-end framework that explicitly decouples clustering from classification by first grouping spectral similar and spatially proximate pixels into spectral supertokens and then performing token-level prediction. At its core, DSCC computes an image-level multi-criteria feature distance between pixels and centers, followed by a locality-aware assignment regularization, enabling the generation of boundary-preserving spectral supertokens. A density-isolation based center selection further yields representative, well-separated centers, reducing redundancy and improving robustness to scale variation. To accommodate mixed land-cover compositions within each token, we introduce a soft-label scheme that encodes class proportions and improves robustness for mixed-class tokens. DSCC attains a CF1 of 0.728 at 197.75 FPS on the WHU-OHS dataset, offering a superior accuracy-efficiency trade-off compared with state-of-the-art methods. Extensive experiments further validate the effectiveness and generality of the proposed dual-stage paradigm for hyperspectral image classification. The source code is available at https://github.com/laprf/DSCC.

preprint2023arXiv

FlowX: Towards Explainable Graph Neural Networks via Message Flows

We investigate the explainability of graph neural networks (GNNs) as a step toward elucidating their working mechanisms. While most current methods focus on explaining graph nodes, edges, or features, we argue that, as the inherent functional mechanism of GNNs, message flows are more natural for performing explainability. To this end, we propose a novel method here, known as FlowX, to explain GNNs by identifying important message flows. To quantify the importance of flows, we propose to follow the philosophy of Shapley values from cooperative game theory. To tackle the complexity of computing all coalitions' marginal contributions, we propose a flow sampling scheme to compute Shapley value approximations as initial assessments of further training. We then propose an information-controlled learning algorithm to train flow scores toward diverse explanation targets: necessary or sufficient explanations. Experimental studies on both synthetic and real-world datasets demonstrate that our proposed FlowX and its variants lead to improved explainability of GNNs. The code is available at https://github.com/divelab/DIG.

preprint2022arXiv

A Data-Driven Approach to Robust Hypothesis Testing Using Sinkhorn Uncertainty Sets

Hypothesis testing for small-sample scenarios is a practically important problem. In this paper, we investigate the robust hypothesis testing problem in a data-driven manner, where we seek the worst-case detector over distributional uncertainty sets centered around the empirical distribution from samples using Sinkhorn distance. Compared with the Wasserstein robust test, the corresponding least favorable distributions are supported beyond the training samples, which provides a more flexible detector. Various numerical experiments are conducted on both synthetic and real datasets to validate the competitive performances of our proposed method.

preprint2022arXiv

A Survey of Neural Trojan Attacks and Defenses in Deep Learning

Artificial Intelligence (AI) relies heavily on deep learning - a technology that is becoming increasingly popular in real-life applications of AI, even in the safety-critical and high-risk domains. However, it is recently discovered that deep learning can be manipulated by embedding Trojans inside it. Unfortunately, pragmatic solutions to circumvent the computational requirements of deep learning, e.g. outsourcing model training or data annotation to third parties, further add to model susceptibility to the Trojan attacks. Due to the key importance of the topic in deep learning, recent literature has seen many contributions in this direction. We conduct a comprehensive review of the techniques that devise Trojan attacks for deep learning and explore their defenses. Our informative survey systematically organizes the recent literature and discusses the key concepts of the methods while assuming minimal knowledge of the domain on the readers part. It provides a comprehensible gateway to the broader community to understand the recent developments in Neural Trojans.

preprint2022arXiv

About One-point Statistics of the Ratio of Two Fourier-transformed Cosmic Fields and an Application

The Fourier transformation is an effective and efficient operation of Gaussianization at the one-point level. Using a set of N-body simulation data, we verified that the one-point distribution functions of the dark matter momentum divergence and density fields closely follow complex Gaussian distributions. The one-point distribution function of the quotient of two complex Gaussian variables is introduced and studied. Statistical theories are then applied to model one-point statistics about the growth of individual Fourier mode of the dark matter density field, which can be obtained by the ratio of two Fourier transformed cosmic fields. Our simulation results proved that the models based on the Gaussian approximation are impressively accurate, and our analysis revealed many interesting aspects about the growth of dark matter's density fluctuation in Fourier space.

preprint2022arXiv

Adversarial attacks and defenses in Speaker Recognition Systems: A survey

Speaker recognition has become very popular in many application scenarios, such as smart homes and smart assistants, due to ease of use for remote control and economic-friendly features. The rapid development of SRSs is inseparable from the advancement of machine learning, especially neural networks. However, previous work has shown that machine learning models are vulnerable to adversarial attacks in the image domain, which inspired researchers to explore adversarial attacks and defenses in Speaker Recognition Systems (SRS). Unfortunately, existing literature lacks a thorough review of this topic. In this paper, we fill this gap by performing a comprehensive survey on adversarial attacks and defenses in SRSs. We first introduce the basics of SRSs and concepts related to adversarial attacks. Then, we propose two sets of criteria to evaluate the performance of attack methods and defense methods in SRSs, respectively. After that, we provide taxonomies of existing attack methods and defense methods, and further review them by employing our proposed criteria. Finally, based on our review, we find some open issues and further specify a number of future directions to motivate the research of SRSs security.

preprint2022arXiv

An Efficient End-to-End 3D Voxel Reconstruction based on Neural Architecture Search

Using neural networks to represent 3D objects has become popular. However, many previous works employ neural networks with fixed architecture and size to represent different 3D objects, which lead to excessive network parameters for simple objects and limited reconstruction accuracy for complex objects. For each 3D model, it is desirable to have an end-to-end neural network with as few parameters as possible to achieve high-fidelity reconstruction. In this paper, we propose an efficient voxel reconstruction method utilizing neural architecture search (NAS) and binary classification. Taking the number of layers, the number of nodes in each layer, and the activation function of each layer as the search space, a specific network architecture can be obtained based on reinforcement learning technology. Furthermore, to get rid of the traditional surface reconstruction algorithms (e.g., marching cube) used after network inference, we complete the end-to-end network by classifying binary voxels. Compared to other signed distance field (SDF) prediction or binary classification networks, our method achieves significantly higher reconstruction accuracy using fewer network parameters.

preprint2022arXiv

An Improved Reinforcement Learning Algorithm for Learning to Branch

Most combinatorial optimization problems can be formulated as mixed integer linear programming (MILP), in which branch-and-bound (B\&B) is a general and widely used method. Recently, learning to branch has become a hot research topic in the intersection of machine learning and combinatorial optimization. In this paper, we propose a novel reinforcement learning-based B\&B algorithm. Similar to offline reinforcement learning, we initially train on the demonstration data to accelerate learning massively. With the improvement of the training effect, the agent starts to interact with the environment with its learned policy gradually. It is critical to improve the performance of the algorithm by determining the mixing ratio between demonstration and self-generated data. Thus, we propose a prioritized storage mechanism to control this ratio automatically. In order to improve the robustness of the training process, a superior network is additionally introduced based on Double DQN, which always serves as a Q-network with competitive performance. We evaluate the performance of the proposed algorithm over three public research benchmarks and compare it against strong baselines, including three classical heuristics and one state-of-the-art imitation learning-based branching algorithm. The results show that the proposed algorithm achieves the best performance among compared algorithms and possesses the potential to improve B\&B algorithm performance continuously.

preprint2022arXiv

Attention-Guided Black-box Adversarial Attacks with Large-Scale Multiobjective Evolutionary Optimization

Fooling deep neural networks (DNNs) with the black-box optimization has become a popular adversarial attack fashion, as the structural prior knowledge of DNNs is always unknown. Nevertheless, recent black-box adversarial attacks may struggle to balance their attack ability and visual quality of the generated adversarial examples (AEs) in tackling high-resolution images. In this paper, we propose an attention-guided black-box adversarial attack based on the large-scale multiobjective evolutionary optimization, termed as LMOA. By considering the spatial semantic information of images, we firstly take advantage of the attention map to determine the perturbed pixels. Instead of attacking the entire image, reducing the perturbed pixels with the attention mechanism can help to avoid the notorious curse of dimensionality and thereby improves the performance of attacking. Secondly, a large-scale multiobjective evolutionary algorithm is employed to traverse the reduced pixels in the salient region. Benefiting from its characteristics, the generated AEs have the potential to fool target DNNs while being imperceptible by the human vision. Extensive experimental results have verified the effectiveness of the proposed LMOA on the ImageNet dataset. More importantly, it is more competitive to generate high-resolution AEs with better visual quality compared with the existing black-box adversarial attacks.

preprint2022arXiv

Boilerplate Detection via Semantic Classification of TextBlocks

We present a hierarchical neural network model called SemText to detect HTML boilerplate based on a novel semantic representation of HTML tags, class names, and text blocks. We train SemText on three published datasets of news webpages and fine-tune it using a small number of development data in CleanEval and GoogleTrends-2017. We show that SemText achieves the state-of-the-art accuracy on these datasets. We then demonstrate the robustness of SemText by showing that it also detects boilerplate effectively on out-of-domain community-based question-answer webpages.

preprint2022arXiv

C3-STISR: Scene Text Image Super-resolution with Triple Clues

Scene text image super-resolution (STISR) has been regarded as an important pre-processing task for text recognition from low-resolution scene text images. Most recent approaches use the recognizer's feedback as clues to guide super-resolution. However, directly using recognition clue has two problems: 1) Compatibility. It is in the form of probability distribution, has an obvious modal gap with STISR - a pixel-level task; 2) Inaccuracy. it usually contains wrong information, thus will mislead the main task and degrade super-resolution performance. In this paper, we present a novel method C3-STISR that jointly exploits the recognizer's feedback, visual and linguistical information as clues to guide super-resolution. Here, visual clue is from the images of texts predicted by the recognizer, which is informative and more compatible with the STISR task; while linguistical clue is generated by a pre-trained character-level language model, which is able to correct the predicted texts. We design effective extraction and fusion mechanisms for the triple cross-modal clues to generate a comprehensive and unified guidance for super-resolution. Extensive experiments on TextZoom show that C3-STISR outperforms the SOTA methods in fidelity and recognition performance. Code is available in https://github.com/zhaominyiz/C3-STISR.

preprint2022arXiv

Certifying Global Optimality of AC-OPF Solutions via sparse polynomial optimization

We report the experimental results on certifying 1% global optimality of solutions of AC-OPF instances from PGLiB via the CS-TSSOS hierarchy -- a moment-SOS based hierarchy that exploits both correlative and term sparsity, which can provide tighter SDP relaxations than Shor's relaxation. Our numerical experiments demonstrate that the CS-TSSOS hierarchy scales well with the problem size and is indeed useful in certifying global optimality of solutions for large-scale real world problems, e.g., the AC-OPF problem. In particular, we are able to certify 1% global optimality for a challenging AC-OPF instance with 6515 buses involving 14398 real variables and 63577 constraints.

preprint2022arXiv

Compressing Deep Graph Neural Networks via Adversarial Knowledge Distillation

Deep graph neural networks (GNNs) have been shown to be expressive for modeling graph-structured data. Nevertheless, the over-stacked architecture of deep graph models makes it difficult to deploy and rapidly test on mobile or embedded systems. To compress over-stacked GNNs, knowledge distillation via a teacher-student architecture turns out to be an effective technique, where the key step is to measure the discrepancy between teacher and student networks with predefined distance functions. However, using the same distance for graphs of various structures may be unfit, and the optimal distance formulation is hard to determine. To tackle these problems, we propose a novel Adversarial Knowledge Distillation framework for graph models named GraphAKD, which adversarially trains a discriminator and a generator to adaptively detect and decrease the discrepancy. Specifically, noticing that the well-captured inter-node and inter-class correlations favor the success of deep GNNs, we propose to criticize the inherited knowledge from node-level and class-level views with a trainable discriminator. The discriminator distinguishes between teacher knowledge and what the student inherits, while the student GNN works as a generator and aims to fool the discriminator. To our best knowledge, GraphAKD is the first to introduce adversarial training to knowledge distillation in graph domains. Experiments on node-level and graph-level classification benchmarks demonstrate that GraphAKD improves the student performance by a large margin. The results imply that GraphAKD can precisely transfer knowledge from a complicated teacher GNN to a compact student GNN.

preprint2022arXiv

Contextual Networks and Unsupervised Ranking of Sentences

We construct a contextual network to represent a document with syntactic and semantic relations between word-sentence pairs, based on which we devise an unsupervised algorithm called CNATAR (Contextual Network And Text Analysis Rank) to score sentences, and rank them through a bi-objective 0-1 knapsack maximization problem over topic analysis and sentence scores. We show that CNATAR outperforms the combined ranking of the three human judges provided on the SummBank dataset under both ROUGE and BLEU metrics, which in term significantly outperforms each individual judge's ranking. Moreover, CNATAR produces so far the highest ROUGE scores over DUC-02, and outperforms previous supervised algorithms on the CNN/DailyMail and NYT datasets. We also compare the performance of CNATAR and the latest supervised neural-network summarization models and compute oracle results.

preprint2022arXiv

Contrastive Semantic-Guided Image Smoothing Network

Image smoothing is a fundamental low-level vision task that aims to preserve salient structures of an image while removing insignificant details. Deep learning has been explored in image smoothing to deal with the complex entanglement of semantic structures and trivial details. However, current methods neglect two important facts in smoothing: 1) naive pixel-level regression supervised by the limited number of high-quality smoothing ground-truth could lead to domain shift and cause generalization problems towards real-world images; 2) texture appearance is closely related to object semantics, so that image smoothing requires awareness of semantic difference to apply adaptive smoothing strengths. To address these issues, we propose a novel Contrastive Semantic-Guided Image Smoothing Network (CSGIS-Net) that combines both contrastive prior and semantic prior to facilitate robust image smoothing. The supervision signal is augmented by leveraging undesired smoothing effects as negative teachers, and by incorporating segmentation tasks to encourage semantic distinctiveness. To realize the proposed network, we also enrich the original VOC dataset with texture enhancement and smoothing labels, namely VOC-smooth, which first bridges image smoothing and semantic segmentation. Extensive experiments demonstrate that the proposed CSGIS-Net outperforms state-of-the-art algorithms by a large margin. Code and dataset are available at https://github.com/wangjie6866/CSGIS-Net.

preprint2022arXiv

Democratizing Domain-Specific Computing

In the past few years, domain-specific accelerators (DSAs), such as Google's Tensor Processing Units, have shown to offer significant performance and energy efficiency over general-purpose CPUs. An important question is whether typical software developers can design and implement their own customized DSAs, with affordability and efficiency, to accelerate their applications. This article presents our answer to this question.

preprint2022arXiv

Dirac electron under periodic magnetic field: Platform for fractional Chern insulator and generalized Wigner crystal

We propose a platform for flat Chern band by subjecting two-dimensional Dirac materials -- such as graphene and topological insulator thin films -- to a periodic magnetic field, which can be created by the vortex lattice of a type-II superconductor. As a generalization of the $n=0$ Landau level, the flat band of Dirac fermion under a nonuniform magnetic field remains at zero energy, exactly dispersionless and topologically protected, while its local density of states is spatially modulated due to the magnetic field variation. In the presence of short-range repulsion, we find fractional Chern insulators emerge at filling factors $ν=1/m$, whose ground states are generalized Laughlin wavefunctions. We further argue that generalized Wigner crystals may emerge at certain commensurate fillings under a highly nonuniform magnetic field in the form of a flux line lattice.

preprint2022arXiv

Downstream Transformer Generation of Question-Answer Pairs with Preprocessing and Postprocessing Pipelines

We present a system called TP3 to perform a downstream task of transformers on generating question-answer pairs (QAPs) from a given article. TP3 first finetunes pretrained transformers on QAP datasets, then uses a preprocessing pipeline to select appropriate answers, feeds the relevant sentences and the answer to the finetuned transformer to generate candidate QAPs, and finally uses a postprocessing pipeline to filter inadequate QAPs. In particular, using pretrained T5 models as transformers and the SQuAD dataset as the finetruning dataset, we show that TP3 generates satisfactory number of QAPs with high qualities on the Gaokao-EN dataset.

preprint2022arXiv

Duality-Induced Regularizer for Semantic Matching Knowledge Graph Embeddings

Semantic matching models -- which assume that entities with similar semantics have similar embeddings -- have shown great power in knowledge graph embeddings (KGE). Many existing semantic matching models use inner products in embedding spaces to measure the plausibility of triples and quadruples in static and temporal knowledge graphs. However, vectors that have the same inner products with another vector can still be orthogonal to each other, which implies that entities with similar semantics may have dissimilar embeddings. This property of inner products significantly limits the performance of semantic matching models. To address this challenge, we propose a novel regularizer -- namely, DUality-induced RegulArizer (DURA) -- which effectively encourages the entities with similar semantics to have similar embeddings. The major novelty of DURA is based on the observation that, for an existing semantic matching KGE model (primal), there is often another distance based KGE model (dual) closely associated with it, which can be used as effective constraints for entity embeddings. Experiments demonstrate that DURA consistently and significantly improves the performance of state-of-the-art semantic matching models on both static and temporal knowledge graph benchmarks.

preprint2022arXiv

Dynamical Mean Field Theory of Moiré Bilayer Transition Metal Dichalcogenides: Phase Diagram, Resistivity, and Quantum Criticality

We present a comprehensive dynamical mean field study of the triangular lattice moiré Hubbard model, which is believed to represent the physics of moiré bilayer transition metal dichalcogenides. In these materials, important aspects of the band structure including the bandwidth and the order and location of van Hove singularities can be tuned by varying the interlayer potential. We present a magnetic and metal-insulator phase diagram and a detailed study of the dependence of the resistivity on temperature, band filling and interlayer potential. We find that transport displays Fermi liquid, strange metal and quantum critical behaviors in distinct regions of the phase diagram. Specifically, we find that the cube-root van Hove singularity ($ρ(ε) \sim|ε|^{-1 / 3}$) gives a strange metal behavior with a $T$-linear scattering rate and $ω/T$ scaling. We show how magnetic order affects the resistivity. Our results elucidate the physics of the correlated states and the metal-insulator continuous transition recently observed in twisted homobilayer WSe$_2$ and heterobilayer MoTe$_2$/WSe$_2$ experiments.

preprint2022arXiv

Exploiting Global Semantic Similarities in Knowledge Graphs by Relational Prototype Entities

Knowledge graph (KG) embedding aims at learning the latent representations for entities and relations of a KG in continuous vector spaces. An empirical observation is that the head (tail) entities connected by the same relation often share similar semantic attributes -- specifically, they often belong to the same category -- no matter how far away they are from each other in the KG; that is, they share global semantic similarities. However, many existing methods derive KG embeddings based on the local information, which fail to effectively capture such global semantic similarities among entities. To address this challenge, we propose a novel approach, which introduces a set of virtual nodes called \textit{\textbf{relational prototype entities}} to represent the prototypes of the head and tail entities connected by the same relations. By enforcing the entities' embeddings close to their associated prototypes' embeddings, our approach can effectively encourage the global semantic similarities of entities -- that can be far away in the KG -- connected by the same relation. Experiments on the entity alignment and KG completion tasks demonstrate that our approach significantly outperforms recent state-of-the-arts.

preprint2022arXiv

Fooling the Eyes of Autonomous Vehicles: Robust Physical Adversarial Examples Against Traffic Sign Recognition Systems

Adversarial Examples (AEs) can deceive Deep Neural Networks (DNNs) and have received a lot of attention recently. However, majority of the research on AEs is in the digital domain and the adversarial patches are static, which is very different from many real-world DNN applications such as Traffic Sign Recognition (TSR) systems in autonomous vehicles. In TSR systems, object detectors use DNNs to process streaming video in real time. From the view of object detectors, the traffic sign`s position and quality of the video are continuously changing, rendering the digital AEs ineffective in the physical world. In this paper, we propose a systematic pipeline to generate robust physical AEs against real-world object detectors. Robustness is achieved in three ways. First, we simulate the in-vehicle cameras by extending the distribution of image transformations with the blur transformation and the resolution transformation. Second, we design the single and multiple bounding boxes filters to improve the efficiency of the perturbation training. Third, we consider four representative attack vectors, namely Hiding Attack, Appearance Attack, Non-Target Attack and Target Attack. We perform a comprehensive set of experiments under a variety of environmental conditions, and considering illuminations in sunny and cloudy weather as well as at night. The experimental results show that the physical AEs generated from our pipeline are effective and robust when attacking the YOLO v5 based TSR system. The attacks have good transferability and can deceive other state-of-the-art object detectors. We launched HA and NTA on a brand-new 2021 model vehicle. Both attacks are successful in fooling the TSR system, which could be a life-threatening case for autonomous vehicles. Finally, we discuss three defense mechanisms based on image preprocessing, AEs detection, and model enhancing.

preprint2022arXiv

Improving Pseudo Labels With Intra-Class Similarity for Unsupervised Domain Adaptation

Unsupervised domain adaptation (UDA) transfers knowledge from a label-rich source domain to a different but related fully-unlabeled target domain. To address the problem of domain shift, more and more UDA methods adopt pseudo labels of the target samples to improve the generalization ability on the target domain. However, inaccurate pseudo labels of the target samples may yield suboptimal performance with error accumulation during the optimization process. Moreover, once the pseudo labels are generated, how to remedy the generated pseudo labels is far from explored. In this paper, we propose a novel approach to improve the accuracy of the pseudo labels in the target domain. It first generates coarse pseudo labels by a conventional UDA method. Then, it iteratively exploits the intra-class similarity of the target samples for improving the generated coarse pseudo labels, and aligns the source and target domains with the improved pseudo labels. The accuracy improvement of the pseudo labels is made by first deleting dissimilar samples, and then using spanning trees to eliminate the samples with the wrong pseudo labels in the intra-class samples. We have applied the proposed approach to several conventional UDA methods as an additional term. Experimental results demonstrate that the proposed method can boost the accuracy of the pseudo labels and further lead to more discriminative and domain invariant features than the conventional baselines.

preprint2022arXiv

Learning Hierarchy-Aware Knowledge Graph Embeddings for Link Prediction

Knowledge graph embedding, which aims to represent entities and relations as low dimensional vectors (or matrices, tensors, etc.), has been shown to be a powerful technique for predicting missing links in knowledge graphs. Existing knowledge graph embedding models mainly focus on modeling relation patterns such as symmetry/antisymmetry, inversion, and composition. However, many existing approaches fail to model semantic hierarchies, which are common in real-world applications. To address this challenge, we propose a novel knowledge graph embedding model -- namely, Hierarchy-Aware Knowledge Graph Embedding (HAKE) -- which maps entities into the polar coordinate system. HAKE is inspired by the fact that concentric circles in the polar coordinate system can naturally reflect the hierarchy. Specifically, the radial coordinate aims to model entities at different levels of the hierarchy, and entities with smaller radii are expected to be at higher levels; the angular coordinate aims to distinguish entities at the same level of the hierarchy, and these entities are expected to have roughly the same radii but different angles. Experiments demonstrate that HAKE can effectively model the semantic hierarchies in knowledge graphs, and significantly outperforms existing state-of-the-art methods on benchmark datasets for the link prediction task.

preprint2022arXiv

Learning Task-relevant Representations for Generalization via Characteristic Functions of Reward Sequence Distributions

Generalization across different environments with the same tasks is critical for successful applications of visual reinforcement learning (RL) in real scenarios. However, visual distractions -- which are common in real scenes -- from high-dimensional observations can be hurtful to the learned representations in visual RL, thus degrading the performance of generalization. To tackle this problem, we propose a novel approach, namely Characteristic Reward Sequence Prediction (CRESP), to extract the task-relevant information by learning reward sequence distributions (RSDs), as the reward signals are task-relevant in RL and invariant to visual distractions. Specifically, to effectively capture the task-relevant information via RSDs, CRESP introduces an auxiliary task -- that is, predicting the characteristic functions of RSDs -- to learn task-relevant representations, because we can well approximate the high-dimensional distributions by leveraging the corresponding characteristic functions. Experiments demonstrate that CRESP significantly improves the performance of generalization on unseen environments, outperforming several state-of-the-arts on DeepMind Control tasks with different visual distractions.

preprint2022arXiv

Learning to Reformulate for Linear Programming

It has been verified that the linear programming (LP) is able to formulate many real-life optimization problems, which can obtain the optimum by resorting to corresponding solvers such as OptVerse, Gurobi and CPLEX. In the past decades, a serial of traditional operation research algorithms have been proposed to obtain the optimum of a given LP in a fewer solving time. Recently, there is a trend of using machine learning (ML) techniques to improve the performance of above solvers. However, almost no previous work takes advantage of ML techniques to improve the performance of solver from the front end, i.e., the modeling (or formulation). In this paper, we are the first to propose a reinforcement learning-based reformulation method for LP to improve the performance of solving process. Using an open-source solver COIN-OR LP (CLP) as an environment, we implement the proposed method over two public research LP datasets and one large-scale LP dataset collected from practical production planning scenario. The evaluation results suggest that the proposed method can effectively reduce both the solving iteration number ($25\%\downarrow$) and the solving time ($15\%\downarrow$) over above datasets in average, compared to directly solving the original LP instances.

preprint2022arXiv

Magnetotransport due to conductivity fluctuations in non-magnetic ZrTe2 nanoplates

Transition metal dichalcogenides with nontrivial band structures exhibit various fascinating physical properties and have sparked intensively research interest. Here, we performed systematic magnetotransport measurements on mechanical exfoliation prepared ZrTe2 nanoplates. We revealed that the negative longitudinal magnetoresistivity observed at high field region in the presence of parallel electric and magnetic fields could stem from the conductivity fluctuations due to the excess Zr in the nanoplates. In addition, the parametric plot, the planar Hall resistivity as function of the in-plane anisotropic magnetoresistivity, has an ellipse-shaped pattern with shifted orbital center, which further strengthen the evidence for the conductivity fluctuations. Our work provides some useful insights into transport phenomena in topological materials.

preprint2022arXiv

Modeling Diverse Chemical Reactions for Single-step Retrosynthesis via Discrete Latent Variables

Single-step retrosynthesis is the cornerstone of retrosynthesis planning, which is a crucial task for computer-aided drug discovery. The goal of single-step retrosynthesis is to identify the possible reactants that lead to the synthesis of the target product in one reaction. By representing organic molecules as canonical strings, existing sequence-based retrosynthetic methods treat the product-to-reactant retrosynthesis as a sequence-to-sequence translation problem. However, most of them struggle to identify diverse chemical reactions for a desired product due to the deterministic inference, which contradicts the fact that many compounds can be synthesized through various reaction types with different sets of reactants. In this work, we aim to increase reaction diversity and generate various reactants using discrete latent variables. We propose a novel sequence-based approach, namely RetroDVCAE, which incorporates conditional variational autoencoders into single-step retrosynthesis and associates discrete latent variables with the generation process. Specifically, RetroDVCAE uses the Gumbel-Softmax distribution to approximate the categorical distribution over potential reactions and generates multiple sets of reactants with the variational decoder. Experiments demonstrate that RetroDVCAE outperforms state-of-the-art baselines on both benchmark dataset and homemade dataset. Both quantitative and qualitative results show that RetroDVCAE can model the multi-modal distribution over reaction types and produce diverse reactant candidates.

preprint2022arXiv

Phase Diagram of Infinite-layer Nickelate Compounds from First- and Second-principles Calculations

The fundamental properties of infinite-layer rare-earth nickelates (RNiO2) are carefully revisited and compared with those of CaCuO2 and RNiO3 perovskites. Combining first-principles and finite-temperature second-principles calculations, we highlight that bulk NdNiO2 compound are far from equivalent to CaCuO2, together at the structural, electronic, and magnetic levels. Structurally, it is shown to be prone to spin-phonon coupling induced oxygen square rotation motion, which might be responsible for the intriguing upturn of the resistivity. At the electronic and magnetic levels, we point out orbital-selective Mott localization with strong out-of-plane band dispersion, which should result in the isotropic upper critical fields and weakly three-dimensional magnetic interactions with in-plane local moment and out-of-plane itinerant moment. We further demonstrate that as in RNiO3 perovskites, oxygen rotation motion and rare-earth ion controlled electronic and magnetic properties can give rise in RNiO2 compounds to a rich phase diagram and high tunability of various appealing properties. In line with that, we reveal that key ingredients of high-Tc superconductor such as orbital polarization, Fermi surface, and antiferromagnetic interactions can be deliberately controlled in NdNiO2 through epitaxial strain. Exploiting strain-orbital engineering, a crossover from three- to two-dimensional magnetic transition can be established, making then NdNiO2 thin film a true analog of high-Tc cuprates.

preprint2022arXiv

Recycling of Perovskite Substrate

The use of water-soluble sacrificial layer of Sr$_3$Al$_2$O$_6$ has tremendously boosted the research on freestanding functional oxide thin films, especially thanks to its ultimate capability to produce high-quality epitaxial perovskite thin films. However, the costly single-crystalline substrates, e.g. SrTiO$_3$, were generally discarded after obtaining the freestanding thin films. Here, we demonstrate that the SrTiO$_3$ substrates can be recycled to fabricate La$_{0.7}$Sr$_{0.3}$MnO$_3$ films with nearly identical structural and electrical properties. After attaining freestanding thin films, the residues on SrTiO$_3$ can be removed by 80 \degree C hot water soaking and rinsing treatments. Consequently, the surface of SrTiO$_3$ reverted to its original step-and-terrace structure.

preprint2022arXiv

Rethinking Graph Convolutional Networks in Knowledge Graph Completion

Graph convolutional networks (GCNs) -- which are effective in modeling graph structures -- have been increasingly popular in knowledge graph completion (KGC). GCN-based KGC models first use GCNs to generate expressive entity representations and then use knowledge graph embedding (KGE) models to capture the interactions among entities and relations. However, many GCN-based KGC models fail to outperform state-of-the-art KGE models though introducing additional computational complexity. This phenomenon motivates us to explore the real effect of GCNs in KGC. Therefore, in this paper, we build upon representative GCN-based KGC models and introduce variants to find which factor of GCNs is critical in KGC. Surprisingly, we observe from experiments that the graph structure modeling in GCNs does not have a significant impact on the performance of KGC models, which is in contrast to the common belief. Instead, the transformations for entity representations are responsible for the performance improvements. Based on the observation, we propose a simple yet effective framework named LTE-KGE, which equips existing KGE models with linearly transformed entity embeddings. Experiments demonstrate that LTE-KGE models lead to similar performance improvements with GCN-based KGC methods, while being more computationally efficient. These results suggest that existing GCNs are unnecessary for KGC, and novel GCN-based KGC models should count on more ablation studies to validate their effectiveness. The code of all the experiments is available on GitHub at https://github.com/MIRALab-USTC/GCN4KGC.

preprint2022arXiv

Self-Adaptive Label Augmentation for Semi-supervised Few-shot Classification

Few-shot classification aims to learn a model that can generalize well to new tasks when only a few labeled samples are available. To make use of unlabeled data that are more abundantly available in real applications, Ren et al. \shortcite{ren2018meta} propose a semi-supervised few-shot classification method that assigns an appropriate label to each unlabeled sample by a manually defined metric. However, the manually defined metric fails to capture the intrinsic property in data. In this paper, we propose a \textbf{S}elf-\textbf{A}daptive \textbf{L}abel \textbf{A}ugmentation approach, called \textbf{SALA}, for semi-supervised few-shot classification. A major novelty of SALA is the task-adaptive metric, which can learn the metric adaptively for different tasks in an end-to-end fashion. Another appealing feature of SALA is a progressive neighbor selection strategy, which selects unlabeled data with high confidence progressively through the training phase. Experiments demonstrate that SALA outperforms several state-of-the-art methods for semi-supervised few-shot classification on benchmark datasets.

preprint2022arXiv

Sparse Polynomial Optimization: Theory and Practice

The problem of minimizing a polynomial over a set of polynomial inequalities is an NP-hard non-convex problem. Thanks to powerful results from real algebraic geometry, one can convert this problem into a nested sequence of finite-dimensional convex problems. At each step of the associated hierarchy, one needs to solve a fixed size semidefinite program, which can be in turn solved with efficient numerical tools. On the practical side however, there is no-free lunch and such optimization methods usually encompass severe scalability issues. Fortunately, for many applications, we can look at the problem in the eyes and exploit the inherent data structure arising from the cost and constraints describing the problem, for instance sparsity or symmetries. This book presents several research efforts to tackle this scientific challenge with important computational implications, and provides the development of alternative optimization schemes that scale well in terms of computational complexity, at least in some identified class of problems. The presented algorithmic framework in this book mainly exploits the sparsity structure of the input data to solve large-scale polynomial optimization problems. We present sparsity-exploiting hierarchies of relaxations, for either unconstrained or constrained problems. By contrast with the dense hierarchies, they provide faster approximation of the solution in practice but also come with the same theoretical convergence guarantees. Our framework is not restricted to static polynomial optimization, and we expose hierarchies of approximations for values of interest arising from the analysis of dynamical systems. We also present various extensions to problems involving noncommuting variables, e.g., matrices of arbitrary size or quantum physic operators.

preprint2022arXiv

Speech Representation Disentanglement with Adversarial Mutual Information Learning for One-shot Voice Conversion

One-shot voice conversion (VC) with only a single target speaker's speech for reference has become a hot research topic. Existing works generally disentangle timbre, while information about pitch, rhythm and content is still mixed together. To perform one-shot VC effectively with further disentangling these speech components, we employ random resampling for pitch and content encoder and use the variational contrastive log-ratio upper bound of mutual information and gradient reversal layer based adversarial mutual information learning to ensure the different parts of the latent space containing only the desired disentangled representation during training. Experiments on the VCTK dataset show the model achieves state-of-the-art performance for one-shot VC in terms of naturalness and intellgibility. In addition, we can transfer characteristics of one-shot VC on timbre, pitch and rhythm separately by speech representation disentanglement. Our code, pre-trained models and demo are available at https://im1eon.github.io/IS2022-SRDVC/.

preprint2022arXiv

Stability of Linear Systems under Extended Weakly-Hard Constraints

Control systems can show robustness to many events, like disturbances and model inaccuracies. It is natural to speculate that they are also robust to sporadic deadline misses when implemented as digital tasks on an embedded platform. This paper proposes a comprehensive stability analysis for control systems subject to deadline misses, leveraging a new formulation to describe the patterns experienced by the control task under different handling strategies. Such analysis brings the assessment of control systems robustness to computational problems one step closer to the controller implementation.

preprint2022arXiv

The xmuspeech system for multi-channel multi-party meeting transcription challenge

This paper describes the system developed by the XMUSPEECH team for the Multi-channel Multi-party Meeting Transcription Challenge (M2MeT). For the speaker diarization task, we propose a multi-channel speaker diarization system that obtains spatial information of speaker by Difference of Arrival (DOA) technology. Speaker-spatial embedding is generated by x-vector and s-vector derived from Filter-and-Sum Beamforming (FSB) which makes the embedding more robust. Specifically, we propose a novel multi-channel sequence-to-sequence neural network architecture named Discriminative Multi-stream Neural Network (DMSNet) which consists of Attention Filter-and-Sum block (AFSB) and Conformer encoder. We explore DMSNet to address overlapped speech problem on multi-channel audio. Compared with LSTM based OSD module, we achieve a decreases of 10.1% in Detection Error Rate(DetER). By performing DMSNet based OSD module, the DER of cluster-based diarization system decrease significantly form 13.44% to 7.63%. Our best fusion system achieves 7.09% and 9.80% of the diarization error rate (DER) on evaluation set and test set.

preprint2022arXiv

TMGAN-PLC: Audio Packet Loss Concealment using Temporal Memory Generative Adversarial Network

Real-time communications in packet-switched networks have become widely used in daily communication, while they inevitably suffer from network delays and data losses in constrained real-time conditions. To solve these problems, audio packet loss concealment (PLC) algorithms have been developed to mitigate voice transmission failures by reconstructing the lost information. Limited by the transmission latency and device memory, it is still intractable for PLC to accomplish high-quality voice reconstruction using a relatively small packet buffer. In this paper, we propose a temporal memory generative adversarial network for audio PLC, dubbed TMGAN-PLC, which is comprised of a novel nested-UNet generator and the time-domain/frequency-domain discriminators. Specifically, a combination of the nested-UNet and temporal feature-wise linear modulation is elaborately devised in the generator to finely adjust the intra-frame information and establish inter-frame temporal dependencies. To complement the missing speech content caused by longer loss bursts, we employ multi-stage gated vector quantizers to capture the correct content and reconstruct the near-real smooth audio. Extensive experiments on the PLC Challenge dataset demonstrate that the proposed method yields promising performance in terms of speech quality, intelligibility, and PLCMOS.

preprint2022arXiv

Two-sample Test with Kernel Projected Wasserstein Distance

We develop a kernel projected Wasserstein distance for the two-sample test, an essential building block in statistics and machine learning: given two sets of samples, to determine whether they are from the same distribution. This method operates by finding the nonlinear mapping in the data space which maximizes the distance between projected distributions. In contrast to existing works about projected Wasserstein distance, the proposed method circumvents the curse of dimensionality more efficiently. We present practical algorithms for computing this distance function together with the non-asymptotic uncertainty quantification of empirical estimates. Numerical examples validate our theoretical results and demonstrate good performance of the proposed method.

preprint2021arXiv

Analysing Wideband Absorbance Immittance in Normal and Ears with Otitis Media with Effusion Using Machine Learning

Wideband Absorbance Immittance (WAI) has been available for more than a decade, however its clinical use still faces the challenges of limited understanding and poor interpretation of WAI results. This study aimed to develop Machine Learning (ML) tools to identify the WAI absorbance characteristics across different frequency-pressure regions in the normal middle ear and ears with otitis media with effusion (OME) to enable diagnosis of middle ear conditions automatically. Data analysis including pre-processing of the WAI data, statistical analysis and classification model development, together with key regions extraction from the 2D frequency-pressure WAI images are conducted in this study. Our experimental results show that ML tools appear to hold great potential for the automated diagnosis of middle ear diseases from WAI data. The identified key regions in the WAI provide guidance to practitioners to better understand and interpret WAI data and offer the prospect of quick and accurate diagnostic decisions.

preprint2021arXiv

Charmless $B_s\to V S$ Decays in PQCD Approach

In this work, we investigate the $B_s\to V S$ decays in the perturbative QCD approach, where $V$ and $S$ denote the vector meson and scalar meson respectively. Based on the two-quark structure, considering two different scenarios for describing the scalar mesons, we calculate the branching fractions and the direct $CP$ asymmetries of all $B_s\to VS$ decays. Most branching fractions are predicted to be at $10^{-7}$ to $10^{-5}$, which could be measured in the LHCb and Belle-II experiments, especially for these color-allowed $B_s\to κ(800)(K_0^*(1430))K^*$ decays. It is found that the branching fractions of $B_s\to K_0^{*0}(1430)\bar{K}^{*0}$ and $B_s\to K_0^{*+}(1430)\bar{K}^{*-}$ are very sensitive to the scenarios, which can be used to determine whether $K_0^{*0}(1430)$ belongs to the ground state or the first excited state, if the data were available. We also note that some decays have large direct $CP$ asymmetries, some of which are also sensitive to the scenarios, such as the $B_s \to a_0^+(1450)K^{*-}$ and the $B_s\to f_0(1500) K^{*0}$ decays. Since the experimental measurements of $B_s\to VS$ decays are on the way, combined with the available data in the future, we expect the theoretical predictions will shed light on the structure of the scalar mesons.

preprint2021arXiv

Checkpointing SPAdes for Metagenome Assembly: Transparency versus Performance in Production

The SPAdes assembler for metagenome assembly is a long-running application commonly used at the NERSC supercomputing site. However, NERSC, like many other sites, has a 48-hour limit on resource allocations. The solution is to chain together multiple resource allocations in a single run, using checkpoint-restart. This case study provides insights into the "pain points" in applying a well-known checkpointing package (DMTCP: Distributed MultiThreaded CheckPointing) to long-running production workloads of SPAdes. This work has exposed several bugs and limitations of DMTCP, which were fixed to support the large memory and fragmented intermediate files of SPAdes. But perhaps more interesting for other applications, this work reveals a tension between the transparency goals of DMTCP and performance concerns due to an I/O bottleneck during the checkpointing process when supporting large memory and many files. Suggestions are made for overcoming this I/O bottleneck, which provides important "lessons learned" for similar applications.

preprint2021arXiv

Classification of tetravalent $2$-transitive non-normal Cayley graphs of finite simple groups

A graph $Γ$ is called $(G, s)$-arc-transitive if $G \le \mathrm{Aut}(Γ)$ is transitive on the set of vertices of $Γ$ and the set of $s$-arcs of $Γ$, where for an integer $s \ge 1$ an $s$-arc of $Γ$ is a sequence of $s+1$ vertices $(v_0,v_1,\ldots,v_s)$ of $Γ$ such that $v_{i-1}$ and $v_i$ are adjacent for $1 \le i \le s$ and $v_{i-1}\ne v_{i+1}$ for $1 \le i \le s-1$. $Γ$ is called 2-transitive if it is $(\mathrm{Aut}(Γ), 2)$-arc-transitive but not $(\mathrm{Aut}(Γ), 3)$-arc-transitive. A Cayley graph $Γ$ of a group $G$ is called normal if $G$ is normal in $\mathrm{Aut}(Γ)$ and non-normal otherwise. It was proved by X. G. Fang, C. H. Li and M. Y. Xu that if $Γ$ is a tetravalent 2-transitive Cayley graph of a finite simple group $G$, then either $Γ$ is normal or $G$ is one of the groups $\mathrm{PSL}_2(11)$, $M_{11}$, $M_{23}$ and $A_{11}$. However, it was unknown whether $Γ$ is normal when $G$ is one of these four groups. In the present paper we answer this question by proving that among these four groups only $M_{11}$ produces connected tetravalent 2-transitive non-normal Cayley graphs. We prove further that there are exactly two such graphs which are non-isomorphic and both determined in the paper. As a consequence, the automorphism group of any connected tetravalent 2-transitive Cayley graph of any finite simple group is determined.

preprint2021arXiv

Dynamics of Polar Skyrmion Bubbles under Electric Fields

Room-temperature polar skyrmion bubbles that are recently found in oxide superlattice, have received enormous interests for their potential applications in nanoelectronics due to the nanometer size, emergent chirality, and negative capacitance. For practical applications, the ability to controllably manipulate them by using external stimuli is prerequisite. Here, we study the dynamics of individual polar skyrmion bubbles at the nanoscale by using in situ biasing in a scanning transmission electron microscope. The reversible electric field-driven phase transition between topological and trivial polar states are demonstrated. We create, erase and monitor the shrinkage and expansion of individual polar skyrmions. We find that their transition behaviors are substantially different from that of magnetic analogue. The underlying mechanism is discussed by combing with the phase-field simulations. The controllable manipulation of nanoscale polar skyrmions allows us to tune the dielectric permittivity at atomic scale and detailed knowledge of their phase transition behaviors provides fundamentals for their applications in nanoelectronics.

preprint2021arXiv

PICA: A Pixel Correlation-based Attentional Black-box Adversarial Attack

The studies on black-box adversarial attacks have become increasingly prevalent due to the intractable acquisition of the structural knowledge of deep neural networks (DNNs). However, the performance of emerging attacks is negatively impacted when fooling DNNs tailored for high-resolution images. One of the explanations is that these methods usually focus on attacking the entire image, regardless of its spatial semantic information, and thereby encounter the notorious curse of dimensionality. To this end, we propose a pixel correlation-based attentional black-box adversarial attack, termed as PICA. Firstly, we take only one of every two neighboring pixels in the salient region as the target by leveraging the attentional mechanism and pixel correlation of images, such that the dimension of the black-box attack reduces. After that, a general multiobjective evolutionary algorithm is employed to traverse the reduced pixels and generate perturbations that are imperceptible by the human vision. Extensive experimental results have verified the effectiveness of the proposed PICA on the ImageNet dataset. More importantly, PICA is computationally more efficient to generate high-resolution adversarial examples compared with the existing black-box attacks.

preprint2021arXiv

Small-Sample Inferred Adaptive Recoding for Batched Network Coding

Batched network coding is a low-complexity network coding solution to feedbackless multi-hop wireless packet network transmission with packet loss. The data to be transmitted is encoded into batches where each of which consists of a few coded packets. Unlike the traditional forwarding strategy, the intermediate network nodes have to perform recoding, which generates recoded packets by network coding operations restricted within the same batch. Adaptive recoding is a technique to adapt the fluctuation of packet loss by optimizing the number of recoded packets per batch to enhance the throughput. The input rank distribution, which is a piece of information regarding the batches arriving at the node, is required to apply adaptive recoding. However, this distribution is not known in advance in practice as the incoming link's channel condition may change from time to time. On the other hand, to fully utilize the potential of adaptive recoding, we need to have a good estimation of this distribution. In other words, we need to guess this distribution from a few samples so that we can apply adaptive recoding as soon as possible. In this paper, we propose a distributionally robust optimization for adaptive recoding with a small-sample inferred prediction of the input rank distribution. We develop an algorithm to efficiently solve this optimization with the support of theoretical guarantees that our optimization's performance would constitute as a confidence lower bound of the optimal throughput with high probability.

preprint2021arXiv

Topology-Aware Correlations Between Relations for Inductive Link Prediction in Knowledge Graphs

Inductive link prediction -- where entities during training and inference stages can be different -- has been shown to be promising for completing continuously evolving knowledge graphs. Existing models of inductive reasoning mainly focus on predicting missing links by learning logical rules. However, many existing approaches do not take into account semantic correlations between relations, which are commonly seen in real-world knowledge graphs. To address this challenge, we propose a novel inductive reasoning approach, namely TACT, which can effectively exploit Topology-Aware CorrelaTions between relations in an entity-independent manner. TACT is inspired by the observation that the semantic correlation between two relations is highly correlated to their topological structure in knowledge graphs. Specifically, we categorize all relation pairs into several topological patterns, and then propose a Relational Correlation Network (RCN) to learn the importance of the different patterns for inductive link prediction. Experiments demonstrate that TACT can effectively model semantic correlations between relations, and significantly outperforms existing state-of-the-art methods on benchmark datasets for the inductive link prediction task.

preprint2021arXiv

TSSOS: a Julia library to exploit sparsity for large-scale polynomial optimization

The Julia library TSSOS aims at helping polynomial optimizers to solve large-scale problems with sparse input data. The underlying algorithmic framework is based on exploiting correlative and term sparsity to obtain a new moment-SOS hierarchy involving potentially much smaller positive semidefinite matrices. TSSOS can be applied to numerous problems ranging from power networks to eigenvalue and trace optimization of noncommutative polynomials, involving up to tens of thousands of variables and constraints.

preprint2020arXiv

A second order cone characterization for sums of nonnegative circuits

The second-order cone is a class of simple convex cones and optimizing over them can be done more efficiently than with semidefinite programming. It is interesting both in theory and in practice to investigate which convex cones admit a representation using second-order cones, given that they have a strong expressive ability. In this paper, we prove constructively that the cone of sums of nonnegative circuits (SONC) admits a second-order cone representation. Based on this, we give a new algorithm to compute SONC decompositions for certain classes of nonnegative polynomials via second-order cone programming. Numerical experiments demonstrate the efficiency of our algorithm for polynomials with a fairly large size.

preprint2020arXiv

An Unsupervised Semantic Sentence Ranking Scheme for Text Documents

This paper presents Semantic SentenceRank (SSR), an unsupervised scheme for automatically ranking sentences in a single document according to their relative importance. In particular, SSR extracts essential words and phrases from a text document, and uses semantic measures to construct, respectively, a semantic phrase graph over phrases and words, and a semantic sentence graph over sentences. It applies two variants of article-structure-biased PageRank to score phrases and words on the first graph and sentences on the second graph. It then combines these scores to generate the final score for each sentence. Finally, SSR solves a multi-objective optimization problem for ranking sentences based on their final scores and topic diversity through semantic subtopic clustering. An implementation of SSR that runs in quadratic time is presented, and it outperforms, on the SummBank benchmarks, each individual judge's ranking and compares favorably with the combined ranking of all judges.

preprint2020arXiv

Baryon acoustic oscillations reconstruction using convolutional neural networks

We propose a new scheme to reconstruct the baryon acoustic oscillations (BAO) signal, which contains key cosmological information, based on deep convolutional neural networks (CNN). Trained with almost no fine-tuning, the network can recover large-scale modes accurately in the test set: the correlation coefficient between the true and reconstructed initial conditions reaches $90\%$ at $k\leq 0.2 h\mathrm{Mpc}^{-1}$, which can lead to significant improvements of the BAO signal-to-noise ratio down to $k\simeq0.4h\mathrm{Mpc}^{-1}$. Since this new scheme is based on the configuration-space density field in sub-boxes, it is local and less affected by survey boundaries than the standard reconstruction method, as our tests confirm. We find that the network trained in one cosmology is able to reconstruct BAO peaks in the others, i.e. recovering information lost to non-linearity independent of cosmology. The accuracy of recovered BAO peak positions is far less than that caused by the difference in the cosmology models for training and testing, suggesting that different models can be distinguished efficiently in our scheme. It is very promising that Our scheme provides a different new way to extract the cosmological information from the ongoing and future large galaxy surveys.

preprint2020arXiv

Creating topological polar structure in a nonpolar matter

Nontrivial topological structures offer rich playground in condensed matter physics including fluid dynamics, superconductivity, and ferromagnetism, and they promise alternative device configurations for post-Moore spintronics and electronics. Indeed, magnetic skyrmions are actively pursued for high-density data storage, while polar vortices with exotic negative capacitance may enable ultralow power consumption in microelectronics. Following extensive investigations on a variety of magnetic textures including vortices, domain walls and skyrmions in the past decades, studies on polar topologies have taken off in recent years, resulting in discoveries of closure domains, vortices, and skyrmions in ferroelectric materials. Nevertheless, the atomic-scale creation of topological polar structures is largely confined in a single ferroelectric system, PbTiO3 (PTO) with large polarization, casting doubt on the generality of polar topologies and limiting their potential applications. In this work, we successfully create previously unrealized atomic-scale polar antivortices in the nominally nonpolar SrTiO3 (STO), expanding the reaches of topological structures and completing an important missing link in polar topologies. The work shed considerable new insight into the formation of topological polar structures, and offers guidance in searching for new polar textures.

preprint2020arXiv

Focal Loss Analysis of Nerve Fiber Layer Reflectance for Glaucoma Diagnosis

Purpose: To evaluate nerve fiber layer (NFL) reflectance for glaucoma diagnosis. Methods: Participants were imaged with 4.5X4.5-mm volumetric disc scans using spectral-domain optical coherence tomography (OCT). The normalized NFL reflectance map was processed by an azimuthal filter to reduce directional reflectance bias due to variation of beam incidence angle. The peripapillary area of the map was divided into 160 superpixels. Average reflectance was the mean of superpixel reflectance. Low-reflectance superpixels were identified as those with NFL reflectance below the 5 percentile normative cutoff. Focal reflectance loss was measure by summing loss in low-reflectance superpixels. Results: Thirty-five normal, 30 pre-perimetric and 35 perimetric glaucoma participants were enrolled. Azimuthal filtering improved the repeatability of the normalized NFL reflectance, as measured by the pooled superpixel standard deviation (SD), from 0.73 to 0.57 dB (p<0.001, paired t-test) and reduced the population SD from 2.14 to 1.78 dB (p<0.001, t-test). Most glaucomatous reflectance maps showed characteristic patterns of contiguous wedge or diffuse defects. Focal NFL reflectance loss had significantly higher diagnostic sensitivity than the best NFL thickness parameter (overall, inferior, or focal loss volume): 53% v. 23% (p=0.027) in PPG eyes and 100% v. 80% (p=0.023) in PG eyes, with the specificity fixed at 99%. Conclusions: Azimuthal filtering reduces the variability of NFL reflectance measurements. Focal NFL reflectance loss has excellent glaucoma diagnostic accuracy compared to the standard NFL thickness parameters. The reflectance map may be useful for localizing NFL defects.

preprint2020arXiv

Halo Spin from Primordial Inner Motions

The standard explanation for galaxy spin starts with the tidal-torque theory (TTT), in which an ellipsoidal dark-matter protohalo, which comes to host the galaxy, is torqued up by the tidal gravitational field around it. We discuss a complementary picture, using the relatively familiar velocity field, instead of the tidal field, whose intuitive connection to the surrounding, possibly faraway matter arrangement is more obscure. In this &#39;spin from primordial inner motions&#39; (SPIM) concept, implicit in TTT derivations but not previously emphasized, the angular momentum from the gravity-sourced velocity field inside a protohalo largely cancels out, but has some excess from the aspherical outskirts. At first, the net spin scales according to linear theory, a sort of comoving conservation of familiar angular momentum. Then, at collapse, it is conserved in physical coordinates. Small haloes are then typically subject to secondary exchanges of angular momentum. The TTT is useful for analytic estimates. But a literal interpretation of the TTT is inaccurate in detail, without some implicit concepts about smoothing of the velocity and tidal fields. This could lead to misconceptions, for those first learning about how galaxies come to spin. Protohaloes are not perfectly ellipsoidal and do not uniformly torque up, as in a naive interpretation of the TTT; their inner velocity fields retain substantial dispersion. Furthermore, quantitatively, given initial conditions and protohalo boundaries, SPIM is more direct and accurate than the TTT to predict halo spins. We also discuss how SPIM applies to rotating filaments, and the relation between halo mass and spin, in which the total spin of a halo can be thought of as a sum of random contributions.

preprint2020arXiv

Review of Text Style Transfer Based on Deep Learning

Text style transfer is a hot issue in recent natural language processing,which mainly studies the text to adapt to different specific situations, audiences and purposes by making some changes. The style of the text usually includes many aspects such as morphology, grammar, emotion, complexity, fluency, tense, tone and so on. In the traditional text style transfer model, the text style is generally relied on by experts knowledge and hand-designed rules, but with the application of deep learning in the field of natural language processing, the text style transfer method based on deep learning Started to be heavily researched. In recent years, text style transfer is becoming a hot issue in natural language processing research. This article summarizes the research on the text style transfer model based on deep learning in recent years, and summarizes, analyzes and compares the main research directions and progress. In addition, the article also introduces public data sets and evaluation indicators commonly used for text style transfer. Finally, the existing characteristics of the text style transfer model are summarized, and the future development trend of the text style transfer model based on deep learning is analyzed and forecasted.

preprint2020arXiv

Simulating Kilonovae in the ΛCDM Universe

Kilonovae are optical flashes produced in the aftermath of neutron star-neutron star mergers (NNMs) or neutron star-black hole mergers (NBMs). In this work, we use the Millennium Simulation, combined with a semi-analytic galaxy formation model--GABE (Galaxy Assembly with Binary Evolution) which adopts binary stellar population synthesis models, to explore the cosmic event rate of kilonovae, and the properties of their host galaxies in a cosmological context. We find that model with supernova kick velocity of 0 km/s fits the observation best, in agreement with the exception of some formation channels of binary neutron star. This indicates that NNMs prefer to originate from binary systems with low kick velocities. With V$_{\rm kick}$=0 km/s, the cosmic event rate of NNMs and NBMs at z=0 are 283 Gpc$^{-3}$yr$^{-1}$ and 91 Gpc$^{-3}$yr$^{-1}$, respectively, marginally consistent with the constraint from LVC GWTC-1. For Milky Way-mass galaxies, we predict the NNM rate is $25.7^{+59.6}_{-7.1}$ Myr$^{-1}$, which is also in good agreement with the observed properties of binary neutron stars in the Milky Way. Taking all the NNMs into account in the history of Milky Way-mass galaxies, we find that the averaged r-process elements yield with A>79 in a NNM and NBM event should be 0.01 M$_{\odot}$ to be consistent with observation. We conclude that NGC 4993, the host galaxy of GW170817, is a typical host galaxy for NNMs. However, generally NNMs and NBMs tend to reside in young, blue, star-forming, late-type galaxies, with stellar mass and gaseous metallicity distribution peaking at $10^{10.65}$ M$_{\odot}$ and 8.72-8.85, respectively. By studying kilonovae host galaxies in the cosmological background, it is promising to constrain model details better when we have more events in the forthcoming future. (abridged)

preprint2020arXiv

Spectral Dynamic Causal Modelling of Resting-State fMRI: Relating Effective Brain Connectivity in the Default Mode Network to Genetics

We conduct an imaging genetics study to explore how effective brain connectivity in the default mode network (DMN) may be related to genetics within the context of Alzheimer&#39;s disease and mild cognitive impairment. We develop an analysis of longitudinal resting-state functional magnetic resonance imaging (rs-fMRI) and genetic data obtained from a sample of 111 subjects with a total of 319 rs-fMRI scans from the Alzheimer&#39;s Disease Neuroimaging Initiative (ADNI) database. A Dynamic Causal Model (DCM) is fit to the rs-fMRI scans to estimate effective brain connectivity within the DMN and related to a set of single nucleotide polymorphisms (SNPs) contained in an empirical disease-constrained set which is obtained out-of-sample from 663 ADNI subjects having only genome-wide data. We examine longitudinal data in both a 4-region and an 6-region network and relate longitudinal effective brain connectivity networks estimated using spectral DCM to SNPs using both linear mixed effect (LME) models as well as function-on-scalar regression (FSR). In the former case we implement a parametric bootstrap for testing SNP coefficients and make comparisons with p-values obtained from the chi-squared null distribution. We also implement a parametric bootstrap approach for testing regression functions in FSR and we make comparisons between p-values obtained from the parametric bootstrap to p-values obtained using the F-distribution with degrees-of-freedom based on Satterthwaite&#39;s approximation. In both networks we report on exploratory patterns of associations with relatively high ranks that exhibit stability to the differing assumptions made by both FSR and LME.

preprint2020arXiv

Topological charge engineering in lasing bound states in continuum

Recently, optical bound states in continuum in various passive photonic crystals have been identified and similar structures incorporated with optical gain have been reported to exhibit lasing. However, no explicit control over the type of lasing BIC has been reported. In this work, we utilize all four fundamental BICs related to the lowest energy Gamma-point of a square photonic crystal lattice. We identify the associated topological charges from experimentally obtained dispersions, finite element method simulations, as well as from spherical decomposition method based on the microscopic polarization currents in the photonic crystal plane. By tailoring the periodicity and the hole diameter of the photonic crystal slab, we selectively bring each of the four BIC resonances to a wavelength regime, where fluorescent IR702 molecules overlaid with the photonic crystal provide sufficient gain for the onset of lasing. We experimentally analyze all four observed lasing BICs by imaging their far-field polarization vortices and their associated topological charges. The results correspond excellently with the transmission results as well as the simulation results in the absence of gain. Finally, we experimentally present a case where the lasing signal reveals the coexistence of two BICs with opposite topological charges, resulting in a unique polarization pattern. We believe our results enable tailoring the properties, such as polarization winding and topological charge of BICs, by a priori design and thus pave the way for a more general utilization of their appealing properties.

preprint2020arXiv

TSSOS: A Moment-SOS hierarchy that exploits term sparsity

This paper is concerned with polynomial optimization problems. We show how to exploit term (or monomial) sparsity of the input polynomials to obtain a new converging hierarchy of semidefinite programming relaxations. The novelty (and distinguishing feature) of such relaxations is to involve block-diagonal matrices obtained in an iterative procedure performing completion of the connected components of certain adjacency graphs. The graphs are related to the terms arising in the original data and not to the links between variables. Our theoretical framework is then applied to compute lower bounds for polynomial optimization problems either randomly generated or coming from the networked systems literature.

preprint2020arXiv

Two-dimensional metallic ferroelectricity in PbTe monolayer by electrostatic doping

Polar metals characterized by the simultaneous coexistence of ferroelectric distortions and metallicity have attracted tremendous attention. Developing such materials at low dimensions remains challenging since both conducting electrons and reduced dimensions are supposed to quench ferroelectricity. Here, based on first-principles calculations, we report the discovery of ferroelectric behavior in two-dimensional (2D) metallic materials with electrostatic doping, even though ferroelectricity is unconventional at the atomic scale. We reveal that PbTe monolayer is intrinsic ferroelectrics with pronounced out-of-plane electric polarization originated from its non-centrosymmetric buckled structure. The ferroelectric distortions can be preserved with carriers doping in the ferroelectric monolayer, which thus enables the doped PbTe monolayer to act as a 2D polar metal. With an effective Hamiltonian extracted from the parametrized energy space, we found that the elastic-polar mode interaction is of great importance for the existence of robust polar instability in the doped system. The application of this doping strategy is not specific to the present crystal, but is rather general to other 2D ferroelectrics to bring about the fascinating metallic ferroelectric properties. Our findings thus change conventional acknowledge in 2D materials and will facilitate the development of multifunctional material in low dimensions.

preprint2020arXiv

Universal structure of dark matter haloes over a mass range of 20 orders of magnitude

Cosmological models in which dark matter consists of cold elementary particles predict that the dark halo population should extend to masses many orders of magnitude below those at which galaxies can form. Here we report a cosmological simulation of the formation of present-day haloes over the full range of observed halo masses (20 orders of magnitude) when dark matter is assumed to be in the form of weakly interacting massive particles of mass approximately 100 gigaelectronvolts. The simulation has a full dynamic range of 30 orders of magnitude in mass and resolves the internal structure of hundreds of Earth-mass haloes in as much detail as it does for hundreds of rich galaxy clusters. We find that halo density profiles are universal over the entire mass range and are well described by simple two-parameter fitting formulae. Halo mass and concentration are tightly related in a way that depends on cosmology and on the nature of the dark matter. For a fixed mass, the concentration is independent of the local environment for haloes less massive than those of typical galaxies. Haloes over the mass range of 10^3 to 10^11 solar masses contribute about equally (per logarithmic interval) to the luminosity produced by dark matter annihilation, which we find to be smaller than all previous estimates by factors ranging up to one thousand.

preprint2020arXiv

Upper Bound Scalability on Achievable Rates of Batched Codes for Line Networks

The capacity of line networks with buffer size constraints is an open, but practically important problem. In this paper, the upper bound on the achievable rate of a class of codes, called batched codes, is studied for line networks. Batched codes enable a range of buffer size constraints, and are general enough to include special coding schemes studied in the literature for line networks. Existing works have characterized the achievable rates of batched codes for several classes of parameter sets, but leave the cut-set bound as the best existing general upper bound. In this paper, we provide upper bounds on the achievable rates of batched codes as functions of line network length for these parameter sets. Our upper bounds are tight in order of the network length compared with the existing achievability results.

preprint2019arXiv

An Efficient Pre-processing Method to Eliminate Adversarial Effects

Deep Neural Networks (DNNs) are vulnerable to adversarial examples generated by imposing subtle perturbations to inputs that lead a model to predict incorrect outputs. Currently, a large number of researches on defending adversarial examples pay little attention to the real-world applications, either with high computational complexity or poor defensive effects. Motivated by this observation, we develop an efficient preprocessing method to defend adversarial images. Specifically, before an adversarial example is fed into the model, we perform two image transformations: WebP compression, which is utilized to remove the small adversarial noises. Flip operation, which flips the image once along one side of the image to destroy the specific structure of adversarial perturbations. Finally, a de-perturbed sample is obtained and can be correctly classified by DNNs. Experimental results on ImageNet show that our method outperforms the state-of-the-art defense methods. It can effectively defend adversarial attacks while ensure only very small accuracy drop on normal images.

preprint2019arXiv

Semi-Supervised Self-Taught Deep Learning for Finger Bones Segmentation

Segmentation stands at the forefront of many high-level vision tasks. In this study, we focus on segmenting finger bones within a newly introduced semi-supervised self-taught deep learning framework which consists of a student network and a stand-alone teacher module. The whole system is boosted in a life-long learning manner wherein each step the teacher module provides a refinement for the student network to learn with newly unlabeled data. Experimental results demonstrate the superiority of the proposed method over conventional supervised deep learning methods.