arXiv subjects

Yu Lei

Publications and source records attributed to Yu Lei.

At least 19 recordsLinked to original sources

arXiv2026

The exterior Dirichlet problem for special Lagrangian equations

We establish the existence and uniqueness theorem for the exterior Dirichlet problem for the special Lagrangian equation with prescribed asymptotic behavior at infinity, in both the viscosity setting for all the phases and classical setting for the critical and supercritical phases. These results generalize previous work by the second author by removing restrictive assumptions on the asymptotic matrix and improving the decay rate to the order $2-n$. We also solve the interior Dirichlet problem for the critical special Lagrangian equation and, as applications, all the above-mentioned corresponding problems for the three dimensional quadratic Hessian equation without any admissibility condition.

math.AP↗

arXiv2026

Exterior Dirichlet Problems for Hessian Quotient Equations of Mixed Type

We study the exterior Dirichlet problem for the mixed Hessian quotient equation \[ \frac{\sigma_k(\eta(D^2 u))}{\sigma_l(\eta(D^2 u))} = 1, \] where $\eta(M) = (\operatorname{tr} M)I - M$. We establish existence and uniqueness of smooth admissible solutions with prescribed quadratic asymptotics at infinity, and obtain full derivative decay of the remainder. The proof relies on a three-stage subsolution construction.

math.AP↗

arXiv2026

The Illusion of Safety: Multi-Tier Verification of AI vs. Human C++ Code

As large language models (LLMs) are increasingly deployed for systems programming, their ability to generate secure C++ code, where a single memory-safety failure creates an exploitable vulnerability, remains a critical concern. Yet most security evaluations of AI-generated code rely on static analysis alone, which flags warnings without confirming run- time violations or reasoning about untested paths. This study investigates whether AI-generated C++ is measurably less safe than human-written code, and whether common verification tools agree on the risk. We introduce VULBENCH-CPP, a benchmark of 8,918 C++ programs from three open-weight LLMs (Gemma 3 27B IT, LLaMA 3.3 70B Instruct, Qwen 2.5 Coder 32B Instruct) and human authors across 851 competitive-programming tasks. Each program is annotated by four verification tiers: functional testing, static analysis (cppcheck, clang-tidy), dynamic analysis (ASan/UBSan), and bounded model checking (ESBMC). Account- ing for the correlation among solutions to a shared task, we find that AI-generated code is roughly twice as likely as human code to trigger a confirmed runtime violation, even after controlling for code length and test pass-rate. Under static analysis the two look equally safe, but this is misleading: the apparent similarity reflects code length rather than real safety, and the tiers detect largely different classes of violation, demonstrating that no single tier is sufficient. These vulnerability patterns remain consistent across independent generations. We release the benchmark, harness, and annotated results.

cs.SE↗

arXiv2026

Structural properties of one-dimensional $\mathrm{Cs}_2\mathrm{CoCl}_4$ confined within single-walled carbon nanotubes

Crystals under one-dimensional (1D) confinement are well-known to exhibit drastic changes in metallicity, magnetic properties and chemical state, however, the intermediate phase space between binary metal halides and ternary metal halide perovskites remains poorly explored, especially in the context of the rich polymorphism exhibited by both families in the one-dimensional limit. Through aberration-corrected (scanning) transmission electron microscopy and multislice simulations, it is shown that the metal halide $\mathrm{Cs}_2\mathrm{CoCl}_4$ crystallizes in the tetragonal $\wp4/mcc$ and orthorhombic $\wp{mcm}$ rod groups under radial compression within single-walled carbon nanotubes (SWCNTs) of increasingly small diameter, with a massive re-entrant orthorhombic strain towards the $1$ $\mathrm{nm}$ extremum. The persistence of $\mathrm{Co}^{2+}$ is determined from fits to the d.c. magnetization, with a surprisingly small increase in the effective moment ($4.607(3)$ to $4.788(3) \mathit{{\mu}}_\mathrm{B}/\mathrm{f.u.}$) and Weiss constant ($-7.9(3)$ to $-4.09(7) \mathrm{K}$) after confinement in the SWCNTs, suggesting that the confined structure topologically preserves the core magnetic properties of the bulk. Both unconventional polymorphs observed are noticeably different to the high-pressure piezochromic polymorph previously shown to undergo a tetrahedral-to-octahedral coordination transition, highlighting 1D confinement as a unique tool for structural manipulation.

