Searcharxiv⌕ Search

arXiv subjects

Yang Jiao

Publications and source records attributed to Yang Jiao.

At least 19 recordsLinked to original sources
arXiv2026

NCP-ArchPreview Technical Report: Moving towards Latent Space Language Models through Next Concept Prediction

We introduce NCP-ArchPreview, a latent-space language model that pushes autoregressive pretraining beyond standard next-token prediction (NTP). Alongside NTP, the model learns through Next Concept Prediction (NCP) to predict discrete concepts that span multiple tokens, introducing an explicit and more challenging concept-level objective while preserving standard token-level autoregressive generation. NCP-ArchPreview builds a latent space by constructing a product-quantized concept vocabulary directly from its hidden states, and subsequently learns to predict future concepts via a dedicated Concept Module. These predicted concepts are then fed back to the token level to guide subsequent generation, with NTP and NCP trained jointly end-to-end. We scale this architecture to 8.9B parameters and train it on 5.73T tokens from the Dolma-3 dataset, marking the largest demonstration of a latent-space language model to date. Remarkably, by consuming only 51.3% of the total training tokens, NCP-ArchPreview achieves the final pretraining loss of OLMo-3-7B. Following full pretraining, it outperforms OLMo-3-7B by 2.45 points on the downstream macro-average, including a notable 5.99-point gain on GSM8K. Controlled experiments isolate a clear progression of performance gains stemming from both the latent architecture and the NCP objective. Furthermore, utilizing only 85% of the standard computation, NCP-ArchPreview approaches the training loss of a strictly parameter-aligned 8.9B baseline. The learned latent space remains highly valuable after the pretraining stage: updating just the 17M-parameter VQ module yields a novel, lightweight interface for domain adaptation, while a simple injection of concept representations into a DFlash2 drafter improves the mean accepted length by 4.17% with negligible overhead.

cs.CL↗
arXiv2026

First-order Constrained Trilevel Optimization Over Distributed Networks for Robust Coreset Selection

With the rapid advancement of the Internet of Things (IoT), massive amounts of data are generated across distributed edge networks. Training models on full data incurs significant computational overhead and storage bottlenecks, rendering coreset selection a critical paradigm. Furthermore, given the privacy-sensitive nature of local data and the escalating demand for model robustness in real-world deployments, developing an effective distributed optimization framework for robust coreset selection is vital, yet remains largely unexplored. To this end, this work first characterizes the hierarchical dependencies among coreset selection, robust optimization, and distributed learning, and formulates the distributed robust coreset selection as a trilevel optimization problem with level-wise constraints. Furthermore, to effectively solve the trilevel problem in a distributed manner, the \underline{F}ederated \underline{F}irst-order \underline{C}onstrained \underline{T}rilevel \underline{O}ptimization (F$^2$CTO) is proposed, which synergistically integrates a hierarchical composite value-function reformulation and a distributed alternating projected gradient algorithm. To the best of our knowledge, F$^2$CTO is the first method developed for distributed robust coreset selection, as well as the first distributed optimization approach for trilevel optimization problems with level-wise constraints. Additionally, we prove that the proposed method achieves a non-asymptotic convergence rate of $\mathcal{O}(\epsilon^{-3/2})$ for finding an $\epsilon$-stationary point. Extensive empirical evaluations on reliable continual learning demonstrate the effectiveness and efficiency of the proposed F$^2$CTO.

cs.LG↗
arXiv2026

When Derived Measurements Mislead: Quantifying and Mitigating LLM Over-Trust with Privileged-Modality Reliability Evidence

