arXiv subjects

Zihao Wang

Publications and source records attributed to Zihao Wang.

At least 109 records · Page 6Linked to original sources

arXiv2026

Stoichiometric FeTe is a Superconductor

Iron-based superconductors are a fascinating family of materials in which multiple electronic bands and strong antiferromagnetic (AFM) correlations are key ingredients for competing ground states, including antiferromagnetism, electronic nematicity, and unconventional superconductivity. FeTe, unlike its superconducting isostructural counterpart FeSe, has long been regarded as an AFM metal sans superconductivity. In this work, we employ molecular beam epitaxy to grow FeTe films and perform post-growth annealing under a Te flux. By performing spin-polarized scanning tunneling microscopy and spectroscopy, we demonstrate that the AFM order in as-grown FeTe films is induced by interstitial Fe atoms that disrupt the ideal 1:1 stoichiometry. Remarkably, the removal of these interstitial Fe atoms through Te annealing yields stoichiometric FeTe films that show no AFM order and instead exhibit robust superconductivity with a critical temperature of ~13.5K. This superconducting state is further confirmed by the observation of Cooper pair tunneling, zero electrical resistance, and the Meissner effect. Therefore, our results demonstrate that stoichiometric FeTe is inherently a superconductor, overturning a long-held view that it is an AFM metal. This work clarifies the origin of superconductivity in FeTe-based heterostructures and demonstrates the importance of stoichiometry control in understanding the competition between AFM and superconductivity in iron-based superconductors.

cond-mat.supr-con↗

arXiv2026

Learning Latent Proxies for Controllable Single-Image Relighting

Single-image relighting is highly under-constrained: small illumination changes can produce large, nonlinear variations in shading, shadows, and specularities, while geometry and materials remain unobserved. Existing diffusion-based approaches either rely on intrinsic or G-buffer pipelines that require dense and fragile supervision, or operate purely in latent space without physical grounding, making fine-grained control of direction, intensity, and color unreliable. We observe that a full intrinsic decomposition is unnecessary and redundant for accurate relighting. Instead, sparse but physically meaningful cues, indicating where illumination should change and how materials should respond, are sufficient to guide a diffusion model. Based on this insight, we introduce LightCtrl that integrates physical priors at two levels: a few-shot latent proxy encoder that extracts compact material-geometry cues from limited PBR supervision, and a lighting-aware mask that identifies sensitive illumination regions and steers the denoiser toward shading relevant pixels. To compensate for scarce PBR data, we refine the proxy branch using a DPO-based objective that enforces physical consistency in the predicted cues. We also present ScaLight, a large-scale object-level dataset with systematically varied illumination and complete camera-light metadata, enabling physically consistent and controllable training. Across object and scene level benchmarks, our method achieves photometrically faithful relighting with accurate continuous control, surpassing prior diffusion and intrinsic-based baselines, including gains of up to +2.4 dB PSNR and 35% lower RMSE under controlled lighting shifts.

cs.CV↗

arXiv2026

Input Convex Lipschitz Recurrent Neural Networks for Robust and Efficient Process Modeling and Optimization

Computational efficiency and robustness are essential in process modeling, optimization, and control for real-world engineering applications. While neural network-based approaches have gained significant attention in recent years, conventional neural networks often fail to address these two critical aspects simultaneously or even independently. Inspired by natural physical systems and established literature, input convex architectures are known to enhance computational efficiency in optimization tasks, whereas Lipschitz-constrained architectures improve robustness. However, combining these properties within a single model requires careful review, as inappropriate methods for enforcing one property can undermine the other. To overcome this, we introduce a novel network architecture, termed Input Convex Lipschitz Recurrent Neural Networks (ICL-RNNs). This architecture seamlessly integrates the benefits of convexity and Lipschitz continuity, enabling fast and robust neural network-based modeling and optimization. The ICL-RNN outperforms existing recurrent units in both computational efficiency and robustness. Additionally, it has been successfully applied to practical engineering scenarios, such as chemical process modeling and the modeling and control of Organic Rankine Cycle-based waste heat recovery systems. Source code is available at https://github.com/killingbear999/ICLRNN.

cs.LG↗

arXiv2026

Chasing the Tail: Effective Rubric-based Reward Modeling for Large Language Model Post-Training

