Searcharxiv⌕ Search

arXiv subjects

Yukun Yang

Publications and source records attributed to Yukun Yang.

At least 19 recordsLinked to original sources

Near-Optimal Techniques for Distributed Entanglement Generation and Purification

We develop a purification-aware optimization framework for distributing high-fidelity entangled states over quantum networks. In repeater-based architectures, the framework jointly selects entanglement swapping, fusion or graph-state growth, and purification operations to maximize generation rate under a fidelity threshold. Different purification models can be incorporated through their fidelity-update, success-probability, and latency rules. We introduce purification-augmented generation trees and dynamic programming (DP) algorithms for entangled-pair (EP) distribution. Hypergraph-flow linear programming (LP) formulations support level-based structures and concurrent generation across multiple trees and demands. We extend the framework to GHZ states and arbitrary graph states constructed from remote EP resources, introduce graph-state construction primitives, and derive closed-form fidelity-vector updates for GHZ fusion and purification and graph-state growth and purification. We provide optimal formulations under the adopted models, discretization, and purification bounds, together with efficient DP and LP heuristics. We bound fidelity- and rate-discretization errors and establish convergence for fixed constructions under stated regularity conditions. NetSquid simulations of EP generation using our LP approach show an average 160% increase in generation rate over the compared prior approaches, with gains up to 330% in some scenarios. GHZ and graph-state simulations demonstrate the heuristics' effectiveness in balancing generation rate, output fidelity, and computational overhead.

quant-ph↗

Lossless First-Action Menus for Linear-Reward Planning

We study sequential decision making where an agent reserves a minimum menu of initial actions before multi-objective trade-offs are revealed, followed by unrestricted continuation planning once linear reward weights arrive. We prove that a menu preserves the unrestricted optimal return across all linear scalarizations if and only if its reachable continuations cover all vertices of the full feature polytope. This geometric equivalence yields an output-sensitive algorithm that is fixed-parameter tractable in the vertex count, combining scalar backward induction with oracle-based facet identification. On explicitly layered graphs with unit feature increments, menu verification is coNP-complete and synthesis is complete for the second existential level of the polynomial hierarchy, even under additive loss strictly below one. In fixed dimensions two and higher, verification is polynomial whereas synthesis remains NP-complete, while one-dimensional instances admit polynomial-time solutions.

cs.AI↗

Choosing What to Observe: Higher-Order Obstructions in Horn Abduction

An explanation may exist in every complete context yet be impossible to select from the information observed. We study this distinction in finite propositional Horn abduction with integrity constraints. Observations are sufficient when each report admits one hypothesis set that is consistent and entails the manifestation in every compatible context. We characterize sufficiency by minimal context families with no common explanation. Their variable spans form a canonical hypergraph whose transversals are exactly the sufficient observation sets. The characterization recovers classical discernibility for unique explanations and supports composition across independent components. Minimal obstructions have unbounded cardinality even for acyclic rules, while rectangular explanation families admit a tight bound given by their largest choice domain. With circuit-defined contexts, sufficiency is $Π_3^P$-complete and selecting at most $k$ observable variables is $Σ_4^P$-complete, already for unrestricted contexts and acyclic rules. The selection reduction makes observation choices enforce globally fixed existential commitments. Explicit contexts reduce both tasks to NP-complete problems; tabulated explanation families make sufficiency polynomial. These results connect explanatory choice, information requirements, and representation cost.

cs.LO↗

Minimum-Cost Robust Evidence Certificates for Horn Reasoning under Correlated Source Failures

