arXiv subjects

Chao Zhang

Publications and source records attributed to Chao Zhang.

At least 667 records · Page 37Linked to original sources

arXiv2023

Extremely strong coupling s-wave superconductivity in the medium-entropy alloy TiHfNbTa

Here we report a TiHfNbTa bulk medium-entropy alloy (MEA) superconductor crystallized in the body-centered cubic structure, which is synthesized by an arc melting method. Superconducting properties of the TiHfNbTa are studied by employing magnetic susceptibility, resistivity, and specific heat measurements. Experimental results show a bulk superconducting transition temperature (Tc) of around 6.75 K. The lower and upper crit-ical fields for TiHfNbTa are 45.8 mT and 10.46 T, respectively. First-principles calculations show that the d electron of Ti, Hf, Nb, and Ta is the main contribution near the Fermi level. Our results indicate that the superconductivity is a conven-tional s-wave type with extremely strong coupling. The extremely strong coupling behavior in the s-wave type TiHfNbTa MEA superconductor is unusual because it generally happens in cuprates, pnictides, and other unconventional superconductors.

cond-mat.supr-con↗

arXiv2023

Multiscale modeling of thermal properties in Polyurethane incorporated with phase change materials composites: A case study

Polyurethane (PU) is an ideal thermal insulation material due to its excellent thermal properties. The incorporation of Phase Change Materials (PCMs) capsules into Polyurethane (PU) has been shown to be effective in building envelopes. This design can significantly increase the stability of the indoor thermal environment and reduce the fluctuation of indoor air temperature. We develop a multiscale model of a PU-PCM foam composite and study the thermal conductivity of this material. Later, the design of materials can be optimized by obtaining thermal conductivity. We conduct a case study based on the performance of this optimized material to fully consider the thermal comfort of the occupants of a building envelope with the application of PU-PCMs composites in a single room. At the same time, we also predict the energy consumption of this case. All the outcomes show that this design is promising, enabling the passive design of building energy and significantly improving occupants' comfort.

cs.CE↗

arXiv2023

kTrans: Knowledge-Aware Transformer for Binary Code Embedding

Binary Code Embedding (BCE) has important applications in various reverse engineering tasks such as binary code similarity detection, type recovery, control-flow recovery and data-flow analysis. Recent studies have shown that the Transformer model can comprehend the semantics of binary code to support downstream tasks. However, existing models overlooked the prior knowledge of assembly language. In this paper, we propose a novel Transformer-based approach, namely kTrans, to generate knowledge-aware binary code embedding. By feeding explicit knowledge as additional inputs to the Transformer, and fusing implicit knowledge with a novel pre-training task, kTrans provides a new perspective to incorporating domain knowledge into a Transformer framework. We inspect the generated embeddings with outlier detection and visualization, and also apply kTrans to 3 downstream tasks: Binary Code Similarity Detection (BCSD), Function Type Recovery (FTR) and Indirect Call Recognition (ICR). Evaluation results show that kTrans can generate high-quality binary code embeddings, and outperforms state-of-the-art (SOTA) approaches on downstream tasks by 5.2%, 6.8%, and 12.6% respectively. kTrans is publicly available at: https://github.com/Learner0x5a/kTrans-release

cs.SE↗

arXiv2023

May the Force be with You: Unified Force-Centric Pre-Training for 3D Molecular Conformations

Recent works have shown the promise of learning pre-trained models for 3D molecular representation. However, existing pre-training models focus predominantly on equilibrium data and largely overlook off-equilibrium conformations. It is challenging to extend these methods to off-equilibrium data because their training objective relies on assumptions of conformations being the local energy minima. We address this gap by proposing a force-centric pretraining model for 3D molecular conformations covering both equilibrium and off-equilibrium data. For off-equilibrium data, our model learns directly from their atomic forces. For equilibrium data, we introduce zero-force regularization and forced-based denoising techniques to approximate near-equilibrium forces. We obtain a unified pre-trained model for 3D molecular representation with over 15 million diverse conformations. Experiments show that, with our pre-training objective, we increase forces accuracy by around 3 times compared to the un-pre-trained Equivariant Transformer model. By incorporating regularizations on equilibrium data, we solved the problem of unstable MD simulations in vanilla Equivariant Transformers, achieving state-of-the-art simulation performance with 2.45 times faster inference time than NequIP. As a powerful molecular encoder, our pre-trained model achieves on-par performance with state-of-the-art property prediction tasks.

physics.chem-ph↗

arXiv2023

Effect of dispersive optical phonons on the properties of Bond Su-Schrieffer-Heeger polaron

