Trust snapshot

Quick read

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

83 published item(s)

preprint2026arXiv

A Breast Vision Pathology Foundation Model for Real-world Clinical Utility

Pathology foundation models have shown strong retrospective performance, but whether such systems can support clinically relevant use remains unclear. This challenge is particularly important in breast cancer, where pathological assessment serves as the gold standard for diagnosis and guides treatment planning, surgical decision-making and risk stratification across pre-, intra- and post-operative stages. Here we present \textbf{BRAVE}, a breast-adaptive pathology foundation model developed and evaluated using a total resource of 101,638 breast whole-slide images from 32 sources across Asia, Europe and North America. We assessed BRAVE across 34 tasks in 82 cohorts spanning pre-operative biopsy, intra-operative frozen section and post-operative resection, using an evidence chain comprising retrospective benchmarking, clinically challenging scenarios, workflow-oriented clinical impact simulations, prospective observational validation with the thresholds locked in the retrospective cohorts and crossover pathologist-AI interaction studies. Across these settings, BRAVE supported practical roles in the clinical workflow, including safe exclusion of low-risk cases from routine review, AI-assisted second-review rescue of initially missed positives and prioritization of cases for further assessment. In prospective validation across three centres, BRAVE excluded 76.9% of negative biopsy cases (NPV 0.953) and 70.1% of negative frozen-section cases (NPV 0.973), and triaged 78.8% of post-operative subtyping cases as high-confidence clear-cut cases (NPV 1.000). In reader studies, AI assistance improved balanced accuracy from 88.5% to 95.1% (OR 3.14, P<0.001), with better efficiency, confidence and inter-rater agreement. BRAVE-derived scores also independently predicted disease-free survival (adjusted HR 4.79, P<0.001) and overall survival (adjusted HR 8.14, P<0.001).

preprint2026arXiv

Empowering Heterogeneous Graph Foundation Models via Decoupled Relation Alignment

While Graph Foundation Models (GFMs) have achieved remarkable success in homogeneous graphs, extending them to multi-domain heterogeneous graphs (MDHGs) remains a formidable challenge due to cross-type feature shifts and intra-domain relation gaps. Existing global feature alignment methods (PCA or SVD) enforce a shared feature space blindly, which distorts type-specific semantics and disrupts original topologies, inevitably leading to "Type Collapse" and "Relation Confusion". To address these fundamental limitations, we propose Decoupled relation Subspace Alignment (DRSA), a novel, plug-and-play relation-driven alignment framework. DRSA fundamentally shifts the paradigm by decoupling feature semantics from relation structures. Specifically, it introduces a dual-relation subspace projection mechanism to coordinate cross-type interactions within a shared low-rank relation subspace explicitly. Furthermore, a feature-structure decoupled representation is designed to decompose aligned features into a semantic projection component and a structural residual term, adaptively absorbing intra-domain variations. Optimized via a stable alternating minimization strategy based on Block Coordinate Descent, DRSA constructs a well-calibrated, structure-aware latent space. Extensive experiments on multiple real-world benchmark datasets demonstrate that DRSA can be seamlessly integrated as a universal preprocessing module, significantly and consistently enhancing the cross-domain and few-shot knowledge transfer capabilities of state-of-the-art GFMs. The code is available at: https://github.com/zhengziyu77/DSRA.

preprint2024arXiv

A Tutorial on Extremely Large-Scale MIMO for 6G: Fundamentals, Signal Processing, and Applications

Extremely large-scale multiple-input-multiple-output (XL-MIMO), which offers vast spatial degrees of freedom, has emerged as a potentially pivotal enabling technology for the sixth generation (6G) of wireless mobile networks. With its growing significance, both opportunities and challenges are concurrently manifesting. This paper presents a comprehensive survey of research on XL-MIMO wireless systems. In particular, we introduce four XL-MIMO hardware architectures: uniform linear array (ULA)-based XL-MIMO, uniform planar array (UPA)-based XL-MIMO utilizing either patch antennas or point antennas, and continuous aperture (CAP)-based XL-MIMO. We comprehensively analyze and discuss their characteristics and interrelationships. Following this, we introduce several electromagnetic characteristics and general distance boundaries in XL-MIMO. Given the distinct electromagnetic properties of near-field communications, we present a range of channel models to demonstrate the benefits of XL-MIMO. We further discuss and summarize signal processing schemes for XL-MIMO. It is worth noting that the low-complexity signal processing schemes and deep learning empowered signal processing schemes are reviewed and highlighted to promote the practical implementation of XL-MIMO. Furthermore, we explore the interplay between XL-MIMO and other emergent 6G technologies. Finally, we outline several compelling research directions for future XL-MIMO wireless communication systems.

preprint2023arXiv

Uplink Precoding Design for Cell-Free Massive MIMO with Iteratively Weighted MMSE

In this paper, we investigate a cell-free massive multiple-input multiple-output system with both access points and user equipments equipped with multiple antennas over the Weichselberger Rayleigh fading channel. We study the uplink spectral efficiency (SE) for the fully centralized processing scheme and large-scale fading decoding (LSFD) scheme. To further improve the SE performance, we design the uplink precoding schemes based on the weighted sum SE maximization. Since the weighted sum SE maximization problem is not jointly over all optimization variables, two efficient uplink precoding schemes based on Iteratively Weighted sum-Minimum Mean Square Error (I-WMMSE) algorithms, which rely on the iterative minimization of weighted MSE, are proposed for two processing schemes investigated. Furthermore, with maximum ratio combining applied in the LSFD scheme, we derive novel closed-form achievable SE expressions and optimal precoding schemes. Numerical results validate the proposed results and show that the I-WMMSE precoding schemes can achieve excellent sum SE performance with a large number of UE antennas.

preprint2023arXiv

Wasserstein convergence rates in the invariance principle for deterministic dynamical systems

In this paper, we consider the convergence rate with respect to Wasserstein distance in the invariance principle for deterministic nonuniformly hyperbolic systems, where both discrete time systems and flows are included. Our results apply to uniformly hyperbolic systems and large classes of nonuniformly hyperbolic systems including intermittent maps, Viana maps, finite horizon planar periodic Lorentz gases and others. Furthermore, as a nontrivial application to homogenization problem, we investigate the $\mathcal{W}_2$-convergence rate of a fast-slow discrete deterministic system to a stochastic differential equation.

preprint2022arXiv

A Competitive Method for Dog Nose-print Re-identification

Vision-based pattern identification (such as face, fingerprint, iris etc.) has been successfully applied in human biometrics for a long history. However, dog nose-print authentication is a challenging problem since the lack of a large amount of labeled data. For that, this paper presents our proposed methods for dog nose-print authentication (Re-ID) task in CVPR 2022 pet biometric challenge. First, considering the problem that each class only with few samples in the training set, we propose an automatic offline data augmentation strategy. Then, for the difference in sample styles between the training and test datasets, we employ joint cross-entropy, triplet and pair-wise circle losses function for network optimization. Finally, with multiple models ensembled adopted, our methods achieve 86.67\% AUC on the test set. Codes are available at https://github.com/muzishen/Pet-ReID-IMAG.

preprint2022arXiv

Accelerating Real-Time Coupled Cluster Methods with Single-Precision Arithmetic and Adaptive Numerical Integration

We explore the framework of a real-time coupled cluster method with a focus on improving its computational efficiency. Propagation of the wave function via the time-dependent Schrödinger equation places high demands on computing resources, particularly for high level theories such as coupled cluster with polynomial scaling. Similar to earlier investigations of coupled cluster properties, we demonstrate that the use of single-precision arithmetic reduces both the storage and multiplicative costs of the real-time simulation by approximately a factor of two with no significant impact on the resulting UV/vis absorption spectrum computed via the Fourier transform of the time-dependent dipole moment. Additional speedups of up to a factor of 14 in test simulations of water clusters are obtained via a straightforward GPU-based implementation as compared to conventional CPU calculations. We also find that further performance optimization is accessible through sagacious selection of numerical integration algorithms, and the adaptive methods, such as the Cash-Karp integrator provide an effective balance between computing costs and numerical stability. Finally, we demonstrate that a simple mixed-step integrator based on the conventional fourth-order Runge-Kutta approach is capable of stable propagations even for strong external fields, provided the time step is appropriately adapted to the duration of the laser pulse with only minimal computational overhead.

preprint2022arXiv

AMinerGNN: Heterogeneous Graph Neural Network for Paper Click-through Rate Prediction with Fusion Query

Paper recommendation with user-generated keyword is to suggest papers that simultaneously meet user&#39;s interests and are relevant to the input keyword. This is a recommendation task with two queries, a.k.a. user ID and keyword. However, existing methods focus on recommendation according to one query, a.k.a. user ID, and are not applicable to solving this problem. In this paper, we propose a novel click-through rate (CTR) prediction model with heterogeneous graph neural network, called AMinerGNN, to recommend papers with two queries. Specifically, AMinerGNN constructs a heterogeneous graph to project user, paper, and keyword into the same embedding space by graph representation learning. To process two queries, a novel query attentive fusion layer is designed to recognize their importances dynamically and then fuse them as one query to build a unified and end-to-end recommender system. Experimental results on our proposed dataset and online A/B tests prove the superiority of AMinerGNN.

preprint2022arXiv

Band Gap Opening in Bilayer Graphene-CrCl$_3$/CrBr$_3$/CrI$_3$ van der Waals Interfaces

We report experimental investigations of transport through bilayer graphene (BLG)/chromium trihalide (CrX$_3$; X=Cl, Br, I) van der Waals interfaces. In all cases, a large charge transfer from BLG to CrX$_3$ takes place (reaching densities in excess of $10^{13}$ cm$^{-2}$), and generates an electric field perpendicular to the interface that opens a band gap in BLG. We determine the gap from the activation energy of the conductivity and find excellent agreement with the latest theory accounting for the contribution of the $σ$ bands to the BLG dielectric susceptibility. We further show that for BLG/CrCl$_3$ and BLG/CrBr$_3$ the band gap can be extracted from the gate voltage dependence of the low-temperature conductivity, and use this finding to refine the gap dependence on the magnetic field. Our results allow a quantitative comparison of the electronic properties of BLG with theoretical predictions and indicate that electrons occupying the CrX$_3$ conduction band are correlated.

preprint2022arXiv

Beyond Data Samples: Aligning Differential Networks Estimation with Scientific Knowledge

Learning the differential statistical dependency network between two contexts is essential for many real-life applications, mostly in the high dimensional low sample regime. In this paper, we propose a novel differential network estimator that allows integrating various sources of knowledge beyond data samples. The proposed estimator is scalable to a large number of variables and achieves a sharp asymptotic convergence rate. Empirical experiments on extensive simulated data and four real-world applications (one on neuroimaging and three from functional genomics) show that our approach achieves improved differential network estimation and provides better supports to downstream tasks like classification. Our results highlight significant benefits of integrating group, spatial and anatomic knowledge during differential genetic network identification and brain connectome change discovery.

