Search arXiv⌕ Search

arXiv subjects

Di Yu

Publications and source records attributed to Di Yu.

At least 19 recordsLinked to original sources
arXiv2026

Migrate Computation, Not Data: Fault Recovery in Neuromorphic Many-Core Systems

As neuromorphic systems scale to thousands of near-memory cores, aging-induced permanent faults in neuron-update datapaths become an important obstacle to long-term deployment. Existing online recovery methods typically retire a faulty core and migrate its neurons, along with their weights and membrane states, to healthy cores. This whole-core treatment incurs high recovery traffic and makes recovery depend on scarce destinations; at high utilization, there may be enough surviving compute capacity but insufficient free storage to copy the affected neuron context. This paper presents SpikeRelay, an online recovery framework for diagnosed compute-unit faults. SpikeRelay exploits the fact that, in many neuromorphic cores, the compute datapath, local SRAM, and router are distinct modules: a compute fault need not destroy stored weights and states or disconnect the core from the NoC. Instead of retiring a faulty core and migrating its neuron data, SpikeRelay converts the faulty core into a storage-and-forwarding node while offloading neuron-update computation to a healthy rescue core. This decoupling of storage and computation eliminates recovery-time data migration and greatly reduces spare-SRAM requirements. Consequently, SpikeRelay sustains 100\% recovery at 92.2\% SRAM utilization and a 50\% fault rate, whereas the best baseline achieves only 22.1\%.

cs.NE↗
arXiv2026

Learning While Inferring: Local and Parallel Learning for Edge SNNs across Sensing Modalities

Edge intelligence requires models to sense continuously in real time and to keep adapting on-device, all under tight compute, energy, and memory budgets. Although spiking neural networks (SNNs) enable efficient event-driven inference, standard surrogate-gradient backpropagation (BP) serializes updates and blocks ongoing inference. We investigate Bidirectional Spike-Based Distillation (BSD) as an on-device learning principle that lets edge SNNs learn while inferring. BSD couples a stimulus-driven forward network with an independent target-driven reverse network and aligns their intermediate representations through local objectives. Because the two pathways have disjoint computation graphs until alignment, forward inference, reverse inference, and stage-wise updates can run concurrently. On 25 benchmarks spanning the five sensing modalities of SOUL, BSD stays within 3.8 percentage points of matched BP baselines on average, while only its forward branch is needed at deployment. The learned representations also transfer well to few-shot class-incremental learning without replaying past data. By removing the dense floating-point backward chain, BSD reduces the projected training latency to $0.72\times$ and the estimated training energy to $0.36\times$ that of BP.

cs.NE↗
arXiv2026

An Occupation-Measure and Frank-Wolfe Framework for Heterogeneous Mean-Field Control

Heterogeneous mean-field control (MFC) involves multiple interacting populations with distinct dynamics, control constraints, and coupling structures. We develop a heterogeneous occupation-measure mean-field control (OM-MFC) framework that reformulates the population-distribution control problem as an optimization problem over occupation measures. In this representation, potentially nonlinear dynamics enter through linear weak Liouville constraints, while nonlocal inter-population interactions become structured bilinear functionals of the occupation-measure marginals. Exploiting this structure, we derive a Frank--Wolfe (FW) method and show that its linear minimization oracle decomposes into independent population-wise optimal control problems once the current population distributions are fixed, enabling parallel computation without an a priori discretization of the measure space. We further establish a sufficient convexity condition based on the symmetrized matrix-valued interaction kernel, under which Frank--Wolfe with an exact oracle admits the standard $O(1/k)$ convergence rate. Numerical examples on heterogeneous UAV coordination and three-dimensional search-and-rescue illustrate the framework both within the certified convex regime and for directional interactions beyond that regime.

math.OC↗
arXiv2026

Benchmarking spiking neural networks across sensing modalities on edge devices