Derived measurements increasingly enter large language model (LLM) pipelines as direct facts despite their instance-dependent validity. We define derived-feature over-trust (DFOT) as the failure in which a downstream LLM assigns such a measurement the epistemic status of a direct fact or uses it outside its valid scope. Using physiological sensing as a case study, D1 tests acceptance of a PPG-derived rhythm contradicted by offline ECG, whereas D2 tests rejection of an offline-confirmed reliable PPG rhythm under misleading severe history. ECG supplies training supervision and offline reference construction but is never shown to the LLM. Five estimands quantify this chain: conflict over-trust rate (COTR) and context-induced error rate (CIR) characterize D1/D2; correct repair rate (CRR) measures frozen-error repair; evidence-specific repair margin (ESRM) contrasts matched and patient-disjoint shuffled evidence; and utility harm rate (UHR) measures unnecessary verification among HIGH-reliability cases used without verification at baseline. The framework does not depend on a particular reliability generator. We demonstrate it on 50,000 paired PPG-ECG records using ECG-to-PPG privileged distillation as an illustrative baseline and PPG-only inference. On a protocol-locked 187-patient test, the baseline improves four repair and specificity endpoints by 1.82-6.69 percentage points, with all paired confidence intervals excluding zero; UHR increases by 0.67 percentage points (95% CI: -0.4 to +1.7). DFOT provides a common evaluation target for stronger mitigation methods. The code is available at https://github.com/Zongheng-Guo/When-Derived-Measurements-Mislead.

cs.AI↗
arXiv2026

Response-Selected Hidden Hyperuniformity in Hydrodynamic Active Matter

Hyperuniformity in active matter is usually treated as a property of a prescribed density or continuum field. This view misses a basic feature of hydrodynamic active matter: an incompressible fluid does not respond equally to every microscopic force. Longitudinal forcing is absorbed into pressure, whereas transverse forcing drives flow. The relevant question is therefore not only whether particles are uniformly arranged or whether the total activity is small, but which sector of the active forcing is selected by the physical response. Here we introduce response-selected hyperuniformity, in which long-wavelength order is a property of a source-response pair. In a reversible valence-one fluid with no prescribed partners, locally neutral clusters screen the signed active-moment sector that controls transverse flow, producing a first-moment spectrum that vanishes quadratically at low wavenumber. Locally unscreened moments instead generate a nonzero infrared plateau. The resulting transverse-force spectrum has a universal crossover from fourth- to sixth-order scaling, with the crossover set by the ratio of the unscreened residual to the screened analytic contribution. Complete partner renewal preserves this normal form, establishing exchangeable multipole inheritance, while turnover tunes the residual through an independently measured local defect density. The zero-residual limit yields strictly hyperuniform velocity fluctuations; any finite residual causes defect-controlled infrared leakage and sets a finite screening length. Thus microscopic exchange need not destroy hidden hyperuniform flow order, but rare unscreened moments determine how far the quiet-flow regime survives.

cond-mat.soft↗
arXiv2026

Equilibrium analysis of three-player General Lotto game with leader-follower framework

In this paper, we introduce the General Lotto game with a regulator (R-Lotto), a leader-follower extension of the classical two-player General Lotto game. The model captures regulatory interventions in competitive resource allocation, where a regulator first chooses an intervention parameter to influence the subsequent competition between two resource-constrained followers. The intervention parameter represents favoritism toward one of the followers, and the followers then play a general Lotto subgame with favoritism. We derive the followers' equilibrium payoff and characterize the Nash--Stackelberg equilibrium (NSE) intervention of the regulator. We further develop a multi-battlefield R-Lotto model with a regulator budget constraint. In this setting, the follower subgames on different battlefield is decoupled, while the regulator's intervention decisions are coupled through a common budget. Numerical simulations demonstrate the proposed equilibrium characterizations and provide practical decision-making guidance for the regulator.

cs.GT↗
arXiv2026

Ordinary Disordered Materials Can Carry Hyperuniform Physical Fields