preprint2022arXiv

Ellipticity control of terahertz high-harmonic generation in a Dirac semimetal

We report on terahertz high-harmonic generation in a Dirac semimetal as a function of the driving-pulse ellipticity and on a theoretical study of the field-driven intraband kinetics of massless Dirac fermions.Very efficient control of third-harmonic yield and polarization state is achieved in electron-doped Cd$_3$As$_2$ thin films at room temperature. The observed tunability is understood as resulting from terahertz-field driven intraband kinetics of the Dirac fermions. Our study paves the way for exploiting nonlinear optical properties of Dirac matter for applications in signal processing and optical communications.

preprint2022arXiv

FFConv: Fast Factorized Convolutional Neural Network Inference on Encrypted Data

Homomorphic Encryption (HE), allowing computations on encrypted data (ciphertext) without decrypting it first, enables secure but prohibitively slow Convolutional Neural Network (CNN) inference for privacy-preserving applications in clouds. To reduce the inference latency, one approach is to pack multiple messages into a single ciphertext in order to reduce the number of ciphertexts and support massive parallelism of Homomorphic Multiply-Accumulate (HMA) operations between ciphertexts. Despite the faster HECNN inference, the mainstream packing schemes Dense Packing (DensePack) and Convolution Packing (ConvPack) introduce expensive rotation overhead, which prolongs the inference latency of HECNN for deeper and wider CNN architectures. In this paper, we propose a low-rank factorization method named FFConv dedicated to efficient ciphertext packing for reducing both the rotation overhead and HMA operations. FFConv approximates a d x d convolution layer with low-rank factorized convolutions, in which a d x d low-rank convolution with fewer channels is followed by a 1 x 1 convolution to restore the channels. The d x d low-rank convolution with DensePack leads to significantly reduced rotation operations, while the rotation overhead of 1 x 1 convolution with ConvPack is close to zero. To our knowledge, FFConv is the first work that is capable of reducing the rotation overhead incurred by DensePack and ConvPack simultaneously, without introducing additional special blocks into the HECNN inference pipeline. Compared to prior art LoLa and Falcon, our method reduces the inference latency by up to 88% and 21%, respectively, with comparable accuracy on MNIST and CIFAR-10.

preprint2022arXiv

FuncFooler: A Practical Black-box Attack Against Learning-based Binary Code Similarity Detection Methods

The binary code similarity detection (BCSD) method measures the similarity of two binary executable codes. Recently, the learning-based BCSD methods have achieved great success, outperforming traditional BCSD in detection accuracy and efficiency. However, the existing studies are rather sparse on the adversarial vulnerability of the learning-based BCSD methods, which cause hazards in security-related applications. To evaluate the adversarial robustness, this paper designs an efficient and black-box adversarial code generation algorithm, namely, FuncFooler. FuncFooler constrains the adversarial codes 1) to keep unchanged the program&#39;s control flow graph (CFG), and 2) to preserve the same semantic meaning. Specifically, FuncFooler consecutively 1) determines vulnerable candidates in the malicious code, 2) chooses and inserts the adversarial instructions from the benign code, and 3) corrects the semantic side effect of the adversarial code to meet the constraints. Empirically, our FuncFooler can successfully attack the three learning-based BCSD models, including SAFE, Asm2Vec, and jTrans, which calls into question whether the learning-based BCSD is desirable.

preprint2022arXiv

Identifying and Exploiting Sparse Branch Correlations for Optimizing Branch Prediction

Branch prediction is arguably one of the most important speculative mechanisms within a high-performance processor architecture. A common approach to improve branch prediction accuracy is to employ lengthy history records of previously seen branch directions to capture distant correlations between branches. The larger the history, the richer the information that the predictor can exploit for discovering predictive patterns. However, without appropriate filtering, such an approach may also heavily disorganize the predictor&#39;s internal mechanisms, leading to diminishing returns. This paper studies a fundamental control-flow property: the sparsity in the correlation between branches and recent history. First, we show that sparse branch correlations exist in standard applications and, more importantly, such correlations can be computed efficiently using sparse modeling methods. Second, we introduce a sparsity-aware branch prediction mechanism that can compactly encode and store sparse models to unlock essential performance opportunities. We evaluated our approach for various design parameters demonstrating MPKI improvements of up to 42% (2.3% on average) with 2KB of additional storage overhead. Our circuit-level evaluation of the design showed that it can operate within accepted branch prediction latencies, and under reasonable power and area limitations.

preprint2022arXiv

Iteratively Weighted MMSE Uplink Precoding for Cell-Free Massive MIMO

In this paper, we investigate a cell-free massive MIMO system with both access points and user equipments equipped with multiple antennas over the Weichselberger Rayleigh fading channel. We study the uplink spectral efficiency (SE) based on a two-layer decoding structure with maximum ratio (MR) or local minimum mean-square error (MMSE) combining applied in the first layer and optimal large-scale fading decoding method implemented in the second layer, respectively. To maximize the weighted sum SE, an uplink precoding structure based on an Iteratively Weighted sum-MMSE (I-WMMSE) algorithm using only channel statistics is proposed. Furthermore, with MR combining applied in the first layer, we derive novel achievable SE expressions and optimal precoding structures in closed-form. Numerical results validate our proposed results and show that the I-WMMSE precoding can achieve excellent sum SE performance.

preprint2022arXiv

Joint Learning of Deep Texture and High-Frequency Features for Computer-Generated Image Detection

Distinguishing between computer-generated (CG) and natural photographic (PG) images is of great importance to verify the authenticity and originality of digital images. However, the recent cutting-edge generation methods enable high qualities of synthesis in CG images, which makes this challenging task even trickier. To address this issue, a joint learning strategy with deep texture and high-frequency features for CG image detection is proposed. We first formulate and deeply analyze the different acquisition processes of CG and PG images. Based on the finding that multiple different modules in image acquisition will lead to different sensitivity inconsistencies to the convolutional neural network (CNN)-based rendering in images, we propose a deep texture rendering module for texture difference enhancement and discriminative texture representation. Specifically, the semantic segmentation map is generated to guide the affine transformation operation, which is used to recover the texture in different regions of the input image. Then, the combination of the original image and the high-frequency components of the original and rendered images are fed into a multi-branch neural network equipped with attention mechanisms, which refines intermediate features and facilitates trace exploration in spatial and channel dimensions respectively. Extensive experiments on two public datasets and a newly constructed dataset with more realistic and diverse images show that the proposed approach outperforms existing methods in the field by a clear margin. Besides, results also demonstrate the detection robustness and generalization ability of the proposed approach to postprocessing operations and generative adversarial network (GAN) generated images.

preprint2022arXiv

Learning Versatile Neural Architectures by Propagating Network Codes

This work explores how to design a single neural network capable of adapting to multiple heterogeneous vision tasks, such as image segmentation, 3D detection, and video recognition. This goal is challenging because both network architecture search (NAS) spaces and methods in different tasks are inconsistent. We solve this challenge from both sides. We first introduce a unified design space for multiple tasks and build a multitask NAS benchmark (NAS-Bench-MR) on many widely used datasets, including ImageNet, Cityscapes, KITTI, and HMDB51. We further propose Network Coding Propagation (NCP), which back-propagates gradients of neural predictors to directly update architecture codes along the desired gradient directions to solve various tasks. In this way, optimal architecture configurations can be found by NCP in our large search space in seconds. Unlike prior arts of NAS that typically focus on a single task, NCP has several unique benefits. (1) NCP transforms architecture optimization from data-driven to architecture-driven, enabling joint search an architecture among multitasks with different data distributions. (2) NCP learns from network codes but not original data, enabling it to update the architecture efficiently across datasets. (3) In addition to our NAS-Bench-MR, NCP performs well on other NAS benchmarks, such as NAS-Bench-201. (4) Thorough studies of NCP on inter-, cross-, and intra-tasks highlight the importance of cross-task neural architecture design, i.e., multitask neural architectures and architecture transferring between different tasks. Code is available at https://github.com/dingmyu/NCP.

preprint2022arXiv

Magneto-optical study of metamagnetic transitions in the antiferromagnetic phase of $α$-RuCl$_3$

$α$-RuCl$_3$ is a promising candidate material to realize the so far elusive quantum spin liquid ground state. However, at low temperatures, the coexistence of different exchange interactions couple the effective pseudospins into an antiferromagnetically zigzag (ZZ) ordered state. The low-field evolution of spin structure is still a matter of debate and the magnetic anisotropy within the honeycomb planes is an open and challenging question. Here, we investigate the evolution of the ZZ order parameter by second-order magneto-optical effects, the magnetic linear dichroism and magnetic linear birefringence. Our results clarify the presence and nature of metamagnetic transitions in the ZZ phase of $α$-RuCl$_3$. Our experimental observations show the presence of initial magnetic domain repopulation followed by a spin-flop transition for small in-plane applied magnetic fields ($\approx$ 1.6 T) along specific crystallographic directions. In addition, using a magneto-optical approach, we detected the recently reported emergence of a field-induced intermediate phase before suppressing the ZZ order. Our results disclose the details of various angle-dependent in-plane metamagnetic transitions quantifying the bond-anisotropic interactions present in $α$-RuCl$_3$

preprint2022arXiv

Mass Testing and Characterization of 20-inch PMTs for JUNO

Main goal of the JUNO experiment is to determine the neutrino mass ordering using a 20kt liquid-scintillator detector. Its key feature is an excellent energy resolution of at least 3 % at 1 MeV, for which its instruments need to meet a certain quality and thus have to be fully characterized. More than 20,000 20-inch PMTs have been received and assessed by JUNO after a detailed testing program which began in 2017 and elapsed for about four years. Based on this mass characterization and a set of specific requirements, a good quality of all accepted PMTs could be ascertained. This paper presents the performed testing procedure with the designed testing systems as well as the statistical characteristics of all 20-inch PMTs intended to be used in the JUNO experiment, covering more than fifteen performance parameters including the photocathode uniformity. This constitutes the largest sample of 20-inch PMTs ever produced and studied in detail to date, i.e. 15,000 of the newly developed 20-inch MCP-PMTs from Northern Night Vision Technology Co. (NNVT) and 5,000 of dynode PMTs from Hamamatsu Photonics K. K.(HPK).

preprint2022arXiv

Mastering the Game of Stratego with Model-Free Multiagent Reinforcement Learning