Reinforcement fine-tuning (RFT) often suffers from reward over-optimization, where a policy model hacks the reward signals to achieve high scores while producing low-quality outputs. Our theoretical analysis shows that the key lies in reward misspecification at the high-reward tail: the inability to reliably distinguish Excellent responses from merely Great ones. This motivate us to focus on the high-reward region. However, such tail examples are scarce under the base LLM. While off-policy exemplars (e.g. from stronger models or rewrites) are easier to obtain, naively training on them yields a misspecified reward for the policy we aim to align. To address this, we study rubric-based rewards. By design, rubrics can leverage off-policy examples while remaining insensitive to their artifacts. To elicit rubrics that capture the high-reward tail, we highlight the importance of distinguishing among great and diverse responses, and introduce a workflow to implement this idea. We empirically demonstrate that rubric-based rewards substantially mitigate reward over-optimization and deliver effective LLM post-training improvements.

cs.LG↗

arXiv2026

PanCanBench: A Comprehensive Benchmark for Evaluating Large Language Models in Pancreatic Oncology

Large language models (LLMs) have achieved expert-level performance on standardized examinations, yet multiple-choice accuracy poorly reflects real-world clinical utility and safety. As patients and clinicians increasingly use LLMs for guidance on complex conditions such as pancreatic cancer, evaluation must extend beyond general medical knowledge. Existing frameworks, such as HealthBench, rely on simulated queries and lack disease-specific depth. Moreover, high rubric-based scores do not ensure factual correctness, underscoring the need to assess hallucinations. We developed a human-in-the-loop pipeline to create expert rubrics for de-identified patient questions from the Pancreatic Cancer Action Network (PanCAN). The resulting benchmark, PanCanBench, includes 3,130 question-specific criteria across 282 authentic patient questions. We evaluated 22 proprietary and open-source LLMs using an LLM-as-a-judge framework, measuring clinical completeness, factual accuracy, and web-search integration. Models showed substantial variation in rubric-based completeness, with scores ranging from 46.5% to 82.3%. Factual errors were common, with hallucination rates (the percentages of responses containing at least one factual error) ranging from 6.0% for Gemini-2.5 Pro and GPT-4o to 53.8% for Llama-3.1-8B. Importantly, newer reasoning-optimized models did not consistently improve factuality: although o3 achieved the highest rubric score, it produced inaccuracies more frequently than other GPT-family models. Web-search integration did not inherently guarantee better responses. The average score changed from 66.8% to 63.9% for Gemini-2.5 Pro and from 73.8% to 72.8% for GPT-5 when web search was enabled. Synthetic AI-generated rubrics inflated absolute scores by 17.9 points on average while generally maintaining similar relative ranking.

cs.CL↗

arXiv2026

Architecture-Aware Multi-Design Generation for Repository-Level Feature Addition

Implementing new features across an entire codebase presents a formidable challenge for Large Language Models (LLMs). This proactive task requires a deep understanding of the global system architecture to prevent unintended disruptions to legacy functionalities. Conventional pipeline and agentic frameworks often fall short in this area because they suffer from architectural blindness and rely on greedy single-path code generation. To overcome these limitations, we propose RAIM, a multi-design and architecture-aware framework for repository-level feature addition. This framework introduces a localization mechanism that conducts multi-round explorations over a repository-scale code graph to accurately pinpoint dispersed cross-file modification targets. Crucially, RAIM shifts away from linear patching by generating multiple diverse implementation designs. The system then employs a rigorous impact-aware selection process based on static and dynamic analysis to choose the most architecturally sound patch and avoid system regressions. Comprehensive experiments on the NoCode-bench Verified dataset demonstrate that RAIM establishes a new state-of-the-art performance with a 39.47% success rate, achieving a 36.34% relative improvement over the strongest baseline. Furthermore, the approach exhibits robust generalization across various foundation models and empowers open-weight models like DeepSeek-v3.2 to surpass baseline systems powered by leading proprietary models. Detailed ablation studies confirm that the multi-design generation and impact validation modules are critical to effectively managing complex dependencies and reducing code errors. These findings highlight the vital role of structural awareness in automated software evolution.

cs.SE↗

arXiv2026

Trojans in Artificial Intelligence (TrojAI) Final Report

The Intelligence Advanced Research Projects Activity (IARPA) launched the TrojAI program to confront an emerging vulnerability in modern artificial intelligence: the threat of AI Trojans. These AI trojans are malicious, hidden backdoors intentionally embedded within an AI model that can cause a system to fail in unexpected ways, or allow a malicious actor to hijack the AI model at will. This multi-year initiative helped to map out the complex nature of the threat, pioneered foundational detection methods, and identified unsolved challenges that require ongoing attention by the burgeoning AI security field. This report synthesizes the program's key findings, including methodologies for detection through weight analysis and trigger inversion, as well as approaches for mitigating Trojan risks in deployed models. Comprehensive test and evaluation results highlight detector performance, sensitivity, and the prevalence of "natural" Trojans. The report concludes with lessons learned and recommendations for advancing AI security research.

