Searcharxiv⌕ Search

arXiv subjects

Sheng Wang

Publications and source records attributed to Sheng Wang.

At least 37 records · Page 2Linked to original sources
arXiv2026

GRBench: A Comprehensive Benchmark Evaluation for Graph-relational Data Management

Modern data-intensive applications increasingly require database systems to manage structured records and graph data. This demand gives rise to graph-relational data management, spanning storage, query processing, and optimization across relational and graph data. In response, relational database extensions, multi-model databases, and dedicated graph-relational systems have emerged with diverse architectures. However, evaluation methodologies have not kept pace. Existing relational and graph benchmarks assess the two models largely in isolation, while multi-model benchmarks provide limited coverage of graph-relational workloads. Available graph-relational workloads mainly support functional validation and end-to-end latency measurement, revealing little about how storage, operator, and optimization designs affect performance. To evaluate system capabilities in graph-relational data management, we present GRBench. First, GRBench constructs a linked graph-relational schema from the real-world SciSciNet-v2 dataset and derives scalable instances through consistency-preserving subset extraction. Second, it organizes purpose-built query series for controlled evaluation of query processing and system components. Third, GRBench provides semantically equivalent native query formulations and evaluates representative system architectures through a unified, multidimensional methodology. Based on this evaluation, we analyze design trade-offs and identify open challenges to guide future system design and optimization.

cs.DB↗
arXiv2026

High-Harmonic Coherent Pulse Generation in a Storage Ring Using Multiple-Echo-Enabled Harmonic Generation

Fourth-generation storage-ring light sources have achieved transverse emittances approaching the diffraction limit at x-ray wavelengths, while their longitudinal coherence remains limited. Existing laser-modulation schemes can induce strong microbunching, but most storage-ring implementations produce only one useful coherent output from a given longitudinal region during each revolution, thereby underutilizing the intrinsic multi-user capability of storage rings. We propose a multiple-echo-enabled harmonic generation (multi-EEHG) scheme that applies successive excitation--echo cycles to the same longitudinal slice of a stored bunch within one revolution, enabling coherent-radiation delivery to multiple beamlines at different wavelengths. A general formulation of the n-stage EEHG bunching factor and a corresponding optimization procedure are derived. As an example, a triple-EEHG configuration is designed for the SAPS storage ring. Simulations demonstrate coherent radiation at multiple wavelengths with single-pulse photon numbers up to $10^9$, corresponding to an enhancement of approximately three orders of magnitude over synchrotron radiation for the same spectral bandwidth, while achieving few-meV bandwidth without a monochromator. The proposed scheme offers a scalable approach for multi-beamline coherent operation in next-generation storage-ring light sources.

physics.acc-ph↗
arXiv2026

Two-dimensional beam compression for sub-femtosecond electron beam generation

Sub-femtosecond electron beams are powerful probes of ultrafast electronic, atomic, and nuclear dynamics, and promising drivers for ultrashort radiation generation from the extreme-ultraviolet to gamma-ray regimes. However, producing such beams at hundred-MeV energies with pC-level charge remains challenging. Here we develop a two-dimensional beam-compression scheme based on transverse--longitudinal coupling, in which dispersive beam optics convert the small transverse emittance of modern electron beams into an ultrashort bunch length. Linear analysis and particle tracking show that, after the dominant longitudinal and energy-spread contributions are cancelled, the compressed bunch length is governed primarily by transverse beam quality and collective-effect growth. We further derive and verify a scaling model that captures collective-effect-induced bunch-length degradation and provides a charge--energy operating map for sub-femtosecond compression. Start-to-end simulations of a realistic injector-to-compressor beamline produce a 200 MeV, pC-level bunch with a bunch length of 0.45 fs and a peak current of about 3.5 kA. Jitter studies over a broad range of beam energies show that the output bunch-length distribution narrows and then varies only weakly with increasing energy. These results suggest a feasible route toward compact, high-energy attosecond electron beam sources and may provide a basis for future sub-femtosecond radiation sources based on undulator emission or inverse Compton scattering.

