Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
58works
0followers
27topics
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

58 published item(s)

preprint2026arXiv

A Scheduling Framework for Efficient MoE Inference on Edge GPU-NDP Systems

Mixture-of-Experts (MoE) models facilitate edge deployment by decoupling model capacity from active computation, yet their large memory footprint drives the need for GPU systems with near-data processing (NDP) capabilities that offload experts to dedicated processing units. However, deploying MoE models on such edge-based GPU-NDP systems faces three critical challenges: 1) severe load imbalance across NDP units due to non-uniform expert selection and expert parallelism, 2) insufficient GPU utilization during expert computation within NDP units, and 3) extensive data pre-profiling necessitated by unpredictable expert activation patterns for pre-fetching. To address these challenges, this paper proposes an efficient inference framework featuring three key optimizations. First, the underexplored tensor parallelism in MoE inference is exploited to partition and compute large expert parameters across multiple NDP units simultaneously towards edge low-batch scenarios. Second, a load-balancing-aware scheduling algorithm distributes expert computations across NDP units and GPU to maximize resource utilization. Third, a dataset-free pre-fetching strategy proactively loads frequently accessed experts to minimize activation delays. Experimental results show that our framework enables GPU-NDP systems to achieve 2.41x on average and up to 2.56x speedup in end-to-end latency compared to state-of-the-art approaches, significantly enhancing MoE inference efficiency in resource-constrained environments.

preprint2026arXiv

CD-PIM: A High-Bandwidth and Compute-Efficient LPDDR5-Based PIM for Low-Batch LLM Acceleration on Edge-Device

Edge deployment of low-batch large language models (LLMs) faces critical memory bandwidth bottlenecks when executing memory-intensive general matrix-vector multiplications (GEMV) operations. While digital processing-in-memory (PIM) architectures promise to accelerate GEMV operations, existing PIM-equipped edge devices still suffer from three key limitations: limited bandwidth improvement, component under-utilization in mixed workloads, and low compute capacity of computing units (CUs). In this paper, we propose CD-PIM to address these challenges through three key innovations. First, we introduce a high-bandwidth compute-efficient mode (HBCEM) that enhances bandwidth by dividing each bank into four pseudo-banks through segmented global bitlines. Second, we propose a low-batch interleaving mode (LBIM) to improve component utilization by overlapping GEMV operations with GEMM operations. Third, we design a compute-efficient CU that performs enhanced GEMV operations in a pipelined manner by serially feeding weight data into the computing core. Forth, we adopt a column-wise mapping for the key-cache matrix and row-wise mapping for the value-cache matrix, which fully utilizes CU resources. Our evaluation shows that compared to a GPU-only baseline and state-of-the-art PIM designs, our CD-PIM achieves 11.42x and 4.25x speedup on average within a single batch in HBCEM mode, respectively. Moreover, for low-batch sizes, the CD-PIM achieves an average speedup of 1.12x in LBIM compared to HBCEM.

preprint2026arXiv

Dipion transitions from $X(3872)$ to $χ_{cJ}\ (J=0,1,2)$

In this work, we investigate the dipion transition processes $X(3872)\to ππχ_{cJ} (J=0,1,2)$ within the framework of heavy hadron chiral perturbation theory, treating $X(3872)$ as a molecular state composed of $D\bar{D}^*$+ H.c. components. By analyzing the box and triangle loop diagrams with the nonrelativistic effective field theory power-counting rule, we demonstrate that box diagrams dominate these dipion transition processes. Branching ratios are calculated as functions of the mixing angle $θ$, which parametrizes the neutral and charged meson compositions of the $X(3872)$. Our results indicate that the branching fractions for $X(3872)\toππχ_{c0}$, $X(3872)\to ππχ_{c1}$, and $X(3872)\to ππχ_{c2}$ are of the orders of $10^{-4}$, $10^{-3}$, and $10^{-5}$, respectively. We also predict the ratios ${\mathcal{B}[X(3872)\rightarrow ππχ_{c0/2}]}/{\mathcal{B}[X(3872)\rightarrow ππχ_{c1}]}$ and ${\mathcal{B}[X(3872)\rightarrow π^+π^-χ_{cJ}]}/{\mathcal{B}[X(3872)\rightarrow π^0π^0χ_{cJ}]}$. The latter deviates from isospin-symmetry expectations, revealing various degrees of isospin violation. By studying the $π^+π^-$ and $π^+χ_{cJ}$ invariant mass spectra, we find a double-bump structure in the $π^ + π^-$ invariant mass distributions of the process $X(3872)\to π^+π^-χ_{c1}$ and $π^+χ_{c0}$ invariant mass distribution of the process $X(3872)\to π^+π^-χ_{c0}$, which could be tested by future experimental measurements.

preprint2026arXiv

SpatialNav: Leveraging Spatial Scene Graphs for Zero-Shot Vision-and-Language Navigation

Although learning-based vision-and-language navigation (VLN) agents can learn spatial knowledge implicitly from large-scale training data, zero-shot VLN agents lack this process, relying primarily on local observations for navigation, which leads to inefficient exploration and a significant performance gap. To deal with the problem, we consider a zero-shot VLN setting that agents are allowed to fully explore the environment before task execution. Then, we construct the Spatial Scene Graph (SSG) to explicitly capture global spatial structure and semantics in the explored environment. Based on the SSG, we introduce SpatialNav, a zero-shot VLN agent that integrates an agent-centric spatial map, a compass-aligned visual representation, and a remote object localization strategy for efficient navigation. Comprehensive experiments in both discrete and continuous environments demonstrate that SpatialNav significantly outperforms existing zero-shot agents and clearly narrows the gap with state-of-the-art learning-based methods. Such results highlight the importance of global spatial representations for generalizable navigation.

preprint2026arXiv

VLN-MME: Diagnosing MLLMs as Language-guided Visual Navigation agents

Multimodal Large Language Models (MLLMs) have demonstrated remarkable capabilities across a wide range of vision-language tasks. However, their performance as embodied agents, which requires multi-round dialogue spatial reasoning and sequential action prediction, needs further exploration. Our work investigates this potential in the context of Vision-and-Language Navigation (VLN) by introducing a unified and extensible evaluation framework to probe MLLMs as zero-shot agents by bridging traditional navigation datasets into a standardized benchmark, named VLN-MME. We simplify the evaluation with a highly modular and accessible design. This flexibility streamlines experiments, enabling structured comparisons and component-level ablations across diverse MLLM architectures, agent designs, and navigation tasks. Crucially, enabled by our framework, we observe that enhancing our baseline agent with Chain-of-Thought (CoT) reasoning and self-reflection leads to an unexpected performance decrease. This suggests MLLMs exhibit poor context awareness in embodied navigation tasks; although they can follow instructions and structure their output, their 3D spatial reasoning fidelity is low. VLN-MME lays the groundwork for systematic evaluation of general-purpose MLLMs in embodied navigation settings and reveals limitations in their sequential decision-making capabilities. We believe these findings offer crucial guidance for MLLM post-training as embodied agents.

preprint2026arXiv

X-OmniClaw Technical Report: A Unified Mobile Agent for Multimodal Understanding and Interaction

Inspired by the development of OpenClaw, there is a growing demand for mobile-based personal agents capable of handling complex and intuitive interactions. In this technical report, we introduce X-OmniClaw, a unified mobile agent designed for multimodal understanding and interaction in the Android ecosystem. This unified architecture of perception, memory, and action enables the agent to handle complex mobile tasks with high contextual awareness. Specifically, Omni Perception provides a unified multimodal ingress pipeline that integrates UI states, real-world visual contexts, and speech inputs, leveraging a temporal alignment module to decompose raw data into structured multimodal intent representations. Omni Memory leverages multimodal memory optimization to enhance personalized intelligence by integrating runtime working memory for task continuity with long-term personal memory distilled from local data, enabling highly context-aware and personalized interactions. Finally, Omni Action employs a hybrid grounding strategy that combines structural XML metadata with visual perception for robust interaction. Through Behavior Cloning and Trajectory Replay, the system captures user navigation as reusable skills, enabling precise direct-access execution. Demonstrations across diverse scenarios show that X-OmniClaw effectively enhances interaction efficiency and task reliability, providing a practical architectural blueprint for the next generation of mobile-native personal assistants.