cs.CR↗

arXiv2026

Phase Transitions for Feature Learning in Neural Networks

According to a popular viewpoint, neural networks learn from data by first identifying low-dimensional representations, and subsequently fitting the best model in this space. Recent works provide a formalization of this phenomenon when learning multi-index models. In this setting, we are given $n$ i.i.d. pairs $({\boldsymbol x}_i,y_i)$, where the covariate vectors ${\boldsymbol x}_i\in\mathbb{R}^d$ are isotropic, and responses $y_i$ only depend on ${\boldsymbol x}_i$ through a $k$-dimensional projection ${\boldsymbol Θ}_*^{\sf T}{\boldsymbol x}_i$. Feature learning amounts to learning the latent space spanned by ${\boldsymbol Θ}_*$. In this context, we study the gradient descent dynamics of two-layer neural networks under the proportional asymptotics $n,d\to\infty$, $n/d\toδ$, while the dimension of the latent space $k$ and the number of hidden neurons $m$ are kept fixed. Earlier work establishes that feature learning via polynomial-time algorithms is possible if $δ> δ_{\text{alg}}$, for $δ_{\text{alg}}$ a threshold depending on the data distribution, and is impossible (within a certain class of algorithms) below $δ_{\text{alg}}$. Here we derive an analogous threshold $δ_{\text{NN}}$ for two-layer networks. Our characterization of $δ_{\text{NN}}$ opens the way to study the dependence of learning dynamics on the network architecture and training algorithm. The threshold $δ_{\text{NN}}$ is determined by the following scenario. Training first visits points for which the gradient of the empirical risk is large and learns the directions spanned by these gradients. Then the gradient becomes smaller and the dynamics becomes dominated by negative directions of the Hessian. The threshold $δ_{\text{NN}}$ corresponds to a phase transition in the spectrum of the Hessian in this second phase.

cs.LG↗

arXiv2026

Moire Engineering of Cooper-Pair Density Modulation States

Cooper-pair density modulation (CPDM) states are superconducting phases in which the order parameter varies periodically in real space without breaking translational symmetry. Recently, moire superlattices in layered materials have emerged as powerful platforms for engineering charge density with tunable lattice symmetry, offering a new route to creating and controlling CPDM states. In this work, we demonstrate moire-induced CPDM states in a bilayer heterostructure formed by epitaxially stacking one quintuple layer (1 QL) of topological insulator Sb2Te3 on a six-unit-cell (6 UC) antiferromagnetic FeTe layer. Scanning tunneling microscopy and spectroscopy (STM/S) measurements reveal a moiré superlattice formed between the hexagonal Te lattice of Sb2Te3 and the square Te lattice of FeTe, which spatially modulates the two superconducting gaps of the 1 QL Sb2Te3/6 UC FeTe bilayer. Our Josephson STM/S measurements provide direct real-space imaging of the CPDM states with a wavelength corresponding to the periodicity of the moire superlattice. By substituting Sb2Te3 with Bi2Te3, we achieve control over both the periodicity and magnitude of the CPDM states. Our work demonstrates an epitaxial strategy for synthesizing moire superlattices from materials with different crystal symmetries and reveals a new mechanism for engineering CPDM states in designer bilayer heterostructures.

cond-mat.supr-con↗

arXiv2026

Photonic timing-engineered solitons for dual-microcomb metrology

Dissipative microcavity solitons offer a route to integrate comb-based metrology systems on photonic chips. However, integrated solitons generally lack agile control of comb parameters, particularly pulse timing control, hindering their application in quantum-limited metrology. Here we introduce dynamical soliton trapping to enable optically timing-engineered microcombs (OTEM). By injecting an auxiliary laser to anchor one of the microcomb lines, we create a potential well to trap and steer the soliton. Thus, soliton timing can be engineered by phase modulating the injected laser. Theory and measurement reveal the fast response bandwidth of the OTEM, which enabled a soliton slew rate of 31.3 ps/$μ$s, surpassing existing time-programmable fiber laser combs by more than two orders of magnitude. Leveraging the timing scan, we used a single OTEM for single-pixel and parallel ranging by retrieving the phase of the multi-heterodyne beat spectrum. Picometer-scale ranging precision was achieved, establishing new record for optical absolute ranging. Our work can transform timing-engineering of microcavity solitons and endow integrated dual-microcomb metrology systems with enhanced precision.

physics.optics↗

arXiv2026

Efficient Reinforcement Learning for Large Language Models with Intrinsic Exploration