We introduce DeepNash, an autonomous agent capable of learning to play the imperfect information game Stratego from scratch, up to a human expert level. Stratego is one of the few iconic board games that Artificial Intelligence (AI) has not yet mastered. This popular game has an enormous game tree on the order of $10^{535}$ nodes, i.e., $10^{175}$ times larger than that of Go. It has the additional complexity of requiring decision-making under imperfect information, similar to Texas hold&#39;em poker, which has a significantly smaller game tree (on the order of $10^{164}$ nodes). Decisions in Stratego are made over a large number of discrete actions with no obvious link between action and outcome. Episodes are long, with often hundreds of moves before a player wins, and situations in Stratego can not easily be broken down into manageably-sized sub-problems as in poker. For these reasons, Stratego has been a grand challenge for the field of AI for decades, and existing AI methods barely reach an amateur level of play. DeepNash uses a game-theoretic, model-free deep reinforcement learning method, without search, that learns to master Stratego via self-play. The Regularised Nash Dynamics (R-NaD) algorithm, a key component of DeepNash, converges to an approximate Nash equilibrium, instead of &#39;cycling&#39; around it, by directly modifying the underlying multi-agent learning dynamics. DeepNash beats existing state-of-the-art AI methods in Stratego and achieved a yearly (2022) and all-time top-3 rank on the Gravon games platform, competing with human expert players.

preprint2022arXiv

Maximising the Influence of Temporary Participants in Opinion Formation

DeGroot-style opinion formation presumes a continuous interaction among agents of a social network. Hence, it cannot handle agents external to the social network that interact only temporarily with the permanent ones. Many real-world organisations and individuals fall into such a category. For instance, a company tries to persuade as many as possible to buy its products and, due to various constraints, can only exert its influence for a limited amount of time. We propose a variant of the DeGroot model that allows an external agent to interact with the permanent ones for a preset period of time. We obtain several insights on maximising an external agent&#39;s influence in opinion formation by analysing and simulating the variant.

preprint2022arXiv

Monolithically integrated active passive waveguide array fabricated on thin film lithium niobate using a single continuous photolithography process

We demonstrate a robust low-loss optical interface by tiling passive (i.e., without doping of active ions) thin film lithium niobate (TFLN) and active (i.e., doped with rare earth ions) TFLN substrates for monolithic integration of passive/active lithium niobate photonics. The tiled substrates composed of both active and passive areas allow to pattern the mask of the integrated active passive photonic device at once using a single continuous photolithography process. The interface loss of tiled substrate is measured as low as 0.26 dB. Thanks to the stability provided by this approach, a four-channel waveguide amplifier is realized in a straightforward manner, which shows a net gain of ~5 dB at 1550-nm wavelength and that of ~8 dB at 1530-nm wavelength for each channel. The robust low-loss optical interface for passive/active photonic integration will facilitate large-scale high performance photonic devices which require on-chip light sources and amplifiers.

preprint2022arXiv

Multifunctional Two-dimensional van der Waals Janus Magnet Cr-based Dichalcogenide Halides

Two-dimensional van der Waals Janus materials and their heterostructures offer fertile platforms for designing fascinating functionalities. Here, by means of systematic first-principles studies on van der Waals Janus monolayer Cr-based dichalcogenide halides CrYX (Y=S, Se, Te; X=Cl, Br, I), we find that CrSX (X=Cl, Br, I) are the very desirable high TC ferromagnetic semiconductors with an out-of-plane magnetization. Excitingly, by the benefit of the large magnetic moments on ligand S2- anions, the sought-after large-gap quantum anomalous Hall effect and sizable valley splitting can be achieved through the magnetic proximity effect in van der Waals heterostructures CrSBr/Bi2Se3/CrSBr and MoTe2/CrSBr, respectively. Additionally, we show that large Dzyaloshinskii-Moriya interactions give rise to skyrmion states in CrTeX (X=Cl, Br, I) under external magnetic fields. Our work reveals that two-dimensional Janus magnet Cr-based dichalcogenide halides have appealing multifunctionalities in the applications of topological electronic and valleytronic devices.

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

On-chip integrated Yb3+-doped waveguide amplifiers on thin film lithium niobate

We report the fabrication and optical characterization of Yb3+-doped waveguide amplifiers (YDWA) on the thin film lithium niobate fabricated by photolithography assisted chemo-mechanical etching. The fabricated Yb3+-doped lithium niobate waveguides demonstrates low propagation loss of 0.13 dB/cm at 1030 nm and 0.1 dB/cm at 1060 nm. The internal net gain of 5 dB at 1030 nm and 8 dB at 1060 nm are measured on a 4.0 cm long waveguide pumped by 976nm laser diodes, indicating the gain per unit length of 1.25 dB/cm at 1030 nm and 2 dB/cm at 1060 nm, respectively. The integrated Yb3+-doped lithium niobate waveguide amplifiers will benefit the development of a powerful gain platform and are expected to contribute to the high-density integration of thin film lithium niobate based photonic chip.

preprint2022arXiv

Reduction of the 2D Toda Hierarchy and Linear Hodge Integrals

We construct a certain reduction of the 2D Toda hierarchy and obtain a tau-symmetric Hamiltonian integrable hierarchy. This reduced integrable hierarchy controls the linear Hodge integrals in the way that one part of its flows yields the intermediate long wave hierarchy, and the remaining flows coincide with a certain limit of the flows of the fractional Volterra hierarchy which controls the special cubic Hodge integrals.

preprint2022arXiv

Subtype-Former: a deep learning approach for cancer subtype discovery with multi-omics data

Motivation: Cancer is heterogeneous, affecting the precise approach to personalized treatment. Accurate subtyping can lead to better survival rates for cancer patients. High-throughput technologies provide multiple omics data for cancer subtyping. However, precise cancer subtyping remains challenging due to the large amount and high dimensionality of omics data. Results: This study proposed Subtype-Former, a deep learning method based on MLP and Transformer Block, to extract the low-dimensional representation of the multi-omics data. K-means and Consensus Clustering are also used to achieve accurate subtyping results. We compared Subtype-Former with the other state-of-the-art subtyping methods across the TCGA 10 cancer types. We found that Subtype-Former can perform better on the benchmark datasets of more than 5000 tumors based on the survival analysis. In addition, Subtype-Former also achieved outstanding results in pan-cancer subtyping, which can help analyze the commonalities and differences across various cancer types at the molecular level. Finally, we applied Subtype-Former to the TCGA 10 types of cancers. We identified 50 essential biomarkers, which can be used to study targeted cancer drugs and promote the development of cancer treatments in the era of precision medicine.

preprint2022arXiv

TBI-GAN: An Adversarial Learning Approach for Data Synthesis on Traumatic Brain Segmentation

Brain network analysis for traumatic brain injury (TBI) patients is critical for its consciousness level assessment and prognosis evaluation, which requires the segmentation of certain consciousness-related brain regions. However, it is difficult to construct a TBI segmentation model as manually annotated MR scans of TBI patients are hard to collect. Data augmentation techniques can be applied to alleviate the issue of data scarcity. However, conventional data augmentation strategies such as spatial and intensity transformation are unable to mimic the deformation and lesions in traumatic brains, which limits the performance of the subsequent segmentation task. To address these issues, we propose a novel medical image inpainting model named TBI-GAN to synthesize TBI MR scans with paired brain label maps. The main strength of our TBI-GAN method is that it can generate TBI images and corresponding label maps simultaneously, which has not been achieved in the previous inpainting methods for medical images. We first generate the inpainted image under the guidance of edge information following a coarse-to-fine manner, and then the synthesized intensity image is used as the prior for label inpainting. Furthermore, we introduce a registration-based template augmentation pipeline to increase the diversity of the synthesized image pairs and enhance the capacity of data augmentation. Experimental results show that the proposed TBI-GAN method can produce sufficient synthesized TBI images with high quality and valid label maps, which can greatly improve the 2D and 3D traumatic brain segmentation performance compared with the alternatives.

preprint2022arXiv

The Potential to Probe Solar Neutrino Physics with LiCl Water Solution

Lithium chloride water solution is a good option for solar neutrino detection. The $ν_e$ charged-current (CC) interaction cross-section on $\rm{{}^{7}Li}$ is evaluated with new B(GT) experimental measurements. The total CC interaction cross-section weighted by the solar $^8$B electron neutrino spectrum is $3.759\times10^{-42} \rm{cm}^2$, which is about 60 times that of the neutrino-electron elastic scattering process. The final state effective kinetic energy after the CC interaction on $\rm{{}^{7}Li}$ directly reflects the neutrino energy, which stands in sharp contrast to the plateau structure of recoil electrons of the elastic scattering. With the high solubility of LiCl of 74.5 g/100 g water at 10$^\circ$C and the high natural abundance of 92.41%, the molarity of $\rm{{}^{7}Li}$ in water can reach 11 mol/L for safe operation at room temperature. The CC event rate of $ν_e$ on $\rm{{}^{7}Li}$ in the LiCl water solution is comparable to that of neutrino-electron elastic scattering. In addition, the $ν_e$ CC interaction with the contained $\rm{{}^{37}Cl}$ also contributes a few percent of the total CC event rate. The contained $\rm{{}^{35}Cl}$ and $\rm{{}^{6}Li}$ also make a delay-coincidence detection for electron antineutrinos possible. The recrystallization method is found to be applicable for LiCl sample purification. The measured attenuation length of $11\pm1$ m at 430 nm shows that the LiCl solution is practicable for a 10-m diameter detector for solar neutrino detection. Clear advantages are found in studying the upturn effect of solar neutrino oscillation, light sterile neutrinos, and Earth matter effect. The sensitivities in discovering solar neutrino upturn and light sterile neutrinos are shown.

preprint2022arXiv

Towards the ultimate PMT waveform analysis for neutrino and dark matter experiments

Photomultiplier tube (PMT) voltage waveforms are the raw data of many neutrino and dark matter experiments. Waveform analysis is the cornerstone of data processing. We evaluate the performance of all the waveform analysis algorithms known to us and find fast stochastic matching pursuit the best in accuracy. Significant time (up to 2 times) and energy (up to 1.07 times) resolution boosts are attainable with fast stochastic matching pursuit, approaching theoretical limits. Other methods also outperform the traditional threshold crossing approach in time resolution.

preprint2022arXiv

Uplink Performance of Cell-Free Massive MIMO with Multi-Antenna Users Over Jointly-Correlated Rayleigh Fading Channels

