arXiv subjects

Jin Chen

Publications and source records attributed to Jin Chen.

At least 127 records · Page 7Linked to original sources

arXiv2021

Search for $Q \sim 0$ order near a forbidden Bragg position in Bi$_{2.1}$Sr$_{1.9}$CaCu$_2$O$_{8+x}$ with resonant soft x-ray scattering

Identifying what broken symmetries are present in the cuprates has become a major area of research. Many authors have reported evidence for so-called "$Q \sim 0$" order that involves broken inversion, mirror, chiral, or time-reversal symmetry that is uniform in space. Not all these observations are well understood and new experimental probes are needed. Here we use resonant soft x-ray scattering (RSXS) to search for $Q \sim 0$ order in Bi$_{2.1}$Sr$_{1.9}$CaCu$_2$O$_{8+x}$ (Bi-2212) by measuring the region of a forbidden Bragg peak, $(0,0,3)$, which is normally extinguished by symmetry but may become allowed on resonance if valence band order is present. Using circularly polarized light, we found that this reflection becomes allowed on the Cu $L_3$ resonance for temperatures $T_c < T < T^\ast$, though remains absent in linear polarization and at other temperatures. This observation suggests the existence of spatially uniform valence band order near the pseudogap temperature. In addition, we observed periodic oscillations in the specular reflectivity from the sample surface that resemble thin film interference fringes, though no known film is present. These fringes are highly resonant, appear in all polarizations, and exhibit a period that depends on the location where the beam strikes the sample surface. We speculate that these fringes arise from interaction between some intrinsic valence band instability and extrinsic structural surface morphologies of the material. Our study supports the existence of some kind of $Q \sim 0$ broken symmetry state in Bi-2212 at intermediate temperatures, and calls for further study using a microfocused beam that could disentangle microscopic effects from macroscopic heterogeneities.

cond-mat.str-el↗

arXiv2021

FAIR1M: A Benchmark Dataset for Fine-grained Object Recognition in High-Resolution Remote Sensing Imagery

With the rapid development of deep learning, many deep learning-based approaches have made great achievements in object detection task. It is generally known that deep learning is a data-driven method. Data directly impact the performance of object detectors to some extent. Although existing datasets have included common objects in remote sensing images, they still have some limitations in terms of scale, categories, and images. Therefore, there is a strong requirement for establishing a large-scale benchmark on object detection in high-resolution remote sensing images. In this paper, we propose a novel benchmark dataset with more than 1 million instances and more than 15,000 images for Fine-grAined object recognItion in high-Resolution remote sensing imagery which is named as FAIR1M. All objects in the FAIR1M dataset are annotated with respect to 5 categories and 37 sub-categories by oriented bounding boxes. Compared with existing detection datasets dedicated to object detection, the FAIR1M dataset has 4 particular characteristics: (1) it is much larger than other existing object detection datasets both in terms of the quantity of instances and the quantity of images, (2) it provides more rich fine-grained category information for objects in remote sensing images, (3) it contains geographic information such as latitude, longitude and resolution, (4) it provides better image quality owing to a careful data cleaning procedure. To establish a baseline for fine-grained object recognition, we propose a novel evaluation method and benchmark fine-grained object detection tasks and a visual classification task using several State-Of-The-Art (SOTA) deep learning-based models on our FAIR1M dataset. Experimental results strongly indicate that the FAIR1M dataset is closer to practical application and it is considerably more challenging than existing datasets.

cs.CV↗

arXiv2021

Dynamic Region-Aware Convolution

We propose a new convolution called Dynamic Region-Aware Convolution (DRConv), which can automatically assign multiple filters to corresponding spatial regions where features have similar representation. In this way, DRConv outperforms standard convolution in modeling semantic variations. Standard convolutional layer can increase the number of filers to extract more visual elements but results in high computational cost. More gracefully, our DRConv transfers the increasing channel-wise filters to spatial dimension with learnable instructor, which not only improve representation ability of convolution, but also maintains computational cost and the translation-invariance as standard convolution dose. DRConv is an effective and elegant method for handling complex and variable spatial information distribution. It can substitute standard convolution in any existing networks for its plug-and-play property, especially to power convolution layers in efficient networks. We evaluate DRConv on a wide range of models (MobileNet series, ShuffleNetV2, etc.) and tasks (Classification, Face Recognition, Detection and Segmentation). On ImageNet classification, DRConv-based ShuffleNetV2-0.5x achieves state-of-the-art performance of 67.1% at 46M multiply-adds level with 6.3% relative improvement.

