πŸ“„ Notable* Recent AI/ML arXiv Papers

Last updated just now...

πŸ“„ MaxIM: Maximally Informative Incremental Summarization via Reinforcement Learning
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12825v1
πŸ‘₯ Authors: Jihwan Jeong, Guy Tennenholtz, Yinlam Chow (possible past Google (United States) affiliation), Chih-Wei Hsu, Craig Boutilier (possible past Google (United States) affiliation)
Abstract

AI systems must often maintain bounded memory of unbounded interaction histories. However, optimizing the memory representation, and its updates, for downstream task utility is difficult for standard reinforcement learning (RL) due to severe credit assignment bottlenecks induced by sparse, delayed rewards. We introduce MaxIM (Maximally Informative Incremental Memory), a framework that formulates incremental summarization as a capacity-constrained, information-theoretic reward-shaping problem. Gr...

πŸ“„ Sage-Taiyi: A Metacognitive Architecture for Scientific Discovery
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12762v1
πŸ‘₯ Authors: Weida Wang, Benteng Chen, Yigeng Jiang, Shuchen Pu, Weiping Shen, Zichao Liu, Yulin Su, Zitong Wang, Siyu Zhou, Zifu Wang, Yizhi Li, Xin Zong, Yuning Yang, Jixiang Bi, Yuan Wang, Chuyi Peng, Shiyao Geng, Qi Zhang (possible past Tencent (China) affiliation), Kuan Lu, Mengzhu Li, Weiwang Xu, Peishan Xiang, Chengjun Liu, Chengrui Wei, Fangchen Yu, Shengji Tang, Yichen Jiang, Jingqi Ye, Cheng Yang (possible past Tsinghua University affiliation), Tao Hu (possible past Baidu (China) affiliation), Jianbiao Mei, Qinglong Cao, Kun Li, Yixin Chen, Shengyuan Xu, Juncheng Xiao, Yiheng Wang, Ruizhe Chen, Shiyang Feng, Runmin Ma, Xiangchao Yan, Zongsheng Cao, Haomeng Hu, Yu Ke, Taihui Wu, Meng Dai, Xu Guo, Haoyang Peng, Yinglong Ni, Pingsen Shi, Xiaosong Wang (possible past Nvidia (United States) affiliation), Shuyue Hu, Haijun Li, Sherry Dongqi Bao, Yang Yang (possible past Tencent (China) affiliation), Chao Yang, Jie Hou, Tianfan Fu, Yi Gong, Jin Zeng, Mao Su, Hongxia Hao, Fanyang Mo, Fenghua Ling, Tianshu Yu, Yunqi Cai, Baihong Chi, Jingwei Wang, Lei Wang (possible past Baidu (China) affiliation), Chuncheng Bu, Shide Lv, Guangyu Wang, Yuqiang Li, Chunfeng Song, Lei Bai, Hui Wang, Xujun Fu, Li Cao, Lei Chen, Dahua Lin, Xing Xie, Bowen Zhou, Wenlong Zhang, Pinlong Cai, Peng Ye, Aiwen Lei, Jie Li, Shengchun Wang, Bo Zhang (possible past Tencent (China) affiliation), Shufei Zhang
Abstract

We introduce Sage-Taiyi, a metacognition-inspired architecture that uses accumulated scientific understanding to guide what to investigate next and how to investigate it. Through explicit monitoring and control, the system revises its understanding of evidence, assumptions, and unresolved questions, then uses these assessments to adapt research targets and select reusable reasoning methods. On Taiyi-Bench, an AI co-scientist ideation benchmark comprising 265 tasks from 50 papers across ten disci...

πŸ“„ reComposer: Editable Planning for Controllable Image Generation
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12687v1
πŸ‘₯ Authors: Susie S. Y. Li, Angie Boggust, Fred Hohman (possible past Apple (United States) affiliation), Donghao Ren, Dominik Moritz (possible past Carnegie Mellon University affiliation), Yannick Assogba
Abstract

