arXiv subjects

Ruixuan Zhang

Publications and source records attributed to Ruixuan Zhang.

At least 19 recordsLinked to original sources

arXiv2026

Coalescence and fluctuations of O'Connell$\unicode{x2013}$Yor polymers via the free-energy correlation profile

We establish an identity relating the spatial derivative of a two-point free-energy correlation to two fundamental geometric quantities: the annealed probability that two independently sampled polymers, in the same environment, meet before reaching the prescribed terminal level, and the exit-point location of a single polymer. Our result is inspired in part by recent integration-by-parts work of Gu and Quastel for the KPZ equation. A crucial step in their continuous setting relies on an ingenious application of It\^o's formula, which has no direct analogue in our semi-discrete setting. Instead, we exploit intrinsic symmetries of the polymer model together with the memoryless property. We also provide two applications: (i) we recover the horizontal Burke property by proving that the anchored stationary horizontal free-energy profile is a two-sided Brownian motion; (ii) in the zero-temperature limit, we obtain the corresponding identity for Brownian last-passage percolation.

math.PR↗

arXiv2026

Learning at the Right Pace: Adaptive Data Scheduling Improves LLM Reinforcement Learning

Large Language Models (LLMs) achieve remarkable reasoning capabilities through reinforcement learning (RL) post-training. However, existing RL post-training commonly relies on uniform data sampling, which ignores the semantic structure of the training data and the changing capability of the training policy. To address these limitations, we propose Adaptive Data Scheduling (ADS), a dual-level data scheduling framework for pacing RL post-training that replaces uniform sampling with an adaptive distribution over semantic clusters and policy-boundary sample selection. At the cluster level, ADS organizes samples according to semantic patterns and maintains an adaptive inter-cluster distribution to solidify current training progress. At the sample level, ADS performs intra-cluster scheduling to continuously sample policy-boundary samples, which provides informative relative advantages. Experimental results across three LLMs and seven reasoning benchmarks demonstrate that ADS improves average accuracy by 5.2% over Group Relative Policy Optimization (GRPO). Notably, ADS consistently improves RL methods with different objective designs, highlighting its potential as a general data scheduling strategy for LLM RL post-training. The source code is available at: https://github.com/Richard-zrx/ADS.

cs.CL↗

arXiv2026

Sequentially-Rerandomized Switchback Experiments

Large-scale online platforms and marketplace systems often evaluate new policies through experiments that randomize treatment across operational units (e.g., geographies, regions, or clusters) over many time periods. In these settings, standard A/B testing can be inefficient or unreliable due to a limited number of units, substantial cross-unit heterogeneity, non-stationarity, and potential carryover across periods. We propose Sequentially-Rerandomized Switchback Experiments (SRSB), a new experimental design that helps mitigate these challenges. SRSB re-randomizes treatment at each time period such as to enforce balance on pre-specified prognostic variables constructed from past observations. In the absence of carryover, SRSB improves precision by leveraging temporal dependence through balancing lagged outcomes and covariates; we develop finite-sample randomization inference under a sharp null as well as asymptotic inference as the number of periods grows. We then extend SRSB to settings with first-order carryover and introduce a blocked SRSB variant that rerandomizes within strata defined by the previous treatment to form stable and comparable "stay" groups. Extensive simulations demonstrate the practical gains and robustness of SRSB relative to standard switchback designs.

stat.ME↗

arXiv2026

PJB: A Reasoning-Aware Benchmark for Person-Job Retrieval

As retrieval models converge on generic benchmarks, the pressing question is no longer "who scores higher" but rather "where do systems fail, and why?" Person-job matching is a domain that urgently demands such diagnostic capability -- it requires systems not only to verify explicit constraints but also to perform skill-transfer inference and job-competency reasoning, yet existing benchmarks provide no systematic diagnostic support for this task. We introduce PJB (Person-Job Benchmark), a reasoning-aware retrieval evaluation dataset that uses complete job descriptions as queries and complete resumes as documents, defines relevance through job-competency judgment, is grounded in real-world recruitment data spanning six industry domains and nearly 200,000 resumes, and upgrades evaluation from "who scores higher" to "where do systems differ, and why" through domain-family and reasoning-type diagnostic labels. Diagnostic experiments using dense retrieval reveal that performance heterogeneity across industry domains far exceeds the gains from module upgrades for the same model, indicating that aggregate scores alone can severely mislead optimization decisions. At the module level, reranking yields stable improvements while query understanding not only fails to help but actually degrades overall performance when combined with reranking -- the two modules face fundamentally different improvement bottlenecks. The value of PJB lies not in yet another leaderboard of average scores, but in providing recruitment retrieval systems with a capability map that pinpoints where to invest.

