arXiv subjects

Xu Chen

Publications and source records attributed to Xu Chen.

At least 91 records · Page 5Linked to original sources

arXiv2026

Segment-chirped periodically poled lithium niobate waveguides for broadband supercontinuum generation

Supercontinuum generation is a key technology in nonlinear optics, supporting a wide range of applications in frequency metrology and spectroscopy. Integrated photonics offers a promising route toward compact and efficient supercontinuum sources, yet extending the bandwidth while maintaining high spectral flatness remains a central challenge. Here we demonstrate an integrated broadband supercontinuum source based on segment-chirped periodically poled lithium niobate (SC-PPLN) nanophotonic waveguides. By discretizing the chirped poling profile into independently optimized segments, this approach enables high-fidelity ferroelectric domain inversion with near-ideal duty cycles and establishes broadband quasi-phase matching, overcoming the domain inhomogeneity and efficiency limitations commonly encountered in conventional chirped poling. The engineered phase-matching landscape supports efficient wavelength conversion and simultaneous activation of multiple second- and third-order nonlinear processes. Experimentally, we achieve a spectrally flat supercontinuum spanning three optical octaves, from 320 nm in the ultraviolet to 2600 nm in the mid-infrared. These results establish segment-chirped poling as a practical strategy for broadband wavelength conversion and supercontinuum generation in integrated photonics.

physics.optics↗

arXiv2026

On the limiting geometry of unsteady breaking waves subject to co-flowing wind: spectrally-informed versus locally-measured steepness

Wave steepness is a key geometric variable for describing breaking occurrence and its consequences, including energy dissipation and air entrainment. Using three laboratory campaigns under varying spectral conditions and co-flowing wind forcing, we contrast two types of steepness commonly used for unsteady breaking waves: spectrally-informed wave-group steepness (prognostic), obtained from fixed-point surface-elevation records, and locally-measured crest steepness (diagnostic), obtained from spatial surface profiles extracted using the SDBW-I image-processing method developed herein. For the former, the long-adopted $\mathcal{S}_n$ (linear sum of Fourier-component steepness) increases appreciably within about two dominant wavelengths upstream of breaking because of its sensitivity to evolving high-frequency content. When measured sufficiently far upstream, however, wave-group steepness remains approximately linearly related to the local zero-crossing steepness $\mathcal{S}_b$ across bulk unforced conditions. Notwithstanding this, we argue that the crest-front steepness, $\mathcal{S}_{\mathrm{front}}(t_b)$, which delineates the front-face slope at incipient breaking, is the most physically meaningful metric examined here. It exhibits a consistent breaking-onset lower-bound threshold of $\mathcal{S}_{\mathrm{front}}(t_b)\approx0.2$, while values above this threshold decrease with wind speed as crests become less forward leaning. This may be attributed to wind-modified dispersion, enhanced high-frequency spectral content and aerodynamic sheltering, suggesting that wind--wave and wave--wave interactions act as competing mechanisms in triggering breaking through kinematic and energetic processes beyond what geometry alone can explain. Even so, $\mathcal{S}_{\mathrm{front}}(t_b)$ has strong potential as a controlling variable for future studies of breaking energetics and crest-scale dynamics.

physics.flu-dyn↗

arXiv2026

Divergence Meets Consensus: A Multi-Source Negative Sampling Framework for Sequential Recommendation

Negative sampling is significant for training sequential recommendation models under implicit feedback. The predominant strategy, self-guided hard negative sampling, selects negatives based on the model's current state but suffers from three limitations: (1) the coupling between sampling and model updates triggers a vicious cycle that drives the model into local optima; (2) relying on current model parameters narrows sampling to a small region of the item space, reducing diversity and harming generalization; (3) identifying a hard negative requires scoring the entire candidate pool, causing substantial computational overhead with minimal information gain. To address these challenges, we propose MDCNS (Multi-source Divergence-Consensus for Negative Sampling), a novel "Teacher-Peer-Self" framework inspired by Vygotsky's Zone of Proximal Development (ZPD) theory. The proposed method comprises three components, including multi-source scoring, divergence re-ranking, and consensus distillation. Firstly, multi-source scoring incorporates peer and ensemble teacher models to inject external negative signals and break the self-reinforcement loop. Then, divergence re-ranking exploits prediction discrepancy between self and peer models to enhance sampling diversity. Finally, consensus distillation aligns the self model with the teacher via KL divergence, simultaneously improving computational cost utilization. Extensive experiments on six real-world datasets and five backbone models show that MDCNS consistently outperforms state-of-the-art negative sampling methods, demonstrating strong effectiveness and generalization.