Reinforcement learning with verifiable rewards (RLVR) has improved the reasoning ability of large language models, yet training remains costly because many rollouts contribute little to optimization, considering the amount of computation required. This study investigates how simply leveraging intrinsic data properties, almost free benefit during training, can improve data efficiency for RLVR. We propose PREPO with two complementary components. First, we adopt prompt perplexity as an indicator of model adaptability in learning, enabling the model to progress from well-understood contexts to more challenging ones. Second, we amplify the discrepancy among the rollouts by differentiating their relative entropy, and prioritize sequences that exhibit a higher degree of exploration. Together, these mechanisms reduce rollout demand while preserving competitive performance. On the Qwen and Llama models, PREPO achieves effective results on mathematical reasoning benchmarks with up to 3 times fewer rollouts than the baselines. Beyond empirical gains, we provide theoretical and in-depth analyses explaining the underlying rationale of our method to improve the data efficiency of RLVR.

cs.LG↗

arXiv2026

Interplay of Quantum Size Effect and Tensile Strain on Surface Morphology of Sn(100) Islands

The quantum size effect (QSE) and strain effect are two key factors influencing the surface morphology of thin films, which can increase film surface roughness through QSE-induced thickness oscillation and strain-induced island formation, respectively. Surface roughness usually manifests in the early stages of film growth and diminishes beyond a critical thickness. In this work, we employ molecular beam epitaxy (MBE) to grow Sn(100) islands with varying thickness N on bilayer graphene-terminated 6H-SiC(0001) substrates. Scanning tunneling microscopy and spectroscopy measurements reveal an inverse surface roughness effect that highlights the interplay of QSE and misfit strain in shaping the surface morphology of Sn(100) islands. For N =< 10, the islands exhibit flat surfaces, while for N >= 26, the island surfaces become corrugated and patterned. For the intermediate range, i.e., 12 =< N =<24, both flat and patterned surfaces coexist, with the percentage coverage of the patterned surface oscillating as a function of N. By performing density functional theory calculations, we demonstrate that the unusual surface pattern evolution in our MBE-grown Sn(100) islands is a result of the interplay between QSE-induced surface roughing and tensile strain-induced smoothening effect.

cond-mat.mtrl-sci↗

arXiv2026

Non-negative matrix factorization algorithms generally improve topic model fits

In an effort to develop topic modeling methods that can be quickly applied to large data sets, we revisit the problem of maximum-likelihood estimation in topic models. It is known, at least informally, that maximum-likelihood estimation in topic models is closely related to non-negative matrix factorization (NMF). Yet, to our knowledge, this relationship has not been exploited previously to fit topic models. We show that recent advances in NMF optimization methods can be leveraged to fit topic models very efficiently, often resulting in much better fits and in less time than existing algorithms for topic models. We also formally make the connection between the NMF optimization problem and maximum-likelihood estimation for the topic model, and using this result we show that the expectation maximization (EM) algorithm for the topic model is essentially the same as the classic multiplicative updates for NMF (the only difference being that the operations are performed in a different order). Our methods are implemented in the R package fastTopics.

stat.ML↗

arXiv2026

Overcoming sensitivity-bandwidth trade-off in mid-infrared spectroscopy by a microresonator-anchored swept laser

Optical frequency combs have revolutionized high-precision spectroscopy, yet an intrinsic trade-off between spectroscopic signal-to-noise ratio (sSNR) and measurement bandwidth ($B$) fundamentally constrains sensitive, broadband measurements. While broadband swept lasers offer a potential solution, generating broadband, ultrafast and linearly sweeping lasers with a narrow linewidth remains a significant challenge, particularly in the fingerprint mid-infrared (mid-IR) band. Here we overcome this limitation by using a microresonator-anchored ultrafast sweeping Fourier domain mode-locked (FDML) laser for mid-IR spectroscopy. We introduce a dual-microresonator-anchor approach: a microcomb provides frequency calibration and a high-Q microresonator resolves the instantaneous FDML lasing lineshape. The strategy enables accurate correction of the FDML laser's sweep nonlinearity and broad linewidth in the near-IR, allowing the FDML laser to function as a high-fidelity mid-IR light via difference frequency generation. The system achieves a record sSNR$\times$$B$ of 1.3$\times$10$^5$ THz$\cdot \sqrt{\rm Hz}$ and methane sensing precision of 9 ppb$\cdot$m$\cdot$$\sqrt{\rm s}$, while retaining GHz resolution to distinguish methane isotope. We further demonstrate broadband, coherent swept laser phase spectroscopy in the mid-IR, tolerating losses up to 78 dB. This work leverages advances in integrated photonics to overcome the fundamental limitations of precision spectroscopy, paving the way for next-generation, broadband, and ultra-sensitive mid-IR spectroscopic sensing systems.

