arXiv subjects

Yuxin Liu

Publications and source records attributed to Yuxin Liu.

At least 109 records · Page 6Linked to original sources

arXiv2025

Cavity as Radio Telescope for Galactic Dark Photon

Dark photons, as a minimal extension of the Standard Model through an additional Abelian gauge group, may propagate relativistically across the galaxy, originating from dark matter decay or annihilation, thereby contributing to a galactic dark photon background. The generation of dark photons typically favors certain polarization modes, which are dependent on the interactions between dark matter and dark photons. We introduce a framework in which a resonant cavity is utilized to detect and differentiate these polarizations, leveraging the daily variation in expected signals due to the anisotropic distribution of dark photons and the rotation of the Earth. We conduct an experimental search using superconducting radio-frequency cavities, noted for their exceptionally high quality factors, proving them to be effective telescopes for observing galactic dark photons. This approach establishes the most stringent limits yet on the kinetic mixing coefficient between dark photons and electromagnetic photons, thereby unveiling a novel avenue for the indirect search for dark matter via multi-messenger astronomy.

hep-ph↗

arXiv2024

Non-equilibrium dynamics of Goldstone excitation from holography

By using the holographic approach, we investigate the interplay between the order parameter and Goldstone modes in the real-time dynamics of the chiral phase transition. By quenching the system to a different thermal bath and obtaining different kinds of initial states, we solve the real-time evolution of the system numerically. Our main focus is on studying far-from equilibrium dynamics of strongly-coupled system and universal scaling behaviors related to such dynamics. The most striking observation is that an additional prethermalization stage emerges at non-critical temperature after introducing the Goldstone modes, which is not reported in any previous studies. Some basic properties related to this additional prethermalization stage have been discussed in detail. More interestingly, we also report a new scaling relation describing non-equilibrium evolution at non-critical temperature. This additional universal behavior indicates the appearance of a non-thermal fixed point in the dynamical region.

hep-ph↗

arXiv2024

NeuralBeta: Estimating Beta Using Deep Learning

Traditional approaches to estimating beta in finance often involve rigid assumptions and fail to adequately capture beta dynamics, limiting their effectiveness in use cases like hedging. To address these limitations, we have developed a novel method using neural networks called NeuralBeta, which is capable of handling both univariate and multivariate scenarios and tracking the dynamic behavior of beta. To address the issue of interpretability, we introduce a new output layer inspired by regularized weighted linear regression, which provides transparency into the model's decision-making process. We conducted extensive experiments on both synthetic and market data, demonstrating NeuralBeta's superior performance compared to benchmark methods across various scenarios, especially instances where beta is highly time-varying, e.g., during regime shifts in the market. This model not only represents an advancement in the field of beta estimation, but also shows potential for applications in other financial contexts that assume linear relationships.

q-fin.ST↗

arXiv2024

Development and Implementation of Advanced Beam Diagnostic and Abort Systems in SuperKEKB

The SuperKEKB/Belle II experiment aims to collect high-statistics data of B meson pairs to explore new physics beyond the Standard Model (SM). SuperKEKB, an upgraded version of the KEKB accelerator, has achieved a world-record luminosity of $4.71 \times 10^{34} \, \mathrm{cm^{-2}s^{-1}}$ in 2022 but continues to strive for higher luminosities. One of the major obstacles is Sudden Beam Loss (SBL) events, which cause substantial beam losses and damage to the Belle~II detector. To find a hint for addressing SBL challenges, advanced beam diagnostic systems and enhanced beam abort systems have been developed. The diagnostic system aims to accurately pinpoint the start of beam losses, while the upgraded abort system quickly disposes of anomalous beams to minimize damage. This paper details the development and implementation of these systems, including high-speed loss monitors, time synchronization with the White Rabbit system, and data acquisition systems. Efforts to understand the mechanisms of SBL events, using acoustic sensors to detect discharges, are also discussed. These measures aim to improve the operational stability and luminosity of SuperKEKB, contributing to the experiment's success.

hep-ex↗

arXiv2024

The spin alignment of vector mesons with light front quarks

The global spin alignment of the vector meson has been observed in relativistic heavy ion collisions, but is still on hot debates in the theoretical community. Here we propose to apply the light front framework to explain this phenomenon since the light front form explicitly describes the hadron spin including both the quark spin and the orbital angular momentum. After applying the light front spinor, we find that the spin alignment in the polarization of vector mesons with $ρ_{00}>1/3$ can be naturally manifested and in particular, the obtained spin alignment for $ϕ$ meson is in good agreement with the experimental data. This implies that to explain the spin alignment it is important to properly include the contribution from the gluon interactions that are presented in terms of the orbital angular momentum of the hadron bound state.

