Searcharxiv⌕ Search

arXiv subjects

Yu Wang

Publications and source records attributed to Yu Wang.

At least 181 records · Page 10Linked to original sources

WoVR: World Models as Reliable Simulators for Post-Training VLA Policies with RL

Reinforcement learning (RL) promises to unlock capabilities beyond imitation learning for Vision--Language--Action (VLA) models, but its requirement for massive real-world interaction prevents direct deployment on physical robots. Recent work attempts to use learned world models as simulators for policy optimization, yet closed-loop imagined rollouts inevitably suffer from hallucination and long-horizon error accumulation. Such errors not only degrade visual fidelity, but also mislead policy optimization by providing unreliable learning signals. We propose WoVR, a reliable world-model-based RL framework for post-training VLA policies. Instead of assuming a faithful world model, WoVR explicitly regulates how RL interacts with imperfect imagined dynamics. It improves rollout stability through a controllable action-conditioned video world model, reshapes imagined interaction to reduce effective error depth via Keyframe-Initialized Rollouts, and maintains policy--simulator alignment through World Model-Policy co-evolution. Extensive experiments demonstrate that WoVR enables stable long-horizon imagined rollouts and effective policy optimization, achieving superior LIBERO performance and consistent real-world gains across multiple robotic platforms. These results show that world models can serve as practical simulators for RL when hallucination is explicitly controlled. Additional visualization results are available at https://wovr-corl.github.io.

cs.RO↗

SEAD: Competence-Aware On-Policy Distillation via Entropy-Guided Supervision

On-policy distillation (OPD) has a property absent in offline distillation and RL: teacher supervision quality depends on student competence. Incoherent rollouts yield noisy gradients; already-mastered tokens yield redundant ones. This creates waste at three scales (tokens, training phases, and prompts) yet existing methods supervise uniformly. We introduce SEAD, which uses entropy as a unified probe of this competence-dependent degradation at three scales: (1) joint teacher-student entropy partitions tokens into zones receiving tailored divergences or zero gradient (approx. 50% skipped); (2) a cosine schedule anneals from forward to reverse KL as competence grows; (3) a competence-gated curriculum introduces prompts easy-to-hard. These components are symbiotically necessary: token selection requires coherent rollouts (curriculum), annealing requires monotonic improvement (also curriculum). On OLMo-3 (7B to 32B), SEAD achieves +4.8 avg accuracy over vanilla OPD across six math benchmarks, with ablations confirming super-additive interactions.

cs.CL↗

Benchmarking Multi-Modal Graph-based Social Media Popularity Prediction

Social media popularity prediction aims to forecast the future reach or influence of online content from early-stage observations. Accurate prediction enables key downstream applications, such as advertising optimization and strategic content planning by users, creators, and platforms. Despite substantial progress, existing popularity prediction works often fail to jointly consider multimodal content and temporal social interaction signals. Moreover, the literature remains highly fragmented across datasets, modalities, observation windows, prediction targets, and evaluation protocols. This fragmentation prevents fair comparison and obscures a systematic understanding of how textual, visual, temporal, and interaction-based signals jointly shape popularity dynamics. To address these challenges, we introduce MMG-Pop, a Multi-modal Graph-based Popularity Prediction benchmark, which unifies datasets, modalities, temporal interaction signals, and representative baselines under a standardized evaluation protocol. Furthermore, we propose MMG-PopNet, a unified multi-modal graph-based network that jointly models the aforementioned multi-modal signals and graph-structured social interactions. Extensive experiments on MMG-Pop, comprising four datasets across Bluesky and Reddit platforms, demonstrate the superior performance of MMG-PopNet and yield new insights into cross-platform training generalization, multi-task prediction benefits, multi-modality contributions, and LLM prediction limitation. These findings establish a unified foundation for future research on social dynamics modeling and intervention under heterogeneous modalities and socially-aware agentic ecosystem paradigms.

cs.SI↗

Pingquanqi (Equalizer): A Cross-Domain Sociotechnical Framework for Human-Agent Interaction Governance

