arXiv AI

Space Is Intelligence: Neural Semigroup Superposition for Riemannian Metric Generation

arXiv:2606. 18828v1 Announce Type: cross Abstract: Traditional approaches place intelligence in the agent, whether as a learned policy or a search procedure.

arXiv AI
Jun 9

Riemannian-Manifold Steering: Geometry-Aware Generative Autoencoders for Label-Free Steering

arXiv:2605. 24942v2 Announce Type: replace-cross Abstract: Steering a language model - intervening on its internal activations to change downstream behaviour - has recently expanded beyond linear interpolation to nonlinear methods such as angular and kernelized steering, which define intervention transformations without learning an explicit geometry over paths in activation space.

By Narmeen Oozeer, Shivam Raval, Philip Quirke, Manikandan Ravikiran, Jeff Phillips, Shriyash Upadhyay, Amirali Abdullah
arXiv Machine Learning
Sep 11

ObstaDiff: Generalizable Diffusion Policy Learning via Obstacle-aware Representations

ObstaDiff is a diffusion-policy framework that introduces a lightweight obstacle-aware visual encoder to generate structured representations of targets, obstacles, and background. By aligning these representations, the policy produces end-effector trajectories that focus on a target-centered bottleneck pose while accounting for surrounding obstacles. In real-robot greenhouse trials, ObstaDiff achieved a 75.41% task success rate and an 8.20% obstacle collision rate, outperforming existing imitation-learning baselines in cluttered agricultural settings.

By Jiawen Wang, Kevin Yao, Khalid Jawed
arXiv Machine Learning
1d ago

Training-Free Diffusion Planning with Analytical Local Scores

The paper presents a training-free diffusion-based motion planner that replaces learned global trajectory scores with analytical local scores derived from obstacle, smoothness, velocity, and inter-agent feasibility terms. By reconstructing trajectory scores through local interactions between neighboring waypoints and nearby constraints, the method decomposes the denoising process while preserving the optimization structure of classical trajectory methods. Experiments demonstrate that this approach generates smooth, feasible trajectories for large multi-agent tasks in complex environments quickly, outperforming learning-based and optimization baselines without requiring training data.

By Michael Y. Fatemi, Jinhao Liang, Ferdinando Fioretto
arXiv AI
Sep 23

SE(3) Neural Potential Fields for 6-DoF Trajectory Planning Directly from Images Without Explicit 3D Reconstruction

The paper introduces SE(3) neural potential fields that learn collision‑free 6‑DoF trajectory planning directly from posed RGB images, eliminating the need for explicit 3D reconstruction. By supervising the field with a navigation function based on geodesic distances to the grasp, the method avoids the classic pitfalls of artificial potential fields, achieving near‑goal convergence within 3 cm from any start and producing collision‑free paths on a UR10 robot. Experiments on two tabletop scenes show significant improvements in clearance, reduced arm‑link contacts, and a 90 % grasp success rate, while planning time drops from over a minute to about 2 seconds compared to RRT* on a reconstructed scene.

By Jeffrey Eiyike, Masoud Ataei, Elvis Gyaase, Vikas Dhiman
arXiv Computer Vision
Sep 16

EgoPathBench: Evaluating Zero-Shot Egocentric Waypoint Decision-Making in Vision-Language Models

EgoPathBench is a new dataset and benchmark that tests zero‑shot egocentric waypoint decision‑making in vision‑language models. Each task presents an egocentric RGB image, a natural‑language goal, and numbered visible waypoints, and models must return traversable candidates or an ordered route. The benchmark evaluates candidate feasibility, edge legality, and goal arrival under point‑agent or embodied geometry, covering 31,852 training, 1,345 validation, and 1,111 benchmark questions. "whyItMatters":"The benchmark reveals that current VLMs perform poorly on integrated navigation tasks, highlighting a gap in spatial intelligence that can be addressed by fine‑tuning with the released training data."

By Yang Zhao, Zhuo Chen, Xubo Yang
arXiv Machine Learning
Jun 18

Riemannian MeanFlow for One-Step Generation on Manifolds

arXiv:2603. 10718v3 Announce Type: replace Abstract: Flow Matching enables simulation-free training of generative models on Riemannian manifolds, yet sampling typically still relies on numerically integrating a probability-flow ODE.

By Zichen Zhong, Haoliang Sun, Yukun Zhao, Yongshun Gong, Yilong Yin