Edge computing systems need to support diverse sensing workloads under tight energy and memory constraints, thereby motivating deployment-aware model selection. Spiking neural networks (SNNs) are a promising alternative to conventional artificial neural networks (ANNs), yet systematic evidence for when and why they provide practical advantages remains limited. Here, we present a benchmark of SNNs across five sensing modalities and multiple edge devices, systematically evaluating spike encoding, neuron models, and network topologies under consistent training and deployment protocols. We find that SNN advantages are strongly modality-dependent: while SNNs achieve performance broadly comparable to ANNs across most workloads, wireless sensing emerges as a particularly favorable domain. Frequency-domain and feature-space analyses further explain this result by showing that spiking dynamics naturally align with the spectral-temporal structure of wireless signals. Our deployment analysis further shows that SNN advantages are not one-dimensional, with energy gains often accompanied by modality-dependent system costs. Finally, we provide an open-source framework for reproducible benchmarking and deployment profiling, offering a practical foundation for algorithm-software-hardware co-design on emerging edge and neuromorphic computing platforms.

cs.NE↗
arXiv2026

Convexifying Mean-Field Control: An Occupation-Measure and Frank-Wolfe Approach

Large-scale robotic swarms motivate the use of mean-field control (MFC). Classical partial differential equation (PDE)-based formulations provide a principled framework but can become computationally challenging in higher dimensions, whereas machine learning achieves scalability at the cost of approximation and guarantees. In this work, we establish an optimization-based framework that lifts the MFC problem into the space of occupation measures, resulting in a convex relaxation formulated as an optimization over measures. The resulting problem is solved using a Frank-Wolfe (FW) algorithm in the measure space, with each iteration reduced to a tractable optimal control problem. This approach retains the O(1/k) convergence rate of FW, avoids discretization of the state space, and naturally incorporates interaction and safety constraints. Numerical experiments demonstrate agreement with analytic and PDE-based baselines in two dimensions and show that the method scales to three-dimensional environments with multiple obstacles, where standard grid-based PDE solvers become impractical. A full 3D instance with ten obstacles is solved in minutes on a standard workstation, underscoring the practicality and scalability of the proposed framework.

math.OC↗
arXiv2026

Rethinking Genomic Modeling Through Optical Character Recognition

Recent genomic foundation models largely adopt large language model architectures that treat DNA as a one-dimensional token sequence. However, exhaustive sequential reading is structurally misaligned with sparse and discontinuous genomic semantics, leading to wasted computation on low-information background and preventing understanding-driven compression for long contexts. Here, we present OpticalDNA, a vision-based framework that reframes genomic modeling as Optical Character Recognition (OCR)-style document understanding. OpticalDNA renders DNA into structured visual layouts and trains an OCR-capable vision--language model with a visual DNA encoder and a document decoder, where the encoder produces compact, reconstructible visual tokens for high-fidelity compression. Building on this representation, OpticalDNA defines prompt-conditioned objectives over core genomic primitives-reading, region grounding, subsequence retrieval, and masked span completion-thereby learning layout-aware DNA representations that retain fine-grained genomic information under a reduced effective token budget. Across diverse genomic benchmarks, OpticalDNA consistently outperforms recent baselines; on sequences up to 450k bases, it achieves the best overall performance with nearly 20$\times$ fewer effective tokens, and surpasses models with up to 985$\times$ more activated parameters while tuning only 256k trainable parameters.

cs.CV↗
arXiv2026

Overcoming noise-agility trade-off in integrated lasers for precision sensing