In this paper, we investigate a cell-free massive MIMO system with both access points (APs) and user equipments (UEs) equipped with multiple antennas over jointly-correlated Rayleigh fading channels. We study four uplink implementations, from fully centralized processing to fully distributed processing, and derive their achievable spectral efficiency (SE) expressions with minimum mean-squared error successive interference cancellation (MMSE-SIC) detectors and arbitrary combining schemes. Furthermore, the global and local MMSE combining schemes are derived based on full and local channel state information (CSI) obtained under pilot contamination, which can maximize the achievable SE for the fully centralized and distributed implementation, respectively. We study a two-layer decoding implementation with an arbitrary combining scheme in the first layer and optimal large-scale fading decoding (LSFD) in the second layer. Besides, we compute novel closed-form SE expressions for the two-layer decoding implementation with maximum ratio (MR) combining. In the numerical results, we compare the SE performance for different implementation levels, combining schemes, and channel models. It is important to note that increasing the number of antennas per UE may degrade the SE performance.

preprint2022arXiv

WaveGAN: Frequency-aware GAN for High-Fidelity Few-shot Image Generation

Existing few-shot image generation approaches typically employ fusion-based strategies, either on the image or the feature level, to produce new images. However, previous approaches struggle to synthesize high-frequency signals with fine details, deteriorating the synthesis quality. To address this, we propose WaveGAN, a frequency-aware model for few-shot image generation. Concretely, we disentangle encoded features into multiple frequency components and perform low-frequency skip connections to preserve outline and structural information. Then we alleviate the generator&#39;s struggles of synthesizing fine details by employing high-frequency skip connections, thus providing informative frequency information to the generator. Moreover, we utilize a frequency L1-loss on the generated and real images to further impede frequency information loss. Extensive experiments demonstrate the effectiveness and advancement of our method on three datasets. Noticeably, we achieve new state-of-the-art with FID 42.17, LPIPS 0.3868, FID 30.35, LPIPS 0.5076, and FID 4.96, LPIPS 0.3822 respectively on Flower, Animal Faces, and VGGFace. GitHub: https://github.com/kobeshegu/ECCV2022_WaveGAN

preprint2021arXiv

Exploit Camera Raw Data for Video Super-Resolution via Hidden Markov Model Inference

To the best of our knowledge, the existing deep-learning-based Video Super-Resolution (VSR) methods exclusively make use of videos produced by the Image Signal Processor (ISP) of the camera system as inputs. Such methods are 1) inherently suboptimal due to information loss incurred by non-invertible operations in ISP, and 2) inconsistent with the real imaging pipeline where VSR in fact serves as a pre-processing unit of ISP. To address this issue, we propose a new VSR method that can directly exploit camera sensor data, accompanied by a carefully built Raw Video Dataset (RawVD) for training, validation, and testing. This method consists of a Successive Deep Inference (SDI) module and a reconstruction module, among others. The SDI module is designed according to the architectural principle suggested by a canonical decomposition result for Hidden Markov Model (HMM) inference; it estimates the target high-resolution frame by repeatedly performing pairwise feature fusion using deformable convolutions. The reconstruction module, built with elaborately designed Attention-based Residual Dense Blocks (ARDBs), serves the purpose of 1) refining the fused feature and 2) learning the color information needed to generate a spatial-specific transformation for accurate color correction. Extensive experiments demonstrate that owing to the informativeness of the camera raw data, the effectiveness of the network architecture, and the separation of super-resolution and color correction processes, the proposed method achieves superior VSR results compared to the state-of-the-art and can be adapted to any specific camera-ISP. Code and dataset are available at https://github.com/proteus1991/RawVSR.

preprint2021arXiv

Improving Sample Complexity Bounds for (Natural) Actor-Critic Algorithms

The actor-critic (AC) algorithm is a popular method to find an optimal policy in reinforcement learning. In the infinite horizon scenario, the finite-sample convergence rate for the AC and natural actor-critic (NAC) algorithms has been established recently, but under independent and identically distributed (i.i.d.) sampling and single-sample update at each iteration. In contrast, this paper characterizes the convergence rate and sample complexity of AC and NAC under Markovian sampling, with mini-batch data for each iteration, and with actor having general policy class approximation. We show that the overall sample complexity for a mini-batch AC to attain an $ε$-accurate stationary point improves the best known sample complexity of AC by an order of $\mathcal{O}(ε^{-1}\log(1/ε))$, and the overall sample complexity for a mini-batch NAC to attain an $ε$-accurate globally optimal point improves the existing sample complexity of NAC by an order of $\mathcal{O}(ε^{-1}/\log(1/ε))$. Moreover, the sample complexity of AC and NAC characterized in this work outperforms that of policy gradient (PG) and natural policy gradient (NPG) by a factor of $\mathcal{O}((1-γ)^{-3})$ and $\mathcal{O}((1-γ)^{-4}ε^{-1}/\log(1/ε))$, respectively. This is the first theoretical study establishing that AC and NAC attain orderwise performance improvement over PG and NPG under infinite horizon due to the incorporation of critic.

preprint2021arXiv

JUNO Physics and Detector

The Jiangmen Underground Neutrino Observatory (JUNO) is a 20 kton LS detector at 700-m underground. An excellent energy resolution and a large fiducial volume offer exciting opportunities for addressing many important topics in neutrino and astro-particle physics. With 6 years of data, the neutrino mass ordering can be determined at 3-4 sigma and three oscillation parameters can be measured to a precision of 0.6% or better by detecting reactor antineutrinos. With 10 years of data, DSNB could be observed at 3-sigma; a lower limit of the proton lifetime of 8.34e33 years (90% C.L.) can be set by searching for p->nu_bar K^+; detection of solar neutrinos would shed new light on the solar metallicity problem and examine the vacuum-matter transition region. A core-collapse supernova at 10 kpc would lead to ~5000 IBD and ~2000 (300) all-flavor neutrino-proton (electron) scattering events. Geo-neutrinos can be detected with a rate of ~400 events/year. We also summarize the final design of the JUNO detector and the key R&D achievements. All 20-inch PMTs have been tested. The average photon detection efficiency is 28.9% for the 15,000 MCP PMTs and 28.1% for the 5,000 dynode PMTs, higher than the JUNO requirement of 27%. Together with the >20 m attenuation length of LS, we expect a yield of 1345 p.e. per MeV and an effective energy resolution of 3.02%/\sqrt{E (MeV)}$ in simulations. The underwater electronics is designed to have a loss rate <0.5% in 6 years. With degassing membranes and a micro-bubble system, the radon concentration in the 35-kton water pool could be lowered to <10 mBq/m^3. Acrylic panels of radiopurity <0.5 ppt U/Th are produced. The 20-kton LS will be purified onsite. Singles in the fiducial volume can be controlled to ~10 Hz. The JUNO experiment also features a double calorimeter system with 25,600 3-inch PMTs, a LS testing facility OSIRIS, and a near detector TAO.

preprint2021arXiv

Network Pruning via Resource Reallocation

Channel pruning is broadly recognized as an effective approach to obtain a small compact model through eliminating unimportant channels from a large cumbersome network. Contemporary methods typically perform iterative pruning procedure from the original over-parameterized model, which is both tedious and expensive especially when the pruning is aggressive. In this paper, we propose a simple yet effective channel pruning technique, termed network Pruning via rEsource rEalLocation (PEEL), to quickly produce a desired slim model with negligible cost. Specifically, PEEL first constructs a predefined backbone and then conducts resource reallocation on it to shift parameters from less informative layers to more important layers in one round, thus amplifying the positive effect of these informative layers. To demonstrate the effectiveness of PEEL , we perform extensive experiments on ImageNet with ResNet-18, ResNet-50, MobileNetV2, MobileNetV3-small and EfficientNet-B0. Experimental results show that structures uncovered by PEEL exhibit competitive performance with state-of-the-art pruning algorithms under various pruning settings. Our code is available at https://github.com/cardwing/Codes-for-PEEL.

preprint2021arXiv

On-chip integrated waveguide amplifiers on Erbium-doped thin film lithium niobate on insulator

We demonstrate on-chip light amplification with integrated optical waveguide fabricated on erbium-doped thin film lithium niobate on insulator (TFLNOI) using the photolithography assisted chemo-mechanical etching (PLACE) technique. A maximum internal net gain of 18 dB in the small-signal-gain regime is measured at the peak emission wavelength of 1530 nm for a waveguide length of 3.6 cm, indicating a differential gain per unit length of 5 dB/cm. This work paves the way to the monolithic integration of diverse active and passive photonic components on the TFLNOI platform.

preprint2021arXiv

Relate and Predict: Structure-Aware Prediction with Jointly Optimized Neural DAG

Understanding relationships between feature variables is one important way humans use to make decisions. However, state-of-the-art deep learning studies either focus on task-agnostic statistical dependency learning or do not model explicit feature dependencies during prediction. We propose a deep neural network framework, dGAP, to learn neural dependency Graph and optimize structure-Aware target Prediction simultaneously. dGAP trains towards a structure self-supervision loss and a target prediction loss jointly. Our method leads to an interpretable model that can disentangle sparse feature relationships, informing the user how relevant dependencies impact the target task. We empirically evaluate dGAP on multiple simulated and real datasets. dGAP is not only more accurate, but can also recover correct dependency structure.

preprint2021arXiv

Symmetric Rigidity for Circle Endomorphisms with Bounded Geometry

Let $f$ and $g$ be two circle endomorphisms of degree $d\geq 2$ such that each has bounded geometry, preserves the Lebesgue measure, and fixes $1$. Let $h$ fixing $1$ be the topological conjugacy from $f$ to $g$. That is, $h\circ f=g\circ h$. We prove that $h$ is a symmetric circle homeomorphism if and only if $h=Id$. Many other rigidity results in circle dynamics follow from this very general symmetric rigidity result.

preprint2021arXiv

The ANTARES Astronomical Time-Domain Event Broker

We describe the Arizona-NOIRLab Temporal Analysis and Response to Events System (ANTARES), a software instrument designed to process large-scale streams of astronomical time-domain alerts. With the advent of large-format CCDs on wide-field imaging telescopes, time-domain surveys now routinely discover tens of thousands of new events each night, more than can be evaluated by astronomers alone. The ANTARES event broker will process alerts, annotating them with catalog associations and filtering them to distinguish customizable subsets of events. We describe the data model of the system, the overall architecture, annotation, implementation of filters, system outputs, provenance tracking, system performance, and the user interface.

preprint2021arXiv

The Role of the Hercules Autonomous Vehicle During the COVID-19 Pandemic: An Autonomous Logistic Vehicle for Contactless Goods Transportation