A small justification for a rule-based conclusion may disappear when a source is withdrawn, and multiple derivations need not provide independent evidence. We study minimum-cost certificates that preserve a Horn conclusion under every withdrawal of at most k source domains. Evidence records remain distinct from asserted facts, supporting replicated attestations and overlapping failure dependencies. Transversals of minimal-support footprints characterize robustness and explain why disjoint-proof requirements can reject valid certificates. An exact procedure alternates weighted evidence selection with a source-failure oracle. A rule-closed counterinterpretation yields a globally valid selection cut without enumerating supports or failure scenarios. We prove correctness, finite termination, and cost optimality, establish coNP-completeness of unrestricted verification and NP-completeness of synthesis for every fixed budget, and identify a tractable reachability restriction. Experiments on controlled benchmarks, reachability graphs, and ontology-derived instances demonstrate that our counterinterpretation-guided synthesis achieves up to 92% optimum coverage within practical resource bounds, outperforming scenario expansion and general abduction while confirming the necessity of transversal-based reasoning over proof-packing heuristics.

cs.AI↗

Distributing Quantum Circuits Using Pre-Distributed Entanglement Pairs over Quantum Networks

Distributing quantum circuits across a network of quantum devices is a recent approach to improve the scalability of quantum computation. Entangled pairs of qubits distributed across network nodes are used as a communication resource for executing inter-node (remote) gates. However, establishing these entanglement pairs incurs significant latency, and doing so during the circuit's execution may lead to the decoherence of logical qubits. Instead, it may be beneficial to distribute certain entanglement pairs before the circuit is executed. Thus, we consider the problem of distributing a quantum circuit across a quantum network containing some pre-distributed entanglement pairs and seek to minimize the execution time of the circuit. We address this problem in three steps. First, given the quantum network and (optionally) a probability distribution over training circuits, we determine a set of pre-distributed entanglement pairs under a specified budget. Second, we compute a qubit-to-memory allocation that minimizes the expected execution time given these pre-distributed resources. Finally, we identify any additional entanglement pairs required during execution, generate them concurrently, and execute the circuit gates. We evaluate our methods on a broad range of benchmark circuits.

cs.ET↗

Online Scheduling and Distribution of Quantum Circuits over Quantum Networks

Emerging quantum networks enable distributed quantum computing (DQC) by interconnecting modest, noisy quantum processors. However, practical deployments face tight memory budgets, probabilistic entanglement generation, and decoherence, all while serving multiple users. In realistic settings -- cloud execution, iterative/interactive workloads and concurrent jobs -- circuits do not arrive in a single batch but as a stream. This creates a fundamentally online problem: the system must react to stochastic arrivals, balance latency and throughput, and remain stable under varying loads without foresight of future jobs. We study Online Scheduling and Distribution of Quantum Circuits (OS-DQC) and formalize the online scheduling problem for quantum networks: circuits arrive over time and must be executed without knowledge of future arrivals. At each event time (arrival or completion), the system decides which waiting circuits to launch and how to place their qubits, while accounting for congestion from in-flight circuits and constraints due to finite memories and decoherence. The objective is to minimize the mean completion time and makespan under these physical and resource constraints.

cs.ET↗

Twin reflections from a moving space-time boundary

An interluminal interface, a space-time boundary propagating at a velocity between the group velocities of the surrounding media, enables extraordinary wave phenomena such as nonreciprocal amplification and analogues of Hawking radiation. A particularly intriguing prediction is that such an interface splits an incident wave into three outgoing waves: one transmitted and two reflected. Yet, despite decades of theoretical study, this triple-wave scattering has remained experimentally unobserved, owing to stringent requirements on interface velocity and modulation speed. Here, we introduce a programmable spatiotemporal microstrip transmission-line platform that realizes step-modulated interluminal interfaces with controlled velocity. Using this system, we report the direct observation of bi-reflection from an interluminal interface, confirming the emergence of two distinct reflected waves alongside a transmitted one. Measured frequencies and scattering coefficients show excellent agreement with longstanding theoretical predictions. Furthermore, we reveal that the two reflections possess fundamentally different causal symmetries: one is spatially inverted, while the other is time-reversed. These findings resolve a half-century-old puzzle in moving-boundary electrodynamics and establish a versatile experimental platform for studying wave interaction with dynamic interfaces. Our work opens pathways to velocity-independent scattering devices, broadband frequency conversion, and advanced spatiotemporal wave engineering.

