Searcharxiv⌕ Search

arXiv subjects

Tao Zhou

Publications and source records attributed to Tao Zhou.

At least 37 records · Page 2Linked to original sources

Amortized Filtering and Smoothing with Conditional Normalizing Flows

Bayesian filtering and smoothing are central to data assimilation in nonlinear dynamical systems. Recent advances in deep generative models provide flexible approximations of the associated non-Gaussian posterior distributions. However, several existing approaches require the score to be re-estimated or a transport map to be constructed at each assimilation step. We propose an amortized framework for filtering and smoothing that reuses trained conditional models across observation sequences and assimilation times. The framework jointly learns a shared recurrent summary network and two conditional normalizing flows from simulated state and observation trajectories. The recurrent network represents each observation history by a fixed-dimensional summary that conditions the filtering approximation and, together with the next state, the backward transition approximation. An information-theoretic analysis shows that, under the Markov assumption, a summary sufficient for filtering is also sufficient for the backward kernel. Combining the terminal filtering approximation with the backward kernels yields an approximate joint smoothing distribution. Numerical experiments on advection-diffusion, Burgers, and Lorenz systems demonstrate the accuracy of the proposed filtering and smoothing approximations and characterize the evolution of their errors beyond the training horizon.

stat.ML↗

Phonon-Bottleneck-Governed Ultrafast Hot-Carrier Super-Diffusion in Transition Metal Dichalcogenides

Two-dimensional transition metal dichalcogenides (TMDCs) are promising for low-power optoelectronics, yet their operational speed is widely considered constrained by low room-temperature mobilities and carrier transit delays. Here, by combining on-chip terahertz optoelectronic sampling with thermally evaporated Ohmic contacts, we eliminate external parasitic delays and directly capture the intrinsic interfacial photoresponse in unencapsulated TMDCs under zero bias. The devices achieve ultrafast relaxation lifetimes of 48.5 ps in MoS2/Au and 14.2 ps in MoSe2/Ag, translating to intrinsic 3-dB bandwidths of 4.4 GHz and 7.5 GHz, respectively. Spatial scanning and bias-dependent measurements show that this response is position-independent and bias-immune, ruling out conventional drift-limited transport and identifying hot-carrier super-diffusion driven by an interfacial electron temperature gradient as the operative mechanism. Furthermore, ultrafast pump-probe spectroscopy reveals that the macroscopic response time is quantitatively synchronized with the microscopic optical-to-acoustic phonon scattering lifetime governed by the intrinsic phonon bottleneck. Our findings establish phonon engineering as a viable paradigm to tailor non-equilibrium optoelectronic dynamics, offering a blueprint for zero-bias, ultrafast, self-powered devices.

cond-mat.mes-hall↗

AgenticGen: Reward-Guided Agentic Video Generation for Advertising

Advertising video generation is not only a video synthesis task, but also a product-conditioned reasoning problem whose success is measured by online business metrics. Recent video foundation models can generate realistic clips from multimodal conditions, yet they do not optimize how a product should be transformed into an effective advertisement or how future generation should be improved from online business feedback. To close this loop, we propose AgenticGen, a reward-guided agentic framework that decomposes advertising video generation into two trainable reasoning stages, strategy selection and draft generation, thereby exposing optimization targets that online business feedback can supervise. AgenticGen learns a performance-based reward from accumulated online feedback and a complementary rubric-based reward aligned with human quality standards, then uses them to supervise policy optimization. DPO first moves the agentic policies toward online preferences, and GRPO further refines both stages with process and outcome rewards. Offline experiments validate the reward models and successive policy optimization. Online A/B experiments in the TikTok advertising system show that AgenticGen after DPO and GRPO improves CTR by 2.72%, CVR by 2.63%, and Advv by 9.61% over the SFT baseline.

cs.CV↗

An OTFS Waveform-Based Delay-Doppler Domain Channel Measurement Method for High-Mobility Scenarios

