TodayNewsResearchFieldsStacksMarketAnalytics
⌘K

Research

New papers ranked by attention, with their code, models and discussion linked. Pick a field on the left.

WeekMonthQuarterAll
NewestMost relevant

Papers

Open problems

Rising research topics

Ask the research

Sample
ByteTrail · AI and developer-tools intelligence
NewsResearchStacksAPI
Fields · this week
All fields2517Multimodal507AI agents472Frontier LLMs315Inference & serving224Teacher policy distillation195Medical image segmentation146Physics informed neural126Supervised & diffusion models106Forecasting time50Voice AI44Machine learned interatomic41Electrocardiogram ecg39Remote sensing38Deepfake detection37Federated learning33All 25 fields

Open problems across fields

  • Interface lock-in in multimodal spatial reasoning1 paper raises it · 1 addresses it

    Specializing a model on one spatial task (e.g., side detection) degrades performance on others (e.g., distance estimation), limiting general spatial intelligence.

    • ChronoReplay: One Answer Interface Is Not Enough for Streaming Spatial Intelligenceraises · addresses
  • Lack of benchmarks for agent harness reliability1 paper raises it · 1 addresses it

    Existing evaluations focus on model capabilities, not the reliability of the systems that deploy and manage agents.

    • Trial by Trace: Benchmarking AI Agent Harnesses for Reliability and Failure Attributionraises · addresses
  • Negative net value of agent memory systems1 paper raises it · 1 addresses it

    Memory systems often underperform naive retrieval, as their design can obscure or remove critical evidence from raw history.

    • Memory Tax: Dissecting the Net Value of Agent Memoryraises · addresses
  • Credit assignment in diffusion language models1 paper raises it · 2 address it

    Iterative denoising in DLMs makes it hard to attribute rewards to individual tokens, limiting reinforcement learning effectiveness.

    • DTCA: Denoising Token Credit Assignment for Reinforcement Learning in Diffusion Language Modelsraises · addresses
    • Multiscale Policy Optimization for Long-Horizon LLM Agentsaddresses
  • Uncertainty quantification failure under class imbalance1 paper raises it · 1 addresses it

    Standard uncertainty measures fail to reflect clinical ambiguity in imbalanced datasets, systematically penalizing minority classes.

    • When uncertainty quantification fails: structural vulnerabilities and corrections for selective prediction under clinical class imbalanceraises · addresses

Named by an AI from these papers' abstracts.

