SearcharxivSearch

arXiv subjects

Haiyang Wang

Publications and source records attributed to Haiyang Wang.

At least 19 recordsLinked to original sources

On Finite Gaussian Mixtures: Finiteness of the Number of Modes and an Application to NPMLE

We prove that every isotropic Gaussian mixture with finitely many components has finitely many modes. In one dimension, classical theory of Chebyshev systems gives the sharp bound of at most $n$ modes for an $n$-component mixture. In several dimensions, however, it has remained open whether every such mixture has finitely many modes. Our main result is the stronger statement that the entire critical set has finite cardinality, which is proven by combining real analytic curve selection theorem and Ax's functional-transcendence theorem. As an application, we show that, for Gaussian location mixtures, every nonparametric maximum likelihood estimator (NPMLE) based on a finite dataset is finitely supported. More specifically, all NPMLEs share the same finite set of allowable atom locations.

math.ST

Focal-point scanning for dose delivery and optimization with focused laser-accelerated very-high-energy electron beams

Focused very-high-energy electron (VHEE) beams can produce localized dose enhancement at selected depths, but irradiation of a finite target requires coordinated control of multiple focal positions, incidence directions, and beam weights while limiting exposure of nearby organs at risk (OARs). We present Focal-Point Scanning (FPS), a dose delivery and optimization method developed for laser wakefield accelerator (LWFA)-driven VHEE beams. The method is based on a two-dipole focusing system that produces single-plane beam convergence and allows the focal position to be varied by changing the magnetic field strength. FPS distributes focal points throughout the planning target volume and determines focal-point-specific incidence sectors according to the geometry of nearby critical OARs. The method was evaluated using the AAPM TG119 C-shape benchmark and one previously treated lung radiotherapy case. At matched target coverage, FPS reduced the TG119 Core mean dose by approximately one half relative to parallel VHEE and intensity-modulated x-ray plans, approaching the single-field proton pencil-beam-scanning reference. In the lung case, FPS maintained target coverage comparable to the clinical volumetric modulated arc therapy reference while reducing the mean dose to every evaluated OAR; spinal-cord mean and maximum doses decreased by 93.2% and 87.2%, respectively. The evaluated OAR mean doses varied little across rms energy spreads of 0 to 10% and for a flat-top electron spectrum spanning 150 to 250 MeV. These results demonstrate that focal-point-specific angular selection can translate focused-beam physics into effective OAR sparing and support FPS as a planning strategy for broadband LWFA-VHEE radiotherapy.

physics.med-ph

FQTree: Fine-grained Quantization and Hardware Generation of Boosted Decision Trees

