Searcharxiv⌕ Search

arXiv subjects

Yangyang Li

Publications and source records attributed to Yangyang Li.

At least 37 records · Page 2Linked to original sources
arXiv2025

BALNet: Deep Learning-Based Detection and Measurement of Broad Absorption Lines in Quasar Spectra

Broad absorption line (BAL) quasars serve as critical probes for understanding active galactic nucleus (AGN) outflows, black hole accretion, and cosmic evolution. To address the limitations of manual classification in large-scale spectroscopic surveys - where the number of quasar spectra is growing exponentially - we propose BALNet, a deep learning approach consisting of a one-dimensional convolutional neural network (1D-CNN) and bidirectional long short-term memory (Bi-LSTM) networks to automatically detect BAL troughs in quasar spectra. BALNet enables both the identification of BAL quasars and the measurement of their BAL troughs. We construct a simulated dataset for training and testing by combining non-BAL quasar spectra and BAL troughs, both derived from SDSS DR16 observations. Experimental results in the testing set show that: (1) BAL trough detection achieves 83.0% completeness, 90.7% purity, and an F1-score of 86.7%; (2) BAL quasar classification achieves 90.8% completeness and 94.4% purity; (3) the predicted BAL velocities agree closely with simulated ground truth labels, confirming BALNet's robustness and accuracy. When applied to the SDSS DR16 data within the redshift range 1.5<z<5.7, at least one BAL trough is detected in 20.4% of spectra. Notably, more than a quarter of these are newly identified sources with significant absorption, 8.8% correspond to redshifted systems, and some narrow/weak absorption features were missed. BALNet greatly improves the efficiency of large-scale BAL trough detection and enables more effective scientific analysis of quasar spectra.

astro-ph.GA↗
arXiv2025

Never Too Rigid to Reach: Adaptive Virtual Model Control with LLM- and Lyapunov-Based Reinforcement Learning

Robotic arms are increasingly deployed in uncertain environments, yet conventional control pipelines often become rigid and brittle when exposed to perturbations or incomplete information. Virtual Model Control (VMC) enables compliant behaviors by embedding virtual forces and mapping them into joint torques, but its reliance on fixed parameters and limited coordination among virtual components constrains adaptability and may undermine stability as task objectives evolve. To address these limitations, we propose Adaptive VMC with Large Language Model (LLM)- and Lyapunov-Based Reinforcement Learning (RL), which preserves the physical interpretability of VMC while supporting stability-guaranteed online adaptation. The LLM provides structured priors and high-level reasoning that enhance coordination among virtual components, improve sample efficiency, and facilitate flexible adjustment to varying task requirements. Complementarily, Lyapunov-based RL enforces theoretical stability constraints, ensuring safe and reliable adaptation under uncertainty. Extensive simulations on a 7-DoF Panda arm demonstrate that our approach effectively balances competing objectives in dynamic tasks, achieving superior performance while highlighting the synergistic benefits of LLM guidance and Lyapunov-constrained adaptation.

cs.RO↗
arXiv2025

DRO-InstructZero: Distributionally Robust Prompt Optimization for Large Language Models

Large language models are highly sensitive to prompt wording. However, popular automatic prompt search methods, including InstructZero, often degrade under distribution shift and adversarial evaluation because they optimize expected performance under a single evaluation distribution. Consequently, prompts that work in one setting frequently fail to transfer. To address this, DRO-InstructZero formulates zero-shot prompt optimization as robust Bayesian optimization. Specifically, an f-divergence ball defines an ambiguity set around the evaluation distribution, and a robust acquisition rule maximizes worst-case expected utility while retaining the query efficiency of Bayesian search. Therefore, the search explicitly targets reliability under distribution shift rather than average behavior alone. Experiments follow the instruction-induction protocol with matched query budgets across formality rewriting, code debugging, and translation. For example, on BIG-Bench informative-to-formal rewriting, accuracy improves from 61.3 +/- 0.7% to approximately 85-90%, yielding an absolute gain of about 25-30 points. Moreover, auto-debugging shows about +25-point gains under domain shift. Meanwhile, stable tasks such as cause-and-effect remain above 96%, indicating no loss on in-distribution cases. Furthermore, improvements are consistent across divergence choices and decoding temperatures. Overall, DRO-InstructZero connects distributionally robust optimization with prompt learning, offering a plug-and-play and general approach for reliable, transferable prompt alignment under real-world uncertainty.

cs.LG↗
arXiv2025

A Robust Classification Method using Hybrid Word Embedding for Early Diagnosis of Alzheimer's Disease

