Search arXiv⌕ Search

arXiv subjects

Hang Liu

Publications and source records attributed to Hang Liu.

At least 91 records · Page 5Linked to original sources

Quantiles, Ranks and Signs in Metric Spaces

Non-Euclidean data become more prevalent in practice, necessitating the development of a framework for statistical inference analogous to that for Euclidean data. Quantile is one of the most important concepts in traditional statistical inference; we introduce the counterpart, both locally and globally, for data objects in metric spaces. This is realized by expanding upon the metric distribution function proposed by Wang et al. (2021). Rank and sign are defined at local and global levels as a natural consequence of the center-outward ordering of metric spaces brought about by the local and global quantiles. The theoretical properties are established, such as the root-$n$ consistency and uniform consistency of the local and global empirical quantiles and the distribution-freeness of ranks and signs. The empirical metric median, which is defined here as the 0th empirical global metric quantile, is proven to be resistant to contamination by means of both theoretical and numerical approaches. Quantiles have been shown to be valuable through extensive simulations in a number of metric spaces. Moreover, we introduce a family of fast rank-based independence tests for a generic metric space. Monte Carlo experiments show good finite-sample performance of the test.

math.ST↗

Inference via robust optimal transportation: theory and methods

Optimal transportation theory and the related $p$-Wasserstein distance ($W_p$, $p\geq 1$) are widely-applied in statistics and machine learning. In spite of their popularity, inference based on these tools has some issues. For instance, it is sensitive to outliers and it may not be even defined when the underlying model has infinite moments. To cope with these problems, first we consider a robust version of the primal transportation problem and show that it defines the {robust Wasserstein distance}, $W^{(λ)}$, depending on a tuning parameter $λ> 0$. Second, we illustrate the link between $W_1$ and $W^{(λ)}$ and study its key measure theoretic aspects. Third, we derive some concentration inequalities for $W^{(λ)}$. Fourth, we use $W^{(λ)}$ to define minimum distance estimators, we provide their statistical guarantees and we illustrate how to apply the derived concentration inequalities for a data driven selection of $λ$. Fifth, we provide the {dual} form of the robust optimal transportation problem and we apply it to machine learning problems (generative adversarial networks and domain adaptation). Numerical exercises provide evidence of the benefits yielded by our novel methods.

math.ST↗

Nonparametric Measure-Transportation-Based Methods for Directional Data

This paper proposes various nonparametric tools based on measure transportation for directional data. We use optimal transports to define new notions of distribution and quantile functions on the hypersphere, with meaningful quantile contours and regions and closed-form formulas under the classical assumption of rotational symmetry. The empirical versions of our distribution functions enjoy the expected Glivenko-Cantelli property of traditional distribution functions. They provide fully distribution-free concepts of ranks and signs and define data-driven systems of (curvilinear) parallels and (hyper)meridians. Based on this, we also construct a universally consistent test of uniformity and a class of fully distribution-free and universally consistent tests for directional MANOVA which, in simulations, outperform all their existing competitors. A real-data example involving the analysis of sunspots concludes the paper.

math.ST↗

Improved method to determine the $Ξ_c-Ξ_c'$ mixing

We develop an improved method to explore the $Ξ_c- Ξ_c'$ mixing which arises from the flavor SU(3) and heavy quark symmetry breaking. In this method, the flavor eigenstates under the SU(3) symmetry are at first constructed and the corresponding masses can be nonperturbatively determined. Matrix elements of the mass operators which break the flavor SU(3) symmetry sandwiched by the flavor eigenstates are then calculated. Diagonalizing the corresponding matrix of Hamiltonian gives the mass eigenstates of the full Hamiltonian and determines the mixing. Following the previous lattice QCD calculation of $Ξ_c$ and $Ξ_c'$, and estimating an off-diagonal matrix element, we extract the mixing angle between the $Ξ_c$ and $Ξ_c'$. Preliminary numerical results for the mixing angle confirm the previous observation that such mixing is incapable to explain the large SU(3) symmetry breaking in semileptonic decays of charmed baryons.