physics.optics↗

MultEval: Supporting Collaborative Alignment for LLM-as-a-Judge Evaluation Criteria

LLM-as-a-judge approaches have emerged as a scalable solution for evaluating model behaviors, yet they rely on evaluation criteria often created by a single individual, embedding that person's assumptions, priorities, and interpretive lens. In practice, defining such criteria is a collaborative and contested process involving multiple stakeholders with different values, interpretations, and priorities; an aspect largely unsupported by existing tools. To examine this problem in depth, we present a formative study examining how stakeholders collaboratively create, negotiate, and refine evaluation criteria for LLM-as-a-judge systems. Our findings reveal challenges in human oversight, including difficulties in establishing shared understanding, aligning values across stakeholders with different expertise and priorities, and translating nuanced human judgments into criteria that are interpretable and actionable for LLM judges. Based on these insights, we developed MultEval, a system that supports collaborative criteria by enabling multiple evaluators to surface and diagnose disagreements using consensus-building theory, iteratively revise criteria with attached examples and proposal history, and maintain transparency over how judgments are encoded into an automated evaluator. We further report a case study in which a team of domain experts used MultEval to collaboratively author criteria, illustrating how coordination and collaborative consensus-making shape criteria evolution.

cs.HC↗

Within the MDT Room: Situated in Multidisciplinary Team-Grounded Agent Debate for Clinical Diagnosis

Rare disease diagnosis is inherently challenging due to heterogeneous symptoms, limited clinical familiarity, and fragmented evidence across specialties. Recent large language model (LLM)-based agentic systems have shown promise by simulating multidisciplinary team discussions to generate and evaluate diagnostic hypotheses. However, fully automated diagnosis remains unrealistic, and existing human-in-the-loop approaches provide limited support for effective clinician-agent collaboration. In practice, clinicians are often presented with final diagnostic outputs and lengthy, unstructured agent discussion logs, making it difficult to inspect reasoning, intervene in a timely manner, or guide agent deliberation effectively. To address these challenges, we developed MDTRoom, an interactive system that transforms multi-agent discussions from linear transcripts into a structured, inspectable workspace. The system externalizes patient data, evidence provenance, hypothesis evolution, and inter-agent conflicts as interconnected visual objects, enabling clinicians to efficiently examine, intervene in, and guide agent reasoning. Our evaluation demonstrates the effectiveness of MDTRoom in supporting clinician-agent collaboration.

cs.HC↗

Radiative Association of Ag and H: Formation of AgH from Ab Initio Calculations

Radiative association processes leading to the formation of AgH in cold astrophysical environments are investigated for the first time using full quantum scattering theory. High accuracy potential energy curves and transition dipole moments for the low-lying electronic states (X$^1Σ^+$, A$^1Σ^+$, $1^1Π$, $3^1Σ^+$, $2^1Π$) are computed employing the internally contracted multireference configuration interaction method with Davidson correction. Vibrationally and rotationally resolved radiative association cross sections are calculated for transitions from these initial states to the ground X$^1Σ^+$ state. Prominent shape resonances arising from quasi-bound rovibrational levels behind centrifugal barriers are identified, with the $2^1Π\to$ X$^1Σ^+$ channel exhibiting the strongest contribution at low collision energies. Stimulated radiative association under blackbody radiation fields (up to $T = 20\,000$ K) produces modest enhancements, predominantly in the ground-state channel. Thermal rate coefficients computed over 10$^{-1}$--$10^4$~K reveal a general decreasing trend with temperature for all channels. The results provide essential kinetic data for astrochemical models of transition-metal hydride formation in low-temperature interstellar and circumstellar environments.

physics.atom-ph↗

DiLLS: Interactive Diagnosis of LLM-based Multi-agent Systems via Layered Summary of Agent Behaviors

