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 fields2497Multimodal532AI agents440Frontier LLMs324Inference & serving223Teacher policy distillation181Medical image segmentation140Physics informed neural118Supervised & diffusion models81Voice AI70Forecasting time52Deepfake detection48Federated learning46Remote sensing42Machine learned interatomic38Electrocardiogram ecg34All 25 fields

Open problems across fields

  • Reliable request execution in streaming video generation1 paper raises it · 0 address it

    Models struggle to follow incremental multimodal requests while maintaining state consistency and visual fidelity.

    • StreamEval: Evaluating Interactive Streaming Video Generation Modelsraises
  • End-to-end deep search in real-world open Web environments1 paper raises it · 0 address it

    Agents cannot reliably explore, integrate, and verify evidence from diverse, interactive, and heterogeneous web sources.

    • Deep Search in Real-World Web Environmentsraises
  • Prior-consistent solutions for ambiguous nonlinear inverse problems1 paper raises it · 1 addresses it

    Diffusion-based samplers often favor measurement-consistent but prior-inconsistent solutions in ambiguous cases, masking failures with best-of-k reporting.

    • Beyond Best-of-$k$: Prior-Consistent DAPS for Ambiguous Nonlinear Inverse Problemsraises · addresses
  • Explainable artifact detection in AI-generated videos1 paper raises it · 1 addresses it

    Detectors often fail to identify subtle artifacts or justify their decisions with faithful evidence.

    • Verus-Insight: Towards Explainable Artifact Detection in AI-Generated Videosraises · addresses
  • Temporal trajectory modeling for clinical risk prediction1 paper raises it · 1 addresses it

    Existing multimodal approaches underutilize irregular, heterogeneous clinical data accumulated over time for accurate inpatient risk prediction.

    • TRACE: Tracking Multimodal Clinical Trajectories for Inpatient Risk Predictionraises · addresses

Named by an AI from these papers' abstracts.