physics.acc-ph↗
arXiv2026

StrataCL: Fabric-Native Communication Library for Production Supernodes

Modern distributed AI workloads run across hundreds of accelerators, making communication a major bottleneck. Existing communication libraries remain largely buffer-centric because user and communication buffers are managed separately, causing redundant data copies or costly user-buffer registration. This paper presents StrataCL, a zero-redundancy and fabric-native communication library for production supernodes. StrataCL introduces registration-on-allocation to realize user-buffer direct communication, and designs communication operators with workload-balanced NPU-core partitioning and NPU-driven SDMA offloading to exploit supernode architecture features. On the Huawei CloudMatrix384, StrataCL improves collective bus bandwidth by up to 1.6x and improves MoE dispatch/combine bus bandwidth by up to 1.4x. Across three production workloads, StrataCL improves LLM inference throughput by 1.9x, reduces P99 TTFT by 2.2x, and reduces LLM and Recsys training iteration time by 1.4x and 1.3x, respectively.

cs.DC↗
arXiv2026

Mitigating Context Interference for Reliable and Efficient Search Agents

Recent research empowers Large Language Models (LLMs) as multi-turn search agents to iteratively retrieve and generate outputs until complex tasks are solved. However, the contexts of multi-turn search agents are lengthy and complex. For example, the retrieved set of documents in each turn would inevitably introduce irrelevant information that distracts LLMs, referring to \textit{context interference}, potentially hindering the reliability and efficiency of search agents. Therefore, we conduct a systematic study on context interference in multi-turn search agents, focusing on investigating i) which parts of the context of search agents will contribute to the context interference, ii) how to refine the contexts of search agents to mitigate the interference, and iii) can incorporating context refinement into search agent training yield further improvements. We reveal that interference primarily arises from the latest retrieved documents. Based on the explored findings, we then introduce a distill-based context refiner to dynamically mitigate context interference for multi-turn search agents. Finally, we validate that incorporating context refinement into RL training pipelines of search agents can significantly enhance both reliability and efficiency. This study highlights the importance of mitigating context interference of search agents, inspiring a novel paradigm of ``refine context and then generate'' for AI agents.

cs.CL↗
arXiv2026

Apodex Discovery: Reality Benchmarks and Environments for Evaluating and Building Discoverative Artificial Intelligence

Apollo did not reach the Moon merely because its engineers could solve difficult equations. It succeeded by turning a distant ambition into a mission architecture of explicit objectives, simulation, verification, and repeated correction. AI now faces a similar transition: frontier models can solve difficult tasks once the problem, tools, and success criteria are specified, yet consequential real-world challenges rarely arrive in an executable or verifiable form. We introduce Apodex Discovery, a framework for building and evaluating discoverative AI through the heavy-duty solver, a system comprising a foundation model, harness, tools, and control policies that pursues extended, stateful, verifiable investigations. It has three core components. First, a problem-scouting process surveyed 561 industries across 16 sectors, assembled 423 high-value real-world problems, and selected 20 for the initial release. Second, a common environment-task-episode abstraction provides data, tools, constraints, feedback, trajectory recording, and verification of intermediate artifacts and final submissions. Third, HDS6 evaluates Tools, Repair, Alternatives, Coherence, Evidence, and Scope independently of final-task success. In AAV capsid design, Apodex surpassed the published state of the art by 7% across viability, tropism, structure prediction, and generative design. In drug repurposing and reformulation, a task-specific biomedical environment improved the mean normalized prediction score of GPT-5.5 and GPT-5.6-sol by 2.5 and 7.6 points over the same closed-book backbone. Controlled ablations show that the fixed TRACES episode interface enables attribution of performance differences to specific solver components. Apodex Discovery moves AI evaluation beyond predefined benchmarks toward verifiable investigations aimed at genuine discovery.

cs.AI↗
arXiv2026