Prompt-based image generation makes it easy to produce visual assets, but offers little support for engaging with the creative process. Prompting collapses interdependent creative decisions into a monolithic instruction and returns a finished image, leaving control limited to revising the prompt or correcting the model's output. We present reComposer, a process-oriented image-generation interface built around editable planning, which decomposes users' evolving intent into meaningful creative dec...

πŸ“„ Double Blind Evals: Resolving the Dual Confidentiality Dilemma in AI Safety Auditing
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12604v1
πŸ‘₯ Authors: Andrew Trask (possible past University Of Oxford affiliation), Sol Messing, Vai Pahwa, Pegah Maham, Rene Kolga, Austin Frantz, Andrew Tash, Kate Thomas, Sean Mcgregor, George Balston, Patricia Paskov, Miles Brundage (possible past Openai (United States) affiliation), Akriti Vij, Bennett Hillenbrand, Alexandros Karargyris, Tin Acosta, Joel Fenster, Madeleine Elish, Rasmi Elasmar, Myriam Khan, Koen Van Der Veen, Rasswanth S, Sameer Wagh, Stephen Gabriel, Pedro Werneck, Lacey Strahm, Kevin Mcdonough, Ronnie Falcon, Kristian Lum (possible past Google (United States) affiliation), William Isaac (possible past Deepmind (United Kingdom) affiliation)
Abstract

AI safety evaluations often involve sensitive prompts and proprietary models. Evaluators want to keep their evaluation prompts secret from model owners to prevent purposeful or incidental data leakage, ensuring longer usefulness of their benchmark. Model owners in turn wish to keep their proprietary model weights and inference code within their own secure infrastructure to protect their IP. We present a way forward for "double-blind evals", which provide cryptographic guarantees that an evaluato...

πŸ“„ Embodied First Exam
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12177v1
πŸ‘₯ Authors: Kangrui Wang, Qineng Wang, Changhe Chen, Pingyue Zhang, Chi Gui, Feishi Wang, Canyu Chen, Wenli Xiao, Xiaoyu Huang, Tonghe Zhang, Linjie Li, Zihan Wang (possible past Tsinghua University affiliation), Minyeong Kim, Yiyou Sun, Mingkai Deng, Jinyu Hou, Qi Zhu, Han Liu (possible past Tsinghua University affiliation), Eric P. Xing, Huaxiu Yao, Zhiwen Fan, Yuejiang Liu, Dawn Song (possible past University Of California, Berkeley affiliation), Pieter Abbeel (possible past University Of California, Berkeley affiliation), Li Fei-Fei (possible past Stanford University affiliation), Jiajun Wu (possible past Massachusetts Institute Of Technology affiliation), Yuke Zhu (possible past Stanford University affiliation), Guanya Shi, Ruohan Zhang, Manling Li
Abstract

Early successes on agentic robotics point to a potential paradigm shift toward using coding agents to control robots. Existing robotics benchmarks are built around visuomotor policy learning, leaving it open whether coding agents can reliably control diverse robots under physical-world constraints. We therefore introduce the Embodied First Exam, a unified, comprehensive, and agent-native evaluation framework where coding agents can choose their own control approach: direct control, code to contr...

πŸ“„ CARE-PO: Controllable Tool-Call Efficiency for LLM Agents
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12125v1
πŸ‘₯ Authors: Xiaoyang Ye, Xiao Yao, Hairui Zhu, Yiying Yang, Bei Gan, Jinliang Lu, Tengjin Weng, Yuan Yao (possible past Tsinghua University affiliation), Wenhao Jiang (possible past Tencent (China) affiliation)
Abstract

External tool calls are a major running cost of an LLM agent, while its training objectives align almost exclusively with task completion. In a step-level diagnosis of Qwen3.5 trajectories at two model sizes on GAIA, a long-horizon tool-use benchmark, we find that most contain removable calls, at a similar rate at both sizes. Some methods add an efficiency reward to the objective to reduce the call count, but introduce problems of their own: the anchor they price calls against is computed from t...