Lasers that combine narrow linewidths with rapid tunability are critical for applications such as coherent optical ranging, distributed fiber-optic sensing, and precision spectroscopy. Despite significant progress in integrated laser technologies, the concurrent realization of low phase noise and frequency agility on a single integrated platform remains challenging owing to a fundamental architectural trade-off: conventional integrated laser designs typically suppress phase noise via high-$Q$ resonators, yet the extended photon lifetimes inherent to such resonators intrinsically constrain tuning speed. Here, we address this noise-agility trade-off by introducing a laser architecture that achieves ultralow phase noise and ultrafast tunability simultaneously. Rather than relying on ultrahigh-$Q$ resonators for self-injection locking, our design employs strong synthetic feedback within a Pockels-tunable, resonator-enhanced distributed Bragg reflector to suppress phase noise. As a proof of concept, we demonstrate a hybrid integrated laser with a short-term linewidth of 29 Hz, realized using a lithium niobate external cavity with a loaded $Q$ of only 0.62 million. The adoption of a moderate resonator $Q$ relaxes the photon-lifetime constraint on tuning speed, enabling sub-exahertz-per-second tuning rates and a chirp nonlinearity as low as 0.14%. Leveraging this laser, we implement a frequency-modulated continuous-wave LiDAR system that achieves a relative ranging precision of $1.7 \times 10^{-4}$ at a measurement rate of $1\,\text{MSa s}^{-1}$, without requiring complex chirp linearization techniques. We further demonstrate fiber-optic acoustic sensing capable of detecting sub-$με$ dynamic strain, underscoring the platform's versatility for high-speed precision optical measurements. Our work provides a route toward cost-effective yet high-performance sensing and metrology systems.

physics.optics↗
arXiv2026

Frequency Matching in Spiking Neural Networks for mmWave Sensing

Millimeter-wave (mmWave) sensing enables privacy-preserving, always-on edge perception, but its measurements are often sparse, temporally irregular, and corrupted by high-frequency noise. Existing mmWave pipelines predominantly rely on artificial neural networks (ANNs), which achieve robustness through extensive preprocessing or deep architectures, thereby limiting their efficiency on edge devices. In this work, we study spiking neural networks (SNNs) for mmWave sensing from a mechanism-data alignment perspective. By leveraging the low-pass filtering behavior of leaky integrate-and-fire (LIF) dynamics, we analyze how their implicit temporal filtering interacts with the frequency structure of mmWave signals. Our analysis shows that when discriminative information resides in low-to-mid frequencies, LIF dynamics can inherently suppress high-frequency noise, clarifying when and why SNNs outperform ANNs. Based on this insight, we derive a principled criterion for configuring the membrane decay factor by matching the effective bandwidth of LIF dynamics to the data's discriminative spectral content. Experimental results across four widely used mmWave datasets validate the proposed frequency-matching hypothesis, yielding an average test-accuracy improvement of 6.22% and a 3.64$\times$ reduction in theoretical energy consumption relative to ANN baselines, under a unified evaluation protocol.

cs.NE↗
arXiv2026

SAFA-SNN: Sparsity-Aware On-Device Few-Shot Class-Incremental Learning with Fast-Adaptive Structure of Spiking Neural Network

Continuous learning of novel classes is crucial for edge devices to preserve data privacy and maintain reliable performance in dynamic environments. However, the scenario becomes particularly challenging when data samples are insufficient, requiring on-device few-shot class-incremental learning (FSCIL). Although existing work has explored parameter-efficient FSCIL frameworks based on artificial neural networks (ANNs), their deployment is still fundamentally constrained by limited device resources. Spiking neural networks (SNNs) process spatiotemporal information efficiently, offering lower energy consumption, greater biological plausibility, and compatibility with neuromorphic hardware than ANNs. In this work, we propose an SNN-based method containing Sparsity-Aware neuronal dynamics and Fast Adaptive structure (SAFA-SNN) for on-device FSCIL. By threshold regulation, most neurons exhibit stable spikes and others exhibit adaptive spikes. As a result, synaptic traces that encode base-class knowledge are naturally preserved, thereby alleviating catastrophic forgetting. To cope with spike non-differentiability in backpropagation, we employ a gradient-free technique, i.e., zeroth-order optimization. Moreover, class prototypes can limit overfitting on few-shot data but introduce bias. We enhance prototype discriminability by orthogonal subspace projection. Extensive experiments conducted on two standard benchmark datasets (CIFAR-100 and Mini-ImageNet) and three neuromorphic datasets (CIFAR10-DVS, DVS128 Gesture, and N-Caltech101) demonstrate that SAFA-SNN outperforms baselines, specifically achieving at least 4.01% improvement at the last incremental session on Mini-ImageNet and 20% lower energy cost on CIFAR-100 over baselines with practical implementation.