LLM agents are transitioning from experimental tools to permanent infrastructure -- a computational layer as enduring as the electrical grid. Like any infrastructure, they carry a cost chain from physical capital through enterprise investment to user consumption, ending at the user's most irreplaceable resource: lifetime. When unoptimized, this chain leaks, consuming user lifetime without adequate compensation. This paper proposes Pingquanqi (Equalizer), a cross-domain sociotechnical framework for Human-Agent Interaction Governance (HAIGF). Its product form is an Agent framework-level embedded design specification, analogous to WCAG for web accessibility, whose goal is not to be purchased but adopted as a standard. Pingquanqi consists of four integrated components deployable as native middleware: (1) a user-state discrimination model enabling proactive knowledge leveling, (2) a Bayesian progressive stop-loss rule capping per-session interaction cost, (3) controlled friction mechanisms breaking self-reinforcing dependency loops, and (4) Lsteal, a transparency metric rendering token-to-lifetime cost conversion visible. A fifth mechanism, reflective summarization (F5), enables guided cognitive recollection. The framework is grounded in cross-cultural philosophy: Mao's epistemology of practice (On Practice, 1937) provides the basis for cross-session knowledge accumulation; Wang Yangming's unity of knowledge and action (zhi xing he yi, c. 1509) illuminates Lsteal's root -- knowing without acting is incomplete; and Hegel's unity of theory and practice demonstrates cross-traditional convergence. This paper argues Pingquanqi's primary economic beneficiary is the enterprise deploying Agent services -- through reduced wasted computation, improved user satisfaction, and sustained subscription revenue -- with individual user benefit as the natural downstream consequence.

cs.CY↗

Agentic evolution of physically constrained foundation models

Artificial intelligence increasingly drives automated scientific discovery, yet contemporary generalist agents lack physical grounding, frequently hallucinating hardware-incompatible designs. Here, we present a physically grounded, multi-agent discovery engine that autonomously architects hardware-compliant computing systems. Anchored by an Evolutionary Knowledge Graph structuring past scientific innovations, the framework extracts an "algorithmic Chain-of-Thought" to transform blind stochastic search into directed structural evolution. Applied to the extreme testbed of foundation model deployment, the engine evolved two hardware-aware compression methodologies surpassing human-engineered heuristics: Q-Enhance mitigates long-context accuracy loss in dense models, and MoE-Salient-AQ outperforms state-of-the-art manual sparse Mixture-of-Experts designs by 3.7% at sub-3-bit regimes. Utilizing a bandwidth-efficient Sensitivity Profile, we successfully deployed a massive 235-billion-parameter model onto a constrained dual-A100 server, reducing memory requirements by 75% with a marginal 0.64% accuracy degradation. By transforming unconstrained combinatorial search into knowledge-driven autonomy, this establishes a scalable hardware-software co-design paradigm for machine-driven discovery within strict physical boundaries.

cs.AI↗

Alignment-Free Nanometric Optical Metrology Enabled by Structured Light

Advances in the semiconductor industry are driven by the development of increasingly compact devices featuring intricate etched geometries, the characterization of which essentially requires ultraprecise, label-free, and real-time metrology. However, non-destructive and alignment-free optical metrology of sub-wavelength structures with nanometric resolution remains a major challenge. Here, we demonstrate a novel single-shot, label-free, and alignment-free optical metrology approach for determining the 1D position of sub-wavelength nanostructures, achieving lambda/110 (7.2 nm) precision. The high precision benefits from utilizing structured illuminations of Laguerre-Gaussian (LG) or Hermite-Gaussian (HG) beams, and the AI analyzing method can retrieve the information when such structured light interacts with sub-wavelength objects. Instead of relying on phase singularities in superoscillatory microscopy, our approach leverages spatially distributed phase jumps in HG and LG beams interacting with the nanostructures, providing an alignment-robust solution to the challenges in optical metrology. Such an alignment-free, non-destructive, and high-precision metrology technique enables real-time machine vision, semiconductor inspection, and advanced manufacturing.

physics.optics↗

Electrical-Circuit Simulation of the Uhlmann Phase

