Free-Grain Learning in Materials & Imaging

• Free-Grain Learning is a framework that replaces expensive grain-related operations with learned surrogates, enabling efficient prediction of properties like grain-boundary energy and mobility.
• It leverages invariant representations and property-aligned aggregation to model static and dynamic behaviors in materials, streamlining tasks from atomistic simulations to video film grain processing.
• Its applications span from predicting microstructure evolution in metals to optimizing film grain removal in video coding and managing mixed-granularity labels in hierarchical recognition.

Free-Grain Learning denotes a family of learning paradigms in which a costly or rigid grain-related operation is replaced by a learned surrogate, a structure-based representation, or a heterogeneous-supervision scheme. In materials science, the term is used for predicting grain-boundary structure, energy, mobility, shear coupling, and grain-growth evolution directly from geometry, local atomic environments, or spatiotemporal microstructure data rather than by exhaustive atomistic relaxation or repeated PDE-style updates (Kiyohara et al., 2015, Rosenbrock et al., 2018, Ye et al., 2022, Yan et al., 2022, Owens et al., 2024, Tep et al., 8 May 2025). In video coding, it refers to removing film grain before encoding and synthesizing controllable grain after decoding (Ameur et al., 2022). In hierarchical recognition and human-free active learning, related usages treat “grain” as semantic granularity, so that supervision may vary from coarse to fine and be refined iteratively without full fine-grained labels or human annotation (Park et al., 16 Oct 2025, Xiao et al., 2023).

1. Emergence and semantic range

An early, explicit formulation appeared in grain-boundary structure prediction for face-centered cubic copper. There, Free-Grain Learning meant learning a surrogate mapping from descriptors of the initial, unrelaxed geometry to grain-boundary energy, then using that surrogate to select a single candidate rigid-body translation for one final validation relaxation. The training data comprised four [001]-axis symmetric-tilt coincidence site lattice grain boundaries, and the trained support vector regression model was used to predict twelve additional boundaries, reducing the usual exhaustive exploration of approximately $10^6$ configurations to one relaxation per boundary (Kiyohara et al., 2015).

A second, structurally richer formulation emerged in work on nickel grain boundaries. That framework treated local atomic environments as the primitive objects of learning and introduced two SOAP-based representations: the Averaged Structural Representation (ASR), which averages per-atom power-spectrum descriptors into one fixed-length vector per boundary, and the Local Environment Representation (LER), which represents each grain boundary by the fractions of globally unique local atomic environments it contains. That formulation was used for grain-boundary energy regression and for supervised classification of mobility and shear coupling (Rosenbrock et al., 2018).

Subsequent work broadened the term in at least three directions. One direction sought universal, cross-element grain-boundary energetics by normalizing $\gamma_{GB}$ by the cohesive energy and learning from four geometric or structural descriptors only (Ye et al., 2022). Another recast grain growth itself as a learnable dynamical system, either by site-wise action prediction with physics regularization or by latent-space spatiotemporal surrogates (Yan et al., 2022, Tep et al., 8 May 2025). A third extended the phrase beyond materials, where “grain” may denote film grain in video or semantic granularity in hierarchical recognition (Ameur et al., 2022, Park et al., 16 Oct 2025).

The literature therefore does not present a single canonical definition. Instead, it uses the term for approaches that aim to make a grain-related inference task “free” of an otherwise expensive component: exhaustive relaxation, explicit time integration, dense fine-grained labeling, or human annotation. This suggests a unifying operational theme rather than a single algorithm.

2. Structure-driven learning of grain-boundary properties

In atomistic grain-boundary prediction, Free-Grain Learning is most tightly associated with feature engineering that respects symmetry and converts variable-size interfacial structures into fixed-length representations. In the SOAP-based nickel framework, the local neighbor density is expanded as

$$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$

and the rotationally invariant power spectrum

$p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$

is used as the per-environment descriptor. ASR then forms

$\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$

whereas LER discovers globally unique local atomic environments using a similarity threshold $\epsilon$, assigns each atom to the most similar unique environment, and normalizes counts to fractions (Rosenbrock et al., 2018).

