Executive Summary

A domestic robot has to see a home and understand it before it can move through one. That is why keeping camera frames inside the robot, and never letting them out, became the standard privacy answer. But a robot does not work alone. Planners, cloud services, logging and debugging systems, and the pipelines that train the next model all receive what the robot's perception produced. Researchers at Case Western Reserve University took only the summary representations that cross that boundary and measured how much of the home can be recovered from them.

Utility metrics did not separate the designs. In a navigation experiment that exported free space three different ways, success and path quality were identical to three decimal places, while the accuracy of matching a representation back to the scene it came from differed by close to a factor of two. A result in the opposite direction came out as well. When the name of the target object was replaced by a region, the attack that recovers what the target was collapsed, while the attacks that recover which room the robot is in and whether privacy-sensitive objects are present stayed the same across all five reference schemes.

The findings come from a single preprint, posted to arXiv on September 2, 2026. Every experiment runs inside a simulator, and what the authors measured is representation-level linkability rather than re-identification of a real home. Even held to a scope that narrow, one conclusion survives. In a physical AI pipeline, deciding what to export is not a decision performance validation makes for you.

Key Figures

Source: Yuqiao Xu, Erman Ayday, Seeing Less Is Not Seeing Safely: Privacy Leakage from Task-Scoped Robot Perception Exports, arXiv:2609.03055v1 (2026-09-02)

0.532 to 0.970

Scene linkability range

The spread across three exports whose navigation utility is identical. Random guessing scores 0.050

1.000 → 0.077

Target-category macro-F1

After the target label was replaced by a target region. Task success held at 0.995

0.844 → 0.928

Private-object inference after coarsening

A channel that looked set to fall went up. The same change lowered collision F1 from 1.000 to 0.950

26 of 33

Attack combinations re-evaluated

Most existing attacks read less than the full public representation and put the risk lower than it was

1

What Leaks While the Raw Data Stays Home

Robot privacy research has long looked at the sensor end. Blur the camera, mask sensitive objects, process the RGB stream locally and discard it. What this paper aims at is the next step along. It is the moment when the maps, free-space structures, object geometry, and target references that a robot builds after perception leave the robot. The authors place a representation-export boundary at that point and propose a frame in which whatever crosses it should be assembled to carry only what the task needs. They call it Task-Functional Perception Distillation, or TFPD.

The representation-export boundary — between local perception and downstream consumers TFPD profiles whatever crosses it along three axes Representation-export boundary (TFPD) Local perception stack (trusted · includes raw sensors) · Maps · Free-space structure · Object geometry · Target references Out of the adversary's reach Planner Cloud service Logging · training pipeline What crosses the boundary is profiled on three axes Task utility Direct exposure Residual inference (5 channels)
▲ Pebblous original diagram | Source: arXiv:2609.03055v1 §III, the TFPD framework

The threat model is set conservatively. The adversary sees the entire public representation that crossed the boundary. The authors conservatively assume the adversary also knows the schema of that representation, the downstream task, and the public transformation used to construct it. Any service that legitimately consumes the export has to understand the interface, and a service that grows curious or gets breached ends up holding the same knowledge. It is also a statement that TFPD does not rely on keeping the representation format or transformation secret. On the other side of the line, the raw sensor stream and the fields that stay local are out of the adversary's reach, and the local perception stack itself is treated as trusted.

What crosses the boundary is profiled along three axes. Task utility asks whether the work still gets done with that representation. Direct exposure records what was explicitly exported. Residual inference measures what can be recovered from the remaining structure even though it was never explicitly exported. Residual inference splits into five channels: room inference, private-object inference, object-category inference that recovers semantic categories from anonymous or coarsened geometry, scene linkability that matches a representation to the corresponding scene in a gallery, and target-category inference that recovers the semantic category of an object-goal target. Keeping those five as a vector instead of collapsing them into one score is the most practical decision in the paper, and the results below explain why.

The paper is equally clear about what it is not doing. TFPD does not protect against compromise of the trusted local perception stack, and it provides no formal guarantee that exported representations reveal no private information. Measured attack performance characterizes residual leakage under the evaluated adversaries rather than an upper bound on all possible inference. It introduces no new planner and no new collision-checking algorithm, and it performs no adaptive runtime selection among candidate representations. Human-robot interaction channels such as raw audio, speaker identity, speech transcripts, and conversational history are outside the scope of the work entirely. What this article covers is one strand: the representations built by seeing and interpreting a home.

2

Success Matched to Three Decimals

The stage is the full set of 120 household scenes in AI2-THOR, split scene-disjointly into 80 training, 20 validation, and 20 held-out test scenes. The validation and test sets each contain five scenes from each of the four room families. No house appears in both training and test. Attack models are trained on the training data, selected on validation, and then frozen before they touch the test set. Navigation utility comes from 50 deterministic start-goal trials per held-out scene, which is 1,000 trials across the 20 scenes.