πŸ“„ System Optimizations for Cost-Efficient Agent Harnesses
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12122v1
πŸ‘₯ Authors: Jongseok Park, Jiaxiang Yu, Eric Zhou, Tony Hong, Sunga Kim, Yusuf Afifi, Ian Wong (possible past Massachusetts Institute Of Technology affiliation), Ion Stoica (possible past University Of California, Berkeley affiliation), Alvin Cheung
Abstract

AI agent harnesses play the critical role of providing LLMs with an interface to a computing environment. Recent studies show that AI agents' task-execution accuracy depends mostly on the LLM used, while harness-side variances such as system prompts or tools have minimal impact. Rather, such harness-side variances show a larger impact on the cost of agent executions, achieving cost reductions up to 2.6 times on the same model and task. To further explore these harness-side cost optimization oppo...

πŸ“„ Joi-Bench-Task: Benchmarking Task Coordination in Full-duplex Voice Agents through Interactive Simulation
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12118v1
πŸ‘₯ Authors: Xiangheng He, Mingjun Zhao, Zhehao Fan, Zhengjia Li, Xiaopeng Sun, Qingqing Xiao, Haolan Chen (possible past Tencent (China) affiliation), Yu Xu (possible past Tencent (China) affiliation)
Abstract

Full-duplex voice agents enable natural, hands-free interaction, allowing users to refine requests, redirect ongoing work, and seek clarification while the agent is speaking. However, existing voice-agent benchmarks insufficiently isolate coordination between task execution and conversation. We introduce a benchmark that assesses this coordination by examining whether agents track what is being executed, what has been completed, what has been communicated, and what remains to be reported as the ...

πŸ“„ SkillDuet: Co-Evolving Models and Skills through Response Feedback
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12109v1
πŸ‘₯ Authors: Xingguang Ji, Ziqiang Dong, Yubo Zhang (possible past Carnegie Mellon University affiliation), Xi Leng, Yang Yang (possible past Tencent (China) affiliation), Guanjun Jiang
Abstract

During reinforcement learning, experience can be both internalized in LLM parameters and retained externally as reusable textual skills. Parameter updates alter the model's behavior and the interaction experience from which new skills are extracted. These skills, in turn, guide the model's subsequent interactions and parameter updates. As the model's capabilities evolve, previously beneficial skills may become redundant or detrimental. We present SkillDuet, a framework that coordinates parameter...

πŸ“„ Leveraging Complementary Event Frame and Voxel Representations for RGB-Guided Multimodal Pre-training
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12040v1
πŸ‘₯ Authors: Wentao Wu, Xiao Wang (possible past Google (United States) affiliation), Yi Wang, Chenglong Li, Yonghong Tian (possible past Peking University affiliation), Bin Luo
Abstract

In this paper, we propose CM3AE 2.0, a unified RGB Frame and Event-Voxel/-Frame pre-training framework. By jointly learning multimodal spatiotemporal representations and exploiting latent cross-modal dependencies through cross-modal generation, the framework enhances multimodal information interaction and collaborative modeling capabilities. Specifically, we first propose an Event-aware Spatiotemporal Masked Reconstruction (ESMR) strategy to learn unified multimodal spatiotemporal representation...

πŸ“„ Speculative Self-Distillation enables Efficient Knowledge Internalization
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12016v1
πŸ‘₯ Authors: Shayan Talaei, Agam Bhatia, Arshia Soltani Moakhar, Jonas HΓΌbotter, Amin Saberi (possible past Stanford University affiliation), Azalia Mirhoseini (possible past Google (United States) affiliation)
Abstract

Many real-world applications require language models to internalize knowledge that was absent from pretraining, to incorporate continually updated facts, or to learn new domain skills. Self-distillation has emerged as a natural approach for this task. A model conditioned on the source material acts as the teacher, and an unconditioned student is trained to reproduce the teacher's behavior closed-book. We propose Speculative Self-Distillation (SSD), an efficient per-token mixed-policy method for ...