cs.IR↗

arXiv2026

L2P: Unlocking Latent Potential for Pixel Generation

Pixel diffusion models have recently regained attention for visual generation. However, training advanced pixel-space models from scratch demands prohibitive computational and data resources. To address this, we propose the Latent-to-Pixel (L2P) transfer paradigm, an efficient framework that directly harnesses the rich knowledge of pre-trained LDMs to build powerful pixel-space models. Specifically, L2P discards the VAE in favor of large-patch tokenization and freezes the source LDM's intermediate layers, exclusively training shallow layers to learn the latent-to-pixel transformation. By utilizing LDM-generated synthetic images as the sole training corpus, L2P fits an already smooth data manifold, enabling rapid convergence with zero real-data collection. This strategy allows L2P to seamlessly migrate massive latent priors to the pixel space using only 8 GPUs. Furthermore, eliminating the VAE memory bottleneck unlocks native 4K ultra-high resolution generation. Extensive experiments across mainstream LDM architectures show that L2P incurs negligible training overhead, yet performs on par with the source LDM on DPG-Bench and reaches 93% performance on GenEval.

cs.CV↗

arXiv2026

Decentralized Rank Scheduling for Energy-Constrained Multi-Task Federated Fine-Tuning in Edge-Assisted IoV Networks

Large-scale Internet of Vehicles (IoV) deployments increasingly demand the on-device adaptation of foundation models to support diverse, mission-critical perception tasks. While federated fine-tuning offers a promising solution for efficient model specialization, existing approaches often struggle to reconcile the inherent conflict between stringent global energy budgets, heterogeneous task demands, and the high volatility of vehicular network connectivity. In this work, we introduce a hierarchical, adaptive framework that decouples multi-task fine-tuning into two interdependent optimization phases. First, we implement a feedback-loop mechanism at the infrastructure level that dynamically redistributes global energy budgets across concurrent tasks based on real-time convergence dynamics and resource utilization. Second, at the vehicle level, we formulate intra-task rank selection as an energy-constrained online learning problem, solved via a novel primal-dual bandit algorithm, UCB-DUAL, which provides theoretical guarantees on sublinear regret. Our approach effectively internalizes global energy constraints into local decision-making, allowing vehicles to autonomously navigate the complex trade-off between model accuracy, latency, and power consumption. Empirical evaluations using a large-scale IoV simulator, driven by real-world trajectory data, confirm that our proposed method significantly outperforms current federated fine-tuning baselines, offering a robust and scalable solution for resource-constrained vehicular intelligence.

cs.LG↗

arXiv2026

CurEvo: Curriculum-Guided Self-Evolution for Video Understanding

Recent advances in self-evolution video understanding frameworks have demonstrated the potential of autonomous learning without human annotations. However, existing methods often suffer from weakly controlled optimization and uncontrolled difficulty progression, as they lack structured guidance throughout the iterative learning process. To address these limitations, we propose CurEvo, a curriculum-guided self-evolution framework that introduces curriculum learning into self-evolution to achieve more structured and progressive model improvement. CurEvo dynamically regulates task difficulty, refines evaluation criteria, and balances data diversity according to model competence, forming a curriculum-guided feedback loop that aligns learning complexity with model capability. Built upon this principle, we develop a multi-dimensional adaptive QA framework that jointly evolves question generation and answer evaluation across perception, recognition, and understanding dimensions, ensuring coherent and measurable curriculum progression. Through this integration, CurEvo transforms weakly controlled self-evolution into a more structured learning process for autonomous video understanding. Across seven backbones, CurEvo consistently improves both benchmark accuracy and evaluator-based semantic score on four VideoQA benchmarks, validating the effectiveness of curriculum-guided self-evolution for video understanding.

cs.CV↗

arXiv2026

Bragg-Williams order competes with superconductivity

Orderings in charge and spin have been extensively studied to unravel their correlation to emergent superconductivity over the past decades. Bragg-Williams order (BWO), a classical structural order parameter describing site occupancy in alloys, has long been speculated to influence superconducting behavior. Yet, its role still remains ambiguous, largely due to the difficulty of isolating BWO from concomitant charge doping or competing electronic instabilities. Here, we establish In2/3PSe3 as a platform wherein indium vacancies are reversibly configurable between ordered and disordered states via thermal treatment. We show that the disordered phase undergoes a pressure-induced superconducting transition with a Tc of 11 K, significantly higher than the 7 K observed in its ordered counterpart. This constitutes a rare instance in which pure BWO variation drives a substantial shift in Tc. By combining a Ginzburg-Landau phenomenological analysis with a BCS-McMillan microscopic description, we demonstrate that BWO naturally suppresses superconductivity through electron-phonon interactions, a mechanism supported by ultra-low-wavenumber Raman measurements. Our findings support BWO as an independent order parameter that competes directly with superconductivity, extending the concept of competing orders beyond conventional electronic and magnetic degrees of freedom.