Since early 2020, the coronavirus disease 2019 (COVID-19) has spread rapidly across the world. As at the date of writing this article, the disease has been globally reported in 223 countries and regions, infected over 108 million people and caused over 2.4 million deaths (https://covid19.who.int/, accessed on Feb. 17, 2021). Avoiding person-to-person transmission is an effective approach to control and prevent the pandemic. However, many daily activities, such as transporting goods in our daily life, inevitably involve person-to-person contact. Using an autonomous logistic vehicle to achieve contact-less goods transportation could alleviate this issue. For example, it can reduce the risk of virus transmission between the driver and customers. Moreover, many countries have imposed tough lockdown measures to reduce the virus transmission (e.g., retail, catering) during the pandemic, which causes inconveniences for human daily life. Autonomous vehicle can deliver the goods bought by humans, so that humans can get the goods without going out. These demands motivate us to develop an autonomous vehicle, named as Hercules, for contact-less goods transportation during the COVID-19 pandemic. The vehicle is evaluated through real-world delivering tasks under various traffic conditions.

preprint2020arXiv

A Generalized Training Approach for Multiagent Learning

This paper investigates a population-based training regime based on game-theoretic principles called Policy-Spaced Response Oracles (PSRO). PSRO is general in the sense that it (1) encompasses well-known algorithms such as fictitious play and double oracle as special cases, and (2) in principle applies to general-sum, many-player games. Despite this, prior studies of PSRO have been focused on two-player zero-sum games, a regime wherein Nash equilibria are tractably computable. In moving from two-player zero-sum games to more general settings, computation of Nash equilibria quickly becomes infeasible. Here, we extend the theoretical underpinnings of PSRO by considering an alternative solution concept, $α$-Rank, which is unique (thus faces no equilibrium selection issues, unlike Nash) and applies readily to general-sum, many-player settings. We establish convergence guarantees in several games classes, and identify links between Nash equilibria and $α$-Rank. We demonstrate the competitive performance of $α$-Rank-based PSRO against an exact Nash solver-based PSRO in 2-player Kuhn and Leduc Poker. We then go beyond the reach of prior PSRO applications by considering 3- to 5-player poker games, yielding instances where $α$-Rank achieves faster convergence than approximate Nash solvers, thus establishing it as a favorable general games solver. We also carry out an initial empirical validation in MuJoCo soccer, illustrating the feasibility of the proposed approach in another complex domain.

preprint2020arXiv

Achieving 50 femtosecond resolution in MeV ultrafast electron diffraction with a double bend achromat compressor

We propose and demonstrate a novel scheme to produce ultrashort and ultrastable MeV electron beam. In this scheme, the electron beam produced in a photocathode radio-frequency (rf) gun first expands under its own Coulomb force with which a positive energy chirp is imprinted in the beam longitudinal phase space. The beam is then sent through a double bend achromat with positive longitudinal dispersion where electrons at the bunch tail with lower energies follow shorter paths and thus catch up with the bunch head, leading to longitudinal bunch compression. We show that with optimized parameter sets, the whole beam path from the electron source to the compression point can be made isochronous such that the time of flight for the electron beam is immune to the fluctuations of rf amplitude. With a laser-driven THz deflector, the bunch length and arrival time jitter for a 20 fC beam after bunch compression are measured to be about 29 fs (FWHM) and 22 fs (FWHM), respectively. Such an ultrashort and ultrastable electron beam allows us to achieve 50 femtosecond (FWHM) resolution in MeV ultrafast electron diffraction where lattice oscillation at 2.6 THz corresponding to Bismuth A1g mode is clearly observed without correcting both the short-term timing jitter and long-term timing drift. Furthermore, oscillating weak diffuse scattering signal related to phonon coupling and decay is also clearly resolved thanks to the improved temporal resolution and increased electron flux. We expect that this technique will have a strong impact in emerging ultrashort electron beam based facilities and applications.

preprint2020arXiv

ACMo: Angle-Calibrated Moment Methods for Stochastic Optimization

Due to its simplicity and outstanding ability to generalize, stochastic gradient descent (SGD) is still the most widely used optimization method despite its slow convergence. Meanwhile, adaptive methods have attracted rising attention of optimization and machine learning communities, both for the leverage of life-long information and for the profound and fundamental mathematical theory. Taking the best of both worlds is the most exciting and challenging question in the field of optimization for machine learning. Along this line, we revisited existing adaptive gradient methods from a novel perspective, refreshing understanding of second moments. Our new perspective empowers us to attach the properties of second moments to the first moment iteration, and to propose a novel first moment optimizer, \emph{Angle-Calibrated Moment method} (\method). Our theoretical results show that \method is able to achieve the same convergence rate as mainstream adaptive methods. Furthermore, extensive experiments on CV and NLP tasks demonstrate that \method has a comparable convergence to SOTA Adam-type optimizers, and gains a better generalization performance in most cases.

preprint2020arXiv

Adaptive Gradient Methods Can Be Provably Faster than SGD after Finite Epochs

Adaptive gradient methods have attracted much attention of machine learning communities due to the high efficiency. However their acceleration effect in practice, especially in neural network training, is hard to analyze, theoretically. The huge gap between theoretical convergence results and practical performances prevents further understanding of existing optimizers and the development of more advanced optimization methods. In this paper, we provide adaptive gradient methods a novel analysis with an additional mild assumption, and revise AdaGrad to \radagrad for matching a better provable convergence rate. To find an $ε$-approximate first-order stationary point in non-convex objectives, we prove random shuffling \radagrad achieves a $\tilde{O}(T^{-1/2})$ convergence rate, which is significantly improved by factors $\tilde{O}(T^{-1/4})$ and $\tilde{O}(T^{-1/6})$ compared with existing adaptive gradient methods and random shuffling SGD, respectively. To the best of our knowledge, it is the first time to demonstrate that adaptive gradient methods can deterministically be faster than SGD after finite epochs. Furthermore, we conduct comprehensive experiments to validate the additional mild assumption and the acceleration effect benefited from second moments and random shuffling.

preprint2020arXiv

COLD: Towards the Next Generation of Pre-Ranking System

Multi-stage cascade architecture exists widely in many industrial systems such as recommender systems and online advertising, which often consists of sequential modules including matching, pre-ranking, ranking, etc. For a long time, it is believed pre-ranking is just a simplified version of the ranking module, considering the larger size of the candidate set to be ranked. Thus, efforts are made mostly on simplifying ranking model to handle the explosion of computing power for online inference. In this paper, we rethink the challenge of the pre-ranking system from an algorithm-system co-design view. Instead of saving computing power with restriction of model architecture which causes loss of model performance, here we design a new pre-ranking system by joint optimization of both the pre-ranking model and the computing power it costs. We name it COLD (Computing power cost-aware Online and Lightweight Deep pre-ranking system). COLD beats SOTA in three folds: (i) an arbitrary deep model with cross features can be applied in COLD under a constraint of controllable computing power cost. (ii) computing power cost is explicitly reduced by applying optimization tricks for inference acceleration. This further brings space for COLD to apply more complex deep models to reach better performance. (iii) COLD model works in an online learning and severing manner, bringing it excellent ability to handle the challenge of the data distribution shift. Meanwhile, the fully online pre-ranking system of COLD provides us with a flexible infrastructure that supports efficient new model developing and online A/B testing.Since 2019, COLD has been deployed in almost all products involving the pre-ranking module in the display advertising system in Alibaba, bringing significant improvements.

preprint2020arXiv

Cylinder3D: An Effective 3D Framework for Driving-scene LiDAR Semantic Segmentation

State-of-the-art methods for large-scale driving-scene LiDAR semantic segmentation often project and process the point clouds in the 2D space. The projection methods includes spherical projection, bird-eye view projection, etc. Although this process makes the point cloud suitable for the 2D CNN-based networks, it inevitably alters and abandons the 3D topology and geometric relations. A straightforward solution to tackle the issue of 3D-to-2D projection is to keep the 3D representation and process the points in the 3D space. In this work, we first perform an in-depth analysis for different representations and backbones in 2D and 3D spaces, and reveal the effectiveness of 3D representations and networks on LiDAR segmentation. Then, we develop a 3D cylinder partition and a 3D cylinder convolution based framework, termed as Cylinder3D, which exploits the 3D topology relations and structures of driving-scene point clouds. Moreover, a dimension-decomposition based context modeling module is introduced to explore the high-rank context information in point clouds in a progressive manner. We evaluate the proposed model on a large-scale driving-scene dataset, i.e. SematicKITTI. Our method achieves state-of-the-art performance and outperforms existing methods by 6% in terms of mIoU.

preprint2020arXiv

Discrete Darboux system with self-consistent sources and its symmetric reduction

The discrete non-commutative Darboux system of equations with self-consistent sources is constructed, utilizing both the vectorial fundamental (binary Darboux) transformation and the method of additional independent variables. Then the symmetric reduction of discrete Darboux equations with sources is presented. In order to provide a simpler version of the resulting equations we introduce the $τ/σ$ form of the (commutative) discrete Darboux system. Our equations give, in continuous limit, the version with self-consistent sources of the classical symmetric Darboux system.

preprint2020arXiv

Dynamics of entanglement in the one-dimensional anisotropic XXZ model

The dynamics of entanglement in the one-dimensional spin-1/2 anisotropic XXZ model is studied using the quantum renormalization-group method. We obtain the analytical expression of the concurrence, for two different quenching methods, it is found that initial state plays a key role in the evolution of system entanglement, i.e., the system returns completely to the initial state every other period. Our computations and analysis indicate that the first derivative of the characteristic time at which the concurrence reaches its maximum or minimum with respect to the anisotropic parameter occurs nonanalytic behaviors at the quantum critical point. Interestingly, the minimum value of the first derivative of the characteristic time versus the size of the system exhibits the scaling behavior which is the same as the scaling behavior of the system ground-state entanglement in equilibrium. In particular, the scaling behavior near the critical point is independent of the initial state.

preprint2020arXiv

Exploring Trade-offs in Dynamic Task Triggering for Loosely Coupled Scientific Workflows

In order to achieve near-time insights, scientific workflows tend to be organized in a flexible and dynamic way. Data-driven triggering of tasks has been explored as a way to support workflows that evolve based on the data. However, the overhead introduced by such dynamic triggering of tasks is an under-studied topic. This paper discusses different facets of dynamic task triggers. Particularly, we explore different ways of constructing a data-driven dynamic workflow and then evaluate the overheads introduced by such design decisions. We evaluate workflows with varying data size, percentage of interesting data, temporal data distribution, and number of tasks triggered. Finally, we provide advice based upon analysis of the evaluation results for users looking to construct data-driven scientific workflows.

preprint2020arXiv

Feasibility and physics potential of detecting $^8$B solar neutrinos at JUNO

The Jiangmen Underground Neutrino Observatory~(JUNO) features a 20~kt multi-purpose underground liquid scintillator sphere as its main detector. Some of JUNO&#39;s features make it an excellent experiment for $^8$B solar neutrino measurements, such as its low-energy threshold, its high energy resolution compared to water Cherenkov detectors, and its much large target mass compared to previous liquid scintillator detectors. In this paper we present a comprehensive assessment of JUNO&#39;s potential for detecting $^8$B solar neutrinos via the neutrino-electron elastic scattering process. A reduced 2~MeV threshold on the recoil electron energy is found to be achievable assuming the intrinsic radioactive background $^{238}$U and $^{232}$Th in the liquid scintillator can be controlled to 10$^{-17}$~g/g. With ten years of data taking, about 60,000 signal and 30,000 background events are expected. This large sample will enable an examination of the distortion of the recoil electron spectrum that is dominated by the neutrino flavor transformation in the dense solar matter, which will shed new light on the tension between the measured electron spectra and the predictions of the standard three-flavor neutrino oscillation framework. If $Δm^{2}_{21}=4.8\times10^{-5}~(7.5\times10^{-5})$~eV$^{2}$, JUNO can provide evidence of neutrino oscillation in the Earth at the about 3$σ$~(2$σ$) level by measuring the non-zero signal rate variation with respect to the solar zenith angle. Moveover, JUNO can simultaneously measure $Δm^2_{21}$ using $^8$B solar neutrinos to a precision of 20\% or better depending on the central value and to sub-percent precision using reactor antineutrinos. A comparison of these two measurements from the same detector will help elucidate the current tension between the value of $Δm^2_{21}$ reported by solar neutrino experiments and the KamLAND experiment.

preprint2020arXiv

From Points to Parts: 3D Object Detection from Point Cloud with Part-aware and Part-aggregation Network

3D object detection from LiDAR point cloud is a challenging problem in 3D scene understanding and has many practical applications. In this paper, we extend our preliminary work PointRCNN to a novel and strong point-cloud-based 3D object detection framework, the part-aware and aggregation neural network (Part-$A^2$ net). The whole framework consists of the part-aware stage and the part-aggregation stage. Firstly, the part-aware stage for the first time fully utilizes free-of-charge part supervisions derived from 3D ground-truth boxes to simultaneously predict high quality 3D proposals and accurate intra-object part locations. The predicted intra-object part locations within the same proposal are grouped by our new-designed RoI-aware point cloud pooling module, which results in an effective representation to encode the geometry-specific features of each 3D proposal. Then the part-aggregation stage learns to re-score the box and refine the box location by exploring the spatial relationship of the pooled intra-object part locations. Extensive experiments are conducted to demonstrate the performance improvements from each component of our proposed framework. Our Part-$A^2$ net outperforms all existing 3D detection methods and achieves new state-of-the-art on KITTI 3D object detection dataset by utilizing only the LiDAR point cloud data. Code is available at https://github.com/sshaoshuai/PointCloudDet3D.

preprint2020arXiv

Hierarchical Transformer Network for Utterance-level Emotion Recognition

While there have been significant advances in de-tecting emotions in text, in the field of utter-ance-level emotion recognition (ULER), there are still many problems to be solved. In this paper, we address some challenges in ULER in dialog sys-tems. (1) The same utterance can deliver different emotions when it is in different contexts or from different speakers. (2) Long-range contextual in-formation is hard to effectively capture. (3) Unlike the traditional text classification problem, this task is supported by a limited number of datasets, among which most contain inadequate conversa-tions or speech. To address these problems, we propose a hierarchical transformer framework (apart from the description of other studies, the &#34;transformer&#34; in this paper usually refers to the encoder part of the transformer) with a lower-level transformer to model the word-level input and an upper-level transformer to capture the context of utterance-level embeddings. We use a pretrained language model bidirectional encoder representa-tions from transformers (BERT) as the lower-level transformer, which is equivalent to introducing external data into the model and solve the problem of data shortage to some extent. In addition, we add speaker embeddings to the model for the first time, which enables our model to capture the in-teraction between speakers. Experiments on three dialog emotion datasets, Friends, EmotionPush, and EmoryNLP, demonstrate that our proposed hierarchical transformer network models achieve 1.98%, 2.83%, and 3.94% improvement, respec-tively, over the state-of-the-art methods on each dataset in terms of macro-F1.

preprint2020arXiv

High-index-contrast single-mode optical waveguides fabricated on lithium niobate by photolithography assisted chemo-mechanical etching (PLACE)

We report fabrication of low loss single mode waveguides on lithium niobate on insulator (LNOI) cladded by a layer of SiO2. Our technique, termed photolithography assisted chemo-mechanical etching (PLACE), relies on patterning of a chromium film into the mask shape by femtosecond laser micromachining and subsequent chemo-mechanical etching of the lithium niobate thin film. The high-index-contrast single mode waveguide is measured to have a propagation loss of 0.13 dB/cm. Furthermore, waveguide tapers are fabricated for boosting the coupling efficiency.

preprint2020arXiv

History-Gradient Aided Batch Size Adaptation for Variance Reduced Algorithms

Variance-reduced algorithms, although achieve great theoretical performance, can run slowly in practice due to the periodic gradient estimation with a large batch of data. Batch-size adaptation thus arises as a promising approach to accelerate such algorithms. However, existing schemes either apply prescribed batch-size adaption rule or exploit the information along optimization path via additional backtracking and condition verification steps. In this paper, we propose a novel scheme, which eliminates backtracking line search but still exploits the information along optimization path by adapting the batch size via history stochastic gradients. We further theoretically show that such a scheme substantially reduces the overall complexity for popular variance-reduced algorithms SVRG and SARAH/SPIDER for both conventional nonconvex optimization and reinforcement learning problems. To this end, we develop a new convergence analysis framework to handle the dependence of the batch size on history stochastic gradients. Extensive experiments validate the effectiveness of the proposed batch-size adaptation scheme.

preprint2020arXiv

Hunting potassium geoneutrinos with liquid scintillator Cherenkov neutrino detectors

The research of geoneutrino is a new interdisciplinary subject of particle experiments and geo-science. Potassium-40 ($^\text{40}$K) decays contribute roughly 1/3 of the radiogenic heat of the Earth, but it is still missing from the experimental observation. Solar neutrino experiments with liquid scintillators have observed uranium and thorium geoneutrinos and are the most promising in the low-background neutrino detection. In this article, we present the new concept of using liquid-scintillator Cherenkov detectors to detect the neutrino-electron elastic scattering process of $^\text{40}$K geoneutrinos. Liquid-scintillator Cherenkov detectors using a slow liquid scintillator can achieve this goal with both energy and direction measurements for charged particles. Given the directionality, we can significantly suppress the dominant intrinsic background originating from solar neutrinos in conventional liquid-scintillator detectors. We simulated the solar- and geo-neutrino scatterings in the slow liquid scintillator detector, and implemented energy and directional reconstructions for the recoiling electrons. We found that $^\text{40}$K geoneutrinos can be detected with three standard deviation accuracy in a kiloton-scale detector.

preprint2020arXiv

Non-asymptotic Convergence Analysis of Two Time-scale (Natural) Actor-Critic Algorithms

As an important type of reinforcement learning algorithms, actor-critic (AC) and natural actor-critic (NAC) algorithms are often executed in two ways for finding optimal policies. In the first nested-loop design, actor&#39;s one update of policy is followed by an entire loop of critic&#39;s updates of the value function, and the finite-sample analysis of such AC and NAC algorithms have been recently well established. The second two time-scale design, in which actor and critic update simultaneously but with different learning rates, has much fewer tuning parameters than the nested-loop design and is hence substantially easier to implement. Although two time-scale AC and NAC have been shown to converge in the literature, the finite-sample convergence rate has not been established. In this paper, we provide the first such non-asymptotic convergence rate for two time-scale AC and NAC under Markovian sampling and with actor having general policy class approximation. We show that two time-scale AC requires the overall sample complexity at the order of $\mathcal{O}(ε^{-2.5}\log^3(ε^{-1}))$ to attain an $ε$-accurate stationary point, and two time-scale NAC requires the overall sample complexity at the order of $\mathcal{O}(ε^{-4}\log^2(ε^{-1}))$ to attain an $ε$-accurate global optimal point. We develop novel techniques for bounding the bias error of the actor due to dynamically changing Markovian sampling and for analyzing the convergence rate of the linear critic with dynamically changing base functions and transition kernel.

preprint2020arXiv

Nonequilibrium quasistationary spin disordered state in the Kitaev-Heisenberg magnet $α$-RuCl$_3$

Excitation by light pulses enables the manipulation of phases of quantum condensed matter. Here, we photoexcite high-energy holon-doublon pairs as a way to alter the magnetic free energy landscape of the Kitaev-Heisenberg magnet $α$-RuCl$_3$, with the aim to dynamically stabilize a proximate spin liquid phase. The holon-doublon pair recombination through multimagnon emission is tracked through the time-evolution of the magnetic linear dichroism originating from the competing zigzag spin ordered ground state. A small holon-doublon density suffices to reach a spin disordered state. The phase transition is described within a dynamic Ginzburg-Landau framework, corroborating the quasistationary nature of the transient spin disordered phase. Our work provides insight into the coupling between the electronic and magnetic degrees of freedom in $α$-RuCl$_3$ and suggests a new route to reach a proximate spin liquid phase in Kitaev-Heisenberg magnets.

preprint2020arXiv

Observation of E8 Particles in an Ising Chain Antiferromagnet

Near the transverse-field induced quantum critical point of the Ising chain, an exotic dynamic spectrum consisting of exactly eight particles was predicted, which is uniquely described by an emergent quantum integrable field theory with the symmetry of the $E_8$ Lie algebra, but rarely explored experimentally. Here we use high-resolution terahertz spectroscopy to resolve quantum spin dynamics of the quasi-one-dimensional Ising antiferromagnet BaCo$_2$V$_2$O$_8$ in an applied transverse field. By comparing to an analytical calculation of the dynamical spin correlations, we identify $E_8$ particles as well as their two-particle excitations.

preprint2020arXiv

On the Allowable or Forbidden Nature of Vapor-Deposited Glasses

Vapor deposition can yield glasses that are more stable than those obtained by the traditional melt-quenching route. However, it remains unclear whether vapor-deposited glasses are &#34;allowable&#34; or &#34;forbidden,&#34; that is, if they are equivalent to glasses formed by cooling extremely slowly a liquid or if they differ in nature from melt-quenched glasses. Here, based on reactive molecular dynamics simulation (MD) of silica glasses, we demonstrate that the allowable or forbidden nature of vapor-deposited glasses depends on the temperature of the substrate and, in turn, is found to be encoded in their medium-range order structure.

preprint2020arXiv

Phase-resolved Higgs response in superconducting cuprates

In high energy physics, the Higgs field couples to gauge bosons and fermions and gives mass to their elementary excitations. Experimentally, such couplings can be inferred from the decay product of the Higgs boson, i.e. the scalar (amplitude) excitation of the Higgs field. In superconductors, Cooper pairs bear a close analogy to the Higgs field. Interaction between the Cooper pairs and other degrees of freedom provides dissipation channel for the amplitude mode, which may reveal important information about the microscopic pairing mechanism. To this end, we investigate the Higgs (amplitude) mode of several cuprate thin films using phase-resolved terahertz third harmonic generation (THG). In addition to the heavily damped Higgs mode itself, we observe a universal jump in the phase of the driven Higgs oscillation as well as a non-vanishing THG above Tc. These findings indicate coupling of the Higgs mode to other collective modes and potentially a nonzero pairing amplitude above Tc.

preprint2020arXiv

Predicting Camera Viewpoint Improves Cross-dataset Generalization for 3D Human Pose Estimation

Monocular estimation of 3d human pose has attracted increased attention with the availability of large ground-truth motion capture datasets. However, the diversity of training data available is limited and it is not clear to what extent methods generalize outside the specific datasets they are trained on. In this work we carry out a systematic study of the diversity and biases present in specific datasets and its effect on cross-dataset generalization across a compendium of 5 pose datasets. We specifically focus on systematic differences in the distribution of camera viewpoints relative to a body-centered coordinate frame. Based on this observation, we propose an auxiliary task of predicting the camera viewpoint in addition to pose. We find that models trained to jointly predict viewpoint and pose systematically show significantly improved cross-dataset generalization.

preprint2020arXiv

Proximal Gradient Algorithm with Momentum and Flexible Parameter Restart for Nonconvex Optimization

Various types of parameter restart schemes have been proposed for accelerated gradient algorithms to facilitate their practical convergence in convex optimization. However, the convergence properties of accelerated gradient algorithms under parameter restart remain obscure in nonconvex optimization. In this paper, we propose a novel accelerated proximal gradient algorithm with parameter restart (named APG-restart) for solving nonconvex and nonsmooth problems. Our APG-restart is designed to 1) allow for adopting flexible parameter restart schemes that cover many existing ones; 2) have a global sub-linear convergence rate in nonconvex and nonsmooth optimization; and 3) have guaranteed convergence to a critical point and have various types of asymptotic convergence rates depending on the parameterization of local geometry in nonconvex and nonsmooth optimization. Numerical experiments demonstrate the effectiveness of our proposed algorithm.