Papers

  • arXiv cs.LGOct 10

    World2TS: Real-World Event Context for Time-Series Forecasting

    Zhiding Liu, Jiqian Yang, Mingyue Cheng, Zhi Li, Enhong Chen

    Time-series forecasting plays a vital role in a wide range of real-world applications. Recent approaches have achieved strong performance by modeling temporal correlations and cross-channel dependencies, yet most forecasting benchmarks still represent time series primarily as numerical histories. In practice, time series are observations of complex real-world processes, and their trajectories may reflect events, interventions, disruptions, and changes in measurement or reporting that cannot always be inferred from past values alone. A central barrier to studying context-aware forecasting is therefore the lack of large-scale datasets that align real-world events with the individual series they affect. We present World2TS, a scalable construction framework and large-scale dataset for time-series forecasting with real-world event context. We first develop world2ts-core, a reusable tool that combines agent-led semantic reasoning and Web search, command-line execution and validation, and human review within a feedback-driven discovery workflow. Given heterogeneous time series with semantic descriptions, the workflow discovers candidate events, consolidates retrieved evidence into…

    PDF
  • arXiv cs.LGOct 10

    Terrarium: Growing Personal Assistants via Scalable Synthesis of App Worlds

    Mengzhou Wu, Yuzhe Guo, Jiawen Tao, Xiaokun Yuan, Yuan Cao +7

    Advances in large language models (LLMs) have brought the vision of a general-purpose personal assistant closer to reality. Such assistants could provide a unified natural-language interface to a broad ecosystem of applications. However, real-world applications do not readily support training at scale because access is often restricted and their state is difficult to reset. To address this challenge, we introduce Terrarium, a framework that synthesizes executable App Worlds from real-world application information, generates training task packages with evaluator-side rubrics from these worlds, and iteratively validates and refines both through agent rollouts. For App World synthesis, Terrarium organizes public Web information and in-application observations into structured app specifications that guide the construction of self-contained runtimes with callable operations and mutable, resettable state. For task synthesis, Terrarium constructs tasks grounded in App World state together with evaluator-side outcome rubrics that assess success without prescribing reference trajectories. We construct a training suite of 275 App Worlds and 13,344 tasks for outcome-based reinforcement…

    PDF
  • arXiv cs.CVOct 10

    CAST: Real-Time Motion Capture for Any Skeleton Topology

    Pu Pang, Zhongfei Qing, Ling-Hao Chen, Songnan Li, Hua Huang +1

    This paper studies the problem of recovering motion from monocular video, even when the target skeleton topology differs from the subject observed in the video. Although previous methods have made efforts to resolve this problem, they remain vulnerable to joint-rotation errors that are coupled across the skeleton and can propagate along its kinematic hierarchy. To mitigate these errors, we present CAST, a topology-aware motion capture framework that combines learned local rotations with geometric correction guided by predicted global bone directions. Our observability analysis characterizes which rotational components can be constrained by outgoing bone directions. Guided by this analysis, GRACE uses reliability-gated alignment to correct composed orientations in parent-to-child order, leaving unconstrained components to the learned rotation predictor. The motion predictor and correction module are trained jointly with motion-derived supervision, using a frozen image encoder. Experiments under the TopoCap evaluation protocol show that the proposed framework improves motion recovery across different target topologies, including unseen structures. Reference-based cross-skeleton…

    PDF
  • arXiv cs.AIOct 10

    PEAM: On-device Communication Agent for Personalized, Efficient and Autonomous Mobile Network Configuration

    Haowen Wan, Shangzhuo Xie, Syue-Ju Syue, Xianyue Wu, Runhua Li +1

    The growing deployment of compact large language models on smartphones is enabling autonomous on-device decision-making, such as emerging mobile GUI agents. However, many mobile decisions, such as network configuration when users switch apps or connectivity conditions change, must satisfy stringent latency constraints to preserve user experience. In this paper, we propose PEAM, an on-device LLM-based communication agent that autonomously generates personalized network-configuration rules executable within milliseconds. Specifically, PEAM first fine-tune the on-device LLM with a dataset constructed from manually annotated real-user data to integrate the communication knowledge into the local model. PEAM then operates in two phases. In the rule-generation phase, which is performed when the device is idle, such as overnight, PEAM analyzes historical network-configuration records in batches and reflects across batches to consolidate consistent evidence, reduce local bias, and derive robust configuration rules. To enable more accurate and stable rule generation over time, PEAM further constructs a user profile from high-confidence rules to capture the user's network preferences and…

    PDF
  • arXiv cs.LGOct 10

    Disentangling Marginal Capacity from Geometry in Optimal-Transport Label Transfer

    Ali Khodabandeh Yalabadi, Azim Dehghani Amirabad, Artem Moskalev, Yun-Ching Chen, Mehdi Pirooznia +2

    Optimal transport (OT) is widely used to align distributions and transfer labels between unpaired source and target data, but source-target composition shifts can cause rare classes to be systematically under-predicted even with high transport confidence. We identify a source of this failure in the transport marginal: under the standard uniform weighting of source points, each class has transport capacity proportional to its source frequency, which can be insufficient to meet its target demand even when separated well in the embedding space. We show that displaced mass is preferentially absorbed by high-capacity classes rather than geometrically similar classes, producing confident errors that are difficult to detect from the transport plan. Downstream read-outs, entropic smoothing, and marginal relaxation provide limited recovery, whereas matching the transport marginal to the target composition substantially improves label transfer. On single-cell data, the oracle composition-matched marginal raises macro-F1 from 0.322 to 0.623, and the best deployable estimator closes 69% of the oracle gap. Correcting the marginal also separates a coverage-dependent component of error from…

    PDF
  • arXiv cs.CVOct 10

    Getting Space Right: Agentic Rewards for Image Generation

    Xiaofeng Tan, Jiaxin Lin, Haobo Yuan, Tiancheng Shen, Zihan Su +3

    Reinforcement learning (RL) is promising for spatial text-to-image generation, but existing work largely focuses on policy optimization, assuming accurate rewards and effective online rollouts. We observe in-domain gains with out-of-domain degradation, exposing two limitations: unreliable spatial rewards in open-world settings and rollouts lacking basic-to-complex progression. We propose a curriculum-guided RL framework. First, we introduce SpatialCritic, an agentic reward model equipped with a spatial perception harness that combines reusable verification guidance with specialized vision tools. We then construct spatial preference datasets through targeted counterfactual perturbations and perform agent-harness alignment to improve tool selection and evidence integration efficiently. Second, curriculum learning organizes shared foundational capabilities and their compositional dependencies in a capability graph for mastery-guided rollouts, periodic review, and targeted remediation. On SpaRW-Eval, SpatialCritic achieves 95.1% verification accuracy, outperforming 320B GLM-5.3-Flash with a 40x smaller 8B backbone and raising average baseline scores from 78.4 to 83.9 on SD3.5-Medium…

    PDF
  • arXiv cs.CVOct 10

    Towards Privacy-Preserving Thermal Human Perception from Dataset to Deployment

    Kailai Sun, Yue Cui, Xinwei Wang, Zijie Gao, Baoshen Guo +6

    Indoor human perception is the foundation for smart homes and healthcare. However, RGB cameras raise privacy concerns in private indoor environments, while low-resolution thermal cameras provide limited spatial and semantic information. Large-scale indoor thermal datasets and real-world deployments remain limited. Here, we introduce Indoor RGB-T, a large-scale paired RGB--thermal dataset for indoor human perception. The dataset covers 20 indoor rooms and contains 90,576 80x62 thermal frames, 87,016 temporally matched RGB--thermal pairs, and 115,557 annotated human bounding boxes. We establish benchmarks for robust thermal occupant-state detection with 0.75 mAP and occupancy estimation with an accuracy of 0.847 in unseen rooms. We further evaluate RGB-to-thermal and thermal-to-RGB translation, achieving a temperature MAE of 0.654 C and an R2 of 0.923. Finally, we deploy the thermal perception model on a commercial sleep-monitoring system in the real world. Field testing with 100 participants and deployment of approximately 1,000 devices further demonstrate its practical feasibility. We identify practical challenges that motivate future research directions, including environmental…

    PDF
  • arXiv stat.MLOct 10

    Physics-informed random neural architectures on compact boundaryless multiply connected manifolds for random-operator models in machine learning and uncertainty quantification

    Christian Soize

    We introduce stochastic physics-informed neural networks (SPINNs) for stochastic boundary-value problems (SBVPs) with random operators. The method enforces physics through a structural probabilistic coupling: a common Gaussian stochastic germ drives both the SBVP random operator and a manifold-based stochastic neural architecture. The stochastic neural network is non-feedforward and intrinsically random. A latent Gaussian field and an inhomogeneous Poisson point process on a compact, boundaryless, multiply connected manifold generate random neuron locations, geodesically local sparse connectivity, and a sparse random weight matrix, all governed by a low-dimensional hyperparameter. For deterministic inputs, the network output is random and can represent non-Gaussian random operators. Training is performed in observation space: SBVP simulations produce random observables, while the SNN defines a predictive conditional probability density function. The supervised objective combines data fidelity, through negative log-likelihood, with a cross-entropy alignment term relative to the SBVP-induced conditional distribution. The resulting target is a convex mixture of observation-induced…

    PDF
  • arXiv cs.AIOct 10

    Pre-Registered Genesis Accounting for Recursive Self-Improvement: First Audited Operator-Genesis Events in a Physics-Discovery Runtime

    Wenbin Mao, Pei Zou

    Claims of recursive self-improvement are easy to make and hard to falsify: did improvement come from re-using designer-provided mechanisms, or from mechanisms the system authored itself? We introduce a pre-registered, two-tier accounting: M1 counts machine-generated content instances within a designer-provided vocabulary, while M2 counts machine-authored mechanism types (new operators registered into the runtime's own vocabulary, with a held-out-validation certificate). We report the first audited M2 genesis events. In the primary event, depth-limited compositional search over elementary operators, judged by held-out R^2 on real NIST hydrogen Balmer measurements, produced the operator sq(inv(n)) = 1/n^2 -- the Rydberg-level form -- which no standard-library transform could express (held-out R^2: -0.546 best standard transform vs. 1.0000000 composed). A protocol flaw (independent variable built by inverting the very law under test) was caught in audit and repaired via an independent-label protocol; extrapolation to unseen levels (n=8,9 trained on n<=7) attains relative error ~10^-6, four to six orders beyond the best standard operator. A second event independently recovered…

    PDF
  • arXiv cs.LGOct 10

    Sequence-Structured Decision Learning for Branch-and-Bound in Mixed-Integer Linear Programming

    Tengfei Liu, Jinrun Liu, Bai Yan, Yuhui Shi, Qi Zhao

    Branch-and-bound (BnB) solves mixed-integer linear programs by constructing and exploring a search tree. Node selection and branching are two recurrent decisions that directly determine the tree. Learning-based approaches typically optimize either decision in isolation and condition on a mostly local view, leaving the coupled evolution of the search tree insufficiently modeled. This paper proposes Seq-BnB, a sequence-structured framework that learns branching and node selection from a shared global representation of the evolving BnB process. Seq-BnB serializes node creations, node updates, node-selection events, and branching events into typed tokens, producing a causal event sequence of the search trajectory. A self-attention encoder summarizes this global search history, a bipartite graph neural network encodes the current LP relaxation, and context-conditioned decision heads score branching variables and open nodes. To reduce distribution shift between expert demonstrations and learned policies, Seq-BnB is trained with DAgger-style data aggregation. On four MILP benchmark families, Seq-BnB consistently processes fewer BnB nodes than heuristic and learning-based baselines, with…

    PDF
  • arXiv cs.CVOct 10

    [Re] Boosting the Visual Interpretability of CLIP via Adversarial Fine-Tuning

    Anton Nuzhdin, Andrei Gruzitski, Balázs Egyed, Aleksandr Raudvee

    This paper presents a reproducibility study of ``Boosting the Visual Interpretability of CLIP via Adversarial Fine-Tuning'', published at ICLR 2025, which proposes an unsupervised adversarial fine-tuning (AFT) method with norm regularisation to enhance the visual interpretability of CLIP's image encoder. We attempt to reproduce the key claims regarding improved saliency map quality, increased concept alignment, transferability to out-of-distribution datasets, and the trade-off with zero-shot accuracy. Beyond reproduction, we propose a saliency-guided regularisation extension that introduces an Energy Pointing Game loss, directly supervising the spatial alignment of Simple Gradient saliency maps with target objects. We evaluate our extension across a range of saliency-loss weights and show that explicit saliency supervision \rev{substantially} improves localisation metrics at a modest cost: the reduction in zero-shot accuracy and adversarial robustness is small at the lowest saliency-loss weight ($w_s=0.2$) and moderate at the strongest setting ($w_s=0.6$). We restructure the codebase for configurable, systematic experimentation.

    PDF
  • arXiv cs.AIOct 10

    EvoCowork: A Benchmark for Real-World Office Tasks

    Zhou Liu, Xingyan Chen, ZhaoYang Han, Zewei Pan, Zeli Su +4

    Office workflows are a demanding testbed for self-improving agents because their deliverables must be correct, natively editable, and mutually consistent. A central question is whether gains on feedback tasks reflect reusable procedures rather than task-specific fixes. We introduce EvoCowork, a 240-task benchmark for evaluating harness-level recursive self-improvement across four office modalities, with model weights held fixed. The benchmark covers presentations, documents, spreadsheets, and cross-office workflows, and scores submitted artifacts for content, native structure, formulas, cross-file consistency, and visual quality where needed. Its protocol separates feedback, revision selection, and final testing: methods learn from single-modality tasks, then are evaluated on unseen single-modality tasks and cross-office workflows under a shared initial harness and explicit budgets. In static evaluations of two models and four harnesses, the best configuration scores 42.25 overall and 30.62 on cross-office tasks. Starting from the same MSA harness with GLM 5.3, ACE and AHE improve in-domain scores by 4.90 and 2.64 points, respectively, but change cross-office scores by only +0.03…

    PDF
  • arXiv eess.ASOct 10

    Cross-Lingual TTS for Indian Languages: A Benchmark and Inference-Time Duration Estimation Strategies

    Adarsh Arigala, Arjun Gangwar, Srinivasan Umesh

    Recent alignment-free Text-to-Speech (TTS) models achieve high synthesis quality by removing explicit alignment modules and simplifying training. However, they often struggle in cross-lingual scenarios due to differences in character durations across languages, leading to duration mismatch and degraded speech quality. Existing approaches typically address this issue using explicit duration predictors, increasing model complexity. Systematic evaluation of TTS performance for Indian languages in cross-lingual settings remains under-explored due to the lack of standardized evaluation benchmarks. In this work, we construct a cross-lingual evaluation benchmark covering English and nine Indian languages and propose a language-aware inference-time duration estimation strategy for alignment-free TTS that incorporates language-specific duration-per character statistics without retraining or architectural modifications. We further develop heuristic formulations that refine duration estimation based on language-dependent duration variations. Experiments on bilingual and multilingual A-DMA models demonstrate improved speech naturalness, intelligibility, and speaker similarity while reducing…

    PDF
  • arXiv cs.SEOct 10

    AI-Native Product Management: A Vision

    Ricardo Britto

    Artificial intelligence is increasingly used to support product management tasks. At the same time, AI-native research and development (R&D) may increase software realization capacity. Organizations may realize software faster than they can identify, qualify, and reconsider what should be realized. This paper asks how product management should be re-envisioned under these conditions. We synthesize research on software product management, product learning, human-AI collaboration, and the Product Management and R&D boundary. We propose a vision in which AI becomes a persistent participant in product work. The vision covers sensing, exploration, decision-making, realization, and learning. We propose six principles and make the vision tangible through an operating model grounded in human professionals, AI personas, agents, skills, and a shared product context. We further argue that AI-native Product Management and AI-native R&D can form a continuous product-learning process. Finally, we identify four AI-specific research directions that require empirical investigation.

    PDF
  • arXiv cs.AIOct 10

    A Reference Architecture for Integrating Agentic AI into Enterprise Software: Responsibilities, Interactions, and Variability

    Mingqin Yu, Fethi Rabhi, Liming Zhu, Qinghua Lu

    Agentic AI moves generative AI applications toward systems that coordinate reasoning, enterprise context, model inference, and external actions. Integrating these capabilities into enterprise software introduces diverse architectural concerns, from orchestration, knowledge and memory, and model access to tools and actions, security, runtime infrastructure, and evaluation. Existing research and industry architectures address many of these concerns but differ in scope, abstraction, responsibility organization, interaction representation, and assumptions about which capabilities are required. This paper presents a technology-neutral reference architecture for enterprise agentic AI integration. We synthesize architectural capabilities from research publications, industry architecture guidance, and interoperability specifications by architectural purpose, organize them into ten responsibilities, and define boundary invariants, typed cross-responsibility interactions, and variation points that distinguish responsibilities from condition-dependent capabilities and replaceable realization mechanisms. We instantiate the architecture as an ESG portfolio-analysis and pre-trade compliance…

    PDF
  • arXiv cs.SDOct 10

    Explore This! Beat and Downbeat Tracking From a Learned Tatum Grid

    Robert Kihlborg, André Holzapfel, Jan Schlüter

    State-of-the-art beat tracking is based on neural networks that model beats and downbeats as individual events, often followed by a separate Dynamic Bayesian Network (DBN) enforcing musical consistency. We propose a novel architecture that combines deep learning with differentiable theory-based modules: Specifically, we design a system that first predicts a tatum grid, then groups tatum events to beats and downbeats, explicitly modelling multiple options for the current tempo and time signature in a bar-pointer-like fashion. Our approach improves continuity metrics compared to existing DBN-free systems and is more versatile than the de-facto standard DBN, but still falls behind the best DBN-based methods on average. Given the many design choices and hyperparameters involved, we assume we have not yet explored the full potential of this idea and publish our code and invite others to explore this further.

    PDF
  • arXiv cs.DCOct 10

    Seamless Deployment of Machine Learning Inference at the Far Edge: An Empirical AWS IoT Greengrass Architecture for Industrial Predictive Maintenance

    Prince Kwabena Appiah Boadu, Jeffery Baafi Kyei, Enoch Kofi Koranteng, Griffth Selorm Klogo

    Industrial IoT sensors produce continuous, high-volume data streams that predictive maintenance needs to analyse in real time. Cloud-centric architectures send all raw telemetry to central servers, which costs latency, bandwidth and resilience. This paper presents a hybrid cloud-edge architecture for manufacturing predictive maintenance built on AWS IoT Core and AWS IoT Greengrass v2, with local machine learning inference at the edge and selective cloud synchronization. We deploy two configurations on real AWS infrastructure and compare them: a cloud-only baseline (Configuration A) and the proposed hybrid edge architecture (Configuration B). We measure end-to-end inference latency, bandwidth consumption and inference accuracy. Configuration B cuts cloud-bound bandwidth by 86.8% (63.6 KB to 7.2 KB per 200-reading window) and decision latency by 256x (23.1 ms cloud round trip to 0.09 ms local inference). At the edge, with no cloud involvement, it keeps an anomaly-class F1 score of 0.84 and 91% recall. The evaluation also instruments system uptime and Stream Manager queuing under cloud disconnection; the quantitative disconnection experiment is left as planned work. Our review of…

    PDF
  • arXiv cs.LGOct 10

    Machine Learning-Based Prediction of Dengue Infection Using Clinical and Hematological Data from Bangladesh: A Comparative Analysis of Benchmark and Extended Prediction Models

    Neesha Naimeen, Victor Miranda Soberanis

    Dengue is a viral infection caused by the dengue virus (DENV) and a major public health concern in Bangladesh, where symptom overlap with other febrile illnesses complicates early diagnosis. This study compares Logistic Regression, Random Forest and XGBoost to predict dengue from clinical and hematological data using two Bangladeshi hospital datasets (2024, n=1,511; 2025, n=1,283) with SMOTE. Extended models outperformed benchmarks within 2024 (Random Forest ROC-AUC 0.640 to 0.661), with RDW-CV the most consistently influential added predictor. 2025 benchmark performance was higher (ROC-AUC 0.904), unexplained by class imbalance and possibly reflecting data quality. External validation is needed.

    PDF
  • arXiv physics.geo-phOct 10

    Depth-progressive 3D seismic velocity model building via 2D generative diffusion models

    Shijun Cheng, Randy Harsuko, Mohammad H. Taufik, Tariq Alkhalifah

    Three-dimensional (3D) velocity model building (VMB) remains computationally challenging with conventional approaches and native 3D neural networks, largely due to the prohibitive memory and training cost of full 3D formulations. Therefore, we introduce a depth-progressive framework that achieves 3D VMB using 2D generative diffusion models through a depth-as-channel formulation, in which the depth dimension of each 3D velocity patch is mapped to the channel dimension of a 2D U-Net. This allows the model to synthesize overlapping depth patches sequentially from shallow to deep while conditioning the prediction of the deeper patch on the shallower one, as well as on any available geophysical constraints, including well logs and structural attributes. During training, paired shallow-deep patch pairs with randomized overlaps are used to teach the network how deeper velocity structures relate to shallower information, and a classifier-free guidance strategy enables the model to handle missing constraints gracefully. At inference, starting from a shallow velocity prior, the model recursively generates deeper patches in a top-down manner, and a depth-attenuated Gaussian blending scheme…

    PDF
  • arXiv cs.DCOct 10

    KedgeFlow: A Programmable Control Plane for Enterprise AI Agents

    Jun He, Deying Yu

    Enterprise AI agents can execute altered versions of approved actions, concurrently reuse the same permission, or retry operations whose responses were lost. These failures arise when approval and resource execution lack a shared contract. KedgeFlow specifies language-independent contracts for trusted controllers to authorize state-changing operations and privileged gateways to enforce that authority independently of agent reasoning. Inspired by OpenFlow, it connects policy checks supported by evidence, signed permission for an exact action, a shared allowance that can be consumed only once, target-side conditions for applying the change, and retained outcome records. Under trusted issuance of exact-action authority, two conditional properties establish at most one successful claim per allowance and link every governed dispatch to a matching grant, claim, and subsequent dispatch authorization, even when the agent is compromised. A reference implementation exposes this execution path to agent systems through the Model Context Protocol (MCP). In the single-resource evaluation, 6,560 concurrent ledger claim attempts yielded exactly one successful claim for each of 82 allowances.…

    PDF
Load more

Rising research topics

  • AI tutors20+100.0%
  • Channel state information15+25.0%
  • Character recognition OCR12+20.0%
  • Electrocardiogram ecg39−2.5%
  • Supervised & diffusion models106−8.6%
  • Stochastic gradient descent31−11.4%
  • Physics informed neural126−15.4%
  • Machine learned interatomic41−18.0%