cs.CV↗

arXiv2021

Efficient Optimal Selection for Composited Advertising Creatives with Tree Structure

Ad creatives are one of the prominent mediums for online e-commerce advertisements. Ad creatives with enjoyable visual appearance may increase the click-through rate (CTR) of products. Ad creatives are typically handcrafted by advertisers and then delivered to the advertising platforms for advertisement. In recent years, advertising platforms are capable of instantly compositing ad creatives with arbitrarily designated elements of each ingredient, so advertisers are only required to provide basic materials. While facilitating the advertisers, a great number of potential ad creatives can be composited, making it difficult to accurately estimate CTR for them given limited real-time feedback. To this end, we propose an Adaptive and Efficient ad creative Selection (AES) framework based on a tree structure. The tree structure on compositing ingredients enables dynamic programming for efficient ad creative selection on the basis of CTR. Due to limited feedback, the CTR estimator is usually of high variance. Exploration techniques based on Thompson sampling are widely used for reducing variances of the CTR estimator, alleviating feedback sparsity. Based on the tree structure, Thompson sampling is adapted with dynamic programming, leading to efficient exploration for potential ad creatives with the largest CTR. We finally evaluate the proposed algorithm on the synthetic dataset and the real-world dataset. The results show that our approach can outperform competing baselines in terms of convergence rate and overall CTR.

cs.IR↗

arXiv2021

Automated Creative Optimization for E-Commerce Advertising

Advertising creatives are ubiquitous in E-commerce advertisements and aesthetic creatives may improve the click-through rate (CTR) of the products. Nowadays smart advertisement platforms provide the function of compositing creatives based on source materials provided by advertisers. Since a great number of creatives can be generated, it is difficult to accurately predict their CTR given a limited amount of feedback. Factorization machine (FM), which models inner product interaction between features, can be applied for the CTR prediction of creatives. However, interactions between creative elements may be more complex than the inner product, and the FM-estimated CTR may be of high variance due to limited feedback. To address these two issues, we propose an Automated Creative Optimization (AutoCO) framework to model complex interaction between creative elements and to balance between exploration and exploitation. Specifically, motivated by AutoML, we propose one-shot search algorithms for searching effective interaction functions between elements. We then develop stochastic variational inference to estimate the posterior distribution of parameters based on the reparameterization trick, and apply Thompson Sampling for efficiently exploring potentially better creatives. We evaluate the proposed method with both a synthetic dataset and two public datasets. The experimental results show our method can outperform competing baselines with respect to cumulative regret. The online A/B test shows our method leads to a 7 increase in CTR compared to the baseline.

cs.IR↗

arXiv2020

ELMV: an Ensemble-Learning Approach for Analyzing Electrical Health Records with Significant Missing Values

Many real-world Electronic Health Record (EHR) data contains a large proportion of missing values. Leaving substantial portion of missing information unaddressed usually causes significant bias, which leads to invalid conclusion to be drawn. On the other hand, training a machine learning model with a much smaller nearly-complete subset can drastically impact the reliability and accuracy of model inference. Data imputation algorithms that attempt to replace missing data with meaningful values inevitably increase the variability of effect estimates with increased missingness, making it unreliable for hypothesis validation. We propose a novel Ensemble-Learning for Missing Value (ELMV) framework, which introduces an effective approach to construct multiple subsets of the original EHR data with a much lower missing rate, as well as mobilizing a dedicated support set for the ensemble learning in the purpose of reducing the bias caused by substantial missing values. ELMV has been evaluated on a real-world healthcare data for critical feature identification as well as a batch of simulation data with different missing rates for outcome prediction. On both experiments, ELMV clearly outperforms conventional missing value imputation methods and ensemble learning models.

cs.LG↗

arXiv2020

Elliptic Quantum Curves of Class $\mathcal{S}_k$

