Searcharxiv⌕ Search

arXiv subjects

Hao Sun

Publications and source records attributed to Hao Sun.

At least 379 records · Page 21Linked to original sources

Safety Assessment of Chinese Large Language Models

With the rapid popularity of large language models such as ChatGPT and GPT-4, a growing amount of attention is paid to their safety concerns. These models may generate insulting and discriminatory content, reflect incorrect social values, and may be used for malicious purposes such as fraud and dissemination of misleading information. Evaluating and enhancing their safety is particularly essential for the wide application of large language models (LLMs). To further promote the safe deployment of LLMs, we develop a Chinese LLM safety assessment benchmark. Our benchmark explores the comprehensive safety performance of LLMs from two perspectives: 8 kinds of typical safety scenarios and 6 types of more challenging instruction attacks. Our benchmark is based on a straightforward process in which it provides the test prompts and evaluates the safety of the generated responses from the evaluated model. In evaluation, we utilize the LLM's strong evaluation ability and develop it as a safety evaluator by prompting. On top of this benchmark, we conduct safety assessments and analyze 15 LLMs including the OpenAI GPT series and other well-known Chinese LLMs, where we observe some interesting findings. For example, we find that instruction attacks are more likely to expose safety issues of all LLMs. Moreover, to promote the development and deployment of safe, responsible, and ethical AI, we publicly release SafetyPrompts including 100k augmented prompts and responses by LLMs.

cs.CL↗

Latent Semantic Diffusion-based Channel Adaptive De-Noising SemCom for Future 6G Systems

Compared with the current Shannon's Classical Information Theory (CIT) paradigm, semantic communication (SemCom) has recently attracted more attention, since it aims to transmit the meaning of information rather than bit-by-bit transmission, thus enhancing data transmission efficiency and supporting future human-centric, data-, and resource-intensive intelligent services in 6G systems. Nevertheless, channel noises are common and even serious in 6G-empowered scenarios, limiting the communication performance of SemCom, especially when Signal-to-Noise (SNR) levels during training and deployment stages are different, but training multi-networks to cover the scenario with a broad range of SNRs is computationally inefficient. Hence, we develop a novel De-Noising SemCom (DNSC) framework, where the designed de-noiser module can eliminate noise interference from semantic vectors. Upon the designed DNSC architecture, we further combine adversarial learning, variational autoencoder, and diffusion model to propose the Latent Diffusion DNSC (Latent-Diff DNSC) scheme to realize intelligent online de-noising. During the offline training phase, noises are added to latent semantic vectors in a forward Markov diffusion manner and then are eliminated in a reverse diffusion manner through the posterior distribution approximated by the U-shaped Network (U-Net), where the semantic de-noiser is optimized by maximizing evidence lower bound (ELBO). Such design can model real noisy channel environments with various SNRs and enable to adaptively remove noises from noisy semantic vectors during the online transmission phase. The simulations on open-source image datasets demonstrate the superiority of the proposed Latent-Diff DNSC scheme in PSNR and SSIM over different SNRs than the state-of-the-art schemes, including JPEG, Deep JSCC, and ADJSCC.

eess.IV↗

Self-referenced Spectral Interferometry for Single-shot Characterization of Ultrashort Free-electron Laser Pulses

Attosecond x-ray pulse with known spectro-temporal information is an essential tool for the investigation of ultrafast electron dynamics in quantum systems. Ultrafast free-electron lasers (FELs) have the unique advantage on unprecedented high-intensity at x-ray wavelengths. However, no suitable method has been established so far for the spectro-temporal characterization of these ultrashort x-ray pulses. In this letter, a simple method has been proposed based on self-referenced spectral interferometry for reconstructing ultrashort FEL pulses both in temporal and spectral domains. We have demonstrated that the proposed method is reliable to reconstruct the temporal profile and phase of attosecond x-ray FEL pulses with an error of only a few-percent-level. Moreover, the first proof-of-principle experiment has been performed to achieve single-shot spectro-temporal characterization of ultrashort pulses from a high-gain FEL. The precision of the proposed method will be enhanced with the decrease of the pulse duration, paving a new way for complete attosecond pulse characterization at x-ray FELs.

physics.acc-ph↗

Neural Laplace Control for Continuous-time Delayed Systems

Many real-world offline reinforcement learning (RL) problems involve continuous-time environments with delays. Such environments are characterized by two distinctive features: firstly, the state x(t) is observed at irregular time intervals, and secondly, the current action a(t) only affects the future state x(t + g) with an unknown delay g > 0. A prime example of such an environment is satellite control where the communication link between earth and a satellite causes irregular observations and delays. Existing offline RL algorithms have achieved success in environments with irregularly observed states in time or known delays. However, environments involving both irregular observations in time and unknown delays remains an open and challenging problem. To this end, we propose Neural Laplace Control, a continuous-time model-based offline RL method that combines a Neural Laplace dynamics model with a model predictive control (MPC) planner--and is able to learn from an offline dataset sampled with irregular time intervals from an environment that has a inherent unknown constant delay. We show experimentally on continuous-time delayed environments it is able to achieve near expert policy performance.