Channel measurements are the prerequisite for applying emerging transmission technologies and designing communication systems. Conventional time or frequency domain channel measurement methods cannot directly obtain Doppler information induced by high-mobility scenarios. The channel spreading function (CSF) simultaneously captures delay and Doppler information while naturally characterizing the propagation environment in the delay-Doppler (DD) domain. However, DD domain channel measurement methods remain underexplored. This paper presents an orthogonal time frequency space (OTFS) waveform-based DD domain channel measurement method for high-mobility scenarios. A native OTFS waveform, employed as the sounding signal, is designed for the first time, and its sounding capability is comprehensively analyzed. Next, we detail the methodology of DD domain channel measurement, including synchronization and CSF estimation. To enhance measurement precision, a joint fractional delay and Doppler shift estimation algorithm is proposed, and the overall performance of the proposed method is evaluated. Subsequently, a practical DD domain channel measurement system is established, followed by system calibration and verification. Finally, DD domain channel measurements are conducted in vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) scenarios. Measurement results, including the CSF and other small-scale fading characteristics, confirm the effectiveness of the proposed method and offer valuable insights for advancing research on high-mobility communications.

eess.SP↗

Extreme mass-ratio inspirals around rotating accelerating black holes

Extreme mass-ratio inspirals (EMRIs) can magnify small departures from Kerr dynamics into appreciable gravitational-wave phase shifts accumulated over many orbital cycles. We exploit this sensitivity to investigate the imprint of a rotating black hole's acceleration on an EMRI waveform. The spinning C metric poses two obstacles to the standard Kerr flux framework: the spacetime is not asymptotically flat, and the acceleration breaks the reflection symmetry that supports exactly equatorial circular timelike orbits. For sufficiently small acceleration $AM$, we therefore formulate the calculation in an intermediate Kerr-like wave zone satisfying $M/r\ll1$ and $Ar\ll1$, and construct a near-equatorial circular orbit by examining its coupled radial--polar stability. We derive the separated point-particle source for the spin$-2$ radial Teukolsky equation, construct a regular normalized angular solution, solve the radial equation using the Sasaki--Nakamura transformation and the Green function method, and couple the resulting horizon and far-zone fluxes to the adiabatic evolution of stable near-equatorial circular orbits. The framework recovers the Kerr limit and reproduces the dominant $l=2$ Kerr fluxes with relative errors of order $10^{-7}$. Acceleration modifies both radiation reaction and the orbital frequency, producing a characteristic nonmonotonic accumulated dephasing. For $M=10^6M_\odot$, $m_s/M=10^{-5}$, $a/M=0.7$, and $AM=3\times10^{-7}$, the dominant-mode dephasing slightly exceeds $1$ rad over one year. Thus even weak acceleration can generate an order-radian secular phase imprint on long-duration EMRIs within the controlled regime of the present approximation.

gr-qc↗

Large Language Models at the Intersection of Software Engineering and Software Security:An Evidence-Centered Structured Survey and Research Agenda

Large Language Models (LLMs) are moving from code completion toward repository-scale agents that retrieve context, edit files, execute tools, and participate in security-sensitive workflows. The evidence for these systems, however, remains divided between software engineering evaluations centered on functional task completion and software security evaluations centered on vulnerability detection, secure generation, or exploit-oriented validation. This evidence-centered structured survey synthesizes representative work available through May 31, 2026 across software engineering tasks, software security tasks, adaptation mechanisms, artifact granularity, and evaluation design. In addition to a task taxonomy, we introduce an assurance framework that separates functional correctness, security, operational reliability, evidence provenance, and agent authority. The review shows that execution feedback and repository access can substantially improve engineering task completion, but do not by themselves establish security; conversely, static-analysis labels or vulnerability-classification scores rarely establish deployable correctness. We identify recurring validity threats--weak test oracles, duplicated and temporally leaked data, changing agent harnesses, proxy-only security checks, and under-reported budgets and human intervention--and derive a minimum reporting protocol for cross-study comparison. The resulting research agenda prioritizes jointly secure-and-functional benchmarks, repository-scale threat models, calibrated human oversight, longitudinal maintainability evidence, and reproducible agent evaluation. The central conclusion is that model capability should be judged as an assurance case supported by task-appropriate evidence, rather than by a single benchmark score.

cs.AI↗

The Third Restructuring of Software Form: From the Three-Tier Architecture to Storage, Models, and Agents

Software form has undergone two paradigm shifts since its inception: Software 1.0, in which instructions determine behavior, and Software 2.0, in which data determines behavior (machine learning). This paper argues that a third shift - Software 3.0, in which context and reasoning determine behavior - is now underway, and contends that its terminal form converges to three elements: a generalized database (the unified abstraction of all persistent state and memory), a large model (the intelligence core that performs reasoning and generation), and an agent (the execution loop connecting the first two). The core argument is as follows: in the traditional three-tier architecture, the user-interface layer will be absorbed by the model's ability to generate interfaces on demand, the business-logic layer will be re-partitioned along "expressibility x criticality" into model reasoning and storage constraints (with residual deterministic logic retained as tools), and only the data layer will be elevated into the sole persistent infrastructure. We formalize this convergence thesis, present a minimal reference architecture, report evidence from real prototypes and a live model, and systematically analyze both the conditions under which it holds and the boundaries where it fails - determinism, cost, security, and verifiability delimit the thesis's domain of applicability. We argue that the thesis holds in task domains that are expressible, verifiable, externally stateful, and tool-complete, and that it will reshape the roles of developers, the database industry, and the software-engineering discipline.

