Searcharxiv⌕ Search

arXiv subjects

Min Chen

Publications and source records attributed to Min Chen.

At least 37 records · Page 2Linked to original sources

Towards Disentangled Preference Optimization Dynamics: Suppress the Loser, Preserve the Winner

Preference optimization is widely used to align large language models (LLMs) with human preferences. However, many margin-based methods also suppress the chosen response when they try to suppress the rejected one, and there is no general way to prevent this across different objectives. We address this issue with a unified incentive-score decomposition of preference optimization, revealing that different objectives share the same local update directions and differ only in their scalar weights. This decomposition provides a common framework for analyzing objectives that were previously studied in separate settings. Building on this decomposition, by analyzing the dynamics of the chosen/rejected likelihoods, we identify the disentanglement band (DB), a simple, testable condition that tells us when training can follow the desired path: suppress the loser while preserving the winner, possibly after an early stage. Using the DB, we propose reward calibration (RC), a plug-and-play method that adaptively rebalances the updates for chosen and rejected responses to satisfy the DB, without redesigning the base objective. Empirical results show that RC leads to more disentangled dynamics, with better downstream performance observed across several settings. Our code is available at https://github.com/IceyWuu/DisentangledPreferenceOptimization.

cs.LG↗

Beyond Entropy: Correctness-Aware Advantage Shaping via Contrastive Policy Optimization

Reinforcement learning with verifiable rewards (RLVR) commonly uses entropy for advantage shaping. However, entropy cannot distinguish useful uncertainty from detrimental confusion, limiting its effectiveness as a correctness signal. We propose Contrastive Policy Optimization (CPO), which uses token-level contrastive disagreement between reference-guided and vanilla generation distributions for correctness-aware advantage shaping. Both theoretical and empirical results show that this disagreement reliably indicates token-level correctness. We further show that On-policy Distillation is a special case of CPO, where the posterior distribution is instantiated by an external teacher model. CPO also resolves the zero-advantage problem. Experiments on in-domain and out-of-domain benchmarks demonstrate that CPO substantially outperforms entropy-based RLVR methods while maintaining strong generalization. Further analysis shows that correct and incorrect responses naturally support exploration and exploitation respectively, and balancing both leads to the best performance.

cs.LG↗

A re-entrant chip-free-space photonic interface for telecom-to-Rubidium spectroscopy

Photonic integrated circuits (PICs) generate, route, and process light with high efficiency, scalability, and functional density on a single chip. Yet the tightly confined on-chip modes can not easily access or effectively interact with atomic vapors, fluids, gain media, and biological samples. Existing approaches require bringing the medium onto the chip or into a weak, tightly confined evanescent field, which restricts the interaction volume and the range of accessible media. Here, we demonstrate a re-entrant chip-free-space interface in which a thin-film lithium niobate circuit frequency-doubles telecom light, emits the 780~nm field through a Rubidium vapor cell, and recollects the reflected probe on the same chip. This emit-interact-recollect loop resolves the saturated absorption spectrum and stabilizes the telecom laser to within $\pm 280$~kHz over 2 hours. Our study paves an route to embed external media into PICs through the re-entrant photonic interface.

physics.optics↗

Photorefractive-based on-chip optical power limiter against light-injection attacks in quantum key distribution

Light-injection attacks pose critical security threats to quantum key distribution (QKD) systems. Conventional countermeasures, such as isolators, filters, and optical power monitoring, suffer from limited on-chip compatibility and inherent security vulnerabilities. To overcome these limitations, we propose and experimentally demonstrate an integrated attack sensing and automatic response unit utilizing the photorefractive effect in a thin-film lithium niobate microring resonator. The unit provides a rejection ratio exceeding 25 dB against non-resonant injected light. Under resonant attacks with power levels above tens of microwatts, the unit autonomously attenuates the signal transmission, with 14 dB attenuation measured at the maximum tested attack power of 10 dBm, leading to a significant suppression of the secure key rate. We further verify its response to pulsed light injection and incorporate possible residual leakage associated with finite response time into the key-rate analysis. This work provides a highly sensitive, broadband, and fully on-chip defense mechanism that significantly enhances the physical-layer security of QKD systems against light-injection attacks.