Early detection of Alzheimer's Disease (AD) is greatly beneficial to AD patients, leading to early treatments that lessen symptoms and alleviating financial burden of health care. As one of the leading signs of AD, language capability changes can be used for early diagnosis of AD. In this paper, I develop a robust classification method using hybrid word embedding and fine-tuned hyperparameters to achieve state-of-the-art accuracy in the early detection of AD. Specifically, we create a hybrid word embedding based on word vectors from Doc2Vec and ELMo to obtain perplexity scores of the sentences. The scores identify whether a sentence is fluent or not and capture semantic context of the sentences. I enrich the word embedding by adding linguistic features to analyze syntax and semantics. Further, we input an embedded feature vector into logistic regression and fine tune hyperparameters throughout the pipeline. By tuning hyperparameters of the machine learning pipeline (e.g., model regularization parameter, learning rate and vector size of Doc2Vec, and vector size of ELMo), I achieve 91% classification accuracy and an Area Under the Curve (AUC) of 97% in distinguishing early AD from healthy subjects. Based on my knowledge, my model with 91% accuracy and 97% AUC outperforms the best existing NLP model for AD diagnosis with an accuracy of 88% [32]. I study the model stability through repeated experiments and find that the model is stable even though the training data is split randomly (standard deviation of accuracy = 0.0403; standard deviation of AUC = 0.0174). This affirms our proposed method is accurate and stable. This model can be used as a large-scale screening method for AD, as well as a complementary examination for doctors to detect AD.

cs.CL↗
arXiv2025

The Impact of Medicaid Coverage on Mental Health, Why Insurance Makes People Happier in OHIE: by Spending Less or by Spending More?

The Oregon Health Insurance Experiment (OHIE) offers a unique opportunity to examine the causal relationship between Medicaid coverage and happiness among low-income adults, using an experimental design. This study leverages data from comprehensive surveys conducted at 0 and 12 months post-treatment. Previous studies based on OHIE have shown that individuals receiving Medicaid exhibited a significant improvement in mental health compared to those who did not receive coverage. The primary objective is to explore how Medicaid coverage impacts happiness, specifically analyzing in which direction variations in healthcare spending significantly improve mental health: higher spending or lower spending after Medicaid. Utilizing instrumental variable (IV) regression, I conducted six separate regressions across subgroups categorized by expenditure levels and happiness ratings, and the results reveal distinct patterns. Enrolling in OHP has significantly decreased the probability of experiencing unhappiness, regardless of whether individuals had high or low medical spending. Additionally, it decreased the probability of being pretty happy and having high medical expenses, while increasing the probability among those with lower expenses. Concerning the probability of being very happy, the OHP only had a positive effect on being very happy and spending less, and its effect on those with high expenses was insignificant. These findings align with the benefit of Medicaid: alleviating financial burden, contributing to the well-being of distinct subgroups.

econ.GN↗
arXiv2025

Source-Free Object Detection with Detection Transformer

Source-Free Object Detection (SFOD) enables knowledge transfer from a source domain to an unsupervised target domain for object detection without access to source data. Most existing SFOD approaches are either confined to conventional object detection (OD) models like Faster R-CNN or designed as general solutions without tailored adaptations for novel OD architectures, especially Detection Transformer (DETR). In this paper, we introduce Feature Reweighting ANd Contrastive Learning NetworK (FRANCK), a novel SFOD framework specifically designed to perform query-centric feature enhancement for DETRs. FRANCK comprises four key components: (1) an Objectness Score-based Sample Reweighting (OSSR) module that computes attention-based objectness scores on multi-scale encoder feature maps, reweighting the detection loss to emphasize less-recognized regions; (2) a Contrastive Learning with Matching-based Memory Bank (CMMB) module that integrates multi-level features into memory banks, enhancing class-wise contrastive learning; (3) an Uncertainty-weighted Query-fused Feature Distillation (UQFD) module that improves feature distillation through prediction quality reweighting and query feature fusion; and (4) an improved self-training pipeline with a Dynamic Teacher Updating Interval (DTUI) that optimizes pseudo-label quality. By leveraging these components, FRANCK effectively adapts a source-pre-trained DETR model to a target domain with enhanced robustness and generalization. Extensive experiments on several widely used benchmarks demonstrate that our method achieves state-of-the-art performance, highlighting its effectiveness and compatibility with DETR-based SFOD models.

cs.CV↗
arXiv2025

Investigating non-LTE abundances of Neodymium (Nd) in metal-poor FGK stars