That representation choice strongly affects the learned task. For grain-boundary energy in the Olmsted nickel dataset, ASR with support vector regression used externally averaged, unnormalized SOAP vectors and achieved an RMS error of approximately $0.07$, while the standard deviation in $E_{GB}$ was approximately $0.37$. For mobility classification, the interpretable LER representation, combined with borderline-SMOTE and XGBoost, reached approximately $85.5\%$ validation accuracy when the severely underrepresented “Constant” class was omitted. For shear coupling, however, static local environments were insufficient: an LER-based linear SVM with $\gamma_{GB}$0 regularization achieved approximately $\gamma_{GB}$1 accuracy, and the study explicitly concluded that shear coupling may require additional information beyond static local environments (Rosenbrock et al., 2018).

The earlier copper study used a more compact descriptor philosophy. Instead of encoding full local environments, it used $\gamma_{GB}$2 geometric quantities computed from the initial, unrelaxed configuration, then augmented them by squares, inverses, exponentials, and exponential inverses to obtain $\gamma_{GB}$3 standardized descriptors. Support vector regression with Gaussian/RBF kernel, $\gamma_{GB}$4, $\gamma_{GB}$5, and kernel variance $\gamma_{GB}$6 was trained on $\gamma_{GB}$7 configurations from four grain boundaries. For the held-out $\gamma_{GB}$8 boundary, the model predicted a pre-relaxation energy of $\gamma_{GB}$9; one targeted relaxation then produced $$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$0, matching the previously reported or experimental value, with the predicted and relaxed structures both exhibiting periodic arrays of a 6-membered structural unit (Kiyohara et al., 2015).

A more universal formulation replaced boundary-specific descriptors with a scaled target and four interpretable features. For a periodic bicrystal with two equivalent interfaces,

$$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$1

A gradient boosting regressor operating on a polynomially expanded feature space used $$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$2, $$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$3, the average nearest-neighbor bond length $$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$4, and the average bond-length change $$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$5 to predict normalized grain-boundary energies across $$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$6 elements. On a held-out low-$$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$7 test set, the mean absolute error in $$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$8 was approximately $$\rho_i(\vec r)=\sum_j \exp\!\left(-(\vec r_{ij}-\vec r)^2/(2\sigma_{\mathrm{atom}}^2)\right) f_{\mathrm{cut}}(|\vec r_{ij}|),$$9; on $p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$0 previously unseen high-$p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$1 boundaries in Ta, Pd, Cu, Pt, and Li, the model achieved approximately $p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$2, showing extrapolation without loss in accuracy along the $p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$3 axis (Ye et al., 2022).

A complementary line of work formalized these ideas as a general describe–transform–learn pipeline for variable-sized atom clusters. On $p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$4 aluminum grain boundaries, filtered to $p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$5 structures, per-atom descriptors such as SOAP, ACE, ACSF, strain functionals, CSP, and CNA were transformed to fixed-length vectors by mean pooling, KMeans, CUR, Largest Simplex, Gaussian KDE, or graph2vec. The best pipeline was SOAP plus Average plus Linear Regression, with $p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$6 and $p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$7. A major physical conclusion was that for additive targets such as grain-boundary energy, permutation-invariant mean pooling outperformed more elaborate transforms, while strain functionals provided a particularly compact and interpretable basis for linking energy to density moments, shear, and strain gradients (Owens et al., 2024).

3. Grain growth and microstructure evolution

In grain-growth modeling, Free-Grain Learning shifts from static structure–property regression to learning evolution rules. The PRIMME model learns the local action likelihood that a lattice site will adopt the grain identity of one of its neighbors. For each site $p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$8, it constructs a dissimilar-neighbor image