hep-ph↗

arXiv2024

Generative AI to Generate Test Data Generators

Generating fake data is an essential dimension of modern software testing, as demonstrated by the number and significance of data faking libraries. Yet, developers of faking libraries cannot keep up with the wide range of data to be generated for different natural languages and domains. In this paper, we assess the ability of generative AI for generating test data in different domains. We design three types of prompts for Large Language Models (LLMs), which perform test data generation tasks at different levels of integrability: 1) raw test data generation, 2) synthesizing programs in a specific language that generate useful test data, and 3) producing programs that use state-of-the-art faker libraries. We evaluate our approach by prompting LLMs to generate test data for 11 domains. The results show that LLMs can successfully generate realistic test data generators in a wide range of domains at all three levels of integrability.

cs.SE↗

arXiv2024

EG-ConMix: An Intrusion Detection Method based on Graph Contrastive Learning

As the number of IoT devices increases, security concerns become more prominent. The impact of threats can be minimized by deploying Network Intrusion Detection System (NIDS) by monitoring network traffic, detecting and discovering intrusions, and issuing security alerts promptly. Most intrusion detection research in recent years has been directed towards the pair of traffic itself without considering the interrelationships among them, thus limiting the monitoring of complex IoT network attack events. Besides, anomalous traffic in real networks accounts for only a small fraction, which leads to a severe imbalance problem in the dataset that makes algorithmic learning and prediction extremely difficult. In this paper, we propose an EG-ConMix method based on E-GraphSAGE, incorporating a data augmentation module to fix the problem of data imbalance. In addition, we incorporate contrastive learning to discern the difference between normal and malicious traffic samples, facilitating the extraction of key features. Extensive experiments on two publicly available datasets demonstrate the superior intrusion detection performance of EG-ConMix compared to state-of-the-art methods. Remarkably, it exhibits significant advantages in terms of training speed and accuracy for large-scale graphs.

cs.CR↗

arXiv2024

Step-size Optimization for Continual Learning

In continual learning, a learner has to keep learning from the data over its whole life time. A key issue is to decide what knowledge to keep and what knowledge to let go. In a neural network, this can be implemented by using a step-size vector to scale how much gradient samples change network weights. Common algorithms, like RMSProp and Adam, use heuristics, specifically normalization, to adapt this step-size vector. In this paper, we show that those heuristics ignore the effect of their adaptation on the overall objective function, for example by moving the step-size vector away from better step-size vectors. On the other hand, stochastic meta-gradient descent algorithms, like IDBD (Sutton, 1992), explicitly optimize the step-size vector with respect to the overall objective function. On simple problems, we show that IDBD is able to consistently improve step-size vectors, where RMSProp and Adam do not. We explain the differences between the two approaches and their respective limitations. We conclude by suggesting that combining both approaches could be a promising future direction to improve the performance of neural networks in continual learning.

cs.LG↗

arXiv2023

P2CADNet: An End-to-End Reconstruction Network for Parametric 3D CAD Model from Point Clouds

Computer Aided Design (CAD), especially the feature-based parametric CAD, plays an important role in modern industry and society. However, the reconstruction of featured CAD model is more challenging than the reconstruction of other CAD models. To this end, this paper proposes an end-to-end network to reconstruct featured CAD model from point cloud (P2CADNet). Initially, the proposed P2CADNet architecture combines a point cloud feature extractor, a CAD sequence reconstructor and a parameter optimizer. Subsequently, in order to reconstruct the featured CAD model in an autoregressive way, the CAD sequence reconstructor applies two transformer decoders, one with target mask and the other without mask. Finally, for predicting parameters more precisely, we design a parameter optimizer with cross-attention mechanism to further refine the CAD feature parameters. We evaluate P2CADNet on the public dataset, and the experimental results show that P2CADNet has excellent reconstruction quality and accuracy. To our best knowledge, P2CADNet is the first end-to-end network to reconstruct featured CAD model from point cloud, and can be regarded as baseline for future works. Therefore, we open the source code at https://github.com/Blice0415/P2CADNet.

cs.CV↗

arXiv2023

Make-Your-Video: Customized Video Generation Using Textual and Structural Guidance

