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 fields2288Multimodal498AI agents411Frontier LLMs287Inference & serving208Teacher policy distillation161Medical image segmentation128Physics informed neural106Supervised & diffusion models75Voice AI59Forecasting time45Federated learning44Deepfake detection42Remote sensing38Machine learned interatomic35Electrocardiogram ecg31All 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.ROOct 11

    Hand2Robot: Object-Centric 4D Hand Reconstruction from Human Demonstrations for Robotics

    Zetao Du, Weiqing Wang, Hanbing Zhang, Yimiao Zhou, Ye Shi +2

    Human demonstrations can capture task-relevant manipulation without using the target robot, but the recorded hand motions cannot directly serve as robot action supervision. Hand reconstruction and motion retargeting provide a direct route to such supervision, yet recovering hand motion alone does not ensure physically consistent hand-object interactions. To address this issue, we introduce Hand2Robot, an object-centric 4D hand reconstruction framework for robot policy post-training. Given videos of humans performing the target task, Hand2Robot extracts interaction clips, reconstructs object geometry, and generates robot action supervision through hand-object interaction optimization and motion retargeting. For object tracking, we combine observation confidence with temporal motion constraints to select a globally consistent object pose trajectory from per-frame pose candidates. For hand refinement, we use object geometry and motion as a reference and combine staged 2D alignment with object-local contact constraints to refine hand trajectories and finger joint configurations. Experiments on DexYCB and HO3D-v3 show improved object pose accuracy and hand-object interaction quality.…

    PDF
  • arXiv cs.ROOct 11

    SurgiCLAW: An Interpretable Atomic-Skill Agent for Precision Robotic Micromanipulation

    Angen Ye, junjie xie, Yujia Song, Junkai Huang, Dapeng Zhang

    Recent multimodal large language models (MLLMs) and vision--language--action models have provided robots with new capabilities for long-horizon task understanding and planning. In surgical robotics, however, end-to-end prediction of low-level actions remains limited by insufficient precision, opaque decisions, and scarce data. This paper presents SurgiCLAW, a hierarchical skill-based framework for precision surgical manipulation. SurgiCLAW confines an MLLM to intraoperative visual understanding, structured explanation, and atomic surgical-skill selection, while delegating physical execution to verifiable deterministic control programs. For brain--machine-interface implantation, a representative high-precision surgical task, we construct a state-to-skill invocation dataset and expand it through visual and state perturbations. The model first learns structured skill invocation through supervised fine-tuning and is then optimized using three rewards for action correctness, operation prerequisites, and format validity, improving action selection, operational safety, and output parseability. We evaluate subtask success, offline model comparison, real-robot performance, and ablations.…

    PDF
  • arXiv cs.CVOct 11

    SlotAVS: Object-Centric Audio-Visual Segmentation via Bi-Modal Slot Attention

    Arnav Sharma, Anand Mishra, Renu Rameshan

    Audio-Visual Segmentation (AVS) requires predicting pixel-wise masks of sounding objects by grounding acoustic signals in visual space. In multi-source scenes, concurrent sound sources often remain entangled within shared visual representations, leading to merged masks or unstable specialization when using standard alignment-focused transformer architectures. To address this, we present SlotAVS, an object-centric framework driven by competitive bi-modal slot attention. While robust foundation models provide rich semantic priors, SlotAVS shifts the paradigm from global cross-modal fusion to explicit competitive binding. By initializing discrete object slots from temporal audio sequences and enforcing strict slot-wise competition over spatial visual tokens, our method structurally mitigates the blending of distinct acoustic entities. Further, to stabilize instance-level learning, we introduce a Hungarian matching strategy that optimally aligns slots with ground-truth objects using spatial and boundary overlap. Coupled with a numerically stable, confidence-aware mask fusion mechanism, SlotAVS robustly aggregates multi-source predictions. Extensive experiments on the AVSBench dataset…

    PDF
  • arXiv cs.SEOct 11▲ 36

    A Decade in a Day: Synthesizing Agent-Native Interfaces from Human-Oriented Software Evolution

    Alan Wu, Wei Tao, Yiwen Guo

    Large language model agents are emerging as an important new class of users of desktop applications. However, existing desktop interfaces were designed for human end users or application developers, leaving agents to interpret visual controls or discover and compose low-level software operations. This mismatch can hinder even capable agents, yet it remains unclear what interface properties make desktop software easier for agents to use. To study this question, we treat software evolution as a natural source of interface variation and introduce DeskIF-Bench, a benchmark of 255 artifact-verified tasks across six desktop applications. By holding the task, agent, and verifier fixed while varying the software release, we measure how interface changes affect agent performance. Across two models and six applications, the newest release consistently outperforms the oldest. Trajectory analysis identifies three relevant interface properties: discoverability, granularity, and observability. Guided by these properties, we develop ANIS, a framework that synthesizes agent-native interfaces from the capabilities of installed applications. On an expanded evaluation of 368 tasks across eight…

    Code
  • arXiv cs.CLOct 11

    Robust Marathi Sentiment Analysis using Domain-Adaptive Pre-training and Data Augmentation Approaches

    Tanvi Somani, Aryan Babare, Samyak Bora, Raviraj Joshi, Abhinay Dhamankar

    For languages with limited resources, Sentiment Analysis remains a challenging problem due to limited annotated data and strong domain variability across textual sources. Marathi, despite being widely spoken, lacks extensive multi-domain sentiment analysis studies. Recent efforts by L3Cube have introduced multi-domain datasets in Marathi, enabling a better study of domain-aware sentiment classification. This study uses the pretrained MahaBERT model to improve sentiment classification for Marathi across different domains. Models are trained on individual domain datasets and domain-adaptive pretraining is applied using masked language modeling to help the model better understand domain-specific language. In addition, back-translation is used as a method of data augmentation to increase the diversity of training data. Results show that these methods lead to consistent improvements in accuracy across all domains. The improvements range from a minimum of about 0.12% to a maximum of about 1.74%, depending on the dataset. These results demonstrate that domain-adaptive pretraining and data augmentation are effective strategies for improving sentiment analysis models. This helps achieve…

    PDF
  • arXiv cs.LGOct 11

    Hyperbolic Time Series Forecasting with Learnable Decomposition and Manifold Dynamics

    Sarang Rajendra Patil, Vishal Fenn, Mengjia Xu

    Multiscale structure is central to time series forecasting: temporal signals contain slowly varying trends, intermediate seasonal patterns, and high-frequency residuals. Traditional forecasters model this multiscale structure in Euclidean space, without representing the ordering it induces among components. We identify that cascaded decomposition orders components by their characteristic frequencies, forming a natural frequency hierarchy. This hierarchy aligns with the exponential volume growth of hyperbolic space, which provides increasing representational capacity with radius and naturally accommodates nested hierarchies. We propose HyperForecast, the first long-term time series forecasting (LTSF) framework operating in hyperbolic space. HyperForecast embeds decomposed temporal segments on the Poincaré ball where radial distance captures this nested structure, from low-frequency components near the origin to high-frequency components near the boundary. We model geodesic velocity through two manifold-dynamics variants: (a) autoregressive forecasting via Poincaré residual dynamics, and (b) non-autoregressive forecasting that predicts all future segments in parallel. HyperForecast…

    PDF
  • arXiv cs.CLOct 11

    Enhancing Zero-Shot Domain Transfer in Low-Resource Sentiment Analysis: A Case Study in Marathi

    Tanvi Somani, Aryan Babare, Samyak Bora, Raviraj Joshi

    Sentiment analysis is a key task in Natural Language Processing that determines the polarity of opinions in text. For low-resource languages like Marathi--where limited data prevents the direct use of standard statistical methods--models are often trained on single-domain datasets. While this yields strong in-domain performance, it leads to poor generalization to unseen domains. Recent studies highlight the need for domain-robust systems that can handle diverse real-world content through multi-domain modeling. This study investigates how multi-domain training improves sentiment classification for unseen Marathi domains. Models are trained using single-domain, two-domain, and three-domain dataset combinations. Results show that two-domain training improves accuracy on unseen domains by about 8\% compared to single-domain training. Adding a third domain provides further improvement, though the gain is smaller, averaging around 2\% for some domains. These results suggest that training with data from multiple domains helps build more robust sentiment analysis models for low-resource languages, though the benefits reduce as more domains are added.

    PDF
  • arXiv cs.CVOct 11

    Frozen History: When Temporal Losses Stop Accumulation in Learned Real-Time Supersampling

    Hao Yu, Guoying Zhao

    Learned real-time supersampling accumulates jittered low-resolution samples along motion vectors. Many methods use a temporal consistency loss to reduce flicker. We show that with accurate registration, this loss can suppress accumulation: on static content, the network copies its warped history at almost no temporal cost. Camera jitter in motion vectors raises this cost and can hide the effect. We identify four registration errors that training can conceal: jitter-carrying motion vectors, one motion field for both resolution lattices, jittered depth, and an unregistered skip path. A model-free oracle shows that correct registration makes freezing two orders of magnitude cheaper on static pixels. Controlled training shows that registration reverses the temporal weight's effect on PSNR. Under exact registration, increasing the weight reduces pixel variance at the expense of accuracy and perceived quality, with a 0.7 to 0.9 dB loss on static frames at weight 0.25. This reversal recurs across three network families and two scales; the loss also reduces accuracy on unjittered STSS data. With a small temporal weight and a normalised sample accumulator, a plain registered network…

    PDF
  • arXiv cs.AIOct 11

    Google Earth AI Geospatial Reasoning Agent: Capabilities and a Systematic Evaluation

    Noam Slonim, Aviv Slobodkin, Gil Fidel, Gal Moshitch, Mimi Sun +32

    Google Earth AI is a family of geospatial AI models, together with an agent that orchestrates them. We present this agent, Google Earth AI's Geospatial Reasoning agent (GRA), a Gemini-powered research system that combines geospatial data sources, foundation models, and tools to answer questions about our planet. GRA organizes these into modular domain skills and pairs them with upfront geospatial planning to decompose complex queries into multi-stage workflows. Evaluating such systems is hard: real-world problems admit multiple valid workflows, require data discovery across large catalogs, and rely on evolving ground truth. We introduce two benchmarks and release their development splits. GeoExpertQueries poses complex analytical problems grounded in practitioner use cases and refined by geospatial experts; each is paired with a consensus golden workflow from three independent experts and scored by a human-validated, tool-agnostic autorater. GeoKTools consists of templated queries with deterministic reference solvers that systematically vary the number of required tool types. We also use two external benchmarks, CBGB and UnivEARTH; the latter we find to be saturated. To isolate…

    PDF
  • arXiv cs.CVOct 11

    SpikeOcc: Towards Resilient Multimodal 3D Occupancy Perception via Spiking Experts

    Yiding Sun, Zijie Xu, Hongqiang Lin, Jiajun Cao, Dongxu Zhang +5

    Multimodal 3D occupancy prediction underpins safe autonomous driving through comprehensive scene understanding. However, existing methods have largely pursued higher accuracy through sophisticated fusion, leaving resilience to missing sensors underexplored. In this paper, we investigate spiking neural networks (SNNs) as a means of building more resilient multimodal perception. Still, the discrete nature of spiking neurons makes optimization challenging. To overcome this difficulty, SpikeOcc is introduced with two complementary components, a Spiking Mixture-of-Experts (SMoE) and Sensor Availability Learning (SAL). Specifically, SMoE organizes RGB, LiDAR, and joint fusion into specialized pathways, enabling full-width unimodal representations while retaining the original multimodal features via a bounded residual. Beyond sensor dropout, SAL employs a staged curriculum with explicit routing supervision, progressively improving robustness under severe sensing conditions. Remarkably, SAL also yields notable gains for conventional models, highlighting its broader potential for resilient multimodal learning. Extensive experiments demonstrate that SpikeOcc maintains competitive…

    PDF
  • arXiv cs.CVOct 11

    RSAJEV: Training-Free Abstaining Prototype Memory for Eliminating Silent Hallucination in JEV-Based Remote Sensing Classification

    Man Chen, Antai Chen, Shuai Xu, Chengjie Gu, Huaping Zhou +3

    Scene classification of remote sensing imagery with multimodal large language models (MLLMs) is formulated as a single-forward-pass decision problem: candidate class names are lettered options in the prompt, a registered answer slot is conditioned on the prompt, and classification is read out by scoring letter tokens with the language-modeling head. We show that although this letter binding is highly effective within its training vocabulary (97.71% OA on UCM), it behaves erratically out of vocabulary: zero-adaptation accuracy across four cross-dataset directions fluctuates between 7.35% and 96.40%, and under out-of-vocabulary weights its confidence fails inversely on open-set evaluation, assigning higher confidence to unseen than to seen classes (AUROC 0.38), a failure we term silent hallucination. We retain the slot representation and replace the readout with RSAJEV, a training-free abstaining prototype memory that performs retrieval-based prototype matching: K reference images per class are cached as prototypes via their slot representations under the same prompt, and classification becomes nearest-neighbor retrieval over the prototypes, refined by a shrinkage-Mahalanobis…

    PDF
  • arXiv cs.AIOct 11

    Visible but Not Avoided: State-Dependent Re-Proposal of Rejected Candidates in Catalog-Based LLM Optimization Loops

    Jianlin Chen, Wenhui Chen, Chi Man Vong

    LLM optimization loops often show the proposer the candidates it has already tried and rejected, but leave it to the proposer to avoid them. We ask whether avoidance measured in a static probe predicts avoidance in the states an optimizer's own trajectory produces. In catalog-based loops where three open LLMs improve a GUI agent by naming one of 40 edits, a re-proposal is identified exactly by the edit's name. Clean base-state probes underpredict re-proposal in the proposers' own loops (macro-averaged loop-minus-probe rate 0.32 [0.27, 0.37]), and proposals of already evaluated harness-edit pairs consume 28-63% of valid proposer iterations. The two settings reject different edits: a probe's rejected edits are mostly ones the proposer did not choose, whereas a loop's are its own earlier choices, which remain preferred when the history is removed. Ordinary history lowers re-proposal for two proposers but raises it for the third, and the effects of failure evidence are model-specific. Stating the rejection status in one sentence lowers re-proposal in every model (-0.16 [-0.22, -0.09] relative to a neutral list of the same IDs). For catalog-based loops with exact edit identities,…

    PDF
  • arXiv cs.CVOct 11

    ScenePlacer: Reformulating Scene-Level Object Pose Estimation as Visibility Field Learning

    Ken Deng, Jiarui Liu, Guibiao Liao, Kunming Luo, Mochu Xiang +5

    We present ScenePlacer, a framework for scene-level pose estimation of objects generated by state-of-the-art native shape generation models, placing generated 3D objects into scenes given a partial geometric observation without modifying the underlying generative pipeline. Existing scene generation approaches either generate objects directly in scene coordinates, compromising their canonical-space priors, or regress poses from complete generated shapes in the shape generation process - the latter being a poorly conditioned problem that is sensitive to scale ambiguity and partial observations. ScenePlacer decouples object generation from pose estimation by reformulating alignment as conditional visibility-field learning. Given an observed partial point cloud from reconstruction and a generated mesh, it predicts a visibility field defined in object space, then estimates the rigid transformation by aligning the partial observation to visible parts on the mesh. We propose a pretrained 3D shape VAE as our backbone, preserving its mesh prior while conditioning it on a separately encoded observation. We further introduce visibility-aware, radius-constrained supervision and synthesize…

    PDF
  • arXiv cs.CLOct 11

    NepPlural: A Human-Anchored Benchmark for Persona Annotation in Nepali Migration Discourse

    Jinu Nyachhyon, Anish Khatiwada, Bimal Timilsina

    Pluralistic alignment asks that language models faithfully represent a society's diverse, competing values rather than collapse them into one dominant viewpoint, yet flagship pluralistic-alignment datasets remain heavily skewed toward Western respondents. We introduce NepPlural, a human-anchored benchmark for modelling competing socio-cultural personas in Nepali public discourse on youth migration and brain drain. We curate 2,148 code-mixed (Devanagari, Romanized Nepali, English) YouTube comments, annotate them along a four-axis persona taxonomy (Intent, Primary Driver, Value Orientation, Affect) plus an explicit No-Persona class, and build a 300-comment gold set labelled independently by three native Nepali speakers (mean Fleiss' $κ\approx 0.55$). Using this gold set to audit automatic annotation, we find that LLM annotation reliability is driven by protocol. Labels collected in batches through chat interfaces reach only near-chance inter-model agreement ($κ\approx 0.17$). Annotating one comment at a time raises agreement above the native-speaker level ($κ\approx 0.72$), but consistency is not validity: under a forced-choice schema, models agree on personas for the 39% of…

    PDF
  • arXiv cs.LGOct 11

    A Dependency-Aware Multi-GPU Training Framework for Temporal Graph Neural Networks

    Yang Zhao, Yue Dai, Liang Qiao, Buxin Tu, Bo Liu +6

    Temporal graph neural networks (TGNNs) achieve superior performance in many dynamic graph learning tasks. These models use node state vectors (i.e., memories) to capture and record graph changes (i.e., events), and then exploit these memories to assist prediction. However, this memory-centric design makes multi-GPU training challenging because predictions for later events often depend on memory updates from earlier events. To maintain model quality, existing multi-GPU TGNN training schemes strictly preserve all event dependencies, which limits parallelism and causes expensive cross-GPU memory synchronization. In this work, we observe that many of these dependencies can be handled more flexibly without harming training quality. Specifically, (a) dependencies in TGNN training have high locality in both time and graph topology, (b) the short-range dependencies missed within a large batch can often be recovered cheaply, and (c) many memory updates are not immediately needed. Based on these observations, we propose DepBloom to accelerate multi-GPU TGNN training with three techniques: (1) temporally bounded spatial partitioning to reduce unnecessary cross-GPU synchronization and…

    PDF
  • arXiv cs.CVOct 11

    Visually Legible but Adversarial: Watermark-Constrained Attacks on End-to-End VLMs for Document Understanding

    Qingzhe Han, Fan Dang, Shengqi Chen, Xinyi Sun, Haoyu Xiong +2

    Visible watermarks convey document ownership, confidentiality, and status, but can also carry adversarial signals. We introduce Auto-Regional Adversarial Watermarking (AR-AWM), a model-aware white-box attack on end-to-end visual language models (VLMs) for document understanding. AR-AWM constructs a small, spatially distributed watermark-text support and optimizes only its pixels to disrupt visual representations. The attack is untargeted and question-agnostic: generation uses no questions, answers, parsing prompts, language-model gradients, or language-model outputs. Each attacked page is reused across downstream queries. On Qwen2.5-VL-7B, a watermark support covering 7.98% of page pixels under the reporting threshold reduces DocVQA exact match from 0.899 to 0.150 and average normalized Levenshtein similarity (ANLS) from 0.939 to 0.212. Selected qualitative cases retain visually legible source fields. The same support without optimization and with matched random perturbations retains ANLS of 0.932 and 0.933, respectively, identifying adversarial optimization as the primary cause of degradation. Layout-matched optimized rectangles yield ANLS of 0.276, showing an incremental…

    PDF
  • arXiv cs.CROct 11▲ 15

    SkillMarker: A KGW-Based Watermarking Method for Agent Skill Ownership Verification

    Alan Tang, Lifeng Wang, Gang Wu, Tao Zhang, Yantao Jia +1

    Agent skills encode operational procedures and domain expertise as reusable knowledge assets, yet their distribution in plaintext exposes them to unauthorized copying and leakage. However, practical mechanisms for skill ownership verification and leakage tracing remain underdeveloped. Watermark embedding before distribution offers a potential solution, but structured, compact skill instructions impose stringent requirements for factual and procedural accuracy. To address these challenges, we introduce SkillMarker, a KGW-based watermarking method that jointly targets functionality preservation and strong watermark embedding. SkillMarker unifies quality-constrained rewriting with signal-oriented candidate search. The former separates essential knowledge from flexible expression to preserve instruction fidelity; the latter explores alternative expressions to obtain a stronger watermark signal under preservation constraints. We release an open-source toolkit that integrates watermark embedding, quality auditing, and detection to support the protection of agent skills. SkillMarker targets ownership verification and leakage tracing in distributed skill ecosystems, where content may be…

    Code
  • arXiv cs.LGOct 11

    Uncovering the Generative Landscape of Diffusion Models: A Spectral-Guided Quality-Diversity Diffusion Framework

    Hannah Janmohamed, Joao Correia, Penousal Machado, Antoine Cully

    Denoising Diffusion Probabilistic Models have emerged as powerful generative priors across domains ranging from molecular design to high-resolution image synthesis. However, standard diffusion sampling is inherently biased toward high-likelihood regions, often limiting the diversity of outputs. In many domains, a single, high-likelihood sample is insufficient. Instead, diverse portfolios of high-performing solutions are required, motivating methods that uncover a model's full expressive range. Here we show that integrating Quality-Diversity (QD) optimisation with diffusion models enables the discovery of diverse, high-performing outputs. We first propose Quality-Diversity Diffusion, a framework that adapts QD to diffusion models by directly optimising the model's latent noise and conditioning embeddings and leveraging embedding models to quantify diversity. Second, we introduce a novel h-space Spectral Mutation operator, which guides search along directions of maximal semantic sensitivity by analysing principal singular vectors of the model's input-to-activation Jacobian. We evaluate our combined approach, Spectral-Guided Quality-Diversity Diffusion, on text-to-image generation.…

    PDF
  • arXiv math.STOct 11

    Adaptive Robust Confidence Sets in High Dimensions

    Ilias Diakonikolas, Chao Gao, Daniel M. Kane, Yuetian Luo

    We study adaptive confidence sets for mean vectors of multivariate Gaussians with identity covariance under Huber contamination when the contamination proportion is unknown. We show that an information-theoretically optimal adaptive confidence set can be constructed by simultaneously quantifying uncertainty across all one-dimensional projections. The resulting confidence set achieves the optimal diameter and reveals a substantial adaptation cost compared with the minimax estimation error. Although statistically optimal, this construction is computationally infeasible. We establish a Statistical Query (SQ) lower bound showing that achieving diameter $O(m^{-1/2})$ requires either exponentially many queries or query tolerance $d^{-Ω(m)}$. Thus, in contrast to robust mean estimation, adaptation to the unknown contamination proportion incurs both a statistical cost and a computational barrier within the SQ framework. Finally, we give a low-degree moment-matching algorithm that constructs an adaptive confidence set using $d^{O(m)}$ samples and time. Its diameter bound contains an additional $O(m^{-1/2})$ term beyond the information-theoretic rate, matching the dependence on $m$ in the…

    PDF
  • arXiv cs.CVOct 11

    PhySimCode: A Benchmark and Evaluation Method for Physics Video to Code Generation

    Souraja Kundu, Aditya Gupta, Joel Julin, Yizhou Zhao, Liuyue Xie +1

    Multimodal large language models (MLLMs) are good at video understanding and code generation, but it remains unclear whether they can recover the physical laws underlying videos, a capability essential for converting videos into executable simulations and for providing structured physical supervision in robotics. Captioning motion video does not imply that a model has inferred its governing dynamics, estimated quantitative parameters, or can regenerate the observed scene from code. Existing video-physics benchmarks evaluate plausibility, property estimation, or future-state prediction, but offer limited insight into whether models can translate visual dynamics into runnable simulation code. We introduce PhySimCode, a benchmark for physics video-to-code generation: given only a raw video, a model must infer the relevant physics, recover parameter values, and generate runnable Python that reproduces the input video. The dataset contains 160.6K procedurally generated samples spanning 162 physics phenomena across analytic SciPy simulations and PyBullet-rendered rigid-body, articulated, fluid, and contact-rich scenes; each sample bundles the simulation code, physical parameters,…

    PDF
Load more
PDF
PDF

Rising research topics

  • Anomaly detectors21+50.0%
  • Deepfake detection42−16.0%
  • Optimal power flow9−18.2%
  • AI tutors8−27.3%
  • Electrocardiogram ecg31−27.9%
  • Causal discovery14−30.0%
  • Multimodal498−30.6%
  • Forecasting time45−31.8%