arXiv subjects

Yuhan Yang

Publications and source records attributed to Yuhan Yang.

17 recordsLinked to original sources

arXiv2026

Simulate, Reason, Decide: Scientific Reasoning with LLMs for Simulation-Driven Decision Making

Scientific simulators are increasingly being integrated into LLM-driven systems for high-stakes simulation-driven decision-making. However, existing frameworks primarily use LLMs to generate, calibrate, or execute simulators, treating them as black-box interfaces rather than as structured mechanistic systems that can be reasoned about. As a result, current approaches lack the ability to identify, represent, and reason about the assumptions and mechanisms underlying simulator behavior, limiting transparency, auditability, and decision justification. We introduce MechSim, a mechanism-grounded neuro-symbolic reasoning framework for executable scientific simulators. Unlike prior neuro-symbolic approaches that primarily reason over static symbolic structures, MechSim enables LLM agents to reason about the mechanisms, assumptions, and execution behavior of scientific simulators. Our framework represents simulators through a shared structured schema capturing assumptions, variables, mechanism dependencies, and execution traces. On top of this representation, LLM agents operate as constrained reasoning engines that generate structured, evidence-grounded explanations linking simulator outcomes to their underlying mechanisms. We evaluate our approach across multiple high-stakes domains and show that it improves mechanism-level explanation quality, simulator analysis, and downstream decision-making reliability.

cs.AI↗

arXiv2026

ALMA-QUARKS view of W49N: Multipolar episodic outflow associated with the most energetic Galactic water maser

We present a detailed investigation of a multipolar episodic molecular outflow in the mini-starburst region W49N, which hosts the most luminous water maser in the Galaxy. Using high-resolution ($\sim$0.3 arcsec) Atacama Large Millimeter/submillimeter Array (ALMA) observations of the $\mathrm{^{12}CO}$ emission as part of the ALMA-QUARKS survey, we analyze the morphology and kinematics of the outflow. Our observations reveal four newly identified outflow lobes in addition to the previously known central bipolar jet. These lobes appear more jet-like rather than exhibiting wide opening angles. Based on the $\mathrm{^{12}CO}$ (2-1) and $\mathrm{^{13}CO}$ (2-1) emission, we provide a more reliable estimate of the outflow's physical parameters, confirming it as one of the most energetic outflows in the Galaxy. Notably, these newly discovered lobes exhibit chains of knots, a characteristic signature of episodic ejection. Furthermore, two of the lobes display prominent S-shaped wiggles, suggestive of a precessing jet. The discovery of these features -- commonly observed in outflows from low-mass protostars -- in such an extreme massive star-forming environment provides compelling evidence that some underlying physical mechanisms for launching outflows are conserved across a wide range of stellar masses.

astro-ph.GA↗

arXiv2026

Secure Joint Source-Channel Coding for the AWGN Channel with Feedback: A Finite Blocklength Analysis

In the literature, it has been shown that the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel with noise-free feedback equals the capacity of the same model without secrecy constraint, and the classical Schalkwijk-Kailath (SK) scheme achieves the secrecy capacity. In this paper, we show that in finite blocklength regime, the SK scheme is not optimal, and propose a modified SK scheme which may perform better than the classical one. Besides this, this paper establishes a finite blocklength converse for the AWGN wiretap channel with feedback, which can also be viewed as a converse for the same model without secrecy constraint. To the best of the authors' knowledge, this is the first paper to address such a problem, and the results of this paper are further explained via numerical examples.

cs.IT↗

arXiv2026

Coding for Fading Channels with Imperfect CSI at the Transmitter and Quantized Feedback