cs.AI↗

A semi-generating function approach to the stability of implicit-explicit multistep methods for nonlinear parabolic equations

The rigorous stability analysis of high-order implicit-explicit linear multistep (IELM) methods for nonlinear parabolic equations by using discrete energy arguments is a long standing open issue due to their non-A-stability property. A novel semi-generating function approach combined with a global discrete energy analysis is suggested for the stability and convergence of general IELM methods in solving nonlinear parabolic equations. Inspired from the Grenander-Szegő theorem for Toeplitz matrices, the semi-generating function approach is used to handle the three groups of discrete coefficients via three complex polynomials on the unit circle. A unified theoretical framework is then presented to establish the unconditional stability of IELM methods if the minimum eigenvalue of composite convolution kernels for the implicit part is properly large and the spectral norm bound of composite convolution kernels for the explicit part is properly small. An indicator, called implicit-explicit controllability intensity, is then introduced to evaluate the degree of controllability of the implicit part over the explicit part. Some of the existing IELM methods, up to fifth-order time accuracy, are revisited and compared by computing the associated implicit-explicit controllability intensities such that one can choose an IELM method or proper parameter to maintain the unconditional stability for a specific nonlinear parabolic model. We also propose a new parameterized class of IELM methods, up to the ninth-order time accuracy, which satisfy the a priori settings of our theory and have a large value of the implicit-explicit controllability intensity by choosing a proper parameter so that they would be well suited for a wide class of nonlinear parabolic problems.

math.NA↗

Economic Distance Structures Urban Mobility in 109 U.S. Cities

Urban mobility promises social integration, yet daily movement is systematically constrained by socioeconomic hierarchies. Introducing "economic distance"--the continuous income gap between origin and destination--as a unified lens, we analyze large-scale mobility records across 109 U.S. cities to reveal how urban flows are structured. We identify a universal structural boundary: flows concentrate intensely within a narrow economic distance of 0.25 quantiles, defining the effective "economic radius" of routine mobility. This boundary exhibits profound asymmetry; upward mobility faces a uniform structural ceiling across cities, whereas downward mobility drives cross-city heterogeneity. Mechanistically, the boundary is physically anchored by meso-scale residential clustering but is further tightened by an independent economic-distance friction, validated via gravity modeling. These interactions yield four distinct mobility regimes, with "affluent-confined" systems exhibiting the strongest stratification. These findings establish economic distance as a fundamental, asymmetric, and multi-scale filter shaping urban inequality, offering new theoretical grounds for interventions targeting structural barriers to cross-class interaction.

physics.soc-ph↗

Embodied Multimodal Grounding for Open-Vocabulary Mobile Manipulation via Semantic 3D Gaussian Splatting

Embodied mobile manipulation requires language, visual observations, three-dimensional scene structure, and action feasibility to be aligned before execution. We study open-vocabulary target grounding with few-shot manipulation in local household workspaces and present an embodied multimodal grounding framework that integrates active multi-view Semantic 3D Gaussian Splatting (Semantic-3DGS), reachability-aware base positioning, and a diffusion-based vision-language-action policy. A task-driven local Semantic-3DGS serves as a shared interface across active sensing, language-conditioned 3D localization, obstacle-aware scene reasoning, base preparation, and semantic conditioning of the action model. To preserve pretrained action priors, the 3D semantic cues are injected only into the late action-expert blocks. In expanded 50-trial real-robot evaluations against representative vision-language-action (VLA) approaches, the full system achieves 60% long-horizon success compared with 40% for PointVLA and 28% for DexVLA, and reaches 74% success in heavily cluttered manipulation compared with 52% for the single-view variant and 46% for PointVLA. It also maintains 75% success under a 75 cm height shift and eliminates photo-induced false grasps. These results indicate that explicit, refreshable 3D semantic grounding can improve robustness under clutter, occlusion, viewpoint variation, and embodiment constraints.