cs.LG↗

Interacting topological Dirac magnons

In this work, we study the magnon-magnon interaction effect in typical honeycomb ferromagnets consisting of van der Waals-bonded stacks of honeycomb layers, e.g., chromium trihalides CrX3 (X = F, Cl, Br, and I), that display two spin-wave modes (Dirac magnon). Using Green's function formalism with the presence of the Dzyaloshinskii-Moriya interaction, we obtain a spinor Dyson equation up to the second-order approximation by the cluster expansion method. Numerical calculations show prominent renormalizations of the single-particle spectrum. Furthermore, we propose a tunable renormalization effect using a parametric magnon amplification scheme. By amplifying the magnon population at different k points, the enabled renormalization effect not only reshapes the band structure but also modifies the Berry curvature distribution. Our work demonstrates the interplay between band geometry, interactions, and the external light field in the bosonic system and can potentially lead to new insights into the properties of magnon-based spintronic devices.

cond-mat.mes-hall↗

Probing Heavy Neutrinos at the LHC from Fat-jet using Machine Learning

We explore the potential to use machine learning methods to search for heavy neutrinos, from their hadronic final states including a fat-jet signal, via the processes $pp \rightarrow W^{\pm *}\rightarrow μ^{\pm} N \rightarrow μ^{\pm} μ^{\mp} W^{\pm} \rightarrow μ^{\pm} μ^{\mp} J$ at hadron colliders. We use either the Gradient Boosted Decision Tree or Multi-Layer Perceptron methods to analyse the observables incorporating the jet substructure information, which is performed at hadron colliders with $\sqrt{s}=$ 13, 27, 100 TeV. It is found that, among the observables, the invariant masses of variable system and the observables from the leptons are the most powerful ones to distinguish the signal from the background. With the help of machine learning techniques, the limits on the active-sterile mixing have been improved by about one magnitude comparing to the cut-based analyses, with $V_{μN}^2 \lesssim 10^{-4}$ for the heavy neutrinos with masses, 100 GeV$~<m_N<~$1 TeV.

hep-ph↗

Interplay between dark matter and leptogenesis in a common framework

We consider the interplay between dark matter and leptogenesis in a common framework, where three right-handed neutrinos, one fermionic dark matter and two singlet scalars are introduced into the Standard Model. The mixing of the two singlet scalars not only determine the dark matter relic density but also connect right-handed neutrino with dark matter. We consider that the baryon asymmetry is generated via the resonant leptogenesis and the right-handed neutrino masses are at TeV level. We present a viable parameter space satisfying relic density constraint, and the parameter space is more flexible in the case of a larger mixing angle. We found that the existence of dark matter in the model can not only dilute the baryon asymmetry but can also generate a larger baryon asymmetry due to the process of dark matter annihilation into a pair of right-handed neutrinos even though dark matter mass is lighter than right-handed neutrino mass. The enhanced effect depends on the dark matter mass $m_χ$ as well as right-handed neutrino mass $m_N$, and one still can find a baryon asymmetry enhanced in the case of $m_N=800$ GeV.

hep-ph↗

Tame parahoric nonabelian Hodge correspondence on curves

The nonabelian Hodge correspondence for vector bundles over noncompact curves is adequately described by implementing a weighted filtration on the objects involved. In order to establish a full correspondence between a Dolbeault and a de Rham space for a general complex reductive group $G$, we introduce torsors given by parahoric group schemes in the sense of Bruhat--Tits. Combined with existing results on the Riemann--Hilbert correspondence for logarithmic parahoric connections, this gives a full nonabelian Hodge correspondence from Higgs bundles to fundamental group representations over a noncompact curve beyond the $\text{GL}_n(\mathbb{C})$-case.

math.AG↗

Stare at What You See: Masked Image Modeling without Reconstruction

Masked Autoencoders (MAE) have been prevailing paradigms for large-scale vision representation pre-training. By reconstructing masked image patches from a small portion of visible image regions, MAE forces the model to infer semantic correlation within an image. Recently, some approaches apply semantic-rich teacher models to extract image features as the reconstruction target, leading to better performance. However, unlike the low-level features such as pixel values, we argue the features extracted by powerful teacher models already encode rich semantic correlation across regions in an intact image.This raises one question: is reconstruction necessary in Masked Image Modeling (MIM) with a teacher model? In this paper, we propose an efficient MIM paradigm named MaskAlign. MaskAlign simply learns the consistency of visible patch features extracted by the student model and intact image features extracted by the teacher model. To further advance the performance and tackle the problem of input inconsistency between the student and teacher model, we propose a Dynamic Alignment (DA) module to apply learnable alignment. Our experimental results demonstrate that masked modeling does not lose effectiveness even without reconstruction on masked regions. Combined with Dynamic Alignment, MaskAlign can achieve state-of-the-art performance with much higher efficiency. Code and models will be available at https://github.com/OpenPerceptionX/maskalign.