The classical Schalkwijk-Kailath (SK) scheme for the additive Gaussian noise channel with noiseless feedback is highly efficient since its coding complexity is extremely low and the decoding error doubly exponentially decays as the coding blocklength tends to infinity. However, how to extend the SK scheme to channel models with memory has yet to be solved. In this paper, we first investigate how to design SK-type scheme for the 2-path quasi-static fading channel with noiseless feedback. By viewing the signal of the second path as a relay and adopting an amplify-and-forward (AF) relay strategy, we show that the interference path signal can help to enhance the transmission rate. Besides this, for arbitrary multi-path fading channel with feedback, we also present an SK-type scheme for such a model, which transforms the time domain channel into a frequency domain MIMO channel.

cs.IT↗

arXiv2026

Unleashing the Potential of Neighbors: Diffusion-based Latent Neighbor Generation for Session-based Recommendation

Session-based recommendation aims to predict the next item that anonymous users may be interested in, based on their current session interactions. Recent studies have demonstrated that retrieving neighbor sessions to augment the current session can effectively alleviate the data sparsity issue and improve recommendation performance. However, existing methods typically rely on explicitly observed session data, neglecting latent neighbors - not directly observed but potentially relevant within the interest space - thereby failing to fully exploit the potential of neighbor sessions in recommendation. To address the above limitation, we propose a novel model of diffusion-based latent neighbor generation for session-based recommendation, named DiffSBR. Specifically, DiffSBR leverages two diffusion modules, including retrieval-augmented diffusion and self-augmented diffusion, to generate high-quality latent neighbors. In the retrieval-augmented diffusion module, we leverage retrieved neighbors as guiding signals to constrain and reconstruct the distribution of latent neighbors. Meanwhile, we adopt a training strategy that enables the retriever to learn from the feedback provided by the generator. In the self-augmented diffusion module, we explicitly guide the generation of latent neighbors by injecting the current session's multi-modal signals through contrastive learning. After obtaining the generated latent neighbors, we utilize them to enhance session representations for improving session-based recommendation. Extensive experiments on four public datasets show that DiffSBR generates effective latent neighbors and improves recommendation performance against state-of-the-art baselines.

cs.IR↗

arXiv2025

Tracking Protostellar Variability in Massive Protoclusters with ALMA: I. Insights from QUARKS and MaMMOtH

Millimeter/submillimeter variability is often attributed to dynamical disk-mediated accretion, yet detection is limited to low-mass protostars in nearby clouds. Recent observations have also revealed significant (sub)millimeter variability in high-mass protostars, but the confirmed cases are scarce and lack systematic monitoring. In this work, we analyzed multi-epoch Atacama Large Millimeter/submillimeter Array (ALMA) Band 6 (1.3 mm) continuum observations of 22 massive protoclusters, with epoch separations ranging from a few hours to more than two years, while achieving a consistent angular resolution of approximately 0.3 arcsec. These data allow us to track variability of protostars across a broader mass range and in an environment markedly different from nearby clouds. Using a custom processing pipeline for data reduction, image alignment, and relative flux calibration, we achieve high-precision flux measurements and, for the first time, investigate millimeter variability in massive protoclusters based on interferometric data in a statistical manner. Applying the astrodendro algorithm, we identified 383 condensations and tracked their variations in peak intensities. Standard deviation analysis and difference maps reveal five variable sources, corresponding to a lower limit of 1.3% on the variable fraction. Among these, I13111-6228 stands out as it hosts a hypercompact H II region that exhibits a 68% increase in continuum peak intensity over one year, with an uncertainty of 2%.

astro-ph.GA↗

arXiv2025

Approaching the Low Optical Loss Limit of Plasmonics using Potassium Metals

Plasmonics enables the miniaturization of photonic devices beyond the optical diffraction limit,yet its potential is hindered by inherently large ohmic losses. Hence, it is prudent to explore low loss alternatives to the current mainstay of plasmonics-the noble metals. In this work, we demonstrate the potential of potassium as a plasmonic material with intrinsically low losses in the optical region. The ultraflat, high quality potassium film, fabricated via a rapid slipping-assisted oxide-free crystallization process, achieves an experimentally observed optical damping rate of 3.7 meV,with a measured imaginary permittivity of approximately 0.1 across the entire visible to near-infrared range (400-2000 nm). Near field optical spectroscopic measurements further confirmed the reduced losses by revealing deeply subwavelength confinement of optical modes. This result enhances our understanding of the factors governing plasmonic materials and devices and establishes a new platform for exploring extreme light-matter interactions in a variety of plasmonic systems.

