Search arXiv⌕ Search

arXiv subjects

Jing Chen

Publications and source records attributed to Jing Chen.

At least 19 recordsLinked to original sources

ProAlign: Progressive Positional and Prototype-Guided Alignment for Aerial-Ground Person Re-Identification

Aerial-Ground Person Re-Identification (AG-ReID) aims to match pedestrian images captured by unmanned aerial vehicles (UAVs) and ground-based surveillance cameras. The task remains highly challenging due to severe viewpoint discrepancies, frequent occlusions, and substantial domain gaps between aerial and ground imagery. Beyond these observable factors, existing methods often overlook two fundamental structural issues: cumulative positional drift during hierarchical feature extraction and semantic inconsistency across cross-view feature distributions. To address these challenges, we propose ProAlign, a Progressive Positional and Prototype-Guided Alignment Network for AG-ReID. ProAlign comprises two key components: a Layer-wise Progressive Positional Embedding (LPPE) module and a View-Aware Prototype Contrastive Learning (PCL) module. LPPE performs adaptive positional calibration throughout transformer layers by employing conditional positional encoding in shallow layers to mitigate local spatial distortions, while introducing learnable static positional embeddings in deeper layers to reinforce global semantic priors. Meanwhile, PCL maintains view-specific aerial and ground prototypes for each identity and enforces cross-view semantic consistency via a dual-prototype contrastive objective. Extensive experiments on CARGO and two real-world AG-ReID benchmarks demonstrate the effectiveness of ProAlign, achieving state-of-the-art overall retrieval performance on CARGO with improvements of 1.60% in Rank-1 accuracy and 5.01% in mAP over the strongest competing methods.

cs.CV↗

A new class of optimal binary linear complementary pairs of codes

The construction of optimal binary linear complementary pair (LCP) has recently attracted considerable attention in coding theory. Based on the Belov codes, this paper proposes a novel construction of optimal binary LCPs with $θ=4$, extending our previous work on $θ=3$. Our results not only yield abundant new optimal binary LCPs with flexible parameters, but also enable more optimal binary LCPs with smaller minimum distances.

cs.IT↗

Decentralized Dynamic Stable Matching

We study decentralized computation of the player-optimal stable matching (POSM) with unannounced player arrivals and departures. Without a common clock, event information, or direct communication, players propose to arms and observe only their own accept/reject outcomes. Mismatch cost counts rounds when the realized matching differs from the current POSM. For known preferences, we give a deterministic polynomial-time self-calibrating protocol with cost $O(t_*+K^2\log T)$, improving the previous bound $O(T^{1-1/K}(\log T)^{2/K})$. Here $K$ is the number of arms, $t_*$ the last event time, and $T$ the horizon. Players use only local time and proposal outcomes, knowing neither $t_*$ nor $T$. For any nondecreasing, polynomial-time-computable $g(t)=Ω(t)$, the protocol achieves $O(g(t_*)+K^2N_g(T))$. Here $g$ governs recovery time, while $N_g(T)$ counts iterations of $t\mapsto t+g(t)$ below $T$, exposing a tradeoff between recovery time and asymptotic mismatch cost. Any randomized protocol with recovery scale $g(t)\ge1$ and sublinear asymptotic mismatch cost has worst-case expected cost $Ω(t_*+N_g(T))$. Thus, with $g(t)=t$, our protocol is optimal up to a $K^2$ factor among sublinear-cost protocols with $O(t_*)$ recovery time. For unknown preferences on both sides, each player and arm learns its preferences from its own observations after matching. We give a decentralized learning protocol with expected cost $O(t_*+K^4Δ_{\mathrm{min}}^{-2}\log T)$, where $Δ_{\mathrm{min}}$ measures preference gaps. A complementary static-setting lower bound adapted from the literature shows that the dependence on $T$ and $Δ_{\mathrm{min}}$ is tight.

cs.DC↗

Structure and energetics of grain boundaries in self-assembled double-gyroid block copolymer networks