Boosted decision trees (BDTs) are widely used in latency-critical applications, but efficient hardware deployment remains challenging. Existing designs often rely on uniform or manually tuned fixed-point formats, which can introduce unnecessary hardware cost or accuracy loss. This work presents the FQTree algorithm{https://github.com/ecs-bristol/FQTree} for fine-grained quantization-aware training of BDTs, together with the QXGB framework for automatic hardware generation. FQTree introduces a hardware-oriented leaf-value quantization scheme that uses a global quantization step together with a tree-wise shift, enabling compact non-negative integer leaf representations, controlled clipping/pruning, and bias folding to reduce datapath cost. This work further applies this quantization during boosting so that later trees adapt to the errors of the already-quantized ensemble, and then lowers the trained model into low-latency hardware implementations through a compiler-based flow. Results on JSC, MNIST, and NID show that our method reduces LUT usage by 26-57\% compared with the state-of-the-art FPGA-based BDT designs while matching or improving accuracy.

cs.AR

GalSAS-SDR-SIM: An End-to-End Simulation Platform for Galileo Signal Authentication Service

Galileo is developing a Signal Authentication Service (SAS) that integrates Open Service Navigation Message Authentication (OSNMA) on the E1 band with Spreading Code Authentication (SCA) on the E6 band to strengthen its resilience to spoofing attacks. As Galileo SAS is still under development, access to realistic and controllable SAS signals remains limited, hindering both the early development of compatible receivers and reproducible research on signal authentication. To bridge this gap, this paper presents GalSAS-SDR-SIM, an open-source software-defined radio (SDR) simulation platform that emulates the SAS workflow by coupling E6 code encryption with the OSNMA key-disclosure process. The platform allows flexible SAS configuration of code encryption parameters to accommodate receivers with different computational capabilities. It also supports the concurrent generation of Galileo E1, E5b, and E6 signals for user-defined locations and times, and OSNMA cross-satellite configurations. Experimental results demonstrate simultaneous verification of navigation messages and spreading codes. We further evaluate SAS authentication performance and computational resource costs under different SAS configurations. Implemented according to publicly available official specifications, GalSAS-SDR-SIM provides a practical tool for accelerating SAS-capable receiver development and supporting the research community in evaluating and improving Galileo signal-authentication techniques.

cs.CR

Medical Imaging Fusing Vision Transformer: Laryngeal Cancer Screening with Explanation

Early and timely screening of laryngeal cancer is crucial for improving clinical outcomes. In recent years, NBI endoscopy has become a standard diagnostic tool for the detection of laryngeal lesions. However, its effective use requires well-trained clinicians and the procedure is time-consuming and subject to interobserver variability. In this context, the application of artificial intelligence (AI) offers a promising solution to support clinical decision-making. In this work, we proposed applying transformer and attention mechanism for analyzing the narrow band imaging and distinguish benign and malignant lesions. Results show it has good classification performance with F1 (82.72%), accuracy(82.33%). In addition, the result of laryngeal cancer screening is explainable for clinicians. The explainability is utilizing the state of art segmentation method (MedSAM) to provide the useful pathological information area for clinicians. The proposed methodology fusing classification and segmentation provides a translating on laryngeal cancer screening.

cs.CV

General and scalable vapor etching and transformation platform for two-dimensional materials

Two-dimensional (2D) nanomaterials derived from non-van der Waals (non-vdW) solids offer exceptional physicochemical properties, yet their synthesis is impeded by intrinsic covalent/metallic bonding and high surface reactivity of the precursors. Here, we report a general vapor-phase etching and transformation platform for producing a library of 36 2D carbides, nitrides, and carbonitrides, exhibiting electrical conductivities spanning six orders of magnitude. Using reactive vapors like hydrogen chloride, we selectively remove A-layers from MAX phases to yield well-defined layers (MXenes), including previously inaccessible semiconducting Hf2CTx. By varying the reactive vapor environment, MXenes can be engineered at X-site and surface-termination site and even be transformed into non-vdW layers such as 2D MAX phases. This general and scalable vapor-phase platform reframes 2D material synthesis, opening new avenues for various applications.

cond-mat.mtrl-sci

A Bayesian Search for Planet Engulfment Signatures in Solar Analogs

We present a systematic Bayesian search for chemical fingerprints of planet engulfment in 113 solar twins and analogs with high-precision abundance measurements, 45 of which host known or candidate planets or brown-dwarf companions. We constructed a Bayesian framework with three sets of abundance models: random scatter, Galactic chemical evolution, and planet engulfment with bulk Earth or CM chondrite compositions. Through model comparisons, we identified three candidates whose abundance patterns strongly favor planet engulfment over the alternatives, with inferred engulfed masses of about 7.5-33 Earth masses. Our findings correspond to a nominal detection rate of 1-3% for planet-engulfment signatures among solar analogs. This work extends abundance-based engulfment searches beyond the binary-star context and provides a framework for probing star-planet co-evolution with solar analogs, which goes beyond the commonly used abundance-condensation-temperature correlation (Tc slope).

astro-ph.EP

Eigenstate Transitions, Duality, and Anomalous Diffusion in a Quasiperiodic Qi-Wu-Zhang Chern Insulator

Quasiperiodic systems usually interpolate between extended, critical, and localized states as the quasiperiodic modulation is increased. Here we show that the magnetic Qi-Wu-Zhang Chern-insulator model realizes a distinct full-spectrum transition in which localization is avoided. For an irrational magnetic flux, the two-dimensional model reduces to a spinor quasiperiodic chain with a matrix onsite modulation controlled by the hopping amplitude $t_x$. When $|m+2|>t_y$, increasing $t_x$ produces the conventional extended-critical-localized sequence with a critical line at $t_x=t_y$. In contrast, when $|m+2|\le t_y$, the system changes from an extended phase to a critical phase at $t_x=|m+2|$ and remains critical even for stronger quasiperiodic modulation. Finite-size scaling of the average inverse participation ratio gives $\overline{\mathrm{IPR}}\sim q^{-\alpha}$ with $0<\alpha<1$ throughout this persistent critical regime. A dual transformation exchanging $t_x$ and $t_y$, together with a Lyapunov-exponent analysis, explains the phase diagram. Wave-packet dynamics further distinguish ballistic, anomalous-diffusive, and localized regimes. These results identify magnetic Chern-insulator systems as a natural platform for robust criticality and anomalous quantum transport.

cond-mat.dis-nn

Claw-Anything: Benchmarking Always-On Personal Assistants with Broader Access to User's Digital World

Large language model agents are increasingly envisioned as always-on personal assistants with access to anything relevant in the user's digital world. Yet current systems operate over only narrow slices of that world, limiting context-sensitive reasoning and effective assistance. Existing benchmarks similarly provide only partial user state and therefore fail to capture performance in such a broad, always-on setting. To address this gap, we introduce Claw-Anything, a benchmark that expands agent context along three dimensions: long-horizon activity histories, interdependent backend services, and integrated GUI and CLI interaction across multiple devices. To instantiate this setting, we simulate months of user activity through multi-round event injection, producing complex world states and realistic noise, including irrelevant events and conflicting signals. Agents must reason over rich contextual environments while remaining robust to such noise. This expanded scope also enables the evaluation of proactive assistance, requiring agents to anticipate user needs and deliver timely recommendations. Experiments show that GPT-5.5 achieves only 34.5% pass@1, substantially below prior benchmarks, underscoring a gap between current agent capabilities and the demands of always-on personal assistance. Alongside the benchmark, we release an automated data-generation pipeline that yields 2,000 training environments and improves the base model by 23.7%, demonstrating its utility of scalable data infrastructure.

cs.AI

MobileGym: A Verifiable and Highly Parallel Simulation Platform for Mobile GUI Agent Research

We present MobileGym, a browser-hosted, lightweight, fully controllable environment for everyday mobile use, targeting interaction fidelity without replicating proprietary backends. It enables two capabilities previously out of reach for everyday apps: verifiable outcome signals through deterministic state-based judging over structured JSON state, and scalable online RL through low-cost parallel rollouts. The full environment state is captured, configured, forked, and compared as structured JSON, and a single server can host hundreds of parallel instances, with about 400 MB memory per instance and about 3 s cold start. A layered state model and a declarative task-definition framework keep state programmability and task creation practical at scale, and a single programmatic judging mechanism delivers both deterministic evaluation verdicts and dense RL rewards. The accompanying MobileGym-Bench provides 416 parameterized task templates, including 256 test and 160 train templates, over 28 apps, with deterministic judges and a structured AnswerSheet protocol that avoids free-text matching failures. In a Sim-to-Real case study, GRPO on Qwen3-VL-4B-Instruct gains +12.8 percentage points on the 256-task test set, and on a 59-task real-device signal subset, real-device execution retains 95.1% of the simulation-side training gain. Project page: https://mobilegym.github.io.

cs.AI

False Vacuum Decay across the Quantum-to-Thermal Crossover: A Comparison of Real-Time Observables

We develop a real-time Wigner-functional lattice framework with positive Hartree-Gaussian initial sampling and introduce a connected-cluster survival criterion for extracting false-vacuum decay rates across the crossover from quantum fluctuations to thermal nucleation. At high temperatures, the connected-cluster rate agrees well with the Hartree-resummed thermal nucleation benchmark, while the commonly used global-survival criterion can give substantially smaller rates because of multi-seed dynamics and global averaging. At low temperatures, the connected-cluster and global-survival rates approach each other in the dilute-event regime, whereas the false-vacuum fraction observable can be contaminated by transient spatial conversion and kink-antikink reflection. Our results clarify how different real-time observables encode distinct aspects of metastable decay.

hep-th

Origin and characterization of super-Earths and sub-Neptunes

Super-Earths and sub-Neptunes represent the most common class of exoplanets discovered to date in our galaxy, yet they have no direct analogues in the Solar System. Since 2014, researchers within the NCCR PlanetS have made significant contributions to understanding the origin and nature of these small planets. This chapter provides an overview of the progress made in their detection, characterization, and theoretical interpretation during the 2014-2025 period. The combined data from space-based photometric missions such as Kepler and TESS, together with ground-based radial velocity campaigns using state-of-the-art spectrographs (e.g., HARPS, ESPRESSO, NIRPS), have enabled detailed demographic analyses of these planets. These observational efforts are complemented by theoretical work exploring their internal structures, bulk compositions, formation and evolution, shedding light on the physical processes responsible for the observed diversity. As high-precision observations from facilities like JWST begin to probe the atmospheric composition of individual planets, a more complete picture of super-Earth and sub-Neptune origins is emerging, one that continues to challenge and refine current planet formation theories.

astro-ph.EP

TalkLoRA: Communication-Aware Mixture of Low-Rank Adaptation for Large Language Models

Low-Rank Adaptation (LoRA) enables parameter-efficient fine-tuning of Large Language Models (LLMs), and recent Mixture-of-Experts (MoE) extensions further enhance flexibility by dynamically combining multiple LoRA experts. However, existing MoE-augmented LoRA methods assume that experts operate independently, often leading to unstable routing, expert dominance. In this paper, we propose \textbf{TalkLoRA}, a communication-aware MoELoRA framework that relaxes this independence assumption by introducing expert-level communication prior to routing. TalkLoRA equips low-rank experts with a lightweight Talking Module that enables controlled information exchange across expert subspaces, producing a more robust global signal for routing. Theoretically, we show that expert communication smooths routing dynamics by mitigating perturbation amplification while strictly generalizing existing MoELoRA architectures. Empirically, TalkLoRA consistently outperforms vanilla LoRA and MoELoRA across diverse language understanding and generation tasks, achieving higher parameter efficiency and more balanced expert routing under comparable parameter budgets. These results highlight structured expert communication as a principled and effective enhancement for MoE-based parameter-efficient adaptation. Code is available at https://github.com/why0129/TalkLoRA.

cs.LG

An Improved Lower Bound on Cardinality of Support of the Amplitude-Constrained AWGN Channel

We study the amplitude-constrained additive white Gaussian noise channel. It is well known that the capacity-achieving input distribution for this channel is discrete and supported on finitely many points. The best known bounds show that the support size of the capacity-achieving distribution is lower-bounded by a term of order $A$ and upper-bounded by a term of order $A^2$, where $A$ denotes the amplitude constraint. It was conjectured in [1] that the linear scaling is optimal. In this work, we establish a new lower bound of order $A\sqrt{\log A}$, improving the known bound and ruling out the conjectured linear scaling. To obtain this result, we quantify the fact that the capacity-achieving output distribution is close to the uniform distribution in the interior of the amplitude constraint. Next, we introduce a wrapping operation that maps the problem to a compact domain and develop a theory of best approximation of the uniform distribution by finite Gaussian mixtures. These approximation bounds are then combined with stability properties of capacity-achieving distributions to yield the final support-size lower bound.

cs.IT

RLJP: Legal Judgment Prediction via First-Order Logic Rule-enhanced with Large Language Models

Legal Judgment Prediction (LJP) is a pivotal task in legal AI. Existing semantic-enhanced LJP models integrate judicial precedents and legal knowledge for high performance. But they neglect legal reasoning logic, a critical component of legal judgments requiring rigorous logical analysis. Although some approaches utilize legal reasoning logic for high-quality predictions, their logic rigidity hinders adaptation to case-specific logical frameworks, particularly in complex cases that are lengthy and detailed. This paper proposes a rule-enhanced legal judgment prediction framework based on first-order logic (FOL) formalism and comparative learning (CL) to develop an adaptive adjustment mechanism for legal judgment logic and further enhance performance in LJP. Inspired by the process of human exam preparation, our method follows a three-stage approach: first, we initialize judgment rules using the FOL formalism to capture complex reasoning logic accurately; next, we propose a Confusion-aware Contrastive Learning (CACL) to dynamically optimize the judgment rules through a quiz consisting of confusable cases; finally, we utilize the optimized judgment rules to predict legal judgments. Experimental results on two public datasets show superior performance across all metrics. The code is publicly available{https://anonymous.4open.science/r/RLJP-FDF1}.

cs.AI

FeatureBench: Benchmarking Agentic Coding for Complex Feature Development

Agents powered by large language models (LLMs) are increasingly adopted in the software industry, contributing code as collaborators or even autonomous developers. As their presence grows, it becomes important to assess the current boundaries of their coding abilities. Existing agentic coding benchmarks, however, cover a limited task scope, e.g., bug fixing within a single pull request (PR), and often rely on non-executable evaluations or lack an automated approach for continually updating the evaluation coverage. To address such issues, we propose FeatureBench, a benchmark designed to evaluate agentic coding performance in end-to-end, feature-oriented software development. FeatureBench incorporates an execution-based evaluation protocol and a scalable test-driven method that automatically derives tasks from code repositories with minimal human effort. By tracing from unit tests along a dependency graph, our approach can identify feature-level coding tasks spanning multiple commits and PRs scattered across the development timeline, while ensuring the proper functioning of other features after the separation. Using this framework, we curated 200 challenging evaluation tasks and 3825 executable environments from 24 open-source repositories in the first version of our benchmark. Empirical evaluation reveals that the state-of-the-art agentic model, such as Claude 4.5 Opus, which achieves a 74.4% resolved rate on SWE-bench, succeeds on only 11.0% of tasks, opening new opportunities for advancing agentic coding. Moreover, benefiting from our automated task collection toolkit, FeatureBench can be easily scaled and updated over time to mitigate data leakage. The inherent verifiability of constructed environments also makes our method potentially valuable for agent training.

cs.SE

CLI-Gym: Scalable CLI Task Generation via Agentic Environment Inversion

Agentic coding requires agents to effectively interact with runtime environments, e.g., command line interfaces (CLI), so as to complete tasks like resolving dependency issues, fixing system problems, etc. But it remains underexplored how such environment-intensive tasks can be obtained at scale to enhance agents' capabilities. To address this, based on an analogy between the Dockerfile and the agentic task, we propose to employ agents to simulate and explore environment histories, guided by execution feedback. By tracing histories of a healthy environment, its state can be inverted to an earlier one with runtime failures, from which a task can be derived by packing the buggy state and the corresponding error messages. With our method, named CLI-Gym, a total of 1,655 environment-intensive tasks are derived, being the largest collection of its kind. Moreover, with curated successful trajectories, our fine-tuned model, named LiberCoder, achieves substantial absolute improvements of +21.1% (to 46.1%) on Terminal-Bench, outperforming various strong baselines. To our knowledge, this is the first public pipeline for scalable derivation of environment-intensive tasks.

cs.AI

Super-Linear Growth of the Capacity-Achieving Input Support for the Amplitude-Constrained AWGN Channel

We study the growth of the support size of the capacity-achieving input distribution for the amplitude-constrained additive white Gaussian noise (AWGN) channel. While it is known since Smith (1971) that the optimal input is discrete with finitely many mass points, tight bounds on the number of support points $K_A$ as the amplitude constraint $A$ increases remain open. Not much is known until recently, when Dytso et al. (2019) proved that $K_A$ grows at least linearly and at most quadratically in $A$. Here, we provide a novel method, building on Ma et al. (2024); Zhang (1994), to derive the first non-trivial lower bound showing that KA grows super-linearly in A.

cs.IT