physics.optics↗

arXiv2025

Towards Fair Graph Prompting: A Dual-Prompt Mechanism for Mitigating Attribute and Structural Bias

Self-supervised pre-training on unlabeled graph data has become a common paradigm for Graph Neural Networks (GNNs). However, an objective gap often remains between pre-training objectives and downstream tasks. To bridge this gap, graph prompting methods adapt frozen pre-trained GNNs to specific downstream tasks through learnable prompts. Despite its effectiveness, most existing graph prompting methods primarily focus on improving model performance and largely overlook fairness concerns. As downstream graph data inherently contains biases in both node attributes and graph structures, pre-trained GNNs may produce representations that differ across demographic subgroups. To address this limitation, we propose Adaptive Dual Prompting (ADPrompt), a fairness-aware graph prompting framework for adapting pre-trained GNNs. ADPrompt incorporates two complementary components: Adaptive Feature Rectification, which learns personalized attribute prompts to suppress sensitive information at the input level, and Adaptive Message Calibration, which introduces layer-wise structure prompts to dynamically regulate information propagation from neighboring nodes. By jointly optimizing these two modules, ADPrompt adapts the pre-trained GNN while mitigating both attribute-level and structural bias. Experiments on four benchmark datasets with multiple pre-training strategies demonstrate that ADPrompt consistently outperforms seven competitive baselines in node classification tasks.

cs.LG↗

arXiv2025

Four-channel Imaging Based on Reconfigurable Metasurfaces: Hyperchaotic Encryption under Physical Protection

Metasurfaces facilitate high-capacity optical information integration by simultaneously supporting near-field nanoprinting and far-field holography on a single platform. However, conventional multi-channel designs face critical security vulnerabilities for sensitive information due to insufficient encryption mechanisms. In this work, we propose a four-channel phase-change metasurface featuring algorithm-physical co-security-a dual-protection framework combining intrinsic metasurface physical security with chaotic encryption. Our polarization-multiplexed metasurface generates four optical imaging channels through meta-atom design, including two far-field holograms and two near-field patterns. To enhance system security, we apply Chen hyperchaotic encryption combined with the Logistic map and DNA encoding to convert near-field information into secure QR codes; far-field holograms are retained to demonstrate the metasurface's information capacity and for attack detection. Phase-change metasurface further provides physical-layer security by dynamically switching imaging channels via crystalline-to-amorphous state transitions, enhancing anti-counterfeiting and reliability. The proposed metasurface achieves high-fidelity imaging, robust anti-attack performance, and independent channel control. This integrated approach pioneers a secure paradigm for high-density optical information processing.

physics.optics↗

arXiv2025

Coding for Quasi-Static Fading Channel with Imperfect CSI at the Transmitter and Quantized Feedback

The classical Schalkwijk-Kailath (SK) scheme for the additive Gaussian noise channel with noiseless feedback is highly efficient since its coding complexity is extremely low and the decoding error doubly exponentially decays as the coding blocklength tends to infinity. However, its application to the fading channel with imperfect CSI at the transmitter (I-CSIT) is challenging since the SK scheme is sensitive to the CSI. In this paper, we investigate how to design SK-type scheme for the quasi-static fading channel with I-CSIT and quantized feedback. By introducing modulo lattice function and an auxiliary signal into the SK-type encoder-decoder of the transceiver, we show that the decoding error caused by the I-CSIT can be perfectly eliminated, resulting in the success of designing SK-type scheme for such a case. The study of this paper provides a way to design efficient coding scheme for fading channels in the presence of imperfect CSI and quantized feedback.

