arXiv subjects

Yu Wang

Publications and source records attributed to Yu Wang.

At least 991 records · Page 55Linked to original sources

arXiv2023

Giant Nernst effect in the crossover between Fermi liquid and strange metal

The strange-metal state is a crucial problem in condensed matter physics highlighted by its ubiquity in almost all major correlated systems[1-7]. Its understanding could provide important insight into high-Tc superconductivity[2] and quantum criticality[8]. However, with the Fermi liquid theory failing in strange metals, understanding the highly unconventional behaviors has been a long-standing challenge. Fundamental aspects of strange metals remain elusive, including the nature of their charge carriers[1]. Here, we report the observation of a giant Nernst response in the strange-metal state in a two-dimensional superconductor 2M-WS2. A giant Nernst coefficient comparable to the vortex Nernst signal in superconducting cuprates, and its high sensitivity to carrier mobility, are found when the system enters the strange-metal state from the Fermi liquid state. The temperature and magnetic field dependence of the giant Nernst peak rule out the relevance of both Landau quasiparticles and superconductivity. Instead, the giant Nernst peak at the crossover indicates a dramatic change in carrier entropy when entering the strange-metal state. The presence of such an anomalous Nernst response is further confirmed in other iconic strange metals, suggesting its universality and places stringent experimental constraints on the mechanism of strange metals.

cond-mat.str-el↗

arXiv2023

Interpretable and Scalable Graphical Models for Complex Spatio-temporal Processes

This thesis focuses on data that has complex spatio-temporal structure and on probabilistic graphical models that learn the structure in an interpretable and scalable manner. We target two research areas of interest: Gaussian graphical models for tensor-variate data and summarization of complex time-varying texts using topic models. This work advances the state-of-the-art in several directions. First, it introduces a new class of tensor-variate Gaussian graphical models via the Sylvester tensor equation. Second, it develops an optimization technique based on a fast-converging proximal alternating linearized minimization method, which scales tensor-variate Gaussian graphical model estimations to modern big-data settings. Third, it connects Kronecker-structured (inverse) covariance models with spatio-temporal partial differential equations (PDEs) and introduces a new framework for ensemble Kalman filtering that is capable of tracking chaotic physical systems. Fourth, it proposes a modular and interpretable framework for unsupervised and weakly-supervised probabilistic topic modeling of time-varying data that combines generative statistical models with computational geometric methods. Throughout, practical applications of the methodology are considered using real datasets. This includes brain-connectivity analysis using EEG data, space weather forecasting using solar imaging data, longitudinal analysis of public opinions using Twitter data, and mining of mental health related issues using TalkLife data. We show in each case that the graphical modeling framework introduced here leads to improved interpretability, accuracy, and scalability.

cs.LG↗

arXiv2023

Solving the Wigner Equation for Chemically Relevant Scenarios: Dynamics in 2D

Signed Particle Monte Carlo (SPMC) approach has been used in the past to model steady-state and transient dynamics of the Wigner quasi-distribution for electrons in low dimensional semiconductors. Here we make a step towards high-dimensional quantum phase-space simulation in chemically relevant scenarios by improving the stability and memory demands of SPMC in 2D. We do so by using an unbiased propagator for SPMC to improve trajectory stability and by applying machine learning to reduce memory demands for storage and manipulation of the Wigner potential. We perform computational experiments on a 2D double-well toymodel of proton transfer and demonstrate stable pico-second-long trajectories that require only a modest computational effort.

quant-ph↗

arXiv2023

Sgap: Towards Efficient Sparse Tensor Algebra Compilation for GPU