physics.optics↗

arXiv2026

2DESR: a two-dimensional Fourier-space gyrokinetic eigenvalue code for the ion-temperature-gradient modes in tokamaks

A two-dimensional (2D) gyrokinetic eigenvalue solver, 2DESR, has been developed to solve the 2D gyrokinetic eigenvalue problem in the poloidal Fourier space for the ion-temperature-gradient (ITG) modes in tokamaks. With full kinetic effects of ions retained, the 2D gyrokinetic eigenvalue equations in the poloidal Fourier space have been derived and numerically solved in the 2DESR code. In the linear ITG Cyclone test with adiabatic electrons, the 2DESR code benchmarks well against the gyrokinetic initial-value codes GENE and NLT. It is found that two branches of ITG modes coexist in the system.

physics.plasm-ph↗

arXiv2026

The THESAN-ZOOM project: Mystery N/O more -- uncovering the origin of peculiar chemical abundances and a not-so-fundamental metallicity relation at $3<z<12$

We present an analysis of metallicities and chemical abundances at $3 -0.6$) without the need for exotic yields in our chemical network. Instead, bursty star formation naturally generates order-of-magnitude excursions in N/O on $\lesssim$100 Myr timescales due to temporally differential galactic winds; after a starburst, stellar feedback expels gas, leaving a large population of asymptotic-giant-branch stars to dominate the enrichment of the relatively low-mass interstellar medium. NRGs lie below the main sequence and typically exhibit $\mathrm{EW}[H$β$]\lesssim40$ Å, in apparent tension with observed high-EW NRGs. This tension is reconciled if observed NRGs are in the initial stages of a subsequent starburst, illuminating previously enriched gas, which is supported by the finding of high SFR surface density nitrogen-rich giant molecular clouds.

astro-ph.GA↗

arXiv2026

MergePipe: A Budget-Aware Parameter Management System for Scalable LLM Merging

Large language model (LLM) merging has become a key technique in modern LLM development pipelines, enabling the integration of multiple task- or domain-specific expert models without retraining. However, as the number of experts grows, existing merging implementations treat model parameters as unstructured files and execute merges in a stateless, one-shot manner, leading to excessive disk I/O, redundant parameter scans, and poor scalability. In this paper, we present \textbf{MergePipe}, a parameter management system for scalable LLM merging. MergePipe is the first system that treats LLM merging as a data management and execution problem, and introduces a catalog-driven abstraction over model parameters, merge plans, and execution lineage. At its core, MergePipe employs a cost-aware planner that explicitly models expert parameter I/O and enforces user-specified I/O budgets, followed by a streaming execution engine that materializes merged models under transactional guarantees. Our key insight is that while base model reads and output writes are unavoidable, expert parameter reads dominate merge cost and constitute the primary optimization target. By making expert access budget-aware throughout planning and execution, MergePipe mitigates the $O(K)$ I/O growth of naive pipelines and achieves predictable scaling behavior. Experiments show that MergePipe reduces total I/O by up to an order of magnitude and delivers up to $11\times$ end-to-end speedups (up to 90\% wall-time reduction) over state-of-the-art LLM merging pipelines.

cs.DB↗

arXiv2026

Neural Networks Learn Generic Multi-Index Models Near Information-Theoretic Limit

In deep learning, a central issue is to understand how neural networks efficiently learn high-dimensional features. To this end, we explore the gradient descent learning of a general Gaussian Multi-index model $f(\boldsymbol{x})=g(\boldsymbol{U}\boldsymbol{x})$ with hidden subspace $\boldsymbol{U}\in \mathbb{R}^{r\times d}$, which is the canonical setup to study representation learning. We prove that under generic non-degenerate assumptions on the link function, a standard two-layer neural network trained via layer-wise gradient descent can agnostically learn the target with $o_d(1)$ test error using $\widetilde{\mathcal{O}}(d)$ samples and $\widetilde{\mathcal{O}}(d^2)$ time. The sample and time complexity both align with the information-theoretic limit up to leading order and are therefore optimal. During the first stage of gradient descent learning, the proof proceeds via showing that the inner weights can perform a power-iteration process. This process implicitly mimics a spectral start for the whole span of the hidden subspace and eventually eliminates finite-sample noise and recovers this span. It surprisingly indicates that optimal results can only be achieved if the first layer is trained for more than $\mathcal{O}(1)$ steps. This work demonstrates the ability of neural networks to effectively learn hierarchical functions with respect to both sample and time efficiency.

stat.ML↗