Searcharxiv⌕ Search

arXiv subjects

Ying Chen

Publications and source records attributed to Ying Chen.

At least 163 records · Page 9Linked to original sources

Form factors in semileptonic decay of D mesons

We study the vector, scalar and tensor form factors for the semileptonic process $D\rightarrow K$ by using lattice Quantum Chromodynamcs (QCD). Chiral lattice fermions are used in our study: overlap fermion for the valence quark and domain-wall fermion for the sea. The 2+1-flavor configurations are from the RBC-UKQCD Collaborations with an inverse lattice spacing $1/a=2.383(9)$ GeV. A modified $z$-expansion taking into account valence quark mass dependence is used to fit our numerical results of the form factors at a fixed pion mass $\sim360$ MeV in the sea. At the physical valence quark mass point we give the preliminary results $f_+(0)=f_0(0)=0.760(39)$ and $f_T(0)=0.733(50)$ with only statistical uncertainties. For $f_T$ the number is given in the $\overline{\rm MS}$ scheme at a scale of 2 GeV.

hep-lat↗

Third-order Orbital Corner State and its Realization in Acoustic Crystals

Three dimensional (3D) third-order topological insulators (TIs) have zero-dimensional (0D) corner states, which are three dimensions lower than bulk. Here we investigate the third-order TIs on breathing pyrochlore lattices with p-orbital freedom. The tight-binding Hamiltonian is derived for the p-orbital model, in which we find that the two orthogonal $π$-type (transverse) hoppings are the key to open a band gap and obtain higher-order topological corner states. We introduce the Z4 berry phase to characterize the bulk topology and analysis the phase diagram. The corner states, demonstrated in a finite structure of a regular tetrahedron, exhibit rich 3D orbital configurations. Furthermore, we design an acoustic system to introduce the necessary $π$-type hopping and successfully observe the orbital corner states. Our work extends topological orbital corner states to third-order, which enriches the contents of orbital physics and may lead to applications in novel topological acoustic devices.

physics.app-ph↗

Practical Performative Policy Learning with Strategic Agents

This paper studies the performative policy learning problem, where agents adjust their features in response to a released policy to improve their potential outcomes, inducing an endogenous distribution shift. There has been growing interest in training machine learning models in strategic environments, including strategic classification and performative prediction. However, existing approaches often rely on restrictive parametric assumptions: micro-level utility models in strategic classification and macro-level data distribution maps in performative prediction, severely limiting scalability and generalizability. We approach this problem as a complex causal inference task, relaxing parametric assumptions on both micro-level agent behavior and macro-level data distribution. Leveraging bounded rationality, we uncover a practical low-dimensional structure in distribution shifts and construct an effective mediator in the causal path from the deployed model to the shifted data. We then propose a gradient-based policy optimization algorithm with a differentiable classifier as a substitute for the high-dimensional distribution map. Our algorithm efficiently utilizes batch feedback and limited manipulation patterns. Our approach achieves high sample efficiency compared to methods reliant on bandit feedback or zero-order optimization. We also provide theoretical guarantees for algorithmic convergence. Extensive and challenging experiments on high-dimensional settings demonstrate our method's practical efficacy.

cs.LG↗

Differentially Private Distributed Nash Equilibrium Seeking over Time-Varying Digraphs

This paper proposes a new differentially private distributed Nash equilibrium seeking algorithm for aggregative games under time-varying unbalanced directed communication graphs. Random independent Laplace noises are injected into the transmitted information to protect players' sensitive information. Then, the push-sum consensus protocol is utilized to estimate the aggregate function with the perturbed information under the time-varying topologies. The weakening factor and the momentum term are designed to attenuate the negative affect of the noise and guarantee the convergence of the algorithm, respectively. The algorithm is then proven to ensure the almost sure convergence, as well as rigorous differential privacy with a finite cumulative privacy budget, without requiring a trade-off between provable convergence and differential privacy. Finally, the simulation is provided to demonstrate the effectiveness of the proposed algorithm.

cs.GT↗

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions

Quantum computing is poised to transform the financial industry, yet its advantages over traditional methods have not been evidenced. As this technology rapidly evolves, benchmarking is essential to fairly evaluate and compare different computational strategies. This study presents a challenging yet solvable problem of large-scale dynamic portfolio optimization under realistic market conditions with frictions. We frame this issue as a Quadratic Unconstrained Binary Optimization (QUBO) problem, compatible with digital computing and ready for quantum computing, to establish a reliable benchmark. By applying the latest solvers to real data, we release benchmarks that help verify true advancements in dynamic trading strategies, either quantum or digital computing, ensuring that reported improvements in portfolio optimization are based on robust, transparent, and comparable metrics.