We use a newly developed quantum Monte Carlo method to investigate the impact of finite dispersion of the optical phonon mode on the properties of the bond Su-Schrieffer-Heeger polaron in two dimensions. We compare the properties of the bond polaron, such as effective mass, ground state energy, and Z factor, with and without positive phonon bandwidth. Our findings reveal that when we exclude phonon dispersion, at the same electron-phonon coupling strength, the effective mass increases as the phonon frequency decreases, indicating a heavier polaron in the deep adiabatic regime. However, in the dispersive case, we observe that the effective mass increases as the phonon bandwidth increases. Moreover, we notice a crossover from a light polaron state to a heavy polaron state in the deep adiabatic regime for both the dispersionless and dispersive cases.

cond-mat.str-el↗

arXiv2023

TrajectoryFormer: 3D Object Tracking Transformer with Predictive Trajectory Hypotheses

3D multi-object tracking (MOT) is vital for many applications including autonomous driving vehicles and service robots. With the commonly used tracking-by-detection paradigm, 3D MOT has made important progress in recent years. However, these methods only use the detection boxes of the current frame to obtain trajectory-box association results, which makes it impossible for the tracker to recover objects missed by the detector. In this paper, we present TrajectoryFormer, a novel point-cloud-based 3D MOT framework. To recover the missed object by detector, we generates multiple trajectory hypotheses with hybrid candidate boxes, including temporally predicted boxes and current-frame detection boxes, for trajectory-box association. The predicted boxes can propagate object's history trajectory information to the current frame and thus the network can tolerate short-term miss detection of the tracked objects. We combine long-term object motion feature and short-term object appearance feature to create per-hypothesis feature embedding, which reduces the computational overhead for spatial-temporal encoding. Additionally, we introduce a Global-Local Interaction Module to conduct information interaction among all hypotheses and models their spatial relations, leading to accurate estimation of hypotheses. Our TrajectoryFormer achieves state-of-the-art performance on the Waymo 3D MOT benchmarks. Code is available at https://github.com/poodarchu/EFG .

cs.CV↗

arXiv2023

Constructing projective resolution and taking cohomology for gentle algebras in the geometric model

The geometric models for the module category and derived category of any gentle algebra were introduced to realize the objects in module category and derived category by permissible curves and admissible curves respectively. The present paper firstly unifies these two realizations of objects in module category and derived category via same surface for any gentle algebra, by the rotation of permissible curves corresponding to the objects in the module category. Secondly, the geometric characterization of the cohomology of complexes over gentle algebras is established by the truncation of projective permissible curves. It is worth mentioning that the rotation of permissible curves and the truncation of projective permissible curves are mutually inverse processes to some extent. As applications, an alternative proof of ``no gaps" theorem as to cohomological length for the bounded derived categories of gentle algebras is provided in terms of the geometric characterization of the cohomology of complexes. Moreover, we obtain a geometric proof for the strong Nakayama conjecture for gentle algebras. Finally, we contain two examples to illustrate our results.

math.RT↗

arXiv2023

Integrating Emotion Recognition with Speech Recognition and Speaker Diarisation for Conversations

Although automatic emotion recognition (AER) has recently drawn significant research interest, most current AER studies use manually segmented utterances, which are usually unavailable for dialogue systems. This paper proposes integrating AER with automatic speech recognition (ASR) and speaker diarisation (SD) in a jointly-trained system. Distinct output layers are built for four sub-tasks including AER, ASR, voice activity detection and speaker classification based on a shared encoder. Taking the audio of a conversation as input, the integrated system finds all speech segments and transcribes the corresponding emotion classes, word sequences, and speaker identities. Two metrics are proposed to evaluate AER performance with automatic segmentation based on time-weighted emotion and speaker classification errors. Results on the IEMOCAP dataset show that the proposed system consistently outperforms two baselines with separately trained single-task systems on AER, ASR and SD.

eess.AS↗

arXiv2023

Clock Factorized Quantum Monte Carlo Method for Long-range Interacting Systems

Simulating long-range interacting systems is a challenging task due to its computational complexity that the computational effort for each local update is of order $\cal{O}$$(N)$, where $N$ is the size of system. Recently, a technique, called hereby the clock factorized quantum Monte Carlo method, was developed on the basis of the so-called factorized Metropolis filter [Phys. Rev. E 99 010105 (2019)]. In this work, we first explain step by step how the clock factorized quantum Monte Carlo method is implemented to reduce the computational overhead from $\cal{O}$$(N)$ to $\cal{O}$(1). In particular, the core ingredients, including the concepts of bound probabilities and bound rejection events, the tree-like data structure, and the fast algorithms for sampling an extensive set of discrete and small probabilities, are elaborated. Next, we show how the clock factorized quantum Monte Carlo method can be flexibly implemented in various update strategies, like the Metropolis and worm-type algorithms, and can be generalized to simulate quantum systems. Finally, we demonstrate the high efficiency of the clock factorized quantum Monte Carlo algorithms in the examples of the quantum Ising model and the Bose-Hubbard model with long-range interactions and/or long-range hopping amplitudes. We expect that the clock factorized quantum Monte Carlo algorithms would find broad applications in statistical and condensed-matter physics.