Sparse compiler is a promising solution for sparse tensor algebra optimization. In compiler implementation, reduction in sparse-dense hybrid algebra plays a key role in performance. Though GPU provides various reduction semantics that can better utilize the parallel computing and memory bandwidth capacity, the central question is: how to elevate the flexible reduction semantics to sparse compilation theory that assumes serial execution. Specifically, we have to tackle two main challenges: (1) there are wasted parallelism by adopting static synchronization granularity (2) static reduction strategy limits optimization space exploration. We propose Sgap: segment group and atomic parallelism to solve these problems. Atomic parallelism captures the flexible reduction semantics to systematically analyze the optimization space of sparse-dense hybrid algebra on GPU. It is a new optimization technique beyond current compiler-based and open-source runtime libraries. Segment group elevates the flexible reduction semantics to suitable levels of abstraction in the sparse compilation theory. It adopts changeable group size and user-defined reduction strategy to solve challenge (1) and (2), respectively. Finally, we use GPU sparse matrix-matrix multiplication (SpMM) on the TACO compiler as a use case to demonstrate the effectiveness of segment group in reduction semantics elevation. We achieve up to 1.2x speedup over the original TACO's SpMM kernels. We also apply new optimization techniques found by atomic parallelism to an open-source state-of-the-art SpMM library dgSPARSE. We achieve 1.6x - 2.3x speedup on the algorithm tuned with atomic parallelism.

cs.DC↗

arXiv2023

Surprisingly large anomalous Hall effect and giant negative magnetoresistance in half-topological semimetals

Large intrinsic anomalous Hall effect (AHE) due to the Berry curvature in magnetic topological semimetals is attracting enormous interest due to its fundamental importance and technological relevance. Mechanisms resulting in large intrinsic AHE include diverging Berry curvature in Weyl semimetals, anticrossing nodal rings or points of non-trivial bands, and noncollinear spin structures. Here we show that a half-topological semimetal (HTS) state near a topological critical point can provide a new mechanism for driving an exceptionally large AHE. We reveal this through a systematic experimental and theoretical study of the antiferromagnetic (AFM) half-Heusler compound TbPdBi. We not only observed an unusual AHE with a surprisingly large anomalous Hall angle ΘH (tan ΘH ~ 2, the largest among the antiferromagnets) in its field-driven ferromagnetic (FM) phase, but also found a distinct Hall resistivity peak in the canted AFM phase within a low field range, where its isothermal magnetization is nearly linearly dependent on the field. Moreover, we observed a nearly isotropic, giant negative magnetoresistance with a magnitude of ~98%. Our in-depth theoretical modelling demonstrates that these exotic transport properties originate from the HTS state. A minimal Berry curvature cancellation between the trivial spin-up and nontrivial spin-down bands results not only in an extremely large AHE, but it also enhances the spin polarization of the spin-down bands substantially and thus leads to a giant negative magnetoresistance. Our study advances the understanding of the interplay between band topology and magnetism and offers new clues for materials design for spintronics and other applications.

cond-mat.mes-hall↗

arXiv2022

Unreliability of two-band model analysis of magnetoresistivities in unveiling temperature-driven Lifshitz transition

Recently, anomalies in the temperature dependences of the carrier density and/or mobility derived from analysis of the magnetoresistivities using the conventional two-band model have been used to unveil intriguing temperature-induced Lifshitz transitions in various materials. For instance, two temperature-driven Lifshitz transitions were inferred to exist in the Dirac nodal-line semimetal ZrSiSe, based on two-band model analysis of the Hall magnetoconductivities where the second band exhibits a change in the carrier type from holes to electrons when the temperature decreases below T = 106 K and a dip is observed in the mobility versus temperature curve at T = 80 K. Here, we revisit the experiments and two-band model analysis on ZrSiSe. We show that the anomalies in the second band may be spurious, because the first band dominates the Hall magnetoconductivities at T > 80 K, making the carrier type and mobility obtained for the second band from the two-band model analysis unreliable. That is, care must be taken in interpreting these anomalies as evidences for temperature-driven Lifshitz transitions. Our skepticism on the existence of such phase transitions in ZrSiSe is further supported by the validation of the Kohler's rule for magnetoresistances at temperatures below 180 K. This work showcases potential issues in interpreting anomalies in the temperature dependence of the carrier density and mobility derived from the analysis of magnetoconductivities or magnetoresistivities using the conventional two-band model.

cond-mat.mtrl-sci↗

arXiv2022

Hybrid Rule-Neural Coreference Resolution System based on Actor-Critic Learning