preprint2024arXiv

Hidden charmonium decays of spin-2 partner of $X(3872)$

The Belle collaboration recently reported a promising candidate for the spin-2 $D^*\bar{D}^*$ partner of the $X(3872)$, called the $X_2$ for short, having a mass of $(4014.3 \pm 4.0 \pm 1.5)~\mathrm{MeV}$ and a width of $(4 \pm 11 \pm 6)~\mathrm{MeV} $. Assuming the $X_2$ as a pure molecule of the $D^*\bar{D}^*$, we calculated in detail the hidden charmonium decays of the $X_2 \to J/ψV$ and $X_2\toη_cP$ via the intermediate meson loops, where $V = ρ^0\,,ω$ and $P= π^0\,,η\,,η'$. The results indicate that the decay widths are strongly dependent on the $X_2$ mass. At present center value of the mass $4014.3~\mathrm{MeV}$, the width for the $X_2\to J/ψρ^0$ is predicted to be a few tens of keV, while it is on the order of $10^{2\text{-}3}~\mathrm{keV}$ for the $X_2\to J/ ψω$; the predicted width for the $X_2\to η_c π^0$ is about a few keV, while the widths for $X_2\toη_cη$ and $η_cη'$ are around a few tens and tenths of keV, respectively. We also investigated the dependence of the ratios between these widths on the $X_2$ mass and on the $η$-$η'$ mixing angle, which may be good quantities for experiments. We hope that the present calculations would be checked experimentally in the future.

preprint2023arXiv

The optical spectral features of 27 Fermi blazars

A spectral variation accompanied with flux variability is a commonly-observed phenomenon for blazars. In order to further investigate the optical spectral feature of blazars, we have collected the long-term optical V and R band data of 27 blazars (14 BL Lacs and 13 FSRQs), and calculated their optical spectral indices. The results show that the spectral indices vary with respect to the brightness for all of these blazars. In general, the optical spectrum progressively becomes flatter (or steeper), when the brightness increases. However the spectrum changes more and more slowly, until it tends to be stable. In other words, the source becomes bluer (or redder) and then gradually stabilizes when it brightens, which are briefly named the bluer-stable-when-brighter (BSWB) and redder-stable-when-brighter (RSWB) behaviors, respectively. Thirteen of the 14 BL Lacs show the BSWB behavior, with an exception of AO 0235+164. On the contrary, most of FSRQs (10 out of 13) exhibit the RSWB trend. It is confirmed that blazars follow the two universal optical spectral behaviors, namely, BSWB and RSWB. The model of two constant-spectral-index components can well explain the optical spectral features qualitatively and quantitatively. The results illustrate that the optical emission are mainly composed of two stable-color components, i.e., less variable thermal emission and high variable synchrotron radiation. And in most cases, the thermal component of BL Lacs is redder than that of synchrotron radiation, whereas FSRQs are the opposite.

preprint2022arXiv

An Automated FPGA-based Framework for Rapid Prototyping of Nonbinary LDPC Codes

Nonbinary LDPC codes have shown superior performance close to the Shannon limit. Compared to binary LDPC codes of similar lengths, they can reach orders of magnitudes lower error rate. However, multitude of design freedoms of nonbinary LDPC codes complicates the practical code and decoder design process. Fast simulations are critically important to evaluate the pros and cons. Rapid prototyping on FPGA is attractive but takes significant design efforts due to its high design complexity. We propose a high-throughput reconfigurable hardware emulation architecture with decoder and peripheral co-design. The architecture enables a library and script-based framework that automates the construction of FPGA emulations. Code and decoder design parameters are programmed either during run time or by script in design time. We demonstrate the capability of the framework in evaluating practical code and decoder design by experimenting with two popular nonbinary LDPC codes, regular (2, dc) codes and quasi-cyclic codes: each emulation model can be auto-constructed within hours and the decoder delivers excellent error-correcting performance on a Xilinx Virtex-5 FPGA with throughput of up to hundreds of Mbps.

preprint2022arXiv

Attract me to Buy: Advertisement Copywriting Generation with Multimodal Multi-structured Information