EditFlow3D: Automated Local Editing of 3D Assets with Trajectory Preservation

Controllable local editing of 3D assets requires precise target localization and appropriate visual guidance. However, existing methods lack a simple yet accurate way to obtain 3D masks and struggle to achieve the desired edit while faithfully preserving the structure and appearance of non-target regions. To address these challenges, we present EditFlow3D, a training-free framework for local 3D editing. Given a source asset and an edit instruction, a VLM-driven workflow interprets the editing intent and automatically constructs a visual guidance image and a refined 3D editing mask, enabling localized editing in the native representation space of a pretrained 3D generative model. Specifically, mask-guided differential flow focuses the edit on the target region, while step-wise trajectory preservation maintains consistency between non-target regions and the source asset without directly replacing intermediate features. Since the existing Edit3D-Bench covers only a limited range of local editing categories, we further introduce EditFlow-Bench as a complementary benchmark encompassing a broader variety of structural and appearance edits, and evaluate EditFlow3D on both benchmarks. Quantitative results, qualitative comparisons, and a user study demonstrate that EditFlow3D achieves more accurate target-region editing and better preserves non-target regions than existing 3D editing methods.

cs.CV↗
arXiv2026

Mean-field game of mean-variance portfolio optimization with peer-based risk aversion

This paper investigates a class of mean-field game (MFG) for mean-variance (MV) portfolio optimization, highlighting a new type of relative performance encoded by the peer-based risk aversion. Specifically, the risk aversion is formulated as a piecewise form that depends on whether the individual's wealth is above or below the population average, leading to a time-inconsistent MFG. Our goal is to seek a mean-field equilibrium, characterized by a forward-backward stochastic differential equation (FBSDE) system and a mean-field consistency condition. The new challenge stems from the discontinuous coefficients induced by the piecewise risk aversion. In response, we first introduce a smooth regularization technique to establish the existence of a solution to the discontinuous multidimensional FBSDE; this solution then yields the existence of an intra-personal equilibrium for the representative agent. Finally, we conclude the existence of the mean-field equilibrium in the time-inconsistent MFG by invoking fixed-point arguments and convergence analysis as the smoothing regularization vanishes.

q-fin.MF↗
arXiv2026

GigaPath-Flash and GigaTIME-Flash: Efficient Pathology Foundation Models for Whole-Slide and Tumor Microenvironment Analysis

Foundation models have emerged as a driving force in computational pathology, with the potential to transform cancer diagnosis, prognosis, and treatment selection by learning transferable representations from large-scale histopathology data. A growing landscape of pathology foundation models now spans diverse data sources, architectures, and downstream applications. However, most pretrained models operate only at the image-tile level, use restrictive licenses, and remain computationally expensive, limiting large-scale slide-level clinical and research use. Here, we introduce GigaPath-Flash and GigaTIME-Flash, efficient models for whole-slide pathology AI and spatial proteomics prediction. GigaPath-Flash combines a 22M-parameter ViT-S tile encoder with a 21M-parameter LongNet slide encoder, both pretrained on large-scale real-world histopathology data. Its compact tile encoder is distilled from the billion-parameter GigaPath (ViT-g) teacher and shared by both models. GigaPath-Flash retains 97% of GigaPath's average slide-level performance with 50x less compute. GigaTIME-Flash extends this backbone to predict the tumor immune microenvironment directly from routine H&E images. It surpasses the original CNN-based GigaTIME in prediction quality while running 6x faster and using 8x less GPU memory. Together with GigaPath and GigaTIME, these models form an open-weight, Apache-2.0-licensed family pretrained on large-scale real-world clinical data. By releasing all models and weights, we provide accessible building blocks for computational pathology, immuno-oncology, and precision health.

cs.CV↗
arXiv2026

Think Before You Comfort: Reflective Cognitive Alignment for Protocol-Grounded Elderly Stimulation Agents