Fluctuations in disordered matter play a central role in determining material properties and physical responses. Recent studies have identified an exotic class of systems known as structurally hyperuniform materials, in which large-scale density fluctuations are anomalously suppressed through special spatial organization of particles, phases, or microstructural features. Here we demonstrate that ordinary, structurally nonhyperuniform disordered materials can nevertheless support hyperuniform physical scalar, vector, and tensor fields such as charge, bound current, vorticity, defect density, and stress. We develop a general theoretical framework in which a physical field is generated from a more primitive parent field through a local physical operator. In Fourier space, the spectrum of the derived field is determined by the product of the parent-field spectrum and the Fourier symbol of the operator. When the operator embodies a local gauge-like constraint, its Fourier symbol possesses zeros at small wavenumber, eliminating the corresponding long-wavelength fluctuations. As a consequence, the derived field exhibits complete suppression of infinite-wavelength intensity fluctuations, irrespective of the large-scale disorder and nonhyperuniformity of the parent field. We demonstrate this mechanism in elastic, electrostatic, and magnetostatic settings, showing that operator-generated incompatibility, bound charge, and bound-current fields can become hyperuniform even when their parent eigenstrain, polarization, or magnetization fields remain conventionally disordered. These findings broaden the notion of hyperuniformity from a structural property of matter to a universal field phenomenon generated by local physical constraints.

cond-mat.mtrl-sci↗
arXiv2026

Spectral Leakage and Masking Effects in the Measurement of Hyperuniformity

The detection of hyperuniformity relies critically on accurate characterization of the small-wavenumber behavior of the static structure factor of the system. In practice, however, measurements are performed on finite subsystems or through incomplete observations that effectively mask portions of the underlying configuration. Inspired by a recent numerical study [Y. Liu, X. Li, J. Tian, X. Yan, G. Zhang, {\it J. Chem. Phys.} {\bf 164}, 094102 (2026)], we develop a unified theoretical framework that quantifies how finite windows and spatially correlated binary masks modify the observed structure factor. We show that the measured structure factor $S_{obs}(k)$ is the convolution of the intrinsic structure factor with the spectral density of the observation function, whether it is a compact window or an extended random mask. For generic hyperuniform systems with small-$k$ scaling $S(k)\sim k^{\alpha}$, finite observation window induces a universal quadratic leakage term at sufficiently small wavenumbers (i.e., $k \lesssim 1/L$), leading to an apparent $k^{2}$ scaling independent of the true exponent. The true hyperuniform exponent $\alpha$ can only be measured in the intermediate regime $1/L \ll k \ll q_c$. In stealthy hyperuniform systems, where the intrinsic structure factor possesses a spectral gap, all observed small-$k$ power arises entirely from this convolution mechanism. For spatially correlated masks, we derive the corresponding convolution relation in terms of the mask spectral density and identify conditions under which hyperuniform signatures are suppressed, preserved, or distorted. Our results establish quantitative criteria for reliably extracting intrinsic scaling exponents and distinguishing genuine hyperuniform order from measurement-induced artifacts.

cond-mat.soft↗
arXiv2026

Adaptive Inference-Time Scaling via Early-Step Latent Verification for Image Editing

Instruction-based image editing has made notable progress with recent advances in generative models. However, the quality of the edited result is still influenced by the randomly sampled initial noise, particularly in complex editing scenarios. An unsuitable initial noise may lead to unsatisfactory editing results. Recent inference-time scaling methods address this issue by sampling multiple initial noises and selecting better candidates. Nevertheless, most of them follow a decode-then-verify scheme which introduces an efficiency-accuracy trade-off. When decoding is performed after limited inference steps, the decoded images often remain too noisy for reliable assessment, whereas sufficiently denoised images require much higher computational cost. To address this issue, we propose VeriLatent, a plug-and-play adaptive inference-time scaling framework with early-step latent verification for image editing. Specifically, we propose a novel verifier that scores each initial noise through a latent-space editing activation map at an early stage. It identifies promising candidates by assessing whether they can induce an effective edit in the correct region. This enables efficient early pruning without decoding latents into images. Building on this, we further develop an adaptive search strategy for inference-time scaling. It allocates inference budgets according to editing difficulty, thereby reducing the number of function evaluations (NFE). Extensive experiments on multiple benchmarks and different base models demonstrate that VeriLatent consistently improves both editing performance and inference-time scaling efficiency.

cs.CV↗
arXiv2026

3SPO: State-Score-Supervised Policy Optimization for LLM Agents