Recently, online shopping has gradually become a common way of shopping for people all over the world. Wonderful merchandise advertisements often attract more people to buy. These advertisements properly integrate multimodal multi-structured information of commodities, such as visual spatial information and fine-grained structure information. However, traditional multimodal text generation focuses on the conventional description of what existed and happened, which does not match the requirement of advertisement copywriting in the real world. Because advertisement copywriting has a vivid language style and higher requirements of faithfulness. Unfortunately, there is a lack of reusable evaluation frameworks and a scarcity of datasets. Therefore, we present a dataset, E-MMAD (e-commercial multimodal multi-structured advertisement copywriting), which requires, and supports much more detailed information in text generation. Noticeably, it is one of the largest video captioning datasets in this field. Accordingly, we propose a baseline method and faithfulness evaluation metric on the strength of structured information reasoning to solve the demand in reality on this dataset. It surpasses the previous methods by a large margin on all metrics. The dataset and method are coming soon on \url{https://e-mmad.github.io/e-mmad.net/index.html}.

preprint2022arXiv

BERT-based Financial Sentiment Index and LSTM-based Stock Return Predictability

Traditional sentiment construction in finance relies heavily on the dictionary-based approach, with a few exceptions using simple machine learning techniques such as Naive Bayes classifier. While the current literature has not yet invoked the rapid advancement in the natural language processing, we construct in this research a textual-based sentiment index using a well-known pre-trained model BERT developed by Google, especially for three actively trading individual stocks in Hong Kong market with at the same time the hot discussion on Weibo.com. On the one hand, we demonstrate a significant enhancement of applying BERT in financial sentiment analysis when compared with the existing models. On the other hand, by combining with the other two commonly-used methods when it comes to building the sentiment index in the financial literature, i.e., the option-implied and the market-implied approaches, we propose a more general and comprehensive framework for the financial sentiment analysis, and further provide convincing outcomes for the predictability of individual stock return by combining LSTM (with a feature of a nonlinear mapping). It is significantly distinct with the dominating econometric methods in sentiment influence analysis which are all of a nature of linear regression.

preprint2022arXiv

Bridging the Gap Between Learning in Discrete and Continuous Environments for Vision-and-Language Navigation

Most existing works in vision-and-language navigation (VLN) focus on either discrete or continuous environments, training agents that cannot generalize across the two. The fundamental difference between the two setups is that discrete navigation assumes prior knowledge of the connectivity graph of the environment, so that the agent can effectively transfer the problem of navigation with low-level controls to jumping from node to node with high-level actions by grounding to an image of a navigable direction. To bridge the discrete-to-continuous gap, we propose a predictor to generate a set of candidate waypoints during navigation, so that agents designed with high-level actions can be transferred to and trained in continuous environments. We refine the connectivity graph of Matterport3D to fit the continuous Habitat-Matterport3D, and train the waypoints predictor with the refined graphs to produce accessible waypoints at each time step. Moreover, we demonstrate that the predicted waypoints can be augmented during training to diversify the views and paths, and therefore enhance agent's generalization ability. Through extensive experiments we show that agents navigating in continuous environments with predicted waypoints perform significantly better than agents using low-level actions, which reduces the absolute discrete-to-continuous gap by 11.76% Success Weighted by Path Length (SPL) for the Cross-Modal Matching Agent and 18.24% SPL for the Recurrent VLN-BERT. Our agents, trained with a simple imitation learning objective, outperform previous methods by a large margin, achieving new state-of-the-art results on the testing environments of the R2R-CE and the RxR-CE datasets.

preprint2022arXiv

BSRT: Improving Burst Super-Resolution with Swin Transformer and Flow-Guided Deformable Alignment

This work addresses the Burst Super-Resolution (BurstSR) task using a new architecture, which requires restoring a high-quality image from a sequence of noisy, misaligned, and low-resolution RAW bursts. To overcome the challenges in BurstSR, we propose a Burst Super-Resolution Transformer (BSRT), which can significantly improve the capability of extracting inter-frame information and reconstruction. To achieve this goal, we propose a Pyramid Flow-Guided Deformable Convolution Network (Pyramid FG-DCN) and incorporate Swin Transformer Blocks and Groups as our main backbone. More specifically, we combine optical flows and deformable convolutions, hence our BSRT can handle misalignment and aggregate the potential texture information in multi-frames more efficiently. In addition, our Transformer-based structure can capture long-range dependency to further improve the performance. The evaluation on both synthetic and real-world tracks demonstrates that our approach achieves a new state-of-the-art in BurstSR task. Further, our BSRT wins the championship in the NTIRE2022 Burst Super-Resolution Challenge.

preprint2022arXiv

ClusTR: Exploring Efficient Self-attention via Clustering for Vision Transformers

Although Transformers have successfully transitioned from their language modelling origins to image-based applications, their quadratic computational complexity remains a challenge, particularly for dense prediction. In this paper we propose a content-based sparse attention method, as an alternative to dense self-attention, aiming to reduce the computation complexity while retaining the ability to model long-range dependencies. Specifically, we cluster and then aggregate key and value tokens, as a content-based method of reducing the total token count. The resulting clustered-token sequence retains the semantic diversity of the original signal, but can be processed at a lower computational cost. Besides, we further extend the clustering-guided attention from single-scale to multi-scale, which is conducive to dense prediction tasks. We label the proposed Transformer architecture ClusTR, and demonstrate that it achieves state-of-the-art performance on various vision tasks but at lower computational cost and with fewer parameters. For instance, our ClusTR small model with 22.7M parameters achieves 83.2\% Top-1 accuracy on ImageNet. Source code and ImageNet models will be made publicly available.

preprint2022arXiv

Custom Sine Waves Are Enough for Imitation Learning of Bipedal Gaits with Different Styles

Not until recently, robust bipedal locomotion has been achieved through reinforcement learning. However, existing implementations rely heavily on insights and efforts from human experts, which is costly for the iterative design of robot systems. Also, styles of the learned motion are strictly limited to that of the reference. In this paper, we propose a new way to learn bipedal locomotion from a simple sine wave as the reference for foot heights. With the naive human insight that the two feet should be lifted up alternatively and periodically, we experimentally demonstrate on the Cassie robot that, a simple reward function is able to make the robot learn to walk end-to-end and efficiently without any explicit knowledge of the model. With custom sine waves, the learned gait pattern can also have customized styles. Codes are released at github.com/WooQi57/sin-cassie-rl.

preprint2022arXiv

Diagnosing Vision-and-Language Navigation: What Really Matters

Vision-and-language navigation (VLN) is a multimodal task where an agent follows natural language instructions and navigates in visual environments. Multiple setups have been proposed, and researchers apply new model architectures or training techniques to boost navigation performance. However, there still exist non-negligible gaps between machines' performance and human benchmarks. Moreover, the agents' inner mechanisms for navigation decisions remain unclear. To the best of our knowledge, how the agents perceive the multimodal input is under-studied and needs investigation. In this work, we conduct a series of diagnostic experiments to unveil agents' focus during navigation. Results show that indoor navigation agents refer to both object and direction tokens when making decisions. In contrast, outdoor navigation agents heavily rely on direction tokens and poorly understand the object tokens. Transformer-based agents acquire a better cross-modal understanding of objects and display strong numerical reasoning ability than non-Transformer-based agents. When it comes to vision-and-language alignments, many models claim that they can align object tokens with specific visual targets. We find unbalanced attention on the vision and text input and doubt the reliability of such cross-modal alignments.

preprint2022arXiv

Fast Nearest Convolution for Real-Time Efficient Image Super-Resolution

Deep learning-based single image super-resolution (SISR) approaches have drawn much attention and achieved remarkable success on modern advanced GPUs. However, most state-of-the-art methods require a huge number of parameters, memories, and computational resources, which usually show inferior inference times when applying them to current mobile device CPUs/NPUs. In this paper, we propose a simple plain convolution network with a fast nearest convolution module (NCNet), which is NPU-friendly and can perform a reliable super-resolution in real-time. The proposed nearest convolution has the same performance as the nearest upsampling but is much faster and more suitable for Android NNAPI. Our model can be easily deployed on mobile devices with 8-bit quantization and is fully compatible with all major mobile AI accelerators. Moreover, we conduct comprehensive experiments on different tensor operations on a mobile device to illustrate the efficiency of our network architecture. Our NCNet is trained and validated on the DIV2K 3x dataset, and the comparison with other efficient SR methods demonstrated that the NCNet can achieve high fidelity SR results while using fewer inference times. Our codes and pretrained models are publicly available at \url{https://github.com/Algolzw/NCNet}.

preprint2022arXiv

Flipping of antiferromagnetic to superconducting states in pressurized quasi-one-dimensional manganese-based compounds

One of the universal features of unconventional superconductors is that the superconducting (SC) state is developed in the proximity of an antiferromagnetic (AFM) state. Understanding the interplay between these two states is one of the key issues to uncover the underlying physics of unconventional SC mechanism. Here, we report a pressure-induced flipping of the AFM state to SC state in the quasi-one-dimensional AMn6Bi5 (A = K, Rb, and Cs) compounds. We find that at a critical pressure the AFM state suddenly disappears at a finite temperature and a SC state simultaneously emerges at a lower temperature without detectable structural changes. Intriguingly, all members of the family present the AFM-SC transition at almost the same critical pressures (Pc), though their ambient-pressure unit-cell volumes vary substantially. Our theoretical calculations indicate that the increasing weight of dxz orbital electrons near Fermi energy under the pressure may be the origin of the flipping. These results reveal a diversity of competing nature between the AFM and SC states among the 3d-transition-metal compounds.

preprint2022arXiv

Four-dimensional direct detection with Jones space optical full-field recovery

Data centers, the engines of the global Internet, are supported by massive high-speed optical interconnects. In optical fiber communication, the classic direct detection obtains only the intensity of the optical field, while the coherent detection counterpart utilizes both phase and polarization diversities at the expense of beating with a narrow-linewidth and high-stable local oscillator (LO). Herein, we propose and demonstrate a four-dimensional Jones space optical field recovery (4-D JSFR) scheme without LO. The information encoded on the intensity and phase of both polarizations can be captured by the polarization-diversity full-field receiver structure and subsequently extracted through deep neural network-aided field recovery. It achieves similar electrical spectral efficiency as standard intradyne coherent detection. The fully recovered optical field can extend the transmission distance beyond the power fading limitation induced by fiber chromatic dispersion. Furthermore, the LO-free advantage makes 4-D JSFR suitable for monolithic photonic integration, offering a spectrally efficient and cost-effective candidate for large-scale data center applications. Our results could motivate a fundamental paradigm shift in the optical field recovery theory and future optical transceiver design.

preprint2022arXiv

MuKEA: Multimodal Knowledge Extraction and Accumulation for Knowledge-based Visual Question Answering

Knowledge-based visual question answering requires the ability of associating external knowledge for open-ended cross-modal scene understanding. One limitation of existing solutions is that they capture relevant knowledge from text-only knowledge bases, which merely contain facts expressed by first-order predicates or language descriptions while lacking complex but indispensable multimodal knowledge for visual understanding. How to construct vision-relevant and explainable multimodal knowledge for the VQA scenario has been less studied. In this paper, we propose MuKEA to represent multimodal knowledge by an explicit triplet to correlate visual objects and fact answers with implicit relations. To bridge the heterogeneous gap, we propose three objective losses to learn the triplet representations from complementary views: embedding structure, topological relation and semantic space. By adopting a pre-training and fine-tuning learning strategy, both basic and domain-specific multimodal knowledge are progressively accumulated for answer prediction. We outperform the state-of-the-art by 3.35% and 6.08% respectively on two challenging knowledge-required datasets: OK-VQA and KRVQA. Experimental results prove the complementary benefits of the multimodal knowledge with existing knowledge bases and the advantages of our end-to-end framework over the existing pipeline methods. The code is available at https://github.com/AndersonStra/MuKEA.

preprint2022arXiv

Observation of three superconducting transitions in the pressurized CDW-bearing compound TaTe2

Transition metal dichalcogenides host a wide variety of lattice and electronic structures, as well as corresponding exotic physical properties, especially under certain tuning conditions. Here, we are the first to report the observation of pressure-induced three superconducting transitions in TaTe2, a charge density wave (CDW) - bearing layered transition-metal dichalcogenide that is metallic but not superconducting at ambient pressure. We find that its CDW state can be easily suppressed upon increasing pressure up to ~ 1 GPa. A superconducting state then emerges from the suppressed CDW state and persists to the pressure about 7 GPa. Unexpectedly, another superconducting state appears at ~ 11 GPa within the same monoclinic (M) structure of its ambient-pressure one. Upon further compression to 21 GPa, a third superconducting state with higher Tc appears from a high-pressure (HP) phase. Our experimental results suggest that the pressure-induced three superconducting transitions in TaTe2 are respectively driven by the suppression of the CDW state, the change of the angle in the M phase and the transition of M-to-HP phase. These results demonstrate not only the versatile nature of this correlated electron system, but also the first experimental example that shows the pressure-induced evolution from a CDW state to three superconducting states driven by different mechanisms.

preprint2022arXiv

Optical Field Recovery in Jones Space

Optical full-field recovery makes it possible to compensate for fiber impairments such as chromatic dispersion and polarization mode dispersion (PMD) in the digital signal processing. For cost-sensitive short-reach optical networks, some advanced single-polarization (SP) optical field recovery schemes are recently proposed to avoid chromatic dispersion-induced power fading effect, and improve the spectral efficiency for larger potential capacity. Polarization division multiplexing (PDM) can further double both the spectral efficiency and the system capacity of these SP carrier-assisted direct detection (DD) schemes. However, the so-called polarization fading phenomenon induced by random polarization rotation is a fundamental obstacle which prevents SP carrier-assisted DD systems from polarization diversity. In this paper, we propose a receiver of Jones-space field recovery (JSFR) to realize polarization diversity with SP carrier-assisted DD schemes in Jones space. Different receiver structures and simplified recovery procedures for JSFR are explored theoretically. The proposed JSFR pushes the SP DD schemes towards PDM without extra optical signal-to-noise ratio (OSNR) penalty. In addition, the JSFR shows good tolerance to PMD since the optical field recovery is conducted before polarization recovery. In the concept-of-proof experiment, we demonstrate 448-Gb/s reception over 80-km single-mode fiber using the proposed JSFR based on 22 couplers. Furthermore, we qualitatively compare the optical field recovery in Jones space and Stokes space from the perspective of the modulation dimension. Qualitatively, we compare the optical field recovery in the Jones space and Stokes space from the perspective of the modulation dimension.

preprint2022arXiv

Quasi-uniaxial pressure induced superconductivity in stoichiometric compound UTe$_2$

The recent discovery of superconductivity in heavy Fermion compound UTe2, a candidate topological and triplet-paired superconductor, has aroused widespread interest. However, to date, there is no consensus on whether the stoichiometric sample of UTe2 is superconducting or not due to lack of reliable evidence to distinguish the difference between the nominal and real compositions of samples. Here, we are the first to clarify that the stoichiometric UT2 is non-superconducting at ambient pressure and under hydrostatic pressure up to 6 GPa, however we find that it can be compressed into superconductivity by application of quasi-uniaxial pressure. Measurements of resistivity, magnetoresistance and susceptibility reveal that the quasi-uniaxial pressure results in a suppression of the Kondo coherent state seen at ambient pressure, and then leads to a superconductivity initially emerged on the ab-plane at 1.5 GPa. At 4.8 GPa, the superconductivity is developed in three crystallographic directions. The superconducting state coexists with an exotic magnetic ordered state that develops just below the onset temperature of the superconducting transition. The discovery of the quasi-uniaxial-pressure-induced superconductivity with exotic magnetic state in the stoichiometric UTe2 not only provide new understandings on this compound, but also highlight the vital role of Te deficiency in developing the superconductivity at ambient pressures.

preprint2022arXiv

UniMiSS: Universal Medical Self-Supervised Learning via Breaking Dimensionality Barrier

Self-supervised learning (SSL) opens up huge opportunities for medical image analysis that is well known for its lack of annotations. However, aggregating massive (unlabeled) 3D medical images like computerized tomography (CT) remains challenging due to its high imaging cost and privacy restrictions. In this paper, we advocate bringing a wealth of 2D images like chest X-rays as compensation for the lack of 3D data, aiming to build a universal medical self-supervised representation learning framework, called UniMiSS. The following problem is how to break the dimensionality barrier, \ie, making it possible to perform SSL with both 2D and 3D images? To achieve this, we design a pyramid U-like medical Transformer (MiT). It is composed of the switchable patch embedding (SPE) module and Transformers. The SPE module adaptively switches to either 2D or 3D patch embedding, depending on the input dimension. The embedded patches are converted into a sequence regardless of their original dimensions. The Transformers model the long-term dependencies in a sequence-to-sequence manner, thus enabling UniMiSS to learn representations from both 2D and 3D images. With the MiT as the backbone, we perform the UniMiSS in a self-distillation manner. We conduct expensive experiments on six 3D/2D medical image analysis tasks, including segmentation and classification. The results show that the proposed UniMiSS achieves promising performance on various downstream tasks, outperforming the ImageNet pre-training and other advanced SSL counterparts substantially. Code is available at \def\UrlFont{\rm\small\ttfamily} \url{https://github.com/YtongXie/UniMiSS-code}.

preprint2022arXiv

Vision-and-Language Navigation: A Survey of Tasks, Methods, and Future Directions

A long-term goal of AI research is to build intelligent agents that can communicate with humans in natural language, perceive the environment, and perform real-world tasks. Vision-and-Language Navigation (VLN) is a fundamental and interdisciplinary research topic towards this goal, and receives increasing attention from natural language processing, computer vision, robotics, and machine learning communities. In this paper, we review contemporary studies in the emerging field of VLN, covering tasks, evaluation metrics, methods, etc. Through structured analysis of current progress and challenges, we highlight the limitations of current VLN and opportunities for future work. This paper serves as a thorough reference for the VLN research community.

preprint2021arXiv

Data-driven advice for interpreting local and global model predictions in bioinformatics problems

Tree-based algorithms such as random forests and gradient boosted trees continue to be among the most popular and powerful machine learning models used across multiple disciplines. The conventional wisdom of estimating the impact of a feature in tree based models is to measure the \textit{node-wise reduction of a loss function}, which (i) yields only global importance measures and (ii) is known to suffer from severe biases. Conditional feature contributions (CFCs) provide \textit{local}, case-by-case explanations of a prediction by following the decision path and attributing changes in the expected output of the model to each feature along the path. However, Lundberg et al. pointed out a potential bias of CFCs which depends on the distance from the root of a tree. The by now immensely popular alternative, SHapley Additive exPlanation (SHAP) values appear to mitigate this bias but are computationally much more expensive. Here we contribute a thorough comparison of the explanations computed by both methods on a set of 164 publicly available classification problems in order to provide data-driven algorithm recommendations to current researchers. For random forests, we find extremely high similarities and correlations of both local and global SHAP values and CFC scores, leading to very similar rankings and interpretations. Analogous conclusions hold for the fidelity of using global feature importance scores as a proxy for the predictive power associated with each feature.

preprint2021arXiv

How to Train Your Agent to Read and Write

Reading and writing research papers is one of the most privileged abilities that a qualified researcher should master. However, it is difficult for new researchers (\eg{students}) to fully {grasp} this ability. It would be fascinating if we could train an intelligent agent to help people read and summarize papers, and perhaps even discover and exploit the potential knowledge clues to write novel papers. Although there have been existing works focusing on summarizing (\emph{i.e.}, reading) the knowledge in a given text or generating (\emph{i.e.}, writing) a text based on the given knowledge, the ability of simultaneously reading and writing is still under development. Typically, this requires an agent to fully understand the knowledge from the given text materials and generate correct and fluent novel paragraphs, which is very challenging in practice. In this paper, we propose a Deep ReAder-Writer (DRAW) network, which consists of a \textit{Reader} that can extract knowledge graphs (KGs) from input paragraphs and discover potential knowledge, a graph-to-text \textit{Writer} that generates a novel paragraph, and a \textit{Reviewer} that reviews the generated paragraph from three different aspects. Extensive experiments show that our DRAW network outperforms considered baselines and several state-of-the-art methods on AGENDA and M-AGENDA datasets. Our code and supplementary are released at https://github.com/menggehe/DRAW.

preprint2021arXiv

Learning for Visual Navigation by Imagining the Success

Visual navigation is often cast as a reinforcement learning (RL) problem. Current methods typically result in a suboptimal policy that learns general obstacle avoidance and search behaviours. For example, in the target-object navigation setting, the policies learnt by traditional methods often fail to complete the task, even when the target is clearly within reach from a human perspective. In order to address this issue, we propose to learn to imagine a latent representation of the successful (sub-)goal state. To do so, we have developed a module which we call Foresight Imagination (ForeSIT). ForeSIT is trained to imagine the recurrent latent representation of a future state that leads to success, e.g. either a sub-goal state that is important to reach before the target, or the goal state itself. By conditioning the policy on the generated imagination during training, our agent learns how to use this imagination to achieve its goal robustly. Our agent is able to imagine what the (sub-)goal state may look like (in the latent space) and can learn to navigate towards that state. We develop an efficient learning algorithm to train ForeSIT in an on-policy manner and integrate it into our RL objective. The integration is not trivial due to the constantly evolving state representation shared between both the imagination and the policy. We, empirically, observe that our method outperforms the state-of-the-art methods by a large margin in the commonly accepted benchmark AI2THOR environment. Our method can be readily integrated or added to other model-free RL navigation frameworks.

preprint2021arXiv

Production of $Z_{cs}$ in $B$ and $B_s$ decay

In the present work, we investigate the production of $Z_{cs}^+$ in $B^+$ and $B_s^0$ decay, where $Z_{cs}^+$ is assigned as a $D_s^{+} \bar{D}^{\ast0} + D_s^{\ast +}\bar{D}^0$ molecular state. By using an effective Lagrangian approach, we evaluate the branching ratio of $B^0_s\rightarrow K^- Z^+_{cs}$ and $B^+\rightarrow ϕZ^{+}_{cs}$ via the triangle loop mechanism. The estimated branching fractions of $B^0_s\rightarrow K^- Z^+_{cs}$ and $B^+\rightarrow ϕZ^{+}_{cs}$ are an order of $10^{-4} $ and $10^{-5}$, respectively. The ratio of these two branching fraction is estimated to be about 5, which indicate that the $B_s^0 \to K^\pm Z^\mp_{cs} \to K^+ K^- J/ψ$ may be a better process of searching $Z_{cs}$ and accessible for further experimental measurement of the Belle II and LHCb collaborations.

preprint2021arXiv

Semantics for Robotic Mapping, Perception and Interaction: A Survey

For robots to navigate and interact more richly with the world around them, they will likely require a deeper understanding of the world in which they operate. In robotics and related research fields, the study of understanding is often referred to as semantics, which dictates what does the world "mean" to a robot, and is strongly tied to the question of how to represent that meaning. With humans and robots increasingly operating in the same world, the prospects of human-robot interaction also bring semantics and ontology of natural language into the picture. Driven by need, as well as by enablers like increasing availability of training data and computational resources, semantics is a rapidly growing research area in robotics. The field has received significant attention in the research literature to date, but most reviews and surveys have focused on particular aspects of the topic: the technical research issues regarding its use in specific robotic topics like mapping or segmentation, or its relevance to one particular application domain like autonomous driving. A new treatment is therefore required, and is also timely because so much relevant research has occurred since many of the key surveys were published. This survey therefore provides an overarching snapshot of where semantics in robotics stands today. We establish a taxonomy for semantics research in or relevant to robotics, split into four broad categories of activity, in which semantics are extracted, used, or both. Within these broad categories we survey dozens of major topics including fundamentals from the computer vision field and key robotics research areas utilizing semantics, including mapping, navigation and interaction with the world. The survey also covers key practical considerations, including enablers like increased data availability and improved computational hardware, and major application areas where...

preprint2021arXiv

Universal quantum transition from superconducting to insulating states in pressurized Bi2Sr2CaCu2O8+δ superconductors

Copper oxide superconductors have continually fascinated the communities of condensed matter physics and material sciences because they host the highest ambient-pressure superconducting transition temperature (Tc) and mysterious physics. Searching for the universal correlation between the superconducting state and its normal state or neighboring ground state is believed to be an effective way for finding clues to elucidate the underlying mechanism of the superconductivity. One of the common pictures for the copper oxide superconductors is that a well-behaved metallic phase will present after the superconductivity is entirely suppressed by chemical doping or application of the magnetic field. Here, we report a different observation of universal quantum transition from superconducting state to insulating-like state under pressure in the under-, optimally- and over-doped Bi2212 superconductors with two CuO2 planes in a unit cell. The same phenomenon has been also found in the Bi2201 superconductor with one CuO2 plane and the Bi2223 superconductor with three CuO2 planes in a unit cell. These results not only provide fresh information but also pose a new challenge for achieving a unified understanding on the underlying physics of the high-Tc superconductivity.

preprint2021arXiv

What causes the absence of pulsations in Central Compact Objects in Supernova Remnants?

Most young neutron stars belonging to the class of Central Compact Objects in supernova remnants (CCOs) do not have known periodicities. We investigated seven such CCOs to understand the common reasons for the absence of detected pulsations. Making use of XMM-Newton, Chandra, and NICER observations, we perform a systematic timing and spectral analysis to derive updated sensitivity limits for both periodic signals and multi-temperature spectral components that could be associated with radiation from hotspots on the neutron star surface. Based on these limits, we then investigated for each target the allowed viewing geometry that could explain the lack of pulsations. We estimate it is unlikely ($< 10^{-6}$) to attribute that we do not see pulsations to an unfavorable viewing geometry for five considered sources. Alternatively, the carbon atmosphere model, which assumes homogeneous temperature distribution on the surface, describes the spectra equally well and provides a reasonable interpretation for the absence of detected periodicities within current limits. The unusual properties of CCOs with respect to other young neutron stars could suggest a different evolutionary path, as that proposed for sources experiencing episodes of significant fallback accretion after the supernova event.

preprint2020arXiv

$D$ wave bottomonia production from $Z_b^{(\prime)}$ decay

In the present work, we investigate the dipion transitions between $Υ(5S)$ and $Υ_J(1D)$ with $J=1, 2, 3$. Our analysis indicates that the dominant sources of the anomalously large widths of $Υ(5S)\to Υ_J(1D) π^+ π^-$ should be $Z_b^{(\prime)}$, i.e., the dipion transitions occur via the cascade decays $Υ(5S)\to Z_b^{(\prime)\pm} π^\mp \to Υ_J(1D) π^+ π^-$. With the assumption that all the short ranged dynamics could be absorbed in a single cutoff with a model parameter $α$, the present estimations indicate that in a reasonable parameter range the measured branching ratios of $Υ(5S) \to Υ_J(1D) π^+ π^-$ can be reproduced in magnitude, which further proves that the decays via $Z_b^{(\prime)}$ dominate the dipion transitions of $Υ(5S)$ to $Υ_J(1D)$. Moreover, we also predict the ratios of the branching fractions of $Z_b^{(\prime)} \to Υ_J(1D) π$, which in our calculations are largely independent of the parameter $α$ and could be tested by further experiments in Belle II.

preprint2020arXiv

Attention-SLAM: A Visual Monocular SLAM Learning from Human Gaze

This paper proposes a novel simultaneous localization and mapping (SLAM) approach, namely Attention-SLAM, which simulates human navigation mode by combining a visual saliency model (SalNavNet) with traditional monocular visual SLAM. Most SLAM methods treat all the features extracted from the images as equal importance during the optimization process. However, the salient feature points in scenes have more significant influence during the human navigation process. Therefore, we first propose a visual saliency model called SalVavNet in which we introduce a correlation module and propose an adaptive Exponential Moving Average (EMA) module. These modules mitigate the center bias to enable the saliency maps generated by SalNavNet to pay more attention to the same salient object. Moreover, the saliency maps simulate the human behavior for the refinement of SLAM results. The feature points extracted from the salient regions have greater importance in optimization process. We add semantic saliency information to the Euroc dataset to generate an open-source saliency SLAM dataset. Comprehensive test results prove that Attention-SLAM outperforms benchmarks such as Direct Sparse Odometry (DSO), ORB-SLAM, and Salient DSO in terms of efficiency, accuracy, and robustness in most test cases.

preprint2020arXiv

Cops-Ref: A new Dataset and Task on Compositional Referring Expression Comprehension

Referring expression comprehension (REF) aims at identifying a particular object in a scene by a natural language expression. It requires joint reasoning over the textual and visual domains to solve the problem. Some popular referring expression datasets, however, fail to provide an ideal test bed for evaluating the reasoning ability of the models, mainly because 1) their expressions typically describe only some simple distinctive properties of the object and 2) their images contain limited distracting information. To bridge the gap, we propose a new dataset for visual reasoning in context of referring expression comprehension with two main features. First, we design a novel expression engine rendering various reasoning logics that can be flexibly combined with rich visual properties to generate expressions with varying compositionality. Second, to better exploit the full reasoning chain embodied in an expression, we propose a new test setting by adding additional distracting images containing objects sharing similar properties with the referent, thus minimising the success rate of reasoning-free cross-domain alignment. We evaluate several state-of-the-art REF models, but find none of them can achieve promising performance. A proposed modular hard mining strategy performs the best but still leaves substantial room for improvement. We hope this new dataset and task can serve as a benchmark for deeper visual reasoning analysis and foster the research on referring expression comprehension.

preprint2020arXiv

Correlation between Fermi surface reconstruction and superconductivity in pressurized FeTe0.55Se0.45

Here we report the first results of the high-pressure Hall coefficient (RH) measurements, combined with the high-pressure resistance measurements, at different temperatures on the putative topological superconductor FeTe0.55Se0.45. We find the intimate correlation of sign change of RH, a fingerprint to manifest the reconstruction of Fermi surface, with structural phase transition and superconductivity. Below the critical pressure (PC) of 2.7 GPa, our data reveal that the hole - electron carriers are thermally balanced (RH=0) at a critical temperature (T*), where RH changes its sign from positive to negative, and concurrently a tetragonal-orthorhombic phase transition takes place. Within the pressure range from 1bar to PC, T* is continuously suppressed by pressure, while TC increases monotonically. At about PC, T* is indistinguishable and TC reaches a maximum value. Moreover, a pressure-induced sign change of RH is found at ~PC where the orthorhombic-monoclinic phase transition occurs. With further compression, TC decreases and disappears at ~ 12 GPa. The correlation among the electron-hole balance, crystal structure and superconductivity found in the pressurized FeTe0.55Se0.45 implies that its nontrivial superconductivity is closely associated with its exotic normal state resulted from the interplay between the reconstruction of the Fermi surface and the change of the structural lattice.

preprint2020arXiv

DAM: Deliberation, Abandon and Memory Networks for Generating Detailed and Non-repetitive Responses in Visual Dialogue

Visual Dialogue task requires an agent to be engaged in a conversation with human about an image. The ability of generating detailed and non-repetitive responses is crucial for the agent to achieve human-like conversation. In this paper, we propose a novel generative decoding architecture to generate high-quality responses, which moves away from decoding the whole encoded semantics towards the design that advocates both transparency and flexibility. In this architecture, word generation is decomposed into a series of attention-based information selection steps, performed by the novel recurrent Deliberation, Abandon and Memory (DAM) module. Each DAM module performs an adaptive combination of the response-level semantics captured from the encoder and the word-level semantics specifically selected for generating each word. Therefore, the responses contain more detailed and non-repetitive descriptions while maintaining the semantic accuracy. Furthermore, DAM is flexible to cooperate with existing visual dialogue encoders and adaptive to the encoder structures by constraining the information selection mode in DAM. We apply DAM to three typical encoders and verify the performance on the VisDial v1.0 dataset. Experimental results show that the proposed models achieve new state-of-the-art performance with high-quality responses. The code is available at https://github.com/JXZe/DAM.

preprint2020arXiv

Data-driven Meta-set Based Fine-Grained Visual Classification

Constructing fine-grained image datasets typically requires domain-specific expert knowledge, which is not always available for crowd-sourcing platform annotators. Accordingly, learning directly from web images becomes an alternative method for fine-grained visual recognition. However, label noise in the web training set can severely degrade the model performance. To this end, we propose a data-driven meta-set based approach to deal with noisy web images for fine-grained recognition. Specifically, guided by a small amount of clean meta-set, we train a selection net in a meta-learning manner to distinguish in- and out-of-distribution noisy images. To further boost the robustness of model, we also learn a labeling net to correct the labels of in-distribution noisy data. In this way, our proposed method can alleviate the harmful effects caused by out-of-distribution noise and properly exploit the in-distribution noisy samples for training. Extensive experiments on three commonly used fine-grained datasets demonstrate that our approach is much superior to state-of-the-art noise-robust methods.

preprint2020arXiv

Evasion of HSR in the charmless decays of excited $P$-wave charmonia

We investigate the charmless decays of excited $P$-wave charmonia $χ_{c1}^\prime \to VV$ and $χ_{c2}^\prime \to VP$ via intermediate charmed meson loops, where $V$ and $P$ denote the light vector and pseudoscalar mesons, respectively. Within the model parameters, the charmed meson loop contributions are evaluated by using the effective Lagrangian approach. For $χ_{c1}^\prime \to VV$, the partial widths of the $ρρ$, $ωω$, and $K^*{\bar K}^*$ channels can reach to the order of MeV, while the partial width of the $ϕϕ$ channel is very small and in the order of keV. For $χ_{c2}^\prime \to V P$, the partial widths of $χ_{c2}^{\prime} \to K^\ast \bar{K}+c.c$ turns out to be sizeable, while the partial widths of $χ_{c2}^{\prime} \to ρ^+π^- +c.c$ is found to be much smaller than the $K^\ast \bar{K}+c.c$ channel. Our calculations may be examined by the future BESIII experiments.

preprint2020arXiv

Fine-grained Video-Text Retrieval with Hierarchical Graph Reasoning

Cross-modal retrieval between videos and texts has attracted growing attentions due to the rapid emergence of videos on the web. The current dominant approach for this problem is to learn a joint embedding space to measure cross-modal similarities. However, simple joint embeddings are insufficient to represent complicated visual and textual details, such as scenes, objects, actions and their compositions. To improve fine-grained video-text retrieval, we propose a Hierarchical Graph Reasoning (HGR) model, which decomposes video-text matching into global-to-local levels. To be specific, the model disentangles texts into hierarchical semantic graph including three levels of events, actions, entities and relationships across levels. Attention-based graph reasoning is utilized to generate hierarchical textual embeddings, which can guide the learning of diverse and hierarchical video representations. The HGR model aggregates matchings from different video-text levels to capture both global and local details. Experimental results on three video-text datasets demonstrate the advantages of our model. Such hierarchical decomposition also enables better generalization across datasets and improves the ability to distinguish fine-grained semantic differences.

preprint2020arXiv

Foreground-Background Imbalance Problem in Deep Object Detectors: A Review

Recent years have witnessed the remarkable developments made by deep learning techniques for object detection, a fundamentally challenging problem of computer vision. Nevertheless, there are still difficulties in training accurate deep object detectors, one of which is owing to the foreground-background imbalance problem. In this paper, we survey the recent advances about the solutions to the imbalance problem. First, we analyze the characteristics of the imbalance problem in different kinds of deep detectors, including one-stage and two-stage ones. Second, we divide the existing solutions into two categories: sampling heuristics and non-sampling schemes, and review them in detail. Third, we experimentally compare the performance of some state-of-the-art solutions on the COCO benchmark. Promising directions for future work are also discussed.

preprint2020arXiv

Give Me Something to Eat: Referring Expression Comprehension with Commonsense Knowledge

Conventional referring expression comprehension (REF) assumes people to query something from an image by describing its visual appearance and spatial location, but in practice, we often ask for an object by describing its affordance or other non-visual attributes, especially when we do not have a precise target. For example, sometimes we say &#39;Give me something to eat&#39;. In this case, we need to use commonsense knowledge to identify the objects in the image. Unfortunately, these is no existing referring expression dataset reflecting this requirement, not to mention a model to tackle this challenge. In this paper, we collect a new referring expression dataset, called KB-Ref, containing 43k expressions on 16k images. In KB-Ref, to answer each expression (detect the target object referred by the expression), at least one piece of commonsense knowledge must be required. We then test state-of-the-art (SoTA) REF models on KB-Ref, finding that all of them present a large drop compared to their outstanding performance on general REF datasets. We also present an expression conditioned image and fact attention (ECIFA) network that extract information from correlated image regions and commonsense knowledge facts. Our method leads to a significant improvement over SoTA REF models, although there is still a gap between this strong baseline and human performance. The dataset and baseline models will be released.

preprint2020arXiv

Gold Seeker: Information Gain from Policy Distributions for Goal-oriented Vision-and-Langauge Reasoning

As Computer Vision moves from a passive analysis of pixels to active analysis of semantics, the breadth of information algorithms need to reason over has expanded significantly. One of the key challenges in this vein is the ability to identify the information required to make a decision, and select an action that will recover it. We propose a reinforcement-learning approach that maintains a distribution over its internal information, thus explicitly representing the ambiguity in what it knows, and needs to know, towards achieving its goal. Potential actions are then generated according to this distribution. For each potential action a distribution of the expected outcomes is calculated, and the value of the potential information gain assessed. The action taken is that which maximizes the potential information gain. We demonstrate this approach applied to two vision-and-language problems that have attracted significant recent interest, visual dialog and visual query generation. In both cases, the method actively selects actions that will best reduce its internal uncertainty and outperforms its competitors in achieving the goal of the challenge.

preprint2020arXiv

Intelligent Home 3D: Automatic 3D-House Design from Linguistic Descriptions Only

Home design is a complex task that normally requires architects to finish with their professional skills and tools. It will be fascinating that if one can produce a house plan intuitively without knowing much knowledge about home design and experience of using complex designing tools, for example, via natural language. In this paper, we formulate it as a language conditioned visual content generation problem that is further divided into a floor plan generation and an interior texture (such as floor and wall) synthesis task. The only control signal of the generation process is the linguistic expression given by users that describe the house details. To this end, we propose a House Plan Generative Model (HPGM) that first translates the language input to a structural graph representation and then predicts the layout of rooms with a Graph Conditioned Layout Prediction Network (GC LPN) and generates the interior texture with a Language Conditioned Texture GAN (LCT-GAN). With some post-processing, the final product of this task is a 3D house model. To train and evaluate our model, we build the first Text-to-3D House Model dataset.

preprint2020arXiv

Length-Controllable Image Captioning

The last decade has witnessed remarkable progress in the image captioning task; however, most existing methods cannot control their captions, \emph{e.g.}, choosing to describe the image either roughly or in detail. In this paper, we propose to use a simple length level embedding to endow them with this ability. Moreover, due to their autoregressive nature, the computational complexity of existing models increases linearly as the length of the generated captions grows. Thus, we further devise a non-autoregressive image captioning approach that can generate captions in a length-irrelevant complexity. We verify the merit of the proposed length level embedding on three models: two state-of-the-art (SOTA) autoregressive models with different types of decoder, as well as our proposed non-autoregressive model, to show its generalization ability. In the experiments, our length-controllable image captioning models not only achieve SOTA performance on the challenging MS COCO dataset but also generate length-controllable and diverse image captions. Specifically, our non-autoregressive model outperforms the autoregressive baselines in terms of controllability and diversity, and also significantly improves the decoding efficiency for long captions. Our code and models are released at \textcolor{magenta}{\texttt{https://github.com/bearcatt/LaBERT}}.

preprint2020arXiv

MeisterMorxrc at SemEval-2020 Task 9: Fine-Tune Bert and Multitask Learning for Sentiment Analysis of Code-Mixed Tweets

Natural language processing (NLP) has been applied to various fields including text classification and sentiment analysis. In the shared task of sentiment analysis of code-mixed tweets, which is a part of the SemEval-2020 competition~\cite{patwa2020sentimix}, we preprocess datasets by replacing emoji and deleting uncommon characters and so on, and then fine-tune the Bidirectional Encoder Representation from Transformers(BERT) to perform the best. After exhausting top3 submissions, Our team MeisterMorxrc achieves an averaged F1 score of 0.730 in this task, and and our codalab username is MeisterMorxrc.

preprint2020arXiv

Memory-Gated Recurrent Networks

The essence of multivariate sequential learning is all about how to extract dependencies in data. These data sets, such as hourly medical records in intensive care units and multi-frequency phonetic time series, often time exhibit not only strong serial dependencies in the individual components (the &#34;marginal&#34; memory) but also non-negligible memories in the cross-sectional dependencies (the &#34;joint&#34; memory). Because of the multivariate complexity in the evolution of the joint distribution that underlies the data generating process, we take a data-driven approach and construct a novel recurrent network architecture, termed Memory-Gated Recurrent Networks (mGRN), with gates explicitly regulating two distinct types of memories: the marginal memory and the joint memory. Through a combination of comprehensive simulation studies and empirical experiments on a range of public datasets, we show that our proposed mGRN architecture consistently outperforms state-of-the-art architectures targeting multivariate time series.

preprint2020arXiv

Object-and-Action Aware Model for Visual Language Navigation

Vision-and-Language Navigation (VLN) is unique in that it requires turning relatively general natural-language instructions into robot agent actions, on the basis of the visible environment. This requires to extract value from two very different types of natural-language information. The first is object description (e.g., &#39;table&#39;, &#39;door&#39;), each presenting as a tip for the agent to determine the next action by finding the item visible in the environment, and the second is action specification (e.g., &#39;go straight&#39;, &#39;turn left&#39;) which allows the robot to directly predict the next movements without relying on visual perceptions. However, most existing methods pay few attention to distinguish these information from each other during instruction encoding and mix together the matching between textual object/action encoding and visual perception/orientation features of candidate viewpoints. In this paper, we propose an Object-and-Action Aware Model (OAAM) that processes these two different forms of natural language based instruction separately. This enables each process to match object-centered/action-centered instruction to their own counterpart visual perception/action orientation flexibly. However, one side-issue caused by above solution is that an object mentioned in instructions may be observed in the direction of two or more candidate viewpoints, thus the OAAM may not predict the viewpoint on the shortest path as the next action. To handle this problem, we design a simple but effective path loss to penalize trajectories deviating from the ground truth path. Experimental results demonstrate the effectiveness of the proposed model and path loss, and the superiority of their combination with a 50% SPL score on the R2R dataset and a 40% CLS score on the R4R dataset in unseen environments, outperforming the previous state-of-the-art.

preprint2020arXiv

Production of $P-$wave charmed and charmed-strange mesons in pion and kaon induced reactions

In the present work, we investigate the production of $P-$wave charmed or charmed-strange mesons in the pion or kaon induced reactions on a proton target. The total cross sections as well as the differential cross sections depending on the scattering angle are evaluated in an effective Lagrangian approach. Our estimations indicate that magnitude of the cross sections strongly depends on the model parameter but such dependence can be almost completely canceled for the cross section ratios. These model independent ratios can be taken as a good criterion of the validity of heavy quark limit in the charmed region, which is helpful to understand $P$-wave charmed and charmed-strange mesons.

preprint2020arXiv

Quantum phases of SrCu2(BO3)2 from high-pressure thermodynamics

We report heat capacity measurements of SrCu$_2$(BO$_3$)$_2$ under high pressure along with simulations of relevant quantum spin models and map out the $(P,T)$ phase diagram of the material. We find a first-order quantum phase transition between the low-pressure quantum dimer paramagnet and a phase with signatures of a plaquette-singlet state below T = $2$ K. At higher pressures, we observe a transition into a previously unknown antiferromagnetic state below $4$ K. Our findings can be explained within the two-dimensional Shastry-Sutherland quantum spin model supplemented by weak inter-layer couplings. The possibility to tune SrCu$_2$(BO$_3$)$_2$ between the plaquette-singlet and antiferromagnetic states opens opportunities for experimental tests of quantum field theories and lattice models involving fractionalized excitations, emergent symmetries, and gauge fluctuations.

preprint2020arXiv

Reemergence of superconductivity in pressurized quasi-one-dimensional superconductor K2Mo3As3

Here we report a pressure-induced reemergence of superconductivity in recently discovered superconductor K2Mo3As3, which is the first experimental case observed in quasi-one-dimensional superconductors. We find that, after full suppression of the ambient-pressure superconducting (SC-I) state at 8.7 GPa, an intermediary non-superconducting state sets in and prevails to the pressure up to 18.2 GPa, however, above this pressure a new superconducting (SC-II) state appears unexpectedly. High pressure x-ray diffraction measurements demonstrate that the pressure-induced dramatic change of the lattice parameter c contributes mainly to the emergence of the SC-II state. Combined with the theioretical calculations on band strcture, our results suggest that the reemergemce of superconductivity is associated with the change of the complicated interplay among different orbital electrons, driven by the pressure-induced unisotropic change of the lattice.

preprint2020arXiv

REVERIE: Remote Embodied Visual Referring Expression in Real Indoor Environments

One of the long-term challenges of robotics is to enable robots to interact with humans in the visual world via natural language, as humans are visual animals that communicate through language. Overcoming this challenge requires the ability to perform a wide variety of complex tasks in response to multifarious instructions from humans. In the hope that it might drive progress towards more flexible and powerful human interactions with robots, we propose a dataset of varied and complex robot tasks, described in natural language, in terms of objects visible in a large set of real images. Given an instruction, success requires navigating through a previously-unseen environment to identify an object. This represents a practical challenge, but one that closely reflects one of the core visual problems in robotics. Several state-of-the-art vision-and-language navigation, and referring-expression models are tested to verify the difficulty of this new task, but none of them show promising results because there are many fundamental differences between our task and previous ones. A novel Interactive Navigator-Pointer model is also proposed that provides a strong baseline on the task. The proposed model especially achieves the best performance on the unseen test split, but still leaves substantial room for improvement compared to the human performance.

preprint2020arXiv

Say As You Wish: Fine-grained Control of Image Caption Generation with Abstract Scene Graphs

Humans are able to describe image contents with coarse to fine details as they wish. However, most image captioning models are intention-agnostic which can not generate diverse descriptions according to different user intentions initiatively. In this work, we propose the Abstract Scene Graph (ASG) structure to represent user intention in fine-grained level and control what and how detailed the generated description should be. The ASG is a directed graph consisting of three types of \textbf{abstract nodes} (object, attribute, relationship) grounded in the image without any concrete semantic labels. Thus it is easy to obtain either manually or automatically. From the ASG, we propose a novel ASG2Caption model, which is able to recognise user intentions and semantics in the graph, and therefore generate desired captions according to the graph structure. Our model achieves better controllability conditioning on ASGs than carefully designed baselines on both VisualGenome and MSCOCO datasets. It also significantly improves the caption diversity via automatically sampling diverse ASGs as control signals.

preprint2020arXiv

Semantic Equivalent Adversarial Data Augmentation for Visual Question Answering

Visual Question Answering (VQA) has achieved great success thanks to the fast development of deep neural networks (DNN). On the other hand, the data augmentation, as one of the major tricks for DNN, has been widely used in many computer vision tasks. However, there are few works studying the data augmentation problem for VQA and none of the existing image based augmentation schemes (such as rotation and flipping) can be directly applied to VQA due to its semantic structure -- an $\langle image, question, answer\rangle$ triplet needs to be maintained correctly. For example, a direction related Question-Answer (QA) pair may not be true if the associated image is rotated or flipped. In this paper, instead of directly manipulating images and questions, we use generated adversarial examples for both images and questions as the augmented data. The augmented examples do not change the visual properties presented in the image as well as the \textbf{semantic} meaning of the question, the correctness of the $\langle image, question, answer\rangle$ is thus still maintained. We then use adversarial learning to train a classic VQA model (BUTD) with our augmented data. We find that we not only improve the overall performance on VQAv2, but also can withstand adversarial attack effectively, compared to the baseline model. The source code is available at https://github.com/zaynmi/seada-vqa.

preprint2020arXiv

Soft Expert Reward Learning for Vision-and-Language Navigation

Vision-and-Language Navigation (VLN) requires an agent to find a specified spot in an unseen environment by following natural language instructions. Dominant methods based on supervised learning clone expert&#39;s behaviours and thus perform better on seen environments, while showing restricted performance on unseen ones. Reinforcement Learning (RL) based models show better generalisation ability but have issues as well, requiring large amount of manual reward engineering is one of which. In this paper, we introduce a Soft Expert Reward Learning (SERL) model to overcome the reward engineering designing and generalisation problems of the VLN task. Our proposed method consists of two complementary components: Soft Expert Distillation (SED) module encourages agents to behave like an expert as much as possible, but in a soft fashion; Self Perceiving (SP) module targets at pushing the agent towards the final destination as fast as possible. Empirically, we evaluate our model on the VLN seen, unseen and test splits and the model outperforms the state-of-the-art methods on most of the evaluation metrics.

preprint2020arXiv

Understanding Distributional Ambiguity via Non-robust Chance Constraint

This paper provides a non-robust interpretation of the distributionally robust optimization (DRO) problem by relating the distributional uncertainties to the chance probabilities. Our analysis allows a decision-maker to interpret the size of the ambiguity set, which is often lack of business meaning, through the chance parameters constraining the objective function. We first show that, for general $ϕ$-divergences, a DRO problem is asymptotically equivalent to a class of mean-deviation problems. These mean-deviation problems are not subject to uncertain distributions, and the ambiguity radius in the original DRO problem now plays the role of controlling the risk preference of the decision-maker. We then demonstrate that a DRO problem can be cast as a chance-constrained optimization (CCO) problem when a boundedness constraint is added to the decision variables. Without the boundedness constraint, the CCO problem is shown to perform uniformly better than the DRO problem, irrespective of the radius of the ambiguity set, the choice of the divergence measure, or the tail heaviness of the center distribution. Thanks to our high-order expansion result, a notable feature of our analysis is that it applies to divergence measures that accommodate well heavy tail distributions such as the student $t$-distribution and the lognormal distribution, besides the widely-used Kullback-Leibler (KL) divergence, which requires the distribution of the objective function to be exponentially bounded. Using the portfolio selection problem as an example, our comprehensive testings on multivariate heavy-tail datasets, both synthetic and real-world, shows that this business-interpretation approach is indeed useful and insightful.

preprint2019arXiv

Cross-sectional Learning of Extremal Dependence among Financial Assets

We propose a novel probabilistic model to facilitate the learning of multivariate tail dependence of multiple financial assets. Our method allows one to construct from known random vectors, e.g., standard normal, sophisticated joint heavy-tailed random vectors featuring not only distinct marginal tail heaviness, but also flexible tail dependence structure. The novelty lies in that pairwise tail dependence between any two dimensions is modeled separately from their correlation, and can vary respectively according to its own parameter rather than the correlation parameter, which is an essential advantage over many commonly used methods such as multivariate $t$ or elliptical distribution. It is also intuitive to interpret, easy to track, and simple to sample comparing to the copula approach. We show its flexible tail dependence structure through simulation. Coupled with a GARCH model to eliminate serial dependence of each individual asset return series, we use this novel method to model and forecast multivariate conditional distribution of stock returns, and obtain notable performance improvements in multi-dimensional coverage tests. Besides, our empirical finding about the asymmetry of tails of the idiosyncratic component as well as the market component is interesting and worth to be well studied in the future.

preprint2019arXiv

Hall coefficient diagnostics of surface state in pressurized SmB6

In this study, we report the first results of the high-pressure Hall coefficient (RH) measurements in the putative topological Kondo insulator SmB6 up to 37 GPa. Below 10 GPa, our data reveal that RH(T) exhibits a prominent peak upon cooling below 20 K. Remarkably, the temperature at which surface conduction dominates coincides with the temperature of the peak in RH(T). The temperature dependent resistance and Hall coefficient can be well fitted by a two-channel model with contributions from the metallic surface and the thermally activated bulk states. When the bulk of SmB6 becomes metallic and magnetic at ~ 10 GPa, both the RH(T) peak and the resistance plateau disappear simultaneously. Our results indicate that the RH(T) peak is a fingerprint to diagnose the presence of a metallic surface state in SmB6. The high-pressure magnetic state of SmB6 is robust to 180 GPa, and no evidence of superconductivity is observed in the metallic phase.