cs.CV↗

Logahoric Higgs Torsors for a Complex Reductive Group

In this article, a logahoric Higgs torsor is defined as a parahoric torsor with a logarithmic Higgs field. For a connected complex reductive group $G$, we introduce a notion of stability for logahoric $\mathcal{G}_{\boldsymbolθ}$-Higgs torsors on a smooth algebraic curve $X$, where $\mathcal{G}_{\boldsymbolθ}$ is a parahoric group scheme on $X$. In the case when the group $G$ is the general linear group ${\rm GL}_n$, we show that the stability condition of a parahoric torsor is equivalent to the stability of a parabolic bundle. A correspondence between semistable logahoric $\mathcal{G}_{\boldsymbolθ}$-Higgs torsors and semistable equivariant logarithmic $G$-Higgs bundles allows us to construct the moduli space explicitly. This moduli space is shown to be equipped with an algebraic Poisson structure.

math.AG↗

AdaSAM: Boosting Sharpness-Aware Minimization with Adaptive Learning Rate and Momentum for Training Deep Neural Networks

Sharpness aware minimization (SAM) optimizer has been extensively explored as it can generalize better for training deep neural networks via introducing extra perturbation steps to flatten the landscape of deep learning models. Integrating SAM with adaptive learning rate and momentum acceleration, dubbed AdaSAM, has already been explored empirically to train large-scale deep neural networks without theoretical guarantee due to the triple difficulties in analyzing the coupled perturbation step, adaptive learning rate and momentum step. In this paper, we try to analyze the convergence rate of AdaSAM in the stochastic non-convex setting. We theoretically show that AdaSAM admits a $\mathcal{O}(1/\sqrt{bT})$ convergence rate, which achieves linear speedup property with respect to mini-batch size $b$. Specifically, to decouple the stochastic gradient steps with the adaptive learning rate and perturbed gradient, we introduce the delayed second-order momentum term to decompose them to make them independent while taking an expectation during the analysis. Then we bound them by showing the adaptive learning rate has a limited range, which makes our analysis feasible. To the best of our knowledge, we are the first to provide the non-trivial convergence rate of SAM with an adaptive learning rate and momentum acceleration. At last, we conduct several experiments on several NLP tasks, which show that AdaSAM could achieve superior performance compared with SGD, AMSGrad, and SAM optimizers.

cs.LG↗

The theoretical study of $D_s^+\toπ^+π^0π^0$

Inspired by recent BESIII's amplitude analysis on $D_s^+\toπ^+π^0π^0$, we develop a model based on the chiral unitary approach to discribe the $D_s^+\toπ^+π^0π^0$ decay, where $D_s^+$ decays into a $π^+$ and a quark-antiquark pair through weak decay of charm quark. The interaction of pseudoscalar mesons produced by the hadronization of quark-antiquark pair will lead to dynamically generated $f_0(980)$. The dominant amplitudes from resonances $f_0(1370)$ and $f_2(1270)$ in BESIII fit are also included in our model. In addition to above contributions, to obtain a good fit we also add a amplitude from resonance $f_2(1430)$ to our model. Our model fits well $M_{π^0π^0}$ and $M_{π^+π^0}$ invariant mass distributions simultaneously.

hep-ph↗

On the image of Hitchin morphism for algebraic surfaces: The case ${\rm GL}_n$

The Hitchin morphism is a map from the moduli space of Higgs bundles $\mathscr{M}_X$ to the Hitchin base $\mathscr{B}_X$, where $X$ is a smooth projective variety. When $X$ has dimension at least two, this morphism is not surjective in general. Recently, Chen-Ngô introduced a closed subscheme $\mathscr{A}_X$ of $\mathscr{B}_X$, which is called the space of spectral data. They proved that the Hitchin morphism factors through $\mathscr{A}_X$ and conjectured that $\mathscr{A}_X$ is the image of the Hitchin morphism. We prove that when $X$ is a smooth projective surface, this conjecture is true for vector bundles. Moreover, we show that $\mathscr{A}_X$, for any dimension, is invariant under proper birational morphisms, and apply the result to study $\mathscr{A}_X$ for ruled surfaces.

math.AG↗

Membership Inference Attacks against Synthetic Data through Overfitting Detection