cs.LG↗
arXiv2026

ShiftLIF: Efficient Multi-Level Spiking Neurons with Power-of-Two Quantization

Spiking neural networks (SNNs) are promising for edge sensing due to their event-driven computation and temporal filtering capability. However, standard leaky integrate-and-fire (LIF) neurons communicate only through binary spikes, which severely limit representational capacity. Existing multi-level spiking neurons improve information transmission, but often rely on uniform quantization that mismatches membrane-potential distributions or introduces costly synaptic multiplications. In this paper, we propose ShiftLIF, a multi-level spiking neuron that maps membrane potentials to a logarithmically spaced power-of-two spike set. This design provides finer representation in the small-amplitude regime, where membrane potentials are densely concentrated, while enabling multiplier-free synaptic computation through bit-shift and accumulation operations. As a result, ShiftLIF improves spike-level expressiveness without sacrificing the hardware-friendly nature of standard SNN computation. We evaluate ShiftLIF on 10 datasets spanning wireless, acoustic, motion, and visual sensing tasks. Results show that ShiftLIF consistently matches or exceeds the accuracy of existing multi-level spiking neurons while maintaining synaptic energy consumption close to standard binary LIF. These results indicate that ShiftLIF provides a favorable accuracy-efficiency trade-off for cross-modal edge sensing.

cs.NE↗
arXiv2026

Optimizing High-Throughput Distributed Data Pipelines for Reproducible Deep Learning at Scale

Training massive-scale deep learning models on datasets spanning tens of terabytes presents critical challenges in hardware utilization and training reproducibility. In this paper, we identify and resolve profound data-loading bottlenecks within distributed GPU training pipelines using the Petastorm data loader and Apache Parquet datasets. Through systematic profiling, we demonstrate that network I/O and CPU-bound data transformations (e.g., PyArrow to NumPy) constrain GPU utilization to as low as 10-15%. To address this, we propose an optimized architecture that features push-down worker-level transformations coupled with local-disk caching via Fanout-Cache, minimizing redundant I/O and CPU overhead across training epochs. Furthermore, we eliminate race conditions in multi-worker shared queues by implementing dedicated round-robin ventilator and result queues, alongside modernized RNG handling, achieving strict deterministic data loading. Our optimizations yield a 6x speedup, reducing end-to-end training time from 22 hours to 3 hours, increasing GPU utilization to over 60%, and drastically reducing run-to-run variance, enabling robust, high-throughput, and reproducible large-scale model training.

cs.DC↗
arXiv2026

Meter-long broadband chirped Bragg gratings for on-chip dispersion control and pulse shaping

Precise on-chip dispersion control is essential for advanced integrated photonic technologies, enabling applications ranging from high-speed communications and sensing to signal processing and biomedical imaging. However, existing on-chip dispersion control methods still suffer from substantial loss and a limited dispersion-bandwidth product (DBP) far from application needs. As a result, on-chip systems continue to rely exclusively on off-chip dispersion control solutions provided by optical fiber or bulky free-space optics. To overcome these limitations, we design and fabricate meter-long chirped spiral Bragg gratings (CSBGs) on the ultra-low-loss silicon nitride (SiN) photonic platform for advanced dispersion control. Our device achieves a 10-nanosecond group delay with customizable bandwidths exceeding 10 nanometers within a compact footprint of only 30 $\text {mm} ^2$, surpassing the physical limits of fiber-based grating devices. More importantly, CSBGs can simultaneously possess the characteristics of high stability, low latency, and a large DBP, thanks to the ultra-low-loss SiN platform with a loss of only 0.3 dB/m. Leveraging the precise and stable dispersion profile, we demonstrate high-fidelity pulse shaping and compression of electro-optic frequency combs (EOCs) with a 1-GHz repetition rate centered across the entire reflection bandwidth. The compressed pulse has an on-chip peak (average) power of 21.6 watts (580 milliwatts). Furthermore, we showcase for the first time the application of on-chip pulse-compressed EOC in wavelength-swept coherent anti-Stokes Raman scattering (CARS) microscopy. Our work provides integrated photonics with a long-sought, scalable, and robust solution for high-performance on-chip dispersion control, empowering a new generation of on-chip functionalities.