A coreference resolution system is to cluster all mentions that refer to the same entity in a given context. All coreference resolution systems need to tackle two main tasks: one task is to detect all of the potential mentions, and the other is to learn the linking of an antecedent for each possible mention. In this paper, we propose a hybrid rule-neural coreference resolution system based on actor-critic learning, such that it can achieve better coreference performance by leveraging the advantages from both the heuristic rules and a neural conference model. This end-to-end system can also perform both mention detection and resolution by leveraging a joint training algorithm. We experiment on the BERT model to generate input span representations. Our model with the BERT span representation achieves the state-of-the-art performance among the models on the CoNLL-2012 Shared Task English Test Set.

cs.CL↗

arXiv2022

A Robust Semantic Frame Parsing Pipeline on a New Complex Twitter Dataset

Most recent semantic frame parsing systems for spoken language understanding (SLU) are designed based on recurrent neural networks. These systems display decent performance on benchmark SLU datasets such as ATIS or SNIPS, which contain short utterances with relatively simple patterns. However, the current semantic frame parsing models lack a mechanism to handle out-of-distribution (\emph{OOD}) patterns and out-of-vocabulary (\emph{OOV}) tokens. In this paper, we introduce a robust semantic frame parsing pipeline that can handle both \emph{OOD} patterns and \emph{OOV} tokens in conjunction with a new complex Twitter dataset that contains long tweets with more \emph{OOD} patterns and \emph{OOV} tokens. The new pipeline demonstrates much better results in comparison to state-of-the-art baseline SLU models on both the SNIPS dataset and the new Twitter dataset (Our new Twitter dataset can be downloaded from https://1drv.ms/u/s!AroHb-W6_OAlavK4begsDsMALfE?e=c8f2XX ). Finally, we also build an E2E application to demo the feasibility of our algorithm and show why it is useful in real application.

cs.CL↗

arXiv2022

Neural Coreference Resolution based on Reinforcement Learning

The target of a coreference resolution system is to cluster all mentions that refer to the same entity in a given context. All coreference resolution systems need to solve two subtasks; one task is to detect all of the potential mentions, and the other is to learn the linking of an antecedent for each possible mention. In this paper, we propose a reinforcement learning actor-critic-based neural coreference resolution system, which can achieve both mention detection and mention clustering by leveraging an actor-critic deep reinforcement learning technique and a joint training algorithm. We experiment on the BERT model to generate different input span representations. Our model with the BERT span representation achieves the state-of-the-art performance among the models on the CoNLL-2012 Shared Task English Test Set.

cs.CL↗

arXiv2022

Localized Contrastive Learning on Graphs

Contrastive learning methods based on InfoNCE loss are popular in node representation learning tasks on graph-structured data. However, its reliance on data augmentation and its quadratic computational complexity might lead to inconsistency and inefficiency problems. To mitigate these limitations, in this paper, we introduce a simple yet effective contrastive model named Localized Graph Contrastive Learning (Local-GCL in short). Local-GCL consists of two key designs: 1) We fabricate the positive examples for each node directly using its first-order neighbors, which frees our method from the reliance on carefully-designed graph augmentations; 2) To improve the efficiency of contrastive learning on graphs, we devise a kernelized contrastive loss, which could be approximately computed in linear time and space complexity with respect to the graph size. We provide theoretical analysis to justify the effectiveness and rationality of the proposed methods. Experiments on various datasets with different scales and properties demonstrate that in spite of its simplicity, Local-GCL achieves quite competitive performance in self-supervised node representation learning tasks on graphs with various scales and properties.

cs.LG↗

arXiv2022

Fairness and Explainability: Bridging the Gap Towards Fair Model Explanations