πŸ“„ Enhancing Multi-Step Chemical Mechanism Prediction with Graph-Guided Preference Data
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12013v1
πŸ‘₯ Authors: Yu Zhang (possible past Google (United States) affiliation), Ruijie Yu, Xuelin Zhao, Jinming Yang, Feng Zhu (possible past Baidu (China) affiliation), Xiaokang Yang (possible past Shanghai Jiao Tong University affiliation), Yaohui Jin, Yanyan Xu
Abstract

Predicting multi-step chemical reaction mechanisms requires identifying plausible intermediates and correctly ordering the elementary reaction steps. Existing computational methods focus on single-step elementary reaction prediction, limiting their ability to generalize to unseen reaction spaces. We introduce a graph-guided framework for multi-step chemical mechanism prediction that leverages a chemical mechanism knowledge graph (ChemMechKG) to guide large language models (LLMs). To improve path...

πŸ“„ Infrathon: Benchmarking Language Agents for Real-World, Long-Horizon AI Infra Optimization
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.11995v1
πŸ‘₯ Authors: Zhengyu Hu, Zheyuan Xiao, Yike Wang, Hamish Ivison, Haoyu Wang (possible past Tencent (China) affiliation), Yige Yuan, Rulin Shao, Yuetai Li, Niqi Lyu, Yicheng Ding, Shu Yang, Zhichen Zeng, Banghua Zhu, Jiaxin Pei, Kaize Ding, Pradeep Dasigi, Dan Roth, Hannaneh Hajishirzi (possible past University Of Washington affiliation), Noah A. Smith (possible past University Of Washington affiliation), Teng Xiao, Radha Poovendran
Abstract

In this work, we study whether frontier agent can continually improve real-world AI infrastructure over long horizons. We introduce Infrathon, a benchmark of diverse, long-horizon AI infrastructure optimization tasks across different levels. We evaluate six models across 150 runs with 24-hour budgets, totaling over 10,000 GPU-hours. Our results show that model rankings vary with the evaluation horizon, while 135 of the 150 runs achieve further improvements during the second half of their budgets...

πŸ“„ Shaping Useful Noise: Energy Distributions Predict Visual Pretraining Quality
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.11962v1
πŸ‘₯ Authors: Ching Lam Choi, Antonio Torralba (possible past Massachusetts Institute Of Technology affiliation), Phillip Isola (possible past University Of California, Berkeley affiliation), Stefanie Jegelka
Abstract

Synthetic data can scale visual pretraining, but current selection criteria only partially explain which datasets train strong representations. We propose using the energy profile of a dataset--the distribution of log-probability levels it occupies under a normalised real-image density model--as an audit and curation principle for synthetic data. To operationalise this view, we introduce Energy-Level Distribution Distance (ELD), which compares real and synthetic energy distributions. Real images...

πŸ“„ Ultrasound-Assisted Biometric Watermarking Against Face Video Deepfakes
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.11800v1
πŸ‘₯ Authors: Guodong Liu, Lei Wang (possible past Baidu (China) affiliation), Dongxu Liu, Qianran Qiao, Meng Li (possible past Meta (United States) affiliation), Haipeng Dai, He Huang (possible past Baidu (China) affiliation), Guihai Chen (possible past Shanghai Jiao Tong University affiliation)
Abstract

Currently, artificial intelligence-generated content (AIGC) poses a severe threat to facial video deepfakes, and many AIGC companies employ video watermarking to mitigate unauthorized fake video usage, but its effectiveness is limited due to watermark tampering and private-model forgery. Additionally, some schemes actively add watermarks to user videos. However, current approaches focus primarily on the quality of watermark embedding in offline scenarios, and no existing work offers a solution f...

πŸ“„ Towards Trustworthy Mobile Speech Interaction: Ensuring Voice Authenticity and Transmission Integrity
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.11777v1
πŸ‘₯ Authors: Guodong Liu, Lei Wang (possible past Baidu (China) affiliation), Dongxu Liu, Qianran Qiao, Haipeng Dai, He Huang (possible past Baidu (China) affiliation), Guihai Chen (possible past Shanghai Jiao Tong University affiliation)
Abstract

