SearcharxivSearch

arXiv subjects

Yiyan Zhang

Publications and source records attributed to Yiyan Zhang.

5 recordsLinked to original sources

Positioning manuscripts in the scientific landscape with agentic AI

Publishing a research manuscript is a routine yet demanding part of scientific life: time-consuming, stressful, and often uncertain in outcome. Recent advances in large language model (LLM)-based agentic AI have shown promise across a range of scientific tasks, and here we ask whether agentic AI can help researchers navigate the publication process itself by reliably inferring a manuscript's eventual publication venue from its content and literature context. We introduce PASS (Publication-oriented Agentic Scientific System), an agentic system that understands manuscripts within their domain-specific literature context and predicts top-matched publication venues. PASS positions each manuscript within its surrounding literature landscape by reconstructing its local scientific neighborhood, tracing its topic trajectory, and reasoning over field-specific journal spaces. Evaluated on a leakage-audited benchmark of over 2,000 preprints across 16 biomedical fields, PASS achieved Top-1 accuracy of 50.3% and Top-5 accuracy of 86.1%, outperforming state-of-the-art LLM baselines and established journal-selection tools. PASS-produced quality scores, such as impact potential and novelty, aligned with independent measures of publication outcome. We also found that the designed literature retrieval module is the strongest performance contributor, particularly for positioning manuscripts relative to nearby work, and that PASS maintained near-full performance from the abstract alone, whereas LLM baselines required the full manuscript text. An independent human evaluation found strong researcher agreement with PASS's manuscript understanding and recommendation rationale. PASS has been released as a public platform (https://ratemypaper.ai/) for broad researcher access.

cs.AI

Amortized Neural SVD for XL-MIMO: Structure-Guided Factor Prediction for Beamforming and Multi-Stream Utility

Singular value decomposition (SVD) is a core operation in multiple-input multiple-output (MIMO) beamforming, but the cubic complexity of standard SVD routines can lead to a major latency bottleneck as array dimensions scale to extremely large sizes. This paper presents a fully learned neural operator that avoids explicit SVD computation by directly mapping channel matrices to truncated low-rank factors for precoder and combiner design. In contrast to iterative numerical solvers and algorithm-unrolled networks, the proposed structure-aware model, termed SVDNet, produces these factors in a single forward pass at inference, shifting the per-instance decomposition cost to offline training. The model also includes lightweight constraints to enforce basic algebraic properties required by beamforming, such as semi-unitarity of the singular vectors and nonnegative singular values, without invoking matrix factorization kernels. Experiments on extremely large-scale MIMO channels with matrix dimensions up to 512*512 show that the proposed approach achieves spectral efficiency close to exact SVD-based beamforming in single-stream transmission and consistently improves multi-stream sum-rate over representative learned baselines, indicating good scalability for low-latency wireless processing.

eess.SP

Path-Level Radio Map-Aided Fast and Robust Channel Estimation for Pilot-Starved MIMO-OFDM Systems

Accurate channel estimation in massive multiple-input multiple-output orthogonal frequency division multiplexing (MIMO-OFDM) systems is challenging when the number of pilot symbols is much smaller than the number of transmit antennas. Conventional compressed sensing methods perform a three-dimensional search over the angle-of-arrival, angle-of-departure, and delay domains, which incurs high computational cost. In this paper, we propose CHARM (channel estimation with angular-delay radio map), a framework that extracts an angular-delay power spectrum (ADPS) prior from path-level radio maps. The ADPS identifies the joint angle-of-arrival and delay support of the dominant multipath components offline, reducing the online estimation to a one-dimensional angle-of-departure search per path. A trust-region constraint is further introduced to prevent sub-grid refinement from diverging under dictionary mismatch. Simulation results show that CHARM achieves accuracy comparable to three-dimensional joint orthogonal matching pursuit (OMP) with $34.8\times$ speedup at pilot length $T \leq 4$, and that the trust-region variant degrades by only 3.7~dB under severe dictionary mismatch of 0.2~rad standard deviation, compared with 8.2~dB without the constraint.

eess.SP

Is AI Robust Enough for Scientific Research?

We uncover a phenomenon largely overlooked by the scientific community utilizing AI: neural networks exhibit high susceptibility to minute perturbations, resulting in significant deviations in their outputs. Through an analysis of five diverse application areas -- weather forecasting, chemical energy and force calculations, fluid dynamics, quantum chromodynamics, and wireless communication -- we demonstrate that this vulnerability is a broad and general characteristic of AI systems. This revelation exposes a hidden risk in relying on neural networks for essential scientific computations, calling further studies on their reliability and security.

cs.LG

Mention-centered Graph Neural Network for Document-level Relation Extraction

Document-level relation extraction aims to discover relations between entities across a whole document. How to build the dependency of entities from different sentences in a document remains to be a great challenge. Current approaches either leverage syntactic trees to construct document-level graphs or aggregate inference information from different sentences. In this paper, we build cross-sentence dependencies by inferring compositional relations between inter-sentence mentions. Adopting aggressive linking strategy, intermediate relations are reasoned on the document-level graphs by mention convolution. We further notice the generalization problem of NA instances, which is caused by incomplete annotation and worsened by fully-connected mention pairs. An improved ranking loss is proposed to attend this problem. Experiments show the connections between different mentions are crucial to document-level relation extraction, which enables the model to extract more meaningful higher-level compositional relations.

cs.CL