math.OC↗

CLIP-DQA: Blindly Evaluating Dehazed Images from Global and Local Perspectives Using CLIP

Blind dehazed image quality assessment (BDQA), which aims to accurately predict the visual quality of dehazed images without any reference information, is essential for the evaluation, comparison, and optimization of image dehazing algorithms. Existing learning-based BDQA methods have achieved remarkable success, while the small scale of DQA datasets limits their performance. To address this issue, in this paper, we propose to adapt Contrastive Language-Image Pre-Training (CLIP), pre-trained on large-scale image-text pairs, to the BDQA task. Specifically, inspired by the fact that the human visual system understands images based on hierarchical features, we take global and local information of the dehazed image as the input of CLIP. To accurately map the input hierarchical information of dehazed images into the quality score, we tune both the vision branch and language branch of CLIP with prompt learning. Experimental results on two authentic DQA datasets demonstrate that our proposed approach, named CLIP-DQA, achieves more accurate quality predictions over existing BDQA methods. The code is available at https://github.com/JunFu1995/CLIP-DQA.

cs.CV↗

Multilineage-differentiating stress-enduring cells alleviate neuropathic pain in mice by secreting TGF-b and IL-10

Neuropathic pain is a chronic condition characterized by damage to and dysfunction of the peripheral or central nervous system. There are currently no effective treatment options available for neuropathic pain, and existing drugs often provide only temporary relief with potential side effects. Multilineage-differentiating stress-enduring (Muse) cells are characterized by high expansion potential, a stable phenotype and strong immunosuppression. These properties make them attractive candidates for therapeutics for neuropathic pain management. In this study, we conducted a series of experiments to evaluate the effect of Muse cells on neuropathic pain. Muse cells from different species demonstrated analgesic potential by reversing CCI-induced neuropathic pain. Protein profiling revealed a high degree of similarity between Muse cells and BMSCs. The intrathecal injection of Muse cells effectively reduced neuropathic pain in various mouse models, resulting in better analgesic effects than the administration of equivalent low doses of BMSCs. Immunohistochemical analysis and qPCR revealed the ability of Muse cells to inhibit spinal cord neuroinflammation caused by SNI. In addition, Transwell and ELISA revealed that Muse cells migrated through the injured dorsal root ganglion (DRG) via the CCR7-CCL21 chemotactic axis. In addition, the secretion of TGF-b and IL-10 by Muse cells was identified as the mechanism underlying the analgesic effect of Muse cells. The capacity of Muse cells to mitigate neuroinflammation and produce analgesic effects via the modulation of TGF-b and IL-10 underscores their potential as promising therapeutic approaches for the treatment of neuropathic pain.

q-bio.TO↗

SELMA3D challenge: Self-supervised learning for 3D light-sheet microscopy image segmentation

Recent innovations in light sheet microscopy, paired with developments in tissue clearing techniques, enable the 3D imaging of large mammalian tissues with cellular resolution. Combined with the progress in large-scale data analysis, driven by deep learning, these innovations empower researchers to rapidly investigate the morphological and functional properties of diverse biological samples. Segmentation, a crucial preliminary step in the analysis process, can be automated using domain-specific deep learning models with expert-level performance. However, these models exhibit high sensitivity to domain shifts, leading to a significant drop in accuracy when applied to data outside their training distribution. To address this limitation, and inspired by the recent success of self-supervised learning in training generalizable models, we organized the SELMA3D Challenge during the MICCAI 2024 conference. SELMA3D provides a vast collection of light-sheet images from cleared mice and human brains, comprising 35 large 3D images-each with over 1000^3 voxels-and 315 annotated small patches for finetuning, preliminary testing and final testing. The dataset encompasses diverse biological structures, including vessel-like and spot-like structures. Five teams participated in all phases of the challenge, and their proposed methods are reviewed in this paper. Quantitative and qualitative results from most participating teams demonstrate that self-supervised learning on large datasets improves segmentation model performance and generalization. We will continue to support and extend SELMA3D as an inaugural MICCAI challenge focused on self-supervised learning for 3D microscopy image segmentation.

eess.IV↗

Deep Switching State Space Model (DS$^3$M) for Nonlinear Time Series Forecasting with Regime Switching

