arXiv:2607.17354v1 Announce Type: cross
Abstract: We investigate colored $\Delta_T$ noise, i.e., finite-frequency $\Delta_T$ noise, as a probe of edge-mode (EM) transport in quantum Hall and quantum spin Hall systems. Colored $\Delta_T$ noise probes finite-frequency nonequilibrium current fluctuations and dynamical transport properties that are often obscured in DC measurements of conductance and noise. Since $\Delta_T$ noise is driven solely by a temperature and voltage bias under zero average charge current conditions, it eliminates current-induced Joule heating and directly probes intrinsic thermal fluctuations. We show that chiral, spin-conserving helical, and spin-flip helical (trivial) EMs exhibit distinct colored $\Delta_T$-noise signatures under appropriate bias protocols. Incorporating energy-dependent scattering through a quantum point contact, we demonstrate that electron-hole asymmetry significantly modifies the finite-frequency spectrum while preserving these distinguishing features. Notably, colored $\Delta_T$ noise exhibits a frequency-dependent sign reversal absent in the corresponding white ($\omega=0$) $\Delta_T$ noise. We further investigate zero-temperature colored quantum shot noise and find that it vanishes identically for chiral EMs, whereas the spin-conserving helical response changes sign with frequency. By contrast, spin-flip helical (trivial) EMs exhibit a positive colored shot-noise spectrum. However, the corresponding colored $\Delta_T$ noise retains its characteristic sign reversal, providing a robust distinction between spin-conserving helical and spin-flip helical (trivial) EM transport. These results establish colored $\Delta_T$ noise as a robust, experimentally accessible, complementary probe for identifying chiral, spin-conserving helical, and spin-flip helical (trivial) EM transport in mesoscopic topological systems.
Science Journals
arXiv:2607.17140v1 Announce Type: new
Abstract: Unified multimodal models (UMMs) aim to integrate visual understanding and generation within a single architecture, but architectural unification alone does not ensure semantic consistency. A model may describe the intended target correctly while generating an inconsistent edit. This exposes an understanding-generation alignment gap: linguistic and visual outputs live in different spaces, yet should be governed by the same target semantics. We study this gap in image editing, where an instruction defines a target state that can be both described and visually realized. Given a source image and an edit instruction, we compare a UMM's target caption with its edited image to test whether the two outputs converge on the same result. Our analysis shows that existing UMMs remain weakly aligned, especially for fine-grained entities, attributes, spatial relations, and local details, indicating that semantic unification is not achieved by architecture alone. To bridge this gap, we propose STBridge, a shared-target alignment framework that connects understanding and generation through a common target state. Here the target caption expresses the desired visual result, while the edited image realizes it visually, replacing separate task-specific paths with a shared information flow from target expression to target realization. STBridge follows an align-then-optimize strategy: supervised fine-tuning first establishes the shared-target channel, and sequential reinforcement learning further refines target-centered coordination. Across visual understanding, image generation, and image editing benchmarks, STBridge consistently improves over the initialization model. Alignment analysis confirms that STBridge narrows the gap between what the model describes and what it generates, demonstrating shared-target alignment as an effective post-training strategy for bridging understanding and generation in UMMs.
arXiv:2607.17914v1 Announce Type: new
Abstract: Robust multi-agent coordination relies heavily on inter-agent communication, which is frequently disrupted by physical and environmental constraints in real-world deployments. To maintain operation during these intermittent communication failures, agents can employ internal prediction models to estimate missing shared state information. However, predictors trained with standard reconstruction objectives treat all transitions equally. In a Reinforcement Learning context, this forces the model to waste capacity learning stochastic exploration noise and the outdated dynamics of suboptimal policies. In this paper, we propose a value-aware extension of Multi-Agent Observation Sharing under Communication Dropout (MARO) to patch communication gaps; we refer to this method as Value-Aware MARO. By dynamically weighting the predictor's loss function using advantage estimates derived from the underlying actor-critic architecture, our objective explicitly couples the predictor's learning process to the policy's evolution. This formulation focuses the model's capacity on the intentional, high-return dynamics actively reinforced by the agents. We evaluate our framework on several tasks within the Multi-Agent Particle Environment under varying communication reliability levels. Experimental results demonstrate that our approach maintains performance under declining communication reliability, particularly below 40%. While our method performs comparably in tasks where the baseline already maintains high coordination, our value-aware weighting effectively prevents the performance collapse observed in the standard predictor during high-attrition scenarios. In these environments, our method achieves an average improvement in mean returns of more than 20% and reduces performance variance by a mean of 64.7% compared to the standard unweighted baseline.
arXiv:2607.16360v1 Announce Type: new
Abstract: Over-the-air computation (AirComp) exploits multiple-access superposition to compute functions of distributed data without separately decoding all terminal messages. We study a reusable two-input AirComp gate for the exp-minus-log (EML) operation $\eml(u,v)=\exp(u)-\log(v)$, $v>0$. Thus, all internal nodes of a prescribed real-admissible EML tree reuse one gate type, avoiding node-specific nonlinear gate designs. Given an explicit EML tree whose intermediate logarithm arguments remain positive on a given compact domain, we derive additive white Gaussian noise (AWGN) and coherent flat fading implementations under peak-power constraints. We then characterize the number of gate evaluations, the dependency depth, evaluation latency, node-wise feasibility, deterministic error propagation, positivity preservation, and a high-probability AWGN error bound for the complete tree. A four-terminal two-hop example gives explicit positivity and end-to-end error conditions, and a digital interface propagates quantization and gate errors across the tree.
Dependency-Guided Code Generation: Structured Matrix Decomposition and Consistency-Guided Refinement
arXiv:2607.16692v1 Announce Type: new
Abstract: The increasing complexity of modern software systems has made automated code generation a fundamental task in software engineering. However, existing approaches often fail to adequately capture the intricate, multi-level dependencies among code entities, leading to generated code that is logically incomplete or difficult to integrate into real-world systems. To address this limitation, we propose a dependency-aware code generation framework that explicitly models interactions among code entities through a graph-based representation. We decompose dependencies into two complementary components: a quantized matrix that captures strong, explicit relations, and a sparse low-rank factorization that models weaker, implicit interactions. The decomposition is efficiently learned via an alternating optimization procedure. During code generation, the learned dependency structure is incorporated as a constraint, ensuring both semantic coherence and structural consistency of the generated code. Furthermore, we introduce a sparse triplet representation for strong dependencies, significantly improving storage efficiency and computational scalability. Extensive experiments demonstrate that our approach consistently produces code with superior semantic alignment and structural fidelity compared to existing methods.
arXiv:2607.17915v1 Announce Type: cross
Abstract: The present paper is a study of the large scale properties of the Kuramoto-Sivashinsky equation. By using a Schwinger-Dyson framework, we aim to provide a proof that the only solutions that can sustain a stable scaling in the infrared limit have a negative effective viscosity (in the Kuramoto-Sivashinsky sense) with a minimal set of hypotheses, thereby showing that this constitutes a general property of the wave equation that does not depend on a specific set of truncations of a renormalisation group flow, or limitations of a given numerical scheme for example.
arXiv:2607.17742v1 Announce Type: new
Abstract: Tables are a critical knowledge source in retrieval-augmented generation (RAG), but a retrieved table may lack sufficient evidence to answer a query, a property we call answerability. While answerability broadly concerns whether a source or collection of sources contains sufficient evidence, retrieval models optimized for semantic relevance do not guarantee it even in the single-source case, creating a fundamental mismatch. To study this, we introduce TCR-Bench, a diagnostic benchmark for Table Content-level Answerability in RAG, built around sibling tables, i.e., tables with highly similar schemas but subtle content differences. On TCR-Bench, the dense retrievers we evaluate persistently exhibit a Semantic-Answerability Gap: they often retrieve the correct sibling group yet struggle to pinpoint the uniquely answerable table within it, dropping QA performance from 0.755 (oracle) to 0.330 (top-5 retrieved). Our analysis suggests this gap is associated with semantic accumulation, schema-level cue dependence, and weak row-column binding. As a diagnostic probe into the source of this gap, we test whether a lightweight two-stage pipeline, Answerability-Aware Reranking (AAR), applying direct query-table answerability judgment, can recover performance: it raises top-1 target retrieval from 18.2% to 57.4%, and this large gain is itself evidence that much of the observed failure reflects a missing answerability verification step, rather than an inherent limitation of model capacity alone.
arXiv:2607.17066v1 Announce Type: cross
Abstract: We propose a reduced order modeling (ROM) framework for 1D conservative PDEs based on the cumulative distribution transform (CDT). The CDT maps nonnegative, equal-mass states into a Hilbert space in which 1D Wasserstein distances become weighted $L^2$ distances and translations become affine shifts. This makes the transform especially suited for transport-dominated dynamics, where Eulerian linear-subspace ROMs often suffer from slow decay of Kolmogorov widths.
We study this phenomenon for scalar conservative dynamics by analyzing the solution manifold in CDT coordinates. For linear transport, the transformed solution manifold is contained in the 2-dimensional space spanned by the transformed initial datum and the constant function, and has zero Kolmogorov $2$-width. For nonlinear hyperbolic conservation laws, we prove two complementary types of estimates: robust $O(n^{-1})$ bounds that rely only on the conservative transport structure and remain meaningful after shock formation, and sharper $O(n^{-2})$ bounds in smooth pre-shock regimes. For conservative advection-diffusion, we show that the CDT trajectory remains within distance $O(\sqrt{DT})$ of the pure-transport plane, and we also obtain sharper $O(D^2T^2)$ estimates under additional regularity or away from initial layers. In both cases, the zero 2-width behavior of linear transport is recovered as the diffusion coefficient tends to zero.
Motivated by these estimates, we develop a CDT-POD numerical scheme: snapshots are mapped to CDT space, Proper Orthogonal Decomposition (POD) is performed in transformed coordinates, and the inverse CDT is used to reconstruct physical states. Numerical experiments for several transport-dominated dynamics show that CDT-POD can capture solution manifolds with substantially fewer modes than Eulerian POD.
arXiv:2607.16433v1 Announce Type: new
Abstract: Background: When we model networks, there is a problem of obtaining experimental data to verify other model approaches. And even if there are some experimental data, it is necessary to be sure of their reliability. Purpose: It is necessary to propose methods for obtaining reliable experimental data. Method: By its nature, network equipment is a software and hardware complex. Therefore, a full-scale software model can be considered completely equivalent to real equipment. And a real experiment can be replaced by a nature experiment. The reliability of a nature experiment will be based on its reproducibility. Results A comparison of popular nature network modeling packages was carried out. These packages were divided by functionality and feasibility of reproducible studies. Conclusions: Most software packages meet the reproducibility criteria. The choice of a specific solution depends on non-technical factors: popularity and knowledge of the package.
arXiv:2607.17360v1 Announce Type: new
Abstract: This paper presents a two-dimensional TMz finite-difference time-domain (FDTD) solver based on Yee's scheme for modeling radiation from an infinitely long z-directed line current, with the open region truncated by a Berenger split-field perfectly matched layer (PML). After validating cylindrical-wave propagation and negligible late-time reflections in free space, the solver is applied to three inhomogeneous configurations: (i) diffraction through a one-cell-thick perfectly electrically conducting (PEC) sheet with single and double slits; (ii) scattering from infinitely long PEC cylinders of circular and rectangular cross section; and (iii) scattering from infinitely long dielectric cylinders of varying cross section and permittivity. Beyond qualitative field maps, the diffraction case is characterized quantitatively: a steady-state phasor extracted by a running discrete Fourier transform yields the transmitted intensity, from which the fringe visibility and the far-field pattern are computed and compared against the closed-form Fraunhofer prediction. The single- and double-slit cases are cleanly separated by a visibility that rises from near zero to near unity, and the double-slit interference maxima agree with the grating condition arcsin(m \lambda_0 / d) to within a fraction of a degree. For dielectric cylinders, the field penetrates the obstacle with the expected reduced internal wavelength \lambda_0 / \sqrt{\epsilon_r}, and the scattered field strength grows with permittivity contrast. A reference-subtraction method isolates the scattered field throughout. The results confirm that the FDTD-PML framework accurately captures open-region diffraction and geometry- and material-dependent scattering.
arXiv:2607.16211v1 Announce Type: new
Abstract: LLM agents augmented with persistent memory can recall past interactions, but existing systems suffer from two limitations: flat, unstructured storage loses relational context needed for multi-hop and temporal reasoning, and reliance on expensive LLM-based classification makes them impractical for latency-sensitive deployment. Without mechanisms to validate new information against stored knowledge, these systems silently accumulate contradictions. We present MOSAIC (Memory-Organized Structured Agent for Information Collection), a structured, conflict-aware long-term memory framework for LLM agents that is substantially more accurate and efficient. MOSAIC introduces three key capabilities: (1) entity-typed graph storage with semantic classification preserving relational structure across events, personas, and relationships, enabling multi-hop and temporal reasoning over conversation history; (2) hash-accelerated dual-path retrieval replacing LLM-based classification with locality-sensitive hashing, achieving near-instantaneous lookup with negligible accuracy loss; and (3) active conflict detection at save time that cross-references new information against existing graph neighbors, triggering updates or deletions for contradictory entries. Evaluated on LoCoMo (long-conversation QA), HaluMem, and a novel clinical-guideline error compounding test, MOSAIC achieves 89.35% accuracy on LoCoMo (+27.21 pp over the best baseline), best HaluMem-Medium extraction F1(86.77%) and HaluMem-Long extraction F1 (85.84%), best QA correctness on both Medium and Long (73.10%, 70.75%), and detects 66% of injected factual conflicts-4.7 times higher than the best baseline (14%)-while hash-accelerated retrieval keeps average search latency at 0.58 s per question.
arXiv:2607.16297v1 Announce Type: new
Abstract: Edge intelligence systems, the intersection of edge computing and artificial intelligence (AI), are pushing the frontier of AI applications. However, the complexity of deep learning models and heterogeneity of edge devices make the design of edge intelligence systems a challenging task. Hardware-agnostic methods face some limitations when implementing edge systems. Thus, hardware-aware methods are attracting more attention recently. In this paper, we present our recent endeavors in hardware-aware design and optimization for edge intelligence. We delve into techniques such as model compression and neural architecture search to achieve efficient and effective system designs. We also discuss some challenges in hardware-aware paradigm.
arXiv:2607.18151v1 Announce Type: new
Abstract: We present a novel Generalized Scene Reconstruction (GSR) approach called Plenoptic Condensation (PCon). PCon uses a multi-stage reconstruction pipeline, initially converting images into "soupy" scene elements with low (representational) power, then adaptively condensing the "soup" into "structured" elements of higher power capable of efficiently representing, for example, sharp edges and smooth reflective surfaces. PCon scene models called Reality Models (Relms) enable spatially varying representational power, which is essential for high-fidelity rendering, measurement, and scene understanding. We showcase several in-the-wild PCon reconstructions captured with consumer phone cameras and drones. In one case called "Damaged Fiat", PCon is benchmarked against two state-of-the-art (SOTA) GSR methods: NeRO and RT-Splatting. Referring to Figure 1 below, PCon reconstructs the car hood more than twice as accurately as the SOTA methods. But more importantly, the local damage profile error for PCon is 35 um (0.035 mm), whereas the two other SOTA methods are essentially unable to measure the damage at all. Our project website is available at https://quidient.github.io/pcon-2026.html.
arXiv:2607.17380v1 Announce Type: new
Abstract: Elasto-viscoplasticity provides a unified way of describing yield-stress fluids which may exhibit both solid-like and fluid-like behavior. In this work, we present a finite strain overstress-type elasto-viscoplastic framework designed to facilitate the incorporation of different yield surfaces. Within this framework, we compare several yield-surface choices and assess the associated challenges. We consider three representative yield surfaces: (i) pressure-independent, (ii) pressure-sensitive frictional and (iii) capped surfaces, corresponding to von Mises, Drucker--Prager, and modified Cam--clay models, respectively. In the case of von Mises, the proposed formulation naturally recovers the well-known Bingham and Herschel--Bulkley rheologies which are characterized by a single critical yield stress. We discuss in detail the singularity of the Drucker--Prager yield surface which requires a special treatment. In particular, we show that the modified Cam--clay model can be used to conveniently circumvent this singularity under the right conditions, retrieving the expected solution of Drucker--Prager. Implemented within a hybrid Eulerian--Lagrangian scheme, the general framework presented here enables efficient simulations of elasto-viscoplastic flows in two or three spatial dimensions, not requiring regularizing the solid-fluid transition nor a separate free-surface treatment. Numerical benchmark simulations illustrate how yield surface geometry affects velocity profiles, plug formation and compressibility.
arXiv:2607.16408v1 Announce Type: new
Abstract: Idle network service cores are treated as wasted compute. This assumption motivates increasingly sophisticated mechanisms that reclaim idle cores at microsecond timescales. We argue that this view no longer matches modern server hardware. On contemporary multicore processors, active cores compete for a shared package level power and thermal budget. Once that budget becomes the limiting resource, an idle core that waits efficiently returns compute capacity that hardware can redistribute to productive work. Measurements on a recent AMD EPYC processor show how waiting strategy, processor topology, and idle duration determine this tradeoff. Our results suggest that reclaiming idle cores often yields less benefit than commonly assumed while introducing substantial scheduling complexity. We propose a budget centric view of service core systems in which power, rather than core occupancy, becomes the fundamental resource and waiting policy becomes a first class systems design choice.
arXiv:2412.04294v2 Announce Type: replace
Abstract: When writing SQL queries, it is often convenient to use correlated subqueries. However, for the database engine, these correlated queries are very difficult to evaluate efficiently. The query optimizer will therefore try to eliminate the correlations, a process referred to as unnesting.
Recent work has introduced a single pass top-down algorithm for unnesting arbitrary SQL queries. That work did not include a formal proof of correctness, though. In this work we provide the missing formalization by formally defining the operator semantics and proving that the unnesting algorithm is correct.
arXiv:2507.17091v3 Announce Type: replace
Abstract: Viscous drag arises from the fluid at a surface having zero relative velocity, a phenomenon known as the no-slip condition. Superhydrophobic surfaces, when submerged in water, trap a layer of air in their surface texture, partially replacing the liquid-solid interface with a liquid-gas interface. This air layer, called the plastron, results in partial slip at the surface, thereby reducing the viscous drag. In turbulent flows, large fluctuations in pressure and velocity can deplete or completely remove the plastron from the surface. This makes evaluating the effects of superhydrophobic surface treatments on flow dynamics particularly challenging. This study examines the impact of a sustained plastron on the dynamics in the shear layer of a sphere, achieved by supplying air at low pressure through pores in the sphere's surface. Instantaneous planar velocities in the wakes of spheres, both with and without superhydrophobic surface treatment, are measured within a plane passing through the spheres' centre. Dynamic mode decomposition (DMD) is applied to the velocity fluctuations in the shear layer to evaluate how superhydrophobic surface treatment affects the instabilities there. It is shown that the addition of the pores has a relatively small effect on the instabilities in the shear layer, while they are significantly changed by the addition of superhydrophobic surface treatment when the plastron is sustained.
arXiv:2507.20804v3 Announce Type: replace
Abstract: Large Language Models (LLMs) suffer from hallucinations due to their static parametric knowledge. Retrieval-Augmented Generation (RAG) and GraphRAG mitigate this issue by incorporating external knowledge and structured reasoning over knowledge graphs (KGs). However, existing approaches remain largely text-centric, as constructing fine-grained multimodal knowledge graphs (MMKGs) with explicit cross-modal semantics remains challenging. In this paper, we propose MMGraphRAG, a framework for building interpretable MMKGs that unify textual and visual knowledge. Our approach represents visual content as structured scene graphs and integrates them with textual KGs through a novel cross-modal entity linking method, SpecLink, which leverages spectral clustering to jointly model semantic similarity and graph structure. This design preserves explicit entities, relations, and reasoning paths across modalities, enabling structure-aware retrieval and generation. To support evaluation, we introduce the CMEL dataset, a benchmark for fine-grained cross-modal entity alignment. Experimental results on CMEL demonstrate improved entity linking accuracy, while evaluations on DocBench and MMLongBench show that MMGraphRAG achieves superior performance and stronger robustness, particularly in complex multimodal reasoning scenarios.
arXiv:2507.21987v2 Announce Type: replace
Abstract: Graph modification problems aim to find a small set of modifications to a graph so that it satisfies a desired property. The literature is rather rich in NP-completeness results and polynomial time solvable cases for special graph classes. However, no exact algorithm has been proposed for perfect graph modification problems. In this work, we propose the first exact solution methods based on integer programming for three variants: minimum perfect editing, minimum perfect completion, and the perfect sandwich problems. The minimum perfect editing problem inquires about the smallest number of edge additions and deletions needed to make a graph perfect, while the completion problem allows only for edge additions. The perfect sandwich problem is a decision problem that asks whether a perfect graph can be formed by adding edges from a restricted subset. To solve these problems, we formulate an integer programming model based on the Strong Perfect Graph Theorem. To address the resulting exponential number of constraints, we propose a branch-and-cut algorithm that dynamically generates them on demand. At the core of this approach is an efficient separation routine for enumerating odd holes and odd antiholes. We also release this underlying routine as "is_perfect"-a standalone open-source perfect graph recognizer and odd hole enumerator designed for broader community reuse. To enhance the practical efficiency of the branch-and-cut algorithm, we calculate the expected number of odd holes and odd antiholes in random Erdos Renyi graphs. In addition, we propose "IterativeModificationHeuristic", the first heuristic for the editing and completion problems, which provides upper bounds. Finally, we demonstrate the empirical effectiveness of the proposed methods through computational experiments on a wide range of instance types; all benchmark instances are publicly available.
arXiv:2508.04225v4 Announce Type: replace
Abstract: Behavior Regularized Policy Optimization (BRPO) leverages asymmetric divergence regularization to mitigate distribution shift in offline reinforcement learning. This paper is the first to study the open question of symmetric BRPO. Using didactic examples, we show that symmetric regularization can outperform asymmetric regularization in addressing one-sided bias, near-boundary policy updates, and projection geometry consistency. However, symmetric divergences do not fit BRPO naturally: they do not permit a closed-form solution when used as regularizers, and can lead to numerical instability when used as optimization objectives. We first introduce a universal BRPO framework using an infinite series of Pearson-Vajda divergences to represent any $f$-divergence, which includes both symmetric and asymmetric divergences. We use a finite-series approximation to obtain the following results for symmetric BRPO: (1) a closed-form optimal policy expression; (2) a numerically stable optimization surrogate; and (3) a tight upper bound on the approximation quality. On the D4RL benchmark and in didactic examples, we show that the proposed method achieves consistently strong results and is robust to the number of terms in the approximation.
arXiv:2607.16316v1 Announce Type: new
Abstract: In this report, we introduce Eddy-VL 1.9B, a compressed multimodal embedding model built on Qwen3-VL-Embedding-2B for offline, edge-deployable vision-language retrieval. Eddy-VL targets air-gapped forensic and investigative settings where cloud APIs are unavailable and low latency is essential. Compression combines (i) probe-driven structural pruning that removes four redundant text-decoder layers (28 to 24) ranked by adjacent-layer linear CKA, and (ii) layered knowledge distillation with hole-covering teacher-student mappings, mid-layer attention-map 1-CKA, and final-layer MSE and cosine losses with Matryoshka dimensions {128, 256, 512, 1024, 2048}. The released model contains 1,926,188,032 parameters (3.85 GB bf16), representing approximately 9.5% fewer parameters than the 2.13B teacher model. Empirical evaluations on MMEB-V2 (78 tasks, VLM2Vec protocol) show that Eddy-VL achieves an overall score of 63.2 compared with 68.9 for the teacher, retaining 91.7% of the teacher's performance while recovering 6.4 of the 12.1 points lost through pruning alone (56.8). Compositional reasoning performance remains close to the teacher on SugarCrepe (86.1 vs. 86.4), MR2-Bench (24.5 vs. 24.7), and ARO (59.5 vs. 60.4), while Winoground group performance (6.8 vs. 8.5) remains the primary limitation. Depth pruning also reduces forward latency by approximately 10% (150.0 to 136.4 ms per image on NVIDIA DGX Spark using FlashAttention-2). We present the architecture, compression methodology, training procedures, and evaluation results, demonstrating the effectiveness of Eddy-VL for multimodal retrieval under constrained edge deployment. Model weights and inference code are publicly available on Hugging Face.
arXiv:2607.16740v1 Announce Type: new
Abstract: Agentic code review in terminal-based environments enables early feedback during local development before pull request creation. However, existing evaluations remain performance-centric and fail to capture the dynamic behaviors of repository-grounded agentic reviewers. Understanding these behaviors is critical for identifying how agentic reviewers succeed, fail, and incur hidden operational costs in practice. Then, we analyze the reviewers' behavior based on their trajectories. Our results show that agentic reviewers achieve higher review precision but incur substantial exploration and validation overhead, while successful reviews are associated with stronger planning and less downstream validation. These findings highlight the potential benefits of trajectory-aware and cost-sensitive evaluation of future agentic code review systems.
arXiv:2607.17766v1 Announce Type: new
Abstract: Extra context is valuable for simultaneous speech translation of technical talks, but injecting the entire document context into every streaming segment is often too coarse. Through diagnostic experiments, we find that context gains mainly come from paper-specific terminology recovery rather than uniform semantic enhancement. We therefore propose EGTA, an Evidence-Grounded Terminology Adaptation framework that builds a document terminology memory, selects compact candidate terms conditioned on the current streaming state, and adapts ASR/speech-side and decoder-side decision spaces using only the selected terms. EGTA can be instantiated in cascaded, end-to-end, and generation-only SimulST settings without full-model fine-tuning. We evaluate EGTA on an ACL technical-talk SimulST evaluation suite consisting of MCIF-dev and ACL60/60-dev. On MCIF-dev, EGTA-RG improves BLEU by +1.05/+0.59, XCOMET-XL by +0.019/+0.006, named-entity recall by +79\%/+73\% relative, and acronym recall by +0.099/+0.171 on En$\rightarrow$Zh and En$\rightarrow$De. Across MCIF-dev latency settings, EGTA consistently improves XCOMET-XL, named-entity recall, and acronym recall. External validation on ACL60/60-dev further shows consistent terminology-recall gains without additional fine-tuning. Shuffled-memory controls and activation audits provide evidence that the improvements are tied to paper-specific evidence alignment rather than generic context prompting.
arXiv:2607.16438v1 Announce Type: new
Abstract: Stochastic Mckean-Vlasov models have a substantial importance in different fields such as finance, biology and control. This paper puts the light on stochastic proportional delay Mckean-Vlasov model with L\'evy jump where the non-jump coefficients are granted the permission to grow beyond linearity. The truncated Euler-Maruyama algorithm is then applied to our addressed model where the convergence rate and almost sure exponential stability of the aforementioned numerical algorithm are being investigated. Finally, numerical examples are presented to foster the theoretical analysis done throughout the paper
arXiv:2607.17419v1 Announce Type: new
Abstract: Linear attention promises constant-time recurrent inference but degrades sharply on associative recall. We formulate attention recall as a spherical-packing problem and introduce Kernelized Linear Attention Activations (KATA), a framework whose feature maps are derived from first principles by certifying nonnegative attention weights through a self-dual homogeneous cone. Building on this observation, we show that rank-one positive semi-definite (PSD) features offer a favorable capacity--interference tradeoff. KATA recovers a parameter-free convex output gate and characterizes associative capacity through the Welch interference floor. For tolerances above this floor, KATA enlarges the state without adding parameters and admits spherical codes with exponentially many keys in the projection dimension. We implement KATA as fused Triton kernels at two operating points: a flash-attention-style forward up to ${\sim}1.6\times$ FlashAttention-2 throughput, and an exact $O(T)$ chunked-state form that reaches ${\sim}11\times$ FlashAttention-2 forward throughput at $131$k tokens. An associative scan of the first-order feature lowers the inter-chunk recurrence depth to $O(\log(T/C))$ for chunk size $C$ and averages ${\sim}2.4\times$ the throughput of a matched sequential linear-attention baseline. On long-range MQAR and repeated-key overwrite, several KATA variants outperform Gated DeltaNet, with parameter counts and state sizes reported alongside accuracy. Induction preserves near-perfect recall, while kernel benchmarks show that the maps can be implemented efficiently. KATA retains $0.985$ MQAR at a $16\times$ out-of-distribution length, approaching the softmax with roughly one quarter of the KV-cache entries. Experiments on 340M-parameter LLMs reveal a feature-dependent fluency trade-off and clarify how positional embeddings, delta rules, and decay gates interact with feature geometry.