preprint2020arXiv

Reanalysis of Variance Reduced Temporal Difference Learning

Temporal difference (TD) learning is a popular algorithm for policy evaluation in reinforcement learning, but the vanilla TD can substantially suffer from the inherent optimization variance. A variance reduced TD (VRTD) algorithm was proposed by Korda and La (2015), which applies the variance reduction technique directly to the online TD learning with Markovian samples. In this work, we first point out the technical errors in the analysis of VRTD in Korda and La (2015), and then provide a mathematically solid analysis of the non-asymptotic convergence of VRTD and its variance reduction performance. We show that VRTD is guaranteed to converge to a neighborhood of the fixed-point solution of TD at a linear convergence rate. Furthermore, the variance error (for both i.i.d.\ and Markovian sampling) and the bias error (for Markovian sampling) of VRTD are significantly reduced by the batch size of variance reduction in comparison to those of vanilla TD. As a result, the overall computational complexity of VRTD to attain a given accurate solution outperforms that of TD under Markov sampling and outperforms that of TD under i.i.d.\ sampling for a sufficiently small conditional number.

preprint2020arXiv

Resisting Crowd Occlusion and Hard Negatives for Pedestrian Detection in the Wild

Pedestrian detection has been heavily studied in the last decade due to its wide application. Despite incremental progress, crowd occlusion and hard negatives are still challenging current state-of-the-art pedestrian detectors. In this paper, we offer two approaches based on the general region-based detection framework to tackle these challenges. Specifically, to address the occlusion, we design a novel coulomb loss as a regulator on bounding box regression, in which proposals are attracted by their target instance and repelled by the adjacent non-target instances. For hard negatives, we propose an efficient semantic-driven strategy for selecting anchor locations, which can sample informative negative examples at training phase for classification refinement. It is worth noting that these methods can also be applied to general object detection domain, and trainable in an end-to-end manner. We achieves consistently high performance on the Caltech-USA and CityPersons benchmarks.