hep-ph↗

Zero-Space Cost Fault Tolerance for Transformer-based Language Models on ReRAM

Resistive Random Access Memory (ReRAM) has emerged as a promising platform for deep neural networks (DNNs) due to its support for parallel in-situ matrix-vector multiplication. However, hardware failures, such as stuck-at-fault defects, can result in significant prediction errors during model inference. While additional crossbars can be used to address these failures, they come with storage overhead and are not efficient in terms of space, energy, and cost. In this paper, we propose a fault protection mechanism that incurs zero space cost. Our approach includes: 1) differentiable structure pruning of rows and columns to reduce model redundancy, 2) weight duplication and voting for robust output, and 3) embedding duplicated most significant bits (MSBs) into the model weight. We evaluate our method on nine tasks of the GLUE benchmark with the BERT model, and experimental results prove its effectiveness.

cs.LG↗

$K_2$ of families of elliptic curves over non-Abelian cubic and quartic fields

We give two constructions of families of elliptic curves over cubic or quartic fields with three, respectively four, `integral' elements in the kernel of the tame symbol on the curves. The fields are in general non-Abelian, and the elements linearly independent. For their integrality, we prove a new criterion that does not ignore any torsion. We also verify Beilinson's conjecture numerically for just over 90 of the curves.

math.NT↗

Differentially Private Over-the-Air Federated Learning Over MIMO Fading Channels

Federated learning (FL) enables edge devices to collaboratively train machine learning models, with model communication replacing direct data uploading. While over-the-air model aggregation improves communication efficiency, uploading models to an edge server over wireless networks can pose privacy risks. Differential privacy (DP) is a widely used quantitative technique to measure statistical data privacy in FL. Previous research has focused on over-the-air FL with a single-antenna server, leveraging communication noise to enhance user-level DP. This approach achieves the so-called "free DP" by controlling transmit power rather than introducing additional DP-preserving mechanisms at devices, such as adding artificial noise. In this paper, we study differentially private over-the-air FL over a multiple-input multiple-output (MIMO) fading channel. We show that FL model communication with a multiple-antenna server amplifies privacy leakage as the multiple-antenna server employs separate receive combining for model aggregation and information inference. Consequently, relying solely on communication noise, as done in the multiple-input single-output system, cannot meet high privacy requirements, and a device-side privacy-preserving mechanism is necessary for optimal DP design. We analyze the learning convergence and privacy loss of the studied FL system and propose a transceiver design algorithm based on alternating optimization. Numerical results demonstrate that the proposed method achieves a better privacy-learning trade-off compared to prior work.

cs.IT↗

Graph Theorem for Chiral Exact Flat Bands at Charge Neutrality

Chiral exact flat bands (FBs) at charge neutrality have attracted much recent interest, presenting an intriguing condensed-matter system to realize exact many-body phenomena, as specifically shown in "magic angle" twisted bilayer graphene for superconductivity and triangulene-based superatomic graphene for excitonic condensation. Yet, no generic physical model to realize such FBs has been developed. Here we present a new mathematical theorem, called bipartite double cover (BDC) theorem, and prove that the BDC of line-graph (LG) lattices hosts at least two chiral exact FBs of opposite chirality, i.e., yin-yang FBs, centered-around/at charge neutrality (E = 0) akin to the "chiral limit" of twisted bilayer graphene. We illustrate this theorem by mapping it exactly onto tight-binding lattice models of the BDC of LGs of hexagonal lattice for strong topological and of triangular lattice for fragile topological FBs, respectively. Moreover, we use orbital design principle to realize such exotic yin-yang FBs in non-BDC lattices to instigate their real material discovery. This work not only enables the search for exact chiral FBs at zero energy beyond moiré heterostructures, but also opens the door to discovering quantum semiconductor features with FB-enabled strongly correlated carriers.

cond-mat.mtrl-sci↗

General Spatio-Temporal Factor Models for High-Dimensional Random Fields on a Lattice

Motivated by the need for analysing large spatio-temporal panel data, we introduce a novel dimensionality reduction methodology for $n$-dimensional random fields observed across a number $S$ spatial locations and $T$ time periods. We call it General Spatio-Temporal Factor Model (GSTFM). First, we provide the probabilistic and mathematical underpinning needed for the representation of a random field as the sum of two components: the common component (driven by a small number $q$ of latent factors) and the idiosyncratic component (mildly cross-correlated). We show that the two components are identified as $n\to\infty$. Second, we propose an estimator of the common component and derive its statistical guarantees (consistency and rate of convergence) as $\min(n, S, T )\to\infty$. Third, we propose an information criterion to determine the number of factors. Estimation makes use of Fourier analysis in the frequency domain and thus we fully exploit the information on the spatio-temporal covariance structure of the whole panel. Synthetic data examples illustrate the applicability of GSTFM and its advantages over the extant generalized dynamic factor model that ignores the spatial correlations.

stat.ME↗

EmojiLM: Modeling the New Emoji Language

With the rapid development of the internet, online social media welcomes people with different backgrounds through its diverse content. The increasing usage of emoji becomes a noticeable trend thanks to emoji's rich information beyond cultural or linguistic borders. However, the current study on emojis is limited to single emoji prediction and there are limited data resources available for further study of the interesting linguistic phenomenon. To this end, we synthesize a large text-emoji parallel corpus, Text2Emoji, from a large language model. Based on the parallel corpus, we distill a sequence-to-sequence model, EmojiLM, which is specialized in the text-emoji bidirectional translation. Extensive experiments on public benchmarks and human evaluation demonstrate that our proposed model outperforms strong baselines and the parallel corpus benefits emoji-related downstream tasks.

cs.CL↗

DeepSpeed4Science Initiative: Enabling Large-Scale Scientific Discovery through Sophisticated AI System Technologies

In the upcoming decade, deep learning may revolutionize the natural sciences, enhancing our capacity to model and predict natural occurrences. This could herald a new era of scientific exploration, bringing significant advancements across sectors from drug development to renewable energy. To answer this call, we present DeepSpeed4Science initiative (deepspeed4science.ai) which aims to build unique capabilities through AI system technology innovations to help domain experts to unlock today's biggest science mysteries. By leveraging DeepSpeed's current technology pillars (training, inference and compression) as base technology enablers, DeepSpeed4Science will create a new set of AI system technologies tailored for accelerating scientific discoveries by addressing their unique complexity beyond the common technical approaches used for accelerating generic large language models (LLMs). In this paper, we showcase the early progress we made with DeepSpeed4Science in addressing two of the critical system challenges in structural biology research.

cs.AI↗

Quasinormal modes of phantom Reissner-Nordström-de Sitter black holes

In this paper, we investigate some characteristics of phantom Reissner-Nordström-de Sitter (RN-dS) black holes. The peculiar feature of phantom field renders this kind of black holes quite different from their counterparts. We can only find at most two horizons in this spacetime, i.e. event horizon and cosmological horizon. For the black hole charge parameter, we find that it is not bounded from below. We calculate quasinormal modes (QNMs) frequencies of massless neutral scalar field perturbation in this black hole spacetime, and some properties related to the large charge parameter are disclosed.

gr-qc↗

Hidden-charm Hexaquarks from Lattice QCD

We present a lattice QCD study of hidden-charm hexaquarks with quark content $usc\bar{d}\bar{s}\bar{c}$ based on four ensembles of gauge configurations generated by CLQCD Collaboration with pion mass in the range of 220-300MeV. Four operators with quantum numbers $0^{++}, 0^{-+}, 1^{++}$ and $1^{--}$ respectively are constructed to interpolate the hexaquarks. After validating the spectrum and the dispersion relation for ordinary hadrons, we calculate the masses of the hexaquarks and extrapolate the results to the physical pion mass and the continuum limit. We find that the masses of the four hexaquarks are all below the $Ξ_c \bar Ξ_c$ threshold, while the $0^{-+}$ hexaquark lies around the $η_c K^+K^-$ threshold. These results will be helpful for experimental searches in future and for a deep understanding of the nature of multiquark states.

hep-lat↗

Low-Complexity Vector Source Coding for Discrete Long Sequences with Unknown Distributions

In this paper, we propose a source coding scheme that represents data from unknown distributions through frequency and support information. Existing encoding schemes often compress data by sacrificing computational efficiency or by assuming the data follows a known distribution. We take advantage of the structure that arises within the spatial representation and utilize it to encode run-lengths within this representation using Golomb coding. Through theoretical analysis, we show that our scheme yields an overall bit rate that nears entropy without a computationally complex encoding algorithm and verify these results through numerical experiments.

cs.IT↗

Some novel aspects of quantile regression: local stationarity, random forests and optimal transportation

This paper is written for a Festschrift in honour of Professor Marc Hallin and it proposes some developments on quantile regression. We connect our investigation to Marc's scientific production and we present some theoretical and methodological advances for quantiles estimation in non standard settings. We split our contributions in two parts. The first part is about conditional quantiles estimation for nonstationary time series. The second part is about conditional quantiles estimation for the analysis of multivariate independent data in the presence of possibly large dimensional covariates. Monte Carlo studies illustrate numerically the performance of our methods and compare them to some extant techniques.

stat.AP↗

Tango: rethinking quantization for graph neural network training on GPUs

Graph Neural Networks (GNNs) are becoming increasingly popular due to their superior performance in critical graph-related tasks. While quantization is widely used to accelerate GNN computation, quantized training faces unprecedented challenges. Current quantized GNN training systems often have longer training times than their full-precision counterparts for two reasons: (i) addressing the accuracy challenge leads to excessive overhead, and (ii) the optimization potential exposed by quantization is not adequately leveraged. This paper introduces Tango which re-thinks quantization challenges and opportunities for graph neural network training on GPUs with three contributions: Firstly, we introduce efficient rules to maintain accuracy during quantized GNN training. Secondly, we design and implement quantization-aware primitives and inter-primitive optimizations that can speed up GNN training. Finally, we integrate Tango with the popular Deep Graph Library (DGL) system and demonstrate its superior performance over state-of-the-art approaches on various GNN models and datasets.

cs.LG↗

High Performance GPU Accelerated MuST Software

The MuST package is a computational software designed for ab initio electronic structure calculations for solids. The Locally Self-consistent Multiple Scattering (LSMS) method implemented in MuST allows to perform the electronic structure calculation for systems with a large number of atoms per unit cell. For the LSMS method with muffin-tin potential approximation, the major computational challenge is the matrix inverse for the scattering matrix calculation, which could take more than 90\% of the computing time. However, the matrix inverse can be significantly accelerated by modern graphical-processing-units (GPUs). In this paper, we discuss our approach to the code acceleration by offloading the matrix inverse tasks to the GPUs through a Fortran-C interface from the Fortran code to the CUDA code. We report our performance results showing significant speedup ratio achieved to the calculations of NiAu alloy, a candidate for thermoelectric materials.

physics.comp-ph↗

Two-body hadronic decays of Xi^{0}_c in light front approach

In this study, we investigate the nonleptonic decays of the charmed-baryon Xi^ {0} _ c induced by the c -> u(d\bar{d})/(s\bar{s}) transition. Utilizing the factorization assumption, we decompose the decay amplitudes in terms of transition form factors which are then calculated within the light-front quark model. We employ helicity amplitudes to analyze the nonleptonic decay modes of the charmed-baryon Xi^ {0} _c and derive benchmark results for decay widths and branching fractions. Our calculations suggest that the branching fractions for some of these rare nonleptonic decays are at the order of 10^ {-4} - 10^ {-3}, which are likely to be detectable at experiments such as LHCb or BESIII. The potential data accumulated in the future may help to further our understanding of the decay mechanism in the presence of charm quarks.

hep-ph↗