physics.optics↗
arXiv2026

Scalable 3D silicon nitride photonic interposer for high-density optical interconnects

Modern computing workloads demand energy-efficient, high-bandwidth interconnects, motivating photonic interposers as an alternative to electrical links. Here we demonstrate a compact 3D silicon nitride (SiN) photonic interposer prototype comprising two routing layers, with the 3D routing scheme optimized by a global optimization algorithm. The 3D interposer realizes a fully connected 12-node optical network that reduces the total number of intralayer crossings from 495 for all-planar routing to merely 150 (69.7% reduction), below the theoretical lower bound of 153 for all-planar interconnects. Comparing the two schemes, our 3D design achieves a 45.8% reduction experimentally in the average loss per waveguide. The proposed 3D routing architecture also features inherent symmetry and is scalable to higher node counts, flexible node placements, additional routing layers, and other operating wavelengths, enabling denser, lower-loss photonic interposers for next-generation scale-up and high-performance computing (HPC) systems.

physics.optics↗
arXiv2026

Occupation-Measure Mean-Field Control: Optimization over Measures and Frank-Wolfe Methods

Coordinating large populations of autonomous agents, such as UAV swarms or satellite constellations, poses significant computational challenges for traditional multi-agent control methods. This paper introduces a new optimization framework for large-population control, termed occupation-measure mean-field control (OM-MFC). The framework models the evolution of agent populations directly in the space of occupation measures and casts large-population control as an infinite-dimensional optimization problem over measures, which becomes convex under a positive-semidefiniteness condition on the interaction kernel. A Frank--Wolfe (FW) algorithm and its fully-corrective variant (FCFW) are developed to solve the resulting problem efficiently, where each iteration reduces to a classical optimal control subproblem. Theoretical results establish convexity, existence of optimal solutions, and convergence guarantees of the proposed algorithms. Owing to its measure-based formulation, the framework naturally accommodates systems with very large numbers of agents. Numerical experiments on UAV swarm coordination and satellite constellation control demonstrate the scalability and effectiveness of the proposed approach in high-dimensional and constrained environments.

math.OC↗
arXiv2026

Biologically Plausible Learning via Bidirectional Spike-Based Distillation

Developing biologically plausible learning algorithms that can achieve performance comparable to error backpropagation remains a longstanding challenge. Existing approaches often compromise biological plausibility by entirely avoiding the use of spikes for error propagation or relying on both positive and negative learning signals, while the question of how spikes can represent negative values remains unresolved. To address these limitations, we introduce Bidirectional Spike-based Distillation (BSD), a novel learning algorithm that jointly trains a feedforward and a backward spiking network. We formulate learning as a transformation between two spiking representations (i.e., stimulus encoding and concept encoding) so that the feedforward network implements perception and decision-making by mapping stimuli to actions, while the backward network supports memory recall by reconstructing stimuli from concept representations. Extensive experiments on diverse benchmarks, including image recognition, image generation, and sequential regression, show that BSD achieves performance comparable to networks trained with classical error backpropagation. These findings represent a significant step toward biologically grounded, spike-driven learning in neural networks. Our code is available at https://github.com/alden199/Bidirectional-Spike-Based-Distillation.

cs.NE↗
arXiv2025

DeepResearch Arena: The First Exam of LLMs' Research Abilities via Seminar-Grounded Tasks