Training large language models (LLMs) as autonomous agents via reinforcement learning (RL) has enabled frontier models to achieve superhuman performance in long-horizon tasks. However, existing RL algorithms operate at the trajectory level, performing policy optimization only after collecting complete episode rollouts. This coarse-grained approach faces fundamental challenges in multi-turn agent settings where rewards are sparse, delayed, and credit assignment across individual steps is critical. In this work, we propose \textbf{State-Score-Supervised Policy Optimization (3SPO)}, a novel RL algorithm that performs post-step policy optimization with dynamic state score supervision. At each step, 3SPO computes the state score based on historical success rates, supervising step-wise credit assignment, adaptive rollout and post-step policy optimization without requiring value function estimation or additional auxiliary models. Theoretically, under a per-state bandit abstraction, we show that the proposed score-supervised allocation mechanism achieves logarithmic allocation regret and provide sample-complexity guarantees for action identification, score distinguishability, and filtering stability. Experiments on ALFWorld and WebShop with Qwen2.5-1.5B/7B-Instruct show that 3SPO consistently outperforms GRPO by $+22.6\%$ on ALFWorld and $+15.6$ points on WebShop, while using comparable resources to achieve $2.4\times$ more state exploration and $1.8\times$ faster convergence. Code is available at https://github.com/genalyu/3SPO.

cs.LG↗
arXiv2026

SpatialImaginer: Towards Adaptive Visual Imagination for Spatial Reasoning

Spatial intelligence, which refers to the ability to reason about geometric and physical structure from visual observations, remains a core challenge for multimodal large language models. Despite promising performance, recent multimodal large language models (MLLMs) often exhibit fragile reasoning traces in spatial intelligence tasks that involve consistent spatial state recognition. We argue that these failures stem from a mismatch between the spatial recognition mechanism and the text-only reasoning behavior of these MLLMs. Effective spatial reasoning requires low-level geometric structure to be faithfully preserved and updated throughout the reasoning process, whereas textual representations tend to abstract away precisely these critical details. To address this issue, we propose SpatialImaginer, a unified multimodal generation framework that integrates textual reasoning with visual imagination. Our framework adopts a divide-and-conquer strategy, using text chain-of-thought for high-level semantic planning and the visual imagination for geometry-sensitive state transformation and consistency preservation. To support this capability, we further introduce a difficulty-aware data engine with closed-loop verification to train the model to invoke visual imagination selectively when stable spatial state tracking is required. Extensive experiments on diverse spatial intelligence benchmarks show that SpatialImaginer achieves state-of-the-art performance and substantially improves robustness on complex multi-step spatial reasoning tasks.

cs.CV↗
arXiv2026

Reshaping Inclusive Interpersonal Dynamics through Smart Glasses in Mixed-Vision Social Activities

Meaningful social interaction is vital to well-being, yet Blind and Low Vision (BLV) individuals face persistent barriers when collaborating with sighted peers due to inaccessible visual cues. While most wearable assistive technologies emphasize individual tasks, smart glasses introduce opportunities for real-time, contextual support in social settings. To explore how smart glasses affect interpersonal dynamics and support inclusion in mixed-vision groups, we developed a smart glasses-based system, CollabLens, as a technology probe and employed it in four workshop sessions. We found that smart glasses can meaningfully support inclusive collaboration through expanding BLV participants' assistive networks with more flexible, independent access to visual information. While sighted participants viewed smart glasses as a promising medium that fosters interpersonal connection, they revealed uncertainty in adapting their helping behaviors. We concluded by discussing and synthesizing challenges and opportunities for designing smart glasses that provide seamless interaction experiences and enhance reciprocal mixed-vision social inclusion.

cs.HC↗
arXiv2026

TAFG-MAN: Timestep-Adaptive Frequency-Gated Latent Diffusion for Efficient and High-Quality Low-Dose CT Image Denoising