The Uhlmann phase extends the concept of geometric phases to mixed quantum states through a parallel-transport condition on purification amplitudes, but its experimental realization has so far required sophisticated quantum platforms with carefully engineered auxiliary degrees of freedom. In this work, we reformulate the Uhlmann parallel-transport condition as a linear matrix differential equation and vectorize it to obtain an effective dynamical generator. This generator can be directly mapped onto the admittance matrix of a classical RC circuit, thereby translating the Uhlmann dynamics into the evolution of circuit node voltages. We illustrate the mapping using the equatorial-loop model and, via a rotating-frame transformation followed by a real decomposition, derive a time-independent, real-valued dynamical system suitable for analog implementation. LTspice simulations of the resulting active RC network faithfully reproduce the Uhlmann geometric phase and its topological transition at the critical purity, demonstrating that classical electrical circuits offer a simple and accessible platform for probing mixed-state geometric phases.

quant-ph↗

On the automorphism group of direct product of digraphs

Determining the conditions under which the direct product of graphs $G$ and $H$ satisfies $\mathrm{Aut}(G\times H)=\mathrm{Aut}(G)\times\mathrm{Aut}(H)$ has been a problem of considerable interest since Sabidussi's classic work in the 1950s. We call such a pair $(G,H)$ stable, and unstable otherwise. Although much progress has been made for graph pairs, the general digraph case has remained completely open. In this paper, we initiate the study of the stability of digraph pairs, and then focus on the stability of a single digraph $G$. This is defined as the stability of the pair $(G,K_2)$ and has been studied extensively when $G$ is undirected. We establish a necessary and sufficient condition for a connected digraph to be unstable, and use it to derive four sufficient conditions for circulant digraphs to be unstable. Moreover, we prove the nonexistence of nontrivially unstable finite arc-transitive circulant digraphs and nontrivially unstable Cayley digraphs of abelian groups of odd order.

math.CO↗

Hulls and sums of separable constacyclic codes over $\mathbb{F}_q \times (\mathbb{F}_q+v\mathbb{F}_q)$ and new quantum codes

We establish the generator polynomials of the Euclidean and Hermitian duals of separable constacyclic codes over $\mathcal{S} = \mathbb{F}_q \times (\mathbb{F}_q+v\mathbb{F}_q)$, with $q$ an odd prime power and $v^2=v$, and we derive the generator polynomials of their Gray images, respectively. The generator polynomials of the Euclidean hulls and Hermitian hulls of separable constacyclic codes over $\mathcal{S}$ and their Gray images are presented, respectively. Furthermore, we provide the generator polynomials of the Euclidean sums and Hermitian sums of separable constacyclic codes and their Gray images, respectively. Finally, we propose two methods to yield quantum error-correcting codes (QECCs) from the hulls and sums of separable constacyclic codes over $\mathcal{S}$, and generate new QECCs that outperform the existing ones in terms of parameters.

cs.IT↗

Influence-Guided Concolic Testing of Transformer Robustness

Concolic testing for neural networks alternates concrete execution with constraint solving to search for inputs that flip model decisions. We present a concolic tester for Transformer classifiers that uses SHAP estimates to rank pending path predicates by their impact on the current prediction. To support self-attention with multiple heads in execution backed by SMT solving, we implement attention semantics in pure Python that are compatible with the solver and make the softmax boundary explicit by concretizing exponentiation arguments. We evaluate our method on CIFAR-10 across three compact Transformer classifiers, ResNet18, and VGG16 under a one-pixel budget and a 900s horizon. Across the 500 model--input pairs in this matched comparison, our method achieves 60% success, compared with 15% for a differential evolution baseline that treats the model as a black box. In the primary two-layer Transformer branch-ordering study, SHAP-based predicate prioritization raises success from 56% to 60% and reduces median attack time by 51%. These results show that influence-guided path exploration can make concolic testing a practical way to find adversarial examples in Transformer models.

cs.SE↗

High-speed electrically driven liquid-crystal compact optical skyrmion encoder

