Searcharxiv⌕ Search

arXiv subjects

Igor Strozzi

Publications and source records attributed to Igor Strozzi.

3 recordsLinked to original sources

Generalized particle systems: a locality-factorized metamodel for self-propelled particles and agent-based models

We propose a single formal object, the generalized particle system (GPS), under which self-propelled particle systems (SPPS) and agent-based models (ABMs) are instances of one construction. A GPS is a typed finite population, a per-particle state space with arbitrary internal structure, a global environment, a neighbourhood map that may depend on the configuration, and type-indexed local rules; these assemble into a generator whose iteration is a monoid action, i.e. an autonomous dynamical system. Update schedules and stochastic rules are added at the same generality, so sequential and noisy models (the original Primordial Particle System, Vicsek) are covered, not approximated. The construction isolates the one ingredient separating the two communities: in the classical ABM reading the dependency graph is fixed; in an SPPS it is a function of the state. Under an exchangeability axiom (rules see neighbours only through the multiset of their types and states) the generator is equivariant for type-preserving permutations and descends to a dynamical system on counting measures, the setting of kinetic limits of swarming models. We read the tuple as a metamodel: its structural components coordinatize a space of models inside which numerical parameters live. Six pre-registered experiments on one engine implementing the generator test the claims: freezing the neighbourhood map destroys alignment ($φ= 0.91 \to 0.04$) while yielding a different, non-aligned aggregation; the realized neighbourhood graph rewires up to 64% of its edges per step, its rewiring rate anti-correlated with order ($-0.99$); a topological instead of metric neighbourhood reshapes a flocking phase diagram; the same rule with cohesion and separation off shows a Vicsek-type transition whose susceptibility peak grows with system size. One prediction failed and one subsumption claim is unconfirmed; both are reported.

math.DS↗

Procedural-skill SFT across capacity tiers: A W-Shaped pre-SFT Trajectory and Regime-Asymmetric Mechanism on 0.8B-4B Qwen3.5 Models

We measure procedural-skill SFT contribution across three Qwen3.5 dense scales (0.8B, 2B, 4B) on a 200-task / 40-skill holdout, with Claude Haiku 4.5 as a frontier reference. The corpus is 353 rows of (task + procedural-skill block, Opus chain-of-thought, judge-pass) demonstrations. Main finding. Under matched-path LLM-only scoring, the SFT-attributable procedural-$Δ$ lift is roughly uniform across sizes: $+0.070 / +0.040 / +0.075$ at 0.8B / 2B / 4B. Variation in post-SFT $Δ$ ($-0.005$, $+0.100$, $+0.065$) is dominated by a W-shaped pre-SFT base trajectory ($-0.075$, $+0.060$, $-0.010$, Haiku-4-5 at $+0.030$): the 5-step procedure hurts 0.8B and 4B, helps 2B, and helps frontier Haiku modestly. SFT works hardest in absolute terms where the base struggles with the procedure -- a regime-asymmetric pattern with a falsifiable prediction at 8B/14B. Methodology. (i) A bench format-compliance artifact: 83.5% of the holdout uses a deterministic ANSWER-line extractor that under-counts free-form-prose conclusions; our LLM-only re-judge reveals it was systematically biased against the curated condition. (ii) A negative-iteration sequence at 0.8B: three well-formed recipe variants cluster post-SFT curated pass-rate within a 2 pp band, constraining the absolute-pass-rate ceiling to base capacity rather than recipe. Cross-family judge validation. GPT-5.4 via OpenRouter on all 7 configurations (2800 paired episodes) agrees on the direction of every per-student finding: Cohen's $κ\geq 0.754$, agreement $\geq 93.25\%$, max headline $Δ$ shift $\leq 0.035$ pp. Two earlier framings -- "format-only learning at 0.8B" and "SFT contribution shrinks at 4B" -- were path-mismatch artifacts; this paper supersedes both. Single-seed evaluation; threats itemised in the paper.

cs.LG↗

Morphological stability and identity in self-organizing systems

In this essay I aim to investigate and discuss the process through which bundles of things "self-organize" into other things. In particular, I engage in such investigation by trying to apply a framework of analysis of structural stability of morphological forms to the context of a continuous cellular automata known as $\textit{Lenia}$, which displays great diversity of distinguishable, individuated complex subsystems, who behave autonomously and in lifelike manner (such subsystems are often known as $\textit{solitons}$). I do so in order to suggest a path to the development of methods to formally distinguish said subsystems from their environment.

nlin.AO↗