quant-ph↗

Plasma-state metasurfaces for ultra-intensive field manipulation

High-power lasers offer ultrahigh intensities for plasma interactions, but they lack advanced techniques to control the properties of the fields, because no optical elements could withstand their high intensities. The vibrant field of metasurfaces has transformed modern optics by enabling unprecedented control over light at subwavelength through deliberate design. However, metasurfaces have traditionally been limited to solid-state materials and low light intensities. Extending the sophisticated capabilities of metasurfaces from solids into the plasma realm would open new horizons for high-field science. Here, we experimentally demonstrate plasma-state metasurfaces (PSMs) through the photonic spin Hall effect and stable-propagating vortex beam generation irradiated by intense light. Time-resolved pump-probe measurements reveal that the functionality of PSMs can persist for several picoseconds, making them suitable for controlling ultra-intense femtosecond lasers, even in state-of-the-art multi-petawatt systems. Harnessing the powerful toolkit of metasurfaces, this approach holds the promise to revolutionize our ability to manipulate the amplitude, phase, polarization, and wavefront of high-power lasers during their pulse duration. It also opens new possibilities for innovative applications in laser-plasma interactions such as compact particle acceleration and novel radiation sources.

physics.plasm-ph↗

When AI meets quantum information: A comprehensive review

Artificial intelligence (AI) and quantum information (QI) are rapidly co-evolving. AI is becoming a practical tool for learning, designing, controlling, and verifying quantum systems, while QI offers new computational models, representational structures, and learning-theoretic questions for AI. This survey reviews the interface from both directions. In the AI for QI direction, we organize recent progress around the central tasks of extracting information from limited measurements, training and discovering quantum algorithms, stabilizing noisy hardware, automating experimental and programming workflows, and extending learning-based methods to sensing and networking. In the QI for AI direction, we examine how quantum computation and quantum-inspired structures affect learning through algorithmic speedups, expressivity, trainability, generalization, neural-network design, and tensor-network representations. We close by identifying cross-cutting challenges in reproducibility, scalability, hardware realism, and co-design, arguing that progress will depend on tighter integration of theory, experiment, and hybrid quantum--classical systems.

quant-ph↗

Understanding How Humans Inject Knowledge into Machine Learning Workflows through Visual Analytics

Visual analytics (VA) plays an increasingly important role in supporting machine learning (ML) workflows. In the field of visualization, such approaches and techniques are referred to as VIS4ML. While ML models are mostly learned automatically, the corresponding ML workflows receive a variety of human inputs, such as data labelling, feature engineering, model architecture designing, hyper-parameter tuning, and so on. In this work, we surveyed over 200 VIS4ML papers to gain an understanding of how humans inject their knowledge into ML workflows through interactive visualization. We collected a corpus of VIS4ML papers from the IEEE VIS conferences in the past decade. We developed a coding scheme to facilitate the literature research from four perspectives: characteristics of ML, visualization, interaction, and actions. The analysis of the coded dataset allows us to observe different pathways that transfer human knowledge to ML workflows via interactive visualization. Building on the analysis, we explain the phenomena of VIS4ML using the conceptual model that views VA as model building and the information-theoretic cost-benefit analysis that reasons VA as for optimizing ML workflows. This work provides unequivocal evidence showing the merits of using VA in ML workflows. The full list of surveyed papers, along with all analysis results and figures, is available at https://vis4ml4hd.github.io/ml-knowledge-inject-va/.

cs.HC↗

Optimizing Visual Analytics Workflows: From Theory to Practice

The principle of visual analytics (VA) is to provide integrated workflows where human-centric processes (e.g., visualization and interaction) and machine-centric processes (e.g., statistics and algorithms) complement each other. To implement this principle in practice, it is necessary to reason about the trade-offs among different processes and make optimal use of them in a workflow. Building on an existing ontology of the methodology for analyzing such trade-offs information-theoretically and for optimizing VA workflows systematically, we investigate ways to transform this methodology from theory to practice. In particular, we adopted the action research method. Through case studies in different application domains, VA researchers with different background knowledge and experiences offered their answers to several hypotheses about using the methodology in practice and proposed ways forward. In this paper, we present our collective analysis, the strengths and feasibility of this theory-based methodology, as well as the obstacles to its broad deployment in practice. To address these challenges, we outline a roadmap to remove such obstacles.