Cognitive Stimulation Therapy (CST) offers non-pharmacological support for elders with cognitive impairment, yet scalability remains constrained by reliance on trained facilitators and severe data scarcity, particularly for privacy-sensitive, low-resource languages such as Cantonese. While Large Language Models (LLMs) show promise for automated companionship, they often struggle to balance empathetic engagement with adherence to cognitive stimulation guidelines. We propose a framework addressing these challenges along two complementary axes. First, STaR-CS (Style-Transfer and Role-Conditioned Cognitive Stimulation) synthesizes multi-party dialogues through facilitator style modeling and structured skeleton extraction, mitigating data barriers. Building upon this corpus, the Reflective Cognitive Alignment (RCA) framework models stimulation interactions as a sequential decision process, integrating Protocol-Constrained Chain-of-Cognition (PC-CoC) for structured reasoning and Inference-Time Value Alignment (IVA) for principled response selection based on safety and engagement goals. Evaluations across six backbone LLMs and two independent judges show that RCA consistently improves protocol adherence, safety, and group facilitation over standard prompting baselines. Our code is available at https://github.com/jiangjyjy/RCA_Agent.

cs.CL↗
arXiv2026

ToolSelf: Unifying Task Execution and Self-Reconfiguration via Tool-Driven Emergent Adaptation

LLM-powered agentic systems excel at complex long-horizon tasks, but remain constrained by static configurations fixed before execution. Such rigidity forces a trade-off between domain-specific performance and cross-task generalization: strong priors and compact tool spaces aid specialization but weaken transfer, while task-agnostic workflows and broad action spaces expand coverage but dilute guidance. Existing pre-execution optimization, planner-worker orchestration, and configuration patching fall short of resolving this tension, as they decouple adaptation from execution, causing information loss, fragmented optimization, and ambiguous credit assignment. We propose ToolSelf, a tool-driven runtime self-reconfiguration paradigm that abstracts configuration updates as a standardized tool interface and unifies execution and adaptation within one policy's action space. The execution agent can dynamically update sub-goals, strategies, toolboxes, context, and context-management modes based on task progress and feedback. We further introduce Configuration-Aware Two-stage Training (CAT), which combines rejection sampling fine-tuning with trajectory-level KTO reinforcement learning to internalize self-reconfiguration. Across diverse benchmarks, zero-shot ToolSelf rivals task-specialized agents; after CAT training, ToolSelf gains 28.8 points over the static-configuration baseline on average, illuminating a path toward emergent adaptivity that obviates manually injected guidance. The code is available at https://github.com/lian-tian-mo-zun/ToolSelf.

cs.AI↗
arXiv2026

Genetic Algorithm Based Coordination and Optimization Model for Generation Grid Load Storage in Active Distribution Networks

Create an optimization framework that combines fuzzy logic and genetic algorithms for risk assessment and coordination of generation, grid connection, load, and energy storage facilities in active distribution networks. In order to capture the system uncertainties caused by weather factors and dynamic user demands, this project uses fuzzy set representation to model renewable energy generation, load curves, and market prices. In the evolutionary process, genetic algorithms introduce fuzzy elements into system management, adjusting thru penalty factors to improve stability and seeking better scheduling or power dispatch solutions. At the same time, by penalizing uncertainty and constraint violations, the fitness function of the hybrid model aims to optimize the expected operational costs; it can produce feasible and economical results under unknown parameter conditions. Under conditions with a large supply of renewable energy and installed energy storage systems, simulation results for the IEEE-69 power system indicate that the fuzzy genetic algorithm strategy effectively reduces technical constraints compared to deterministic optimization schemes. The total investment remains at a similar level. Other data indicate that thru fuzzy reasoning optimization, unreasonable choices or impossible situations are avoided during the network adaptation process. This framework-based technical approach helps to construct an effective computational scheme that is aware of uncertainty in its outputs. This will provide a scientific basis for the uncertainty assessment in distribution network planning.

cs.NE↗
arXiv2026