cond-mat.mtrl-sci↗

arXiv2026

Uncovering the dark matter distribution by combining stellar kinematics and integrated HI spectra: Method validation

We determined the dark matter (DM) distribution in galaxies by jointly modelling stellar kinematics from integral field unit (IFU) observations and the gaseous kinematics encoded in a single integrated HI spectrum. The stellar kinematics are described by a triaxial orbit-superposition Schwarzschild model, while the HI gas is described by an idealised disc model; both are governed by the same gravitational potential. The potential comprises the stellar mass, a generalised Navarro-Frenk-White (gNFW) DM halo, and a central black hole. We validated the method on 58 simulated galaxies generated from the TNG50 cosmological simulation. For each galaxy, we created two versions of mock data with azimuthal angles viewed side-on and end-on, thus yielding 116 mock observations in total. Our model recovers the total mass, stellar mass, and DM mass profiles within the data range; the median DM mass of the 58 simulated galaxies is recovered with a relative systematic bias smaller than 20% across all radii from 2--20 kpc. The statistical uncertainties on the DM masses within 5 kpc remain similar to those found with the model constrained by IFU data only. In contrast, the relative uncertainty on the DM mass in the outer regions decreases when the HI spectrum is included; at 20 kpc, it drops markedly, from about 85% to roughly 30%. The DM density slope defined explicitly in the gNFW model is systematically underestimated and thus does not yield a reliable quantity from observations using our approach. Instead, we introduce density slopes evaluated between 2 and 20 kpc, which are statistically well recovered for both the total mass and the DM mass. We demonstrate the reliability of this method in uncovering the DM distribution and emphasise its promise for application to large samples of observed galaxies.

astro-ph.GA↗

arXiv2026

TabChange: Precise Attribute Changes in Tabular Data

Modifying an attribute in tabular data often introduces an unnatural instance by breaking its relationships with other attributes. The modified instance must be both natural and minimally changed from the original instance. This paper addresses the challenge of generating such a modified instance. We identify key limitations in existing approaches: generative models either don't support instance-level attribute editing or, in the case of methods like CVAE, retain attribute information in the latent space, leading to unnecessary modifications. To solve this, we propose TabChange, an approach that analyzes the relationship between the attribute of interest and other attributes in the dataset. If the relationship is weak, it simply flips the attribute; if it is strong, it uses an adversarial framework that removes information about the attribute in the latent space representation. This removal enables precise modifications, making only the necessary adjustments to maintain naturalness. Our experiments across seven datasets show that TabChange generates counterfactuals in attributes that are comparable in naturalness and are more proximal to their original instances. This leads to a higher number of valid counterfactuals and a lower number of invalid counterfactuals compared to the baselines.

cs.LG↗

arXiv2026

Threshold-Guided Optimization for Visual Generative Models

Aligning large visual generative models with human feedback is often performed through pairwise preference optimization. While such approaches are conceptually simple, they fundamentally rely on annotated pairs, limiting scalability in settings where feedback is collected as independent scalar ratings. In this work, we revisit the KL-regularized alignment objective and show that the optimal policy implicitly compares each sample's reward to an instance-specific baseline that is generally intractable. We propose a threshold-guided alignment framework that replaces this oracle baseline with a data-driven global threshold estimated from empirical score statistics. This formulation turns alignment into a binary decision task on unpaired data, enabling effective optimization directly from scalar feedback. We also incorporate a confidence weighting term to emphasize samples whose scores deviate strongly from the threshold, improving sample efficiency. Experiments across both diffusion and masked generative paradigms, spanning three test sets and five reward models, show that our method consistently improves preference alignment over previous methods. These results position our threshold-guided framework as a simple yet principled alternative for aligning visual generative models without paired comparisons.

cs.LG↗

arXiv2026

From Context to Skills: Can Language Models Learn from Context Skillfully?