cs.IR↗

arXiv2026

Devling into Adversarial Transferability on Image Classification: Review, Benchmark, and Evaluation

Adversarial transferability refers to the capacity of adversarial examples generated on the surrogate model to deceive alternate, unexposed victim models. This property eliminates the need for direct access to the victim model during an attack, thereby raising considerable security concerns in practical applications and attracting substantial research attention recently. In this work, we discern a lack of a standardized framework and criteria for evaluating transfer-based attacks, leading to potentially biased assessments of existing approaches. To rectify this gap, we have conducted an exhaustive review of hundreds of related works, organizing various transfer-based attacks into six distinct categories. Subsequently, we propose a comprehensive framework designed to serve as a benchmark for evaluating these attacks. In addition, we delineate common strategies that enhance adversarial transferability and highlight prevalent issues that could lead to unfair comparisons. Finally, we provide a brief review of transfer-based attacks beyond image classification.

cs.CV↗

arXiv2025

SimWorld-Robotics: Synthesizing Photorealistic and Dynamic Urban Environments for Multimodal Robot Navigation and Collaboration

Recent advances in foundation models have shown promising results in developing generalist robotics that can perform diverse tasks in open-ended scenarios given multimodal inputs. However, current work has been mainly focused on indoor, household scenarios. In this work, we present SimWorld-Robotics~(SWR), a simulation platform for embodied AI in large-scale, photorealistic urban environments. Built on Unreal Engine 5, SWR procedurally generates unlimited photorealistic urban scenes populated with dynamic elements such as pedestrians and traffic systems, surpassing prior urban simulations in realism, complexity, and scalability. It also supports multi-robot control and communication. With these key features, we build two challenging robot benchmarks: (1) a multimodal instruction-following task, where a robot must follow vision-language navigation instructions to reach a destination in the presence of pedestrians and traffic; and (2) a multi-agent search task, where two robots must communicate to cooperatively locate and meet each other. Unlike existing benchmarks, these two new benchmarks comprehensively evaluate a wide range of critical robot capacities in realistic scenarios, including (1) multimodal instructions grounding, (2) 3D spatial reasoning in large environments, (3) safe, long-range navigation with people and traffic, (4) multi-robot collaboration, and (5) grounded communication. Our experimental results demonstrate that state-of-the-art models, including vision-language models (VLMs), struggle with our tasks, lacking robust perception, reasoning, and planning abilities necessary for urban environments.

cs.AI↗

arXiv2025

SimWorld: An Open-ended Realistic Simulator for Autonomous Agents in Physical and Social Worlds

While LLM/VLM-powered AI agents have advanced rapidly in math, coding, and computer use, their applications in complex physical and social environments remain challenging. Building agents that can survive and thrive in the real world (for example, by autonomously earning income or running a business) requires massive-scale interaction, reasoning, training, and evaluation across diverse embodied scenarios. However, existing world simulators for such development fall short: they often rely on limited hand-crafted environments, simulate simplified game-like physics and social rules, and lack native support for LLM/VLM agents. We introduce SimWorld, a new simulator built on Unreal Engine 5, designed for developing and evaluating LLM/VLM agents in rich, real-world-like settings. SimWorld offers three core capabilities: (1) realistic, open-ended world simulation, including accurate physical and social dynamics and language-driven procedural environment generation; (2) a rich interface for LLM/VLM agents, with multimodal world inputs and open-vocabulary actions at varying levels of abstraction; and (3) diverse and extensible physical and social reasoning scenarios that are easily customizable by users. We demonstrate SimWorld by deploying frontier LLM agents (e.g., GPT-4o, Gemini-2.5-Flash, Claude-3.5, and DeepSeek-Prover-V2) on long-horizon multi-agent delivery tasks involving strategic cooperation and competition. The results reveal distinct reasoning patterns and limitations across models. We open-source SimWorld and hope it becomes a foundational platform for advancing real-world agent intelligence across disciplines: https://simworld.org.

cs.AI↗

arXiv2025

Broad nonlocal spectrum in the Pb-InSb hybrid three terminals for potential realization of Kitaev chains