preprint2020arXiv

Search-based User Interest Modeling with Lifelong Sequential Behavior Data for Click-Through Rate Prediction

Rich user behavior data has been proven to be of great value for click-through rate prediction tasks, especially in industrial applications such as recommender systems and online advertising. Both industry and academy have paid much attention to this topic and propose different approaches to modeling with long sequential user behavior data. Among them, memory network based model MIMN proposed by Alibaba, achieves SOTA with the co-design of both learning algorithm and serving system. MIMN is the first industrial solution that can model sequential user behavior data with length scaling up to 1000. However, MIMN fails to precisely capture user interests given a specific candidate item when the length of user behavior sequence increases further, say, by 10 times or more. This challenge exists widely in previously proposed approaches. In this paper, we tackle this problem by designing a new modeling paradigm, which we name as Search-based Interest Model (SIM). SIM extracts user interests with two cascaded search units: (i) General Search Unit acts as a general search from the raw and arbitrary long sequential behavior data, with query information from candidate item, and gets a Sub user Behavior Sequence which is relevant to candidate item; (ii) Exact Search Unit models the precise relationship between candidate item and SBS. This cascaded search paradigm enables SIM with a better ability to model lifelong sequential behavior data in both scalability and accuracy. Apart from the learning algorithm, we also introduce our hands-on experience on how to implement SIM in large scale industrial systems. Since 2019, SIM has been deployed in the display advertising system in Alibaba, bringing 7.1\% CTR and 4.4\% RPM lift, which is significant to the business. Serving the main traffic in our real system now, SIM models user behavior data with maximum length reaching up to 54000, pushing SOTA to 54x.

preprint2020arXiv

SegVoxelNet: Exploring Semantic Context and Depth-aware Features for 3D Vehicle Detection from Point Cloud

3D vehicle detection based on point cloud is a challenging task in real-world applications such as autonomous driving. Despite significant progress has been made, we observe two aspects to be further improved. First, the semantic context information in LiDAR is seldom explored in previous works, which may help identify ambiguous vehicles. Second, the distribution of point cloud on vehicles varies continuously with increasing depths, which may not be well modeled by a single model. In this work, we propose a unified model SegVoxelNet to address the above two problems. A semantic context encoder is proposed to leverage the free-of-charge semantic segmentation masks in the bird&#39;s eye view. Suspicious regions could be highlighted while noisy regions are suppressed by this module. To better deal with vehicles at different depths, a novel depth-aware head is designed to explicitly model the distribution differences and each part of the depth-aware head is made to focus on its own target detection range. Extensive experiments on the KITTI dataset show that the proposed method outperforms the state-of-the-art alternatives in both accuracy and efficiency with point cloud as input only.

preprint2020arXiv

SpiderBoost and Momentum: Faster Stochastic Variance Reduction Algorithms

SARAH and SPIDER are two recently developed stochastic variance-reduced algorithms, and SPIDER has been shown to achieve a near-optimal first-order oracle complexity in smooth nonconvex optimization. However, SPIDER uses an accuracy-dependent stepsize that slows down the convergence in practice, and cannot handle objective functions that involve nonsmooth regularizers. In this paper, we propose SpiderBoost as an improved scheme, which allows to use a much larger constant-level stepsize while maintaining the same near-optimal oracle complexity, and can be extended with proximal mapping to handle composite optimization (which is nonsmooth and nonconvex) with provable convergence guarantee. In particular, we show that proximal SpiderBoost achieves an oracle complexity of $\mathcal{O}(\min\{n^{1/2}ε^{-2},ε^{-3}\})$ in composite nonconvex optimization, improving the state-of-the-art result by a factor of $\mathcal{O}(\min\{n^{1/6},ε^{-1/3}\})$. We further develop a novel momentum scheme to accelerate SpiderBoost for composite optimization, which achieves the near-optimal oracle complexity in theory and substantial improvement in experiments.

preprint2020arXiv

TAO Conceptual Design Report: A Precision Measurement of the Reactor Antineutrino Spectrum with Sub-percent Energy Resolution

The Taishan Antineutrino Observatory (TAO, also known as JUNO-TAO) is a satellite experiment of the Jiangmen Underground Neutrino Observatory (JUNO). A ton-level liquid scintillator detector will be placed at about 30 m from a core of the Taishan Nuclear Power Plant. The reactor antineutrino spectrum will be measured with sub-percent energy resolution, to provide a reference spectrum for future reactor neutrino experiments, and to provide a benchmark measurement to test nuclear databases. A spherical acrylic vessel containing 2.8 ton gadolinium-doped liquid scintillator will be viewed by 10 m^2 Silicon Photomultipliers (SiPMs) of >50% photon detection efficiency with almost full coverage. The photoelectron yield is about 4500 per MeV, an order higher than any existing large-scale liquid scintillator detectors. The detector operates at -50 degree C to lower the dark noise of SiPMs to an acceptable level. The detector will measure about 2000 reactor antineutrinos per day, and is designed to be well shielded from cosmogenic backgrounds and ambient radioactivities to have about 10% background-to-signal ratio. The experiment is expected to start operation in 2022.

preprint2020arXiv

Towards Reducing Severe Defocus Spread Effects for Multi-Focus Image Fusion via an Optimization Based Strategy

Multi-focus image fusion (MFF) is a popular technique to generate an all-in-focus image, where all objects in the scene are sharp. However, existing methods pay little attention to defocus spread effects of the real-world multi-focus images. Consequently, most of the methods perform badly in the areas near focus map boundaries. According to the idea that each local region in the fused image should be similar to the sharpest one among source images, this paper presents an optimization-based approach to reduce defocus spread effects. Firstly, a new MFF assessmentmetric is presented by combining the principle of structure similarity and detected focus maps. Then, MFF problem is cast into maximizing this metric. The optimization is solved by gradient ascent. Experiments conducted on the real-world dataset verify superiority of the proposed model. The codes are available at https://github.com/xsxjtu/MFF-SSIM.

preprint2020arXiv

ViTAA: Visual-Textual Attributes Alignment in Person Search by Natural Language

Person search by natural language aims at retrieving a specific person in a large-scale image pool that matches the given textual descriptions. While most of the current methods treat the task as a holistic visual and textual feature matching one, we approach it from an attribute-aligning perspective that allows grounding specific attribute phrases to the corresponding visual regions. We achieve success as well as the performance boosting by a robust feature learning that the referred identity can be accurately bundled by multiple attribute visual cues. To be concrete, our Visual-Textual Attribute Alignment model (dubbed as ViTAA) learns to disentangle the feature space of a person into subspaces corresponding to attributes using a light auxiliary attribute segmentation computing branch. It then aligns these visual features with the textual attributes parsed from the sentences by using a novel contrastive learning loss. Upon that, we validate our ViTAA framework through extensive experiments on tasks of person search by natural language and by attribute-phrase queries, on which our system achieves state-of-the-art performances. Code will be publicly available upon publication.