cs.RO↗

Functional normalizing flow for statistical inverse problems of partial differential equations

Inverse problems of partial differential equations are ubiquitous across various scientific disciplines and can be formulated as statistical inference problems using Bayes' theorem. To address large-scale problems, it is crucial to develop discretization-invariant algorithms, which can be achieved by formulating methods directly in infinite-dimensional space. We propose a novel normalizing flow based infinite-dimensional variational inference method (NF-iVI) to extract posterior information efficiently. Specifically, by introducing well-defined transformations, the prior in Bayes' formula is transformed into post-transformed measures that approximate the posterior. To circumvent the issue of mutually singular probability measures, we formulate general conditions for the employed transformations. As guiding principles, these conditions yield four concrete transformations. Additionally, to minimize computational demands, we have developed a conditional normalizing flow variant, termed CNF-iVI, which is adapt at processing measurement data of varying dimensions while requiring minimal computational resources. We apply the proposed algorithms to three typical inverse problems governed by the simple smooth equation, the steady-state Darcy flow equation, and the electric impedance tomography. Numerical results confirm our theoretical findings, illustrate the efficiency of our algorithms, and verify the discretization-invariant property.

math.NA↗

Depth-Resolved Lattice Distortions in a Silicon-Germanium Qubit Host

Semiconductor qubits, promising for quantum computation, inherit properties from their host lattice. Quantum dot spins, occupying the local lowest energy states in the conduction band, necessarily couple to structural disorder and interfaces. While silicon-based systems promise low noise alongside industrially compatible manufacturing, the growth of SiGe---a leading platform---unavoidably introduces lattice dislocations, inhomogeneous strain, and crosshatch patterns, expected to cause fluctuations between devices, qubit failure, and subsequently higher operational overhead. Through X-ray nano-structural mapping of an Intel Si/SiGe chip, we reveal, with 30$~$nm lateral and 200$~$nm functional depth resolution, how extended lattice defects introduced during growth propagate through the heterostructure, creating permanently distorted lattice planes and strain. We correlate these at the $\approx1~μ$m scale of a quantum dot device and calculate the impact on qubit energy spectra. We observe crosshatch fine structure and find that substrate miscut and growth correlate with the final crosshatch pattern.

cond-mat.mes-hall↗

Entanglement-based quantum key distribution with data in hollow-core fiber

The coexistence of quantum information and classical signals in a single fiber is essential for future quantum networks that leverage the well-established optical fiber infrastructure. Although multiplexing technologies can separate quantum and classical signals, pure silica core fibers (PSCFs) remain fundamentally limited by the high nonlinearity, which generates substantial Raman scattering and four-wave mixing noise. Hollow-core fibers (HCFs), guiding light predominantly in air, offer an attractive solution with intrinsically ultra-low nonlinearity and strongly suppressed nonlinear noise. In this work, we demonstrate the entanglement-based key coexisting with data over an 18-km HCF link. We achieve time-encoded high-dimensional quantum key distribution (HD-QKD) carrying 0 dBm of bidirectional received power, corresponding to a theoretical data capacity of up to 2.3 Tbps. During 24 hours of continuous operation, an average secret key rate (SKR) of 10.56 kbps is obtained. Theoretical analysis further predicts SKRs above 135 kbps over transmission distances exceeding 200 km using state-of-the-art low-loss HCFs. These results show significantly improved performance compared with PSCF-based systems and highlight the potential of HCFs for scalable quantum-classical coexistence compatible with the architectures of established fiber-optic networks.

quant-ph↗

ReflexTrack: A Feedback-Driven Agent for Training-Free Referring Video Object Segmentation

Referring video object segmentation (RVOS) requires segmenting a target specified by natural language throughout a video. Recent agentic approaches combine multimodal large language models with promptable segmentation models to perform RVOS without task-specific training. However, most pipelines rely on one-shot spatial grounding followed by mask propagation, leaving both the initial prompts and temporal predictions largely unverified. We introduce ReflexTrack, a training-free, feedback-driven agent that closes this loop at both spatial and temporal levels. Mask-guided Spatial Refinement evaluates the mask induced by the current keyframe prompt and iteratively updates the bounding box together with positive and negative points, yielding a more reliable initialization. Video-level Mask Reflection assesses the complete mask sequence, localizes unreliable intervals, selects complementary repair keyframes, and generates candidate predictions through mask-guided re-propagation. Only candidates that provide a verified improvement are used to update the affected intervals, preserving reliable predictions elsewhere. All components remain frozen during inference. ReflexTrack achieves an overall $\mathcal{Q}$ score of $69.7$ on Ref-VPS and a $\mathcal{J}\&\mathcal{F}$ score of $67.2$ on ReasonVOS. These results demonstrate that prediction-level feedback substantially improves the reliability of training-free RVOS.