While machine learning models have achieved unprecedented success in real-world applications, they might make biased/unfair decisions for specific demographic groups and hence result in discriminative outcomes. Although research efforts have been devoted to measuring and mitigating bias, they mainly study bias from the result-oriented perspective while neglecting the bias encoded in the decision-making procedure. This results in their inability to capture procedure-oriented bias, which therefore limits the ability to have a fully debiasing method. Fortunately, with the rapid development of explainable machine learning, explanations for predictions are now available to gain insights into the procedure. In this work, we bridge the gap between fairness and explainability by presenting a novel perspective of procedure-oriented fairness based on explanations. We identify the procedure-based bias by measuring the gap of explanation quality between different groups with Ratio-based and Value-based Explanation Fairness. The new metrics further motivate us to design an optimization objective to mitigate the procedure-based bias where we observe that it will also mitigate bias from the prediction. Based on our designed optimization objective, we propose a Comprehensive Fairness Algorithm (CFA), which simultaneously fulfills multiple objectives - improving traditional fairness, satisfying explanation fairness, and maintaining the utility performance. Extensive experiments on real-world datasets demonstrate the effectiveness of our proposed CFA and highlight the importance of considering fairness from the explainability perspective. Our code is publicly available at https://github.com/YuyingZhao/FairExplanations-CFA .

cs.LG↗

arXiv2022

ContrastVAE: Contrastive Variational AutoEncoder for Sequential Recommendation

Aiming at exploiting the rich information in user behaviour sequences, sequential recommendation has been widely adopted in real-world recommender systems. However, current methods suffer from the following issues: 1) sparsity of user-item interactions, 2) uncertainty of sequential records, 3) long-tail items. In this paper, we propose to incorporate contrastive learning into the framework of Variational AutoEncoders to address these challenges simultaneously. Firstly, we introduce ContrastELBO, a novel training objective that extends the conventional single-view ELBO to two-view case and theoretically builds a connection between VAE and contrastive learning from a two-view perspective. Then we propose Contrastive Variational AutoEncoder (ContrastVAE in short), a two-branched VAE model with contrastive regularization as an embodiment of ContrastELBO for sequential recommendation. We further introduce two simple yet effective augmentation strategies named model augmentation and variational augmentation to create a second view of a sequence and thus making contrastive learning possible. Experiments on four benchmark datasets demonstrate the effectiveness of ContrastVAE and the proposed augmentation methods. Codes are available at https://github.com/YuWang-1024/ContrastVAE

cs.IR↗

arXiv2022

Kronecker-structured Covariance Models for Multiway Data

Many applications produce multiway data of exceedingly high dimension. Modeling such multi-way data is important in multichannel signal and video processing where sensors produce multi-indexed data, e.g. over spatial, frequency, and temporal dimensions. We will address the challenges of covariance representation of multiway data and review some of the progress in statistical modeling of multiway covariance over the past two decades, focusing on tensor-valued covariance models and their inference. We will illustrate through a space weather application: predicting the evolution of solar active regions over time.

stat.ME↗

arXiv2022

Multi-view deep learning based molecule design and structural optimization accelerates the SARS-CoV-2 inhibitor discovery

In this work, we propose MEDICO, a Multi-viEw Deep generative model for molecule generation, structural optimization, and the SARS-CoV-2 Inhibitor disCOvery. To the best of our knowledge, MEDICO is the first-of-this-kind graph generative model that can generate molecular graphs similar to the structure of targeted molecules, with a multi-view representation learning framework to sufficiently and adaptively learn comprehensive structural semantics from targeted molecular topology and geometry. We show that our MEDICO significantly outperforms the state-of-the-art methods in generating valid, unique, and novel molecules under benchmarking comparisons. In particular, we showcase the multi-view deep learning model enables us to generate not only the molecules structurally similar to the targeted molecules but also the molecules with desired chemical properties, demonstrating the strong capability of our model in exploring the chemical space deeply. Moreover, case study results on targeted molecule generation for the SARS-CoV-2 main protease (Mpro) show that by integrating molecule docking into our model as chemical priori, we successfully generate new small molecules with desired drug-like properties for the Mpro, potentially accelerating the de novo design of Covid-19 drugs. Further, we apply MEDICO to the structural optimization of three well-known Mpro inhibitors (N3, 11a, and GC376) and achieve ~88% improvement in their binding affinity to Mpro, demonstrating the application value of our model for the development of therapeutics for SARS-CoV-2 infection.

cs.LG↗

arXiv2022

Few-Shot Specific Emitter Identification via Hybrid Data Augmentation and Deep Metric Learning

