When almost right is the wrong answer

An AI-generated picture can survive a slightly imperfect detail. A motion plan that crosses an obstacle cannot be judged so casually. MIT's September 14 report on HardFlow brings that difference into focus: researchers are developing a way to make generated outputs obey explicit requirements while retaining useful quality.

The method comes from Zeyang Li, Kaveh Alim and Navid Azizan. This is newly highlighted research, not a project invented yesterday: the public preprint was first submitted in November 2025 and revised in April 2026. The authors' repository identifies the work with IEEE Transactions on Pattern Analysis and Machine Intelligence.

The important question is more specific than whether AI is becoming smarter. Can a system produce something useful inside the boundaries of an actual task? Our reading is that this moves attention from impressive-looking answers toward acceptable answers—a distinction that matters wherever a mistake has consequences.

Sources: MIT: HardFlow and safety-critical situations, September 14; Li, Alim and Azizan: HardFlow research paper and revision history; MIT Azizan Lab: HardFlow experiments and code

Separate the rule from the preference

HardFlow operates during sampling with a pretrained flow-matching model, without changing its learned parameters. The paper frames generation as a control problem: steer the sampling process so the final generated sample satisfies the constraints. A tractable approximation makes that optimisation manageable.

Here is an illustrative way to understand the distinction. Imagine drawing a delivery route on a whiteboard. You might prefer a shorter route, but a closed road is not merely an inconvenience to trade against distance. It is a boundary the proposed route must respect. A good solution needs both a usable destination and an acceptable way to get there.

The authors distinguish intermediate computational steps from the finished sample. Those steps need not individually resemble valid final answers. This does not mean a physical robot may collide with something while it is planning: the internal generation process and the motion eventually executed are different things. If the generated object is a whole route, the constraints apply to that route, not just its last location.

Sources: Li, Alim and Azizan: HardFlow research paper and revision history

Try an independent constraint check

The following software example makes one idea inspectable: a route needs a validity check before its length becomes useful. These fixed inputs are our own synthetic geometry, not samples from the authors’ model.

Our local illustration: check the entire route

Synthetic geometry; software illustration only. No MIT algorithm/model, flow-matching model, robot or benchmark was run.

Map: [0, 10] × [0, 10]; start (1, 5), goal (9, 5). Obstacle: [4, 6] × [4, 6]. Boundaries count as blocked. Each proposal is a sequence of straight segments; length is a secondary preference.

1. Shortest proposal

The straight proposal is 8 units long, but crosses the closed obstacle. A short route is not automatically an acceptable route.

1. Shortest proposal: Rejected candidateSynthetic map from 0 to 10 on both axes. Start at (1, 5), goal at (9, 5). A closed obstacle spans x 4 to 6 and y 4 to 6. (1, 5) → (9, 5)00224466881010xyStartGoalClosed obstacle
Original Lumacta diagram. Dashed segments fail the obstacle check; solid segments pass. Circles mark waypoints. The shaded rectangle includes its boundary.
Independent geometric checks
CheckResultRule
Finite input; at least two waypointsPass2 waypoints; coordinates must be finite numbers.
Exact start and goalPassStart (1, 5); goal (9, 5).
Entire route inside mapPassAll waypoints must lie inside the bounds. Straight segments between them stay inside the rectangular map.
Waypoints clear of closed obstaclesPassObstacle interiors and boundaries both reject a point.
Every connecting segment clearFail1 whole segment checked, including boundary contact and repeated points.
Finite measured lengthPassLength is a secondary measurement; it never cancels a failed constraint.

Rejection evidence: Segment 1 touches or crosses obstacle box.

Route length: 8.000 units. Length is recorded even for rejected routes; it cannot make them acceptable.

(1, 5) → (9, 5)

All five computed outcomes are available below. Interactive scenario controls become available when JavaScript loads.

Computed results for the fixed synthetic cases
CaseOutcomeLength (units)Waypoint checkWhole segment / graph evidence
1. Shortest proposalRejected candidate8.000All clear1 failing / 1 checked
2. Accepted detourAccepted candidate8.831All clear0 failing / 3 checked
3. Waypoint trapRejected candidate11.314All clear1 failing / 3 checked
4. Finite grid searchAccepted candidate12.000All clear0 failing / 12 checked
5. Blocked gridNo path on this gridNo routeNo route44 reachable vertices exhausted