Creating a vivid video from the event or scenario in our imagination is a truly fascinating experience. Recent advancements in text-to-video synthesis have unveiled the potential to achieve this with prompts only. While text is convenient in conveying the overall scene context, it may be insufficient to control precisely. In this paper, we explore customized video generation by utilizing text as context description and motion structure (e.g. frame-wise depth) as concrete guidance. Our method, dubbed Make-Your-Video, involves joint-conditional video generation using a Latent Diffusion Model that is pre-trained for still image synthesis and then promoted for video generation with the introduction of temporal modules. This two-stage learning scheme not only reduces the computing resources required, but also improves the performance by transferring the rich concepts available in image datasets solely into video generation. Moreover, we use a simple yet effective causal attention mask strategy to enable longer video synthesis, which mitigates the potential quality degradation effectively. Experimental results show the superiority of our method over existing baselines, particularly in terms of temporal coherence and fidelity to users' guidance. In addition, our model enables several intriguing applications that demonstrate potential for practical usage.

cs.CV↗

arXiv2023

Large Scale Visual Food Recognition

Food recognition plays an important role in food choice and intake, which is essential to the health and well-being of humans. It is thus of importance to the computer vision community, and can further support many food-oriented vision and multimodal tasks. Unfortunately, we have witnessed remarkable advancements in generic visual recognition for released large-scale datasets, yet largely lags in the food domain. In this paper, we introduce Food2K, which is the largest food recognition dataset with 2,000 categories and over 1 million images.Compared with existing food recognition datasets, Food2K bypasses them in both categories and images by one order of magnitude, and thus establishes a new challenging benchmark to develop advanced models for food visual representation learning. Furthermore, we propose a deep progressive region enhancement network for food recognition, which mainly consists of two components, namely progressive local feature learning and region feature enhancement. The former adopts improved progressive training to learn diverse and complementary local features, while the latter utilizes self-attention to incorporate richer context with multiple scales into local features for further local feature enhancement. Extensive experiments on Food2K demonstrate the effectiveness of our proposed method. More importantly, we have verified better generalization ability of Food2K in various tasks, including food recognition, food image retrieval, cross-modal recipe retrieval, food detection and segmentation. Food2K can be further explored to benefit more food-relevant tasks including emerging and more complex ones (e.g., nutritional understanding of food), and the trained models on Food2K can be expected as backbones to improve the performance of more food-relevant tasks. We also hope Food2K can serve as a large scale fine-grained visual recognition benchmark.

cs.CV↗

arXiv2023

Teacher Forcing Recovers Reward Functions for Text Generation

Reinforcement learning (RL) has been widely used in text generation to alleviate the exposure bias issue or to utilize non-parallel datasets. The reward function plays an important role in making RL training successful. However, previous reward functions are typically task-specific and sparse, restricting the use of RL. In our work, we propose a task-agnostic approach that derives a step-wise reward function directly from a model trained with teacher forcing. We additionally propose a simple modification to stabilize the RL training on non-parallel datasets with our induced reward function. Empirical results show that our method outperforms self-training and reward regression methods on several text generation tasks, confirming the effectiveness of our reward function.

cs.LG↗

arXiv2022

Adaptive Dual Channel Convolution Hypergraph Representation Learning for Technological Intellectual Property

In the age of big data, the demand for hidden information mining in technological intellectual property is increasing in discrete countries. Definitely, a considerable number of graph learning algorithms for technological intellectual property have been proposed. The goal is to model the technological intellectual property entities and their relationships through the graph structure and use the neural network algorithm to extract the hidden structure information in the graph. However, most of the existing graph learning algorithms merely focus on the information mining of binary relations in technological intellectual property, ignoring the higherorder information hidden in non-binary relations. Therefore, a hypergraph neural network model based on dual channel convolution is proposed. For the hypergraph constructed from technological intellectual property data, the hypergraph channel and the line expanded graph channel of the hypergraph are used to learn the hypergraph, and the attention mechanism is introduced to adaptively fuse the output representations of the two channels. The proposed model outperforms the existing approaches on a variety of datasets.

cs.IR↗

arXiv2022

Attack detection based on machine learning algorithms for different variants of Spectre attacks and different Meltdown attack implementations