Papers

  • arXiv cs.CVOct 12

    Not All Challenges Are Equal: Evaluating Interactive Liveness Detection Against Real-Time Face Swaps

    Anton Firc, David Drtil, Martin Perešíni, Milan Šalko, Vojtěch Staněk +1

    Remote identity verification assumes that a camera stream shows a live person, yet public real-time face-swap tools can replace that person before the stream reaches the verifier. Passive deepfake detectors generalize poorly to new generators, while interactive challenges are often selected without evidence of which gestures expose current attacks. We evaluate randomized gesture challenges in 108 live sessions with six subjects, 24 impersonated identities, and two face-swap tools, DeepFaceLive and FaceFusion, injected through a virtual camera. The static calibration segment reaches a session-level AUC of 0.878 with a frozen UCF spatial detector, while the mean across the active-gesture windows reaches 0.988. Pose and combined gestures have the highest point estimates, whereas expressions show no clear improvement. Hand occlusion against FaceFusion, configured with an occlusion mask, scores below the static baseline. The end-to-end time required to satisfy the validator also distinguishes attacks from genuine sessions, achieving a session-level AUC of 0.732, although this signal includes synthesis and transport delays. These results show that challenge sets should be tested…

    PDF
  • arXiv cs.AIOct 12

    Chain Dimension Scaling: Communication-Efficient Loop-Style Scaling for Industrial Short-Video Ranking

    Zhimeng Jiang, Yuening Li, Ruixiao Sun, Yuanzhen Lin, Kun Jin +2

    Industrial recommendation rankers keep scaling in width and depth to billions of parameters, but this increasingly incurs costs in parameter growth, distributed communication overhead, and training inefficiency. We introduce \underline{C}hain \underline{D}imension \underline{S}caling (CDS), a scaling strategy orthogonal to width and depth. CDS repeatedly applies a single feature-interaction block with parameters shared across iterations, so the number of iterations (the chain length) becomes a new scaling dimension that adds no parameters. A lightweight intra-chain residual connection stabilizes optimization and improves quality. CDS enables two regimes. In the \emph{compression regime}, shallow blocks with a longer chain match deeper baselines with fewer parameters and faster training; in the \emph{quality-scaling regime}, increasing chain length under a fixed parameter budget yields consistent offline and online gains, suggesting the chain dimension adds modeling capacity beyond parameter reuse. We evaluate CDS in a large-scale multi-task short-video ranking system in production. In the compression regime, CDS stays within $0.03\%$ of baseline offline quality while reducing…

    PDF
  • arXiv cs.AIOct 12

    SLS-Bench: A Benchmark for Incident Log Summarization with Synthetic Observability Data

    Valerii Iakovlev, Markus Spanring, Martin Flechl

    As IT systems grow in complexity, automated agent-driven incident response becomes increasingly critical. A key capability for these agents is summarizing large log streams into human-readable reports. Further progress requires meaningfully evaluating this function, yet existing benchmarks leave end-to-end summarization from large log streams underexplored due to the prohibitive cost and complexity of collecting real-world data. We introduce SLS-Bench, a benchmark for incident log summarization featuring 90 tasks grounded in real-world incident reports, each with a synthetic log stream and a reference summary. To construct SLS-Bench, we developed a data generation pipeline that converts incident reports into structured incident models, which guide the generation of synthetic logs and reference summaries. This pipeline combines narrative grounding, explicit incident modeling, generator-verifier loops, and statistical comparisons with real-world log streams to produce realistic and controllable observability data. Our evaluation of 14 LLMs on SLS-Bench shows that while frontier models can produce useful summaries, they do so at substantial cost and latency, and open-weight models…

    PDF
  • arXiv cs.ROOct 12

    Estimating the Causal Impact of Social Navigation Signals in Corridor Scenarios

    Francesco Baldo, Luca Castri, Gloria Beraldo, Nicola Bellotto

    Deploying robots in human-shared environments requires deciding not only how to navigate, but also when dedicated social signals are worth emitting. Classic observation-based inference can be misleading in such settings: confounding factors may bias the estimated relationship between a signal and the task outcome, leading to incorrect decisions. Causal inference provides a framework for disentangling these relationships by modelling the mechanisms linking observations, actions, and outcomes, and by estimating interventional effects after accounting for confounding paths. We study a human-robot interaction scenario in a corridor and use a causal model to estimate whether a social navigation signal causally improves transit success. We represent the interaction as a causal DAG involving robot action, pedestrian occupancy, available space, task outcome, and a controlled confounder (static obstacles). We compare the interventional estimate with the observational estimate obtained by conditioning only on the robot action, which does not explicitly model interventions. Our results show that accounting for confounding variables can reverse the conclusions drawn from naive observational…

    PDF
  • arXiv cs.CVOct 12

    Recovering from Pose-Selection Failures in Repeated Visual Localization

    Jaehyun Kim, Wonseok Kang, Tae-Wan Kim

    Repetitive structures can give an incorrect pose candidate more inlier support than an accurate one, causing visual localization to select it. History-Guided Pose Reselection (HPR) uses coarse position forecasts from up to five past localization outputs to distinguish well-separated current-query candidates. The best-fitting forecast proposes an alternative; HPR accepts it only if every well-fitting forecast is much closer to it than to the localizer's pose. HPR needs no odometry and returns the selected candidate unchanged, using prediction for selection rather than pose refinement. With one development-set threshold, HPR improves recall within 5 meters and 10 degrees in all 12 main configurations of Hierarchical Localization (HLoc), MASt3R-based pose generation, and JIST-based retrieval, losing successes on fewer than 0.4 percent of queries. On NAVER Gangnam B1, HPR corrects 97 HLoc failures and loses six successes; gains persist within 0.25 meters and 2 degrees on all three HLoc test sets. Median HPR runtime on HLoc candidates is below one millisecond, excluding pose generation. Recovery weakens under less frequent localization.

    PDF
  • arXiv cs.AIOct 12▲ 5

    EvoWeb: A Benchmark for Coding Agents on Evolving Web Applications

    David Nukrai, Bar Alon, Nativ Levy, Ido Andrew Atad, Ido Cohen +4

    Web application development often proceeds through successive requests that extend an existing implementation. Yet web-generation benchmarks primarily evaluate development toward fixed specifications. We introduce EvoWeb, a novel benchmark comprising 320 cumulative requests over 32 web applications, grounded in real-world product features and structured by functional dependency graphs. Agents iteratively modify a persistent codebase, while a multimodal web agent tests each intermediate application in a live browser, assessing newly requested functionality, cross-request integration, and previously requested functionality. To characterize reliability throughout development, we integrate trajectory performance across user-tolerance thresholds rather than impose a fixed stopping criterion. Experiments across open- and closed-source frontier models show that EvoWeb reveals clear performance differences between models, with cross-request integration emerging as a key challenge. Further analysis shows that later requests with deeper or more numerous dependencies are solved less accurately, while runtime errors become more frequent over successive requests. EvoWeb provides a testbed for…

    Code
  • arXiv cs.AIOct 12▲ 4

    Recursive Environment Scaling for General Long-Horizon Agents

    Lingxiao Jing, Zhengbo Jiao, Yichen Xiang, Bofan Zhu, Lingbei Meng +8

    We study environment scaling as a way to increase agent-benchmark difficulty while holding core task objectives fixed. Our framework, Recursive Environment Scaling (RES), transforms existing benchmark environments while preserving their objectives and completion requirements. A proposer changes information access, resource relations, and execution dependencies; execution-grounded checks validate the resulting candidate, and accepted changes are inherited across rounds. This produces related environments for paired evaluation and training-trajectory collection. Experiments on 294 initial tasks from three benchmarks show lower task success for all six evaluation models, with decreases of 57.14--77.14 percentage points on Claw-Eval-Live. With equal trajectory counts and identical optimization settings, fine-tuning on RES trajectories outperforms original-trajectory SFT in all nine model--benchmark comparisons by 7.00--14.61 percentage points. Ablations identify recursive inheritance and dependency composition as important contributors to increased difficulty. Together, these results support environment scaling for both agent evaluation and training.

    PDF
  • arXiv cs.LGOct 12

    Sampling from Neural Operator Priors to Solve Partial Differential Equations

    Andrew Millard, Joshua Murphy, Zheng Zhao

    Guided sampling with sparse observations and PDE residuals has recently been combined with neural operator priors to solve partial differential equations in function space, their natural setting. We pair such a prior with pseudo-bootstrap sequential Monte Carlo (pBS SMC), a guided sampling framework that accommodates proposals without tractable densities, and introduce a new proposal by adapting the DPM++ algorithm to the guidance setting. Across five benchmark PDE systems this proposal attains the best error--time trade-off at every step count tested, and wrapping it in pBS gives the lowest error on most inverse-problem settings, with the largest gains when few sampling steps are used.

    PDF
  • arXiv cs.AIOct 12

    RetroPlanner: Multi-Route Expansion and Multi-Objective Reasoning for LLM-Based Retrosynthesis Planning

    Ye Rin Kim, Yongjun Jeong, Seongjun Yun, Hanbum Ko, Soohyun Oh +2

    Multi-step retrosynthesis planning is often considered solved once a route to purchasable starting materials is found, but such a route should also be practical in real-world chemistry. Recent LLM-based planners formulate this process as sequential decision-making over an AND-OR graph, yet typically expand a single molecule per turn and are optimized for solvability alone, leaving alternative routes uncompared across the multiple objectives that determine practicality before the search budget is committed. We introduce RetroPlanner, an LLM-based planner that jointly compares multiple routes to steer the search toward higher synthesizability, as measured by reaction plausibility, round-trip consistency, and starting-material price. RetroPlanner is trained to reason over chemical evidence: structural progress from the target molecule, bond changes and reaction classes, where candidate routes diverge from one another, and how they rank across multiple objectives. Experiments on multi-step retrosynthesis benchmarks demonstrate that RetroPlanner recovers more alternative routes than prior LLM-based planners while improving synthetic route quality and maintaining a high success rate.

    PDF
  • arXiv quant-phOct 12

    QBFF: Deep Quantum Bottleneck for Automatic Speaker Verification Anti-Spoofing

    Anton Firc, Nouhaila Innan, Vojtěch Staněk, Kamil Malinka, Martin Perešini +4

    A central goal of quantum machine learning is to identify applications in which small quantum circuits can improve task performance while remaining executable on real hardware. We investigate deepfake (synthetic) speech detection, a largely unexplored application in this area, where reliable confidence scores are as important as discrimination performance because deployment decisions are made at fixed thresholds and overconfident errors can be costly. We introduce QBFF, which routes a compressed speech representation through a small 8-qubit variational circuit (VQC) used as a drop-in bottleneck, with a matched classical bottleneck as the control. The quantum circuit yields better-calibrated confidence in most matched comparisons, including out-of-distribution evaluation, though the downstream deployment-cost benefit is model-dependent. We then run the same circuit on a real IBM quantum processor. To our knowledge, this is the first anti-spoofing pipeline to run on a QPU; hardware execution demonstrates feasibility, with lower subset EER and $C_{llr}$ but higher mean actDCF than the matched classical reference. Together, these results show that hardware-executable quantum…

    PDF
  • arXiv cs.CVOct 12

    Throwing4: Phase-Aware Pose Modeling for Throw-Distance Prediction in Elite Athletics

    Bikash Kumar Badatya, Kartike Tiwari, Jyotirmoy Amin, Ravi Hegde

    Elite athletics throwing provides a structured biomechanical action sequence together with an objective continuous outcome, namely throw distance, making it a suitable setting for performance-oriented sports analytics. In this work, we investigate whether explicit phase alignment of pose dynamics improves throw-distance prediction under realistic broadcast conditions. To support this study, we curate Throwing4, a dataset of 500 elite throwing clips spanning javelin, discus, hammer, and shot put, with corresponding two-dimensional pose sequences, frame-level phase annotations, and official distance labels. We formulate throw-distance prediction from broadcast-derived pose as a regression problem and compare full-sequence modeling against a phase-conditioned approach that partitions each attempt into four technique stages and fuses phase-specific motion representations. Experiments across multiple graph-based pose encoders show a consistent reduction in prediction error when phase structure is incorporated, indicating that phase-aligned modeling provides a more stable representation than treating the entire motion as an unstructured sequence. These findings suggest that explicit…

    PDF
  • arXiv cs.CLOct 12

    PersonaFactor: Preference Factors with Dynamic Selection for LLM Personalization

    Hang Su, Zequn Liu, Jianghan Chao, Qiuyu Tian, Xuesong Lu +1

    Although users may express different personalization needs across tasks, these task-specific behaviors can reflect shared underlying preference mechanisms. Existing LLM personalization methods often focus on surface-level interactions or undifferentiated histories, overlooking the shared mechanisms underlying these behaviors. We introduce PersonaFactors, a framework that distills reusable and interpretable personalization factors from heterogeneous user interactions. We construct a library of thirteen PersonaFactors by extracting evidence-grounded rationales and clustering recurring patterns across tasks, and develop a dynamic factor-guided generation framework that selects factors relevant to each user's history and current request. Across four personalization benchmarks and four backbone models, Dynamic PersonaFactor achieves the best score on every reported metric. Representation analyses further show that PersonaFactors and user history induce partially overlapping low-dimensional representations, and that their joint use yields complementary shifts. Taken together, these findings suggest that factor-based and history-based personalization can mutually reinforce each other.

    PDF
  • arXiv cs.CLOct 12

    Rule vs.Consequence: Dissociable Internal Representations of Moral Reasoning in LLMs

    Eugenie Shi

    Large language models are increasingly deployed in morally and legally sensitive contexts, yet little is known about how they internally represent distinctions between moral reasoning styles. We ask whether a model's differential response to rule-framed and consequence-framed moral questions reflects distinct internal structure or merely surface lexical sensitivity. We construct a 2$\times$2 factorial dataset crossing reasoning style (rule-based vs. consequence-based framing) with judgment polarity (permissive vs. prohibitive), drawn from three established moral reasoning benchmarks and evaluated on a cleanroom test set of novel phrasings that includes conflict pairs where the two framings predict opposite labels. Using linear probing and activation steering, we identify two orthogonal directions in the residual stream: Dir-A tracks reasoning style and Dir-B tracks judgment polarity, each near-blind to the other factor (cross-correlation $|r| < 0.04$). This double dissociation replicates across three instruction-tuned models from different developers at comparable proportional depth, and it is not knife-edged in layer: the directions are recoverable and causally effective…

    PDF
  • arXiv cs.LGOct 12

    LoopQuant: Accurate and Efficient Post-Training Quantization for Looped Transformers

    Zhixiong Zhao, Zukang Xu, Xing Hu, Lifeng Liu, Guangyu Sun +1

    Looped Language Models (LoopLMs) improve parameter efficiency by recursively reusing shared Transformer modules, yet their repeated computation over evolving recurrent states poses new challenges for low-bit deployment. Existing post-training quantization (PTQ) methods, largely designed for feed-forward Transformers, fail to account for cross-loop activation dynamics, heterogeneous loop sensitivity, and recursive error propagation, leading to substantial performance degradation at low precision. To address these challenges, we propose LoopQuant, a loop-aware PTQ framework for accurate and efficient low-bit quantization of LoopLMs. LoopQuant is built on three core components: 1) Cross-Loop Distribution Canonicalization (CLDC) learns a shared quantization-friendly representation across recurrent states while preserving parameter sharing; 2) Interaction-Aware Loop-wise Precision Allocation (ILPA) allocates activation precision under a fixed bit budget by modeling task-level loop sensitivity and cross-loop interactions; and 3) Loop-Conditioned Task Calibration (LCTC) further aligns quantized inference with the low-bit recursive trajectory through lightweight task-space calibration.…

    PDF
  • arXiv cs.AIOct 12

    World Models Need a Physical Registry: Learning Internal Predictive States for Physically Plausible World Models

    Shinseong Kim, Jaeseok Jeong, Jianlong Fu, Youngjung Uh

    Video world models must generate physically plausible futures, not just realistic frames. Existing approaches typically use semantic, physical, or predictive information to guide the visual generation stream, leaving a fundamental question: where inside the generator should predictions of scene evolution live? Standard video tokens jointly encode appearance and dynamics, but provide no distinct state for learning and reading predictive dynamics. We answer this question with the Physical Registry: temporally grounded registry slots inside a video DiT that are initialized from an observation-conditioned forecast, co-evolve with video tokens, and receive future-representation supervision, making predictive dynamics an explicit, readable state of the generator. In a controlled comparison of predictive-state interfaces on Physics-IQ Verified, Physical Registry improves vanilla fine-tuning by 9.9/8.7 points on I2V/V2V, the largest gain among the interfaces we compare. Across all Cosmos and WAN backbones, Physical Registry improves Physics-IQ Verified scores. With only 0.45% additional parameters, it enables Cosmos 3 Nano 16B to surpass the published I2V score of Cosmos 3 Super 64B…

    PDF
  • arXiv cs.CVOct 12

    From Sound to Sense: An Anatomy of Semantic Supervision for Speech-Driven Visual Grounding in Remote Sensing Imagery

    Zhongyu Pang

    Speech-driven visual grounding in remote sensing (RSVG) removes the typing bottleneck of text-based interaction and is intended to preserve prosodic intent, enabling hands-free target acquisition in time-critical missions. The direct-audio paradigm, mapping raw speech straight to a bounding box and bypassing automatic speech recognition (ASR), was recently adopted by RSTalker, but what such grounders actually learn about language remains unmeasured. SemEcho grafts a frozen Whisper speech pathway onto a VLTVG grounding host so that speech and text share one decoder, making the paired text, free by construction since speech corpora in this task are synthesized from DIOR-RSVG expressions, a training-time teacher and a fair, same-host text upper bound. On this instrument we dissect three semantic injection channels (feature-mimicry distillation, word-level CTC supervision, and two-stage ASR pretraining) with linear semantic probes, and release Audio-DIOR-R (80,973 training clips; 10 timbres x K=3; Qwen3-TTS synthesis with online sox noise lambda in [0, 0.4]) and Audio-DIOR-Comp, a re-split holding out 17 attribute-category combinations under a 2x2 acoustic-semantic protocol. Our…

    PDF
  • arXiv cs.CLOct 12▲ 8

    HexaBee-4B: Six-Language Translation with Multilingual Answering and Bidirectional Supervision

    Iman Barati, Mohammadmostafa Rostamkhani, Mohammad Badzohreh

    Multilingual translation requires a model to preserve meaning while producing text in a requested language. We present HexaBee-4B, a translator adapted from Gemma 3 4B IT through three stages: Wikipedia continued pretraining, joint multilingual answering and answer-text translation, and bidirectional translation specialization. The intermediate stage connects two tasks through shared multilingual answers: answering a question in the requested language and translating an answer into that language. It comprises 19.46 million answering records, including 5.76 million cross-language question-answer pairs, and 10.70 million answer-text translations. The final stage uses 658,274 forward and reverse synthetic translation examples. On 36,572 synthetic test examples spanning all 30 directions among Arabic, Chinese, English, Hebrew, Persian, and Spanish, HexaBee-4B achieves direction-macro chrF++ of 73.75, compared with 57.11 for Gemma 3 4B IT and 66.83 for Gemma 3 12B IT. BLEU, TER, COMET, and a matched model-judged subset support the same overall ranking. These results demonstrate improved translation across the six-language set, with chrF++ gains in every evaluated direction over both…

    Code
  • arXiv cs.CVOct 12

    VideoSlate: Stateful Commit Control for Temporally Grounded Agentic Video Reasoning

    Shuo Zheng, Yuanjie Dang, Peng Chen, Jianjun Xiang, Ronghua Liang +2

    Agentic video reasoning systems gather and assess video evidence across stages, selecting relevant spans as visual evidence for answering questions. New candidates and observations prompt reassessment of the current span, but revisions can correct localization errors or discard useful evidence already present in the adopted span. Systems therefore need to connect evidence organization across stages with temporal state control, allowing accumulated information to jointly inform revision assessment while explicit adoption decisions govern how assessment outcomes affect downstream visual evidence. We introduce VideoSlate, a stateful commit-control framework built around shared evidence. A typed evidence blackboard links candidate spans, provenance, construction, and verifier observations, enabling an incumbent-relative certifier to assess revision support from the candidate, current span, and related proposals. Based on certification, the controller authorizes a revision or retains the current span, separating evidence accumulation from state updates and recording each decision and its evidence on the blackboard. Extensive evaluations across video grounding and grounded…

    PDF
  • arXiv cs.NEOct 12

    naspaclust: A hybridisation of spatial fuzzy clustering with nature-inspired optimisation

    Bahrul Ilmi Nasution, Rezzy Eko Caraka, Robert Kurniawan

    We present an overview of R package called \texttt{naspaclust}, a tool for spatial fuzzy clustering improvement by hybridising the Fuzzy Geographically Weighted Clustering (FGWC) with nature-inspired optimisation algorithms. There are seven optimisation algorithms in general, namely Artificial Bee Colony, Flower Pollination Algorithm, Gravitational Search Algorithm, Harris-Hawk Optimisation, Intelligent Firefly Algorithm, Particle Swarm Optimisation, and Teaching-Learning Based optimisation. The optimisation algorithms available do not only use the basic algorithms, but also the modified version of several parts such as randomisation terms and updating rules. Furthermore, we also provide additional options by providing more distance metrics options based on the \texttt{ rdist} package. This study showed the implementation of the \texttt{naspaclust} package in various cases, as well as comparing the performance of the algorithms in the scope of basic algorithms. The \texttt{naspaclust} package allows to improve the performance of fuzzy clustering, mainly in spatial context.

    PDF
  • arXiv cs.CLOct 12▲ 38

    Self-Distillation with Verbal Regularization

    Jiazheng Li, Yawei Li, Junru Lu, Zhenyi Shen, Di Yin +5

    On-policy self-distillation (OPSD) trains a large language model using supervision from a teacher instantiated from the same model as the student. The teacher is conditioned on privileged information (PI), such as verified solutions. The student, which does not observe PI, learns from the teacher's next-token distributions along its own sampled responses. However, PI can bias supervision toward shortcut reasoning with limited verification or reconsideration, accompanied by a sharp drop in the entropy of the output distribution. To address this challenge, we introduce self-distillation with verbal regularization (VRSD), which uses system prompts to regulate how the teacher uses PI, thereby encouraging rethinking and exploration to counteract premature commitment. Theoretically, we model prompting as attenuating the influence of PI on the teacher distribution and derive conditions for entropy preservation. Across three models and four tasks, VRSD improves Pass@1 over OPSD in 11 of 12 model-task settings, by 3.9 percentage points on average, while generally maintaining higher token entropy.

    Code
Load more
PDF
PDF
PDF

Rising research topics

  • Anomaly detectors22+46.7%
  • Optimal power flow100.0%
  • Deepfake detection48−4.0%
  • Forecasting time52−18.8%
  • Electrocardiogram ecg34−19.0%
  • CAD models14−22.2%
  • Machine learned interatomic38−26.9%
  • Multimodal532−27.1%