Modern time series data often display complex nonlinear dependencies along with irregular regime-switching behaviors. These features present technical challenges in modeling, inference, and in offering insightful understanding into the underlying stochastic phenomena. To tackle these challenges, we introduce a novel modeling framework known as the Deep Switching State Space Model (DS$^3$M). This framework is engineered to make accurate forecasts for such time series while adeptly identifying the irregular regimes hidden within the dynamics. These identifications not only have significant economic ramifications but also contribute to a deeper understanding of the underlying phenomena. In DS$^3$M, the architecture employs discrete latent variables to represent regimes and continuous latent variables to account for random driving factors. By melding a Recurrent Neural Network (RNN) with a nonlinear Switching State Space Model (SSSM), we manage to capture the nonlinear dependencies and irregular regime-switching behaviors, governed by a Markov chain and parameterized using multilayer perceptrons. We validate the effectiveness and regime identification capabilities of DS$^3$M through short- and long-term forecasting tests on a wide array of simulated and real-world datasets, spanning sectors such as healthcare, economics, traffic, meteorology, and energy. Experimental results reveal that DS$^3$M outperforms several state-of-the-art models in terms of forecasting accuracy, while providing meaningful regime identifications.

cs.LG↗

Charmed meson masses and decay constants in the continuum from the tadpole improved clover ensembles

We present the determination of the charm quark mass, the masses, and decay constants of charmed mesons using thirteen 2+1 flavor gauge ensembles at five different lattice spacings $a\in[0.05,0.11]$ fm, 8 pion masses $m_π\in(130,360)$ MeV, and several values of the strange quark mass, which facilitate us to do the chiral and continuum extrapolation. These ensembles are generated through the stout smeared clover fermion action and Symanzik gauge actions with the tadpole improvement. By absorbing the discretization errors into the masses and field normalization of the charm quark, we manage to suppress the discretization error of the charmed meson mass and all the S-wave open charmed meson decay constants to a few percent or even less at lattice spacing \( a \sim 0.1 \) fm. Moreover, discretization errors for other quantities are also significantly reduced. The continuum extrapolated charm quark mass, $m_c(m_c)=1.2933(72)(95)$ GeV in $\overline{\textrm{MS}}$ scheme, is determined using QED-subtracted $D_s$ meson mass and non-perturbative renormalization. Predictions of the open and close charm mesons using this charm quark mass agree with the experimental values at 0.1-0.5\% level uncertainty. We obtained $D_{(s)}$ decay constants and also by far the most precise $D_{(s)}^*$ decay constants $f_{D^*}=0.2292(26)(17)$ GeV and $f_{D^*_s}=0.2691(30)(03)$ GeV.

hep-lat↗

Analyzing Country-Level Vaccination Rates and Determinants of Practical Capacity to Administer COVID-19 Vaccines

The COVID-19 vaccine development, manufacturing, transportation, and administration proved an extreme logistics operation of global magnitude. Global vaccination levels, however, remain a key concern in preventing the emergence of new strains and minimizing the impact of the pandemic's disruption of daily life. In this paper, country-level vaccination rates are analyzed through a queuing framework to extract service rates that represent the practical capacity of a country to administer vaccines. These rates are further characterized through regression and interpretable machine learning methods with country-level demographic, governmental, and socio-economic variates. Model results show that participation in multi-governmental collaborations such as COVAX may improve the ability to vaccinate. Similarly, improved transportation and accessibility variates such as roads per area for low-income countries and rail lines per area for high-income countries can improve rates. It was also found that for low-income countries specifically, improvements in basic and health infrastructure (as measured through spending on healthcare, number of doctors and hospital beds per 100k, population percent with access to electricity, life expectancy, and vehicles per 1000 people) resulted in higher vaccination rates. Of the high-income countries, those with larger 65-plus populations struggled to vaccinate at high rates, indicating potential accessibility issues for the elderly. This study finds that improving basic and health infrastructure, focusing on accessibility in the last mile, particularly for the elderly, and fostering global partnerships can improve logistical operations of such a scale. Such structural impediments and inequities in global health care must be addressed in preparation for future global public health crises.

econ.GN↗

Decay properties of light $1^{-+}$ hybrids