cs.IT↗

arXiv2024

3-D Magnetotelluric Deep Learning Inversion Guided by Pseudo-Physical Information

Magnetotelluric deep learning (DL) inversion methods based on joint data-driven and physics-driven have become a hot topic in recent years. When mapping observation data (or forward modeling data) to the resistivity model using neural networks (NNs), incorporating the error (loss) term of the inversion resistivity's forward modeling response--which introduces physical information about electromagnetic field propagation--can significantly enhance the inversion accuracy. To efficiently achieve data-physical dual-driven MT deep learning inversion for large-scale 3-D MT data, we propose using DL forward modeling networks to compute this portion of the loss. This approach introduces pseudo-physical information through the forward modeling of NN simulation, further guiding the inversion network fitting. Specifically, we first pre-train the forward modeling networks as fixed forward modeling operators, then transfer and integrate them into the inversion network training, and finally optimize the inversion network by minimizing the multinomial loss. Theoretical experimental results indicate that despite some simulation errors in DL forward modeling, the introduced pseudo-physical information still enhances inversion accuracy and significantly mitigates the overfitting problem during training. Additionally, we propose a new input mode that involves masking and adding noise to the data, simulating the field data environment of 3-D MT inversion, thereby making the method more flexible and effective for practical applications.

physics.geo-ph↗

arXiv2023

One-Bit Byzantine-Tolerant Distributed Learning via Over-the-Air Computation

Distributed learning has become a promising computational parallelism paradigm that enables a wide scope of intelligent applications from the Internet of Things (IoT) to autonomous driving and the healthcare industry. This paper studies distributed learning in wireless data center networks, which contain a central edge server and multiple edge workers to collaboratively train a shared global model and benefit from parallel computing. However, the distributed nature causes the vulnerability of the learning process to faults and adversarial attacks from Byzantine edge workers, as well as the severe communication and computation overhead induced by the periodical information exchange process. To achieve fast and reliable model aggregation in the presence of Byzantine attacks, we develop a signed stochastic gradient descent (SignSGD)-based Hierarchical Vote framework via over-the-air computation (AirComp), where one voting process is performed locally at the wireless edge by taking advantage of Bernoulli coding while the other is operated over-the-air at the central edge server by utilizing the waveform superposition property of the multiple-access channels. We comprehensively analyze the proposed framework on the impacts including Byzantine attacks and the wireless environment (channel fading and receiver noise), followed by characterizing the convergence behavior under non-convex settings. Simulation results validate our theoretical achievements and demonstrate the robustness of our proposed framework in the presence of Byzantine attacks and receiver noise.

eess.SP↗

arXiv2023

Characterizing Off-path SmartNIC for Accelerating Distributed Systems

SmartNICs have recently emerged as an appealing device for accelerating distributed systems. However, there has not been a comprehensive characterization of SmartNICs, and existing designs typically only leverage a single communication path for workload offloading. This paper presents the first holistic study of a representative off-path SmartNIC, specifically the Bluefield-2, from a communication-path perspective. Our experimental study systematically explores the key performance characteristics of communication among the client, on-board SoC, and host, and offers insightful findings and advice for designers. Moreover, we propose the concurrent use of multiple communication paths of a SmartNIC and present a pioneering guideline to expose new optimization opportunities for various distributed systems. To demonstrate the effectiveness of our approach, we conducted case studies on a SmartNIC-based distributed file system (LineFS) and an RDMA-based disaggregated key-value store (DrTM-KV). Our experimental results show improvements of up to 30% and 25% for LineFS and DrTM-KV, respectively.

cs.DC↗

arXiv2022

No Provisioned Concurrency: Fast RDMA-codesigned Remote Fork for Serverless Computing