Large language model (LLM)-based multi-agent systems have demonstrated impressive capabilities in handling complex tasks. However, the complexity of agentic behaviors makes these systems difficult to understand. When failures occur, developers often struggle to identify root causes and to determine actionable paths for improvement. Traditional methods that rely on inspecting raw log records are inefficient, given both the large volume and complexity of data. To address this challenge, we propose a framework and an interactive system, DiLLS, designed to reveal and structure the behaviors of multi-agent systems. The key idea is to organize information across three levels of query completion: activities, actions, and operations. By probing the multi-agent system through natural language, DiLLS derives and organizes information about planning and execution into a structured, multi-layered summary. Through a user study, we show that DiLLS significantly improves developers' effectiveness and efficiency in identifying, diagnosing, and understanding failures in LLM-based multi-agent systems.

cs.HC↗

The Behavioral Fabric of LLM-Powered GUI Agents: Human Values and Interaction Outcomes

Large Language Model (LLM)-powered web GUI agents are increasingly automating everyday online tasks. Despite their popularity, little is known about how users' preferences and values impact agents' reasoning and behavior. In this work, we investigate how both explicit and implicit user preferences, as well as the underlying user values, influence agent decision-making and action trajectories. We built a controlled testbed of 14 common interactive web tasks, spanning shopping, travel, dining, and housing, each replicated from real websites and integrated with a low-fidelity LLM-based recommender system. We injected 12 human preferences and values as personas into four state-of-the-art agents and systematically analyzed their task behaviors. Our results show that preference and value-infused prompts consistently guided agents toward outcomes that reflected these preferences and values. While the absence of user preference or value guidance led agents to exhibit a strong efficiency bias and employ shortest-path strategies, their presence steered agents' behavior trajectories through the greater use of corresponding filters and interactive web features. Despite their influence, dominant interface cues, such as discounts and advertisements, frequently overrode these effects, shortening the agents' action trajectories and inducing rationalizations that masked rather than reflected value-consistent reasoning. The contributions of this paper are twofold: (1) an open-source testbed for studying the influence of values in agent behaviors, and (2) an empirical investigation of how user preferences and values shape web agent behaviors.

cs.HC↗

LMILAtt: A Deep Learning Model for Depression Detection from Social Media Users Enhanced by Multi-Instance Learning Based on Attention Mechanism

Depression is a major global public health challenge and its early identification is crucial. Social media data provides a new perspective for depression detection, but existing methods face limitations such as insufficient accuracy, insufficient utilization of time series features, and high annotation costs. To this end, this study proposes the LMILAtt model, which innovatively integrates Long Short-Term Memory autoencoders and attention mechanisms: firstly, the temporal dynamic features of user tweets (such as depressive tendency evolution patterns) are extracted through unsupervised LSTM autoencoders. Secondly, the attention mechanism is used to dynamically weight key texts (such as early depression signals) and construct a multi-example learning architecture to improve the accuracy of user-level detection. Finally, the performance was verified on the WU3D dataset labeled by professional medicine. Experiments show that the model is significantly better than the baseline model in terms of accuracy, recall and F1 score. In addition, the weakly supervised learning strategy significantly reduces the cost of labeling and provides an efficient solution for large-scale social media depression screening.

cs.AI↗

An Automated Deep Segmentation and Spatial-Statistics Approach for Post-Blast Rock Fragmentation Assessment

We introduce an end-to-end pipeline that leverages a fine-tuned YOLO12l-seg model -- trained on over 500 annotated post-blast images -- to deliver real-time instance segmentation (Box mAP@0.5 ~ 0.769, Mask mAP@0.5 ~ 0.800 at ~ 15 FPS). High-fidelity masks are converted into normalized 3D coordinates, from which we extract multi-metric spatial descriptors: principal component directions, kernel density hotspots, size-depth regression, and Delaunay edge statistics. We present four representative examples to illustrate key fragmentation patterns. Experimental results confirm the framework's accuracy, robustness to small-object crowding, and feasibility for rapid, automated blast-effect assessment in field conditions.

cs.CV↗

L0: Reinforcement Learning to Become General Agents