The navigation task compared three ways of exporting free space. Metric free space exports absolute coordinates as they are. Normalized free space normalizes those coordinates and keeps only relative geometry and connectivity. Topological free space drops coordinates and distances altogether and exports a connectivity graph of nodes and edges. Their driving records did not separate. All three reached success 1.000, path feasibility 1.000, and a mean path ratio of 0.898, with zero planning failures. Judged by the evaluated navigation criteria, these three are fully interchangeable designs.

Exposure was another matter. Top-1 scene linkability came out at 0.970 for metric free space, 0.782 for topological, and 0.532 for normalized. With 20 gallery identities, random Top-1 accuracy is 0.050, so all three sit far above chance. Among them the normalized export is 43.8 percentage points below the metric one. Normalizing the coordinates once brought it down that far, and it cost nothing in the evaluated navigation utility.

Linkability, as it is measured here, covers less ground than the word suggests. The number comes from an experiment that matches a query, derived from a controlled perturbation of the same underlying export, against a gallery. It does not match observations independently recaptured on a separate visit. The authors flag this in their limitations and write that it should not be interpreted as real-world home re-identification. So this number should not be restated as a home having been pinned down. What it measures is how easy a scene is to single out, and among designs with the same driving record that ease varied by close to a factor of two.

3

Erasing More Was Not Safer

It is easy to assume that erasing more information makes a representation safer. The topological export throws away coordinates, absolute scale, and edge distances alike. The normalized export keeps relative geometric structure. By sheer volume erased, topological erases more. Yet in the AI2-THOR experiment all three attacks ordered the same way. Normalized sits lowest, topological next, and metric highest.

Room inference macro-F1 was 0.479 for normalized, 0.558 for topological, and 0.736 for metric. Against a most-frequent-class baseline of 0.100, all three leave a substantial amount of room information behind. Private-object inference was 0.412 for normalized, 0.567 for topological, and 0.928 for metric, and normalized is the only one whose point estimate does not exceed the 0.444 baseline. The authors do not treat that ordering as settled, though. Because the attribute-inference confidence intervals overlap, they state plainly that this is an observed point-estimate ordering rather than a formal pairwise significance result.

Run the same experiment on a different scene distribution and the ordering does not hold. Repeating the protocol on a fixed set of 120 ProcTHOR-10K houses for another 1,000 held-out trials, the three representations again reached success 1.000, path feasibility 1.000, and an identical mean path ratio of 0.879. The task stays equivalent. Linkability came out at 1.000 for metric, 0.573 for normalized, and 0.497 for topological. Only the fact that metric is the most exposed carries over, and the order of normalized and topological reverses. The confidence intervals of those two reversed values overlap, and on that basis the authors decline to interpret the three-way ordering in either distribution as a universal property of representation abstraction. The replication does not install a corrected ordering. All that becomes clear is that an ordering cannot serve as a design rationale.

Whether normalized or topological leaked more depended on the scene distribution Top-1 scene linkability, 1,000 held-out trials in each distribution 120 AI2-THOR scenes metric 0.970 topological 0.782 normalized 0.532 120 ProcTHOR-10K houses metric 1.000 normalized 0.573 topological 0.497 random baseline 0.050 normalized and topological swap places metric (highest in both) normalized topological
▲ Pebblous original diagram | Source: arXiv:2609.03055v1 §V-C and the ProcTHOR replication subsection

ProcTHOR is not independent validation. It runs on the AI2-THOR execution engine, which is why the authors call it a cross-distribution replication rather than validation in an independent simulator. What does come through is that which representation is safer depends on the structure of the environment. No rule about one representation being universally better can be drawn from this experiment. That is what the paper's title says. Seeing less is not seeing safely.

The authors also audited whether their own attacks were strong enough. Across the three robot tasks the audit covers 33 representation-attack combinations, and for only 7 of them did the existing attack already consume the relevant public representation. The remaining 26 originally used a restricted subset or summary, so they were re-evaluated with broader inputs drawn from the same public export. Individual numbers moved a long way as a result. Private-object inference for metric navigation was 0.405 under the restricted mapping and rose to 0.928 once validation selected the expanded public structure.

The broader mapping did not always score higher, though. Room inference from the target label was 0.796 under the restricted mapping and fell to 0.644 under the validation-selected representation-aware mapping. Mappings are selected on validation data only, and picking the larger test score would itself constitute test-set selection. So broader attacks do not always yield bigger numbers. The thing to watch runs the other way. Take a number produced by an attack that reads less than the full public representation as the risk, and you will put that risk too low. The same applies well beyond this paper, to any team evaluating its own export design.

The paper has a third stage as well: a controlled synthetic benchmark of 20 scenes. It has no validation split, so its numbers are diagnostic test-set upper envelopes and are not mixed with the primary results. Linkability there was 0.428 for the task-minimal representation, 0.328 for the coarse-grid representation, and 0.278 for the free-space-graph condition. The graph condition is lowest, and the authors attach a warning to it directly. Because the graph attacker uses only a reduced aggregate summary rather than the complete graph, the 0.278 result should not be read as evidence that topological representations are generally more private.

Table II, the representation-aware re-evaluation discussion in §V-C and §V-E, and the controlled synthetic diagnostics in §V-F. Source: arXiv:2609.03055v1

4

The Name Was Hidden, the Room and the Objects Were Not