Hybrid superconductor-semiconductor(SC-SM) nanowires remain one of the foremost platforms for engineering topological superconductivity and Majorana zero modes(MZMs) towards fault-tolerant topological qubits, especially with the rapid development of artificial Kitaev chains. In contrast to the widely used aluminum(Al)-based hybrids, lead(Pb) offers a bulk superconducting gap of ~1.4meV and a critical temperature of ~7.2K, giving rise to a proximity-induced gap that is roughly five times larger than that obtained with Al. Here we present the first three-terminal Pb-hybrid devices and perform nonlocal differential-conductance spectroscopy on this platform. The nonlocal measurement simultaneously resolves a dual-gap feature of the parent Pb gap and the large, hard, gate-tunable induced superconducting gap, distinguished by a switch between electron- and hole-like dissipation processes. Within the induced gap we observe several types of Andreev bound states(ABSs) that undergo singlet-doublet transitions. Moreover, by tuning gate voltages we achieve gate-controlled resonating sign reversals of the nonlocal conductance, identifying three distinct regimes that correspond to different configurations of quantum-dot(QD) resonances(single-resonance, double-resonance, and series-resonance). Finally, the coupling between ABSs and QDs also present and can be modulated from the weak- to strong-coupling limit, indicating the feasibility of realizing the artificial Kitaev chains. Crucially, the robust nonlocal signatures persist up to temperatures(~1K) far above the operating temperature of Al-based devices thanks to the unusually large induced gap, thereby widening the accessible parameter space greatly and underscoring the suitability of Pb-based hybrids for implementing warm temperature artificial Kitaev chains and the topological quantum devices protected by a substantially larger topological gap.

quant-ph↗

arXiv2025

Signs of Struggle: Spotting Cognitive Distortions across Language and Register

Rising mental health issues among youth have increased interest in automated approaches for detecting early signs of psychological distress in digital text. One key focus is the identification of cognitive distortions, irrational thought patterns that have a role in aggravating mental distress. Early detection of these distortions may enable timely, low-cost interventions. While prior work has focused on English clinical data, we present the first in-depth study of cross-lingual and cross-register generalization of cognitive distortion detection, analyzing forum posts written by Dutch adolescents. Our findings show that while changes in language and writing style can significantly affect model performance, domain adaptation methods show the most promise.

cs.CL↗

arXiv2025

Reading Between the Signs: Predicting Future Suicidal Ideation from Adolescent Social Media Texts

Suicide is a leading cause of death, yet predicting it remains a significant challenge. Risk factors such as depression or substance use are commonly used for prediction, but their predictive performance is often only slightly better than chance. Additionally, many cases go undetected due to a lack of contact with mental health services. Social media, however, offers a unique opportunity, as people often share their thoughts and struggles online in real time. In this work, we propose a novel task and method for early identification: predicting suicidal ideation and behavior (SIB) before a user ever expresses it on an online forum. We introduce Early-SIB, a transformer-based model that sequentially processes the posts a user writes and engages with to predict whether they will write a SIB post. Our model achieves a balanced accuracy of 0.73 in predicting future SIB on a Dutch youth forum, demonstrating that such tools can offer a meaningful addition to traditional methods. Finally, we use Shapley Additive Explanations to make the model's predictions more interpretable.

cs.CL↗

arXiv2025

Density of States (Gate) - Controlled Andreev Molecule and Sensor

Topological quantum computing typically relies on topological Andreev bound states (ABSs) engineered in hybrid superconductor-semiconductor devices, where gate control offers key advantages. While strong Zeeman fields can induce such states, an alternative approach emerges through Andreev molecules -- closely spaced, coupled ABSs, also key building-block for Kitaev chain -- that enable topological behavior without high magnetic fields. However, existing Andreev molecules are controlled via magnetic flux in superconducting loops, limiting scalability. Here, we introduce a gate-controlled Andreev molecule, where electrostatic tuning of the density of states in one site nonlocally enhances the critical current of another. This eliminates superconducting loops, offering superior tunability, scalability, and sensitivity. We further extend such an Andreev molecule to a multi-site Kitaev chain, and a noninvasive sensor resolving single-Cooper-pair charge for parity readout. This platform bridges the gap between scalable ABS engineering and high-sensitivity quantum sensing, advancing the development for constructing and parity-readout in topological ABSs and long Kitaev chains towards topological qubits.

cond-mat.mes-hall↗

arXiv2025

An upper tail field of the KPZ fixed point

The KPZ fixed point is a (1+1)-dimensional space-time random field conjectured to be the universal limit for models within the Kardar-Parisi-Zhang (KPZ) universality class. We consider the KPZ fixed point with the narrow-wedge initial condition, conditioning on a large value at a specific point. By zooming in the neighborhood of this high point appropriately, we obtain a limiting random field, which we call an upper tail field of the KPZ fixed point. Different from the KPZ fixed point, where the time parameter has to be nonnegative, the upper tail field is defined in the full $2$-dimensional space. Especially, if we zoom out the upper tail field appropriately, it behaves like a Brownian-type field in the negative time regime, and the KPZ fixed point in the positive time regime. One main ingredient of the proof is an upper tail estimate of the joint tail probability functions of the KPZ fixed point near the given point, which generalizes the well known one-point upper tail estimate of the GUE Tracy-Widom distribution.