The blocked-grid case uses a different obstacle: [4, 6] × [0, 10]. Search results concern the explicit finite graph. The validator has no sensing, clearance, robot dynamics or model of the real world.

Inspect the fixed inputs and computed results (JSON)

What the experiments actually establish

MIT reports successful constraint enforcement in the experiments it describes, including robotic tasks and image editing. That result concerns the tested conditions. It is not an accident-rate measurement from robots operating across factories, homes or public streets.

The authors provide separate repository branches for manipulation, maze navigation, control of a mathematical system and text-guided image editing. In the manipulation setup, the generated plan must reach a target while avoiding obstacles. The repository makes the intended experiments inspectable; Lumacta has not rerun them.

That openness has practical value. A reader can distinguish an algorithm with a described experimental procedure from a product demonstration with no visible method. But available code and independent reproduction are different milestones. The next useful evidence would show what happens when other teams choose harder environments or less convenient inputs.

Sources: MIT: HardFlow and safety-critical situations, September 14; MIT Azizan Lab: HardFlow experiments and code

A correct plan can still describe the wrong world

The paper acknowledges extra inference-time computation and identifies more demanding settings, including vision-based and contact-rich manipulation, as future work. These are important boundaries: a model handling a defined planning problem is not automatically a complete perception-and-control system.

Consider a second illustrative scenario. A planner receives a map showing an empty corridor, but a person has just stepped into it. Satisfying every rule encoded against the old map would not establish that the corridor is still clear. The problem is not necessarily that the optimiser ignored a constraint; the information used to define that constraint may be incomplete.

NIST's voluntary AI Risk Management Framework addresses trustworthiness across design, development, use and evaluation. It is useful background here, not an endorsement of HardFlow. Our interpretation is that the entire system needs scrutiny: sensing, planning, execution, monitoring and the response when no acceptable solution is found.

Sources: Li, Alim and Azizan: HardFlow research paper and revision history; NIST: AI Risk Management Framework

Scientific perspective: test the boundaries, not only the average

Lumacta's evidence-based assessment—not an independent peer review or reproduced experiment—is that a strong evaluation should separate feasibility, usefulness and operational reliability. An output can satisfy a mathematical condition yet be unhelpful. It can be useful in a benchmark yet arrive too late for the surrounding task. These questions deserve separate measurements.

We would therefore want comparisons that keep the underlying model, computing resources and task definitions consistent. Testing should include conflicting requirements, tight deadlines and situations where the requested solution does not exist. A method should not receive credit for handling an impossible task merely because it returns something that looks plausible. These are our proposed evaluation criteria, not additional results reported by the researchers.

The same care applies to impressive success rates. A result should travel with its test conditions and a clear description of what counts as failure. For practical use, the difficult cases may matter more than the typical one: an operator needs to understand when the system can proceed, when it should request help and when it must stop.

Sources: Li, Alim and Azizan: HardFlow research paper and revision history; NIST: AI Risk Management Framework

The bigger opportunity is controllable automation

Our editorial conclusion is that HardFlow points toward a valuable direction: combining the flexibility of learned models with requirements that can be checked. That is a different proposition from asking users to trust a system because its answers usually seem reasonable.

For businesses, the potential benefit would be a more dependable path from a generated proposal to an approved action. The economic test would include integration, checking, computing time and exception handling—not just the speed of producing a first draft. Any claimed savings should be measured after those costs, rather than assumed from a successful demonstration.

For the public, progress could mean systems whose limits are easier to explain and examine. The responsibility to define those limits does not disappear into the model. A useful next generation of automation will need both creative capability and clear rules about what it is allowed to do. HardFlow is research toward that combination, not evidence that the wider safety problem is finished.

Sources: MIT: HardFlow and safety-critical situations, September 14; NIST: AI Risk Management Framework

Sources & Methods

Original source review: September 15, 2026. October 1 addition: an original Lumacta route-validator illustration with synthetic geometry, executed software checks and downloadable inputs/results. We did not run HardFlow, a flow-matching model, MIT code or a robot. The authors’ experiments remain source-reported research, not our measurements. Our point-route validator models neither robot footprint nor dynamics, sensing error, timing or physical safety.

  1. MIT: HardFlow and safety-critical situations, September 14 — University research report
  2. Li, Alim and Azizan: HardFlow research paper and revision history — Original research
  3. MIT Azizan Lab: HardFlow experiments and code — Authors' experiment documentation
  4. NIST: AI Risk Management Framework — Independent methodological background