Training large language models (LLMs) to act as autonomous agents for multi-turn, long-horizon tasks remains significant challenges in scalability and training efficiency. To address this, we introduce L-Zero (L0), a scalable, end-to-end training pipeline for general-purpose agents. Featuring a low-cost, extensible, and sandboxed concurrent agent worker pool, L0 lowers the barrier for applying reinforcement learning in complex environments. We also introduce NB-Agent, the agent scaffold within L0, which operates in a "code-as-action" fashion via a Read-Eval-Print-Loop (REPL). We evaluate L0 on factuality question-answering benchmarks. Our experiments demonstrate that a base model can develop robust problem-solving skills using solely Reinforcement Learning with Verifiable Rewards (RLVR). On the Qwen2.5-7B-Instruct model, our method boosts accuracy on SimpleQA from 30 % to 80 % and on HotpotQA from 22 % to 41 %. We have open-sourced the entire L0 system, including our L0 series models, the NB-Agent, a complete training pipeline, and the corresponding training recipes on (https://github.com/cmriat/l0).

cs.CL↗

The Tenth NTIRE 2025 Efficient Super-Resolution Challenge Report

This paper presents a comprehensive review of the NTIRE 2025 Challenge on Single-Image Efficient Super-Resolution (ESR). The challenge aimed to advance the development of deep models that optimize key computational metrics, i.e., runtime, parameters, and FLOPs, while achieving a PSNR of at least 26.90 dB on the $\operatorname{DIV2K\_LSDIR\_valid}$ dataset and 26.99 dB on the $\operatorname{DIV2K\_LSDIR\_test}$ dataset. A robust participation saw \textbf{244} registered entrants, with \textbf{43} teams submitting valid entries. This report meticulously analyzes these methods and results, emphasizing groundbreaking advancements in state-of-the-art single-image ESR techniques. The analysis highlights innovative approaches and establishes benchmarks for future research in the field.

cs.CV↗

Supporting Co-Adaptive Machine Teaching through Human Concept Learning and Cognitive Theories

An important challenge in interactive machine learning, particularly in subjective or ambiguous domains, is fostering bi-directional alignment between humans and models. Users teach models their concept definition through data labeling, while refining their own understandings throughout the process. To facilitate this, we introduce MOCHA, an interactive machine learning tool informed by two theories of human concept learning and cognition. First, it utilizes a neuro-symbolic pipeline to support Variation Theory-based counterfactual data generation. By asking users to annotate counterexamples that are syntactically and semantically similar to already-annotated data but predicted to have different labels, the system can learn more effectively while helping users understand the model and reflect on their own label definitions. Second, MOCHA uses Structural Alignment Theory to present groups of counterexamples, helping users comprehend alignable differences between data items and annotate them in batch. We validated MOCHA's effectiveness and usability through a lab study with 18 participants.

cs.HC↗

Topologically protected edge states in time photonic crystals with chiral symmetry

Time photonic crystals are media in which their electromagnetic parameters are modulated periodically in time, showing promising applications in non-resonant lasers and particle accelerators, among others. Traditionally utilized to study space photonic crystals, topological band theory has also been translated recently to analyze time photonic crystals with time inversion symmetry, enabling the construction of the temporal version of topological edge states. However, temporal disorder can readily break time inversion symmetry in practice, hence likely destroying the edge states associated with this type of time photonic crystals. To overcome this limitation, here we propose a new class of time photonic crystals presenting chiral symmetry instead, whose edge states exhibit superior robustness over the time-reversal-symmetry-protected counterparts. Our time photonic crystal is equivalent to a temporal version of the Su-Schrieffer-Heeger model, and the chiral symmetry of this type of time photonic crystals quantizes the winding number defined in the Bloch frequency band. Remarkably, random temporal disorders do not impact the eigenfrequencies of these chiral-symmetry-protected edge states, while instead enhancing their temporal localizations. Our findings thus provide a promising paradigm to control field amplification with exceptional robustness as well as being a feasible platform to investigate various topological phases in time-varying media.

physics.optics↗