Optical skyrmions possess topological polarization textures that can maintain topological robustness under external perturbations, making them promising carriers for disturbance-resistant optical information transmission. However, existing optical skyrmion generation schemes mostly rely on static optical elements or fixed nanostructures, making high-speed dynamic switching of the topological state difficult. Here, we propose a high-speed switchable optical skyrmion generator based on a patterned liquid-crystal spin-orbit device. The device employs the in-plane orientation of liquid crystals to imprint a fixed Pancharatnam-Berry geometric phase, while an applied voltage rapidly tunes the liquid-crystal retardance, enabling reversible switching between skyrmion and non-skyrmion states. Experimental results show that the device exhibits millisecond electrical response, with bidirectional response times of 1.76 ms and 0.72 ms, corresponding to an ideal cycling rate of approximately 403 Hz, making it the fastest switchable optical skyrmion generator to date. Furthermore, by exploiting this rapid topological refreshing capability, we demonstrate image encoding and decoding, providing a new liquid-crystal device platform for high-speed, refreshable, and disturbance-resistant topological optical information transmission.

physics.optics↗

SafeClawBench: Separating Semantic, Audit-Evidence, and Sandbox Harm in Tool-Using LLM Agents

Tool-using language-model agents introduce security failures that go beyond unsafe text: they can disclose protected objects, write persistent memory, send messages, modify databases, or trigger harmful code and tool effects. Existing evaluations often collapse these stages into a single attack success rate, making it difficult to tell whether a model merely agreed with an attacker or actually produced observable harm. We introduce SafeClawBench, a staged benchmark for tool-using agent security with 600 controlled adversarial tasks across six attack families: direct and indirect prompt injection, tool-return injection, memory poisoning, memory extraction, and ambiguity-driven unsafe inference. SafeClawBench reports three separate endpoints: semantic attack acceptance, audit-visible harm evidence, and sandbox-observed tool/state harm. Evaluating five agent endpoints under four prompt-level policies, we find that these endpoints capture different failure modes. Without additional prompt protection, semantic failure rates vary widely across models, from 9.0% to 44.2%. Audited harm evidence is narrower than semantic failure, and under a separate executable protocol some matched task identities produce sandbox harm despite passing the Semantic Core call: in a 12,000-row matched analysis, 291 of 347 observed sandbox harms occur in rows that pass the semantic check. Prompt policies change endpoint outcomes, but their effects depend on both model and protocol. SafeClawBench provides a reproducible framework for comparing agent models and prompt-policy conditions without conflating textual compliance, evidence-supported harm, and executable state changes. The open-source dataset is available at https://huggingface.co/datasets/sairights/safeclawbench.

cs.CR↗

Video2Code: Generating Interactive Webpages from UI Videos via Action-Aware Revisit

UI videos provide a natural input for generating interactive webpages, as they capture both webpage appearance and action-triggered state transitions. However, directly applying video-capable vision-language models to this task remains insufficient. Existing models typically rely on sparse sampling or compressed temporal representations, which may miss short action boundaries and break the state-action-state transitions needed to implement webpage behavior. We formulate UI video-to-code generation as executable state-transition recovery from interaction videos, and identify this failure mode as state-transition misalignment. We introduce Video2Code, an action-aware video-to-code approach for recovering executable UI state transitions. Rather than allocating the visual budget uniformly across the video, Video2Code first performs coarse video understanding to locate action-critical regions, then invokes a temporal clipping tool to revisit these regions at higher temporal resolution before generating HTML/CSS/JavaScript code. We instantiate Video2Code with action-aligned video-code supervision and evaluate it under both visual and functional criteria. Experiments show that Video2Code substantially strengthens the underlying open-source model for UI video-to-code generation, improving functional correctness over direct video observation, especially on dense multi-step interactions.

cs.CV↗

Evaluating the Structural Basis for Polar Altermagnet Candidate Ca$_{3}$(Ru,Ti)$_{2}$O$_{7}$