Quantum curves arise from Seiberg-Witten curves associated to 4d $\mathcal{N}=2$ gauge theories by promoting coordinates to non-commutative operators. In this way the algebraic equation of the curve is interpreted as an operator equation where a Hamiltonian acts on a wave-function with zero eigenvalue. We find that this structure generalises when one considers torus-compactified 6d $\mathcal{N}=(1,0)$ SCFTs. The corresponding quantum curves are elliptic in nature and hence the associated eigenvectors/eigenvalues can be expressed in terms of Jacobi forms. In this paper we focus on the class of 6d SCFTs arising from M5 branes transverse to a $\mathbb{C}^2/\mathbb{Z}_k$ singularity. In the limit where the compactified 2-torus has zero size, the corresponding 4d $\mathcal{N}=2$ theories are known as class $\mathcal{S}_k$. We explicitly show that the eigenvectors associated to the quantum curve are expectation values of codimension 2 surface operators, while the corresponding eigenvalues are codimension 4 Wilson surface expectation values.

hep-th↗

arXiv2020

A Coalition-Based Communication Framework for Task-Driven Flying Ad-Hoc Networks

In this paper, we develop a task-driven networking framework for Flying Ad-hoc Networks (FANETs), where a coalition-based model is outlined. Firstly, we present a brief survey to show the state-of-the-art studies on the intra-communication of unmanned aerial vehicle (UAV) swarms. The features and deficiencies of existing models are analyzed. To capture the task-driven requirement of the flying multi-agent system, a coalition-based framework is proposed. We discuss the composition, networking mode and the classification of data transmission. After that, the application scenario of UAV coalitions is given, where large-scale, distributed and highly dynamic characteristics greatly increase the difficulty of resource optimization for UAVs. To tackle the problem, we design an intelligence-based optimization architecture, which mainly includes the game model, machine learning and real-time decision. Under the guidance of game theories and machine learning, UAVs can make comprehensive decisions by combining the previous training results with their sensing, information interaction, and game strategies. Finally, a preliminary case and promising open issues of UAV coalitions are studied.

cs.NI↗

arXiv2020

Long Way to Ricci Flatness

We study two-dimensional weighted ${\mathcal N}=2$ supersymmetric $\mathbb{CP}$ models with the goal of exploring their infrared (IR) limit. $\mathbb{WCP}(N,\widetilde{N})$ are simplified versions of world-sheet theories on non-Abelian strings in four-dimensional ${\mathcal N}=2$ QCD. In the gauged linear sigma model (GLSM) formulation, $\mathbb{WCP} (N,\widetilde{N})$ has $N$ charges +1 and $\widetilde{N}$ charges $-1$ fields. As well-known, at $\widetilde{N}=N$ this GLSM is conformal. Its target space is believed to be a non-compact Calabi-Yau manifold. We mostly focus on the $N=2$ case, then the Calabi-Yau space is a conifold. On the other hand, in the non-linear sigma model (NLSM) formulation the model has ultra-violet logarithms and does not look conformal. Moreover, its metric is not Ricci-flat. We address this puzzle by studying the renormalization group (RG) flow of the model. We show that the metric of NLSM becomes Ricci-flat in the IR. Moreover, it tends to the known metric of the resolved conifold. We also study a close relative of the $\mathbb{WCP}$ model -- the so called $zn$ model -- which in actuality represents the world sheet theory on a non-Abelian semilocal string and show that this $zn$ model has similar RG properties.

hep-th↗

arXiv2020

STAN-CT: Standardizing CT Image using Generative Adversarial Network

Computed tomography (CT) plays an important role in lung malignancy diagnostics and therapy assessment and facilitating precision medicine delivery. However, the use of personalized imaging protocols poses a challenge in large-scale cross-center CT image radiomic studies. We present an end-to-end solution called STAN-CT for CT image standardization and normalization, which effectively reduces discrepancies in image features caused by using different imaging protocols or using different CT scanners with the same imaging protocol. STAN-CT consists of two components: 1) a novel Generative Adversarial Networks (GAN) model that is capable of effectively learning the data distribution of a standard imaging protocol with only a few rounds of generator training, and 2) an automatic DICOM reconstruction pipeline with systematic image quality control that ensure the generation of high-quality standard DICOM images. Experimental results indicate that the training efficiency and model performance of STAN-CT have been significantly improved compared to the state-of-the-art CT image standardization and normalization algorithms.