Serverless platforms essentially face a tradeoff between container startup time and provisioned concurrency (i.e., cached instances), which is further exaggerated by the frequent need for remote container initialization. This paper presents MITOSIS, an operating system primitive that provides fast remote fork, which exploits a deep codesign of the OS kernel with RDMA. By leveraging the fast remote read capability of RDMA and partial state transfer across serverless containers, MITOSIS bridges the performance gap between local and remote container initialization. MITOSIS is the first to fork over 10,000 new containers from one instance across multiple machines within a second, while allowing the new containers to efficiently transfer the pre-materialized states of the forked one. We have implemented MITOSIS on Linux and integrated it with FN, a popular serverless platform. Under load spikes in real-world serverless workloads, MITOSIS reduces the function tail latency by 89% with orders of magnitude lower memory usage. For serverless workflow that requires state transfer, MITOSIS improves its execution time by 86%.

cs.OS↗

arXiv2022

Differentially Private Federated Learning via Reconfigurable Intelligent Surface

Federated learning (FL), as a disruptive machine learning paradigm, enables the collaborative training of a global model over decentralized local datasets without sharing them. It spans a wide scope of applications from Internet-of-Things (IoT) to biomedical engineering and drug discovery. To support low-latency and high-privacy FL over wireless networks, in this paper, we propose a reconfigurable intelligent surface (RIS) empowered over-the-air FL system to alleviate the dilemma between learning accuracy and privacy. This is achieved by simultaneously exploiting the channel propagation reconfigurability with RIS for boosting the receive signal power, as well as waveform superposition property with over-the-air computation (AirComp) for fast model aggregation. By considering a practical scenario where high-dimensional local model updates are transmitted across multiple communication blocks, we characterize the convergence behaviors of the differentially private federated optimization algorithm. We further formulate a system optimization problem to optimize the learning accuracy while satisfying privacy and power constraints via the joint design of transmit power, artificial noise, and phase shifts at RIS, for which a two-step alternating minimization framework is developed. Simulation results validate our systematic, theoretical, and algorithmic achievements and demonstrate that RIS can achieve a better trade-off between privacy and accuracy for over-the-air FL systems.

eess.SP↗

arXiv2020

Fast Convergence Algorithm for Analog Federated Learning

In this paper, we consider federated learning (FL) over a noisy fading multiple access channel (MAC), where an edge server aggregates the local models transmitted by multiple end devices through over-the-air computation (AirComp). To realize efficient analog federated learning over wireless channels, we propose an AirComp-based FedSplit algorithm, where a threshold-based device selection scheme is adopted to achieve reliable local model uploading. In particular, we analyze the performance of the proposed algorithm and prove that the proposed algorithm linearly converges to the optimal solutions under the assumption that the objective function is strongly convex and smooth. We also characterize the robustness of proposed algorithm to the ill-conditioned problems, thereby achieving fast convergence rates and reducing communication rounds. A finite error bound is further provided to reveal the relationship between the convergence behavior and the channel fading and noise. Our algorithm is theoretically and experimentally verified to be much more robust to the ill-conditioned problems with faster convergence compared with other benchmark FL algorithms.

cs.IT↗

arXiv2018

Recent progress in semantic image segmentation

Semantic image segmentation, which becomes one of the key applications in image processing and computer vision domain, has been used in multiple domains such as medical area and intelligent transportation. Lots of benchmark datasets are released for researchers to verify their algorithms. Semantic segmentation has been studied for many years. Since the emergence of Deep Neural Network (DNN), segmentation has made a tremendous progress. In this paper, we divide semantic image segmentation methods into two categories: traditional and recent DNN method. Firstly, we briefly summarize the traditional method as well as datasets released for segmentation, then we comprehensively investigate recent methods based on DNN which are described in the eight aspects: fully convolutional network, upsample ways, FCN joint with CRF methods, dilated convolution approaches, progresses in backbone network, pyramid methods, Multi-level feature and multi-stage method, supervised, weakly-supervised and unsupervised methods. Finally, a conclusion in this area is drawn.

cs.CV↗