The interplay between polar and altermagnetic orders remains largely unexplored in the broader landscape of correlated electron systems. Ca$_{3}$Ru$_{2}$O$_{7}$ has been proposed by density functional theory (DFT) as a polar altermagnet, reliant on the transformation of experimentally reported $Bb2_{1}m$ phase to a lower symmetry $Pn2_{1}a$ structure. Here, we perform a targeted search for the $Pn2_{1}a$ phase using synchrotron X-ray diffraction on single crystals of Ca$_{3}$Ru$_{2}$O$_{7}$ and Ca$_{3}$(Ru$_{0.99}$Ti$_{0.01}$)$_{2}$O$_{7}$. No diffraction signature of the $Pn2_{1}a$ structure is detected down to 20 K within experimental limits of $\sim$60-200 fm atomic displacements, significantly smaller than the DFT prediction of $\sim$1 pm. Combined with recent nonlinear transport measurements, our structural study suggests Ca$_{3}$Ru$_{2}$O$_{7}$ as a unique system where strong electron correlations drive an electronic phase transition without any measurable lattice symmetry change. With Ti substitution exceeding $\sim$3%, a chemically tunable altermagnetic phase with $Bb2_{1}m$ structure emerges. The study highlights the importance of sub-picometer metrology towards de-convolving structural versus electronic origins of altermagnets.

cond-mat.str-el↗

LabOSBench: Benchmarking Computer Use Agents for Scientific Instrument Control

Current computer-use benchmarks primarily focus on software operation tasks in virtualized systems, whereas scientific instrumentation scenarios require coordinated control over complex interfaces, and feedback-driven parameter adjustment. However, directly evaluating agents on physical high-precision instruments is impractical due to high cost, safety risks, limited accessibility, and difficulty in ensuring reproducible evaluation. This motivates the need for a simulated yet realistic testbed that preserves the operational challenges of scientific instruments while enabling scalable and safe benchmarking. To this end, we introduce LabOSBench, a challenging benchmark for multimodal GUI agents built on a suite of web-based scientific-instrument simulators. Operating directly via a browser, LabOSBench avoids resource-heavy OS virtualization while supporting flexible task configuration and execution-based evaluation. Specifically, LabOSBench constructs 96 subtasks across eight instrument simulators, covering workflows from sample loading, alignment, parameter tuning, and data acquisition to result inspection. We evaluate general-purpose vision-language models, specialized GUI agent models, and advanced agentic frameworks at both subtask and end-to-end levels. Our experiments reveal that while existing agents can complete many structured GUI subtasks, they still struggle with feedback-driven operations and long-horizon workflow execution. Overall, LabOSBench provides a reproducible, low-cost testbed for advancing computer-using agents toward scientific-instrument control.

cs.AI↗

Further results on monomial ideals of projective dimension one

We prove that a monomial ideal has projective dimension one if and only if its minimal monomial generators can be ordered so that each successive colon ideal is principal, and show that this characterization is equivalent to the monomial version of the Hilbert-Burch Lemma. Furthermore, we prove that any squarefree monomial ideal of projective dimension one with a linear resolution has the property that all its powers \(I^s\) admit linear quotients, and we provide a partial classification of such ideals.

math.AC↗

Maximum spectral gap of regular graphs with bounded essential edge-connectivity

An edge-cut of a graph is said to be essential if its removal results in a graph with at least two non-trivial components. The essential edge-connectivity of a graph $G$ is the minimum cardinality among all essential edge-cuts of $G$. The spectral gap of $G$ is the difference between its largest and second largest eigenvalues. In this paper, we prove that for any integers $t$ and $r$ with $6\leq r\leq t\leq 2r-3$, the maximum spectral gap among all connected $r$-regular graphs with essential edge-connectivity at most $t$ is equal to $\frac{1}{2}(r+7-\sqrt{(r+7)^2-8t-32})$ when $t-r$ is odd and $\frac{1}{2}(r+6-\sqrt{(r+6)^2-8t-32})$ when $t-r$ is even. We construct a family of connected $r$-regular graphs achieving these bounds.

math.CO↗

Singular Hochschild complex and Cartan matrix

If A is a symmetric algebra, then Hochschild homology of the dg enhancement of the singularity category of A agrees with singular Hochschild homology of A. For a basic finite dimensional k algebra A, the Cartan matrix of A is symmetric if and only if the k dual of the mixed complex of the dg enhancement of its singularity category is isomorphic to its shift by -1. We provide two counterexamples to show that neither result holds for general Frobenius algebras.

math.RT↗