eess.IV↗

arXiv2020

Adaptive Graph Convolutional Network with Attention Graph Clustering for Co-saliency Detection

Co-saliency detection aims to discover the common and salient foregrounds from a group of relevant images. For this task, we present a novel adaptive graph convolutional network with attention graph clustering (GCAGC). Three major contributions have been made, and are experimentally shown to have substantial practical merits. First, we propose a graph convolutional network design to extract information cues to characterize the intra- and interimage correspondence. Second, we develop an attention graph clustering algorithm to discriminate the common objects from all the salient foreground objects in an unsupervised fashion. Third, we present a unified framework with encoder-decoder structure to jointly train and optimize the graph convolutional network, attention graph cluster, and co-saliency detection decoder in an end-to-end manner. We evaluate our proposed GCAGC method on three cosaliency detection benchmark datasets (iCoseg, Cosal2015 and COCO-SEG). Our GCAGC method obtains significant improvements over the state-of-the-arts on most of them.

cs.CV↗

arXiv2020

4d N=1 from 6d D-type N=(1,0)

Compactifications of 6d N=(1,0) SCFTs give rise to new 4d N=1 SCFTs and shed light on interesting dualities between such theories. In this paper we continue exploring this line of research by extending the class of compactified 6d theories to the D-type case. The simplest such 6d theory arises from D5 branes probing D-type singularities. Equivalently, this theory can be obtained from an F-theory compactification using "-2"-curves intersecting according to a D-type quiver. Our approach is two-fold. We start by compactifying the 6d SCFT on a Riemann surface and compute the central charges of the resulting 4d theory by integrating the 6d anomaly polynomial over the Riemann surface. As a second step, in order to find candidate 4d UV Lagrangians, there is an intermediate 5d theory that serves to construct 4d domain walls. These can be used as building blocks to obtain torus compactifications. In contrast to the A-type case, the vanishing of anomalies in the 4d theory turns out to be very restrictive and constraints the choices of gauge nodes and matter content severely. As a consequence, in this paper one has to resort to non-maximal boundary conditions for the 4d domain walls. However, the comparison to the 6d theory compactified on the Riemann surface becomes less tractable.

hep-th↗

arXiv2020

Video Saliency Prediction Using Enhanced Spatiotemporal Alignment Network

Due to a variety of motions across different frames, it is highly challenging to learn an effective spatiotemporal representation for accurate video saliency prediction (VSP). To address this issue, we develop an effective spatiotemporal feature alignment network tailored to VSP, mainly including two key sub-networks: a multi-scale deformable convolutional alignment network (MDAN) and a bidirectional convolutional Long Short-Term Memory (Bi-ConvLSTM) network. The MDAN learns to align the features of the neighboring frames to the reference one in a coarse-to-fine manner, which can well handle various motions. Specifically, the MDAN owns a pyramidal feature hierarchy structure that first leverages deformable convolution (Dconv) to align the lower-resolution features across frames, and then aggregates the aligned features to align the higher-resolution features, progressively enhancing the features from top to bottom. The output of MDAN is then fed into the Bi-ConvLSTM for further enhancement, which captures the useful long-time temporal information along forward and backward timing directions to effectively guide attention orientation shift prediction under complex scene transformation. Finally, the enhanced features are decoded to generate the predicted saliency map. The proposed model is trained end-to-end without any intricate post processing. Extensive evaluations on four VSP benchmark datasets demonstrate that the proposed method achieves favorable performance against state-of-the-art methods. The source codes and all the results will be released.

cs.CV↗

arXiv2019

Deep Object Co-segmentation via Spatial-Semantic Network Modulation

Object co-segmentation is to segment the shared objects in multiple relevant images, which has numerous applications in computer vision. This paper presents a spatial and semantic modulated deep network framework for object co-segmentation. A backbone network is adopted to extract multi-resolution image features. With the multi-resolution features of the relevant images as input, we design a spatial modulator to learn a mask for each image. The spatial modulator captures the correlations of image feature descriptors via unsupervised learning. The learned mask can roughly localize the shared foreground object while suppressing the background. For the semantic modulator, we model it as a supervised image classification task. We propose a hierarchical second-order pooling module to transform the image features for classification use. The outputs of the two modulators manipulate the multi-resolution features by a shift-and-scale operation so that the features focus on segmenting co-object regions. The proposed model is trained end-to-end without any intricate post-processing. Extensive experiments on four image co-segmentation benchmark datasets demonstrate the superior accuracy of the proposed method compared to state-of-the-art methods.