math.PR↗

arXiv2025

Enhanced and modulable induced superconducting gap and effective Landé g-factor in Pb-InSb hybrid devices

The hybrid system of a conventional superconductor (SC) on a semiconductor (SM) nanowire with strong spin-orbit coupling (SOC) represents a promising platform for achieving topological superconductivity and Majorana zero modes (MZMs) towards topological quantum computation. While aluminum (Al)-based hybrid nanowire devices have been widely utilized, their limited superconducting gap and intrinsic weak SOC as well as small Landé g-factor may hinder future experimental advancements. In contrast, we demonstrate that lead (Pb)-based hybrid quantum devices exhibit a remarkably large and hard proximity-induced superconducting gap, exceeding that of Al by an order of magnitude. By exploiting electrostatic gating to modulate wavefunction distribution and SC-SM interfacial coupling, this gap can be continuously tuned from its maximum value (~1.4 meV, matching the bulk Pb gap) down to nearly zero while maintaining the hardness. Furthermore, magnetic-field-dependent measurements reveal a radial evolution of the gap structure with anti-crossing feature, indicative of strong SOC and huge effective g-factors up to 76. These findings underscore the superior functionality of Pb-based hybrid systems, significantly advancing their potential for realizing and stabilizing MZMs and the further scalable topological quantum architectures.

cond-mat.mes-hall↗

arXiv2025

Adversarially Robust AI-Generated Image Detection for Free: An Information Theoretic Perspective

Rapid advances in Artificial Intelligence Generated Images (AIGI) have facilitated malicious use, such as forgery and misinformation. Therefore, numerous methods have been proposed to detect fake images. Although such detectors have been proven to be universally vulnerable to adversarial attacks, defenses in this field are scarce. In this paper, we first identify that adversarial training (AT), widely regarded as the most effective defense, suffers from performance collapse in AIGI detection. Through an information-theoretic lens, we further attribute the cause of collapse to feature entanglement, which disrupts the preservation of feature-label mutual information. Instead, standard detectors show clear feature separation. Motivated by this difference, we propose Training-free Robust Detection via Information-theoretic Measures (TRIM), the first training-free adversarial defense for AIGI detection. TRIM builds on standard detectors and quantifies feature shifts using prediction entropy and KL divergence. Extensive experiments across multiple datasets and attacks validate the superiority of our TRIM, e.g., outperforming the state-of-the-art defense by 33.88% (28.91%) on ProGAN (GenImage), while well maintaining original accuracy.

cs.CV↗

arXiv2025

Edgeworth-type expansion for the one-point distribution of the KPZ fixed point with a large height at a prior location

We consider the Kardar-Parisi-Zhang (KPZ) fixed point $\mathrm{H}(x,τ)$ with the narrow-wedge initial condition and investigate the distribution of $\mathrm{H}(x,τ)$ conditioned on a large height at an earlier space-time point $\mathrm{H}(x',τ')$. As $\mathrm{H}(x',τ')$ tends to infinity, we prove that the conditional one-point distribution of $\mathrm{H}(x,τ)$ in the regime $τ>τ'$ converges to the Gaussian Unitary Ensemble (GUE) Tracy-Widom distribution and that the next two lower-order error terms can be expressed as derivatives of the Tracy-Widom distribution. The lowe order expansion here is analogue to the Edgeworth expansion in the central limit theorem. These KPZ-type limiting behaviors are different from the Gaussian-type ones obtained in \cite{Liu-Wang22} where they study the finite-dimensional distribution of $\mathrm{H}(x,τ)$ conditioned on a large height at a later space-time point $\mathrm{H}(x',τ')$. They show, with the narrow-wedge initial condition, that the conditional random field $\mathrm{H}(x,τ)$ in the regime $τ<τ'$ converges to the minimum of two independent Brownian bridges modified by linear drifts as $\mathrm{H}(x',τ')$ goes to infinity. The two results stated above provide the phase diagram of the asymptotic behaviors of a conditional law of KPZ fixed point in the regimes $τ>τ'$ and $τ<τ'$ when $\mathrm{H}(x',τ')$ goes to infinity.

math.PR↗

arXiv2025