The object-goal task has a different structure. Inside the protected local boundary the robot first settles what the target is, and what leaves is only a reference pointing at that already-settled target. How to write the reference is the design choice. Five reference schemes went into the comparison: the target label as it is, a target coordinate, a target region, an anonymous target ID, and a planning-graph node.

All five reached the same task success of 0.995. Target-category inference did not stay together. The table below holds both the split and the two channels that never split.

Target reference Task success Target-category inference Room inference Private-object inference
Target label 0.995 1.000 0.644 0.913
Target coordinate 0.995 0.094 0.644 0.913
Target region 0.995 0.077 0.644 0.913
Anonymous target ID 0.995 0.094 0.644 0.913
Planning-graph node 0.995 0.053 0.644 0.913
Most-frequent-class baseline 0.00482 0.100 0.444

All inference figures are held-out macro-F1 point estimates. Room and private-object inference use 400 held-out episodes; target-category inference uses the 328 episodes eligible under the 52 frozen target classes. In the room and private-object columns the five schemes share the same point estimate and differ only slightly in their confidence intervals. Source: arXiv:2609.03055v1 §V-E.

Read only the three left-hand columns and it looks like a clean win. Replacing the target's name with a region alone dropped target-category inference from 1.000 to 0.077, and the robot's record for reaching its target stayed at 0.995. The planning-graph node goes lower still, at 0.053. Since the baseline is 0.00482, though, neither of them fell all the way to nothing. The authors write that the transformed references do not eliminate residual target-semantic inference under the evaluated attacks.

The two right-hand columns are the real lesson of this experiment. Room inference is 0.644 for all five schemes, and private-object inference is 0.913 for all five. However the target reference was rewritten, these two channels did not budge. What the target was is now hidden, but which room the home is in and whether it holds privacy-sensitive objects still read out. The design decision from section 1, keeping residual risk as a vector instead of one score, earns its keep right here. Averaged into a single number, this table would have looked like an improvement.

These findings reach as far as the evaluated object-goal criterion and no further. The authors are explicit that they do not imply the five target references are interchangeable for subsequent manipulation or grasping tasks. Picking an object up calls for additional pose, orientation, or grasp-relevant geometry, and once that information rides along, the exposure calculation starts over.

5

Coarsening Pushed Another Channel Up

The third task, collision checking, went in yet another direction. Inside the local boundary the structural elements are filtered out, namely Floor, Wall, Ceiling, Window, and LightSwitch, and the remaining obstacles are exported as nothing but the centers and sizes of axis-aligned bounding boxes. Semantic labels, object identities, and orientation are not exported. Even so, that anonymous exact geometry alone yielded an object-category inference macro-F1 of 0.704. The evaluation runs over 848 held-out object records, with 92 categories frozen as eligible before test evaluation and 90 of them occurring in the held-out labels. The most-frequent-class baseline is 0.00160. Strip the name tag and the size and position of a box still say a good deal about what it is.

So the authors tried blurring the geometry. Coarsening rounds every component of the centers and sizes to one decimal place. Object-category inference fell to 0.556. That much was expected. The cost and the side effect arrived together. Collision-checking F1 dropped from 1.000 to 0.950, room inference stayed at 1.000 both before and after, and private-object inference rose from 0.844 to 0.928. On those three results the authors state that they do not interpret coarsening as a general privacy improvement.

After rounding the geometry — four channels moved in different directions Collision-checking experiment, coarsened to one decimal place (§V-D) Channel Before After Note Object-category inference 0.704 0.556 intended drop Collision-checking F1 1.000 0.950 cost incurred Room inference 1.000 1.000 unchanged Private-object inference 0.844 0.928 rose instead — paradox
▲ Pebblous original diagram | Source: arXiv:2609.03055v1 §V-D

Line the three tasks up and the same shape repeats. Utility metrics fail to separate the design choices, and privacy metrics move in different directions channel by channel. Fixing one channel does not lift the whole, and a more abstract representation is not reliably safer. Which representation is safe therefore cannot be settled by a rule fixed in advance, and the paper concludes that there is no alternative to measuring multiple risks separately for each task.

Read by someone who designs physical AI data pipelines, three questions are left over. The three below are not in the paper. They are what comes up when you move what the paper measured onto a pipeline of your own.

  • Is there a written list of the fields our robot exports to planners, to the cloud, and to logs? When that list was decided, was the rationale performance, or was exposure measured separately and then decided?
  • If exposure is measured, how many channels does it cover? Collapse them into one score and an improved channel hides an unchanged one, exactly as the target region case in this paper did.
  • Does the attack model we use actually read the full representation that gets published? For 26 of 33 combinations it did not, and that single difference separated 0.405 from 0.928.

Editor's Note

A question Pebblous runs into often while diagnosing data quality is which fields belong in a schema. This paper shows, from the robotics side, that such a decision fixes the scope of exposure while leaving no trace in the utility metrics. The adjacent question of where raw data should live came up in our piece on Korea's privacy regulator moving toward risk-based treatment of raw personal data in AI training. Deciding what to keep and deciding what to export part ways at the same point.

R

References