cs.CV↗

arXiv2019

DeepAAA: clinically applicable and generalizable detection of abdominal aortic aneurysm using deep learning

We propose a deep learning-based technique for detection and quantification of abdominal aortic aneurysms (AAAs). The condition, which leads to more than 10,000 deaths per year in the United States, is asymptomatic, often detected incidentally, and often missed by radiologists. Our model architecture is a modified 3D U-Net combined with ellipse fitting that performs aorta segmentation and AAA detection. The study uses 321 abdominal-pelvic CT examinations performed by Massachusetts General Hospital Department of Radiology for training and validation. The model is then further tested for generalizability on a separate set of 57 examinations with differing patient demographics and acquisition characteristics than the original dataset. DeepAAA achieves high performance on both sets of data (sensitivity/specificity 0.91/0.95 and 0.85 / 1.0 respectively), on contrast and non-contrast CT scans and works with image volumes with varying numbers of images. We find that DeepAAA exceeds literature-reported performance of radiologists on incidental AAA detection. It is expected that the model can serve as an effective background detector in routine CT examinations to prevent incidental AAAs from being missed.

eess.IV↗

arXiv2019

Domain Adversarial Reinforcement Learning for Partial Domain Adaptation

Partial domain adaptation aims to transfer knowledge from a label-rich source domain to a label-scarce target domain which relaxes the fully shared label space assumption across different domains. In this more general and practical scenario, a major challenge is how to select source instances in the shared classes across different domains for positive transfer. To address this issue, we propose a Domain Adversarial Reinforcement Learning (DARL) framework to automatically select source instances in the shared classes for circumventing negative transfer as well as to simultaneously learn transferable features between domains by reducing the domain shift. Specifically, in this framework, we employ deep Q-learning to learn policies for an agent to make selection decisions by approximating the action-value function. Moreover, domain adversarial learning is introduced to learn domain-invariant features for the selected source instances by the agent and the target instances, and also to determine rewards for the agent based on how relevant the selected source instances are to the target domain. Experiments on several benchmark datasets demonstrate that the superior performance of our DARL method over existing state of the arts for partial domain adaptation.

cs.LG↗

arXiv2019

Giant Interfacial Thermal Resistance Arising From Materials With Mismatched Phonon Structures

Previous researches only reported very small interfacial thermal resistances at room temperature due to limitations in sample combinations and methods. Taking cognizance of the importance of mismatched phonon structures, we report values up to $2*10^{-4}W^{-1}m^{2}K$, thousand times larger than highest values reported to date. This enables substantial tuning of the thermal conductivity in composites, and does not constrain other characteristics. Our findings inspire new design strategies, for heat control in integrated circuits and thermoelectric composites, that harness thermal transport at interfaces.

cond-mat.mtrl-sci↗

arXiv2019

A Game-Theoretic Learning Framework for Multi-Agent Intelligent Wireless Networks

In this article, we introduce a game-theoretic learning framework for the multi-agent wireless network. By combining learning in artificial intelligence (AI) with game theory, several promising properties emerge such as obtaining high payoff in the unknown and dynamic environment, coordinating the actions of agents and making the adversarial decisions with the existence of malicious users. Unfortunately, there is no free lunch. To begin with, we discuss the connections between learning in AI and game theory mainly in three levels, i.e., pattern recognition, prediction and decision making. Then, we discuss the challenges and requirements of the combination for the intelligent wireless network, such as constrained capabilities of agents, incomplete information obtained from the environment and the distributed, dynamically scalable and heterogeneous characteristics of wireless network. To cope with these, we propose a game-theoretic learning framework for the wireless network, including the internal coordination (resource optimization) and external adversarial decision-making (anti-jamming). Based on the framework, we introduce several attractive game-theoretic learning methods combining with the typical applications that we have proposed. What's more, we developed a real-life testbed for the multi-agent anti-jamming problem based on the game-theoretic learning framework. The experiment results verify the effectiveness of the proposed game-theoretic learning method.

cs.GT↗