cs.HC↗

A Multiplexing Design Space: Theory, Method, and Application

Many visualization designs feature phenomena referred to as ``visual multiplexing'', where multiple pieces of information associated with the same data point are conveyed simultaneously. Although visualization designers are able to bring such phenomena, often unconsciously, into their designs, the design space of visual multiplexing is huge, and it is uncommon to explore visual multiplexing systematically as design patterns. In this paper, we propose a design method for exploring a smaller design space constrained by an application. As an illustrative case study, we focus on machine learning (ML) workflows for developing ML models that approximate partial differential equations (PDEs). In these workflows, ML researchers need to analyze the inter-relationships among multiple 2D scalar fields frequently. Since superimposing one heatmap on top of another is not an effective design, we formulate three design steps to explore the design space of visual multiplexing in the context of multiple 2D scalar fields. Our design method also includes a pre-design step for domain grounding and theoretical analysis, and involves domain experts in both co-design and evaluation activities. The design process enables us to identify relatively optimal default multiplexing designs as well as the need for small variations that domain experts can control through a user interface.

cs.HC↗

MBench: A Comprehensive Benchmark on Memory Capability for Video World Models

Recent advancements in video-based world models have demonstrated an unprecedented ability to synthesize high-fidelity visual sequences. However, a fundamental gap persists between visually plausible video generation and the functional requirements of a world model, particularly in maintaining a stable and reasonable internal state over extended temporal horizons. While existing benchmarks primarily emphasize visual quality, motion coherence, and text-video alignment, they largely overlook memory, the core capability of a world model to preserve consistency across long-term horizons and complex interactions. To address this gap, we present \textbf{MBench}, a comprehensive benchmark dedicated to quantifying and evaluating the memory capability of video world models. We systematically decompose the memory capability of video world models into three hierarchical and complementary core dimensions: entity consistency, environment consistency, and causal consistency, which are further refined into 12 quantifiable sub-dimensions for comprehensive characterization of long-term memory. Our benchmark is built upon rigorously curated real-captured long videos, and evaluated by rule-based quantitative matrices and VLM to enable objective and comprehensive consistency assessment. Extensive evaluations of mainstream state-of-the-art video world models reveal critical systemic limitations of existing methods in long-term state retention, providing a standardized benchmark and clear research direction to advance the field.

cs.CV↗

Vacuum-Triggered Instability in Paired Superradiance

Paired superradiance (PSR) is a macro-coherent two-photon process capable of very large gain, making it promising for detecting ultra-weak signals induced by neutrinos or dark matter. A major goal has been to increase the system volume $V$ and density $n$, since the signal intensity scales as $(nV)^2$. We recast finite PSR as a parametric amplifier driven by the electromagnetic vacuum. The usual zero-field semiclassical initial condition is replaced by vacuum inputs fixed by the quantum two-point function. Combining this formulation with Maxwell--Bloch evolution and finite-length stability analysis, we find that PSR produces an irreducible vacuum background that can develop into macroscopic bursts once the gain-length product exceeds \(ΓL=π/2\) for a sufficient coherence time. These results, together with a closed-form formula for estimating the vacuum-seeded photon yield, establish a previously overlooked constraint for high-gain PSR, with direct implications for proposed neutrino and dark-matter studies.

physics.optics↗

Quantum Machine Learning-based 6G edge Network: Enabling Adaptive Communication and Model Aggregation

With the advent of sixth-generation (6G) mobile communication technology, vehicle-to-everything (V2X) communication faces unprecedented challenges in communication efficiency, system generalization capabilities, and model collaboration. Conventional machine learning struggles with high-dimensional state spaces, slow convergence, and poor generalization under heterogeneous V2X nodes, rapidly varying channels, and multimodal sensing data in V2X systems. To address these issues, we propose a quantum-enhanced framework for V2X communication and model aggregation that targets efficient, robust, and intelligent transportation in 6G, which includes four modules: the channel-adaptive semantic communication module, the multimodal fusion module, the model transfer module, and the federated aggregation module. Specifically, the channel-adaptive semantic communication module leverages quantum convolutional neural networks (CNN) and quantum distortion metrics to enable efficient transmission and strong generalization across diverse conditions. The multimodal fusion module exploits quantum attention and entanglement to compress features and associate semantics across heterogeneous data. The model transfer module employs quantum reinforcement learning to model decision-making and improve adaptability in dynamic environments. The federated aggregation module integrates quantum tensor decomposition with backpropagation-based corrections to provide privacy preservation with low overhead and to strengthen global model robustness. This work outlines a new paradigm for communication and model collaboration in future 6G intelligent transportation.

