Searcharxiv⌕ Search

arXiv subjects

Ziying Chen

Publications and source records attributed to Ziying Chen.

6 recordsLinked to original sources
arXiv2026

Non-equilibrium fluctuations of a two-species exclusion process with slow boundary

We study the non-equilibrium density fluctuations of a one-dimensional two-species symmetric simple exclusion process in contact with critical slow boundary reservoirs. The boundary rates are of order $1/n$, which leads to Robin boundary conditions at the macroscopic level. We prove that the coupled fluctuation field associated with the empirical densities of two species converges to a generalized Ornstein-Uhlenbeck process. The limiting process is characterized by a linear martingale problem whose coefficients reflect the combined effects of bulk diffusion, species conversion, and the boundary reservoirs.

math.PR↗
arXiv2026

Vector Linking via Cross-Model Local Isometric Consistency

We study Vector Linking: given two embedding clouds produced by different black-box encoders over partially overlapping datasets, recover cross-model object correspondences using only vectors. Empirically and theoretically, we show that independently trained contrastive encoders exhibit local geometric consistency: short-range distances are approximately preserved up to a scale factor, while long-range distances are not due to model-specific distortion. Building on this, we propose an iterative, reference-based geometric embedding hashing that recovers vector links from a tiny seed set of paired anchors. It represents each vector by distances to sampled paired anchors, proposes candidate links via hash-space matching, and aggregates evidence across views in a Beta-Bernoulli posterior to bootstrap high-confidence links as new anchors. Experiments across multiple benchmarks and embedding model pairs demonstrate accurate and robust linking under varying overlap, seed budgets, and out-of-domain anchors, with applications to vector database integration and cross-model clustering. Code is available at https://github.com/DBgroup-Edinburgh/VecLinking.

cs.AI↗
arXiv2026

OctoBench: Benchmarking Scaffold-Aware Instruction Following in Repository-Grounded Agentic Coding

Modern coding scaffolds turn LLMs into capable software agents, but their ability to follow scaffold-specified instructions remains under-examined, especially when constraints are heterogeneous and persist across interactions. To fill this gap, we introduce OctoBench, which benchmarks scaffold-aware instruction following in repository-grounded agentic coding. OctoBench includes 34 environments and 217 tasks instantiated under three scaffold types, and is paired with 7,098 objective checklist items. To disentangle solving the task from following the rules, we provide an automated observation-and-scoring toolkit that captures full trajectories and performs fine-grained checks. Experiments on eight representative models reveal a systematic gap between task-solving and scaffold-aware compliance, underscoring the need for training and evaluation that explicitly targets heterogeneous instruction following. We release the benchmark to support reproducible benchmarking and to accelerate the development of more scaffold-aware coding agents.

cs.CL↗
arXiv2024

GC-Bench: An Open and Unified Benchmark for Graph Condensation

Graph condensation (GC) has recently garnered considerable attention due to its ability to reduce large-scale graph datasets while preserving their essential properties. The core concept of GC is to create a smaller, more manageable graph that retains the characteristics of the original graph. Despite the proliferation of graph condensation methods developed in recent years, there is no comprehensive evaluation and in-depth analysis, which creates a great obstacle to understanding the progress in this field. To fill this gap, we develop a comprehensive Graph Condensation Benchmark (GC-Bench) to analyze the performance of graph condensation in different scenarios systematically. Specifically, GC-Bench systematically investigates the characteristics of graph condensation in terms of the following dimensions: effectiveness, transferability, and complexity. We comprehensively evaluate 12 state-of-the-art graph condensation algorithms in node-level and graph-level tasks and analyze their performance in 12 diverse graph datasets. Further, we have developed an easy-to-use library for training and evaluating different GC methods to facilitate reproducible research. The GC-Bench library is available at https://github.com/RingBDStack/GC-Bench.

cs.LG↗
arXiv2016

Deep Imaging in Scattering Media with Single Photon Selective Plane Illumination Microscopy (SPIM)

In most biological tissues, light scattering due to small differences in refractive index limits the depth of optical imaging systems. Two-photon microscopy (2PM), which significantly reduces the scattering of the excitation light, has emerged as the most common method to image deep within scattering biological tissue. This technique, however, requires high-power pulsed lasers that are both expensive and difficult to integrate into compact portable systems. In this paper, using a combination of theoretical and experimental techniques, we show that Selective Plane Illumination Microscopy (SPIM) can image nearly as deep as 2PM without the need for a high-powered pulsed laser. Compared to other single photon imaging techniques like epifluorescence and confocal microscopy, SPIM can image more than twice as deep in scattering media (approximately 10 times the mean scattering length). These results suggest that SPIM has the potential to provide deep imaging in scattering media in situations where 2PM systems would be too large or costly.

physics.optics↗