To improve the overall performance of processors, computer architects use various performance optimization techniques in modern processors, such as speculative execution, branch prediction, and chaotic execution. Both now and in the future, these optimization techniques are critical for improving the execution speed of processor instructions. However, researchers have discovered that these techniques introduce hidden inherent security flaws, such as meltdown and ghost attacks in recent years. They exploit techniques such as chaotic execution or speculative execution combined with cache-based side-channel attacks to leak protected data. The impact of these vulnerabilities is enormous because they are prevalent in existing or future processors. However, until today, meltdown and ghost have not been effectively addressed, but instead, multiple attack variants and different attack implementations have evolved from them. This paper proposes to optimize four different hardware performance events through feature selection and use machine learning algorithms to build a real-time detection mechanism for Spectre v1,v2,v4, and different implementations of meltdown attacks, ultimately achieving an accuracy rate of over 99\%. In order to verify the practicality of the attack detection model, this paper is tested with a variety of benign programs and different implementations of Spectre attacks different from the modeling process, and the absolute accuracy also exceeds 99\%, showing that this paper can cope with different attack variants and different implementations of the same attack that may occur daily.

cs.CR↗

arXiv2022

Shifts in BCFW method for QED

We study the application of BCFW recursion relations to the QED processes $0\to e^- e^+ n γ$. Based on 6-point amplitudes (both MHVA and NMHVA) computed from Feynman diagrams in the Berends-Giele gauge, we conduct a comprehensive study on all different shifts. Then we propose a new shift (LLYZ shift) which can lead to the full amplitudes for these processes and can have some realistic computation advantages. We compare the number of terms and the independent amplitudes of this novel shift with a few typical shifts.

hep-th↗

arXiv2022

Stringent axion constraints with Event Horizon Telescope polarimetric measurements of M87$^\star$

The hitherto unprecedented angular resolution of the Event Horizon Telescope (EHT) has created exciting opportunities in the search for new physics. Recently, the linear polarization of radiation emitted near the supermassive black hole M87$^\star$ was measured on four separate days, precisely enabling tests of the existence of a dense axion cloud produced by a spinning black hole. The presence of an axion cloud leads to a frequency-independent oscillation in the electric vector position angle (EVPA) of this linear polarization. For a nearly face-on M87$^\star$, this oscillation in the EVPA appears as a propagating wave along the photon ring. In this paper, we leverage the azimuthal distribution of EVPA measured by the EHT to study the axion-photon coupling. We propose a novel differential analysis procedure to reduce the astrophysical background, and derive stringent constraints on the existence of axions in the previously unexplored mass window $\sim (10^{-21}-10^{-20})$~eV.

hep-ph↗

arXiv2022

A correspondence between the free and interacting field theories

We discover a correspondence between the free field and the interacting states. This correspondence is firstly given from the fact that the free propagator can be converted into a tower of propagators for massive states, when expanded with the Hermite function basis. The equivalence of propagators reveals that in this particular case the duality can naturally be regarded as the equivalence of one theory on the plane wave basis to the other on the Hermite function basis. More generally, the Hermite function basis provides an alternative quantization process with the creation/annihilation operators that correspond directly to the interacting fields. Moreover, the Hermite function basis defines an exact way of dimensional reduction. As an illustration, we apply this basis on 3+1 dimensional Yang-Mills theory with three dimensional space being reduced through the Hermite function basis, and if with only the lowest order Hermite function, the equivalent action becomes the Banks-Fischler-Shenker-Susskind (BFSS) matrix model.

hep-ph↗

arXiv2021

An empirical evaluation of the usefulness of Tree Kernels for Commit-time Defect Detection in large software systems

Defect detection at commit check-in time prevents the introduction of defects into software systems. Current defect detection approaches rely on metric-based models which are not very accurate and whose results are not directly useful for developers. We propose a method to detect bug-inducing commits by comparing the incoming changes with all past commits in the project, considering both those that introduced defects and those that did not. Our method considers individual changes in the commit separately, at the method-level granularity. Doing so helps developers as they are informed of specific methods that need further attention instead of being told that the entire commit is problematic. Our approach represents source code as abstract syntax trees and uses tree kernels to estimate the similarity of the code with previous commits. We experiment with subtree kernels (STK), subset tree kernels (SSTK), or partial tree kernels (PTK). An incoming change is then classified using a K-NN classifier on the past changes. We evaluate our approach on the BigCloneBench benchmark and on the Technical Debt dataset, using the NiCad clone detector as the baseline. Our experiments with the BigCloneBench benchmark show that the tree kernel approach can detect clones with a comparable MAP to that of NiCad. Also, on defect detection with the Technical Debt dataset, tree kernels are least as effective as NiCad with MRR, F-score, and Accuracy of 0.87, 0.80, and 0.82 respectively.

cs.SE↗