TASAR: Transfer-based Attack on Skeletal Action Recognition

Skeletal sequence data, as a widely employed representation of human actions, are crucial in Human Activity Recognition (HAR). Recently, adversarial attacks have been proposed in this area, which exposes potential security concerns, and more importantly provides a good tool for model robustness test. Within this research, transfer-based attack is an important tool as it mimics the real-world scenario where an attacker has no knowledge of the target model, but is under-explored in Skeleton-based HAR (S-HAR). Consequently, existing S-HAR attacks exhibit weak adversarial transferability and the reason remains largely unknown. In this paper, we investigate this phenomenon via the characterization of the loss function. We find that one prominent indicator of poor transferability is the low smoothness of the loss function. Led by this observation, we improve the transferability by properly smoothening the loss when computing the adversarial examples. This leads to the first Transfer-based Attack on Skeletal Action Recognition, TASAR. TASAR explores the smoothened model posterior of pre-trained surrogates, which is achieved by a new post-train Dual Bayesian optimization strategy. Furthermore, unlike existing transfer-based methods which overlook the temporal coherence within sequences, TASAR incorporates motion dynamics into the Bayesian attack, effectively disrupting the spatial-temporal coherence of S-HARs. For exhaustive evaluation, we build the first large-scale robust S-HAR benchmark, comprising 7 S-HAR models, 10 attack methods, 3 S-HAR datasets and 2 defense models. Extensive results demonstrate the superiority of TASAR. Our benchmark enables easy comparisons for future studies, with the code available in the https://github.com/yunfengdiao/Skeleton-Robustness-Benchmark.

cs.CV↗

arXiv2025

When language and vision meet road safety: leveraging multimodal large language models for video-based traffic accident analysis

The increasing availability of traffic videos functioning on a 24/7/365 time scale has the great potential of increasing the spatio-temporal coverage of traffic accidents, which will help improve traffic safety. However, analyzing footage from hundreds, if not thousands, of traffic cameras in a 24/7/365 working protocol remains an extremely challenging task, as current vision-based approaches primarily focus on extracting raw information, such as vehicle trajectories or individual object detection, but require laborious post-processing to derive actionable insights. We propose SeeUnsafe, a new framework that integrates Multimodal Large Language Model (MLLM) agents to transform video-based traffic accident analysis from a traditional extraction-then-explanation workflow to a more interactive, conversational approach. This shift significantly enhances processing throughput by automating complex tasks like video classification and visual grounding, while improving adaptability by enabling seamless adjustments to diverse traffic scenarios and user-defined queries. Our framework employs a severity-based aggregation strategy to handle videos of various lengths and a novel multimodal prompt to generate structured responses for review and evaluation and enable fine-grained visual grounding. We introduce IMS (Information Matching Score), a new MLLM-based metric for aligning structured responses with ground truth. We conduct extensive experiments on the Toyota Woven Traffic Safety dataset, demonstrating that SeeUnsafe effectively performs accident-aware video classification and visual grounding by leveraging off-the-shelf MLLMs. Source code will be available at \url{https://github.com/ai4ce/SeeUnsafe}.

cs.CV↗

arXiv2024

Boosting Adversarial Transferability for Skeleton-based Action Recognition via Exploring the Model Posterior Space

Skeletal motion plays a pivotal role in human activity recognition (HAR). Recently, attack methods have been proposed to identify the universal vulnerability of skeleton-based HAR(S-HAR). However, the research of adversarial transferability on S-HAR is largely missing. More importantly, existing attacks all struggle in transfer across unknown S-HAR models. We observed that the key reason is that the loss landscape of the action recognizers is rugged and sharp. Given the established correlation in prior studies~\cite{qin2022boosting,wu2020towards} between loss landscape and adversarial transferability, we assume and empirically validate that smoothing the loss landscape could potentially improve adversarial transferability on S-HAR. This is achieved by proposing a new post-train Dual Bayesian strategy, which can effectively explore the model posterior space for a collection of surrogates without the need for re-training. Furthermore, to craft adversarial examples along the motion manifold, we incorporate the attack gradient with information of the motion dynamics in a Bayesian manner. Evaluated on benchmark datasets, e.g. HDM05 and NTU 60, the average transfer success rate can reach as high as 35.9\% and 45.5\% respectively. In comparison, current state-of-the-art skeletal attacks achieve only 3.6\% and 9.8\%. The high adversarial transferability remains consistent across various surrogate, victim, and even defense models. Through a comprehensive analysis of the results, we provide insights on what surrogates are more likely to exhibit transferability, to shed light on future research.

cs.CV↗