Grain boundaries (GBs) are ubiquitous defects in crystalline materials, but remain less explored in block copolymer ordered phases. Here, we develop a self-consistent field theory framework to investigate GB structure and energetics in double-gyroid (DG) diblock copolymer networks. Two energy landscapes are obtained for tilt and twist GBs as functions of GB orientations revealing multiple local minima. The lowest-energy GB among the sampled GBs is an asymmetric-tilt network-switching GB ($[\bar{1}\bar{1}1]$ ATNS) rather than the experimentally observed $(422)$ twin boundary (TB) among the sampled GBs. Comparative analyses of tilt ($[\bar{1}\bar{1}1]$, $[100]$ ATNS) and twist ($(422)$ TB, $[0\bar{1}\bar{1}]$ TNS) GBs reveal that, unlike enthalpy-dominated hard matter, GB stability in DG networks is entropy-driven. Twist-type GBs generate new nodes and disrupt nodal coplanarity, causing chain-packing frustration and entropy penalties. Although the [100] ATNS does not generate new nodes, its disruption of nodal coplanarity still incurs large entropy penalties. Conversely, the $[\bar{1}\bar{1}1]$ ATNS preserves favorable network connectivity and minimizes conformational constraints, making it the energetically preferred GB.

cond-mat.soft↗

Sealed-bid Auctions on Blockchain with Timed Commitment Outsourcing

Sealed-bid auctions play a crucial role in blockchain ecosystems. Previous works introduced viable blockchain sealed-bid auction protocols, leveraging timed commitments for bid encryption. However, a crucial challenge remains unresolved in these works: Who should bear the cost of decrypting these timed commitments? This work introduces a timed commitment outsourcing market as a solution to this challenge. We first introduce an aggregation scheme for timed commitments, which combines all bidders' timed commitments into one while ensuring security and correctness and allowing a varying number of bidders. Next, we remodel the utility of auctioneers and timed commitment solvers, developing a new timed commitment competition mechanism and combining it with the sealed-bid auction to form a two-sided market. The protocol includes bid commitment collection, timed commitment solving, and payment. Through game-theoretical analysis, we prove that our protocol satisfies Dominant Strategy Incentive Compatibility (DSIC) for bidders and Bayesian Incentive Compatibility (BIC) for solvers, and achieves optimal revenue for the auctioneer among a large class of mechanisms. Finally, in the forced-opening-only model in which bidders cannot self-open, we prove that no mechanism can achieve positive expected revenue for the auctioneer while satisfying DSIC and Individual Rationality (IR) for both bidders and solvers, together with ex-post IR for the auctioneer.

cs.GT↗

Learning When to Adapt: Reactivity-Conditioned Residual Adaptation under Human-Robot Distribution Shift

Pedestrians differ in whether they respond to a robot, yet many RL policies assume all are non-reactive to prioritize safety. Policies trained without conditioning on local pedestrians' reactivity may therefore be unnecessarily conservative or rely on cooperation that does not occur. We propose RCRA, an online adaptation framework that modulates a learned residual around a frozen conservative navigation policy according to estimated pedestrian reactivity. A Transformer-based estimator infers latent pedestrian reactivity from motion histories and robot context, providing a more accurate signal for navigation adaptation and improving scenario-averaged simulation accuracy by $12.62$ percentage points over the Bayesian baseline, which assumes known pedestrian goals. These estimates are spatially aggregated into an adaptation scale that gates LoRA modules, enabling cooperative behavior near reactive pedestrians and conservative behavior near non-reactive pedestrians. Among baselines achieving SR above $90\%$ in every scenario, RCRA reduces scenario-averaged path length by $16.7\%$ relative to the conservative backbone and by $7.3\%$ relative to randomized-training baselines. It improves mean SR by $14.88$ percentage points over the reactive-trained policy.

cs.RO↗

Explicit construction of optimal binary linear complementary pairs via Belov codes

The study of linear complementary pairs (LCPs) has been a hot topic in coding theory. Recently, Güneri constructed an infinite family of optimal binary LCPs from Solomon-Stiffler codes. Specifically, he proved that for every $k \geq 5$ and $d \geq \lceil (k - 1)/2 \rceil 2^{k - 1}$, there exist optimal binary linear complementary pairs of codes of length $g_2(k,d)$, where $g_2(k,d)$ denotes the Griesmer bound. In this paper, we construct additional optimal binary LCPs from Belov codes, which form a generalized class of Solomon-Stiffler codes. Our results not only generalize Güneri's construction, but also enable more flexible construction of optimal binary LCPs with a wide range of minimum distances.