The dominant site(s) of the $r$-process are a subject of current debate. Ejecta from $r$-process enrichment events like kilonovae are difficult to directly measure, so we must instead probe abundances in metal-poor stars to constrain $r$-process models. This requires state-of-the-art Non-Local Thermodynamic Equilibrium (NLTE) modeling, as LTE is a poor approximation for the low-opacity atmospheres of metal-poor giants. Neodymium (Nd) is a prominent $r$-process element detected in both near-infrared kilonovae spectra and spectra of metal-poor stars, so precise Nd stellar abundances are particularly needed to model kilonovae and constrain $r$-process sites. We thus constructed a Nd I / Nd II model atom to compute NLTE abundances in FGK metal-poor stars. We obtain $\mathrm{A(Nd)}_\odot = 1.44\pm0.05$, in agreement with the meteoritic value, when calibrating the model atom with a Drawin hydrogen collision factor of $S_H=0.1$. For a sample of metal-poor $r$-process enhanced stars with observed optical and near-infrared Nd II lines, we find NLTE Nd corrections in the range $-0.3$ to $0.3$ dex. Optical and UV lines have positive NLTE corrections, whereas H band lines have negative corrections. Additionally, we compute a large grid of NLTE corrections for 122 Nd II spectral lines ranging from the UV to the H band, for stellar parameters of typical metal-poor FGK dwarfs and giants with $-3.00\le\mbox{[Fe/H]}\le-1.00$ and $-2.0\le\mathrm{A(Nd)}\le2.0$. Within this grid, we find NLTE corrections ranging from $-0.3$ to $+0.5$ dex. Deviations from LTE are found to be strongest for blue lines with low excitation potentials in the most metal-poor giants.

astro-ph.SR↗
arXiv2025

Existence of 5 minimal tori in 3-spheres of positive Ricci curvature

In 1989, B. White conjectured that every Riemannian 3-sphere has at least 5 embedded minimal tori. We confirm this conjecture for 3-spheres of positive Ricci curvature. While our proof uses min-max theory, the underlying heuristics are largely inspired by mean curvature flow.

math.DG↗
arXiv2025

SMoLoRA: Exploring and Defying Dual Catastrophic Forgetting in Continual Visual Instruction Tuning

Visual instruction tuning (VIT) enables multimodal large language models (MLLMs) to effectively handle a wide range of vision tasks by framing them as language-based instructions. Building on this, continual visual instruction tuning (CVIT) extends the capability of MLLMs to incrementally learn new tasks, accommodating evolving functionalities. While prior work has advanced CVIT through the development of new benchmarks and approaches to mitigate catastrophic forgetting, these efforts largely follow traditional continual learning paradigms, neglecting the unique challenges specific to CVIT. We identify a dual form of catastrophic forgetting in CVIT, where MLLMs not only forget previously learned visual understanding but also experience a decline in instruction following abilities as they acquire new tasks. To address this, we introduce the Separable Mixture of Low-Rank Adaptation (SMoLoRA) framework, which employs separable routing through two distinct modules-one for visual understanding and another for instruction following. This dual-routing design enables specialized adaptation in both domains, preventing forgetting while improving performance. Furthermore, we propose a new CVIT benchmark that goes beyond existing benchmarks by additionally evaluating a model's ability to generalize to unseen tasks and handle diverse instructions across various tasks. Extensive experiments demonstrate that SMoLoRA outperforms existing methods in mitigating dual forgetting, improving generalization to unseen tasks, and ensuring robustness in following diverse instructions. Code is available at https://github.com/Minato-Zackie/SMoLoRA.

cs.CV↗
arXiv2025

Design of meta-surface lens integrated with pupil filter

Metasurface lenses are miniature flat lenses that can precisely control the phase, amplitude, and polarization of incident light by modulating the parameters of each unit on the substrate. Compared with conventional optical lenses, they have the advantages of small size, light weight, and high integration, and are the core components of photonic chips. Currently, the hot topics for metasurface lens are broadband and achromatic devices, and there is still less attention paid to the resolution improvement. To break through the diffraction limit and further improve the focusing performance and imaging resolution of metasurface lenses, we use unit cells to perform multi-dimensional modulation of the incident light field. Specifically, in this paper, we combine phase modulation of metasurface lens with a pupil filtering, which has been widely applied to traditional microscopy imaging and adaptive optics and has demonstrated powerful resolution enhancement effects. The integrating of these two technologies will continue to improve the imaging performance of metasurface lenses and thus expanding their application fields. This result preliminarily demonstrates the super-resolution performance of the integrated meta-surface lens. With the comprehensive regulation of multi-dimensional information, such as amplitude, polarization, and vortex, the integrated meta-surface optical lens will achieve more excellent super-resolution focusing and imaging performance, and will also be widely used in the fields of super-resolution imaging, virtual reality, and three-dimensional optical display, due to its characteristics of high resolution, high integration, and high miniaturization.

