arXiv subjects

Tianyu Mu

Publications and source records attributed to Tianyu Mu.

5 recordsLinked to original sources

arXiv2025

Constraints on SMEFT operators from $Z \to \mu \mu bb$ decay

The Standard Model Effective Field Theory (SMEFT) provides a systematic framework to probe indirect effects of heavy new physics via precision measurements. While SMEFT constraints have been extensively studied using purely leptonic $Z$ decays and inclusive $Z$ production, mixed leptonic-hadronic modes remain largely unexplored. In this work, we analyze $Z \to \mu\mu bb$ decays within the SMEFT framework, deriving constraints on dimension-six operators that affect four-fermion interactions between leptons and bottom quarks, as well as $Z$-fermion couplings. Signal and background events are simulated with state-of-the-art Monte Carlo tools, including detector effects such as $b$-tagging, and limits on the relevant Wilson coefficients are extracted using kinematic distributions and a profile likelihood approach. Our results provide complementary constraints to existing SMEFT studies and yield the first process-specific limits on flavor-resolved four-fermion operators involving muons and bottom quarks from $Z$ decays.

hep-ph↗

arXiv2023

DCLP: Neural Architecture Predictor with Curriculum Contrastive Learning

Neural predictors have shown great potential in the evaluation process of neural architecture search (NAS). However, current predictor-based approaches overlook the fact that training a predictor necessitates a considerable number of trained neural networks as the labeled training set, which is costly to obtain. Therefore, the critical issue in utilizing predictors for NAS is to train a high-performance predictor using as few trained neural networks as possible. Although some methods attempt to address this problem through unsupervised learning, they often result in inaccurate predictions. We argue that the unsupervised tasks intended for the common graph data are too challenging for neural networks, causing unsupervised training to be susceptible to performance crashes in NAS. To address this issue, we propose a Curricumum-guided Contrastive Learning framework for neural Predictor (DCLP). Our method simplifies the contrastive task by designing a novel curriculum to enhance the stability of unlabeled training data distribution during contrastive training. Specifically, we propose a scheduler that ranks the training data according to the contrastive difficulty of each data and then inputs them to the contrastive learner in order. This approach concentrates the training data distribution and makes contrastive training more efficient. By using our method, the contrastive learner incrementally learns feature representations via unsupervised data on a smooth learning curve, avoiding performance crashes that may occur with excessively variable training data distributions. We experimentally demonstrate that DCLP has high accuracy and efficiency compared with existing predictors, and shows promising potential to discover superior architectures in various search spaces when combined with search strategies. Our code is available at: https://github.com/Zhengsh123/DCLP.

cs.LG↗

arXiv2022

Boosted tau lepton as a microscope and macroscope

Anomalies from the LHCb lepton flavour universality and Fermilab muon anomalous magnetic momentum, show tantalizing hints of possible new physics from the lepton sectors. Due to its large mass and shorter lifetime than muon, the tau lepton is believed to couple more to possible new physics beyond the standard model. Traditionally, tau leptons are probed through the decay products due to tau's short life time. On the other hand, at a high energy scale, a large fraction of tau leptons could be boosted to a much longer life time and fly a visible distance from several centimetres up to kilometer length scale, yet very informative to new physics beyond the standard model or high energy cosmic rays. In this article, we show unique yet promising tau physics by exploiting long-lived taus as a microscope or macroscope, to measure tau's anomalous magnetic momentum to an unprecedented level of accuracy and detect high energy cosmic neutrinos at the 1 TeV to 1 PeV scale, respectively.

hep-ph↗

arXiv2020

Auto-CASH: Autonomous Classification Algorithm Selection with Deep Q-Network

The great amount of datasets generated by various data sources have posed the challenge to machine learning algorithm selection and hyperparameter configuration. For a specific machine learning task, it usually takes domain experts plenty of time to select an appropriate algorithm and configure its hyperparameters. If the problem of algorithm selection and hyperparameter optimization can be solved automatically, the task will be executed more efficiently with performance guarantee. Such problem is also known as the CASH problem. Early work either requires a large amount of human labor, or suffers from high time or space complexity. In our work, we present Auto-CASH, a pre-trained model based on meta-learning, to solve the CASH problem more efficiently. Auto-CASH is the first approach that utilizes Deep Q-Network to automatically select the meta-features for each dataset, thus reducing the time cost tremendously without introducing too much human labor. To demonstrate the effectiveness of our model, we conduct extensive experiments on 120 real-world classification datasets. Compared with classical and the state-of-art CASH approaches, experimental results show that Auto-CASH achieves better performance within shorter time.

cs.LG↗

arXiv2019

Auto-Model: Utilizing Research Papers and HPO Techniques to Deal with the CASH problem

In many fields, a mass of algorithms with completely different hyperparameters have been developed to address the same type of problems. Choosing the algorithm and hyperparameter setting correctly can promote the overall performance greatly, but users often fail to do so due to the absence of knowledge. How to help users to effectively and quickly select the suitable algorithm and hyperparameter settings for the given task instance is an important research topic nowadays, which is known as the CASH problem. In this paper, we design the Auto-Model approach, which makes full use of known information in the related research paper and introduces hyperparameter optimization techniques, to solve the CASH problem effectively. Auto-Model tremendously reduces the cost of algorithm implementations and hyperparameter configuration space, and thus capable of dealing with the CASH problem efficiently and easily. To demonstrate the benefit of Auto-Model, we compare it with classical Auto-Weka approach. The experimental results show that our proposed approach can provide superior results and achieves better performance in a short time.

cs.AI↗