Learning Manipulation-Sufficient Representations via Outcome Bottlenecks
Organizations: Department of Electronics Engineering, Yeungnam University, Gyeongsan 38541, Republic of Korea.
Abstract
Networked manipulation endpoints couple perception to actuation across compute- and bandwidth-limited links, yet commonly exchange dense geometric states optimized for fidelity rather than action outcomes. A stochastic representation is learned with a policy-free, action-conditioned outcome bottleneck: marginal outcome log-loss supplies distortion and a KL term regularizes rate. The construction is motivated by the minimal statistic that preserves the outcome distribution of every admissible action, while the implemented finite model is evaluated as a rate-regularized mixture predictor. The same encoder and outcome head support grasp selection, singleton conformal filtering, active viewpoint selection, and latent test-time adaptation. A finite-probe theorem identifies the local level-set tangent space with the null space of an outcome Jacobian. The synthetic oracle verifies this result; on scanned objects, an analytic surrogate agrees with measured simulator invariances within . Across 11,979 simulated grasps on 13 objects, a reconstructed-geometry wrench score attains 0.542 AUC against lift success and falls below chance on curved objects, while our representation attains 0.876. At 25% commitment, executed-grasp success is 0.503 versus 0.984. The 512-byte interface is smaller than one RGB-D frame and runs at 16,ms per CPU decision. Independent synthetic points track the tested conformal levels; scanned-object all-pair coverage is reported as a clustered empirical diagnostic. On unseen objects, within-scene AUC falls to 0.569, and a full-feedback update raises empirical mean pairwise coverage from 0.728 to 0.883.
Figures & tables
| Symbol | Meaning |
|---|---|
| continuous state ( 1 ), per fixed mesh | |
| RGB-D observation (or view set) | |
| grasp action ( 2 ), | |
| sensing action (viewpoint index) | |
| outcome | |
| task-outcome kernel used by the theory |
| Quantity | Value |
|---|---|
| Encoder parameters | 11.41 M |
| Head parameters | 0.251 M |
| Encoder payload , fp32 / fp16 | 512 B / 256 B |
| Single RGB-D frame, fp32 | 147.5 kB |
| Eight-view set, fp32 | 1.18 MB |
| Encoder forward, 1 / 2 threads | 25.6 / 14.9 ms |
| Predictor | Pooled | Within-scene | Best acc. |
|---|---|---|---|
| Chance / majority | 0.500 | 0.500 | 0.597 |
| Ferrari–Canny (recon.) | 0.542 | 0.548 | 0.612 |
| Ours | 0.876 | 0.639 | 0.784 |
| Privileged state | – | 0.685 | – |
| Act rate | Ferrari–Canny | Ours |
|---|---|---|
| 0.25 (selective) | 0.503 | 0.984 |
| 1.00 (always act) | 0.665 | 0.692 |
| Random grasp | 0.623 | |
| Target coverage | 0.950 | 0.900 | 0.800 |
|---|---|---|---|
| Pairwise coverage (Ours) | 0.946 | 0.897 | 0.800 |
| Singleton precision | 0.792 | 0.744 | 0.673 |
| Abstention rate | 0.823 | 0.743 | 0.598 |
| Retained action fraction | 0.169 | 0.235 | 0.373 |
| Fixed | ACI (anchored) | |
|---|---|---|
| Marginal coverage | 0.899 | 0.900 |
| Worst 500-decision window | 0.702 | 0.744 |
| Worst object segment | 0.720 | 0.834 |
| Per-object dispersion (std) | 0.111 | 0.035 |
| Object | Max angle [ ∘ ] | ||
|---|---|---|---|
| alphabet soup | 12 | 2 | 0.05 |
| BBQ sauce | 14 | 0 | – |
| butter | 14 | 0 | – |
| chocolate pudding | 14 | 0 | – |
| cookies | 14 | 0 | – |
| cream cheese | 14 | 0 | – |
| [nats] | Coverage | Abstention | |||
|---|---|---|---|---|---|
| 1 | 0.004 | 0.656 | 0.725 | 0.896 | 0.643 |
| 3 | 0.088 | 0.622 | 0.767 | 0.892 | 0.674 |
| 10 | 0.280 | 0.598 | 0.870 | 0.904 | 0.736 |
| 30 | 0.534 | 0.582 | 0.993 | 0.897 | 0.743 |
| 100 | 3.286 | 0.412 | 0.956 | 0.905 | 0.367 |
| Variant | Within | Pooled | Resp. |
|---|---|---|---|
| Ours (full) | 0.639 | 0.875 | 0.221 |
| Uniform outcome budget | 0.511 | 0.710 | 0.002 |
| Constant | 0.506 | 0.615 | 0.031 |
| sample | 0.602 | 0.844 | 0.174 |
| 0.634 | 0.873 | 0.219 | |
| 0.587 | 0.846 | 0.185 |
| Held-out object | base | Within | Top-1 | Cov. fix | Cov. ACI |
|---|---|---|---|---|---|
| Moderate base rate ( ): within-scene AUC is meaningful | |||||
| butter | 0.48 | 0.569 | 0.474 | 0.703 | 0.895 |
| cream cheese | 0.41 | 0.546 | 0.429 | 0.543 | 0.896 |
| tomato sauce | 0.51 | 0.511 | 0.473 | 0.785 | 0.896 |
| alphabet soup | 0.52 | 0.479 | 0.500 | 0.774 | 0.897 |
| choc. pudding | 0.58 | 0.695 | 0.778 | 0.845 | 0.898 |
Representation Learning
Representation learning develops data transformations that expose useful structure for prediction, transfer, generation, and control.
See all 798 papers