We explore the decay properties of the isovector and isoscalar $1^{-+}$ light hybrids, $π_1$ and $η_1$, in $N_f=2$ lattice QCD at a pion mass $m_π\approx 417~\mathrm{MeV}$. The McNeile and Michael method is adopted to extract the effective couplings for individual decay modes, which are used to estimate the partial decay widths of $π_1(1600)$ and $η_1(1855)$ by assuming SU(3) symmetry. The partial decay widths of $π_1(1600)$ are predicted to be $(Γ_{b_1π}, Γ_{f_1(1285)π}, Γ_{ρπ}, Γ_{K^*\bar{K}}) = (325 \pm 75, \mathcal{O}(10), 52 \pm 7, 8.6 \pm 1.3)~\mathrm{MeV}$, and the total width is estimated to be $396 \pm 90~\mathrm{MeV}$, considering only statistical errors. If $η_1(1855)$ and the $4.4σ$ signal observed by BESIII (labeled as $η_1(2200)$) are taken as the two mass eigenstates of the isoscalar $1^{-+}$ light hybrids in SU(3), then the dominant decay channel(s) of $η_1(1855)$ ($η_1(2200)$) is $K_1(1270)\bar{K}$ ($K_1(1270)\bar{K}$ and $K_1(1400)\bar{K}$) through the $1^{+(-)}0^{-(+)}$ mode. The vector-vector decay modes are also significant for the two $η_1$ states. Using the mixing angle $α\approx 22.7^\circ$ obtained from lattice QCD for the two $η_1$ states, the total widths are estimated to be $Γ_{η_1(1855)}=282(85)~\mathrm{MeV}$ and $Γ_{η_1(2200)}=455(143)~\mathrm{MeV}$. The former is compatible with the experimental width of $η_1(1855)$. Although many systematic uncertainties are not well controlled, these results are qualitatively informative for the experimental search for light hybrids.

hep-lat↗

Group Shapley with Robust Significance Testing and Its Application to Bond Recovery Rate Prediction

We propose Group Shapley, a metric that extends the classical individual-level Shapley value framework to evaluate the importance of feature groups, addressing the structured nature of predictors commonly found in business and economic data. More importantly, we develop a significance testing procedure based on a three-cumulant chi-square approximation and establish the asymptotic properties of the test statistics for Group Shapley values. Our approach can effectively handle challenging scenarios, including sparse or skewed distributions and small sample sizes, outperforming alternative tests such as the Wald test. Simulations confirm that the proposed test maintains robust empirical size and demonstrates enhanced power under diverse conditions. To illustrate the method's practical relevance in advancing Explainable AI, we apply our framework to bond recovery rate predictions using a global dataset (1996-2023) comprising 2,094 observations and 98 features, grouped into 16 subgroups and five broader categories: bond characteristics, firm fundamentals, industry-specific factors, market-related variables, and macroeconomic indicators. Our results identify the market-related variables group as the most influential. Furthermore, Lorenz curves and Gini indices reveal that Group Shapley assigns feature importance more equitably compared to individual Shapley values.

stat.ML↗

AdaMixup: A Dynamic Defense Framework for Membership Inference Attack Mitigation

Membership inference attacks have emerged as a significant privacy concern in the training of deep learning models, where attackers can infer whether a data point was part of the training set based on the model's outputs. To address this challenge, we propose a novel defense mechanism, AdaMixup. AdaMixup employs adaptive mixup techniques to enhance the model's robustness against membership inference attacks by dynamically adjusting the mixup strategy during training. This method not only improves the model's privacy protection but also maintains high performance. Experimental results across multiple datasets demonstrate that AdaMixup significantly reduces the risk of membership inference attacks while achieving a favorable trade-off between defensive efficiency and model accuracy. This research provides an effective solution for data privacy protection and lays the groundwork for future advancements in mixup training methods.

cs.LG↗

Human-Centered Design for AI-based Automatically Generated Assessment Reports: A Systematic Review

This paper provides a comprehensive review of the design and implementation of automatically generated assessment reports (AutoRs) for formative use in K-12 Science, Technology, Engineering, and Mathematics (STEM) classrooms. With the increasing adoption of technology-enhanced assessments, there is a critical need for human-computer interactive tools that efficiently support the interpretation and application of assessment data by teachers. AutoRs are designed to provide synthesized, interpretable, and actionable insights into students' performance, learning progress, and areas for improvement. Guided by cognitive load theory, this study emphasizes the importance of reducing teachers' cognitive demands through user-centered and intuitive designs. It highlights the potential of diverse information presentation formats such as text, visual aids, and plots and advanced functionalities such as live and interactive features to enhance usability. However, the findings also reveal that many existing AutoRs fail to fully utilize these approaches, leading to high initial cognitive demands and limited engagement. This paper proposes a conceptual framework to inform the design, implementation, and evaluation of AutoRs, balancing the trade-offs between usability and functionality. The framework aims to address challenges in engaging teachers with technology-enhanced assessment results, facilitating data-driven decision-making, and providing personalized feedback to improve the teaching and learning process.