cond-mat.supr-con↗

arXiv2026

eTFCE: Exact Threshold-Free Cluster Enhancement via Fast Cluster Retrieval

Threshold-free cluster enhancement (TFCE) is widely used for cluster-based inference in neuroimaging, but existing implementations typically rely on discretized approximations that may introduce numerical variability. We present eTFCE, an efficient framework that provides a numerically exact evaluation of the TFCE integral using an optimized cluster retrieval algorithm. Across multiple datasets, eTFCE and the standard implementation produce highly consistent inference results. Voxel-wise comparisons reveal a systematic asymmetry: the standard method yields smaller p-values for more voxels, while eTFCE concentrates stronger statistical evidence within a smaller subset. These differences are primarily confined to voxels near the inference boundary and have minimal impact on overall inference. This pattern is consistent with discretization effects in standard implementations, where the TFCE integral is approximated using a finite set of threshold levels, introducing subtle biases in statistical evidence accumulation across thresholds. Furthermore, eTFCE improves computational efficiency (71.3% of runtime on average) and enables unified computation of multiple cluster-based statistics within a single permutation framework. Overall, eTFCE provides an exact, efficient, and extensible approach to nonparametric neuroimaging inference.

stat.ME↗

arXiv2026

From Coarse to Fine: Self-Adaptive Hierarchical Planning for LLM Agents

Large language model-based agents have recently emerged as powerful approaches for solving dynamic and multi-step tasks. Most existing agents employ planning mechanisms to guide long-term actions in dynamic environments. However, current planning approaches face a fundamental limitation that they operate at a fixed granularity level. Specifically, they either provide excessive detail for simple tasks or insufficient detail for complex ones, failing to achieve an optimal balance between simplicity and complexity. Drawing inspiration from the principle of \textit{progressive refinement} in cognitive science, we propose \textbf{AdaPlan-H}, a self-adaptive hierarchical planning mechanism that mimics human planning strategies. Our method initiates with a coarse-grained macro plan and progressively refines it based on task complexity. It generates self-adaptive hierarchical plans tailored to the varying difficulty levels of different tasks, which can be optimized by imitation learning and capability enhancement. Experimental results demonstrate that our method significantly improves task execution success rates while mitigating overplanning at the planning level, providing a flexible and efficient solution for multi-step complex decision-making tasks. To contribute to the community, our code and data will be made publicly available at https://github.com/import-myself/AHP.

cs.AI↗

arXiv2026

Fast-then-Fine: A Two-Stage Framework with Multi-Granular Representation for Cross-Modal Retrieval in Remote Sensing

Remote sensing (RS) image-text retrieval plays a critical role in understanding massive RS imagery. However, the dense multi-object distribution and complex backgrounds in RS imagery make it difficult to simultaneously achieve fine-grained cross-modal alignment and efficient retrieval. Existing methods either rely on complex cross-modal interactions that lead to low retrieval efficiency, or depend on large-scale vision-language model pre-training, which requires massive data and computational resources. To address these issues, we propose a fast-then-fine (FTF) two-stage retrieval framework that decomposes retrieval into a text-agnostic recall stage for efficient candidate selection and a text-guided rerank stage for fine-grained alignment. Specifically, in the recall stage, text-agnostic coarse-grained representations are employed for efficient candidate selection; in the rerank stage, a parameter-free balanced text-guided interaction block enhances fine-grained alignment without introducing additional learnable parameters. Furthermore, an inter- and intra-modal loss is designed to jointly optimize cross-modal alignment across multi-granular representations. Extensive experiments on public benchmarks demonstrate that the FTF achieves competitive retrieval accuracy while significantly improving retrieval efficiency compared with existing methods.

cs.CV↗

arXiv2026

Explore Like Humans: Autonomous Exploration with Online SG-Memo Construction for Embodied Agents