Many real-world tasks require language models (LMs) to reason over complex contexts that exceed their parametric knowledge. This calls for context learning, where LMs directly learn relevant knowledge from the given context. An intuitive solution is inference-time skill augmentation: extracting the rules and procedures from context into natural-language skills. However, constructing such skills for context learning scenarios faces two challenges: the prohibitive cost of manual skill annotation for long, technically dense contexts, and the lack of external feedback for automated skill construction. In this paper, we propose Ctx2Skill, a self-evolving framework that autonomously discovers, refines, and selects context-specific skills without human supervision or external feedback. At its core, a multi-agent self-play loop has a Challenger that generates probing tasks and rubrics, a Reasoner that attempts to solve them guided by an evolving skill set, and a neutral Judge that provides binary feedback. Crucially, both the Challenger and the Reasoner evolve through accumulated skills: dedicated Proposer and Generator agents analyze failure cases and synthesize them into targeted skill updates for both sides, enabling automated skill discovery and refinement. To prevent adversarial collapse caused by increasingly extreme task generation and over-specialized skill accumulation, we further introduce a Cross-time Replay mechanism that identifies the skill set achieving the best balance across representative cases for the Reasoner side, ensuring robust and generalizable skill evolution. The resulting skills can be plugged into any language model to obtain better context learning capability. Evaluated on four context learning tasks from CL-bench, Ctx2Skill consistently improves solving rates across backbone models.

cs.AI↗

arXiv2026

ReaGeo: Reasoning-Enhanced End-to-End Geocoding with LLMs

This paper proposes ReaGeo, an end-to-end geocoding framework based on large language models, designed to overcome the limitations of traditional multi-stage approaches that rely on text or vector similarity retrieval over geographic databases, including workflow complexity, error propagation, and heavy dependence on structured geographic knowledge bases. The method converts geographic coordinates into geohash sequences, reformulating the coordinate prediction task as a text generation problem, and introduces a Chain-of-Thought mechanism to enhance the model's reasoning over spatial relationships. Furthermore, reinforcement learning with a distance-deviation-based reward is applied to optimize the generation accuracy. Comprehensive experiments show that ReaGeo can accurately handle explicit address queries in single-point predictions and effectively resolve vague relative location queries. In addition, the model demonstrates strong predictive capability for non-point geometric regions, highlighting its versatility and generalization ability in geocoding tasks.

cs.AI↗

arXiv2026

A novel LSTM music generator based on the fractional time-frequency feature extraction

In this paper, we propose a novel approach for generating music based on an artificial intelligence (AI) system. We analyze the features of music and use them to fit and predict the music. The fractional Fourier transform (FrFT) and the long short-term memory (LSTM) network are the foundations of our method. The FrFT method is used to extract the spectral features of a music piece, where the music signal is expressed on the time and frequency domains. The LSTM network is used to generate new music based on the extracted features, where we predict the music according to the hidden layer features and real-time inputs using GiantMIDI-Piano dataset. The results of our experiments show that our proposed system is capable of generating high-quality music that is comparable to human-generated music.

cs.SD↗

arXiv2026

A Mechanistic Analysis of Sim-and-Real Co-Training in Generative Robot Policies

Co-training, which combines limited in-domain real-world data with abundant surrogate data such as simulation or cross-embodiment robot data, is widely used for training generative robot policies. Despite its empirical success, the mechanisms that determine when and why co-training is effective remain poorly understood. We investigate the mechanism of sim-and-real co-training through theoretical analysis and empirical study, and identify two intrinsic effects governing performance. The first, \textbf{``structured representation alignment"}, reflects a balance between cross-domain representation alignment and domain discernibility, and plays a primary role in downstream performance. The second, the \textbf{``importance reweighting effect"}, arises from domain-dependent modulation of action weighting and operates at a secondary level. We validate these effects with controlled experiments on a toy model and extensive sim-and-sim and sim-and-real robot manipulation experiments. Our analysis offers a unified interpretation of recent co-training techniques and motivates a simple method that consistently improves upon prior approaches. More broadly, our aim is to examine the inner workings of co-training and to facilitate research in this direction.

cs.RO↗

arXiv2026

TabKD: Tabular Knowledge Distillation through Interaction Diversity of Learned Feature Bins