A multi-agent system for spine MRI report generation from multi-sequence imaging

Spinal pathology is a leading cause of pain and disability worldwide. Spine MRI is central to clinical evaluation, yet its interpretation remains complex and time-consuming, requiring integration of information across multiple imaging sequences and anatomical regions. Despite recent advances in automated MRI analysis, effectively combining multi-sequence data while preserving sequence-specific diagnostic information remains an open challenge. Here we present SpineAgent, a multi-agent framework for spine MRI report generation built upon a multi-sequence foundation model trained on routine clinical data from 32,047 patients and 453,683 MRI series, comprising a total of 13,441,191 MRI slices. To accommodate diverse modalities of sequences, we first pre-train two DINOv3-based encoders separately on T1- and T2-weighted sequences. We then introduce a continual training strategy that learns a synthesizer to embed images of other sequences using the T1 and T2 encoders, producing patient-level embedding that integrates various signals across MRI sequences. Using these embeddings, SpineAgent achieves state-of-the-art performance, and demonstrates strong generalizability under cross-manufacturer and cross-cohort evaluation. Beyond classification, SpineAgent enables pathology localization by identifying findings-relevant slices and segmenting pathological regions. It also supports multimodal image-report retrieval, providing a solid foundation for scalable and explainable MRI report generation. We further integrate these validated capabilities of SpineAgent into 37 specialized agents. Finally, we incorporate their outputs as structured tokens within a Medical Report Agent trained end-to-end for report generation. Through both automated metrics and expert evaluation by five radiologists, SpineAgent achieves leading performance in spine MRI report generation.

cs.CV↗
arXiv2026

AutoResearchClaw: Self-Reinforcing Autonomous Research with Human-AI Collaboration

Automating scientific discovery requires more than generating papers from ideas. Real research is iterative: hypotheses are challenged from multiple perspectives, experiments fail and inform the next attempt, and lessons accumulate across cycles. Existing autonomous research systems often model this process as a linear pipeline: they rely on single-agent reasoning, stop when execution fails, and do not carry experience across runs. We present AutoResearchClaw, a multi-agent autonomous research pipeline built on five mechanisms: structured multi-agent debate for hypothesis generation and result analysis, a self-healing executor with a \textsc{Pivot}/\textsc{Refine} decision loop that transforms failures into information, verifiable result reporting that prevents fabricated numbers and hallucinated citations, human-in-the-loop collaboration with seven intervention modes spanning full autonomy to step-by-step oversight, and cross-run evolution that converts past mistakes into future safeguards. On ARC-Bench, a 25-topic experiment-stage benchmark, AutoResearchClaw outperforms AI Scientist v2 by 54.7%. A human-in-the-loop ablation across seven intervention modes reveals that precise, targeted collaboration at high-leverage decision points consistently outperforms both full autonomy and exhaustive step-by-step oversight. We position AutoResearchClaw as a research amplifier that augments rather than replaces human scientific judgment. Code is available at https://github.com/aiming-lab/AutoResearchClaw.

cs.AI↗
arXiv2026

High-Density Horizontal Arrays of Single-Chirality Carbon Nanotubes

Highly ordered high-density arrays of single-chirality single-walled carbon nanotubes (SWCNTs) are greatly desired for exploring the intrinsic anisotropic properties and collective performance of such 1-dimensional (1D) nanomaterials. Here we present a Marangoni flow-induced self-assembly (MISA) strategy to fabricate monolayered SWCNT arrays achieving a packing density of ~200 ${μm}^{-1}$ and a 2-dimensional order parameter ($S_{2\mathrm{D}}$) of ~0.95. Relying on its general compatibility with both organic and aqueous dispersions, we prepare single-chirality and enantiomer-pure SWCNT arrays from organic and aqueous dispersions resulting from the sorting processes. The anisotropic optical and electrical properties of the arrays are demonstrated by the polarization-dependent Rabi splitting as well as polarized near-infrared light emission and detection. With the great tolerance to solutions, substrates, and materials, as well as the feasibility and controllability, MISA shows great potential in the assembly of 1D nanomaterials.