Constructing structured spatial memory is essential for enabling long-horizon reasoning in complex embodied navigation tasks. Current memory construction predominantly relies on a decoupled, two-stage paradigm: agents first aggregate environmental data through exploration, followed by the offline reconstruction of spatial memory. However, this post-hoc and geometry-centric approach precludes agents from leveraging high-level semantic intelligence, often causing them to overlook navigationally critical landmarks (e.g., doorways and staircases) that serve as fundamental semantic anchors in human cognitive maps. To bridge this gap, we propose ABot-Explorer, a novel active exploration framework that unifies memory construction and exploration into an online, RGB-only process. At its core, ABot-Explorer leverages Large Vision-Language Models (VLMs) to distill Semantic Navigational Affordances (SNA), which act as cognitive-aligned anchors to guide the agent's movement. By dynamically integrating these SNAs into a hierarchical SG-Memo, ABot-Explorer mirrors human-like exploratory logic by prioritizing structural transit nodes to facilitate efficient coverage. To support this framework, we contribute a large-scale dataset extending InteriorGS with SNA and SG-Memo annotations. Experimental results demonstrate that ABot-Explorer significantly outperforms current state-of-the-art methods in both exploration efficiency and environment coverage, while the resulting SG-Memo is shown to effectively support diverse downstream tasks.

cs.CV↗

arXiv2026

LoopCTR: Unlocking the Loop Scaling Power for Click-Through Rate Prediction

Scaling Transformer-based click-through rate (CTR) models by stacking more parameters brings growing computational and storage overhead, creating a widening gap between scaling ambitions and the stringent industrial deployment constraints. We propose LoopCTR, which introduces a loop scaling paradigm that increases training-time computation through recursive reuse of shared model layers, decoupling computation from parameter growth. LoopCTR adopts a sandwich architecture enhanced with Hyper-Connected Residuals and Mixture-of-Experts, and employs process supervision at every loop depth to encode multi-loop benefits into the shared parameters. This enables a train-multi-loop, infer-zero-loop strategy where a single forward pass without any loop already outperforms all baselines. Experiments on three public benchmarks and one industrial dataset demonstrate state-of-the-art performance. Oracle analysis further reveals 0.02--0.04 AUC of untapped headroom, with models trained with fewer loops exhibiting higher oracle ceilings, pointing to a promising frontier for adaptive inference.

cs.IR↗

arXiv2026

IntervenSim: Intervention-Aware Social Network Simulation for Opinion Dynamics

LLM-based social network simulation introduces a new computational approach for modeling event evolution in complex online environments. However, existing methods typically simulate social processes under a fixed event trajectory, treating the event as static once initialized and overlooking intervention dynamics, and thus fail to capture the intrinsic evolution of real social network events, where source-side interventions and collective interactions continuously reshape event trajectories, sometimes leading to secondary popularity explosions and collective attitude shifts. To address this limitation, we introduce an intervention-aware simulation framework, IntervenSim, that models event evolution and intervention in a closed loop. We model event developments and source-side interventions using source agents, and collective crowd reactions using crowd agents, capturing their continuous co-evolution through an intervention-aware mechanism that couples source-side intervention, group interaction, and feedback-driven adjustment of subsequent interventions. Experiments on diverse real-world events show that IntervenSim improves MAPE by 41.6% and DTW by 66.9% over prior frameworks, while reducing computational cost with fewer yet more capable agents. These improvements indicate that IntervenSim not only simulates regular event trajectories more faithfully, but also better captures opinion dynamics under intervention in complex cases.

cs.SI↗

arXiv2026

Accelerating Edge Inference for Distributed MoE Models with Latency-Optimized Expert Placement

The emergence of Mixture-of-Experts (MoE) has transformed the scaling of large language models by enabling vast model capacity through sparse activation. Yet, converting these performance gains into practical edge deployment remains difficult, as the massive memory footprint and communication demands often overwhelm resource-limited environments. While centralized cloud-based solutions are available, they are frequently plagued by prohibitive infrastructure costs, latency issues, and privacy concerns. Moreover, existing edge-oriented optimizations largely overlook the complexities of heterogeneous hardware, focusing instead on isolated or uniform device setups. In response, this paper proposes Prism, an inference framework engineered for collaborative MoE serving across diverse GPU-equipped edge servers. By leveraging the intrinsic sparsity and input locality of MoE workloads, Prism minimizes inter-server communication and optimizes expert placement within diverse resource constraints. The framework integrates an activation-aware placement strategy that balances local request coverage with memory utilization, supplemented by a runtime migration mechanism to adapt expert distribution to dynamic workload changes. Experiments on contemporary MoE models and datasets demonstrate that Prism reduces inference latency by up to 30.6% and significantly lowers communication costs compared to state-of-the-art baselines, confirming the effectiveness of cooperative edge-based MoE serving.