Specific emitter identification (SEI) is a potential physical layer authentication technology, which is one of the most critical complements of upper layer authentication. Radio frequency fingerprint (RFF)-based SEI is to distinguish one emitter from each other by immutable RF characteristics from electronic components. Due to the powerful ability of deep learning (DL) to extract hidden features and perform classification, it can extract highly separative features from massive signal samples, thus enabling SEI. Considering the condition of limited training samples, we propose a novel few-shot SEI (FS-SEI) method based on hybrid data augmentation and deep metric learning (HDA-DML) which gets rid of the dependence on auxiliary datasets. Specifically, HDA consisting rotation and CutMix is designed to increase data diversity, and DML is used to extract high discriminative semantic features. The proposed HDA-DML-based FS-SEI method is evaluated on an open source large-scale real-world automatic-dependent surveillance-broadcast (ADS-B) dataset and a real-world WiFi dataset. The simulation results of two datasets show that the proposed method achieves better identification performance and higher feature discriminability than five latest FS-SEI methods.

eess.SP↗

arXiv2022

Exact Controllability for a Refined Stochastic Plate Equation

A widely used stochastic plate equation is the classical plate equation perturbed by a term of Itô's integral. However, it is known that this equation is not exactly controllable even if the controls are effective everywhere in both the drift and the diffusion terms and also on the boundary. In some sense, this means that some key feature has been ignored in this model. Then, a one-dimensional refined stochastic plate equation is proposed and its exact controllability is established in [28]. In this paper, by means of a new global Carleman estimate, we establish the exact controllability of the multidimensional refined stochastic plate equation with two interior controls and two boundary controls. Moreover, we give a result about the lack of exact controllability, which shows that the action of two interior controls and at least one boundary control is necessary.

math.OC↗

arXiv2022

Learning Efficient Multi-Agent Cooperative Visual Exploration

We tackle the problem of cooperative visual exploration where multiple agents need to jointly explore unseen regions as fast as possible based on visual signals. Classical planning-based methods often suffer from expensive computation overhead at each step and a limited expressiveness of complex cooperation strategy. By contrast, reinforcement learning (RL) has recently become a popular paradigm for tackling this challenge due to its modeling capability of arbitrarily complex strategies and minimal inference overhead. In this paper, we extend the state-of-the-art single-agent visual navigation method, Active Neural SLAM (ANS), to the multi-agent setting by introducing a novel RL-based planning module, Multi-agent Spatial Planner (MSP).MSP leverages a transformer-based architecture, Spatial-TeamFormer, which effectively captures spatial relations and intra-agent interactions via hierarchical spatial self-attentions. In addition, we also implement a few multi-agent enhancements to process local information from each agent for an aligned spatial representation and more precise planning. Finally, we perform policy distillation to extract a meta policy to significantly improve the generalization capability of final policy. We call this overall solution, Multi-Agent Active Neural SLAM (MAANS). MAANS substantially outperforms classical planning-based baselines for the first time in a photo-realistic 3D simulator, Habitat. Code and videos can be found at https://sites.google.com/view/maans.

cs.CV↗

arXiv2022

Fuzzy Positive Learning for Semi-supervised Semantic Segmentation

Semi-supervised learning (SSL) essentially pursues class boundary exploration with less dependence on human annotations. Although typical attempts focus on ameliorating the inevitable error-prone pseudo-labeling, we think differently and resort to exhausting informative semantics from multiple probably correct candidate labels. In this paper, we introduce Fuzzy Positive Learning (FPL) for accurate SSL semantic segmentation in a plug-and-play fashion, targeting adaptively encouraging fuzzy positive predictions and suppressing highly-probable negatives. Being conceptually simple yet practically effective, FPL can remarkably alleviate interference from wrong pseudo labels and progressively achieve clear pixel-level semantic discrimination. Concretely, our FPL approach consists of two main components, including fuzzy positive assignment (FPA) to provide an adaptive number of labels for each pixel and fuzzy positive regularization (FPR) to restrict the predictions of fuzzy positive categories to be larger than the rest under different perturbations. Theoretical analysis and extensive experiments on Cityscapes and VOC 2012 with consistent performance gain justify the superiority of our approach.

cs.CV↗