cond-mat.mtrl-sci↗
arXiv2026

Hypergraph Pattern Machine: Compositional Tokenization for Higher-Order Interactions

Hypergraphs model higher-order relations that drive real-world decisions, from drug prescriptions to recommendations. A central structural signal in such data, beyond what pairwise relations can express, is interaction compositionality: whether a higher-order relation is compositional, emergent, or inhibitory with respect to its observed or unobserved sets. In polypharmacy, the regime decides whether a drug should be dropped, kept, or excluded: a compositional drug triple can be safely simplified, an emergent triple requires all drugs jointly, and an inhibitory triple flags a drug that disrupts an existing interaction. However, existing hypergraph learning methods, which merely propagate messages over observed hyperedges, leave this compositional signal unmodeled, allowing dangerous drug combinations to slip through and be misclassified. To this end, we propose the Hypergraph Pattern Machine (HGPM), shifting the paradigm from message passing to learning the compositional pattern of subsets. It tokenizes compositional subsets, organizes them in an inclusion DAG, and trains an inclusion-aware Transformer under masked reconstruction. On ten hypergraph benchmarks, HGPM matches or exceeds state-of-the-art methods. Notably, in a real adverse-event prediction case, HGPM correctly identifies the drug addition that inhibits the side effect among feature-identical candidates, a discrimination existing methods cannot make. The code and data are in https://github.com/KryieZhao/HGPM.git.

cs.LG↗
arXiv2026

XFreq-GS: Cross-Frequency Wireless Radiation Field Reconstruction with 3D Gaussian Splatting

Channel modeling is fundamental to the analysis, design, and optimization of wireless communication systems, which, however, accurate wireless channel modeling remains challenging, especially given the increasingly complex wireless environments. As an emerging paradigm, 3D Gaussian Splatting (3DGS)-based channel modeling methods achieve accurate wireless radiation field (WRF) reconstruction and high-fidelity spatial spectrum synthesis. However, existing works only consider a single carrier frequency and fail to adapt to wide-range cross-frequency channels. To address this challenge, we propose XFreq-GS, a cross-frequency Gaussian splatting framework for WRF reconstruction. It employs 3D Gaussian primitives with shared geometry and frequency-adaptive radio frequency (RF) attributes to reconstruct cross-frequency WRF, and synthesizes power angular spectrum (PAS) maps for wireless channel modeling. Experiments show that XFreq-GS outperforms state-of-the-art 3DGS-based methods in PAS synthesis and achieves superior cross-frequency generalization. Code is available at https://github.com/KINGAZ1019/XFreq-GS.

eess.SP↗
arXiv2026

SegviGen: Repurposing 3D Generative Model for Part Segmentation

We introduce SegviGen, a framework that repurposes native 3D generative models for 3D part segmentation. Existing pipelines either lift strong 2D priors into 3D via distillation or multi-view mask aggregation, often suffering from cross-view inconsistency and blurred boundaries, or explore native 3D discriminative segmentation, which typically requires large-scale annotated 3D data and substantial training resources. In contrast, SegviGen leverages the structured priors encoded in pretrained 3D generative model to induce segmentation through distinctive part colorization, establishing a novel and efficient framework for part segmentation. Specifically, SegviGen encodes a 3D asset and predicts part-indicative colors on active voxels of a geometry-aligned reconstruction. It supports interactive part segmentation, full segmentation, and full segmentation with 2D guidance in a unified framework. Extensive experiments show that SegviGen improves over the prior state of the art by 40% on interactive part segmentation and by 15% on full segmentation, while using only 0.32% of the labeled training data. It demonstrates that pretrained 3D generative priors transfer effectively to 3D part segmentation, enabling strong performance with limited supervision. See our project page at https://fenghora.github.io/SegviGen-Page/.

cs.CV↗