physics.comp-ph↗

arXiv2023

One-bit Flip is All You Need: When Bit-flip Attack Meets Model Training

Deep neural networks (DNNs) are widely deployed on real-world devices. Concerns regarding their security have gained great attention from researchers. Recently, a new weight modification attack called bit flip attack (BFA) was proposed, which exploits memory fault inject techniques such as row hammer to attack quantized models in the deployment stage. With only a few bit flips, the target model can be rendered useless as a random guesser or even be implanted with malicious functionalities. In this work, we seek to further reduce the number of bit flips. We propose a training-assisted bit flip attack, in which the adversary is involved in the training stage to build a high-risk model to release. This high-risk model, obtained coupled with a corresponding malicious model, behaves normally and can escape various detection methods. The results on benchmark datasets show that an adversary can easily convert this high-risk but normal model to a malicious one on victim's side by \textbf{flipping only one critical bit} on average in the deployment stage. Moreover, our attack still poses a significant threat even when defenses are employed. The codes for reproducing main experiments are available at \url{https://github.com/jianshuod/TBA}.

cs.CR↗

arXiv2023

Alexa, play with robot: Introducing the First Alexa Prize SimBot Challenge on Embodied AI

The Alexa Prize program has empowered numerous university students to explore, experiment, and showcase their talents in building conversational agents through challenges like the SocialBot Grand Challenge and the TaskBot Challenge. As conversational agents increasingly appear in multimodal and embodied contexts, it is important to explore the affordances of conversational interaction augmented with computer vision and physical embodiment. This paper describes the SimBot Challenge, a new challenge in which university teams compete to build robot assistants that complete tasks in a simulated physical environment. This paper provides an overview of the SimBot Challenge, which included both online and offline challenge phases. We describe the infrastructure and support provided to the teams including Alexa Arena, the simulated environment, and the ML toolkit provided to teams to accelerate their building of vision and language models. We summarize the approaches the participating teams took to overcome research challenges and extract key lessons learned. Finally, we provide analysis of the performance of the competing SimBots during the competition.

cs.HC↗

arXiv2023

Graph Neural Networks for Forecasting Multivariate Realized Volatility with Spillover Effects

We present a novel methodology for modeling and forecasting multivariate realized volatilities using customized graph neural networks to incorporate spillover effects across stocks. The proposed model offers the benefits of incorporating spillover effects from multi-hop neighbors, capturing nonlinear relationships, and flexible training with different loss functions. Our empirical findings provide compelling evidence that incorporating spillover effects from multi-hop neighbors alone does not yield a clear advantage in terms of predictive accuracy. However, modeling nonlinear spillover effects enhances the forecasting accuracy of realized volatilities, particularly for short-term horizons of up to one week. Moreover, our results consistently indicate that training with the Quasi-likelihood loss leads to substantial improvements in model performance compared to the commonly-used mean squared error. A comprehensive series of empirical evaluations in alternative settings confirm the robustness of our results.

q-fin.ST↗

arXiv2023

Understanding Deep Neural Networks via Linear Separability of Hidden Layers

In this paper, we measure the linear separability of hidden layer outputs to study the characteristics of deep neural networks. In particular, we first propose Minkowski difference based linear separability measures (MD-LSMs) to evaluate the linear separability degree of two points sets. Then, we demonstrate that there is a synchronicity between the linear separability degree of hidden layer outputs and the network training performance, i.e., if the updated weights can enhance the linear separability degree of hidden layer outputs, the updated network will achieve a better training performance, and vice versa. Moreover, we study the effect of activation function and network size (including width and depth) on the linear separability of hidden layers. Finally, we conduct the numerical experiments to validate our findings on some popular deep networks including multilayer perceptron (MLP), convolutional neural network (CNN), deep belief network (DBN), ResNet, VGGNet, AlexNet, vision transformer (ViT) and GoogLeNet.

cs.LG↗

arXiv2023

Testing alternative theories of gravity with space-based gravitational wave detectors