preprint2020arXiv

Weak Supervision and Referring Attention for Temporal-Textual Association Learning

A system capturing the association between video frames and textual queries offer great potential for better video analysis. However, training such a system in a fully supervised way inevitably demands a meticulously curated video dataset with temporal-textual annotations. Therefore we provide a Weak-Supervised alternative with our proposed Referring Attention mechanism to learn temporal-textual association (dubbed WSRA). The weak supervision is simply a textual expression (e.g., short phrases or sentences) at video level, indicating this video contains relevant frames. The referring attention is our designed mechanism acting as a scoring function for grounding the given queries over frames temporally. It consists of multiple novel losses and sampling strategies for better training. The principle in our designed mechanism is to fully exploit 1) the weak supervision by considering informative and discriminative cues from intra-video segments anchored with the textual query, 2) multiple queries compared to the single video, and 3) cross-video visual similarities. We validate our WSRA through extensive experiments for temporally grounding by languages, demonstrating that it outperforms the state-of-the-art weakly-supervised methods notably.

preprint2019arXiv

A compact and efficient three-dimensional microfluidic mixer

Microfluidic mixing is a fundamental functionality in most lab on a chip (LOC) systems,whereas realization of efficient mixing is challenging in microfluidic channels due to the small Reynolds numbers. Here, we design and fabricate a compact three-dimensional (3D) micromixer to enable efficient mixing at various flow rates. The performance of the fabricated micromixer was examined using blue and red inks. The extreme flexibility in fabricating microfluidic structures of arbitrary 3D geometries using femtosecond laser micromachining allows us to tackle the major disadvantageous effects for optimizing the mixing efficiency.

preprint2019arXiv

Coordinate-wise descent methods for leading eigenvalue problem

Leading eigenvalue problems for large scale matrices arise in many applications. Coordinate-wise descent methods are considered in this work for such problems based on a reformulation of the leading eigenvalue problem as a non-convex optimization problem. The convergence of several coordinate-wise methods is analyzed and compared. Numerical examples of applications to quantum many-body problems demonstrate the efficiency and provide benchmarks of the proposed coordinate-wise descent methods.

preprint2019arXiv

Determining the phase diagram of atomically thin layered antiferromagnet CrCl$_3$

Changes in the spin configuration of atomically-thin, magnetic van-der-Waals multilayers can cause drastic modifications in their opto-electronic properties. Conversely, the opto-electronic response of these systems provides information about the magnetic state, very difficult to obtain otherwise. Here we show that in CrCl$_3$ multilayers, the dependence of the tunnelling conductance on applied magnetic field ($H$), temperature ($T$), and number of layers ($N$) tracks the evolution of the magnetic state, enabling the magnetic phase diagram of these systems to be determined experimentally. Besides a high-field spin-flip transition occurring for all thicknesses, the in-plane magnetoconductance exhibits an even-odd effect due to a low-field spin-flop transition. If the layer number $N$ is even, the transition occurs at $μ_0 H \sim 0$ T due to the very small in-plane magnetic anisotropy, whereas for odd $N$ the net magnetization of the uncompensated layer causes the transition to occur at finite $H$. Through a quantitative analysis of the phenomena, we determine the interlayer exchange coupling as well as the staggered magnetization, and show that in CrCl$_3$ shape anisotropy dominates. Our results reveal the rich behaviour of atomically-thin layered antiferromagnets with weak magnetic anisotropy.

preprint2019arXiv

Dispersions of Many-Body Bethe strings

Complex bound states of magnetic excitations, known as Bethe string, were predicted almost a century ago to exist in one-dimensional quantum magnets 1. The dispersions of the string states have so far remained the subject of intensive theoretical studies 2-7. By performing neutron scattering experiments on the one-dimensional Heisenberg-Ising antiferromagnet SrCo2V2O8 in high longitudinal magnetic fields, we reveal in detail the dispersion relations of the string states over the full Brillouin zone, as well as their magnetic field dependences. Furthermore the characteristic energy, the scattering intensity and linewidth of the observed string states exhibit excellent agreement with our precise Bethe Ansatz calculations. Our results establish the important role of string states in the quantum spin dynamics of one-dimensional systems, and will invoke studies of their dynamical properties in more general many-body systems.

preprint2019arXiv

High-Field Quantum Disordered State in $α$-RuCl3: Spin Flips, Bound States, and a Multi-Particle Continuum

Layered $α$-RuCl3 has been discussed as a proximate Kitaev spin liquid compound. Raman and THz spectroscopy of magnetic excitations confirm that the low-temperature antiferromagnetic ordered phase features a broad Raman continuum, together with two magnon-like excitations at 2.7 and 3.6 meV, respectively. The continuum strength is maximized as long-range order is suppressed by an external magnetic field. The state above the field-induced quantum phase transition around 7.5 T is characterized by a gapped multi-particle continuum out of which a two-particle bound state emerges, together with a well-defined single-particle excitation at lower energy. Exact diagonalization calculations demonstrate that Kitaev and off-diagonal exchange terms in the Fleury-Loudon operator are crucial for the occurrence of these features in the Raman spectra. Our study firmly establishes the partially-polarized quantum disordered character of the high-field phase.

preprint2019arXiv

Model-free posterior inference on the area under the receiver operating characteristic curve

The area under the receiver operating characteristic curve (AUC) serves as a summary of a binary classifier&#39;s performance. Methods for estimating the AUC have been developed under a binormality assumption which restricts the distribution of the score produced by the classifier. However, this assumption introduces an infinite-dimensional nuisance parameter and can be inappropriate, especially in the context of machine learning. This motivates us to adopt a model-free Gibbs posterior distribution for the AUC. We present the asymptotic Gibbs posterior concentration rate, and a strategy for tuning the learning rate so that the corresponding credible intervals achieve the nominal frequentist coverage probability. Simulation experiments and a real data analysis demonstrate the Gibbs posterior&#39;s strong performance compared to existing methods based on a rank likelihood.

preprint2019arXiv

Non-perturbative high-harmonic generation in the three-dimensional Dirac semimetal Cd$_3$As$_2$

Harmonic generation is a general characteristic of driven nonlinear systems, and serves as an efficient tool for investigating the fundamental principles that govern the ultrafast nonlinear dynamics. In atomic gases, high-harmonic radiation is produced via a three-step process of ionization, acceleration, and recollision by strong-field infrared laser. This mechanism has been intensively investigated in the extreme ultraviolet and soft X-ray regions, forming the basis of attosecond research. In solid-state materials, which are characterized by crystalline symmetry and strong interactions, yielding of harmonics has just recently been reported. The observed high-harmonic generation was interpreted with fundamentally different mechanisms, such as interband tunneling combined with dynamical Bloch oscillations, intraband thermodynamics and nonlinear dynamics, and many-body electronic interactions. Here, in a distinctly different context of three-dimensional Dirac semimetal, we report on experimental observation of high-harmonic generation up to the seventh order driven by strong-field terahertz pulses. The observed non-perturbative high-harmonic generation is interpreted as a generic feature of terahertz-field driven nonlinear intraband kinetics of Dirac fermions. We anticipate that our results will trigger great interest in detection, manipulation, and coherent control of the nonlinear response in the vast family of three-dimensional Dirac and Weyl materials.

preprint2019arXiv

Spin-flop transition in atomically thin MnPS$_3$ crystals

The magnetic state of atomically thin semiconducting layered antiferromagnets such as CrI$_3$ and CrCl$_3$ can be probed by forming tunnel barriers and measuring their resistance as a function of magnetic field ($H$) and temperature ($T$). This is possible because the tunneling magnetoresistance originates from a spin-filtering effect sensitive to the relative orientation of the magnetization in different layers, i.e., to the magnetic state of the multilayers. For systems in which antiferromagnetism occurs within an individual layer, however, no spin-filtering occurs: it is unclear whether this strategy can work. To address this issue, we investigate tunnel transport through atomically thin crystals of MnPS$_3$, a van der Waals semiconductor that in the bulk exhibits easy-axis antiferromagnetic order within the layers. For thick multilayers below $T\simeq 78$ K, a $T$-dependent magnetoresistance sets-in at $\sim 5$ T, and is found to track the boundary between the antiferromagnetic and the spin-flop phases known from bulk magnetization measurements. The magnetoresistance persists down to individual MnPS$_3$ monolayers with nearly unchanged characteristic temperature and magnetic field scales, albeit with a different dependence on $H$. We discuss the implications of these finding for the magnetic state of atomically thin MnPS$_3$ crystals, conclude that antiferromagnetic correlations persist down to the level of individual monolayers, and that tunneling magnetoresistance does allow magnetism in 2D insulating materials to be detected even in the absence of spin-filtering.

preprint2019arXiv

Two-dimensional Ferromagnetic van der Waals CrX3 (X=Cl, Br, I) Monolayers with Enhanced Anisotropy and Curie Temperature

Among the recently widely studied van der Waals layered magnets CrX3 (X=Cl, Br, I), CrCl3 monolayer (ML) is particularly puzzling as it is solely shown by experiments to have an in-plane magnetic easy axis and, furthermore, all of previous first-principles calculation results contradict this. Through systematical first-principles calculations,we unveil that its in-plane shape anisotropy that dominates over its weak perpendicular magnetocrystalline anisotropy is responsible for the in-plane magnetic easy axis of CrCl3 ML. To tune the in-plane ferromagnetism of CrCl3 ML into the desirable perpendicular one, we propose substituting Cr with isovalent tungsten (W). We find that CrWCl6 has a strong perpendicular magnetic anisotropy and a high Curie temperature up to 76 K. Our work not only gives insight into understanding the two-dimensional ferromagnetism of van der Waals MLs but also sheds new light on engineering their performances for nanodevices.

preprint2008arXiv

Holomorphic Motions and Related Topics

In this article we give an expository account of the holomorphic motion theorem based on work of Màñé-Sad-Sullivan, Bers-Royden, and Chirka. After proving this theorem, we show that tangent vectors to holomorphic motions have $|ε\log ε|$ moduli of continuity and then show how this type of continuity for tangent vectors can be combined with Schwarz&#39;s lemma and integration over the holomorphic variable to produce Hölder continuity on the mappings. We also prove, by using holomorphic motions, that Kobayashi&#39;s and Teichmüller&#39;s metrics on the Teichmüller space of a Riemann surface coincide. Finally, we present an application of holomorphic motions to complex dynamics, that is, we prove the Fatou linearization theorem for parabolic germs by involving holomorphic motions.