The rapid progress of generative speech models has made high-fidelity voice cloning and editing cheap, fast, and widely accessible, weakening the security of voiceprint-based authentication in mobile speech interactions. Existing speech watermarking techniques focus on offline protection or watermarking synthetic speech, and thus cannot verify whether a live utterance originates from the genuine speaker at capture time. We present \textit{MoBiMark}, a real-time \textbf{mo}bile \textbf{bi}ologic ...

πŸ“„ ARMOR: Adaptive Curriculum Meta-Learning for Noise-Robust RAG Reasoning
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.11771v1
πŸ‘₯ Authors: Yan Wang (possible past Tencent (China) affiliation), Yuxin Zhang, Shenyu Zhang, Yongrui Chen, Sheng Bi (possible past Google (United States) affiliation), Guilin Qi
Abstract

Retrieval-Augmented Generation (RAG) systems have demonstrated remarkable effectiveness in mitigating hallucinations by incorporating external knowledge. However, the retrieval process inevitably introduces noise, posing significant challenges to RAG robustness. Fundamentally, noise robustness is a composite competency encompassing noise identification, retrieval filtering, and robust reasoning. Unfortunately, existing methods often fail to capture this holistic nature, typically restricted to s...

πŸ“„ LocateAnyMesh: Grounding 3D Mesh Queries in 2D Images with Vision-Language Models
πŸ—“οΈ Published: 11/8/2026
πŸ”— http://arxiv.org/abs/2611.11692v1
πŸ‘₯ Authors: Chris Choy, Zhiding Yu (possible past Nvidia (United States) affiliation), Jan Kautz (possible past Nvidia (United States) affiliation)
Abstract

Textured 3D meshes specify object geometry and appearance, making them a natural query for finding a particular asset in an image. We introduce LocateAnyMesh, a vision-language model that uses the mesh itself as part of its prompt. A frozen 3D encoder maps colored surface points to a compact token sequence, which a learned connector places alongside image and instruction tokens. We evaluate two grounding models with PPAT mesh tokens: LAM-Select selects image-region proposals, while LAM-Direct pr...

πŸ“„ InfraRSI: Harnessing Recursive Self-Improvement for Training Infrastructure
πŸ—“οΈ Published: 11/8/2026
πŸ”— http://arxiv.org/abs/2611.11558v1
πŸ‘₯ Authors: Infrarsi Team, Yuchuan Tian, Haocheng Mei, Ye Yuan (possible past Carnegie Mellon University affiliation), Chao Xu, Boxun Li (possible past Tsinghua University affiliation), Guohao Dai, Kai Han, Allen Chen, Yunhe Wang, Yu Wang (possible past Tsinghua University affiliation)
Abstract

While Recursive Self-Improvement (RSI) accelerates isolated algorithm and kernel synthesis, distributed LLM training depends on tightly coupled launch settings, operator kernels, and communication schedules, where single edits often hit out-of-memory (OOM) boundaries, compiler conflicts, measurement jitter, or silent numerical drift. We present InfraRSI, the agentic harness that turns open-ended human commands into verified training optimizations via a five-stage workflow: init locks editable sc...

πŸ“„ DriveFoundry: Co-Evolving Data and Model for Efficient Closed-Loop Iteration in Autonomous Driving
πŸ—“οΈ Published: 11/8/2026
πŸ”— http://arxiv.org/abs/2611.11532v1
πŸ‘₯ Authors: Ziyang Yao, Yuncheng Jiang, Fang Li, Haochen Liu, Shaoqing Xu (possible past Baidu (China) affiliation), Wen Zhang, Xiangyang Chu, Zibin Guo, Jiale Hou, Chuang Wan, Jia Hua, Gengzhao Xiang, Xiaoran Luo, Chong He, Yuechen Luo, Junzhe Wang, Zhiyu Sun, Jun Zhang (possible past Tencent (China) affiliation), Wei Li (possible past Peking University affiliation), Lei Li (possible past Carnegie Mellon University affiliation), Hongwei Xie, Bing Wang, Yuannan Shen, Jianwei Cui, Guang Chen, Hangjun Ye, Jingwei Zhao
Abstract