Data-free knowledge distillation enables model compression without original training data, critical for privacy-sensitive tabular domains. However, existing methods does not perform well on tabular data because they do not explicitly address feature interactions, the fundamental way tabular models encode predictive knowledge. We identify interaction diversity, systematic coverage of feature combinations, as an essential requirement for effective tabular distillation. To operationalize this insight, we propose TabKD, which learns adaptive feature bins aligned with teacher decision boundaries, then generates synthetic queries that maximize pairwise interaction coverage. Across 4 benchmark datasets and 4 teacher architectures, TabKD achieves highest student-teacher agreement in 14 out of 16 configurations, outperforming 5 state-of-the-art baselines. We further show that interaction coverage strongly correlates with distillation quality, validating our core hypothesis. Our work establishes interaction-focused exploration as a principled framework for tabular model extraction.

cs.LG↗

arXiv2026

DD-CAM: Minimal Sufficient Explanations for Vision Models Using Delta Debugging

We introduce a gradient-free framework for identifying minimal, sufficient, and decision-preserving explanations in vision models by isolating the smallest subset of representational units whose joint activation preserves predictions. Unlike existing approaches that aggregate all units, often leading to cluttered saliency maps, our approach, DD-CAM, identifies a 1-minimal subset whose joint activation suffices to preserve the prediction (i.e., removing any unit from the subset alters the prediction). To efficiently isolate minimal sufficient subsets, we adapt delta debugging, a systematic reduction strategy from software debugging, and configure its search strategy based on unit interactions in the classifier head: testing individual units for models with non-interacting units and testing unit combinations for models in which unit interactions exist. We then generate minimal, prediction-preserving saliency maps that highlight only the most essential features. Our experimental evaluation demonstrates that our approach can produce more faithful explanations and achieve higher localization accuracy than the state-of-the-art CAM-based approaches.

cs.CV↗

arXiv2025

A DeepSeek-Powered AI System for Automated Chest Radiograph Interpretation in Clinical Practice

A global shortage of radiologists has been exacerbated by the significant volume of chest X-ray workloads, particularly in primary care. Although multimodal large language models show promise, existing evaluations predominantly rely on automated metrics or retrospective analyses, lacking rigorous prospective clinical validation. Janus-Pro-CXR (1B), a chest X-ray interpretation system based on DeepSeek Janus-Pro model, was developed and rigorously validated through a multicenter prospective trial (NCT07117266). Our system outperforms state-of-the-art X-ray report generation models in automated report generation, surpassing even larger-scale models including ChatGPT 4o (200B parameters), while demonstrating reliable detection of six clinically critical radiographic findings. Retrospective evaluation confirms significantly higher report accuracy than Janus-Pro and ChatGPT 4o. In prospective clinical deployment, AI assistance significantly improved report quality scores, reduced interpretation time by 18.3% (P < 0.001), and was preferred by a majority of experts in 54.3% of cases. Through lightweight architecture and domain-specific optimization, Janus-Pro-CXR improves diagnostic reliability and workflow efficiency, particularly in resource-constrained settings. The model architecture and implementation framework will be open-sourced to facilitate the clinical translation of AI-assisted radiology solutions.

cs.AI↗

arXiv2025

Companion Agents: A Table-Information Mining Paradigm for Text-to-SQL

Large-scale Text-to-SQL benchmarks such as BIRD typically assume complete and accurate database annotations as well as readily available external knowledge, which fails to reflect common industrial settings where annotations are missing, incomplete, or erroneous. This mismatch substantially limits the real-world applicability of state-of-the-art (SOTA) Text-to-SQL systems. To bridge this gap, we explore a database-centric approach that leverages intrinsic, fine-grained information residing in relational databases to construct missing evidence and improve Text-to-SQL accuracy under annotation-scarce conditions. Our key hypothesis is that when a query requires multi-step reasoning over extensive table information, existing methods often struggle to reliably identify and utilize the truly relevant knowledge. We therefore propose to "cache" query-relevant knowledge on the database side in advance, so that it can be selectively activated at inference time. Based on this idea, we introduce Companion Agents (CA), a new Text-to-SQL paradigm that incorporates a group of agents accompanying database schemas to proactively mine and consolidate hidden inter-table relations, value-domain distributions, statistical regularities, and latent semantic cues before query generation. Experiments on BIRD under the fully missing evidence setting show that CA recovers +4.49 / +4.37 / +14.13 execution accuracy points on RSL-SQL / CHESS / DAIL-SQL, respectively, with larger gains on the Challenging subset +9.65 / +7.58 / +16.71. These improvements stem from CA's automatic database-side mining and evidence construction, suggesting a practical path toward industrial-grade Text-to-SQL deployment without reliance on human-curated evidence.

