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 fields2308Multimodal464AI agents436Frontier LLMs286Inference & serving205Teacher policy distillation182Medical image segmentation134Physics informed neural113Supervised & diffusion models100Voice AI43Forecasting time41Machine learned interatomic38Electrocardiogram ecg38Remote sensing35Deepfake detection33Federated learning30All 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 unified evaluation for work agents1 paper raises it · 1 addresses it

    Existing benchmarks fail to measure reliable work execution across tools, workflows, and open environments, hindering progress in agent systems.

    • Work Agents: Systems, Capabilities, and Optimizationraises · addresses
  • Memory tax in long-horizon agents1 paper raises it · 1 addresses it

    Dedicated memory systems often underperform naive retrieval, as reorganizing information can obscure evidence and reduce net value.

    • 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
  • Grounded significance testing for temporal hypotheses1 paper raises it · 1 addresses it

    Language models assert temporal patterns without rigorous statistical validation, risking incorrect conclusions in high-stakes domains like healthcare.

    • Testimony from Timelines: Evidence-Grounded Significance Testing of Temporal Clinical Hypothesesraises · addresses

Named by an AI from these papers' abstracts.

Papers

  • arXiv cs.CLOct 12

    RIFT: Token Influence Follows the Path of Least Resistance

    Tingan Jin, Shuhang Dong, Haosong Li

    Which context tokens drive a language model's answer? Graph-based tools such as attention rollout and attention flow answer this from a single forward pass, yet their faithfulness in decoder-only models is rarely tested against interventions. We view the layers of a decoder as a causal network whose conductances are attention weights, and read a token's influence on the answer from the resistance between them. We propose RIFT (Resistance-based Information Flow in Transformers), which scores a token by the series resistance of its path of least resistance to the answer, found exactly by a classic shortest-path dynamic program. On synthetic in-context retrieval tasks and extractive question answering over Wikipedia paragraphs, RIFT predicts the effect of replacing a token with a Spearman correlation of 0.52-0.68; predicting a single replacement, it reaches 77-96% of the agreement between two different random replacements. It needs no gradients and no extra forward passes, scoring every token of a prompt in 0.9-3.4 ms on one CPU thread, whereas the replacement experiment needs a forward pass per token. On 576 held-out prompts from four models of two families (Qwen3 and Llama 3.2),…

    PDF
  • arXiv cs.LGOct 12

    DWI Connectome-based Sex Classification in Young using Supervised Variational Autoencoder

    Aditya Kothapalli, Aaryan Gera, Sathvik Reddy, Ninad Aithal, Debanjali Bhattacharya +1

    During adolescence, significant changes in brain development are influenced by hormonal changes that impact both the body and the brain. This study presents sex classification in 787 young adults having age range of 15-25 years using Diffusion-weighted (DWI) structural connectome, focusing on 82 Desikan-Killiany atlas ROIs. A supervised variational autoencoder (SVAE) is used to extract latent space features from DWI connectome data. Although several studies explored differences in brain structure and function between sexes, the main contribution of this study lies in incorporating SVAE to learn a compact, regularized latent representation for the task of sex classification. Initial exploratory data analysis shows that these features can capture the differences in sex-specific latent space patterns. Subsequently, the learned latent space SVAE features are fed to different ML models for sex classification. Among the considered ML classifiers, the multi-layer perceptron yields the highest accuracy of 80% in classifying sex. This demonstrates the effectiveness of SVAE in learning compact, informative representations from DWI connectome for sex classification. The present work…

    PDF
  • arXiv cs.LGOct 12

    Rescuing Points Trapped Inside Incorrect Decision Regions: A target for Evaluating and Improving Forward-Forward Learning

    Alireza Rahmansetayesh, Amirhossein Yousefiramandi, Maxwell Spiridonov, Sumit Raut, Kent Ziti +1

    Forward-Forward learning replaces end-to-end backpropagation with local, layer-wise training objectives. Its variants are evaluated primarily by classification accuracy, often measured with linear probes trained on their representations. We show that this evaluation can over-credit the learning method: a linear probe on the representations of an untrained convolutional neural network already reaches accuracy well above chance. Moreover, a single accuracy value does not reveal which datapoints become correctly classified after training and which remain misclassified. To examine what learning contributes beyond the random, untrained baseline, we present an analysis methodology built on the Boundary Proximity Index (BPI), a multiclass margin normalized by a class-centroid reference. We apply our analysis to seven Forward-Forward variants and related layer-local methods and find that initially misclassified points near the probe's decision boundary generally have higher rescue rates than those farther inside incorrect decision regions. Rescue rates vary substantially across methods, with some correcting a substantial fraction of these deeply embedded points. Together, these analyses…

    PDF
  • arXiv cs.AIOct 12

    ChronoScribe: Semantic-Numerical Specialization for Instruction-Driven Time Series Forecasting

    Yuchen Jiao, Miao Zhang, Yuxuan Liu, Chengxi Li

    Recent advances in instruction-driven time series forecasting highlight a fundamental tension: systems must simultaneously master natural-language instruction following and precise numerical prediction. Current approaches often force a compromise. Large language models (LLMs) can interpret unstructured requests but may be inaccurate when asked to produce forecast values directly, whereas time series foundation models (TSFMs) provide numerical forecasts but typically require structured inputs specifying the target series, context window, and horizon. We present ChronoScribe, which applies semantic-numerical specialization to this workflow. A LoRA-adapted LLM proposes an execution path and context length; deterministic rules resolve the executable configuration. On the specialist path, a frozen TSFM produces quantile trajectories for the task-specified horizon. Deterministic trajectory summaries condition the response, while the LLM neither generates nor revises predicted values. We evaluate a Qwen3.5-9B--Chronos-2 implementation across 23 evaluation dimensions and 30 public datasets against eleven proprietary direct LLMs and three open TSFMs. ChronoScribe has the lowest error on…

    PDF
  • arXiv cs.AIOct 12

    Efficient Multi-Agent Reasoning via Confidence-Guided Adaptive Debate

    Seungdong Yoa, Ye Seul Sim, Suhee Yoon, Sanghyu Yoon, Dongmin Kim +3

    Multi-agent debate has shown promise for improving the reasoning of large language models, yet recent theory suggests its benefits are highly regime-dependent. While interaction can amplify informative signals under corrective conditions, symmetric debate dynamics are neutral in expectation, often making majority voting preferable. We reconcile these views by arguing that debate is effective only when invoked at the right time and with appropriate structure. Based on this insight, we propose LASE: Leader-Adaptive Structured Engagement, a leader-centric multi-agent debate framework that selectively engages interaction only in non-neutral regimes. LASE introduces an asymmetric leader-supporter architecture that enables directed information flow and selective signal amplification, while defaulting to simple aggregation otherwise. Experiments across diverse reasoning benchmarks show that LASE achieves multi-agent-level performance with near single-agent token cost, substantially improving efficiency over static debate and voting baselines.

    PDF
  • arXiv cs.CVOct 12▲ 7

    SyncReward: Human-Aligned Synchronization Reward for Audio-Visual Generation

    Kaisi Guan, Ying Ba, Wenjing Wang, Xihua Wang, Chen Li +2

    Recent years have witnessed rapid progress in joint audio--visual generation. However, audio--visual synchronization remains a challenge, as generated speech and sound often temporally misalign with visual events. A key bottleneck is the lack of human-annotated data, reliable evaluation benchmarks, and synchronization-aware evaluation models for generated audio--visual outputs. To address these limitations, we conduct a comprehensive study spanning data, benchmarking, and reward modeling. We first introduce SyncReward-Data-80K, a dataset containing 80K professional synchronization ratings for clips from eight audio--visual generators. A taxonomy-guided construction pipeline covers four sound-event families: Speech, Onset, Instrument, and Ambient. We further construct \textbf{SyncReward-Bench}, a held-out benchmark of 1K clips, each independently rated by multiple professionals. Using this benchmark, we systematically evaluate specialized synchronization metrics and omni-modal models, revealing their substantial misalignment with human judgments. Finally, we develop SyncReward, a reward model that combines semantic--temporal contrastive pretraining on real clips with human…

    Code
  • arXiv cs.CVOct 12

    WorldRoPE: Probabilistic World-Centric Rotary Embedding for Multi-View Attention

    Mijeong Kim, Kyujin Lim, Bohyung Han

    Rotary Positional Embedding (RoPE) is widely used to encode relative positions in Transformers. In multi-view settings, however, patch coordinates are defined independently in each image: the same 3D point can therefore have different coordinates across views, making them insufficient for establishing cross-view correspondences. We introduce WorldRoPE, a probabilistic world-centric RoPE for multi-view attention. At each layer, WorldRoPE back-projects each patch token into a set of volumetric Gaussian primitives in a shared world frame. These primitives represent multiple plausible 3D supports for a token, jointly capturing alternative depth hypotheses, depth uncertainty, and the finite spatial extent of its patch frustum. When a key token's support is projected into a query view, it induces a distribution over where that key may appear in the query image. WorldRoPE integrates the rotary operator over this distribution in closed form, combining rotations at the projected primitive centers according to their mixture weights with covariance-dependent attenuation. This makes attention less sensitive to uncertain key locations in the query view, without rasterizing or warping token…

    PDF
  • arXiv cs.AIOct 12

    TRAP: Tool-result Replay Attack for Probing Misbinding in LLM Agents

    Yutong Zhi, Jie Zhang, Xiuqi Lu, Jiayuan Xu, Jing Shao

    As AI agents increasingly act through external tools, tool results are no longer simple outputs but execution artifacts that must remain correctly associated with the context that produced them. Yet as results persist across caches, recovery mechanisms, and shared runtime state, this association can break, causing a real and unmodified result to be consumed in an incompatible execution context and lead the agent to an unsafe action. We characterize this failure as tool-result misbinding. To systematically study this failure, we introduce ReplayBench, a benchmark that uses controlled tool-result replay to evaluate misbinding across 19 representative agent scenarios, 4 failure properties, and 3 replay mechanisms. Across eight LLMs, three agent frameworks, and diverse stateful workflows, we find widespread replay-induced failures, with a mean Final-State Error Rate of 0.649 under cross-task replay. Stage-wise analysis localizes these failures to model-side action generation. Further analyses show that replay susceptibility varies with task similarity, shows little dependence on object similarity, and remains high under result staleness and implicit environment changes. These…

    PDF
  • arXiv cs.CVOct 12

    BAT3R: Robust Online 3D Reconstruction with Bayesian Adaptive State Updates

    Lijian Li, Yuanpeng He, Yudian Zheng, Chung-ju Huang, Linyu Li +4

    Feed-forward transformer models have driven remarkable progress in 3D vision,yet their quadratic complexity renders them impractical for long video sequences. Streaming 3D reconstruction addresses this bottleneck by processing frames sequen?tially with constant memory. However, existing recurrent architectures inevitably suffer from progressive degradation over long sequences, as they fail to account for the intrinsic reliability of observations and the accumulated confidence of the historical state, leading to severe error accumulation. To address these issues, we introduce BAT3R, a training-free Bayesian adaptation framework comprising two synergistic modules: State Innovation Gating (SIG) and Bayesian-guided Adaptive State Updating (BASU). SIG acts as a distributional regularizer that anchors state evolution to its geometric initialization, effectively arresting representational drift during long-term inference. Building on this, BASU reformulates state update as a recursive Bayesian inference process within a Kalman filtering framework. By jointly modeling the temporal reliability of observations via information-theoretic gain and spatial relevance via cross-attention maps,…

    PDF
  • arXiv cs.CVOct 12

    Explicitly Aligned Multi-View Breast Cancer Risk Prediction from Variable-Length Screening Histories

    Solveig Thrun, Zijun Sun, Suaiba A. Salahuddin, Kristoffer Wickstrøm, Elisabeth Wetzer +3

    Accurate breast cancer risk prediction from screening mammography is essential for improved risk stratification and personalized screening. It can benefit from both temporal breast tissue changes across longitudinal examinations and complementary anatomical information from craniocaudal (CC) and mediolateral oblique (MLO) views. Leveraging longitudinal information requires identifying corresponding tissue regions across examinations, yet most approaches rely on implicit feature alignment without explicitly enforcing spatial consistency. Recent work has demonstrated the benefits of explicit temporal alignment; however, existing methods model each view independently, preventing them from exploiting complementary CC and MLO information. Furthermore, explicit approaches have been limited to a single prior examination. To fill these gaps, we propose (github.com/sot176/FlexLMV-Net), a breast-wise longitudinal multi-view framework that jointly models CC and MLO views across screening examinations while accommodating a variable number of prior examinations. FlexLMV-Net explicitly aligns longitudinal feature maps and integrates complementary views through cross-view temporal fusion and a…

    PDF
  • arXiv cs.LGOct 12

    Probabilistic Simulation of Gas-Liquid Interfaces with Coupled Flow Matching on Spherical Harmonics

    Kiet Bennema ten Brinke, Rachna Ramesh, Douwe Orij, Ivo Roghair, Vlado Menkovski

    Bubbly flows involve strongly coupled bubble motion, deformation, and hydrodynamic interactions, making high-fidelity simulation computationally expensive. We propose a neural surrogate that jointly predicts bubble trajectories and interface deformation in a compact, shared representation, replacing costly mesh-resolved simulation with fast generative inference. Because two-phase flow dynamics is nonlinear and chaotic, we treat forecasting as a conditional generative problem rather than deterministic regression, predicting entire future windows in a single pass. We train and evaluate the surrogate on BubbleSH, a Front-Tracking dataset of rising deformable bubble swarms, assessing performance using trajectory, shape, and distributional metrics over kinematic, morphological, and interaction-based properties. The surrogate reproduces key flow statistics while running several orders of magnitude faster than the underlying DNS solver.

    PDF
  • arXiv cs.AIOct 12

    When a Conceptor Complement Becomes Gain: Operator Geometry and Behavioral Attribution in Language Models

    Shuhul Razdan, R Balamurugan

    When a steering intervention changes a language model's behavior, which part of the intervention deserves the credit? We test this question for a target-centered, scaled conceptor complement by removing its fitted covariance filter while preserving the same target-specific center and gain. At the original aperture $α=.05$ and gain $β=2$, all 21 fitted maps across three models and seven targets expand every direction at the generation intervention layers. The matrix correction is $0.093\%$--$7.815\%$ of the matched-control displacement on held-out extraction activations. In 480 paired comparisons within a 1,920-response study, retaining the matrix changes many individual texts but does not establish a consistent additional target-suppression benefit on the four-target panel. A geometric aperture sweep shows that the operating regime changes with the filter setting. Separately, an invertible soft filter preserves what an unrestricted affine readout can recover, whereas dedicated erasure methods reduce prediction by newly fitted probes. Together, the results show why a whole-intervention comparison cannot by itself attribute generated behavior to the fitted matrix: analyze the…

    PDF
  • arXiv cs.CVOct 12

    Anomaly-Guided Observation and Two-Level Semantic Feedback for Training-Free Video Anomaly Analysis

    Hangil Park, Seungheon Kim, Tae-Kyun Kim

    Training-free language-based video anomaly detection (VAD) uses frozen vision--language models (VLMs) and large language models (LLMs) to localize abnormal events without task-specific model-weight optimization. Existing approaches increasingly exploit broader temporal and semantic context, yet generic context does not necessarily foreground abnormal events or specify how video-level semantics should modify local anomaly scores. We introduce a training-free semantic feedback framework that uses VAD-guided active observation for video anomaly understanding (VAU) and returns the resulting anomaly-focused description to refine temporal detection. Starting from an upstream anomaly-score curve, we adapt reasoning-based iterative frame selection: high-score regions seed the observations, and anomaly scores together with VLM relevance assessments guide subsequent temporal exploration. A frozen video-language model generates a single open-ended anomaly description from the selected frames. The description is returned through two complementary feedback levels: video-level feedback determines whether the score distribution should be suppressed, preserved, or sharpened, with selective…

    PDF
  • arXiv cs.LGOct 12

    BehaviorFormer: Discovering Behavioral Patterns via Clusterable Next-Token Prediction

    Tobias Schneider, Danial Fahrner, Soren Antebi, Daniel Uedelhoven, Lennard Bodden +2

    Discovering behavioral patterns in open-ended games is challenging due to the lack of clear objectives or ground-truth annotations. In this work, we extend a next-token prediction Transformer with the deep clustering algorithm DCSS to learn meaningful representations with well-separated clusters. In a controlled Minecraft session with 26 players, the method discovers 23 distinct behavioral patterns that generalize across the studied players, further refining structures present in self-supervised representations into clearly separable clusters. We group the clusters into seven interpretable categories covering stationary, roaming, travel, mining, base work, logging, and farming behavior.

    PDF
  • arXiv cs.CVOct 12

    Building age estimation based on widely available multi-source1 geospatial data

    Jialu Sui, Hongsheng Zhang, Rui Liu, Jing Ling, Ruisheng Wang +2

    Building age is fundamental for urban infrastructure safety, operation, and planning, as it directly affects structural safety, and sustainable development. Existing methods mostly rely on detailed building information such as street view, function, or materials, which are harder to obtain than geospatial data like satellite imagery and Digital Surface Models (DSMs). However, existing methods based on those geospatial data mainly rely on optical imagery and local texture features, limiting their ability to capture structural information and distinguish buildings from different periods. Moreover, the inherent temporal ordering among building age categories is often overlooked. To address these limitations, we propose the first deep-learning framework for multi-building age estimation using widely available multi-source geospatial data, including remote sensing data and their derived products, as well as building footprint information that estimates age at both pixel and instance levels within a unified pipeline. Specifically, a large pretrained backbone with fine-tuning adapters extracts representative features, and raster-derived and property-derived fusion modules support…

    PDF
  • arXiv cs.AIOct 12

    HyWe: Unifying Search and Operation for Real-World Hybrid Web Tasks

    Zijian Cai, Haowei Liu, Kailai Chen, Lin Peng, Cong Wan +5

    Real-world hybrid web tasks need both information gathering and page interaction, yet search-based and operation-based agents are developed and evaluated separately. To bridge this gap, we introduce HyWe, a framework that unifies both capabilities within one model and trajectory. Its two modes use dedicated prompts and tool sets to sustain sub-goal execution; explicit switching selects the needed capability, and shared history lets each mode build on the other's findings. To provide demonstrations of these behaviors, we develop HyWeCollector, a fully automatic pipeline that uses task prototypes, four switching patterns, and multi-agent synthesis to produce verified hybrid trajectories. We train HyWe-35B on these demonstrations to unify efficient information gathering and browser interaction in a single 35B web agent. To evaluate hybrid task completion, we introduce HyWeBench: 100 human-written tasks on websites distinct from training, with human-written sub-goal checklists and an outcome-based evaluation pipeline. Hybrid training enables HyWe-35B to achieve 47.0% success on this benchmark, improving on the untrained base model by 19.0 percentage points and outperforming existing…

    PDF
  • arXiv cs.CLOct 12

    Strong yet Controllable LLM Abstention without Learning to Abstain

    Junwei Zhang, Yifei Wang, Wanli Yang, Hexiang Tan, Rui Tang +4

    Large language models (LLMs) can reduce hallucination by abstaining from questions they would likely get wrong. Abstention can be implemented outside the model (selective answering) using a confidence threshold that controls the answer rate (coverage), or learned inside it (abstention training), which can perform better but fixes coverage once trained. To compare the two, we match their coverage and decompose risk (error rate) into answering ability and distinguishing ability, i.e., how well the model answers and how accurately it abstains, respectively. The decomposition shows that abstention training performs better mainly by answering better: with strong confidence estimators, the two have nearly equal distinguishing ability. This motivates Train for Accuracy, then Post-hoc Select (TAPS), a modular approach that keeps coverage controllable, needs only standard post-training and an off-the-shelf confidence estimator, and benefits from advances in either component. Across three LLMs and three factual QA benchmarks, TAPS with a probing-based confidence estimator attains 1.5--9.4 percentage points lower mean risk than three representative abstention training methods at matched…

    PDF
  • arXiv cs.AIOct 12

    ReTAC: Residual Test-Time Agentic Computation for Video Spatial Reasoning

    Yike Wu, Keyan Chen, Qixiong Wang, Xi Xiang, Maofei Que +4

    Test-time agentic computation can improve multimodal large language models (MLLMs) through planning, tool use, iterative perception, and reflection, but indiscriminate computation may duplicate resolved work, introduce noisy evidence, and perturb correct predictions. We propose that such computation should be residual: allocate additional computation only to requirements unresolved by the base model and, after a localized failure, recompute only the affected states. We instantiate this formulation in ReTAC, a training-free multiagent framework for video spatial reasoning. ReTAC organizes supplementary computation around unresolved requirements. It plans ordered steps to acquire missing spatial evidence and combines the observations with compatible native evidence for reasoning. In addition, it uses stage-aligned verification to localize failures to planning, perception, or reasoning. Dependency-based recovery recomputes only affected states while reusing unaffected ones. Extensive experiments show that ReTAC achieves the highest overall score among the compared methods across three mainstream MLLMs and two widely adopted benchmarks. Further analyses show that gains from…

    PDF
  • arXiv cs.AIOct 12

    Narrative Paradoxes in LLM Inference: Shaping Reasoning Trajectories toward Misalignment

    Haoming Yang, Ke Ma, Yangbangyan Jiang, Ligong Zhang, Xiaojun Jia +4

    Explicit reasoning in large language models (LLMs) is often associated with reliability, yet it can still pose risks when a model infers harmful goals under a benign context. We identify a distinct challenge: ensuring the safety of the \emph{multi-step reasoning process} itself, where locally coherent steps may still lead to globally harmful outcomes. To explore this vulnerability, we propose PDRA (Paradox-driven Reasoning-based Attack), a novel attack method that programs a harmful reasoning trajectory. PDRA first constructs a paradoxical narrative core by pairing a malicious actor (e.g., a terrorist) with a benign task (e.g., writing a safety bulletin). It then embeds this core into a structured analytical framework that forces the model through a mandatory three-stage analysis -- surface purpose, latent intent, and operational reconstruction -- guiding it to produce detailed harmful content while maintaining narrative coherence. Mechanistically, we show PDRA steers the model's internal representations away from refusal-related patterns, suppressing safety-triggering lexicons while activating planning-oriented terms. Empirically, PDRA achieves state-of-the-art attack success…

    PDF
  • arXiv cs.CROct 12

    ATTCK-R: Knowledge-Aware Long-Horizon Jailbreaking for Protected LLMs

    Md Mushfiqur Rahman, Tobias Rohde, Rahul Tripathi, Khalil Elkhalil, Kevin Lybarger

    As large language models are deployed behind increasingly sophisticated safety mechanisms, evaluating their robustness under realistic adversarial conditions becomes increasingly difficult and critical. Existing jailbreaking evaluations often rely on static prompts, limited interaction horizons, or lightly protected systems, failing to reflect protected deployment settings with prompt-based safety protections. We show that the introduction of a prompt-based safety protection reduces the average attack success rate of a strong multi-turn baseline from 0.896 to 0.608 (32.1\% relative), demonstrating that unprotected evaluations substantially overestimate real-world vulnerabilities. We propose Adaptive Traceback and Tactic Curation for Knowledge-based Red-teaming (ATTCK-R), a planning-driven multi-turn red teaming framework designed for protected black-box systems. ATTCK-R models jailbreaking as a long-horizon trajectory optimization problem using a structured belief state, introduces optimization-based tactic curation to abstract reusable strategies from prior successes and failures, and employs informed traceback to resume attacks from strategically meaningful states rather than…

    PDF
Load more
PDF

Rising research topics

  • AI tutors17+41.7%
  • Character recognition OCR12+20.0%
  • Channel state information14+7.7%
  • Electrocardiogram ecg380.0%
  • Supervised & diffusion models100−10.7%
  • Machine learned interatomic38−15.6%
  • Stochastic gradient descent26−21.2%
  • Physics informed neural113−23.6%