cs.DC↗

arXiv2026

RepoGenesis: Benchmarking End-to-End Microservice Generation from Readme to Repository

Large language models and agents have achieved remarkable progress in code generation. However, existing benchmarks focus on isolated function/class-level generation (e.g., ClassEval) or modifications to existing codebases (e.g., SWE-Bench), neglecting complete microservice repository generation that reflects real-world 0-to-1 development workflows. To bridge this gap, we introduce RepoGenesis, the first multilingual benchmark for repository-level end-to-end web microservice generation, comprising 106 repositories (60 Python, 46 Java) across 18 domains and 11 frameworks, with 1,258 API endpoints and 2,335 test cases verified through a "review-rebuttal" quality assurance process. We evaluate open-source agents (e.g., DeepCode) and commercial IDEs (e.g., Cursor) using Pass@1, API Coverage (AC), and Deployment Success Rate (DSR). Results reveal that despite high AC (up to 73.91%) and DSR (up to 100%), the best-performing system achieves only 23.67% Pass@1 on Python and 21.45% on Java, exposing deficiencies in architectural coherence, dependency management, and cross-file consistency. Notably, GenesisAgent-8B, fine-tuned on RepoGenesis (train), achieves performance comparable to GPT-5 mini, demonstrating the quality of RepoGenesis for advancing microservice generation. We release our benchmark at https://github.com/pzy2000/RepoGenesis.

cs.SE↗

arXiv2026

Distributionally Robust Stochastic MPC under Disturbance-Affine Feedback Policies

This study addresses the stochastic Model Predictive Control (MPC) problem for linear time-invariant systems subjected to unknown disturbance distributions. By leveraging the most recent disturbance data, we construct a set of distributions with similar statistical properties contained within a Wasserstein ball, thereby accounting for the worst-case impacts on constraint satisfaction. Numerous MPC strategies, particularly tube-based approaches, have been extensively studied under the Wasserstein ambiguity set, but these methods often introduce conservatism and can limit control performance. Unlike tube-based approaches, we adopt a disturbance-affine control strategy, which introduces additional control degrees of freedom. We begin by developing the Disturbance-Affine Distributionally Robust (DA-DR) MPC framework, subsequently reformulating the control problem into a tractable quadratic programming formulation. Furthermore, we establish the recursive feasibility and stability of the proposed MPC scheme. Finally, we present comprehensive theoretical analysis and simulation results, demonstrating the superiority of the DA-DR MPC over tube-based MPC in initial feasible sets, average performance, and state variance control.

eess.SY↗

arXiv2026

Nonlinear Stochastic Model Predictive Control with Generative Uncertainty in Homogeneous Charge Compression Ignition

This work addresses the challenge of ignition timing and load control in homogeneous charge compression ignition engines operating subject to uncertainty from complex combustion dynamics and external disturbances. To handle this issue, we propose a nonlinear stochastic model predictive control approach explicitly incorporating distributional information of uncertainties. Specifically, we integrate an uncertainty model learned from empirical residual data to capture realistic probabilistic characteristics and handle the nonlinear additive uncertainty propagation within the prediction horizon based on polynomial chaos expansion. Additionally, we introduce a novel cost function based on maximum mean discrepancy, enabling direct penalization of the discrepancy between predicted and desired distributions of combustion indicators. The simulation results demonstrate that our proposed method achieves over a 28 \% reduction on combustion phasing variation and more than a 26 \% improvement in load tracking accuracy compared to traditional nonlinear and Gaussian-based predictive control strategies. These findings indicate the effectiveness of explicitly modeling uncertainty distributions and highlight the advantages of distribution-level performance index in robust combustion control.

eess.SY↗

arXiv2026

LLM Prompt Duel Optimizer: Efficient Label-Free Prompt Optimization

Large language models (LLMs) are highly sensitive to prompts, but most automatic prompt optimization (APO) methods assume access to ground-truth references (e.g., labeled validation data) that are costly to obtain. We propose the Prompt Duel Optimizer (PDO), a sample-efficient framework for label-free prompt optimization based on pairwise preference feedback from an LLM judge. PDO casts prompt selection as a dueling-bandit problem and combines (i) Double Thompson Sampling to prioritize informative comparisons under a fixed judge budget, with (ii) top-performer guided mutation to expand the candidate pool while pruning weak prompts. Experiments on BIG-bench Hard (BBH) and MS MARCO show that PDO consistently identifies stronger prompts than label-free baselines, while offering favorable quality--cost trade-offs under constrained comparison budgets.

cs.CL↗