Low-dose computed tomography (LDCT) reduces radiation exposure but also introduces substantial noise and structural degradation, making it difficult to suppress noise without erasing subtle anatomical details. In this paper, we present TAFG-MAN, a latent diffusion framework for efficient and high-quality LDCT image denoising. The framework combines a perceptually optimized autoencoder, conditional latent diffusion restoration in a compact latent space, and a lightweight Timestep-Adaptive Frequency-Gated (TAFG) conditioning design. TAFG decomposes condition features into low- and high-frequency components, predicts timestep-adaptive gates from the current denoising feature and timestep embedding, and progressively releases high-frequency guidance in later denoising stages before cross-attention. In this way, the model relies more on stable structural guidance at early reverse steps and introduces fine details more cautiously as denoising proceeds, improving the balance between noise suppression and detail preservation. Experiments show that TAFG-MAN achieves a favorable quality-efficiency trade-off against representative baselines. Compared with its base variant without TAFG, it further improves detail preservation and perceptual quality while maintaining essentially the same inference cost, and ablation results confirm the effectiveness of the proposed conditioning mechanism.

cs.CV↗
arXiv2026

Percolation and Criticality in Hyperuniform Networks

Hyperuniform many-particle systems, which encompass crystals, quasicrystals and certain exotic disordered systems, exhibit an anomalous suppression of density fluctuations on macroscopic length scales relative to those of conventional disordered systems. Here we investigate the percolation behaviors of disordered stealthy hyperuniform systems (SHU), a subclass of hyperuniform configurations for which the structure factor vanishes for a finite range of wavevectors near the origin, with the degree of stealthiness controlled via a parameter $\chi$. We construct Delaunay triangulation networks derived from SHU configurations with varying $\chi$ as well as Poisson point configurations for the purpose of comparison. We investigate a non-uniform bond percolation process, in which bond occupation probabilities decrease with the Euclidean distance between the connected vertices. In this setting, percolation is induced by varying a tuning parameter $z$. We estimate the percolation thresholds $z_c$ and critical exponents of the networks via finite-size scaling and the Newman-Ziff algorithm. We find that SHU networks exhibit lower percolation thresholds than Poisson networks. Notably, the percolation threshold of SHU networks decreases with the stealthiness parameter $\chi$, indicating that global connectivity emerges more readily as short-range order increases. Moreover, we show that SHU networks with large $\chi$ belong to the same universality class as lattices, while Poisson and low-$\chi$ systems show deviations. We relate the shift in critical exponents to the degree of suppression of density fluctuations in the point configurations. Our work extends previous studies on transport properties of SHU systems from continuum two-phase media to networks. These results open new avenues for optimizing the resilience of statistically homogeneous disordered networks.

cond-mat.stat-mech↗
arXiv2026

STRUCTUREDAGENT: Planning with AND/OR Trees for Long-Horizon Web Tasks

Recent advances in large language models (LLMs) have enabled agentic systems for sequential decision-making. Such agents must perceive their environment, reason across multiple time steps, and take actions that optimize long-term objectives. However, existing web agents struggle on complex, long-horizon tasks due to limited in-context memory for tracking history, weak planning abilities, and greedy behaviors that lead to premature termination. To address these challenges, we propose STRUCTUREDAGENT, a hierarchical planning framework with two core components: (1) an online hierarchical planner that uses dynamic AND/OR trees for efficient search and (2) a structured memory module that tracks and maintains candidate solutions to improve constraint satisfaction in information-seeking tasks. The framework also produces interpretable hierarchical plans, enabling easier debugging and facilitating human intervention when needed. Our results on WebVoyager, WebArena, and custom shopping benchmarks show that STRUCTUREDAGENT improves performance on long-horizon web-browsing tasks compared to standard LLM-based agents.

cs.AI↗
arXiv2026

Pix2Key: Controllable Open-Vocabulary Retrieval with Semantic Decomposition and Self-Supervised Visual Dictionary Learning