quant-ph↗

SatSurfGS: Generalizable 2D Gaussian Splatting for Sparse-View Satellite Surface Reconstruction

Sparse-view satellite image surface reconstruction remains highly challenging, fundamentally because the reliability of multi-view matching under satellite imaging conditions is strongly spatially heterogeneous. Affected by large photometric differences, weak textures, and repetitive textures, multi-view geometric constraints are often sparse, unevenly distributed, and locally unreliable. Although 2D Gaussian Splatting (2DGS) is more suitable than 3D Gaussian Splatting (3DGS) for the explicit representation of continuous surfaces, research on generalizable feed-forward 2DGS frameworks for sparse-view satellite surface reconstruction is still lacking. To address this issue, we propose SatSurfGS, a generalizable sparse-view surface reconstruction method for satellite imagery based on 2DGS. The proposed method builds a coarse-to-fine Gaussian attribute prediction framework and explicitly models local geometric reliability at three levels: feature learning, Gaussian parameter estimation, and training optimization. Specifically, we propose a confidence-aware monocular multi-view feature fusion module to adaptively integrate monocular priors and multi-view matching features according to local confidence; a cross-stage self-consistency residual guidance module to stabilize stage-wise Gaussian parameter refinement using the residual between the rendered height map from the previous stage and the current-stage MVS height map, together with confidence information; and a confidence bidirectional routing loss to achieve differentiated allocation of geometric and appearance supervision. Experiments on satellite datasets show that the proposed method achieves improved rendering quality, surface reconstruction accuracy, cross-dataset generalization, and inference efficiency compared with representative generalizable baselines and competitive per-scene optimization methods.

cs.CV↗

PIIGuard: Mitigating PII Harvesting under Adversarial Sanitization

Browsing-enabled LLM assistants can fetch webpages and answer contact-seeking queries, creating a practical channel for scraping contact-style personally identifiable information (PII) from public pages. Many prior defenses are deployed at the model, service, or agent layer rather than at the webpage itself, leaving ordinary page owners with limited deployable options. We present PIIGuard, a webpage-level defense that repurposes indirect prompt injection as a protective mechanism: the page owner embeds optimized hidden HTML fragments that steer the model away from verbatim or reconstructible disclosure of contact PII. PIIGuard searches over fragment text and insertion position using rule-based leakage scoring, evolutionary mutation, and final judge-based recoverability assessment. In direct-HTML evaluation on three target models (GPT-5.4-nano, Claude-haiku-4.5, and DeepSeek-chat(latest v3.2)), PIIGuard achieves at least 97.0% defense success rate under both rule-based and judge-based leakage evaluation, often reaching 100.0%, while preserving benign same-page QA utility. We further evaluate two harder settings: public-URL browsing and attacker-side LLM sanitization of fetched webpage. These results show that page-side defensive fragments can remain effective in deployment for some model-position pairs, but robustness varies substantially across browsing interfaces and sanitizer prompts. Overall, PIIGuard demonstrates that page owners can use page-side fragments as a practical mitigation for web-grounded PII leakage.

cs.CR↗

Acceleration of Ultrahigh Energy Particles from Fast Radio Bursts

Two extreme events in the universe, fast radio bursts (FRBs) and cosmic rays (CRs), could be correlated, where FRBs with extreme field strength near their sources may contribute to CRs. This study investigates localized particle acceleration driven by FRB-like ultra-relativistic electromagnetic pulses in an electron--positron--ion plasma system. It is found ultra-high energy neutral plasma sheets form constantly via the front erosion of an FRB pulse. There are two regimes of ion acceleration depending upon the field strength and the plasma density: the piston regime driven by the Lorentz force of the pulse, and the wakefield regime dominated by charge separation field. The predicted energy scalings align well with particle-in-cell simulations. A power-law energy spectrum with an index close to the CRs naturally emerges during FRBs expansion outward. Detecting high-energy particles possibly produced by FRBs enables deeper insights into their origins and promotes the development of multi-messenger astronomy.