cs.IT↗

SurgCast: Action-Conditioned Future Skeletons for Controllable Surgical World Models

Surgical world models must turn prospective robot actions into visually faithful, structurally consistent instrument motion. We introduce SurgCast, which predicts future instrument skeletons from current structure, robot state, and future actions, then uses the forecast to control video generation. Dual-path injection combines skeleton geometry with derived, instrument-specific motion descriptors through geometric residuals and conditioning modulation. Both paths complement native action conditioning and are retained in a four-step causal student. On SutureBot and SRTH-Porcine-Cholei, the teacher and student improve all seven reported quality and instrument-consistency metrics over their respective direct-action baselines; teacher FVD decreases by 37.6% and 67.3%. Ablations show that future actions improve skeleton prediction and that combining both injection paths performs best across all six metrics under predicted skeletons. These results support using predicted articulated structure and its motion semantics as a control interface for surgical video prediction. Project videos and examples are available at https://surgcast.netlify.app/.

cs.CV↗

Interpretation of chirality imprinted on photoelectron momentum spectra by three-dimensional light fields

Synthetic three-dimensional (3D) light fields provide a new route to imprinting chirality on achiral matter through light--matter interaction. Although previous work has numerically demonstrated that chirality can be imprinted on the photoelectron momentum spectrum of atoms, a transparent analytical physical picture that links the structure of the driving field to the chirality of the spectrum is still an open question. Here, using frequency-domain theory based on nonperturbative quantum electrodynamics (QED), we demonstrate that this chirality originates from coherence between adjacent quantum transition channels. We further find that a symmetry transformation introduces into the coherence term a symmetry-breaking phase shift ($Φ_{\mathrm{SBPS}}$), which can be tuned by varying the laser-field parameters to preserve or break the corresponding symmetry in the spectrum. Once all such symmetries are broken, the momentum spectrum becomes chiral. In particular, for the noncollinear two-color 3D light field considered here, the spectrum is chiral for even $f=ω_2/ω_1$ and achiral for odd $f$. Our results provide a microscopic interpretation of chirality imprinting and establish a framework for predicting and controlling chiral electron wave packets with synthetic 3D light fields.

physics.atom-ph↗

Simulate Before You Scale: High-Fidelity LLM Inference Planning Without GPUs

Deploying large language model (LLM) inference at scale requires jointly selecting hardware layout, parallelism strategy, scheduling policy, admission control, and request routing to meet latency and throughput targets. These choices interact: a routing decision that improves cache locality can concentrate load, and an admission threshold that triggers only at saturation allows queues to grow deep enough to degrade critical-tier traffic. Evaluating candidates on GPU clusters is too expensive for iterative exploration, yet existing predictive tools either ignore batching and queueing dynamics or model only fragments of the pipeline. In this paper, we present BLIS, a deterministic, CPU-only discrete-event simulator that models the full inference serving pipeline (admission, routing, scheduling, prefill/decode execution, KV-cache management, and preemption). BLIS pairs analytical basis functions with learned scaling coefficients and overhead terms, fit once globally, to predict step latency without per-model or per-GPU profiling. Across 36 experiments spanning six models and three GPU types, BLIS achieves 6.7% median end-to-end error while running around 200 times faster than real execution. In a configuration search over 420 serving configurations for Llama-2-70B, BLIS identifies a 4-GPU deployment that meets a 300ms mean TTFT service-level objective (SLO), whereas competing tools either require double the GPUs or recommend configurations that fail under load. Two policies evolved entirely in simulation were validated on real hardware and merged into llm-d, a widely adopted open-source platform for distributed LLM serving: an admission policy that reduces critical-tier TTFT P90 by up to 82%, and a flow-control policy that reduces E2E P50 latency by 32-48% on overloaded workloads.

cs.PF↗

Prospects for geoneutrino detection with JUNO