We use gravitational waves (GWs) from binary black holes (BBHs) and neutron stars inspiraling into intermediate-mass black holes to evaluate how accurately the future space-based GW detectors such as LISA, Taiji and TianQin and their combined networks can determine source parameters and constrain alternative theories of gravity. We find that, compared with single detector, the detector network can greatly improve the estimation errors of source parameters, especially the sky localization, but the improvement of the constraint on the graviton mass $m_g$ and the Brans-Dicke coupling constant $ω_{BD}$ is small. We also consider possible scalar modes existed in alternative theories of gravity and we find the inclusion of the scalar mode has little effect on the constraints on source parameters, $m_g$, and $ω_{BD}$ and the parametrized amplitude $A_B$ of scalar modes are small. For the constraint on the graviton mass, we consider both the effects in the GW phase and the transfer function due to the mass of graviton. With the network of LISA, Taiji and TianQin, we get the lower bound on the graviton Compton wavelength $λ_g\gtrsim 1.24 \times 10^{20}$ m for BBHs with masses $(10^6+10^7)M_\odot$, and $A_B< 5.7\times 10^{-4}$ for BBHs with masses $(1+2)\times 10^5M_\odot$; $ω_{BD}>6.11\times10^{6}$ for neutron star-black hole binary with masses $(1.4+400)M_{\odot}$.

gr-qc↗

arXiv2023

Autoregressive Diffusion Model for Graph Generation

Diffusion-based graph generative models have recently obtained promising results for graph generation. However, existing diffusion-based graph generative models are mostly one-shot generative models that apply Gaussian diffusion in the dequantized adjacency matrix space. Such a strategy can suffer from difficulty in model training, slow sampling speed, and incapability of incorporating constraints. We propose an \emph{autoregressive diffusion} model for graph generation. Unlike existing methods, we define a node-absorbing diffusion process that operates directly in the discrete graph space. For forward diffusion, we design a \emph{diffusion ordering network}, which learns a data-dependent node absorbing ordering from graph topology. For reverse generation, we design a \emph{denoising network} that uses the reverse node ordering to efficiently reconstruct the graph by predicting the node type of the new node and its edges with previously denoised nodes at a time. Based on the permutation invariance of graph, we show that the two networks can be jointly trained by optimizing a simple lower bound of data likelihood. Our experiments on six diverse generic graph datasets and two molecule datasets show that our model achieves better or comparable generation performance with previous state-of-the-art, and meanwhile enjoys fast generation speed.

cs.AI↗

arXiv2023

C3: Zero-shot Text-to-SQL with ChatGPT

This paper proposes a ChatGPT-based zero-shot Text-to-SQL method, dubbed C3, which achieves 82.3\% in terms of execution accuracy on the holdout test set of Spider and becomes the state-of-the-art zero-shot Text-to-SQL method on the Spider Challenge. C3 consists of three key components: Clear Prompting (CP), Calibration with Hints (CH), and Consistent Output (CO), which are corresponding to the model input, model bias and model output respectively. It provides a systematic treatment for zero-shot Text-to-SQL. Extensive experiments have been conducted to verify the effectiveness and efficiency of our proposed method.

cs.CL↗

arXiv2023

Graph Contrastive Learning with Multi-Objective for Personalized Product Retrieval in Taobao Search

In e-commerce search, personalized retrieval is a crucial technique for improving user shopping experience. Recent works in this domain have achieved significant improvements by the representation learning paradigm, e.g., embedding-based retrieval (EBR) and collaborative filtering (CF). EBR methods do not sufficiently exploit the useful collaborative signal and are difficult to learn the representations of long-tail item well. Graph-based CF methods improve personalization by modeling collaborative signal within the user click graph. However, existing Graph-based methods ignore user's multiple behaviours, such as click/purchase and the relevance constraint between user behaviours and items.In this paper, we propose a Graph Contrastive Learning with Multi-Objective (GCL-MO) collaborative filtering model, which solves the problems of weak relevance and incomplete personalization in e-commerce search. Specifically, GCL-MO builds a homogeneous graph of items and then optimizes a multi-objective function of personalization and relevance. Moreover, we propose a modified contrastive loss for multi-objectives graph learning, which avoids the mutual suppression among positive samples and thus improves the generalization and robustness of long-tail item representations. These learned item embeddings are then used for personalized retrieval by constructing an efficient offline-to-online inverted table. GCL-MO outperforms the online collaborative filtering baseline in both offline/online experimental metrics and shows a significant improvement in the online A/B testing of Taobao search.

cs.IR↗

arXiv2023

Experimental verification of bound and multiparticle entanglement with the randomized measurement toolbox

In recent years, analysis methods for quantum states based on randomized measurements have been investigated extensively. Still, in the experimental implementations these methods were typically used for characterizing strongly entangled states and not to analyze the different families of multiparticle or weakly entangled states. In this work, we experimentally prepare various entangled states with path-polarization hyper-entangled photon pairs, and study their entanglement properties using the full toolbox of randomized measurements. First, we successfully characterize the correlations of a series of GHZ-W mixed states using the second moments of the random outcomes, and demonstrate the advantages of this method by comparing it with the well-known three-tangle and squared concurrence. Second, we generate bound entangled chessboard states of two three-dimensional systems and verify their weak entanglement with a criterion derived from moments of randomized measurements.

quant-ph↗