astro-ph.HE↗

Lightweight Quantum Agent for Edge Systems: Joint PQC and NOMA Resource Allocation

In the context of quantum secure scenarios, existing research on mobile edge devices and intelligent computing and edge (ICE) systems based on the Non-Orthogonal Multiple Access (NOMA) communication model have overlooked the energy consumption overhead of Post-Quantum Cryptography (PQC) modules, and the high complexity of traditional resource allocation algorithms fails to meet the demands of real-time decision-making. To address these challenges, this paper proposes a lightweight agentic AI framework designed for online joint optimization within ICE-enabled mobile devices. The scheme constructs a multi-stage stochastic Mixed Integer Nonlinear Programming (MINLP) model that incorporates static power-consumption constraints for PQC modules. Based on Lyapunov optimization theory, the long-term optimization problem is decoupled, and a linear complexity algorithm is proposed to solve the nonconvex challenges of NOMA power allocation . Simulation results verify that the proposed scheme significantly improves computational throughput while ensuring system queue stability and energy consumption constraints. Compared with traditional Successive Convex Approximation (SCA) algorithms, the complexity is reduced to $\mathcal{O}(N)$, achieving a speedup of approximately 46 times when the number of devices $N=35$, thereby meeting the real-time decision-making requirements in dynamic wireless environments.

cs.IT↗

Electrical tunability of terahertz nonlinearity in graphene

Graphene is conceivably the most nonlinear optoelectronic material. Its nonlinear optical coefficients in the terahertz (THz) frequency range surpass those of other materials by many orders of magnitude. This, in particular, allows one to use graphene for extremely efficient up-conversion of sub-THz electronic input signals into the THz frequency range at room temperature and under ambient conditions, thus paving the way for practical graphene-based ultrahigh-frequency electronic technology. Here, we show that the THz nonlinearity of graphene can be efficiently controlled using electrical gating, with gating voltages as low as a few volts. For example, optimal electrical gating enhances the power conversion efficiency in THz third-harmonic generation in graphene by about two orders of magnitude. This essentially converts graphene from an almost perfectly linear, inert electronic material to a material with the highest possible THz nonlinearity. We demonstrate gating control of THz nonlinearity of graphene for both ultrashort single-cycle and quasi-monochromatic multi-cycle input signals. Our experimental results are in quantitative agreement with a physical model of graphene nonlinearity, describing the time-dependent thermodynamic balance maintained within the electronic population of graphene during interaction with ultrafast electric fields. Our results can serve as a basis for straightforward and accurate design of devices and applications for efficient electronic signal processing in graphene at ultra-high frequencies.

cond-mat.mes-hall↗

StoryMI: Steerable Multi-Agent Therapeutic Dialogue Generation

Large language models (LLMs) can generate fluent dialogue, but prior works lack situational grounding, dynamic strategy control, and evaluation aligned with clinical standards in motivational interviewing (MI). We introduce StoryMI, a multi-LLM agent framework for controllable MI dialogue generation, where questionnaire-based client profiles are expanded into situational stories that provide narrative context for the dialogue. Therapist and client agents generate MI-coded utterances guided by MI codes selected by the interaction agent, while an interaction agent dynamically coordinates exchanges to control MI strategies during a multi-turn conversation. We propose a two-level evaluation protocol: lexical metrics and MI-specific measures of macro-level counseling strategies, alongside LLM-as-judge and human expert assessments. We construct a dataset of 6K simulated MI dialogues grounded in 1K questionnaire-story pairs, covering 12 MI codes and 13 symptom domains, and benchmark six open- and closed-source LLMs. Our results show that situational grounding and macro-level control can improve MI adherence and clinical plausibility, demonstrating the effectiveness of a structured multi-agent workflow for psychotherapy dialogue generation. We provide code and data for reproducibility.

cs.CL↗