Geoneutrinos, which are antineutrinos emitted during the decay of long-lived radioactive elements inside Earth, serve as a unique tool for studying the composition and heat budget of our planet. The Jiangmen Underground Neutrino Observatory (JUNO) experiment in China, which has recently completed construction, is expected to collect a sample comparable in size to the entire existing world geoneutrino dataset in less than a year. This paper presents an updated estimation of sensitivity to geoneutrinos of JUNO using the best knowledge available to date about the experimental site, the surrounding nuclear reactors, the detector response uncertainties, and the constraints expected from the TAO satellite detector. To facilitate comparison with present and future geological models, our results cover a wide range of predicted signal strengths. Despite the significant background from reactor antineutrinos, the experiment will measure the total geoneutrino flux with a precision comparable to that of existing experiments within its first few years, ultimately achieving a world-leading precision of about 8% over ten years. The large statistics of JUNO will also allow separation of the Uranium-238 and Thorium-232 contributions with unprecedented precision, providing crucial constraints on models of formation and composition of Earth. Observation of the mantle signal above the lithospheric flux will be possible but challenging. For models with the highest predicted mantle concentrations of heat-producing elements, a 3-sigma detection over six years requires knowledge of the lithospheric flux to within 15%. Together with complementary measurements from other locations, the geoneutrino results of JUNO will offer cutting-edge, high-precision insights into the interior of Earth, of fundamental importance to both the geoscience and neutrino physics communities.

hep-ex↗

Pseudowords as probes: Large Language Models show little of the sublexical sensitivity that governs human pseudoword processing

Systematicity, the probabilistic mapping of form to meaning, permeates language at all levels, and sublexical cues have been shown to govern human pseudoword processing. Yet whether LLMs exhibit comparable sensitivity to these cues remains unclear. We tested five LLMs on two Italian two-alternative forced-choice pseudoword experiments and compared their responses with a human behavioural baseline. LLMs aligned more reliably with humans when real-word options provided a lexical familiarity cue than in the pseudoword-only condition, where they fell substantially below fastText, a character-n-gram model. In addition, the sublexical cosine-similarity cue that reliably drove human--fastText agreement did not consistently transfer to human--LLM alignment, and reasoning-token expenditure bore no consistent relation to human processing difficulty. These findings suggest that LLMs do not necessarily share the sublexical cues that govern human pseudoword processing; we discuss tokenization and training-data coverage as candidate explanations.

cs.CL↗

An Improved Upper Bound for the Random-Offerer Mechanism in Bilateral Trade via Recursive Hard Instances

We study the worst-case efficiency of the random-offerer mechanism in bilateral trade relative to the first-best gains from trade. We construct a family of independent buyer value and seller cost distributions whose ratio converges to $0.436943488\ldots$, improving the previous upper bound of $0.460242308\ldots$. Our construction combines recursively nested seller distributions with downward transport of buyer values. The recursive structure allows contributions from different scales to accumulate, leading to stronger hard instances. We analyze this construction through a recurrence and obtain an analytic characterization of the limiting constant.

cs.GT↗

Factor Model Estimation for High-Dimensional Time Series with Heteroskedastic Noise

Factor modeling provides a framework for extracting common components from high-dimensional time series. We develop an estimator of the factor loading space that combines contemporaneous covariance with lagged autocovariance information. Under cross-sectionally heteroskedastic white noise, the contemporaneous covariance contains heterogeneous diagonal noise contributions. We apply the existing HeteroPCA algorithm to the combined estimation matrix to correct this contamination while retaining information from serial dependence. The framework also accommodates noise contamination on a known set of entries subject to sparsity and incoherence conditions. Under regularity conditions for dependent observations, we establish consistency and derive convergence rates, identifying regimes in which incorporating contemporaneous covariance improves the rate relative to the lagged-autocovariance estimator. Simulations evaluate loading-space estimation error and the effects of contemporaneous covariance inclusion and diagonal correction. An application to S\&P 500 stock returns illustrates the method.

stat.ME↗

LabInstruct: Benchmarking Situated Instructional Video Generation for Lab Procedures