Deep research agents have attracted growing attention for their potential to orchestrate multi-stage research workflows, spanning literature synthesis, methodological design, and empirical verification. Despite these strides, evaluating their research capability faithfully is rather challenging due to the difficulty of collecting frontier research questions that genuinely capture researchers' attention and intellectual curiosity. To address this gap, we introduce DeepResearch Arena, a benchmark grounded in academic seminars that capture rich expert discourse and interaction, better reflecting real-world research environments and reducing the risk of data leakage. To automatically construct DeepResearch Arena, we propose a Multi-Agent Hierarchical Task Generation (MAHTG) system that extracts research-worthy inspirations from seminar transcripts. The MAHTG system further translates research-worthy inspirations into high-quality research tasks, ensuring the traceability of research task formulation while filtering noise. With the MAHTG system, we curate DeepResearch Arena with over 10,000 high-quality research tasks from over 200 academic seminars, spanning 12 disciplines, such as literature, history, and science. Our extensive evaluation shows that DeepResearch Arena presents substantial challenges for current state-of-the-art agents, with clear performance gaps observed across different models.

cs.AI↗
arXiv2025

Deterministic and Stochastic Frank-Wolfe Recursion on Probability Spaces

Motivated by applications in emergency response and experimental design, we consider smooth stochastic optimization problems over probability measures supported on compact subsets of the Euclidean space. With the influence function as the variational object, we construct a deterministic Frank-Wolfe (dFW) recursion for probability spaces, made especially possible by a lemma that identifies a ``closed-form'' solution to the infinite-dimensional Frank-Wolfe sub-problem. Each iterate in dFW is expressed as a convex combination of the incumbent iterate and a Dirac measure concentrating on the minimum of the influence function at the incumbent iterate. To address common application contexts that have access only to Monte Carlo observations of the objective and influence function, we construct a stochastic Frank-Wolfe (sFW) variation that generates a random sequence of probability measures constructed using minima of increasingly accurate estimates of the influence function. We demonstrate that sFW's optimality gap sequence exhibits $O(k^{-1})$ iteration complexity almost surely and in expectation for smooth convex objectives, and $O(k^{-1/2})$ (in Frank-Wolfe gap) for smooth non-convex objectives. Furthermore, we show that an easy-to-implement fixed-step, fixed-sample version of (sFW) exhibits exponential convergence to $\varepsilon$-optimality. We end with a central limit theorem on the observed objective values at the sequence of generated random measures. To further intuition, we include several illustrative examples with exact influence function calculations.

math.OC↗
arXiv2025

Mimicking the Physicist's Eye:A VLM-centric Approach for Physics Formula Discovery

Automated discovery of physical laws from observational data in the real world is a grand challenge in AI. Current methods, relying on symbolic regression or LLMs, are limited to uni-modal data and overlook the rich, visual phenomenological representations of motion that are indispensable to physicists. This "sensory deprivation" severely weakens their ability to interpret the inherent spatio-temporal patterns within dynamic phenomena. To address this gap, we propose VIPER-R1, a multimodal model that performs Visual Induction for Physics-based Equation Reasoning to discover fundamental symbolic formulas. It integrates visual perception, trajectory data, and symbolic reasoning to emulate the scientific discovery process. The model is trained via a curriculum of Motion Structure Induction (MSI), using supervised fine-tuning to interpret kinematic phase portraits and to construct hypotheses guided by a Causal Chain of Thought (C-CoT), followed by Reward-Guided Symbolic Calibration (RGSC) to refine the formula structure with reinforcement learning. During inference, the trained VIPER-R1 acts as an agent: it first posits a high-confidence symbolic ansatz, then proactively invokes an external symbolic regression tool to perform Symbolic Residual Realignment (SR^2). This final step, analogous to a physicist's perturbation analysis, reconciles the theoretical model with empirical data. To support this research, we introduce PhysSymbol, a new 5,000-instance multimodal corpus. Experiments show that VIPER-R1 consistently outperforms state-of-the-art VLM baselines in accuracy and interpretability, enabling more precise discovery of physical laws. Project page: https://jiaaqiliu.github.io/VIPER-R1/

cs.AI↗