cs.HC↗

Imitate Before Detect: Aligning Machine Stylistic Preference for Machine-Revised Text Detection

Large Language Models (LLMs) have revolutionized text generation, making detecting machine-generated text increasingly challenging. Although past methods have achieved good performance on detecting pure machine-generated text, those detectors have poor performance on distinguishing machine-revised text (rewriting, expansion, and polishing), which can have only minor changes from its original human prompt. As the content of text may originate from human prompts, detecting machine-revised text often involves identifying distinctive machine styles, e.g., worded favored by LLMs. However, existing methods struggle to detect machine-style phrasing hidden within the content contributed by humans. We propose the "Imitate Before Detect" (ImBD) approach, which first imitates the machine-style token distribution, and then compares the distribution of the text to be tested with the machine-style distribution to determine whether the text has been machine-revised. To this end, we introduce style preference optimization (SPO), which aligns a scoring LLM model to the preference of text styles generated by machines. The aligned scoring model is then used to calculate the style-conditional probability curvature (Style-CPC), quantifying the log probability difference between the original and conditionally sampled texts for effective detection. We conduct extensive comparisons across various scenarios, encompassing text revisions by six LLMs, four distinct text domains, and three machine revision types. Compared to existing state-of-the-art methods, our method yields a 13% increase in AUC for detecting text revised by open-source LLMs, and improves performance by 5% and 19% for detecting GPT-3.5 and GPT-4o revised text, respectively. Notably, our method surpasses the commercially trained GPT-Zero with just $1,000$ samples and five minutes of SPO, demonstrating its efficiency and effectiveness.

cs.CL↗

Fine-grained Text to Image Synthesis

Fine-grained text to image synthesis involves generating images from texts that belong to different categories. In contrast to general text to image synthesis, in fine-grained synthesis there is high similarity between images of different subclasses, and there may be linguistic discrepancy among texts describing the same image. Recent Generative Adversarial Networks (GAN), such as the Recurrent Affine Transformation (RAT) GAN model, are able to synthesize clear and realistic images from texts. However, GAN models ignore fine-grained level information. In this paper we propose an approach that incorporates an auxiliary classifier in the discriminator and a contrastive learning method to improve the accuracy of fine-grained details in images synthesized by RAT GAN. The auxiliary classifier helps the discriminator classify the class of images, and helps the generator synthesize more accurate fine-grained images. The contrastive learning method minimizes the similarity between images from different subclasses and maximizes the similarity between images from the same subclass. We evaluate on several state-of-the-art methods on the commonly used CUB-200-2011 bird dataset and Oxford-102 flower dataset, and demonstrated superior performance.

cs.CV↗

Photometric Selection of type 1 Quasars in the XMM-LSS Field with Machine Learning and the Disk-Corona Connection

We present photometric selection of type 1 quasars in the $\approx5.3~{\rm deg}^{2}$ XMM-Large Scale Structure (XMM-LSS) survey field with machine learning. We constructed our training and \hbox{blind-test} samples using spectroscopically identified SDSS quasars, galaxies, and stars. We utilized the XGBoost machine learning method to select a total of 1\,591 quasars. We assessed the classification performance based on the blind-test sample, and the outcome was favorable, demonstrating high reliability ($\approx99.9\%$) and good completeness ($\approx87.5\%$). We used XGBoost to estimate photometric redshifts of our selected quasars. The estimated photometric redshifts span a range from 0.41 to 3.75. The outlier fraction of these photometric redshift estimates is $\approx17\%$ and the normalized median absolute deviation ($σ_{\rm NMAD}$) is $\approx0.07$. To study the quasar disk-corona connection, we constructed a subsample of 1\,016 quasars with HSC $i<22.5$ after excluding radio-loud and potentially X-ray-absorbed quasars. The relation between the optical-to-X-ray power-law slope parameter ($α_{\rm OX}$) and the 2500 Angstrom monochromatic luminosity ($L_{2500}$) for this subsample is $α_{\rm OX}=(-0.156\pm0.007)~{\rm log}~{L_{\rm 2500}}+(3.175\pm0.211)$ with a dispersion of 0.159. We found this correlation in good agreement with the correlations in previous studies. We explored several factors which may bias the $α_{\rm OX}$-$L_{\rm 2500}$ relation and found that their effects are not significant. We discussed possible evolution of the $α_{\rm OX}$-$L_{\rm 2500}$ relation with respect to $L_{\rm 2500}$ or redshift.

astro-ph.GA↗