Self-driving laboratories (SDLs) aim to automate the full experimental loop, from scientific decision-making to physical execution. Ideally, AI-generated plans could be carried out directly by robotic systems, but reliable automation remains difficult in complex, open-world laboratory environments, where experiments often involve fine-grained manipulation, long-horizon procedures, and substantial variation across tasks and setups. Humans therefore remain an important execution interface between AI-generated plans and physical experiments, creating a need for clear and effective human-facing experimental guidance. Because laboratory procedures are inherently visual, spatial, and dynamic, video is particularly well suited to communicating apparatus configurations, manipulation actions, temporal dependencies, and state changes. Recent advances in video generation now make it possible to synthesize experimental demonstrations directly from an initial workspace image and a natural-language instruction. However, whether such models can reliably communicate real laboratory procedures has not been systematically studied. We introduce LabInstruct, a benchmark for situated instructional video generation in real laboratories. LabInstruct contains 204 tasks across 5 scientific disciplines, with real reference executions and structured annotations of objects, actions, contacts, and state transitions. Evaluating 8 frontier image-to-video models, we find that visually plausible generations frequently remain procedurally incorrect, revealing a substantial gap between visual realism and the reliability required for experimental instruction.

cs.RO↗

Subject-Invariant Cross-Modal Decoding of Perceived Speech from Brain Recordings

Perceived speech decoding based on non-invasive brain-computer interface (BCI) signals has been extensively studied in recent years. Research in this field primarily faces two challenges: extracting neural representations with rich spatiotemporal information and achieving cross-subject generalization. Although separate studies have proposed methods to cope with these issues, a unified approach that simultaneously tackles both challenges remains lacking. To fill this gap, we propose the Subject-Invariant Cross-Modal Perceived Speech Decoding (SICMD) method, which integrates functional magnetic resonance imaging (fMRI) and magnetoencephalography (MEG). We conduct comprehensive analyses of the fusion method, fusion position, encoder architecture, and model inputs. Our results demonstrate that the proposed method improves Top-1, Top-10, and Rankacc by more than 10.6%, 10.1%, and 1.7%, respectively, compared to baseline methods in cross-subject perceived speech decoding tasks, while reducing training costs by 88.8% and 60.5% compared to multi-subject and intra-subject decoding settings. Further visualization experiments also confirm the effectiveness of our approach.

cs.SD↗

SHINE: Sequential Hierarchical Integration Network for EEG and MEG

How natural speech is represented in the brain constitutes a major challenge for cognitive neuroscience. Reconstructing the speech envelope and Mel spectrogram from EEG and MEG provides a time-resolved way to study its temporal and spectral structure. Speech-related neural activity spans sensors and temporal scales; extracting these representations while adapting the use of context to each acoustic target is a central problem in speech reconstruction. We propose SHINE, a Sequential Hierarchical Integration Network for EEG and MEG. A residual sensor adapter unifies input dimensions, intermediate dilated-block states retain temporal depth, and a target- and time-dependent gate fuses local hierarchical and attention-enhanced context predictions. Across two EEG and two MEG datasets, SHINE has the highest mean envelope and mean-Mel Pearson correlations among nine local baseline implementations on all eight dataset-metric combinations. SHINE also placed second in the speech-detection Extended Track of the NeurIPS 2025 PNPL Competition. Code will be released at https://github.com/xuxiran/SHINE.

cs.SD↗

Adaptive Forgetting for Nonstationary Optimization: Towards Robust EEG Decoding

Electroencephalography (EEG) provides non-invasive monitoring of brain activity and is widely used in emotion recognition, motor imagery and sleep staging. Although within-subject decoding has achieved considerable progress, cross-subject generalization remains a central challenge in practical applications. EEG decoders are typically trained with Adam/AdamW under a fixed second-moment decay coefficient, even though cross-subject learning involves low signal-to-noise ratios, subject variability, and gradient nonstationarity. A fixed coefficient implicitly assumes that gradient statistics are homogeneous across layers and time, which can limit model's adaptability to cross-subject EEG signals and degrade generalization. To address these issues, we propose AFOR, a tensor-wise adaptive optimizer that converts the fixed second-moment decay coefficient into a dynamic coefficient estimated online from local gradient state. AFOR combines a Residual-Alignment Signal Scorer (RASS) and an Adaptive Forgetting Controller (AFC). RASS summarizes local gradient residuals and directional agreement into a signal-quality score, and AFC maps this score through self-referential normalization to a bounded per-step decay coefficient, with cumulative-product initialization correction maintaining consistency under time-varying decay. Under a strict cross-subject protocol on three EEG benchmarks that cover three representative fields, AFOR achieves the best average performance among the compared optimizers, improving the mean test accuracy over Adam by 3.00%, 2.07%, and 4.38%, respectively.

cs.LG↗