Composed Image Retrieval (CIR) uses a reference image plus a natural-language edit to retrieve images that apply the requested change while preserving other relevant visual content. Classic fusion pipelines typically rely on supervised triplets and can lose fine-grained cues, while recent zero-shot approaches often caption the reference image and merge the caption with the edit, which may miss implicit user intent and return repetitive results. We present Pix2Key, which represents both queries and candidates as open-vocabulary visual dictionaries, enabling intent-aware constraint matching and diversity-aware reranking in a unified embedding space. A self-supervised pretraining component, V-Dict-AE, further improves the dictionary representation using only images, strengthening fine-grained attribute understanding without CIR-specific supervision. On the DFMM-Compose benchmark, Pix2Key improves Recall@10 up to 3.2 points, and adding V-Dict-AE yields an additional 2.3-point gain while improving intent consistency and maintaining high list diversity.

cs.CV↗
arXiv2026

BrainRVQ: A High-Fidelity EEG Foundation Model via Dual-Domain Residual Quantization and Hierarchical Autoregression

Developing foundation models for electroencephalography (EEG) remains challenging due to the signal's low signal-to-noise ratio and complex spectro-temporal non-stationarity. Existing approaches often overlook the hierarchical latent structure inherent in neural dynamics, leading to suboptimal reconstruction of fine-grained information. In this work, we propose BrainRVQ, a general-purpose EEG foundation model pre-trained on a large-scale corpus of clinical EEG data. Unlike standard masked modeling, BrainRVQ features a Dual-Domain Residual Vector Quantization (DD-RVQ) tokenizer that disentangles temporal waveforms and spectral patterns into hierarchical discrete codes. We further introduce a hierarchical autoregressive pre-training objective that learns to reconstruct these codes in a coarse-to-fine manner, utilizing an importance-guided curriculum masking strategy to prioritize information-rich neural events over background noise. Extensive experiments across 8 diverse downstream datasets demonstrate that BrainRVQ consistently outperforms state-of-the-art baselines, validating its effectiveness in learning robust and generalizable neural representations. Our code and model weights are available:https://github.com/keqicmz/BrainRVQ

eess.SP↗
arXiv2026

SIGMA-PPG: Statistical-prior Informed Generative Masking Architecture for PPG Foundation Model

Current foundation model for photoplethysmography (PPG) signals is challenged by the intrinsic redundancy and noise of the signal. Standard masked modeling often yields trivial solutions while contrastive methods lack morphological precision. To address these limitations, we propose a Statistical-prior Informed Generative Masking Architecture (SIGMA-PPG), a generative foundation model featuring a Prior-Guided Adversarial Masking mechanism, where a reinforcement learning-driven teacher leverages statistical priors to create challenging learning paths that prevent overfitting to noise. We also incorporate a semantic consistency constraint via vector quantization to ensure that physiologically identical waveforms (even those altered by recording artifacts or minor perturbations) map to shared indices. This enhances codebook semantic density and eliminates redundant feature structures. Pre-trained on over 120,000 hours of data, SIGMA-PPG achieves superior average performance compared to five state-of-the-art baselines across 12 diverse downstream tasks. The code is available at https://github.com/ZonghengGuo/SigmaPPG.

cs.LG↗
arXiv2025

Learning by Analogy: A Causal Framework for Composition Generalization

Compositional generalization -- the ability to understand and generate novel combinations of learned concepts -- enables models to extend their capabilities beyond limited experiences. While effective, the data structures and principles that enable this crucial capability remain poorly understood. We propose that compositional generalization fundamentally requires decomposing high-level concepts into basic, low-level concepts that can be recombined across similar contexts, similar to how humans draw analogies between concepts. For example, someone who has never seen a peacock eating rice can envision this scene by relating it to their previous observations of a chicken eating rice. In this work, we formalize these intuitive processes using principles of causal modularity and minimal changes. We introduce a hierarchical data-generating process that naturally encodes different levels of concepts and their interaction mechanisms. Theoretically, we demonstrate that this approach enables compositional generalization supporting complex relations between composed concepts, advancing beyond prior work that assumes simpler interactions like additive effects. Critically, we also prove that this latent hierarchical structure is provably recoverable (identifiable) from observable data like text-image pairs, a necessary step for learning such a generative process. To validate our theory, we apply insights from our theoretical framework and achieve significant improvements on benchmark datasets.

cs.LG↗