$p_{i,x}=\sum_{m=-l}^{l} c_{i,nlm}^* c_{i,n'lm}$9

extracts a $\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$0 observation patch, and maps it through a fully connected neural network with hidden-layer sizes $\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$1, $\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$2, and $\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$3, batch normalization before activations, and $\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$4 dropout, to a $\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$5 action-likelihood map. The selected action is the $\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$6 over neighboring grain identities, and all sites act simultaneously (Yan et al., 2022).

PRIMME is trained on Monte Carlo Potts simulations generated in SPPARKS on $\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$7 domains initialized with $\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$8 Voronoi grains. The Potts Hamiltonian is

$\bar p = \frac{1}{N}\sum_{i=1}^{N} p_i,$9

with $\epsilon$0, and the simulations use computational temperature $\epsilon$1. The loss blends supervised future-step labels with a physics regularizer over $\epsilon$2 future steps and $\epsilon$3, encouraging actions that reduce local mismatch counts. This places PRIMME between purely data-driven learning and strictly PDE-constrained methods: it does not impose a governing equation, but it biases the model toward energy-reducing, curvature-driven behavior (Yan et al., 2022).

The resulting dynamics agree with classical grain-growth benchmarks. In a circular-grain shrinkage test, PRIMME, Monte Carlo Potts, and phase-field simulations all reproduced the linear area-decay law $\epsilon$4. In a $\epsilon$5 periodic domain containing $\epsilon$6 perfect hexagons, PRIMME predicted no evolution over $\epsilon$7 steps, consistent with the von Neumann–Mullins result $\epsilon$8 for $\epsilon$9. In a $0.07$0 domain with $0.07$1 initial grains, PRIMME ran $0.07$2 steps in $0.07$3 on two Nvidia Quadro RTX 8000 GPUs, compared with $0.07$4 for Monte Carlo Potts on four AMD EPYC 7702 64-core CPUs and $0.07$5 for phase-field on forty AMD EPYC 75F3 32-core CPUs (Yan et al., 2022).

A later latent-dynamics formulation replaced site-wise action prediction with an Autoencoder plus ConvLSTM surrogate trained on front-tracking simulations from ToRealMotion. The dataset contained $0.07$6 sequences of isotropic grain growth in square $0.07$7 domains with side length $0.07$8, initial equivalent circle radius distribution $0.07$9 with $E_{GB}$0 and $E_{GB}$1, annealing temperature $E_{GB}$2, reduced mobility $E_{GB}$3, and duration $E_{GB}$4 minutes. A composite loss

$E_{GB}$5

used epoch-adaptive weights to balance pixelwise accuracy, structural similarity, and boundary preservation (Tep et al., 8 May 2025).

The best model, S-30-30, consumed $E_{GB}$6 minutes of input and predicted the next $E_{GB}$7 minutes in one iteration. At $E_{GB}$8 hour it achieved $E_{GB}$9, $0.37$0, boundary-focused $0.37$1, $0.37$2, mean grain size error $0.37$3, KL divergence $0.37$4, and Wasserstein distance $0.37$5. Inference took approximately $0.37$6 on an NVIDIA A100 GPU, compared with approximately $0.37$7 for the reference ToRealMotion simulation, yielding speed-ups reported up to $0.37$8 (Tep et al., 8 May 2025).

Together, these two lines illustrate two distinct but compatible interpretations of Free-Grain Learning in microstructure evolution. PRIMME learns local update rules with minimal physics-based regularization; the latent surrogate learns a temporal operator that advances the microstructure in latent space. Both approaches retain curvature-flow-consistent macrostatistics while bypassing the repeated explicit updates of the reference simulator.

4. Grain in imaging, segmentation, and video coding

In video coding, Free-Grain Learning refers to a two-stage workflow: film grain is removed before encoding and synthesized after decoding. The removal network is a U-Net encoder–decoder with long skip connections and residual blocks, trained either in blind form,

$0.37$9

or non-blind form,

$85.5\%$0

where $85.5\%$1 is a single-channel level map filled with one of the grain levels $85.5\%$2. Training uses a mixed loss

$85.5\%$3

with Adam, learning rate $85.5\%$4, batch size $85.5\%$5, and paired $85.5\%$6 patches generated from large image corpora by Newson et al.’s stochastic film-grain renderer (Ameur et al., 2022).

On CBSD68, Kodak24, McMaster, and Set12 at grain intensity $85.5\%$7, the proposed non-blind remover achieved $85.5\%$8, $85.5\%$9, $\gamma_{GB}$00, and $\gamma_{GB}$01 in PSNR/SSIM, while the blind version achieved $\gamma_{GB}$02, $\gamma_{GB}$03, $\gamma_{GB}$04, and $\gamma_{GB}$05. The synthesis stage used a cGAN with a U-Net-plus-residual-block generator and a PatchGAN discriminator with $\gamma_{GB}$06 receptive field. Realism was evaluated by JSD-NSS on MSCN coefficient distributions. Mean JSD-NSS on Kodak24 ranged from $\gamma_{GB}$07 to $\gamma_{GB}$08 across grain levels, and the smallest values occurred on the diagonal of the cross-level comparison tables, demonstrating controllable intensity through the conditioning map $\gamma_{GB}$09 (Ameur et al., 2022).

In metallographic image analysis, a different imaging problem arises: segmentation of grain boundaries in real micrographs. A U-Net trained on real 316L stainless-steel micrographs and synthetic Voronoi-based images with simulated pores, scratches, grayscale variation, erosion or dilation, and Gaussian or median blur was used to recover grain boundaries for subsequent grain-size measurement. The paper reports that a total of $\gamma_{GB}$10 images were collected and manually segmented, that over $\gamma_{GB}$11 images were manually segmented, and that the quantitative analysis used a set of $\gamma_{GB}$12 images of size $\gamma_{GB}$13 pixels. Training used an $\gamma_{GB}$14 train/test split with a $\gamma_{GB}$15 validation split within training, binary cross-entropy loss, Adam, batch size $\gamma_{GB}$16, and $\gamma_{GB}$17 epochs (Warren et al., 2023).

The main quantitative conclusion was that mixed real-plus-synthetic training substantially outperformed traditional baselines. Manual thresholding, gradient/Canny, and HED obtained Dice scores of $\gamma_{GB}$18, $\gamma_{GB}$19, and $\gamma_{GB}$20, respectively, against manual ground truth. By contrast, the U-Net models achieved Dice scores around $\gamma_{GB}$21 across mixed-composition training sets, and the fully synthetic model still achieved approximately $\gamma_{GB}$22. The study also tied segmentation quality to materials metrology: because planimetric and line-intercept statistics were computed downstream, segmentation errors propagated directly to grain-count inflation, area bias, and circularity distortion (Warren et al., 2023).

These imaging formulations are technically distinct from atomistic grain-boundary learning, but they preserve the same operational logic. A hard-to-code or bitrate-expensive grain phenomenon is first represented in a learnable form, then removed, segmented, or reconstructed by a model trained on paired data.

5. Mixed-granularity, human-free, and gradient-free formulations

The collected usage also extends the term from physical grains to semantic granularity. In hierarchical image classification, free-grain learning is defined as the setting in which each training image may be labeled at a different semantic level—basic, subordinate, or fine-grained—subject to the constraints that the coarsest label is always present and that a finer label implies the availability of all coarser ancestors. Supervision is imposed only where labels exist,

$\gamma_{GB}$23

The ImageNet-F benchmark curates ImageNet into a $\gamma_{GB}$24-$\gamma_{GB}$25-$\gamma_{GB}$26 hierarchy with $\gamma_{GB}$27 training images and $\gamma_{GB}$28 test images; after CLIP-based pruning, $\gamma_{GB}$29 of images retain all three levels, $\gamma_{GB}$30 retain basic plus subordinate, and $\gamma_{GB}$31 retain only the basic label (Park et al., 16 Oct 2025).

Two principal methods were proposed for that setting. Text-Attr uses image-conditioned descriptions from Llama-3.2-11B, CLIP text embeddings, and contrastive alignment to inject pseudo-attributes into visual features, with $\gamma_{GB}$32 working well. Taxon-SSL treats missing fine labels as unlabeled, then applies pseudo-labeling, confidence-threshold schedules derived from memory banks, and a taxonomy-aligned contrastive loss. On ImageNet-F, Text-Attr with H-CAST achieved $\gamma_{GB}$33, fine accuracy $\gamma_{GB}$34, subordinate accuracy $\gamma_{GB}$35, basic accuracy $\gamma_{GB}$36, and $\gamma_{GB}$37, improving over the H-CAST baseline with $\gamma_{GB}$38 and $\gamma_{GB}$39. On iNat21-mini, however, Taxon-SSL achieved the best $\gamma_{GB}$40 and $\gamma_{GB}$41, indicating that the more effective mechanism depends on domain-specific textual diversity (Park et al., 16 Oct 2025).

A related but distinct coarse-to-fine use appears in human-free active learning. FreeAL treats an LLM as an active annotator that supplies coarse pseudo-labels and an SLM as a student that filters clean, representative samples and feeds them back as in-context exemplars. The SLM uses per-sample cross-entropy losses, a two-component GMM with threshold $\gamma_{GB}$42, class-wise top-$\gamma_{GB}$43 small-loss filtering with $\gamma_{GB}$44, k-medoids in embedding space, paraphrase consistency via back-translation, and optional mixup with $\gamma_{GB}$45. The resulting collaborative loop produced test-set gains over zero-shot baselines for both GPT-3.5 and RoBERTa across eight datasets, including $\gamma_{GB}$46 on SST-2 and $\gamma_{GB}$47 on SUBJ for the LLM, and $\gamma_{GB}$48 on SST-2 and $\gamma_{GB}$49 on SUBJ for the SLM, all without human supervision (Xiao et al., 2023).

An even more abstract usage equates Free-Grain learning with gradient-free learning based on kernel and range-space manipulations. In that formulation, least-squares solutions

$\gamma_{GB}$50

are extended to multilayer neural networks with invertible activations by applying layerwise inverse mappings and solving the resulting linear systems with pseudoinverses or Tikhonov regularization. The method is single-pass and closed-form once hidden states or later weights are fixed. On $\gamma_{GB}$51 UCI datasets, two-layer networks trained by this kernel-and-range approach achieved average accuracy of approximately $\gamma_{GB}$52 over $\gamma_{GB}$53 datasets, compared with approximately $\gamma_{GB}$54 for Matlab’s feedforwardnet under the reported setup, and the method was reported to be approximately $\gamma_{GB}$55–$\gamma_{GB}$56 faster on average (Toh et al., 2018).

These formulations no longer concern physical grains. They retain the coarse-to-fine or “free of manual effort” semantics of the term, and they show that the phrase has become portable across domains wherever learning replaces an expensive refinement or annotation step.

6. Recurring design principles, limitations, and open questions

Across its materials formulations, Free-Grain Learning repeatedly relies on invariant representation. SOAP, ACE, ACSF, strain functionals, graph-based descriptors, and neighbor-count features all attempt to encode local structure in a way that is invariant to translation, rotation, and permutation of identical atoms, while being smooth enough to tolerate small structural perturbations (Rosenbrock et al., 2018, Owens et al., 2024). In grain growth, the corresponding invariance is local and topological rather than atomistic: PRIMME uses dissimilar-neighbor counts as a curvature or interfacial-energy proxy, whereas the ConvLSTM surrogate compresses evolving boundary topology into a latent representation (Yan et al., 2022, Tep et al., 8 May 2025).

A second recurring principle is property-aligned aggregation. Mean pooling dominates for additive grain-boundary energies in aluminum, external averaging of unnormalized SOAP vectors outperforms internal averaging for nickel energy regression, and cohesive-energy normalization removes dominant chemistry-specific scaling so that geometric features suffice for universal elemental grain-boundary energetics (Rosenbrock et al., 2018, Ye et al., 2022, Owens et al., 2024). This suggests that successful Free-Grain Learning often depends less on model complexity than on matching the representation and aggregation rule to the physics of the target.

A third principle is selective relaxation of hard supervision. ImageNet-F explicitly embraces heterogeneous label granularity rather than forcing all examples to the fine-grained leaf level, and FreeAL begins with coarse, noisy labels and sharpens them through iterative filtering and refinement (Park et al., 16 Oct 2025, Xiao et al., 2023). In video coding, non-blind film-grain removal succeeds when the specified grain level matches the true level, but over-filtering or under-filtering occurs when that level is mis-specified; the blind variant is more robust but may show slight color shift (Ameur et al., 2022). In grain segmentation, synthetic data drastically reduce manual labeling demand, but synthetic-only training can leave thin “necks” unbroken and under-predict grain count by about $\gamma_{GB}$57 (Warren et al., 2023).

The limitations are equally recurrent. Static local environments are sufficient for grain-boundary energy and often for mobility, but not for shear coupling, which likely requires dynamic or stress-state information (Rosenbrock et al., 2018). Universal elemental grain-boundary energy models remain limited to clean elemental interfaces at $\gamma_{GB}$58, and larger errors appear for some magnetic transition metals and some $\gamma_{GB}$59-electron systems (Ye et al., 2022). PRIMME can become non-physical with $\gamma_{GB}$60 and can stall when $\gamma_{GB}$61 is too large; latent ConvLSTM rollouts accumulate more error when the temporal input window is short (Yan et al., 2022, Tep et al., 8 May 2025). Hierarchical free-grain recognition remains sensitive to taxonomy design, CLIP-based ambiguity proxies, and the domain dependence of pseudo-attributes (Park et al., 16 Oct 2025).

The literature therefore supports a restrained interpretation. Free-Grain Learning is best understood not as a single algorithmic doctrine but as a recurring design stance: use a representation that preserves the relevant invariances, replace the expensive step with a learned surrogate or mixed-granularity supervision mechanism, and validate that the resulting model preserves the physically or semantically important observables. In materials science those observables are grain-boundary energies, mobilities, topologies, and growth laws; in imaging and recognition they are contour fidelity, controllable grain statistics, path consistency, and accuracy under incomplete supervision (Kiyohara et al., 2015, Ameur et al., 2022, Park et al., 16 Oct 2025).