AIMech AI

Iterated conditional modes

Algorithms AIMech:IteratedConditionalModes DRAFT
Aliases: ICM
A deterministic conditional-mode optimization algorithm that repeatedly updates one variable to a mode of its conditional distribution given the current values of the remaining variables, seeking a coordinatewise mode of a fixed joint distribution.
Identity Notes & Concept Scope ICM is a label or state optimization procedure, not the hidden Markov random field it can optimize and not iterative conditional estimation of model parameters. It is a probability-based coordinate-ascent instance related to hill climbing; Gibbs sampling instead draws a conditional random value. The classical image implementation uses local Markov neighbors and site emissions, but the conditional-mode principle also applies when an observation affects several sites or when the posterior neighborhood is wider. Single-site ICM is the defining scope; joint block updates are a stated extension. The paper credits earlier work and does not establish a 1986 first-invention claim. No normalized identity match was found across all 442 pinned AIO labels and all scoped synonyms and 397 preceding native IDs, names and aliases for these three concepts. Full-checkout fixed-string searches included ignored and hidden files in worktree and main, yielding 12 and 12 matched lines; all 9 unique contents were read. Hits represent citations and discovery leads rather than records of these identities. All 161 semantic label/synonym hits were read. Forty fully annotated exact CLASS nodes and outgoing edges were inspected:24 byte-verified after prior full reading and 16 freshly read. Fifty contextual YAMLs comprise 40 generated and 10 native records:28 byte-verified after prior reading and 22 freshly read. Any truncated display was reread in smaller batches. Short acronyms were included in the complete normalized identity comparison. Absence is bounded to the pin, native collection and inspected semantic neighborhood.

Claims & Grounded Evidence

2 Claims
Mechanism #method
For fixed observed y and model parameters theta, start at a configuration x with a defined positive posterior. In a sequential sweep, replace x_i by an element of argmax_u p(x_i=u | x_(-i),y,theta), using already updated values at earlier sites. Equivalently maximize the joint posterior with all other coordinates held fixed. For an MRF prior and independent local emissions the score is b_i(y_i|u)*p_i(u|x_neighbors); shared observation factors require every factor affected by the coordinate. Each exact update cannot decrease the fixed joint objective. On a finite configuration space, requiring strict improvement for a changed value, or retaining the current value on a tie, yields finite termination at a coordinatewise mode. This need not be a global joint MAP solution. Joint updates on conditionally independent coding sets can be parallelized; simultaneously updating interacting sites from stale neighbors has no such monotonicity guarantee. A block extension maximizes over a selected block given its complement.
Limitation #local-optimality-limits
ICM can remain at an initialization-dependent local mode and does not generally quantify uncertainty or guarantee the globally optimal segmentation; the source’s illustrative parameter settings are not universal prescriptions.

⚠️ Curated Limitations & Negative Results

Artificial Intelligence Ontology (AIO) Grounding

Mapped AIO Classes
AIO Target Class Mapping Relation Mapping Rationale
AIO:ProbabilisticGraphicalModel
Probabilistic Graphical Model
related_match ICM performs conditional-mode inference in graphical probability models, including the inspected image MRF. The pinned ProbabilisticGraphicalModel class is a machine-learning task; a related mapping records this inference context without making the algorithm a model family or a subtype of the task.

Evidence Sources & Primary Literature

2 Sources
Source ID Publication / Document Type / Access Reference & Checksum
method-source
Julian Besag
primary paper
full_text
ID: doi:10.1111/j.2517-6161.1986.tb01412.x
sha256:d458396fd177…
author-reply
Julian Besag
primary paper
full_text
ID: doi:10.1111/j.2517-6161.1986.tb01413.x
sha256:d458396fd177…

Curation Provenance

Curator: Codex
Method: ai_assisted
Model: GPT-6
Created: 2026-10-11T21:41:53Z
Updated: 2026-10-11T21:43:16Z
Source File: data/curated/IteratedConditionalModes.yaml