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.
Science Journals
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.18209v1 Announce Type: cross
Abstract: This paper considers a multi-environment factor model in which high-dimensional covariates are collected from heterogeneous environments, with auxiliary labels available in a subset of these environments. The joint distribution of the covariates may vary across environments, whereas the latent structure is decomposed into invariant factors with shared loadings and heterogeneous factors with environment-specific loadings. Such a model is motivated by transfer learning and latent factor regression, where one seeks stable low-dimensional representations for both interpretation and robust out-of-sample prediction of the response $Y$. Leveraging the invariance principle, we show that the invariant and heterogeneous factors are disentangled under a minimal structural condition. Based on this, we propose ATLAS, an Auxiliary-label and invariance-guided Transfer via Latent Alignment across heterogeneous environmentS. ATLAS is a unified procedure that leverages the invariance principle to separate aligned invariant and unaligned heterogeneous factors, and further exploits supervision from auxiliary labels to extract prediction-invariant and transferable factors from those unaligned heterogeneous factors. ATLAS yields near-oracle performance for downstream latent factor regression, enables transferable prediction in new environments through the full latent signal when auxiliary labels are available, and reduces to robust invariant-factor-only prediction otherwise. We establish sharp non-asymptotic error bounds for recovering invariant and heterogeneous factors, identifying all the response-invariant factors, and estimating the invariant signal in $Y$.
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:1905.12913v2 Announce Type: replace
Abstract: This paper investigates the problem of utilizing network topology and partial timestamps to detect the information source in a network. The problem incurs prohibitive cost under canonical maximum likelihood estimation (MLE) of the source due to the exponential number of possible infection paths. Our main idea of source detection, however, is to approximate the MLE by an alternative infection path based estimator, the essence of which is to identify the most likely infection path that is consistent with observed timestamps. The source node associated with that infection path is viewed as the estimated source $\hat{v}$. We first study the case of tree topology, where by transforming the infection path based estimator into a linear integer programming, we find a reduced search region that remarkably improves the time efficiency. Within this reduced search region, the estimator $\hat{v}$ is provably always on a path which we term as \emph{candidate path}. This notion enables us to analyze the distribution of $d(v^{\ast},\hat{v})$, the error distance between $\hat{v}$ and the true source $v^{\ast}$, on arbitrary tree, which allows us to obtain for the first time, in the literature provable performance guarantee of the estimator under limited timestamps. Specifically, on the infinite $g$-regular tree with uniform sampled timestamps, we get a refined performance guarantee in the sense of a constant bounded $d(v^{\ast},\hat{v})$. By virtue of time labeled BFS tree, the estimator still performs fairly well when extended to more general graphs. Experiments on both synthetic and real datasets further demonstrate the superior performance of our proposed algorithms.
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: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.
arXiv:2607.17118v1 Announce Type: cross
Abstract: The planted subgraph detection problem asks whether a random graph contains a hidden structured subgraph. In the classical formulation, the entire adjacency matrix is observed and one distinguishes between an Erd\H{o}s--R\'enyi random graph and one obtained by planting a copy of a prescribed graph inside an Erd\H{o}s--R\'enyi random graph. The statistical and computational limits of this problem under full observation are now well understood, even for arbitrary planted subgraphs.
In this paper, we investigate an information-limited version of the problem in which the planted structure is an arbitrary sequence of graphs $\Gamma=(\Gamma_n)_{n\geq1}$, where $\Gamma_n$ is embedded in an ambient graph on $n$ vertices, but the observer does not have access to the full adjacency matrix. Instead, information is acquired through a limited number of non-adaptive edge queries. We study the minimum query complexity required for reliable detection.
We derive general information-theoretic lower bounds and complementary algorithmic upper bounds on the query complexity as functions of the query budget and structural properties of the planted graph. The proposed algorithms exploit three distinct structural mechanisms: dense local motifs, high-degree vertices, and global edge density. We establish matching bounds, up to polylogarithmic factors, for several broad families of planted graphs, including clique-like, bounded-cover, and hub-dominated graph classes. Our framework substantially generalizes existing query-complexity results for planted clique and planted dense subgraph models, providing a unified treatment of arbitrary planted subgraphs under restricted graph access.
arXiv:2607.17112v1 Announce Type: new
Abstract: This paper presents a unified dataset and modeling framework for financial alternative dispute resolution (ADR) cases collected from multiple Japanese ADR organizations. Each case consists of paired claims from the complainant and the respondent with a binary settlement outcome.
We introduce a functional tagging scheme to represent dispute structures and propose a multi-task model that jointly performs dispute classification and settlement prediction. Experimental results show that incorporating dispute structure improves prediction performance, and large language models achieve comparable or superior performance in several domains. These findings suggest that dispute structures are partially shared across ADR domains.
arXiv:2607.17050v1 Announce Type: new
Abstract: GUI agents must reason about how actions transform interface states, but end-to-end success rates entangle this ability with perception, grounding, planning, and recovery. We introduce EvoGUI, a diagnostic framework that converts normalized GUI trajectories into three complementary visual question answering probes: temporal ordering, inverse action/value prediction, and contrastive one-step successor discrimination. Their labels are derived from trajectory order and logged actions, requiring no additional task-label annotation after trajectory normalization. We instantiate EvoGUI-Bench from Mind2Web and WebLINX, yielding 3,000 instances across 120 domains, and evaluate 28 vision-language model configurations zero-shot. The strongest model reaches only 60.4 EvoGain, while model scale and GUI specialization do not reliably predict performance. These results establish EvoGUI-Bench as a scalable diagnostic complement to end-to-end GUI-agent evaluation while exposing substantial headroom in state-transition understanding. The source code is publicly available at https://github.com/Yyhhh6/EvoGUI.
arXiv:2105.00990v3 Announce Type: replace
Abstract: Autonomous control in high-dimensional, continuous state spaces is a persistent and important challenge in the fields of robotics and artificial intelligence. Because of high risk and complexity, the adoption of AI for autonomous combat systems has been a long-standing difficulty. In order to address these issues, DARPA's AlphaDogfight Trials (ADT) program sought to vet the feasibility of and increase trust in AI for autonomously piloting an F-16 in simulated air-to-air combat. Our submission to ADT solves the high-dimensional, continuous control problem using a novel hierarchical deep reinforcement learning approach consisting of a high-level policy selector and a set of separately trained low-level policies specialized for excelling in specific regions of the state space. Both levels of the hierarchy are trained using off-policy, maximum entropy methods with expert knowledge integrated through reward shaping. Our approach outperformed human expert pilots and achieved a second-place rank in the ADT championship event.