Data is the foundation of most science. Unfortunately, sharing data can be obstructed by the risk of violating data privacy, impeding research in fields like healthcare. Synthetic data is a potential solution. It aims to generate data that has the same distribution as the original data, but that does not disclose information about individuals. Membership Inference Attacks (MIAs) are a common privacy attack, in which the attacker attempts to determine whether a particular real sample was used for training of the model. Previous works that propose MIAs against generative models either display low performance -- giving the false impression that data is highly private -- or need to assume access to internal generative model parameters -- a relatively low-risk scenario, as the data publisher often only releases synthetic data, not the model. In this work we argue for a realistic MIA setting that assumes the attacker has some knowledge of the underlying data distribution. We propose DOMIAS, a density-based MIA model that aims to infer membership by targeting local overfitting of the generative model. Experimentally we show that DOMIAS is significantly more successful at MIA than previous work, especially at attacking uncommon samples. The latter is disconcerting since these samples may correspond to underrepresented groups. We also demonstrate how DOMIAS' MIA performance score provides an interpretable metric for privacy, giving data publishers a new tool for achieving the desired privacy-utility trade-off in their synthetic data.

cs.LG↗

A Neural Corpus Indexer for Document Retrieval

Current state-of-the-art document retrieval solutions mainly follow an index-retrieve paradigm, where the index is hard to be directly optimized for the final retrieval target. In this paper, we aim to show that an end-to-end deep neural network unifying training and indexing stages can significantly improve the recall performance of traditional methods. To this end, we propose Neural Corpus Indexer (NCI), a sequence-to-sequence network that generates relevant document identifiers directly for a designated query. To optimize the recall performance of NCI, we invent a prefix-aware weight-adaptive decoder architecture, and leverage tailored techniques including query generation, semantic document identifiers, and consistency-based regularization. Empirical studies demonstrated the superiority of NCI on two commonly used academic benchmarks, achieving +21.4% and +16.8% relative enhancement for Recall@1 on NQ320k dataset and R-Precision on TriviaQA dataset, respectively, compared to the best baseline method.

cs.IR↗

Laplacian ICP for Progressive Registration of 3D Human Head Meshes

We present a progressive 3D registration framework that is a highly-efficient variant of classical non-rigid Iterative Closest Points (N-ICP). Since it uses the Laplace-Beltrami operator for deformation regularisation, we view the overall process as Laplacian ICP (L-ICP). This exploits a `small deformation per iteration' assumption and is progressively coarse-to-fine, employing an increasingly flexible deformation model, an increasing number of correspondence sets, and increasingly sophisticated correspondence estimation. Correspondence matching is only permitted within predefined vertex subsets derived from domain-specific feature extractors. Additionally, we present a new benchmark and a pair of evaluation metrics for 3D non-rigid registration, based on annotation transfer. We use this to evaluate our framework on a publicly-available dataset of 3D human head scans (Headspace). The method is robust and only requires a small fraction of the computation time compared to the most popular classical approach, yet has comparable registration performance.

cs.CV↗

Symbolic Physics Learner: Discovering governing equations via Monte Carlo tree search

Nonlinear dynamics is ubiquitous in nature and commonly seen in various science and engineering disciplines. Distilling analytical expressions that govern nonlinear dynamics from limited data remains vital but challenging. To tackle this fundamental issue, we propose a novel Symbolic Physics Learner (SPL) machine to discover the mathematical structure of nonlinear dynamics. The key concept is to interpret mathematical operations and system state variables by computational rules and symbols, establish symbolic reasoning of mathematical formulas via expression trees, and employ a Monte Carlo tree search (MCTS) agent to explore optimal expression trees based on measurement data. The MCTS agent obtains an optimistic selection policy through the traversal of expression trees, featuring the one that maps to the arithmetic expression of underlying physics. Salient features of the proposed framework include search flexibility and enforcement of parsimony for discovered equations. The efficacy and superiority of the SPL machine are demonstrated by numerical examples, compared with state-of-the-art baselines.

cs.AI↗

Accurate Gaze Estimation using an Active-gaze Morphable Model

Rather than regressing gaze direction directly from images, we show that adding a 3D shape model can: i) improve gaze estimation accuracy, ii) perform well with lower resolution inputs and iii) provide a richer understanding of the eye-region and its constituent gaze system. Specifically, we use an `eyes and nose' 3D morphable model (3DMM) to capture the eye-region 3D facial geometry and appearance and we equip this with a geometric vergence model of gaze to give an `active-gaze 3DMM'. We show that our approach achieves state-of-the-art results on the Eyediap dataset and we present an ablation study. Our method can learn with only the ground truth gaze target point and the camera parameters, without access to the ground truth gaze origin points, thus widening the applicability of our approach compared to other methods.

cs.CV↗