cs.CL↗

arXiv2025

Dark matter in ALFALFA galaxies: Investigating galaxy-halo connection

This paper aims to investigate the galaxy-halo connection using a large sample of individual galaxies with $\mathrm{H\,I}$ integrated spectra. We determine their dark matter content by applying a dynamical method based on $\mathrm{H\,I}$ line widths measured with the curve-of-growth technique, together with inclination corrections inferred from optical images. We build a sample of 2453 gas-rich predominantly late-type galaxies spanning a stellar mass range of $10^{8.7}M_\odot$ to $10^{11.4}M_\odot$ by matching them one-to-one with their counterparts from the ALFALFA survey and the TNG100 simulation, ensuring a direct match of stellar mass and $\mathrm{H\,I}$ radius. We generate mock images and mock $\mathrm{H\,I}$ integrated spectra for TNG100 galaxies, and apply the same dynamical method to both ALFALFA and TNG100 mock galaxies to infer their dark matter masses. Across all stellar mass bins, ALFALFA galaxies exhibit lower median dark matter masses than the mock TNG100 simulation results. In each bin, this offset is driven by a tail of galaxies with comparatively low dark matter content, which becomes more prominent toward higher stellar masses. In the highest mass bin ($M_* > 10^{11} M_\odot$), late-type ALFALFA galaxies show a median dark matter mass that is 23% lower than that of their counterparts in the TNG100 dark-matter-only simulation, with 32% of ALFALFA galaxies having $M_\mathrm{DM}(<R_\mathrm{HI})<10^{11.5} M_\odot$, compared to 17% in the mock TNG100 sample. These results suggest that a larger fraction of massive late-type galaxies reside in relatively less massive dark matter haloes than predicted by the TNG100 simulation.

astro-ph.GA↗

arXiv2025

From Context to EDUs: Faithful and Structured Context Compression via Elementary Discourse Unit Decomposition

Managing extensive context remains a critical bottleneck for Large Language Models (LLMs), particularly in applications like long-document question answering and autonomous agents where lengthy inputs incur high computational costs and introduce noise. Existing compression techniques often disrupt local coherence through discrete token removal or rely on implicit latent encoding that suffers from positional bias and incompatibility with closed-source APIs. To address these limitations, we introduce the EDU-based Context Compressor, a novel explicit compression framework designed to preserve both global structure and fine-grained details. Our approach reformulates context compression as a structure-then-select process. First, our LingoEDU transforms linear text into a structural relation tree of Elementary Discourse Units (EDUs) which are anchored strictly to source indices to eliminate hallucination. Second, a lightweight ranking module selects query-relevant sub-trees for linearization. To rigorously evaluate structural understanding, we release StructBench, a manually annotated dataset of 248 diverse documents. Empirical results demonstrate that our method achieves state-of-the-art structural prediction accuracy and significantly outperforms frontier LLMs while reducing costs. Furthermore, our structure-aware compression substantially enhances performance across downstream tasks ranging from long-context tasks to complex Deep Search scenarios.

cs.CL↗

arXiv2025

ABLE: Using Adversarial Pairs to Construct Local Models for Explaining Model Predictions

Machine learning models are increasingly used in critical applications but are mostly "black boxes" due to their lack of transparency. Local explanation approaches, such as LIME, address this issue by approximating the behavior of complex models near a test instance using simple, interpretable models. However, these approaches often suffer from instability and poor local fidelity. In this paper, we propose a novel approach called Adversarially Bracketed Local Explanation (ABLE) to address these limitations. Our approach first generates a set of neighborhood points near the test instance, x_test, by adding bounded Gaussian noise. For each neighborhood point D, we apply an adversarial attack to generate an adversarial point A with minimal perturbation that results in a different label than D. A second adversarial attack is then performed on A to generate a point A' that has the same label as D (and thus different than A). The points A and A' form an adversarial pair that brackets the local decision boundary for x_test. We then train a linear model on these adversarial pairs to approximate the local decision boundary. Experimental results on six UCI benchmark datasets across three deep neural network architectures demonstrate that our approach achieves higher stability and fidelity than the state-of-the-art.

cs.LG↗