arXiv:2607.10188v2 Announce Type: replace
Abstract: Breast cancer remains the most commonly diagnosed malignancy among women worldwide, yet accurate detection and characterization of breast masses in mammography remain challenging due to subtle intensity variations, heterogeneous tissue densities, and indistinct lesion boundaries that complicate radiological interpretation. To address these limitations, we propose BiLoG-Net, a deep learning framework that jointly performs breast mass segmentation and malignancy classification through bi-context location-aware feature modeling and segmentation-guided attention mechanisms. Our architecture integrates a novel encoder-decoder paradigm with Fire-based feature extraction, lightweight global and local feature enhancement modules, and adaptive location-aware gating to simultaneously capture long-range contextual dependencies and fine-grained boundary-sensitive details. Unlike conventional multi-stage pipelines, our tightly coupled multi-task design enables mutual reinforcement between pixel-level localization and image-level diagnosis, reducing error propagation while producing spatially grounded malignancy predictions. Evaluated on CBIS-DDSM and INBreast benchmarks, BiLoG-Net achieves state-of-the-art performance with Dice scores of 94.20% and 93.10%, classification accuracies of 95.20% and 93.60%, and AUC values of 97.10% and 96.00%, respectively, substantially outperforming existing CNN and transformer-based baselines. By combining precise boundary delineation with reliable malignancy assessment in a single end-to-end model, this work holds strong potential for clinical computer-aided detection systems, helping radiologists prioritize suspicious cases and improve screening efficiency in busy clinical settings.
Science Journals
arXiv:2607.13171v1 Announce Type: new
Abstract: Many open problems across physical, biological, and engineered systems involve non-equilibrium transport processes where the governing conservation laws are known, but the underlying constitutive relations remain latent and time-varying. Conventional data-driven approaches like deep neural networks capture statistical patterns but routinely violate fundamental mass conservation. Here, we introduce a unified Bayesian inverse transport framework that resolves this by embedding Bayesian Neural Networks (BNNs) directly within exact partial differential equations in age-time space. By evaluating this framework on complex, real-world human cohort advection across China, Japan, and South Korea, we demonstrate that this physical constraint enables consistent uncertainty propagation and missing-data reconstruction from sparse observations. Beyond demography, this framework provides a generalizable foundation for observing and forecasting non-equilibrium boundary dynamics across various fields.
arXiv:2607.13754v1 Announce Type: new
Abstract: Safeguarding patient privacy while enabling meaningful healthcare data use remains critical under GDPR and HIPAA. Existing compliance methods are manual, error-prone, and separate policy audits from data-level assessments. This paper presents PriEval-Protect, a two-phase framework for unified privacy risk evaluation and mitigation. The evaluation phase combines regulatory compliance scoring using a fine-tuned legal LLM with RAG, and technical analysis via encryption type, data architecture, and metrics including similarity, uncertainty, adversary success, and information gain/loss. A composite risk score uses weighted aggregation via Analytic Hierarchy Process. The protection phase recommends countermeasures including federated learning and differential privacy based on assessed risk. Results on hospital documents and datasets demonstrate regulation-aligned, explainable assessments, bridging legal conformance and data-level risk analysis.
arXiv:2607.13722v1 Announce Type: cross
Abstract: The potential capabilities of quantum computers motivated the development of cryptographic protocols suitable for securing communication against adversaries with access to large fault-tolerant quantum computers. However, even though current quantum computers are limited in terms of size and precision, they can still be useful for finding loopholes and weaknesses in the post-quantum cryptographic protocols. In this work, we present an attempt to utilize the capabilities of Quantum Generative Adversarial Networks (QGANs), one of the promising architectures used in quantum machine learning, for this purpose. We describe an example application of QGAN architecture for the purpose of loading the probability distribution of the hash-based digital signatures into the memory of a quantum computer. Our results confirm that near-term hybrid quantum-classical methods possess capabilities required for this purpose. The presented approach can be used as a first step in the workflow, enabling the utilization of quantum computing for attacking post-quantum cryptographic primitives.
arXiv:2607.13116v1 Announce Type: new
Abstract: ThinPrep Cytologic Test (TCT) enables early cervical cancer screening, but manual reading is time-consuming and yields inconsistent diagnostic results among cytopathologists. Existing AI detection models perform poorly under real clinical conditions, primarily restricted by two key constraints: unbalanced spatial distribution of cell populations in TCT slides, and limited high-quality annotated cytology data relying on professional pathologist labeling. To address these limitations, we propose a Cell-Distribution Normalization (C-Norm) method. By decoupling abnormal and normal cells from the original TCT images and re-synthesizing them, this method ensures a uniform distribution of cell populations, thereby mitigating generalization degradation caused by distribution bias. Building upon this, we integrate the YOLOv12 framework with a DINOv3 module. This hybrid architecture leverages the advanced detection capability of YOLO models and the superior feature representations of DINOv3 to capture subtle morphological nuances essential for precise recognition of TCT images. Extensive experiments demonstrate that our proposed method achieves state-of-the-art performance, significantly outperforming mainstream detection algorithms. The complete implementation is available at: https://github.com/ddw2AIGROUP2CQUPT/Cell-Norm
arXiv:2605.31272v2 Announce Type: replace
Abstract: As predictive models are increasingly deployed in high-stakes settings such as credit approval, there is a growing need for post-hoc methods that provide recourse to affected individuals. Many such models operate on tabular data, where features correspond to real-world attributes. Recently, in-context learning (ICL) has enabled large language models to perform tabular prediction by conditioning on labeled examples at inference time, without explicit training. However, algorithmic recourse for tabular decision-making under ICL remains largely unexplored. In this work, we present the first study of algorithmic recourse for tabular data under ICL. We carry out a theoretical analysis, showing that recourse remains well-defined and bounded, and we characterize how recourse converges toward classical solutions as the context size increases. In practice, we propose a novel zeroth-order recourse framework, Adaptive Subspace Recourse for In-Context Learning (ASR-ICL), that efficiently generates actionable and sparse recourse for black-box ICL models. The proposed framework naturally extends to multi-class tabular tasks. Experiments across multiple real-world datasets and models demonstrate that ASR-ICL achieves recourse quality comparable to existing methods with fewer queries and empirically confirm the predicted convergence behavior, supporting our theoretical analysis.
arXiv:2607.13937v1 Announce Type: cross
Abstract: The classical observables of position and momentum are not well adapted to particles in a microphysical situation where typical probability distributions are characterized by a substantial dispersion. We propose the use of more robust quantum observables for probabilistic classical particles. The quantum observables are statistical observables which do not take fixed values for a given classical position and momentum. Solutions of the Liouville equation are discussed in the quantum formalism for classical statistics. Statistical observables are represented by non-commuting operators. No classical correlation function is defined for these observables and Bell's inequalities do not apply. We demonstrate for a general potential how a quantum system emerges from classical statistics. For the particular cases of a harmonic potential and a Coulomb potential we investigate subsystems which describe all features of a quantum particle. This covers the discrete energy spectrum of the hydrogen atom and quantum harmonic oscillator. We discuss the interference for the double-slit experiment. Conserved statistical observables may also be relevant for the probabilistic dynamics of dust or planets.
arXiv:2606.00244v2 Announce Type: replace
Abstract: In terrestrial networks, especially in urban areas, cell-edge users often face significant capacity limitations due to high path loss, shadowing, and inter-cell interference (ICI). This paper proposes integrating a high-altitude platform station (HAPS) into terrestrial networks, where terrestrial base stations (BS) can alleviate these issues by relaying data intended for cell-edge users via HAPS, thereby leveraging line-of-sight (LoS) links. We formulate an energy-efficiency (EE) maximization problem to jointly design beamforming vectors at the BS and HAPS with the goal of improving cell-edge user performance. Since the resulting problem is non-convex, we develop an online optimization framework based on a graph neural networks (GNN), which effectively captures the network topology. Numerical results show that the proposed HAPS-assisted architecture improves network performance, particularly by increasing the 5th-percentile EE, thereby enhancing service for cell-edge users.
arXiv:2606.01004v2 Announce Type: replace
Abstract: A recent pedagogical paper by Strauch concretely demonstrated how interaction-mediated entanglement can suppress fringe visibility in a one-dimensional model of the electron double-slit experiment. Here we extend that framework to model actual experimental data from electron biprism interferometry. Kerker et al. showed that the macroscopic QED model of Scheel and Buhmann successfully describes their measured results. We show that this Scheel-Buhmann model can be recovered from Strauch's simplified framework by employing a Markov approximation and including thermal effects. The resulting decoherence rate is expressed in terms of mode-resolved scattering probabilities familiar from electron energy-loss spectroscopy (EELS), directly relating EELS to decoherence. The thermal dependence is significant in its own right, as recent theoretical work suggests that visibility reduction could serve as a non-invasive thermal probe for nanoscale systems. This progression from a toy model, to a quantitative account of real data, to a measurement application offers a case study in how simplified models can be made experimentally relevant.
arXiv:2606.02911v2 Announce Type: replace
Abstract: Current research primarily focuses on model performance, while comparatively less attention has been devoted to uncertainty estimation, particularly in settings where LLMs are increasingly used to generate annotated data. We introduce a framework combining conformal prediction with Collaborative Filtering-style annotators' representation to model LLM behavior in relation to human annotators and to analyze patterns of agreement and disagreement. Using Non-Conformity Scores, we introduce the Ghost Prediction metric and the Ghost Annotator representation to quantify cases in which model predictions diverge from all available human annotations. We compute cosine similarity measures to explore differences in model behavior across sociodemographic axes. We evaluated four LLMs of different size and families across four content moderation datasets. Our finding shows that while we find that all models uncertainty increases with annotator disagreement, larger models tend to be more confident in the classification of texts that are not aligned with any human annotation. Finally, the Ghost Annotator framework reveals a consistent and robust pattern of demographic misalignment, suggesting a structural bias likely rooted in pretraining corpora.
arXiv:2606.05494v4 Announce Type: replace
Abstract: Automatic text summarization has become increasingly important due to the rapid growth of digital textual information. This paper presents a Multi-Model Summarization Framework designed to improve the robustness and quality of abstractive text summarization. Relying on a single model often leads to inconsistent summarization quality across articles with varying structures and topics. To address this limitation, the proposed framework integrates multiple fine-tuned transformer-based summarization models and introduces a metric-based selection mechanism. In this framework, each model independently generates a candidate summary for the same input article. The generated summaries are then evaluated using automatic evaluation metrics that capture both lexical similarity and semantic relevance. Based on these scores, the framework selects the highest-quality summary as the final output. The models are fine-tuned and evaluated on the widely used CNN/DailyMail news summarization dataset. Experimental results demonstrate that the proposed framework achieves the highest BERTScore among all compared methods with a score of 88.63%. It also outperforms several LLMs such as GPT3-D2, Falcon-7b, and Mpt-7b, highlighting its effectiveness and robustness. These findings highlight the effectiveness of leveraging multiple transformer-based models within a metric-based selection strategy to improve the quality and robustness of automatic text summarization systems.
arXiv:2606.09246v2 Announce Type: replace
Abstract: With the growing demand for realistic virtual humans, parametric body models have become a cornerstone of modern medicine, sports, and entertainment applications. However, most of these models are inherently limited: they only capture the 3D surface of the skin, offering no insight into the complex bio-mechanical structures that generate motion. As more applications expand towards biomechanics, the need for virtual human models that go beyond the skin has become increasingly evident. Traditional soft-tissue simulations, such as FEM, are accurate but non-scalable and too computationally expensive for most common applications. Alternatively, existing biomechanical tools can simulate muscular forces and activations, but do not model changes in external shape, restricting how activations correlate with actual observable anatomy. This motivates a novel inverse research problem: recovering muscle deformations directly from visible surface observations - i.e., from the skin, and thus the pose. In this work, we present SOMA (from Surface Observations to Muscle Anatomy), a person-specific model that infers spatio-temporal muscle behavior from surface signals obtained using RGB cameras, and SKIM, a subject-specific soft-tissue deformation dataset. To the best of our knowledge, this is the first method that attempts to recover muscle deformations from multi-view RGB data. We show how our method provides anatomically grounded animations without the complexity of traditional simulations, leading to a scalable and cost-effective solution. Data and code are available.
arXiv:2606.09289v3 Announce Type: replace
Abstract: Understanding tactical organisation in association football requires identifying in-possession match phases that are shaped by evolving tactical intentions rather than by spatial patterns alone. This study proposes an intention-driven framework for identifying phases from tracking data. Seven German Bundesliga matches recorded at 25 Hz with TRACAB were analysed. A hierarchical model was defined with three tactical intentions (Invade Opponent Space, Keep Possession, Scoring) and six phases (Build Up, Progression, Counter Attack, Maintenance, Sustained Threat, Finishing). A Temporal Graph Attention Network (T-GAN) combined frame-level player-interaction graphs, contextual features, and Transformer-based temporal modelling. Performance was evaluated using frame-level F1 and temporal Intersection over Union (tIoU). T-GAN achieved macro-average frame-level F1 scores of 0.87 at the intention level, 0.76 for invasion-related phases, and 0.79 for scoring phases. After filtering, mean class-wise tIoU increased from 0.44 to 0.67 for intentions and from 0.40 to 0.57 for phases, showing that sequence-level evaluation captured fragmentation and boundary errors missed by frame-level metrics. Model comparisons indicated that Transformer-based sequence modelling drove coherent segmentation, while graph-based relational modelling was most beneficial for Counter Attack. Misalignment analysis revealed common sequence level misalignments, mainly Build Up/Progression ambiguity, Build Up/Maintenance confusion, Counter Attack/Progression inconsistency, and shortened pre-shot Finishing segments. Overall, the framework translates tracking data into tactically interpretable phase representations for automated annotation, tactical analysis, and playing-style profiling.
BARS: Benign-Anchored Ranking and Selection for False Alarm Reduction in Network Intrusion Detection
arXiv:2607.13203v1 Announce Type: new
Abstract: False alarms remain a major barrier to deploying network intrusion detection systems (NIDS). In high-volume environments, even a sub-1% false positive rate can generate tens of thousands of daily alerts. Filter-based feature selection is attractive because it operates upstream of the classifier and adds no inference-time cost. However, classical filters use class-symmetric criteria that ignore the asymmetry of intrusion detection, where benign traffic defines the baseline and attacks are deviations from it. A recent class-asymmetric filter, Classwise Mean Deviation (CMD), addresses this issue but anchors its score to a global mean that shifts toward attack distributions under class imbalance, weakening the deviations it aims to capture.
We propose Benign-Anchored Ranking and Selection (BARS), a two-stage filter that replaces CMD's global anchor with the benign-class mean and applies an order-preserving decorrelation step. We evaluate BARS on CICIDS2017, CICDDoS2019, and UNSW-NB15 using feature budgets k = {5, 10, 20, 30, 40}. On attack-majority datasets, where global-anchor bias is strongest, BARS reduces false positive rate relative to CMD by 15.4% on UNSW-NB15 at k = 20 and by 21% to 23% on CICDDoS2019 at small feature budgets while preserving true positive rate and macro-F1. On benign-majority data, BARS and CMD converge, consistent with the theoretical limit where global- and benign-anchored scores coincide. BARS is a principled refinement of CMD rather than a universally dominant filter. Although Pearson Correlation and Mutual Information often achieve lower false positive rates, they exceeded 1 TB of memory on the largest benchmarks in our evaluation. BARS retains linear-time scoring and a low memory footprint, making it suitable for resource-constrained deployments.
arXiv:2607.13056v1 Announce Type: new
Abstract: Current vision-language-action (VLA) benchmarks primarily evaluate isolated manipulation skills while leaving human-robot interaction structure largely unmodeled. However, real-world collaboration fundamentally requires coordination under shared agency, including intent understanding, temporal synchronization, protocol adherence, and safe interaction in dynamic environments. To address this gap, we introduce HRIBench, a diagnostic benchmark for intent-aware human-robot collaboration based on executable interaction scenarios. HRIBench represents collaborative tasks as structured scenario scripts that explicitly model agent roles, temporal dependencies, coordination constraints, and human behavior distributions. Building on this abstraction, HRIBench defines three representative interaction roles: Instructor, Collaborator, and Intruder, covering intent communication, joint coordination, and robustness under human intervention. The benchmark contains 13 role-conditioned tasks with over 650 evaluation episodes generated from diverse interaction trajectories and scene variations. Beyond binary task success, HRIBench introduces interpretable interaction-centric metrics spanning synchronization, responsiveness, protocol compliance, and safety. We evaluate adapted policies based on GR00T, pi0.5, and ACT under a unified protocol. Results show that current foundation robot policies struggle substantially in collaborative settings despite strong manipulation ability, revealing major limitations in temporal coordination and intent-aware behavior. Fine-tuning on HRIBench consistently improves collaborative performance. In a real-world adaptation study, simulation data generated by HRIBench improves GR00T N1.5's physical-task success rate from 0.10 to 0.43, demonstrating the benchmark's value for advancing interaction-centric robot learning.
arXiv:2607.13457v1 Announce Type: new
Abstract: We present a benchmark and reference system for live captioning of Sikh Kirtan - the continuous, sung recitation of verses from the Sri Guru Granth Sahib Ji (SGGS). Unlike open-vocabulary lyrics transcription, Kirtan captioning is a closed-vocabulary problem: every displayed line must be an exact, word-for-word line from the canonical scripture, because displaying misspelled Gurmukhi is considered religiously inappropriate. We formalize the task as predicting, at every time t, a pair (shabad_id, line_idx) or null, and organize the problem space into a 2x2 matrix along two orthogonal axes: live vs. offline (causal vs. full-audio access) and blind vs. oracle (shabad identity discovered vs. given). We release v1 of the benchmark - 4 hand-annotated Kirtan recordings x 3 cold-start offsets = 12 evaluation cases, ~57 minutes of scored audio - together with a scorer that computes frame accuracy at 1s resolution over a scored region, with a 1s collar and gap-tolerant scoring at segment boundaries. We describe a reference system (fine-tuned 120M IndicConformer -> fuzzy matcher -> state machine; INT8 ONNX; RTF ~0.05 on one Apple Silicon core) that achieves 57.9% overall frame accuracy across all 12 cases (10/12 correct shabad locks) on the hardest variant (live x blind). We compare against three trivial baselines (empty, shifted-5s, perfect) and discuss why standard ASR metrics (WER/CER) measure transcription accuracy rather than the display accuracy this task requires. The benchmark, reference system, and a live deployment are released under permissive licenses to facilitate further improvements.
arXiv:2607.13039v1 Announce Type: new
Abstract: Safety evaluations for dual-use biology assistants often measure base-model capability, refusal behavior, or jailbreak success. These metrics miss a deployment question: for a fixed base model, how does the access condition users actually see change benign utility and harmful actionable assistance? I introduce safeguard-conditioned uplift, a protocol for comparing deployed access conditions through a human-judged utility-risk frontier. I evaluate Claude Sonnet 4.6 and Gemini 3.5 Flash under helpful prompting, safety prompting, and an external safeguarded assistant on a 108-task surrogate benchmark, with the headline claim restricted to a locked 18-task held-out split. In a 600-row blinded human audit, the safeguarded assistant reduces harmful actionability relative to helpful prompting by -0.063 over 49 matched response pairs, with bootstrap 95% interval [-0.117, -0.011], while correctness changes by +0.009 with interval [-0.057, +0.077]. Adaptive, Test-B, cue-ablation, and controller-baseline checks support the measurement story but also show non-dominance: safety prompting is often strongest for Claude, while external control helps more for Gemini and can reduce benign utility. The contribution is not a universal defense. It is a deployment-level evaluation target, plus a learned risk-budgeted calibration procedure, for measuring how user-facing access conditions move the utility-risk frontier.
arXiv:2607.13174v1 Announce Type: new
Abstract: Multimaterial 3D printing enables the fabrication of functionally graded components, but optimizing their spatial material distribution alongside structural topology remains a formidable challenge due to high-dimensional design spaces and complex constitutive modeling. This paper presents an end-to-end computational framework integrating sparsified physics-augmented neural networks with finite-element-based topology optimization. By extracting closed-form, composition-aware hyperelastic constitutive laws from experimental data, this approach facilitates exact symbolic differentiation via the adjoint state method implemented with FEniCSx, efficiently circumventing the bottlenecks of applying neural network constitutive models. This pipeline is deployed on soft robotic gripper applications, demonstrating continuous composition optimization for highly anisotropic contact responses, and the concurrent optimization of macroscopic topology and material distribution under non-failure stretch constraints. This methodology could replace laborious empirical prototyping, establishing interpretable machine-learning models as practical, robust design primitives for advanced multimaterial additive manufacturing.
arXiv:2607.13147v1 Announce Type: new
Abstract: Millions of people use TikTok to seek health information, yet little is known about how users' search queries shape exposure to health misinformation. Whereas prior algorithm audits have focused primarily on recommendation feeds, we examine TikTok's search system, where users explicitly express their information needs through query formulation. We conduct a controlled sock-puppet audit of TikTok Search using 30 fresh accounts assigned to six experimental conditions spanning three information-seeking framings (Medical Information, Alternative Medicine, and Peer Narrative) and two breast-cancer contexts (Symptom Noticing and Active Treatment). Across 9,020 usable search-result exposures, annotated using a validated vision-language model pipeline, we find that query framing is strongly associated with misinformation exposure. Alternative Medicine queries returned misinformation in 54.1\% of cancer-relevant results within the Symptom Noticing context and 53.5\% within the Active Treatment context, 8.6 times and 7.6 times higher, respectively, than clinically framed Medical Information queries. Even Medical Information queries returned measurable levels of possible misinformation (6.3\%--7.1\%), suggesting that explicit medical intent alone does not eliminate exposure. Moreover, for Alternative Medicine queries, possible misinformation appeared throughout the ranked search results rather than only near the top, showing that exposure is not confined to the highest-ranked results. Videos labeled as misinformation were also substantially more likely to contain comments promoting unsupported treatments or anti-standard-care views. These findings demonstrate that search query framing plays a central role in shaping misinformation exposure on TikTok and highlight the importance of auditing query-driven search systems alongside recommendation algorithms.
arXiv:2606.10711v2 Announce Type: replace
Abstract: The agentic web, in which users interact with the internet largely through agents acting on their behalf, is now technically feasible. However, many of the consumer and social benefits that could be realized by online AI agents acting scrupulously in their principals' interest are currently obstructed by outdated laws, terms of service, and other less formal practices which allow online platforms to block and degrade agent access, often in secret. Few distinctions are currently drawn between "malicious bots" and AI agents acting with the express delegated authority of a user. For the agentic web to realize its promise, it needs not only the technical infrastructure of protocols and interfaces, but the normative infrastructure of a broadly-accepted and socially-beneficial set of laws, norms and practices governing agentic access to online properties. Building that normative infrastructure requires a society-wide conversation. This paper aims to help precipitate that conversation, to identify normative principles that can guide it, and to advocate for policies that enable users' appropriately delegated agents to act online on their behalf, with as few curbs on their doing so as is reasonable given the other legitimate interests at stake.
arXiv:2606.11283v2 Announce Type: replace
Abstract: We study the problem of generating synthetic data under differential privacy. We establish fixed-parameter tractability (FPT) for this problem where the parameter is the treewidth of the query family's incidence graph. Our algorithms attain optimal error rates across all regimes and are realized by two different approaches: the first is based on linear programming (LP) and the FPT of the separation problem for the LP dual; the second is based on a subsampled private multiplicative weights method, where we obtain FPT for sampling from Gibbs distributions. Both approaches are unified by a dynamic programming framework over a tree decomposition.
arXiv:2606.12198v2 Announce Type: replace
Abstract: Large Language Models (LLMs) offer unprecedented potential for enhancing recommendation systems through their world knowledge and reasoning capabilities. However, existing approaches often rely on structured IDs or offline processing, limiting semantic richness, real-time adaptability, and user-facing interpretability. In this paper, we introduce a novel framework that enables real-time generation of LLM-based user interest personas for a large-scale commercial video recommendation platform. Our method generates natural-language user interest personas that address the exploitation-exploration trade-off by combining the summarization of existing interests with novel topics, directly during serving. To overcome the computational challenges of online LLM inference at a billion-user scale, we design a cost-efficient architecture leveraging knowledge distillation, asynchronous inference, and input optimization via semantically clustered video representations. Extensive offline evaluations, user studies, and live A/B tests demonstrate significant improvements in viewer value. This work bridges the gap between high-level semantic understanding and industrial-scale recommendation, paving the way for more dynamic, explainable, and satisfying personalized experiences.
arXiv:2606.13061v2 Announce Type: replace
Abstract: Reasoning-driven universal multimodal embedding has advanced rapidly by introducing Chain-of-Thought (CoT) reasoning into the embedding pipeline. Despite the strong performance across both general and complex tasks, this paradigm suffers from two core limitations: (i) autoregressive CoT reasoning incurs high computational cost, making it impractical for low-latency retrieval; and (ii) embedding performance is heavily coupled with CoT annotation quality, making large-scale training unreliable. These raise fundamental questions: Is textual CoT the optimal form of reasoning for embedding, and can effective embedding reasoning be accomplished in latent space? To this end, we propose LaME (Latent Reasoning Multimodal Embedding), which formulates embedding-oriented latent reasoning as a weakly supervised information bottleneck. LaME employs K learnable reason tokens as a fixed-capacity bottleneck, completing all reasoning within a single forward pass. The two weak supervision signals structurally decouple contrastive from autoregressive objectives and eliminate dependence on CoT annotations, while a two-stage training pipeline ensures stable convergence. Experiments on MMEB-v2 and MRMR show that LaME achieves competitive performance, surpassing some explicit CoT-based models, while delivering 60x faster inference than explicit CoT methods and 2x faster than latent baselines with throughput comparable to discriminative embedding models. Code is available at https://github.com/PeppaWu/LaME.
arXiv:2607.13230v1 Announce Type: new
Abstract: Agentic AI introduces new insurance challenges because autonomous AI systems can make decisions, invoke tools, modify external environments, and interact with third-party services. This paper develops an AI-native mathematical framework for underwriting, pricing, and contract design for agentic AI deployments. A deployment is represented by a risk state that captures autonomy level, operational authority, permission exposure, governance maturity, and dependency concentration. The framework maps the risk state to event probabilities, loss severities, governance costs, premiums, deductibles, coverage allocation, and policy covenants, and formulates an optimization problem for insurance contract design under participation, profitability, and incentive compatibility constraints. The paper establishes structural properties of insurability, including characterization of an insurability region, monotone deterioration of feasibility with increasing exposure, and governance certification thresholds. Insurance is further interpreted as both an operational cost and a regulatory mechanism for AI deployment. A healthcare case study illustrates contract optimization, sensitivity analysis, and automated claims processing for agentic AI systems.
arXiv:2607.13390v1 Announce Type: new
Abstract: I-mode is a promising confinement regime for future fusion reactors because it combines enhanced energy confinement with L-mode-like particle transport and naturally ELM-free operation. Previous EAST I-mode studies were performed exclusively under lithium-conditioned wall conditions. Here we report the first systematic experimental investigation of I-mode under boronized wall conditions on EAST and compare it with an existing lithium-conditioned I-mode database at the same toroidal field, $B_t = 2.47$\,T. The boronized-wall dataset exhibits a substantially broader accessible density range, with the Greenwald fraction extending from $f_{\mathrm{GW}} = 0.26 - 0.77$ , compared with $f_{\mathrm{GW}} = 0.35 - 0.54$ under lithiation. A higher normalized $\mathrm{D}_\alpha$ emission suggests that enhanced edge recycling may contribute to this density extension. A striking increase in favorable-configuration I-mode is also observed: $51\%$ boronized-wall discharges are obtained in favorable-configuration, compared with only $8\%$ lithium-conditioned discharges. These favorable-configuration cases are concentrated at high density and exhibit a deeper radial electric-field($E_r$) well and stronger $\mathbf{E_r}\times\mathbf{B}$ velocity shear. When ETRO is present, the associated transition between electron and ion turbulence is similar under the two wall conditions, although ETRO occurs less frequently ($15\%$) under boronization. An empirical EAST I-mode energy confinement scaling at fixed $B_t$ is obtained, $\tau_E = 3.29 I_p^{0.51 \pm 0.10} P_{\mathrm{loss}}^{-0.53 \pm 0.05} \bar{n}_e^{0.08 \pm 0.07}$, indicating weaker power degradation than IPB98(y,2) H-mode scaling and a weak density dependence. These results show that boronization can broaden the operational space of EAST I-mode and support the development of reactor-relevant ELM-free scenarios.