cs.CV↗

Spatial Lifting for Dense Prediction

We present Spatial Lifting (SL), a novel methodology for dense prediction tasks. SL operates by lifting standard inputs, such as 2D images, into a higher-dimensional space and subsequently processing them using networks designed for that higher dimension, such as a 3D U-Net. Counterintuitively, this dimensionality lifting allows us to achieve good performance on benchmark tasks compared to conventional approaches, while reducing inference costs and \textbf{drastically lowering the number of model parameters}. The SL framework produces intrinsically structured outputs along the lifted dimension. This emergent structure facilitates dense supervision during training and enables single-forward-pass self-consistency-based quality and uncertainty estimation at test time. Spatial Lifting introduces a simple and general modeling strategy that offers a promising path toward more efficient, accurate, and reliable deep networks for dense prediction tasks in vision.

cs.CV↗

MSBraM: A Multi-scale Self-supervised Brain Foundation Model for Hierarchical EEG Dynamics Learning

Self-supervised foundation models have recently shown strong potential for electroencephalogram (EEG)-based analysis. However, existing approaches struggle to capture the inherently multi-scale temporal structure of EEG signals, where local neural patterns and long-range dependencies jointly encode task-relevant information. This limitation hampers cross-scale representation learning and generalization across diverse downstream tasks. To address this challenge, we propose MSBraM, a Multi-Scale self-supervised Brain foundation Model designed to learn hierarchical EEG representations. MSBraM follows a two-stage pretraining framework. First, a multi-scale neural tokenizer discretizes raw EEG signals into semantic codes at different temporal resolutions via vector-quantized reconstruction. Second, the model is pretrained to predict masked codes using a curriculum multi-scale masking strategy, progressively integrating fine-grained local patterns with global temporal context. We pretrain MSBraM on over 2,400 hours of EEG data and evaluate it across 10 downstream tasks on 12 public datasets. Extensive experiments show that MSBraM achieves superior performance on other state-of-the-art pretrained models, demonstrating strong generalization and transferability. These results indicate that explicitly modeling multi-scale temporal dynamics is critical for effective EEG foundation models.

cs.AI↗

Sequential Topological Superconductivity in a Square Lattice with Chiral Charge Density Waves

The interplay between charge order and superconductivity offers a fertile ground for emergent quantum phases. Here we theoretically investigate a square-lattice superconductor coexisting with a composite charge density wave (CDW) consisting of a real bond modulation (charge bond order, CBO) and an imaginary hopping modulation (chiral flux phase, CFP) that breaks time-reversal symmetry. We uncover that, while CFP alone does not induce topology in square lattices, its coexistence with CBO drives the system into two topologically nontrivial superconducting phases with Chern numbers $C=+2$ and $C=-2$. The low-temperature thermal Hall conductivity $κ_{xy}$ exhibits quantized plateaus proportional to the Chern number, providing a clear experimental fingerprint. Our results establish the square lattice as a pristine platform for engineering topological superconductivity through the synergy of real and imaginary bond modulations.

cond-mat.supr-con↗

A transition-density-based operator learning method for Fokker-Planck equations with various initial conditions

Solving Fokker-Planck equations (FPEs) for multiple initial conditions typically requires repeated computations, leading to substantial computational costs. In this work, we propose a transition-density-based operator learning method to efficiently approximate the solution operator of FPEs with various initial conditions. The core idea is to learn the transition probability density function (PDF) of the underlying stochastic differential equation (SDE), from which the solution associated with a new initial distribution can be obtained through the Chapman-Kolmogorov equation without retraining the model. A major challenge in learning the transition PDF lies in the singular behavior induced by the Dirac initial condition. To address it, we introduce a conditional normalizing flow whose base distribution is given by the explicit transition PDF of a linearized SDE. This base distribution captures the short-time behavior of the target transition PDF and allows the normalizing flow to learn a near-identity transformation at small times. We further incorporate a time-weighted loss function to stabilize training near the initial time and develop an importance-sampling strategy for evaluating solutions associated with general initial conditions. A variety of numerical experiments are presented to illustrate the effectiveness and robustness of the proposed method.

cs.LG↗