physics.optics↗
arXiv2025

Meta knowledge assisted Evolutionary Neural Architecture Search

Evolutionary computation (EC)-based neural architecture search (NAS) has achieved remarkable performance in the automatic design of neural architectures. However, the high computational cost associated with evaluating searched architectures poses a challenge for these methods, and a fixed form of learning rate (LR) schedule means greater information loss on diverse searched architectures. This paper introduces an efficient EC-based NAS method to solve these problems via an innovative meta-learning framework. Specifically, a meta-learning-rate (Meta-LR) scheme is used through pretraining to obtain a suitable LR schedule, which guides the training process with lower information loss when evaluating each individual. An adaptive surrogate model is designed through an adaptive threshold to select the potential architectures in a few epochs and then evaluate the potential architectures with complete epochs. Additionally, a periodic mutation operator is proposed to increase the diversity of the population, which enhances the generalizability and robustness. Experiments on CIFAR-10, CIFAR-100, and ImageNet1K datasets demonstrate that the proposed method achieves high performance comparable to that of many state-of-the-art peer methods, with lower computational cost and greater robustness.

cs.NE↗
arXiv2025

Leveraging LLMs for Influence Path Planning in Proactive Recommendation

Recommender systems are pivotal in Internet social platforms, yet they often cater to users' historical interests, leading to critical issues like echo chambers. To broaden user horizons, proactive recommender systems aim to guide user interest to gradually like a target item beyond historical interests through an influence path,i.e., a sequence of recommended items. As a representative, Influential Recommender System (IRS) designs a sequential model for influence path planning but faces issues of lacking target item inclusion and path coherence. To address the issues, we leverage the advanced planning capabilities of Large Language Models (LLMs) and propose an LLM-based Influence Path Planning (LLM-IPP) method. LLM-IPP generates coherent and effective influence paths by capturing user interest shifts and item characteristics. We introduce novel evaluation metrics and user simulators to benchmark LLM-IPP against traditional methods. Our experiments demonstrate that LLM-IPP significantly enhances user acceptability and path coherence, outperforming existing approaches.

cs.IR↗
arXiv2025

Non-persistence of strongly isolated singularities, and geometric applications

We obtain a generic regularity result for stationary integral $n$-varifolds with only strongly isolated singularities inside $N$-dimensional Riemannian manifolds, in absence of any restriction on the dimension ($n\geq 2$) and codimension. As a special case, we prove that for any $n\geq 2$ and any compact $(n+1)$-dimensional manifold $M$ the following holds: for a generic choice of the background metric $g$ all stationary integral $n$-varifolds in $(M,g)$ will either be entirely smooth or have at least one singular point that is not strongly isolated. In other words, only ``more complicated'' singularities may possibly persist. This implies, for instance, a generic finiteness result for the class of all closed minimal hypersurfaces of area at most $4π^2-\varepsilon$ (for any $\varepsilon>0$) in nearly round four-spheres: we can thus give precise answers, in the negative, to the questions of persistence of the Clifford football and of Hsiang's hyperspheres in nearly round metrics. The aforementioned main regularity result is achieved as a consequence of the fine analysis of the Fredholm index of the Jacobi operator for such varifolds: we prove on the one hand an exact formula relating that number to the Morse indices of the conical links at the singular points, while on the other hand we show that the same number is non-negative for all such varifolds if the ambient metric is generic.

math.DG↗
arXiv2025

NLTE abundances of Eu for a sample of metal-poor stars in the Galactic Halo and Metal-poor Disk with 1D and <3D> models