A driving foundation model must learn reusable decision knowledge from rare critical events and apply it under strict runtime constraints. We introduce DriveFoundry, a closed-loop framework improving iteration efficiency under data and computation budgets by coupling structured causal data refinement with adaptive inference. The Data Engine builds traceable scene-candidate records linking scene evidence and factor-decision relations to candidate trajectories and outcome assessments. Candidate co...

πŸ“„ Same Physics, Different Gradients: A State-of-the-Art Report on Differentiable Physics Simulation
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.12162v1
πŸ‘₯ Authors: Lei Shu, Zizhou Huang, Yunuo Chen, Yifei Li, Tao Du, Minchen Li, Tuur Stuyck, Miles Macklin (possible past Nvidia (United States) affiliation), Kui Wu, Bo Zhu, Yin Yang, Ming C. Lin, Alberta Longhini, Rika Antonova, Leonidas Guibas (possible past Stanford University affiliation), Gordon Wetzstein (possible past Stanford University affiliation), Jeannette Bohg (possible past Stanford University affiliation), Chenfanfu Jiang
Abstract

Differentiable simulation propagates derivatives through a physics simulator, turning animation, system identification, control, and computational design into gradient-based optimization. Engines differ in the physics they model and, less visibly, in which mathematical object they differentiate. We separate two questions the literature conflates. The referent is which object the returned derivative belongs to: the finite computation that executed, the converged equation it approximates, or the c...

πŸ“„ Scaling Adaptive Prompt Injection Attacks with Agent Swarms
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.11861v1
πŸ‘₯ Authors: Alexey Kurakin (possible past Google (United States) affiliation), Vishal Karande, Alex Bie, Chongyang Shi, Shuang Song (possible past Google (United States) affiliation), Saeed Mahloujifar, Abdullatif KΓΆksal, Jamie Hayes, Juliette Pluto, Yinghao Sun, Kamalika Chaudhuri
Abstract

Prompt injections have emerged as one of the top security risks faced by AI agents today. Early work in prompt injection attacks looked at simple tool-call agents and static attack payloads, and were saturated since mid-2025. As of Fall 2026, human red-teaming may be nearing saturation, especially on the Gemini family of models. In this work, we argue that despite this apparent plateau, prompt injection attacks are still possible and continued effort into prompt injection defense is needed. We...

πŸ“„ Payoff-Aware Prediction of Population Game Dynamics
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.11786v1
πŸ‘₯ Authors: Kang Wang, Xiao Wang (possible past Google (United States) affiliation), Bo Li (possible past Tencent (China) affiliation), Renzhe Xu
Abstract

Population game dynamics describe how aggregate behavior evolves in response to payoff signals. In many applications, the payoff function may change, and the goal is to predict the population trajectory induced by a new payoff design before trajectory data under that design are available. We study this problem as $\textbf{payoff-aware prediction of population game dynamics}$. Standard dynamics learning methods fit the motion observed under training payoffs, but do not separate the payoff-depende...

πŸ“„ Data-Driven Precision Control of Soft Helicoid Robots
πŸ—“οΈ Published: 11/9/2026
πŸ”— http://arxiv.org/abs/2611.11709v1
πŸ‘₯ Authors: Roshan S. Kaundinya, Mark Leone, Roberto Sabella, Hugo Buurmeijer, Luis Pabon, John Irvin Alora, Marco Pavone (possible past Stanford University affiliation), George Haller (possible past Google (United States) affiliation)
Abstract

A purely data-driven method grounded in the theory of adiabatic spectral submanifolds (aSSMs) was recently used to model and control nonlinear soft robotic simulators. Here, we extend the methodology to learn aSSM-reduced models from data collected from hardware soft robotic platforms. Specifically, we learn a five dimensional (5D) aSSM-reduced nonlinear ordinary differential equation (ODE) that accurately models the dynamics of a soft-helicoid trunk robot. We then use this ODE in a model predic...

*Notable papers are those with at least two authors from a "big" AI/ML lab.