Accurate measurements of europium abundances in cool stars are essential for an enhanced understanding of the r-process mechanisms. We measure the abundance of Eu in solar spectra and a sample of metal-poor stars in the Galactic halo and metal-poor disk, with the metallicities ranging from \GG{$-2.4$} to $-0.5$ dex, using non-local thermodynamic equilibrium (NLTE) line formation. We compare these measurements with Galactic Chemical Evolution (GCE) models to \GG{explore the impact of the NLTE corrections on the contribution of r-process site in Galactic chemical evolution. In this work, we use NLTE line formation, as well as one-dimensional (1D) hydrostatic and spatial averages of 3D hydrodynamical ($<$3D$>$) model atmospheres to measure the abundance of Eu based on both the Eu II 4129 Å and Eu II 6645 Å lines for solar spectra and metal-poor stars. We find that \GG{for Eu II 4129 Å line the NLTE modelling leads to higher (0.04 dex) solar Eu abundance in 1D and higher (0.07 dex) in \GG{$<$3D$>$} NLTE while} NLTE modelling leads to higher (0.01 dex) solar Eu abundance in 1D and lower (0.03 dex) in \GG{$<$3D$>$} NLTE for Eu II 6645 Å line. Although the NLTE corrections for the Eu II $λ$ 4129 Å and Eu II $λ$ 6645 Å lines are opposite, the discrepancy between the abundances derived from these individual lines reduces after applying NLTE corrections, highlighting the critical role of NLTE abundance determinations. By comparing these measurements with Galactic chemical evolution (GCE) models, we find that the \G{amount of NLTE correction does not require significant change of the parameters for Eu production} in the GCE models.

astro-ph.SR↗
arXiv2025

Achieving Hiding and Smart Anti-Jamming Communication: A Parallel DRL Approach against Moving Reactive Jammer

This paper addresses the challenge of anti-jamming in moving reactive jamming scenarios. The moving reactive jammer initiates high-power tracking jamming upon detecting any transmission activity, and when unable to detect a signal, resorts to indiscriminate jamming. This presents dual imperatives: maintaining hiding to avoid the jammer's detection and simultaneously evading indiscriminate jamming. Spread spectrum techniques effectively reduce transmitting power to elude detection but fall short in countering indiscriminate jamming. Conversely, changing communication frequencies can help evade indiscriminate jamming but makes the transmission vulnerable to tracking jamming without spread spectrum techniques to remain hidden. Current methodologies struggle with the complexity of simultaneously optimizing these two requirements due to the expansive joint action spaces and the dynamics of moving reactive jammers. To address these challenges, we propose a parallelized deep reinforcement learning (DRL) strategy. The approach includes a parallelized network architecture designed to decompose the action space. A parallel exploration-exploitation selection mechanism replaces the $\varepsilon $-greedy mechanism, accelerating convergence. Simulations demonstrate a nearly 90\% increase in normalized throughput.

cs.IT↗
arXiv2025

A Distributed Hybrid Quantum Convolutional Neural Network for Medical Image Classification

Medical images are characterized by intricate and complex features, requiring interpretation by physicians with medical knowledge and experience. Classical neural networks can reduce the workload of physicians, but can only handle these complex features to a limited extent. Theoretically, quantum computing can explore a broader parameter space with fewer parameters, but it is currently limited by the constraints of quantum hardware.Considering these factors, we propose a distributed hybrid quantum convolutional neural network based on quantum circuit splitting. This model leverages the advantages of quantum computing to effectively capture the complex features of medical images, enabling efficient classification even in resource-constrained environments. Our model employs a quantum convolutional neural network (QCNN) to extract high-dimensional features from medical images, thereby enhancing the model's expressive capability.By integrating distributed techniques based on quantum circuit splitting, the 8-qubit QCNN can be reconstructed using only 5 qubits.Experimental results demonstrate that our model achieves strong performance across 3 datasets for both binary and multiclass classification tasks. Furthermore, compared to recent technologies, our model achieves superior performance with fewer parameters, and experimental results validate the effectiveness of our model.

cs.CV↗
arXiv2024

Masked Image Modeling Boosting Semi-Supervised Semantic Segmentation

In view of the fact that semi- and self-supervised learning share a fundamental principle, effectively modeling knowledge from unlabeled data, various semi-supervised semantic segmentation methods have integrated representative self-supervised learning paradigms for further regularization. However, the potential of the state-of-the-art generative self-supervised paradigm, masked image modeling, has been scarcely studied. This paradigm learns the knowledge through establishing connections between the masked and visible parts of masked image, during the pixel reconstruction process. By inheriting and extending this insight, we successfully leverage masked image modeling to boost semi-supervised semantic segmentation. Specifically, we introduce a novel class-wise masked image modeling that independently reconstructs different image regions according to their respective classes. In this way, the mask-induced connections are established within each class, mitigating the semantic confusion that arises from plainly reconstructing images in basic masked image modeling. To strengthen these intra-class connections, we further develop a feature aggregation strategy that minimizes the distances between features corresponding to the masked and visible parts within the same class. Additionally, in semantic space, we explore the application of masked image modeling to enhance regularization. Extensive experiments conducted on well-known benchmarks demonstrate that our approach achieves state-of-the-art performance. The code will be available at https://github.com/haoxt/S4MIM.

cs.CV↗