Reading statuses — How deeply the paper was READ — not whether it is any good, which is lit-statuses. The two disagree in every direction: a foundational paper can carry a Skimmed note, and a paper in the attic can carry a Read one, since reading it carefully is often how it got there (ADR-025).
Read — the full text, closely enough to state its assumptions and results exactly — the only status that licenses a claims table.
1439 of 1538 NOTE documents. Back to the full index.
| # | Title | Summary | Status |
|---|---|---|---|
| NOTE-001 v2 | Is the United States Still a Liberal Democracy? | Drezner asks whether the US will still be a liberal constitutional democracy in January 2029. He reviews Polity’s downgrades (+10 in 2015 to +5 for 2020, and in February 2025 “at the cusp of autocracy”), the Freedom House fall from 92 to 83 (2014–2021, as quoted from Levitsky & Way) and counter-evidence (continued compliance with court orders; Hickman’s “not there yet”). He then concludes that “it is hard to disagree” with Levitsky & Way’s forecast of competitive authoritarianism, and expects democracy’s “precarity” to be the lasting condition. | Read |
| NOTE-002 v2 | Eulalia impact shower | The paper builds a collisional-plus-dynamical source model. In its preferred Solution 5, the Eulalia parent body breaks up T = 865 Myr ago at a_c = 2.48 au next to the Jupiter 3:1 resonance. The model sends 6,995 D ≥ 2 km and 833 D ≥ 5 km fragments into the J3:1 (Table 1, before a ≈1.5× collisional correction). With impact probabilities per resonance entrant of 5.4×10⁻³ (Venus), 4.2×10⁻³ (Earth) and 0.6×10⁻³ (Mars), and the Moon at 1/20 of Earth, the expected largest impactor is D ≈ 8 km on Earth and Venus, 4.5 km on Mars and “>3 km” on the Moon. A Monte Carlo of 7 lunar projectiles puts the seven lunar craters dated 760–820 Ma “generally … within the 1σ” envelope. The authors conclude the breakup “can plausibly account for” the ~800 Ma lunar crater cluster, although on average the model’s projectiles are too small to make Copernicus. | Read |
| NOTE-003 v2 | QM as stochastic optimization on spacetimes | The paper derives a Stueckelberg-type equation i∂φ/∂τ = (1/2m)□φ − Vφ (Eq. 36) from an HJB equation, but only after putting the imaginary unit in twice by hand. The first i is a factor √g = i multiplying the Lagrangian; standard relativity uses √(−g) = 1. The second is a complex “variance” σ² = i/m (Eq. 29), chosen so that the Hopf–Cole substitution J = log φ linearizes the equation. The linearization itself is the standard λ = σ²·(control cost) condition. The Schrödinger equation (Eq. 43) then comes from c → ∞ plus complex conjugation. The Dirac equation is not derived, and the “Klein–Gordon equation” (Eq. 40) has 2mV where m² should be. | Read |
| NOTE-004 v2 | US v. Google remedies opinion | Remedies opinion after the 2024 §2 liability ruling. The court (Mehta, J.) bars exclusive distribution deals for Search, Chrome, Assistant and the Gemini app, with a one-year exit right on all payment deals. It does not ban payments, and it rejects the Chrome and Android divestitures and choice screens. It orders (i) a one-time snapshot of six Search Index fields per document, (ii) Glue and RankEmbed user-interaction training data “at least twice”, capped and privacy-treated, and (iii) five-year search and text-ads syndication on ordinary commercial terms (search capped at 40% of queries in year one). “Qualified Competitors” is rewritten so it can include GenAI firms. The term is six years (five plus one of ramp-up). On GenAI, the court finds that grounded chatbots perform an information-retrieval function similar to general search engines, enough to bring GenAI inside the decree. It also finds that plaintiffs “did not establish that Google’s scale advantage in Search translates into a quality advantage in GenAI search-assisted responses” (op. p. 156). For that reason it refuses to order sharing of Gemini training data. | Read |
| NOTE-005 v2 | Spectral dimensions of bundled networks | The paper studies a “bundled” network, meaning a fiber graph attached at one node to every node of a base graph, with base and fiber growing with the same length L. For such a network, first-order perturbation theory (SM Eq. 10) gives the low spectrum as λ = ℓ^b/N_f, and from that the gap (“Fiedler”) dimension d_g = 2(d_f,f + d_f,b)/(d_f,f + 2d_f,b/d_g,b), while the spectral dimension stays d_s = d_s,f. The two therefore differ unless d_g,b = 2 or the fiber is finite. For example, the ring-of-rings comb has d_s = 1 but d_g = 4/3, and the 2D-base brush has d_s = 1 but d_g = 2. The rule holds only while the base-induced gap lies below the fiber’s own gap (SM Eq. 14). | Read |
| NOTE-006 v2 | Community Detection on Networks with Ricci Flow | The paper runs Ollivier-Ricci flow w^{(k+1)}{xy} = (1 − κ^{(k)}{xy})·d^{(k)}(x,y) (= W(m_x, m_y)), then cuts edges above a weight threshold. On LFR (n = 500, avg. degree 20) this gives ARI ≈ 1 up to μ ≈ 0.6. On two-block SBM (n = 500, p_intra = 0.15) it gives ≈ 1 up to p_inter/p_intra = 0.5, but it collapses to ≈ 0.1 at 0.55, where Spinglass and Fast Greedy still score ≈ 0.9 and ≈ 0.8. Theorem 4.1 (α = p = 0, cliques G(a,b), a > b ≥ 2) proves in fact only that non-gateway intra-clique edges shrink as (1/a)ⁿ. Gateway intra-clique edges grow at the same rate λ₁ⁿ as inter-community edges, with ratio → k ∈ (0,1). | Read |
| NOTE-007 v2 | From the origin of life to pandemics | An editorial review with no new result. Its one formal item (§4, Eq. 4.1: x(t+1) = f[x(t)], x(0) = x₀) sorts phenomena three ways. Non-emergent: local rules plus initial conditions let you deduce the “expected” high-level pattern. Weakly emergent: they let you deduce an “unexpected” one by computation. Strongly emergent: no deduction is possible even in principle. “Unexpected” is never defined. The rest is a cross-domain survey (§3), a 16-paper map of the theme issue (§5), and an outlook (§6). | Read |
| NOTE-008 v3 | Hierarchical Pitman-Yor topic models | The paper collapses every Pitman–Yor node to customer and table counts (Eq. 16, following Chen et al. 2011), which turns any HPYP topic model’s posterior into a product of per-node factors, and it samples topics and counts jointly by decrement/propose/increment. The HPYP half of its Twitter-Network Topic Model uses this sampler; the network half is fit by a separate MH step. On one 240,517-tweet, 150-author corpus (T6) the TNTM reaches test perplexity 505.01 ± 7.8, against 664.25 ± 17.76 for a nonparametric ATM and 840.03 ± 15.7 for HDP-LDA, and network log-likelihood −500.63 against −557.86 for the random-function network model alone (Table 4). Removing the power-law discounts barely changes perplexity (508.64) but costs network likelihood (−560.28; Table 5). | Read |
| NOTE-009 v2 | Spectral Sets | A survey of when a set X ⊃ σ(A) satisfies ‖f(A)‖ ≤ K sup_X|f| for all rational f. Its headline entries are that the closure of the numerical range is completely K-spectral with a universal K_Crouzeix ∈ [2, 11.08] (Fact 107.7.2a; completely 2-spectral for 2×2, Fact 107.7.2b) and that σ(A) is K-spectral iff A is diagonalisable, with K the eigenvector condition number (Example 107.2.5). §107.8 turns these into Krylov error bounds such as Arnoldi ε_m ≤ 2K_Crouzeix ρ_{m−1}(f,E) for convex E ⊃ W(A). | Read |
| NOTE-010 v5 | Greater than the parts | A review, with no new theorem, of the ΦID theory of causal emergence. A supervenient feature V_t is k-th-order causally emergent iff Un⁽ᵏ⁾(V_t; X_t′ | X_t) > 0. A system hosts such features iff Syn⁽ᵏ⁾(X_t; X_t′) > 0 (cited as Rosas et al. 2020, Theorem 1), and Syn⁽ᵏ⁾ = D⁽ᵏ⁾ + G⁽ᵏ⁾ (downward causation plus causal decoupling). The review’s own additions are interpretive: the formalism is neutral between Granger and Pearl, coordinate dependence is defended as a feature, and it rebuts the charge that the theory makes no macro-versus-micro comparison. | Read |
| NOTE-011 v2 | Quantum Thermodynamics | A 2015–16 review with no new results, whose one synthesis (§5.2, §7) is that the field used four inequivalent notions of work: ensemble ⟨W⟩ = ∫tr[ρḢ]dt (Eq. 2), two-point-measurement W = E_m^(τ) − E_n^(0) (Eq. 24), ε-deterministic single-shot A^ε ≈ −kT ln(Z_Λ*/Z) (Eq. 49) and resource-theory w^max_ε = F^min_ε(ρ_S) − F(τ_S) (Eq. 50), of which only the last two coincide. It also judges that the field had “only made a small number of experimentally checkable predictions of new thermodynamic effects yet” (§7, p. 39). | Read |
| NOTE-012 v2 | Russian Hybrid Warfare | Clark argues from open Russian military writing of 2015–2020, chiefly Military Thought and Army Collection, that Russia treats “hybrid war” as a type of war. In his account it is a strategic-level effort to reorient a target state, in which every action, conventional force included, is subordinate to an information campaign. He concludes that a US strategy centred on deterring great-power conventional war can “technically succeed” while losing. The report ends with 12 recommendations (executive-summary count). | Read |
| NOTE-013 v2 | Quasi-quantization | Take a classical statistical theory over a phase space Ω = R^{2n} or (Z_d)^{2n}, and allow only uniform distributions over V^⊥ + v, where V is an isotropic subspace (a Poisson-commuting set of linear “quadrature” variables) and v ∈ V gives their values. The result is operationally identical to the quadrature quantum subtheory (the stabilizer formalism for odd prime d) for continuous variables and for odd prime d; the proof is that the Wigner functions of that subtheory are exactly these distributions (§IV.A). For d = 2 the two theories are isomorphic element by element but make different predictions, because the qubit stabilizer subtheory is contextual (§IV.B). | Read |
| NOTE-014 v2 | Segundo A.P.G. v. Bondi show cause hearing | At a 71-minute show-cause hearing on noncompliance with habeas release orders in five cases, Judge Blackwell said that the scale of Operation Metro Surge “is not a justification for diluting constitutional rights” and that the government “cannot … detain first and then sort out lawful authority later”. The record includes a 13-day delay in releasing Oscar O.T., release conditions imposed without the court’s authority on Jose L.C.C., and a Segundo release learned of only through another case. Government counsel attributed the failures to missing training, access and agency cooperation. The court took the matter under advisement. No written order following the hearing could be verified. | Read |
| NOTE-015 v2 | Periodic vehicle routing and facility location for waste collection | The paper couples bin-capacity choice with weekly periodic capacitated routing (Sunday off, cyclic). Service time depends on the chosen bin combination, which gives an MIQP; a Glover linearisation turns it into a MILP. It solves both with Gurobi 10 for 8 h, and also with a binary-mask + permutation GA (CX 0.8, EM 0.05, pop 100, 10,000 generations). On five 12-point instances Gurobi stops at 26–32% optimality gaps. The best-of-30 GA overall cost is on average −0.08% vs the MILP incumbent and +1.70% vs the MIQP incumbent; the GA mean or median is +3.75% and +5.61%. The GA routes better (−5.75% and −5.74% routing cost) but buys much more bin capacity (+19.88% and +22.59%). On 40–163-point Bahía Blanca instances the GA returns feasible solutions in 0.72–5.58 h per run, with no bound to compare against. | Read |
| NOTE-016 v2 | The sheaf-theoretic structure of non-locality and contextuality | For finite measurement scenarios, an empirical model has a factorizable (local / non-contextual) hidden-variable realization iff its compatible family of distributions extends to a global section (Thm 8.1). Over the reals every no-signalling model has such a section (Thm 5.9: “negative-probability LHV” ⇔ no-signalling, because both span the same subspace, of dimension D = Σ_{U∈𝒰}(l−1)^{|U|}, Thm 5.4). Contextuality comes in three strictly nested strengths (probabilistic ⊋ possibilistic ⊋ strong), with the Bell, Hardy and GHZ(n≥3) models as witnesses of each level. | Read |
| NOTE-017 v2 | A structure theorem for generalized-noncontextual ontological models | Take a tomographically local GPT and any convex-linear, empirically adequate, diagram-preserving map M from it into FVect_R. Then M(T) = χ_B ∘ T ∘ χ_A⁻¹ for unique invertible linear maps χ_A (Thm 4.1). Consequences: - Every diagram-preserving quasiprobabilistic model is an exact (non-overcomplete) frame representation (Prop. 4.3). - Every diagram-preserving noncontextual ontological model has |Λ_A| = dim(A), the GPT dimension (Cor. 4.2, §4.3): exactly d² ontic states for a qudit and 4 for a qubit. - The paper also proves (Cor. 3.5) that three things are equivalent in arbitrary compositional scenarios, without needing tomographic locality: a noncontextual ontological model of the operational theory; an ontological model (simplex embedding) of its GPT; and a positive quasiprobabilistic model of its GPT. | Read |
| NOTE-018 v2 | Why interference phenomena do not capture the essence of quantum theory | The paper models each mode of the interferometer as a classical bit pair (occupation N ∈ Z_2, phase Φ ∈ Z_2). The agent may know only one of N, Φ or N⊕Φ and must be maximally ignorant of the rest. Under that restriction, local and deterministic dynamics (beamsplitter: swap N_L with Φ_L⊕Φ_R) reproduce exactly the 50-50, ϕ ∈ {0, π} Mach–Zehnder statistics (output port L with probability 1 or 0; ½/½ with a which-way detector). The same holds for the Elitzur–Vaidman bomb tester (success probability ¼), delayed choice and the quantum eraser (interference within each P_A outcome class, none within each Q_A class). So this “TRAP” slice of interference phenomenology cannot, on its own, force wave–particle complementarity, observer-dependence or nonlocal/retrocausal influence. The paper leaves aside the phenomenology it concedes is nonclassical (unbalanced beamsplitters, the functional form of the duality relation, Hardy’s interferometer). | Read |
| NOTE-019 v2 | Reckless disregard for the truth coming from cops, doctors, and scientists | Gelman argues that scientists (a 3-day study titled “long-term”; the power-pose abstract’s “instantly become more powerful”), a paid medical expert (Ludmerer’s 2002 “no opinion” on smoking and lung cancer) and DHS spokespeople (Lander “assaulting”, Padilla “lunging”, ICE’s unsourced “413 percent” assaults) share one pattern, which he calls “reckless disregard for the truth”. In his account it strengthens a weak case, is carried by journals, courts and media, is accepted as a term of art and goes unpunished. It is negative-sum, and bystanders who tolerate it sustain it. | Read |
| NOTE-020 v4 | Emergence as the conversion of information | Varley and Hoel apply a PID, with the Williams–Beer I_min redundancy, to past→future mutual information and summarise it with a new layer-weighted “synergy bias” B_syn ∈ [0,1]. Coarse-graining can raise B_syn at the macroscale. A macroscale XOR reaches 0.833, against 0.52 for its NAND/AND/OR implementation. In 200 random 3-node “Gaussian” TPMs expanded into equivalence-class micro/mesoscales with identical MI, every macroscale had higher B_syn, by ≈ 0.01–0.07 (r = 0.819 against macroscale B_syn). In 185 near-deterministic systems the change was mostly negative, down to ≈ −0.1. | Read |
| NOTE-021 v2 | Distinguishability and Accessible Information in Quantum Theory | Minimizing the Bhattacharyya overlap Σ_b √(tr ρ0E_b)√(tr ρ1E_b) over all POVMs gives exactly F(ρ0,ρ1) = tr√(ρ1^{1/2}ρ0ρ1^{1/2}) (Eq. 3.28). The minimum is attained by a projective measurement in the eigenbasis of M = ρ1^{-1/2}√(ρ1^{1/2}ρ0ρ1^{1/2})ρ1^{-1/2} (Eq. 3.67). For binary ensembles, the same Schwarz-inequality technique gives three results: a short proof of the Holevo bound I(t) ≤ S(t), with equality iff [ρ0,ρ1] = 0 (Eq. 3.149); a tighter upper bound L(t) (Eq. 3.187, integrated in Eqs. 3.230/3.244; closed form for qubits in Eq. 3.269); and a measurement-attained lower bound M(t) = tr[(1−t)ρ0 ln L_ρ(ρ0) + tρ1 ln L_ρ(ρ1)] (Eq. 3.203). The thesis also proves that two states can be broadcast iff they commute, and cloned iff they are identical or orthogonal (§4.3, proof written for invertible ρ0, ρ1). | Read |
| NOTE-022 v2 | Spectral Networks and Betti Lagrangians | For any rank n, and for Lagrangians with non-algebraic (positive-braid) asymptotics, spectral networks exist and are characterised by pseudo-holomorphic strips in the adiabatic limit (Theorems 1–2). For exact Betti Lagrangians, a Family Floer functor equals Gaiotto–Moore–Neitzke non-abelianization in the adiabatic limit (Theorem 3, i.e. 5.24) and is realised by A∞-operations in wrapped and partially wrapped Fukaya categories of T*S (Theorem 4). The analysis in §§4–5 leans on Ekholm 2007 and on the second author’s 2024 preprint, and Theorem 5 (spectral networks from Demazure weaves) is recorded without a written proof. | Read |
| NOTE-023 v2 | Nested Hierarchical Dirichlet Processes | The nHDP gives each document its own DP over the children of every node of a shared global nCRP tree (G_i^(d) ~ DP(βG_i)), plus a per-node stop/continue switch U_{d,i} ~ Beta(γ1, γ2). Each word then takes its own path, and β → 0 recovers the single-path nCRP. The paper fits this with SVI plus a greedy per-document subtree selection. On small corpora the variational nHDP beats variational nCRP on all three datasets and Gibbs nCRP on two of three (PNAS −6.304 vs −6.496/−6.574 held-out log-likelihood). On 1.8M NYT and 2.7M Wikipedia documents it tops stochastic HDP and LDA-50/150/250 by roughly 0.08 and 0.11 nats (read off Figs. 2, 7), using ≈12 and ≈8 topics per document. | Read |
| NOTE-024 v2 | Rhode Island Hospital subpoena order | Judge McElroy quashed DOJ HIPAA administrative subpoena No. 25-1431-032 (18 U.S.C. § 3486) to Rhode Island Hospital on three independent grounds: 1. no congressionally authorized purpose, because DOJ’s FDCA off-label “misbranding” theory against a prescribing hospital is not legally cognizable (Facteau; 21 U.S.C. §§ 396, 353(b)(2)); 2. issuance for an improper purpose in bad faith; 3. a Fourteenth Amendment informational-privacy violation for the children, with relief extended to all minors because a DCYF-only carve-out would itself expose DCYF wards. The court enjoined DOJ with respect to patient-identifying information and PHI produced under the subpoena, and stated that it quashed the subpoena, “not the enforcement order entered by the Texas court”. An amended order the next day (ECF 44) added “seeking” to the injunction. DOJ appealed (1st Cir. No. 26-1568; argument calendared for Oct 7, 2026). | Read |
| NOTE-025 v2 | Joint Publication 3-12, Cyberspace Operations | JP 3-12 (8 June 2018) defines cyberspace operations as “the employment of cyberspace capabilities where the primary purpose is to achieve objectives in or through cyberspace” (p. I-1). It sorts every non-”cyberspace-enabled” military action in cyberspace into exactly three missions: DODIN operations, DCO (split into DCO-IDM and DCO-RA) and OCO. Missions are categorized “based only on the intent or objective of the issuing authority” (p. II-2). Missions are carried out through four actions: cyberspace security, defense, exploitation and attack. On authorities, the publication says only that authority “is derived from the US Constitution and federal law” (Titles 10, 50 and 32 named as key; p. III-2), plus SecDef policy and President/SecDef orders. Specific authorities are deferred to the unreleased classified Appendix A. | Read |
| NOTE-026 v2 | Forman-Ricci curvature of networks | The paper specializes Forman’s (2003) Bochner–Weitzenböck curvature on weighted CW complexes to graphs, giving the closed-form edge curvature Ric_F(e) = ω(e)[ω(v1)/ω(e) + ω(v2)/ω(e) − Σ_{e_v1∼e, e_v2∼e}(ω(v1)/√(ω(e)ω(e_v1)) + ω(v2)/√(ω(e)ω(e_v2)))] (Eq. 11). It then proposes three uses: an EMD distance between curvature distributions, which puts Facebook, Google and BioGrid graphs at 0.050–0.060 from a Barabási–Albert model against 0.17–0.36 from Erdős–Rényi and Watts–Strogatz (Table 1); a discrete “2-D-form” Ricci flow γ̃(e) − γ(e) = −Ric_F(γ(e))·γ(e) (Eq. 36) for change detection; and a Laplacian flow ∂G/∂t = (□₁ − F)G (Eq. 45) for denoising. The authors say the flow applications are “only theoretically proposed and illustrated solely on a small example” (§5). | Read |
| NOTE-027 | Adding causality to individuality | Of Krakauer et al.’s (2020) three mutual-information “individuality” terms (A* = I(S_{t+1}; S_t), A = I(S_{t+1}; S_t | E_t), nC = I(S_{t+1}; E_t | S_t)), Bourrat argues that nC and A* are not individuality measures. He then proposes the interventional  = I(S_{t+1}; Ŝ_t) (Eq. 6) and two ETI criteria: C1, a normalised Â_{S2}/H(Ŝ2) ≥ Â_{S1}/H(Ŝ1)|θ₀, and C2, low Var(Â_{S2} | Ê2 = ê2k). None of these is computed on any system. The paper’s claim that  ≡ I(S_{t+1}; S_t | E_t) = A in Krakauer’s model is false in general. | Read |
| NOTE-028 v2 | Disinformation incidents as cyber threat intelligence (DISINFOX) | The paper shows that a DISARM-labelled disinformation incident can be encoded in plain STIX 2.1 with four object types (IntrusionSet for the incident, ThreatActor, AttackPattern, Location) and three relationships (uses, attributed-to, targets), then served by an open-source microservice platform (DISINFOX) to OpenCTI through a custom connector. Its validation is a demonstration that 118 hand-labelled incidents passed through the pipeline; it reports no measurement of fidelity, usefulness or scale. | Read |
| NOTE-029 v2 | Krauska & Lau 2023, moving away from lexicalism | The authors argue that lemma-based production models encode two lexicalist assumptions: a morphology/syntax split, and a stored meaning–syntax–form “triad”. On that basis the models mishandle Inuktitut polysynthesis, separable Vietnamese idiomatic collocations, Hiaki number suppletion and English verb–object idioms. Updating the representations (treelets) is not enough, because the algorithms — separate lexical retrieval and structure building, word-sized increments — also have to change. They sketch an 8-stage non-lexicalist model and derive qualitative aphasia predictions from it. There are no new data and no implementation. | Read |
| NOTE-030 v2 | Pusey, Barrett & Rudolph, reality of the quantum state (PBR) | Take pure states |ψ0⟩, |ψ1⟩ with |⟨ψ0|ψ1⟩| = cos θ. Assume (a) a model assigns each preparation a distribution µ_i(λ) over physical states, (b) n independent preparations yield the product distribution µ_{x1}(λ1)⋯µ_{xn}(λn), and (c) outcome probabilities depend only on (λ1, …, λn). If the model’s predictions are within ε of quantum theory, then D(µ0, µ1) ≥ 1 − 2ε^{1/n} for any n with 2^{1/n} − 1 ≤ tan(θ/2) (Eq. 7, App. B). At ε = 0 the distributions for distinct pure states cannot overlap on a set of non-zero measure, so Harrigan–Spekkens ψ-epistemic models are ruled out. | Read |
| NOTE-031 v2 | The Strongest El Niño Ever (Climate Brink) | Hausfather reports that the July 2026 runs of 14 seasonal models (667 members, model-weighted) put the median peak Niño 3.4 anomaly of the 2026-27 El Niño at 3.6 °C, against his computed record of 2.75 °C (2015-16). That gives about a 91% chance of a record, or about 77% on a relative index where 1982-83 holds the record at 2.69 °C. He cautions that no model has been verified at this intensity. - NOAA’s own series agree on the rankings but give lower record values: 2.67 monthly for 2015-16 and 2.6 in ONI. - Observations through mid-September 2026 are on a record-setting track: weekly Niño 3.4 +3.0 °C on 16 Sep, and monthly ERSSTv5 +2.17 in August. The event has not yet peaked, so the forecast cannot yet be verified. | Read |
| NOTE-032 v2 | Work capacity of channels with memory | The paper models agent and environment as coupled finite hidden-Markov channels. It defines the environment’s work capacity C_work = max over agent models of ⟨H(A_t|M_t) − H(S_t|M_t)⟩_t (in k_BT ln 2 per round) and proves two things. First, for unifilar environments whose percepts ignore actions, the efficient agents are exactly the randomize-and-forget ∩ maximally-predictive ones, and C_work = log|A| − h(S). Second, one binary memoryless environment exists where predictive, max-entropy-action and efficient agents form three nonempty, pairwise-disjoint sets: every predictive agent extracts ≤ 0, uniform-random agents extract 1 − h(3/4) ≈ 0.189 bits, and the optimum is ½·log₂(3/4 + 1/√2) ≈ 0.272 bits, reached by a memoryless agent that plays action 0 with probability 1/√2. | Read |
| NOTE-033 v2 | ”Broadview Six” grand jury transcript, 9 Oct 2025 | At the 9 Oct 2025 session (Special June 2024 Grand Jury, 25 GJ 994), AUSA Sheri Mecklenburg opened by telling the jurors she had waited for “the Thursday grand jury” because “I know you and I trust you … and I would never ask you to charge somebody if I didn’t think there was probable cause” (tr. 3). The only witness was FBI Special Agent Evan Hylton (tr. 10–61). He answered mostly “Yes” to leading questions: on the driver’s second-hand account, on his own photos of the car taken 1 Oct, and on social-media identifications of the six. Jurors then pressed on the damage, the conspiracy theory and whether the driver was yet on duty. One said “I personally feel the complete opposite way” (tr. 75). The vote is not in the transcript; press reports it as a “no bill”. | Read |
| NOTE-034 v3 | Curry et al. 2019, morality-as-cooperation in 60 societies | Coding 3,460 eHRAF paragraphs on the 60 Probability Sample Files societies found 962 morally valenced mentions of seven cooperative behaviours, 961 of them positive. The one negative is Chuuk admiration of open theft as dominance. Presence varied widely by domain: property 54/60 (90%), kin 47 (78%), group 44 (73%), reciprocity 43 (72%), respect 35 (58%), bravery 32 (53%), fairness 9 (15%). Presence correlated with ethnographic coverage (r = 0.43). The design can detect a morally positive mention but has almost no way to register a negative one, so the 99.9% is weak evidence for universality. | Read |
| NOTE-035 v2 | Plávala, General probabilistic theories: An introduction | A self-contained textbook on finite-dimensional GPTs whose central results are that state spaces and effects are dual (K = {φ ∈ A(K)*+ : ⟨φ, 1_K⟩ = 1}, Thm 3.19) and that optimal two-state discrimination succeeds with probability ½(1 + ‖λx₀ − (1−λ)x₁‖) in base norm (Thm 3.43). Every composite lies between the minimal and maximal tensor products (Prop. 5.6), and four statements are equivalent: id_K is measure-and-prepare, id_K is self-compatible, K admits a universal broadcasting channel, and K is a simplex (Thm 7.7); minimal = maximal iff one factor is a simplex is cited to [134], not proved. | Read |
| NOTE-036 v2 | Lindahl et al. 2017, varieties of contemplative experience | This is a qualitative taxonomy, not a prevalence estimate. Sixty Western Buddhist meditators were recruited for having had meditation-related difficulties, and 32 teachers/clinicians were interviewed. Their accounts were coded into 59 experience categories in 7 domains and 26 influencing-factor categories in 4 domains. The most frequent category was fear/anxiety/panic/paranoia (82%). 73% reported moderate-to-severe impairment in at least one domain, 17% suicidality and 17% inpatient hospitalisation. Median symptom duration was 1–3 years. All of these are frequencies within a sample selected for difficulty, as the authors state. | Read |
| NOTE-037 v2 | Debreu 1952, a social equilibrium existence theorem | Debreu proves existence of an equilibrium for an “abstract economy” (generalized game), in which each agent’s feasible set A_ι(ā_ι) depends on the others’ actions. The conditions: each action set 𝔄_ι is a contractible polyhedron; A_ι has a closed graph with non-empty compact values; f_ι is continuous on the graph into the extended reals; the value function φ_ι(ā_ι) = max f_ι is continuous; and each best-response set M_ā_ι is contractible. The proof applies the Eilenberg–Montgomery/Begle fixed-point theorem to the product best-response map. A Remark replaces the joint continuity of φ_ι with continuity (lower hemicontinuity) of A_ι plus a compact graph. A Corollary gives a saddle-point theorem that contains Kakutani’s and von Neumann’s. | Read |
| NOTE-038 v2 | Structural Realism (Stanford Encyclopedia of Philosophy) | The entry presents structural realism (Worrall 1989) as the attempt to keep both the no-miracles argument and the lesson of theory change. What is retained, and what we are entitled to believe, is structure, understood by ontic structuralists as modal structure. It sorts the view into an epistemic form, which falls to the Newman/Demopoulos–Friedman triviality result when stated as a Ramsey sentence (§3.2), and an ontic form with seven distinguishable theses, from eliminativism about individuals to “objects are constructs” (§4). The ontic form is motivated by quantum non-individuality and entanglement, gauge symmetry and the hole argument. The entry closes with seven objections, each answered in the author’s own voice (§5). | Read |
| NOTE-039 v2 | Orosz 2025, software job openings at a five-year low | Orosz reports that US software-development postings on Indeed stood at 65% of the pre-pandemic baseline, “3.5x” below the 2022 peak and 8% down year on year, while all postings were +10%. He attributes most of the fall to the end of zero interest rates, gives GenAI a secondary “wait and see” role, and doubts Indeed’s coverage. - Against Indeed’s current data the headline US figures reproduce: 65.2, peak ratio 3.59×, −8.3% y/y, all postings 109.5. - Several side figures and one comparative claim do not reproduce (see corrections). | Read |
| NOTE-040 v2 | Dreyer et al. 2024, ants vs humans on a piano-movers puzzle | On one T-shaped piano-movers puzzle, the CDF of solved attempts against normalized path length shows large ant groups (≈80 carriers, n=28) well ahead of small groups (≈7, n=48) and a 3-run composite single-ant series. An agent-based model with group-size-independent rules reproduces the difference. Human groups of 6–26 barred from talking or gesturing needed more attempted state transitions than single people (−32% relative to the individuals’ median; n=48 groups vs 61 individuals), and talking groups were only slightly better (+7%). No significance test is reported anywhere: “significantly” rests on overlapping-or-not ±1 SE bands. | Read |
| NOTE-041 v2 | Doctorow, “Disenshittify or die!” (DEF CON 32) | Doctorow argues that platforms follow a three-stage decay cycle: good to users while locking them in, then good to business customers at users’ expense, then taking all the value for themselves. The mechanism is “twiddling”. It became possible when four disciplining forces weakened: competition, regulation, interoperability and tech-worker power. A “new, good internet” needs all four restored, with interop (reverse-engineering rights) and unionisation as the hacker-specific levers. The argument is assertion and anecdote throughout. It carries several checkable factual slips, notably about EU law and the court in United States v. Google. | Read |
| NOTE-042 v2 | Bonica, “The Mothership Vortex” (Democratic spam PACs) | From FEC filings, Bonica reports that a core network of PACs linked to Mothership Strategies raised about 159M went to Mothership, out of 11M reached candidates, campaigns or national party committees, a “fundraising efficiency rate of just 1.6 percent”. The headline numbers cannot be reproduced from the published repo: its inputs are missing, it has a fatal undefined variable, and it computes several reported figures nowhere. As documented, its disbursement queries cover only the latest two-year period and at most 1,000 disbursements per committee, largest first, which would bias the $11M downward rather than cap it. The post’s own infographic contradicts several of its figures. | Read |
| NOTE-043 v2 | Observational entropy meets maximum entropy | The paper defines S^τ_M(ρ) = S(τ) − D_M(ρ‖τ) = −Σ_x p_x log(p_x/V_x), with V_x = Tr(τM_x)e^{S(τ)} (Eqs. 10–12). It is bounded as S(τ) ≥ S^τ_M(ρ) ≥ S(ρ) when ρ obeys the constraint S(ρ;τ) ≤ S(τ) (Eqs. 17–18). It reduces to 24 listed entropies, and it removes traditional observational entropy’s infinite-dimensional pathologies whenever S(τ) < ∞ (§VIII.7). Its “second laws” are bounds D_M(ρ̄‖τ) ≤ ε on the time-averaged state, split as equilibration plus prior-fit (Eq. 27). The paper proves the first term small in two regimes (Eqs. 28–29) and the second only under the ETH (Eq. 31). It states that in its own numerical examples the smallness “was [not] proved here analytically” (p. 12). | Read |
| NOTE-044 v2 | Grangier & Auffèves, What is quantum in quantum randomness? | The paper argues informally, with no equations anywhere in it, that an “elementary” system with a fixed finite number N of exclusive modalities, placed in contexts that can change, must behave unpredictably when the context changes: a return to C1 after C2 cannot be certain, or there would be N² > N joint modalities (p. 4). It asserts that adding one condition, that the context can change continuously, makes the N×N modality-transition matrix unistochastic, i.e. Born-rule, but defers that proof to refs [14, 15] (p. 5). The anti-reductionist conclusion follows from Postulate 0, which declares contexts non-contextual by definition, not from an argument against decoherence. | Read |
| NOTE-045 v2 | Gutknecht et al. 2025, Shannon invariants | For any set of quantities Π(α) satisfying the PID consistency equation (A7), whatever the redundancy measure, two averages are fixed by Shannon quantities alone. They are the average degree of redundancy, r̄ = Σᵢ I(Xᵢ;Y)/I(X;Y) (Prop. 1), and the average degree of vulnerability, v̄ = Σⱼ I(Xⱼ;Y|X₋ⱼ)/I(X;Y) (Prop. 2). Two identities follow: RSI = (r̄ − 1)·I(X;Y) (Cor. 1), and a new “dual” index DRSI = I(X;Y) − Σⱼ I(Xⱼ;Y|X₋ⱼ) = (1 − v̄)·I(X;Y) (Prop. 4, Cor. 2). In small, stochastically quantised (8-level) networks analysed on their own training set, r̄ about the label rises with depth and v̄ falls with depth and training. In a face autoencoder, decoder layers are more redundant than size-matched encoder layers, and r̄ rises with bottleneck width. | Read |
| NOTE-046 v2 | Chu & Raginsky, expected soft maxima of Gaussian processes | Take a centered Gaussian process on a finite set T with max variance σ² and minimum separation a. The expected softmax-weighted average g(β) = E[Σ_t X_t e^{βX_t}/Z] satisfies g(β) ≤ √(2σ²·E D(ν_β‖ν₀)) for every β (Thm 1, D = KL from uniform). For β ≥ β*, g(β) ≥ c·a·√(E D(ν_β‖ν₀)), with c the Sudakov constant (1/17 via Marcus–Rosen) (Thm 2). For i.i.d. N(0,σ²) logits there is an exact identity, g(β) = βσ²(1 − E‖ν_β‖²₂) (Lemma 2). The quenched free energy is bounded above by √(2σ²·E D_{1/2}(ν_β‖ν₀)), with an i.i.d. lower bound of (cσ/2)√(E D_{1/2}) (Thms 4–5). | Read |
| NOTE-047 v2 | nLab, two-level type theory | The nLab page is an accurate but thin gloss on two-level type theory. It says nothing about the result that makes 2LTT usable: basic 2LTT is conservative over HoTT (ACKS Prop. 2.18: an inner type provably inhabited in 2LTT is inhabited in HoTT), which answers much of the page’s own “open question” about the principle of equivalence. It also omits that a fibrant-replacement type former would force UIP on the inner level (ACKS Thm 2.20). The paper it cites, ACKS arXiv:1705.03307, is the proper source: definitions via models, conservativity, the axiom menu (A1)–(A6)/(T1)–(T3), and internal Reedy-fibrant diagrams over inverse categories with a definition of univalent (∞,1)-category. | Read |
| NOTE-048 v2 | Law Dork on DHS v. D.V.D. (South Sudan removals order) | The post reports that the Supreme Court, “on an apparent 7-2 vote”, held that the district court could not enforce its May 21 remedial order for the men held in Djibouti, because the Court had stayed the underlying April 18 injunction. It quotes the Kagan concurrence and the Sotomayor–Jackson dissent accurately. Against the order, its account of the holding is accurate. Its framing (the headline’s “with no process”, “Permission had been granted”, “seven justices are allowing”) goes beyond what the order decides. It also omits the majority’s reasoning, and it follows the dissent’s count of eight men where the per curiam refers to six. | Read |
| NOTE-049 v2 | Feinman et al. 2025, grand narratives of inequality | Across a global archaeological house-size compilation (SiteGiniLevel: 1,176 sites, 47,019 houses), site Gini coefficients rise only weakly with the number of political levels (r² = 0.16 all sites, 0.22 apex, 0.27 H50) and with log polity population (r² = 0.11, 0.21, 0.08; values printed on Fig. 2, not in the text). The spread widens at three or more levels. A 0–3 expert-coded autocracy score does about as well (r² = 0.10, 0.18, 0.32; Fig. S4), and its sum with levels (“Hierarchical Clout”) reaches r² = 0.30 (apex), 0.42 (H50) and 0.50 (H100). All tests are bivariate OLS fits with no controls and no correction for many sites sharing polity-level values. | Read |
| NOTE-050 v2 | The relativity of causal knowledge | The paper defines SCMs as functors I → Prob and interventions as natural transformations (which requires invertible mixing functions). It encodes each non-intervened SCM as the convex space Δ(V, Ω) of all probability measures on its endogenous space, and puts these spaces on a graph as stalks of a network sheaf and cosheaf. The restriction maps are interventionally consistent α-abstractions and the extension maps are unspecified affine maps. “Relative causal knowledge” is the image of alternating restriction and extension along a path (Def. 11). The two substantive-looking theorems are either unsound or vacuous. Theorem 1 (every convex combination of a model’s interventional measures is a soft-interventional measure of it) rests on a proof step that is false. Theorems 2 and 3 hold for any pushforward map, so interventional consistency does no work in them. There are no results about the sheaf. | Read |
| NOTE-051 v2 | Cairo, counterexample to the Mizohata-Takeuchi conjecture | For every C² hypersurface Σ ⊂ ℝᵈ not lying in a hyperplane (implicitly: one with a point of non-zero curvature; see corrections), and every large R, there are f ∈ L²(Σ) and a weight w = |ĥ|² with supp ĥ ⊂ B_{CR} such that ∫|Ef|²w ≳ log R · ‖f‖²₂ · sup_ℓ ∫_ℓ w (Thm 1.2 via Prop. 3.1). So the Mizohata–Takeuchi conjecture and Stein’s conjecture (Conj. 1.4) are false as stated, and the CHV route to loss-free endpoint multilinear restriction is closed. The mechanism is a lattice Q of middle-layer subset sums of N ≍ log R points on Σ, chosen so that no hyperplane meets more than 2^{d−1} of the R⁻¹-balls around Q (Lemma 3.5). | Read |
| NOTE-052 v2 | Consciousness in AI: indicator properties | The report assumes computational functionalism and takes a “theory-heavy” approach. From it the authors derive 14 indicator properties: RPT-1–2, GWT-1–4, HOT-1–4, AST-1, PP-1 and AE-1–2. The claim for them is only that more of them raises the probability of consciousness. They assess a handful of systems against subsets of the list and conclude that no current system “appears to be a strong candidate”. Transformer LLMs have “only a relatively weak case” for any GWT indicator, because a single forward pass has no recurrence or global broadcast. Perceiver arguably has GWT-1, GWT-2 and half of GWT-4 but lacks broadcast. Among the embodied agents, AdA is the likeliest to meet AE-2. Most indicators could be built with standard ML techniques. The abstract’s “no current AI systems are conscious” is stronger than anything the body shows. | Read |
| NOTE-053 v4 | Transfer entropy as a log-likelihood ratio | For a parametric Markov model f(x_t | x^k_t, y^k_t; θ) of X, the likelihood-ratio estimator T̂ = −(1/(n−k)) log Λ for the null “no dependence on Y’s past” converges almost surely to the transfer entropy T_{Y→X} (Theorem 1a). Under the null, 2(n−k)T̂ is asymptotically χ²(d), with d the difference in parameter counts (Theorem 1b). For finite-state chains the ordinary plug-in estimator is exactly this estimator, with d = (a−1)a^k(b^k−1). For a linear Gaussian VAR, T̂ is half the Granger-causality statistic. | Read |
| NOTE-054 v2 | Brain states across spacetime via whole-brain models | This is a narrative review with no new data, model or quantitative synthesis. It argues that healthy waking brain dynamics sit in a metastable regime near criticality, which whole-brain models (connectome-coupled Hopf oscillators, weakly coupled, at the edge of instability) reproduce. On its “activity landscape” picture, depression deepens particular attractors and psychedelics flatten the landscape. The depression side rests on three cited fMRI studies, one of them in remitted patients, and the review itself says “further studies will be required”. | Read |
| NOTE-055 v2 | Pilgrim et al. 2025, foundations of collective intelligence | A conceptual framework, with no model, data or derivation. It sets out individual and collective computational resources in four dimensions: sensing ΣI_i, states S_c × ∏S_i, processes F_c + ΣF_i, and actions ∏A_i (Table 1). It then maps the collective’s surplus onto familiar mechanisms (aggregation with noise σ_i²/n, distributional beliefs P(H), memory persistence T_c, division of labour). Coordination and cooperation are given as the constraints that make the trade-off, and three animal case studies are retold in these terms. | Read |
| NOTE-056 v2 | Thompson, “Who Goes Nazi?” (Harper’s, 1941) | Thompson’s answer is that susceptibility to Nazism is “something in them”, not race, nationality, creed or class. She argues it through fourteen character sketches of guests at an imagined New York party. People with an inner code, security or happiness “never go Nazi”. The humiliated intellectual, the scared speculator, the spoiled son, the labour boss and the success-chaser “would all go Nazi in a crisis”. It is a journalist’s typology from experience in Germany, Austria and France, and no data supports it. | Read |
| NOTE-057 v2 | Networks beyond pairwise interactions (review) | The review sets out the representation hierarchy for group interactions (graph and clique complex, bipartite graph, motifs, simplicial complex, hypergraph) with their operators (incidence, adjacency tensor, boundary B_k, Hodge Laplacian L_k = B_kᵀB_k + B_{k+1}B_{k+1}ᵀ with ker L_k ≅ H_k). It surveys the random models and the dynamics built on them. Its own §V makes the key qualification: linear diffusion with three-body terms “can always be reduced to” a weighted pairwise Laplacian (Eq. 35). A random walk with edge-independent vertex weights is equivalent to one on a weighted projected graph (Chitra–Raphael). Qualitatively new node-level behaviour needs nonlinear group coupling or edge-dependent weights. With those, it reports explosive or abrupt transitions and bistability: Kuramoto with triadic coupling, simplicial SIS with a discontinuous transition, and higher-order ecological models that stabilise coexistence. | Read |
| NOTE-058 v2 | Iranian NEWSCASTER social-media espionage (SecurityWeek, 2014) | SecurityWeek relays iSIGHT Partners’ claim that more than a dozen fake personas, supported by a fake news site (NewsOnAir.org), ran a social-media espionage campaign from 2011 aimed at US military, diplomatic, congressional, press, think-tank and defence targets. The purpose was credential phishing and reconnaissance. Iranian origin is inferred from targeting, “technical indicators” and a Tehran working-day schedule, and iSIGHT says it has “no information implicating the ultimate sponsor”. The article’s figure of “over 2,000” is connections to the personas, not confirmed victims. iSIGHT itself says it is “not clear … how many credentials the attack has captured”. | Read |
| NOTE-059 v2 | Peters & Adamou 2022, the ergodicity solution of cooperation | If N entities’ resources follow GBM (drift μ, volatility σ, independent noise), then pooling and sharing equally every step leaves the drift at μ, cuts the volatility to σ/√N (Eq. 3.9), and raises each member’s time-average growth rate from μ − σ²/2 to μ − σ²/(2N) (Eq. 4.1). The premium is (σ²/2)(1 − 1/N) (Eq. 4.2). With pairwise correlation ρ the effective volatility is σ√((1 + (N−1)ρ)/N), and the large-N limit is μ − σ²ρ/2 (Eqs. 5.12–5.13). | Read |
| NOTE-060 v2 | 3rd EEAS report on FIMI threats (2025) | The EEAS classifies channels in foreign information manipulation and interference (FIMI) into four tiers by their tie to a state: official, state-controlled, state-linked (covert, attributed) and state-aligned (non-attributed). It applies the scheme to 505 incidents it detected between 4 Nov 2023 and 4 Nov 2024, involving about 38,000 channels. In a filtered co-involvement graph of 2,055 recurrent channels, 20% are Russian-attributed, 3.5% Chinese-attributed and 76.5% non-attributed. The report states that the sample is illustrative and should not be used to infer general trends. | Read |
| NOTE-061 v2 | Saeedian et al. 2021, delay in generalized Lotka–Volterra | The paper studies random delayed generalized Lotka–Volterra dynamics, ẋ_i = x_i(r_i + Σ_j b_ij x_j(t−τ)), with instantaneous interactions switched off (A = 0) in every delay result. A feasible, stable equilibrium loses stability by a Hopf bifurcation at τ_c = min over eig(J) of (1/|j|) arctan(Re j/Im j) (Eq. 14), where J = diag(−B⁻¹r)B, and this matches simulation (Fig. 5b; S = 100 is stable at τ = 12 and oscillates at τ = 18). In the oscillatory regime, at τ = 20 and 22 for S ≲ 70, community-level CV falls with S while mean species-level CV rises (Fig. 6). The paper reads this as a positive diversity–stability relation but tests it against no averaging null. | Read |
| NOTE-062 v2 | Başar, Meyn & Perkins, control system theory notes | A conventional first-year graduate course in linear state-space control. It covers modelling and linearisation, LTI/LTV solutions, Lyapunov stability, controllability and observability with Kalman/Hautus tests and minimal realisations, then pole placement and observers, integral control, sensitivity, and finally HJB/LQR and a heuristic minimum principle. Its most useful non-standard content is the Pendubot thread (Chs 1, 9, 10): an observer-based design from one sensor is fragile (the compensator has an unstable pole at s ≈ 46.4), while full-state LQR has |S(jω)| ≤ 1, infinite gain margin and ±60° phase margin. Every worked example I recomputed is correct. | Read |
| NOTE-063 v2 | Vance, “DOJ Changes Course” (law-firm EO appeals) | Vance reports that on 3 Mar 2026, the day after moving to voluntarily dismiss its appeals in the consolidated law-firm executive-order cases (D.C. Cir. No. 25-5241), DOJ filed a “Motion To Withdraw Motion To Voluntarily Dismiss Appeals”, over the firms’ opposition. She calls the reversal “enormously unusual” and argues it shows DOJ serving “the whims of the president” at a cost to its credibility and the presumption of regularity. She gives further examples from Minnesota habeas contempt proceedings, the Epstein files and Senator Tillis’s call for Secretary Noem to resign. | Read |
| NOTE-064 v2 | Bourrat 2023, a coarse-graining account of individuality | Bourrat proposes that a partition of particles into collectives defines individuals when the “projected” prediction (coarse-grain at t1, then evolve the coarse-grained state) differs from the “truthful” one (evolve at the fine grain, then coarse-grain at t2) by δC = C_T − C_P < θ, across many traits (Eqs. 1–2). He argues that, because measurement and computation are finite, coarse-graining can be the only way to predict at all: in his example, 100 operations predict 10 entities for 10 timesteps or 2 collectives for 50. That indispensability is his whole case for the “quasi-ontological” status of collectives at Godfrey-Smith and Kerr’s fifth stage. Nothing is computed on any model. | Read |
| NOTE-065 v2 | Bruening 2018, lexicalism: wrong and superfluous | Bruening argues that the lexicalist hypothesis is wrong on three counts. Phrases feed word formation productively (phrasal compounds, zero-derivation from phrases, German resultative nominalizations), ellipsis and focus target both phrases and morphemes, and the claimed principled differences between the word system and the phrase system (locality, adjuncts, headedness, idiosyncrasy) do not hold. It is also superfluous: every restriction it was meant to explain follows from constraints stated over X0 vs XP and from the selectional properties of individual affixes, none of which mention “word”. So one combinatorial component should build words and phrases. | Read |
| NOTE-066 v2 | Backens & Duman, graphical calculus for Spekkens’ toy bit | Take the maximal-knowledge fragment of Spekkens’ toy bit theory with post-selected measurements, viewed as relations over {1,2,3,4}ⁿ. It has a ZX-style red–green graphical calculus that is universal (§4.3), sound (§4.4) and complete (Thm 17). Completeness goes through a proof that the toy theory’s binary “check-matrix” formalism coincides with the qubit stabilizer one (valid states SᵀJS = 0, valid transformations QᵀJQ = J, Lemma 3). With it come graph-state/local-complementation results for toy states (Thms 4–5), map–state duality (§5.2) and an rGS-LO normal form (Thms 10–11). The rewrite rules differ from the stabilizer ZX-calculus only through the phase group: Z₂×Z₂ against Z₄. That difference appears as an “11-commutation” rule in place of π-commutation (§4.5). | Read |
| NOTE-067 v2 | The sound of an axon’s growth | The paper proposes that an axon can set its length from motor-generated oscillations without reading their frequency. Two Hill-type stages turn the period (which grows with length L) into a shape change and then into a change in the mean of a contractility signal R. Coupling growth-cone protrusion (v_g c_I) against R-driven contraction (v_s c_R) then gives a stable length: about 125 µm with sub-µm (< 1 %) oscillation for the Fig. 4a parameters. In part of parameter space the final length rises as kinesin influx J0 falls, or as dynein coupling J_O falls, qualitatively as in experiments. | Read |
| NOTE-068 v2 | Tembine et al., mean-field-type games with Rosenblatt noise | The paper’s control and game results use linear state feedback, and they depend on the Rosenblatt noise only through its covariance, which is exactly fBM’s with the same H. They are therefore identical to the fBM results. The ergodic LQ gain (Thm 4), K̂ = −[b₁ + √(b₁² + 4H(1−H)b₂²q/r)]/(2b₂(1−H)), is correct and reduces to the Brownian LQR gain at H = ½. But the paper’s headline “suboptimality of noise approximation” (§VI-A, repeated for the variance-aware control, zero-sum, non-zero-sum and MFTG settings) holds only against surrogates with a different covariance; against fBM with the same H it is false. The ML claim that Rosenblatt “super-diffusion transformers” “significantly enhance the performance of generative machine intelligence models” (§XIV-C) has no model, training, dataset or experiment behind it anywhere in the paper. | Read |
| NOTE-069 v2 | Riehl & Shulman, type theory for synthetic ∞-categories | A three-layer type theory adds a directed interval 2 to HoTT. Its layers are cubes, topes (the coherent theory of a strict interval) and types, and simplices become shapes that can be mapped out of by extension types. One contractibility condition, “Segal” (unique fillers for the 2-1-horn), then yields associativity (Prop. 5.9) and 3-horn fillers (Prop. 5.21). It also makes every function a functor (Prop. 6.1), gives a dependent Yoneda lemma for covariant families (Thm. 9.5), and makes having a left adjoint a proposition when the adjoint’s codomain is Rezk (Thm. 11.23). The bisimplicial-sets semantics is sketched. Segal and Rezk types are shown to match Segal and complete Segal spaces (Props. A.21, A.25), and soundness is not proved in full. | Read |
| NOTE-070 v2 | Fridman, the Russian perspective on information warfare | Fridman argues that the Russian narrative of a “Western information war against Russia” draws on three independently developed theories: Messner’s subversion-war (myatezhevoyna), Dugin’s net-centric war and Panarin’s information war. In his account, politicisation of the narrative was not led by the Kremlin. It is a mutually reinforcing process: scholars promote it, the government writes it into doctrine and law, and a public receptive to it absorbs it. He cites Levada polling from December 2014 in which 87% saw the West as hostile and 42% said the hostility took the form of information war. His conclusion is that the truth lies “somewhere in the middle” between top-down manipulation and bottom-up demand. | Read |
| NOTE-071 v2 | Shabrina, Arcaute & Batty 2021, Airbnb and London housing | Using Inside Airbnb data, “possible misuse” is defined as entire-home listings available for more than 180 days a year whose host has 2 or more listings. On that definition, about 0.16% of London’s housing stock (≈5,300 homes) was possibly misused in 2018, rising to 3.5–7% in a few central LSOAs. Across LSOAs, misuse correlates weakly with purpose-built flats (r = +0.28), private renting (+0.33) and low dwelling-type entropy (−0.14). In a 33-borough OLS with 4 predictors, logged 2015 misuse has β = 0.084 (p = 0.001) on a min–max-normalised 2015–17 rent change. The paper translates this as “a 100% increase … up to 8%” in rent, which is £90 a year. | Read |
| NOTE-072 v2 | Hance et al., wavefunctions as knowledge and reality | The paper argues, informally and without formal results, that Harrigan–Spekkens’ ψ-ontic/ψ-epistemic are contradictories only by stipulation. On the informal senses, “represents reality” and “represents knowledge”, a wavefunction can be both. It offers a weaker sufficient condition for “epistemic” (Eq. 6: for some ψ, A, S, the response function A(S|λ) is not equal to the Born probability p^ψ_A(S) throughout Λψ), which non-overlapping models can meet. It concludes that PBR “shows that wavefunctions cannot overlap on state space, but it says nothing about whether they are epistemic in the broader sense”, so it “does not rule out all epistemic models” (§V). | Read |
| NOTE-073 v2 | Haspelmath 2011, the indeterminacy of word segmentation | Haspelmath tests ten morphosyntactic criteria for wordhood and finds that none is necessary and sufficient. No combination picks out what linguists write between spaces, and published test batteries pick criteria opportunistically (Table 1: nine studies, no two with the same battery). Hence (41, p. 65): “Linguists have no good basis for identifying words across languages, and hence no good basis for a general distinction between syntax and morphology”. A fuzzy “word” would rescue the distinction only if units on the boundness continuum were shown to cluster, and that is untested (§6). | Read |
| NOTE-074 v2 | The epic story of maximum likelihood | Stigler gives a history of maximum likelihood from Lagrange (1769) to Le Cam (1953). Fisher gave three optimality arguments. The 1922 one rests on the false belief that ML estimates are always sufficient. The 1925 “ANOVA” one derives the information inequality V ≥ 1/I(θ) from Var X = E Var(X|T) + Var E(X|T), treating approximate normality as exact. The third, sent privately to Hotelling in 1930, holds for multinomial models and smooth degree-0-homogeneous estimators, and was published only in disguise in 1935. Stigler’s verdict is that the Neyman–Scott growing-parameter example (Wald 1938, published 1948) is the practically important failure. He calls Hodges’s 1951 superefficiency example “an ingenious but minor technical achievement”, because the superefficiency set has Lebesgue measure zero (Le Cam 1953). | Read |
| NOTE-075 v2 | Surface optimization in physical networks | The degree counts in Fig. 1d show k = 4 nodes making up 4.6–17.7% of branch points across the six datasets. The pooled 16.6% is 96% human-neuron nodes. Bifurcation angles also fail to peak at 2π/3. From this the authors infer that local branching minimises sleeve surface area under a minimum circumference w, not wire length. For a regular tetrahedron their numerical minimiser merges two bifurcations into a trifurcation at χ = w/r ≈ 0.83, and a thin branch sprouts orthogonally below ρ = w′/w ≈ 0.6. Per-dataset empirical thresholds are ρ_th = 0.52–0.92. The “exact mapping” to string-theory worldsheets covers only the unconstrained minimal-area problem. The SI says the implemented method yields surfaces that are only locally area-minimising (§5). | Read |
| NOTE-076 v2 | REST2 MD simulations of disordered proteins | A how-to chapter for REST2 enhanced sampling of intrinsically disordered proteins in GROMACS 2022.5 with PLUMED 2.9.0, worked on the α-synuclein C-terminal fragment (residues 121–140) with the a99SB-disp force field and water. The example uses 10 replicas, a solute-temperature ladder from 300 K to 450 K, swap attempts every 1.6 ps, and a ≥ ~20 % acceptance target. Its load-bearing methodological point is that high swap acceptance “is not, in isolation, sufficient evidence of robust conformational sampling or convergence”. Convergence has to be judged by comparing demultiplexed replicas’ structural distributions, with blocking-analysis errors. | Read |
| NOTE-077 v2 | Cuffaro & Hartmann, The Open Systems View | The paper argues philosophically, not formally, that the quantum theory of open systems “GT” is more fundamental than standard closed-system quantum theory “ST”. GT treats states as density operators that evolve, in general, non-unitarily, and it admits not-completely-positive maps. The ontic and epistemic cases each win only on a second, interpretation- or practice-laden criterion: OntFund-2 and EpFund-2. On the first, formal criteria (OntFund-1, EpFund-1) the two frameworks tie, and the authors say so because Stinespring dilation and dropping the Lindblad terms translate in both directions (§4.1, §4.2.1). Explanatory fundamentality is granted only deflationarily (ExFund-1), and the authors recommend dropping the notion (§4.2.2). The step from there to “the open systems view is fundamental tout court” (§4.3) rests on the special sciences and on “there are no other options”. | Read |
| NOTE-078 v2 | Filip, Notes on the Multiplicative Ergodic Theorem | Expository notes that prove the Oseledets theorem in four ways. §2 uses projective invariant measures and a splitting lemma, without Kingman. §3.5 checks Kaimanovich’s regularity criterion in the symmetric space GLₙ/Oₙ, using Kingman. §4 proves the Karlsson–Ledrappier horofunction theorem (for µ-a.e. ω there is a horofunction h_ω with −(1/N)h_ω(g_ω⋯g_{T^{N−1}ω}x₀) → l) for isometries of proper metric spaces. §5 gives an L² “mean” version via Monod’s direct integrals of CAT(0) spaces and Karlsson–Margulis tracking, with an L² mean Kingman theorem. Two of the notes’ own derivations do not work as written: Proposition 3.4.8(iii) is mis-stated, and the Lemma 5.1.5 step in the tracking proof does not apply as claimed. The main theorems are standard and not in doubt. | Read |
| NOTE-079 v2 | Ouazan-Reboul et al. 2023, non-reciprocal metabolic cycles | For M chemotactic catalyst species in a closed cycle, where species m converts chemical m into chemical m+1, the linearised long-wavelength interaction matrix is circulant, so its eigenvalues are Re λ_ℓ = −(αρ0/D)(μ(p)−μ(s))[1−cos(2πℓ/M)] and Im λ_ℓ = (αρ0/D)(μ(s)+μ(p)) sin(2πℓ/M) (Eq. 5). The homogeneous state is unstable exactly when the species are self-attracting, μ(p) − μ(s) < 0 (Eq. 6). For even M the leading mode is real, with stoichiometry (1,−1,1,…), so same-parity species co-aggregate. For odd M the leading mode is a complex pair, and with chasing interactions this gives persistent “invasion–explosion” oscillations. The nonlinear phases were checked by Brownian dynamics at M = 5 and M = 6 only. | Read |
| NOTE-080 v2 | Barandes, The Stochastic-Quantum Correspondence | Take any N×N stochastic transition matrix Γ(t←0) on a configuration space. Writing it entrywise as Γ_ij = |Θ_ij|² = tr(Θ†P_iΘP_j) (Eq. 15) is always possible, and the paper calls it the stochastic-quantum dictionary. Choosing Θ unitary (by Stinespring dilation to ≤N³ configurations, §3.4) makes Γ unistochastic. The Born rule in the configuration basis (Eq. 23), the Schrödinger equation (Eq. 35, with H ≡ iħ(∂U/∂t)U†) and interference (Eq. 43, the gap between Γ(t←0) and |U(t←t′)|²|U(t′←0)|²) then follow by definition or short algebra. The Born rule for non-diagonal observables (Eq. 78) is derived by reading a measuring device’s configuration, given a composite unitary that produces Eq. (73). | Read |
| NOTE-081 v2 | The No-U-Turn Sampler (NUTS) | NUTS removes HMC’s step-count L. It doubles a leapfrog trajectory forwards and backwards in random directions until some balanced subtree satisfies (θ⁺−θ⁻)·r⁻ < 0 or (θ⁺−θ⁻)·r⁺ < 0. It keeps detailed balance by slice sampling and by excluding states that could not have regenerated the tree. With ε set by a dual-averaging scheme (γ = 0.05, t₀ = 10, κ = 0.75, target δ ≈ 0.6), it matched the best hand-tuned HMC in ESS per gradient on two logistic-regression posteriors. It beat that HMC by about 3× on a 250-D Gaussian and on a 3001-D stochastic-volatility model (§4.4). | Read |
| NOTE-082 v2 | Barnum, Gaebler & Wilce, ensemble steering and self-duality | A bipartite state ω steers its B-marginal iff ω̂ : [0,u_A] → [0,ω_B] is a strong quotient map of ordered sets (Thm 5.4). When ω̂ is injective and the marginal is interior, a steering state is an order-isomorphism (Cor. 5.5). With Thm 4.1/Cor. 4.2, it follows that universal self-steering makes every irreducible state space homogeneous and weakly self-dual (Prop. 5.8). The step from there to C*-algebraic quantum theory needs strong self-duality, which the paper does not derive, and a Hanche-Olsen correspondence it defers (“as we will establish elsewhere”, §6). | Read |
| NOTE-083 v2 | Garg & Fetzer, causal claims in economics | GPT-4o-mini is run in nine passes per paper over the first 30 pages of 44,852 NBER/CEPR working papers. Edges kept in at least 4 of 9 passes, JEL-mapped, give “claim graphs” in which the share of edges backed by DiD/IV/RCT/RDD/synthetic control rises from 7.7% (1990) to 31.7% (2020). In year-fixed-effect-only regressions, doubling causal edges is associated with +1.36 pp top-five probability and +11.2% citations, while non-causal counterparts are flat or negative. The validation checks paper-level method labels, and only weakly: RCT and field labels have precision ≤ 0.10. It never checks the edges themselves against human labels. | Read |
| NOTE-084 v2 | Moynihan, “Mike Johnson’s Institutional Betrayal” | Moynihan argues that, in the 2026 DHS appropriations lapse, Speaker Johnson refused a vote on the Senate’s bill (which funded DHS except ICE and CBP) and passed a Trump-backed full-DHS bill, then recessed. In doing so he backed a presidential memo directing TSA pay from unspecified funds with a “reasonable and logical nexus to TSA operations”. Moynihan calls this ceding Congress’s power of the purse. His distinction is that the President may pay staff during a lapse only from an identifiable appropriation, which exists for ICE and CBP (under the One Big Beautiful Bill Act) and not for TSA. | Read |
| NOTE-085 v2 | Local separators and community structure | This is a comparison of the authors’ local 1- and 2-separator decompositions against Infomap, Label Propagation, Leiden and Louvain (igraph) on five sparse graphs (62 to 9,133 nodes). Local separators score lower overlapping modularity than the modularity optimisers everywhere, and lower than Infomap on 3 of 5 graphs (Table 2). Their edge is confined to high density thresholds on the two road networks, where the best radius gives a handful more qualifying clusters: about 12 against about 5 at β ≥ 1.25 on Euroroads, and about 50 against about 40 for Infomap at β ≥ 1.5 on NRW (Figs. 3–4). On Netscience all methods are similar. At δ = 1 on both road networks, and at δ = 1.25 on NRW, Infomap yields more qualifying clusters than any local-separator setting. | Read |
| NOTE-086 v2 | I-MMSE: mutual information and MMSE in Gaussian channels | Let Y = √snr·X + N with N ~ N(0,1) independent of X, and let X have any distribution with E X² < ∞. Then d/dsnr I(X; √snr X + N) = ½·mmse(X | √snr X + N) in nats, equivalently I(snr) = ½∫₀^snr mmse(γ) dγ (Thm 1, Eq. 47). The vector form is d/dsnr I(X; √snr HX + N) = ½·E‖HX − H·E[X|Y]‖² (Thm 2). In continuous time, the same identity combined with Duncan’s I = (snr/2)·cmmse gives cmmse(snr) = (1/snr)∫₀^snr mmse(γ) dγ (Thm 8). | Read |
| NOTE-087 v2 | Kerr County Commissioners’ Court transcript, 27 June 2016 | This is a routine regular session of the Kerr County Commissioners’ Court, all motions 4–0. In the reports item (tr. 95–98), Commissioner Moser announced a steering-committee meeting “this Thursday” on a Kerr County flood warning system. He said: - an engineering analysis of the entire system would cost roughly 20,000; - Comal County spent about $320,000 on 8 sensor locations plus central command and control; - a countywide system might be “a million dollar thing”. Commissioner Baldwin said the old phone chain “still works” and objected to “these damn sirens going off in the middle of night”. | Read |
| NOTE-088 | The Homological Nature of Entropy | On a finite probability space, take an information structure S (a set of partitions closed under joins that have a common refinement in S and containing the trivial partition) and a probability family Q complete for it. The information cohomology H*(S;Q) is computed by a Hochschild-type bar complex whose action is Shannon’s averaged conditioning. If S is connected and “sufficiently rich” and cochains are measurable, then H¹ is one-dimensional and spanned by Shannon entropy (Thm 1). This makes entropy the unique measurable 1-cocycle, up to one multiplicative constant per connected component. In the unitary-invariant quantum case H¹_U = 0: Shannon entropy is the coboundary of minus the von Neumann entropy, which is the unique invariant 0-cochain with that property up to an additive constant (Thm 3). The tree (“arborescent”) version again gives H¹ spanned by entropy (Thm 4). | Read |
| NOTE-089 | Nagel: what is it like to be a bat | An organism is conscious if and only if there is something it is like to be it. That subjective character is tied to a type of point of view. Every functional, intentional or causal-role analysis leaves it out, since each is compatible with its absence. Psychophysical reduction therefore cannot follow the usual pattern of dropping a point of view in favour of a more objective description of the same thing: for experience, that leads away from the phenomenon. Physicalism is left not refuted but not yet understandable. The closing proposal is an “objective phenomenology” of the structure of experience. | Read |
| NOTE-090 v2 | LLMs are stochastic measuring devices | The chapter argues by analogy that deep neural networks are “stochastic measuring devices”. Training alters the parameters in response to data, so that the resulting configuration carries information about the data (“training is measurement”). The trained weights are a model, and generation is simulation. DNNs are stochastic because random initialisation and non-convex loss mean runs need not converge to the same weights, failing Baird’s “regularity” condition. The problems of interpreting model states and generated text are therefore the familiar problems of instruments, models and simulations. The problem of interpretable AI is an instance of the coordination problem in the philosophy of measurement. | Read |
| NOTE-091 v2 | Pernu — Mental causation via neuroprosthetics? | The interventionist/difference-making case for nonreductive mental causation from BCIs (List & Menzies 2009; Menzies 2015; Woodward 2008a,b, 2017) misplaces multiple realisation. What the ensemble recordings show is that one cortical-level variable N (the ensemble’s average firing) is realised by many single-neuron patterns N1, N2. Each intention M corresponds to one value of N. So the counterfactual contrast “∼M □→ ∼B true, ∼N □→ ∼B false” fails, and neuroprosthetics supports mental causation only by identifying M with N, not nonreductive physicalism. | Read |
| NOTE-092 v2 | Quillien — Luck and intentional action | Across three Prolific studies (N = 198, 673, 142; Likert 1–7), judgments that “X happened because the agent wanted X” track intentionality judgments under manipulations of luck. Causation is the strongest predictor of intentionality: standardized β = .46, .56, .53, against know-how β = .33, .20, .27 and probability-raising β = .14, .16, .10. Across the 12 condition means, r = .98. Causation only partly mediates the effect of luck (64%, 45% and 49%; exploratory analyses). As the causal account predicted, Study 3 found that the effect of Process (normal vs mix-up) on intentionality is larger when the agent knows how the buttons work (interaction F(1, 423) = 32). In the morally neutral Kraemer vignette, intentionality and causation came apart. | Read |
| NOTE-093 v2 | Bruckner — Welfare Subjects and Autopoiesis | Bruckner proposes, by abduction and not deduction (§4), that being autopoietic is sufficient, not necessary, for being a welfare subject. An entity is autopoietic when it “sustains, maintains, and renews itself in a way that responds and adapts to its environmental conditions”. On this view insentient plants and a hypothetical non-sentient self-maintaining car (“Tessler”) are welfare subjects, while engines with governors, thermostats and heat-seeking missiles are not. He answers the charge of absurd obligations in two ways: welfare value may not generate agent-neutral reasons at all, and if it does, the reasons concerning non-conscious subjects are “extremely weak” (Bradford 2023). | Read |
| NOTE-094 v4 | Nahas & Sachs — What’s at stake in naturalizing teleology | The paper argues that “naturalizing teleology” serves at least two relatively autonomous projects with different success criteria. One is scientific: whether an organism-centred account improves biology, which requires operationalisable models that may trade truth for usefulness. The other is philosophical: whether organismal teleology reshapes the liberal-versus-scientific naturalism debate about mind in nature, which requires truth but no operationalisation. It applies the distinction to one recurring dispute, the demarcation of teleological systems from dissipative structures. In the scientific context, models “cannot and need not” demarcate (§4.1: Cusimano & Sterner; McShea & Babcock). In the philosophical context, preferences between accounts turn on unstated commitments (§4.2: García-Valdecasas’s Aristotelian case for Deacon over the Organizational Approach). | Read |
| NOTE-095 v2 | Morganti — From OSR to metaphysical coherentism | Morganti argues from a survey rather than proving anything. Strong, moderate and contextualist OSR each fail as metaphysics: particle kinds have intrinsic features no group-theoretic analysis reduces, and the argument from permutation invariance is inconclusive. What OSR gets right about symmetry, entanglement and particle kinds is better captured by “metaphysical coherentism”: object-like entities (in one domain) stand in symmetric partial ontological dependence on one another. Cycles of such dependence can be kept irreflexive, and so explanatorily non-trivial, by relaxing transitivity (quasi-transitivity) or by making only partial dependence symmetric. | Read |
| NOTE-096 v2 | Karpenko — Defending informational structural realism | Karpenko argues against V.E. Terekhovich’s non-eliminative OSR, which holds that entities and structures exist but “objects do not exist”. He extends Floridi’s informational structural realism with one thesis: empirically equivalent but structurally different models (wave/particle/field descriptions, superstring dualities, AdS/CFT holography, equivalent programs in digital physics) have equal ontological standing. Since nothing stands “behind” them with a privileged configuration, the descriptions, i.e. information, are themselves fundamental, and theoretical objects exist as ontological primitives. There is no formal argument, and the physics is presented by assertion, with several errors. | Read |
| NOTE-097 v2 | Health and disease beyond social justice | Kukla’s “institutional definition” makes a condition a health condition iff medicalising it would be best for collective wellbeing. Veit argues that any purely normativist definition of this kind defeats itself for two reasons. First, leaving “social justice” undefined lets a majority with other values medicalise what Kukla wanted to protect. Second, unless the institution of medicine is fixed from outside, the medical toolkit co-evolves until “health would simply become justice” (p. 15). His remedy is pluralism: at least three separate accounts, with justice linked to health empirically, not conceptually. | Read |
| NOTE-098 v2 | Leonelli — Philosophy of Open Science | Leonelli argues that mainstream, institutional Open Science treats openness as the unlimited, digital sharing of research objects, a transparency-first ordering running transparency → quality (reproducibility) → inclusion. This rests on an object-oriented, “resourcist” epistemology of science. Four implementation cases (GISAID COVID data, open-source software stigma, crop-data linkage, the reproducibility “crisis”) show it can narrow epistemic diversity and entrench epistemic injustice, which lowers reliability. She proposes instead “openness as judicious connection”, grounded in a process-oriented view of research as the cultivation of “active knowledge”. Her Figure 2 inverts the ordering to start from inclusion, and sharing becomes “neither a necessary starting point nor a sufficient condition” for reliable OS (p. 8). | Read |
| NOTE-099 v2 | Floridi — A defence of informational structural realism | Floridi argues informally in four steps. (1) ESR and (non-eliminativist) OSR are compatible once indexed to levels of abstraction. ESR’s minimal commitment to knowable relations holds at a first-order LoA. At a reflective (“transcendental”) second-order LoA, a second Ockham principle licenses taking the relata to be structural objects. (2) The relata-need-relations regress is blocked by Eddington’s “package hypothesis”: not all relata are logically prior to relations. (3) Structural objects are informational objects, clusters of data understood as concrete “differentiae de re”, made scalable by the object-oriented-programming model. (4) Together these give “informational structural realism”, on which “the ultimate nature of reality is informational” (p. 32). | Read |
| NOTE-100 v2 | Bourrat — Reproducees, reproducers, Darwinian individuals | Bourrat builds a nested vocabulary. A reproducee is a B that comes after A, is caused by A, and is of A’s relevant class. A reproducer is a reproducee with reproductive autonomy, meaning it can reproduce across a range of backgrounds. A Darwinian individual is a reproducer with high reproductive causal control, meaning heredity survives as the parent’s description is made finer. On that vocabulary, genes of multicellular organisms are, like hearts, mere reproducees, but with high control. Material overlap is necessary for reproducers, which are whole life cycles, and unnecessary for reproducees, so Griesemer and Godfrey-Smith partly talk past each other. Both quantities get an information-theoretic recipe (conditional MI after Bertschinger et al. 2008 for autonomy; interventional MI across grains, Griffiths et al.’s INF, for control), and neither is computed. | Read |
| NOTE-101 v2 | Luque — Philosophical analysis of the Price equation | Luque argues that the Price equation, Δz̄ = Cov(w, z) + E(wΔz) (eq. 1, p. 7), is a Kuhnian “generalization-sketch”, like f = ma. It is not a model, has no predictive power on its own, and becomes empirical only when a specific model interprets it. On that reading the critics’ charges (van Veelen 2005; van Veelen et al. 2012; Nowak & Highfield 2011) that it is “a tautology” and “lacks predictive power” are either false or ask too much, and he recommends that evolutionary biologists adopt it as their unifying framework. | Read |
| NOTE-102 v2 | Bottou & Schölkopf — Borges and AI | A short essay, not an argument with evidence. It claims that a “perfect language model”, defined as sampling each next word from a random occurrence of the current text in the infinite collection of all plausible texts, is a fiction machine governed by “narrative necessity”, to which “neither truth nor intention” matters. On that view hallucinations “are just confabulations”, chat-bot answers take the role the user’s framing implies, and fine-tuning and RLHF are attempts to prune the garden “against its nature”. It warns that power over what LLMs write becomes “power over what we think”. | Read |
| NOTE-103 v2 | SEP — Philosophy of statistical mechanics | The entry argues that statistical mechanics has no canonical formalism but three umbrellas — Boltzmannian SM, the Boltzmann Equation and Gibbsian SM — and that every live account of the approach to equilibrium (ergodic, typicality, Mentaculus, long-run residence time, coarse-graining, interventionist, epistemic) survives Loschmidt’s and Zermelo’s objections only by giving up strict irreversibility or adding something outside the isolated dynamics; it closes on the unresolved “schism” that physicists compute in GSM while philosophers explain in BSM. | Read |
| NOTE-104 v2 | Schwitzgebel — AI and Consciousness | A book-length sceptical argument that neither introspection, conceptual analysis nor any current theory (GWT, HOT, IIT, local recurrence, unlimited associative learning, biological views) can tell us whether near-future AI is conscious. The best sceptical argument, Mimicry, only undercuts the inference from humanlike text to consciousness and does not show absence. On the Leapfrog Hypothesis the first disputably conscious AIs will be person-like, and the question will then be settled socially rather than scientifically (the “Social Semi-Solution”). | Read |
| NOTE-105 v2 | Dorato — Events and the Ontology of Quantum Mechanics | Dorato argues, without formal results, that events are the metaphysical category best suited to quantum mechanics. An event reading fits GRW flashes, GRW matter density and Bohmian worldlines, and also the antirealist views of ψ held by Bohr, Rovelli, Haag and Pashby. Because it is the same across interpretations, he calls it “interpretation-independent” (p. 12). Where ψ needs a realist reading, it should be read as intrinsic dispositions of events. Esfeld et al.’s view has the opposite structure: bare matter points plus a single holistic power of the universal configuration. Dorato argues that view is unintelligible, and that it must change its ontology when it passes from the universal wave function to the effective one (pp. 13–15). | Read |
| NOTE-106 v3 | Angius et al. — Making sense of transformer success | Current attempts to explain transformer language models’ competence fall into three kinds, and the paper maps each onto an explanatory form from philosophy of cognitive science: machine psychology is Cummins-style functional analysis, induction-head work is Machamer–Darden–Craver mechanistic explanation, and NLM–fMRI brain-score studies are a bidirectional “co-simulation”. Its only thesis is that these do not differ from how cognitive science explains humans. Functional analyses are to be reduced to mechanisms as “mechanism sketches”. The paper rests on existing literature and adds no new analysis or data. | Read |
| NOTE-107 v2 | Religion and Science (SEP) | A survey, not an argument. It reports that the scholarly field rejects the conflict model the public holds, and it finds Barbour’s four-way taxonomy (conflict, independence, dialogue, integration) influential but neither exhaustive nor exclusive. Its survey of five traditions shows the relation varies with creed and colonial history, and it describes the field fragmenting into claim-by-claim “science engaged theology”. Its metaphysical content is concentrated in §1.2 (methodological vs ontological naturalism) and §3.1 (divine action under deterministic, chaotic and quantum physics; primary vs secondary causation; chance and providence). | Read |
| NOTE-108 v2 | Søgaard — Is unsupervised clustering somehow truer? | Søgaard rebuts two arguments that unsupervised clustering is epistemically superior to supervised classification. The No-Bias Argument fails because clustering is also sensitive to sample bias (a toy example moves the boundary from x = 7 to x = 6), and it is more sensitive to representation bias. The Simplicity-Truth Argument fails because clustering is also function estimation and overfits in the same way (Hansen & Larsen 1996). From the fact that every clustering hypothesis is in a supervised classifier’s hypothesis class, he concludes that supervised classification is “at least as justified”, but that positive step is under-argued. | Read |
| NOTE-109 v2 | Bender et al. — What Lives? (definitions of life) | Three LLMs (Claude 3.7 Sonnet, GPT-4o, Llama 3.3 70B), each run 3 times on both orderings of every pair, rated 68 hand-solicited definitions of life on a −1 to 1 “correlation” rubric. The averaged matrix, cut by complete-linkage clustering at an elbow, gives 8 clusters, 45/68 of them (66%) in “Cognitive Autonomy” (n=24) and “Dissipative Self-Organizing Systems” (n=21). The clusters are weak: the repo’s own saved statistics give an overall silhouette of 0.079, and cross-model agreement is an unadjusted Rand index of 71–79% against a chance level of about 62–74%. The headline that life is “a continuous semantic landscape” is not tested against any alternative. | Read |
| NOTE-110 v2 | Belot — Quantum states for primitive ontologists | Inside primitive-ontology Bohmian mechanics, Belot compares four readings of the quantum state: a field on configuration space, a multi-field on 3-space, a law, and a history of velocity dispositions of the particle system. Every reading except the multi-field carries a hard open question: why the world looks 3-dimensional, whether laws can be time-indexed, and whether dispositions lose content. The last is shown by the particle in a box, where every energy eigenstate φn = sin(πnx) induces the same at-rest disposition. The orthodox should prefer the multi-field reading; Belot, on van Fraassen’s view of interpretation, prefers to keep the others alive. | Read |
| NOTE-111 v2 | Baedke et al. — Unknotting reciprocal causation | The paper gives an epistemic, not a metaphysical, tool for organism–environment reciprocal causation. The loop is “unrolled” into two ordered series of states, O_n and E_n, joined by interventionist (Woodward) causal arrows, and an experienced-environment node Ex_n is added as the interface. Its authors argue that this one diagram keeps an epistemically set organism–environment boundary and maps constitutive, mediational, relational, relocational and physical niche construction onto shared causal patterns. They support this with worked cases, including two multi-species ones (bumblebee–eggplant; rumen microbes–ruminant host). | Read |
| NOTE-112 v3 | Poltorak — Wave-function realism and causal closure | A closure principle has two tacit parameters, its domain and its completeness relation (causal, dynamical or explanatory). Wave-function realism falsifies spatiotemporal-domain closure (STC) but is compatible with fundamental-physical closure (FPC), so there is no “trans-domain causal breach”. The physicalist is left with a dilemma: STC is too narrow, and FPC needs an independent criterion of physicality plus a dynamical-to-causal bridge. The paper tests this across primitive-ontology, spacetime-state, multi-field, Everettian, nomological and dispositional readings. | Read |
| NOTE-113 v2 | Status distrust of scientific experts | Desmond gives a “how-possibly” argument, not a demonstration, that stubborn distrust of scientific experts can be valid reasoning. A low-status truster who is vulnerable in collective decision-making (Premise 1) and has reason to think the prevailing “service-for-prestige” ethos leaves out their core interests (Premise 2) has reason to distrust a high-prestige expert because of that prestige (§6, p. 16–17). The paper explicitly declines to say when those premises are true. | Read |
| NOTE-114 v2 | SEP — Biological individuals | A survey that maps biological individuals by crossing two axes: organism / some parts of organisms / some groups of organisms, against living agent (physiological) / Darwinian (evolutionary) individual. The result is nine regions, each given one example (fruit fly, gene, eusocial colony, lysosome, clade, heart, coral reef, virus, squid+Vibrio). “Part” is never defined, and the entry gives no criterion for which parts or groups count: the placements are the authors’ tentative judgements, “moving from less contentious to more contentious examples” (§7). | Read |
| NOTE-115 v2 | Meincke — A process view of pregnancy | Meincke argues that substance ontology forces a binary count of individuals. The Containment View fails empirically, following Kingma. Kingma’s Parthood View either loses foster–neonate identity (“Parts-of-Substances”) or cannot count consistently (“Substances-as-Parts”). If organisms are autopoietic processes, a pregnant individual is instead an asymmetrically bifurcating “hypercomplex” process. The foster is “something in between zero and one” and the whole is “something in between one and two”, and the bifurcation runs on past birth through lactation (“postnatal pregnancy”). | Read |
| NOTE-116 v2 | Schwitzgebel & Sinnott-Armstrong — Sacrificing humans | Each book’s own principles, read at face value, can make human interests outweighed by insects in aggregate or by near-future AI. Each author then retreats to moderate near-term advice without principled grounds: Birch through human-centred citizens’ panels, Sebo through contingent “relational” and “co-beneficial” considerations, Keane through deference to slowly adapting cultures. The reviewers defend only the conditional (“given recent science, common grounds of moral standing put human priority under serious threat”) and “take no stand on ponens vs. tollens” (§1, p. 6; §5). | Read |
| NOTE-117 v2 | Drayson — What motivates mental fictionalism? | Drayson argues that Toon’s two motivations for mental fictionalism both fail. The negative argument needs “committed to internal, intentional, causal states ⇒ committed to the representational theory of mind” (her Premise 2), which is false because non-representational functionalism (Lewis, Putnam, Loar) supplies such states. And Toon’s positive argument, that pretence lets us genuinely assert that a person is in an overall state S that causes their behaviour, gives him a reason to identify S with the belief and so to be a realist rather than a fictionalist. | Read |
| NOTE-118 v2 | Belot — Time and change in mechanics | For theories with ideal existence, uniqueness and a dynamical time-translation group, time is three intertwined ℝ-actions (on spacetime, on the symplectic space of solutions, and on the isomorphic space of initial data), and change is a slicing-indexed family of functions on those spaces. Singular dynamics, gauge freedom and time-dependence each damage this picture in a repairable way. Spatially compact vacuum GR breaks it, because the reduced Hamiltonian vanishes (h ≡ 0) and there is only one canonical isomorphism between the reduced spaces. That is the problem of time. It is not an artefact of the 3+1 split, it does not show change to be illusory, and it is absent from asymptotically flat GR and from artificially generally covariant theories. A parameterized “geometric time”, such as CMC, restores change and, in the CMC case, a time-dependent Hamiltonian flow. | Read |
| NOTE-119 v2 | Evangelion and the desperate search for meaning | A popular-philosophy chapter that reads Evangelion’s characters as seeking meaning first in piloting (duty, recognition), then in connection with others, frustrated by Schopenhauer’s porcupine (hedgehog) dilemma. It argues that the failure of Instrumentality shows that a self, and so meaning, exists only through contrast with and separation from others: “without it [otherness], the self cannot exist” (p. 9). Meaning comes from human connection “but maintaining some distance” (p. 10). | Read |
| NOTE-120 v2 | Better to be a pig dissatisfied than a plant satisfied | The paper argues conditionally. Suppose (A1) sentience comes in degrees, (A2) plants may be “quasi-sentient”, and (A3) moral status comes in degrees and is fixed by degree of sentience. Then plants may have partial moral status, generating “some” obligations that are “outweighed by animal interests in most cases” (Table 1). Animals keep prima facie priority, so granting plants moral status “does not require” treating eating plants and eating pigs alike. The authors propose assigning plants “a very low value” of moral status until evidence accumulates (p. 13). A1–A3 are assumed, not argued, and A2 rests on a survey of contested plant-behaviour findings. | Read |
| NOTE-121 v2 | Elshatlawy et al. — Generalized theory of observers | The paper defines a “minimal observer” as a finite-state transducer with a boundary: a tuple O = (X, Y, Z, f, g, B) with |X| > 1, |Y| ≥ 1, |Z| ≥ 1 and feedback closure (Def. 4.1, p. 57). It then asserts, without derivation, that measurement outcomes, reference frames, coarse-graining and the quantum–classical cut are all defined by such observers. The paper’s only formal results are that isomorphism of these machines is an equivalence relation (“Theorem 2”, p. 93), and a complexity bound C(O) ≥ log 2 (Prop. 4.1, p. 94) whose correction term Λ is never defined and whose proof supports only C(O) ≥ 0. | Read |
| NOTE-122 v2 | Barrett et al. — IIT: good, bad and misunderstood | A position paper with no new formal result. It argues four things. IIT’s algorithm is undefined whenever any spatial, temporal or state graining of a system is non-Markovian (Barrett & Mediano 2019), and so gives no output for brains; it cannot handle unbounded continuous state variables; and it has never been computed on any real system. PCI and other “approximations” of Φ are proxies, capturing at most two of the six axioms. The theory would need recasting in continuous fields (the EM field) to fit the standard model. Against critics, the authors hold that IIT can be read with a multi-dimensional measure of global state (mean Φ, variance of cause-effect-structure quantities, structural complexity), on which Aaronson’s inactive expander grid is only minimally conscious, and that IIT’s implied “tiling” panpsychism is no worse than any rival metaphysics. | Read |
| NOTE-123 v2 | Freeborn — A Model of Understanding in Deep Learning | Freeborn defines “systematic understanding” as four conditions: an internal model, non-memorizing tracking of a property, bridge principles fixed in the deployed pipeline, and derivation by the agent itself. Four small demonstrations (the genus of a torus, Mars’s eccentricity e≈0.096 with Kepler’s form built in, grokked modular addition mod 113, and Othello-GPT from Li et al.) show it can be met. The Fractured Understanding Hypothesis (§7.5), which the paper argues for but does not test, says the understanding deep networks reach is characteristically symbolically misaligned, non-reductive, locally fractured, proxy-dependent and representationally fragmented. | Read |
| NOTE-124 v3 | McKenzie — Emergence from physics to computer science | Sole-authored survey by a condensed-matter physicist. It takes novelty (a property the parts lack) as the defining mark of emergence and sets it against twelve other characteristics in §2. The six “objective” ones are discontinuities, order, modification of parts, universality, diversity and mesoscale modularity. The six “subjective” ones are self-organisation, unpredictability, irreducibility, contextuality/downward causation, complexity and intra-stratum closure. Case studies from the Ising model to Schelling segregation and LLMs show that each can come apart from novelty: novelty without discontinuity (Kondo, Fermi liquids, spin ice), without unpredictability (BKT, spin ice), and with reduction (Butterfield). §22 sides with weak emergence and argues that strong-emergence claims from molecular structure are weak. | Read |
| NOTE-125 v2 | Dispositions without conditionals | Proposes, and explicitly does not claim to have shown superior, a “possibility conception” of dispositions — a disposition is individuated by its manifestation alone (“a disposition to M, full stop”) and its modality is possibility, graded for terms like ‘fragile’ as manifestation in a sufficient proportion of maximally varied cases (centred worlds), and plain possibility for terms like ‘breakable’; the defence rests on the semantics of ‘-able’ adjectives and a COCA survey (226 relevant uses of ‘disposed to’, none ascribing a philosophers’ disposition to an inanimate object). | Read |
| NOTE-126 v2 | Worrall — Evidence in medicine and EBM | Worrall argues that the EBM evidence hierarchy has no sound general rationale for giving randomisation extra epistemic weight, even though it lets high-quality RCTs “trump any number of observational studies”. He examines five standard arguments. Four fail: (a) Fisher’s significance-test logic, (b) control of unknown confounders, (d) that observational studies “exaggerate” effects, and (e) probabilistic causality. The fifth, (c) selection bias, is a “cast-iron argument”, but it supports only taking allocation out of the clinicians’ hands, and randomisation is one way to do that. What matters is balance on plausible confounders, a placebo or active control and blinding. Whether balance comes from randomising or from matching “seems epistemically unimportant”, and historically controlled trials can give strong evidence for large effects. | Read |
| NOTE-127 v2 | Holik et al. — Quasi-set theory for a quantum ontology | The paper argues, with no new theorem, that the Lombardi–da Costa ontology of properties for quantum mechanics can be stated in Krause’s quasi-set theory Q. On that ontology a system is a bundle of I-type-properties (instances of universal type-properties, represented by the algebra of observables) with no principle of individuality. For each property instance, the indiscernible instances form a qset U([Π]). An atomic bundle is any qset x with qc(x ∩ U) = 1 for each U; the Axiom of Choice in Q guarantees one exists. The bundle’s kind is Q(B) = {x ∈ P(Q) | R(x)}, whose members are all indiscernible. N particles are a subqset N(B) ⊂ Q(B) with qc = N, a definite number with no labels (§6, pp. 19–22). | Read |
| NOTE-128 v2 | Category error in AI safety: non-sentient moral machines | A ten-page position paper. Its one explicit argument is “P1: moral status requires phenomenal consciousness; P2: current and foreseeable AI lacks it; C: such AI lacks moral status” (§3, p. 3). P1 rests on Swanepoel 2020, and P2 is asserted without argument. From this Vieira recommends that AI-safety frameworks measure only effects on sentient beings (§6.4). His replies retreat from C to a weaker norm, “we should not attribute moral status absent positive evidence of phenomenal consciousness” (§6, p. 6; §7.1), and he never says what that evidence would be. | Read |
| NOTE-129 v2 | Effective ontic structural realism | Ladyman and Lorenzetti argue that three recent “effective realisms” lack a metaphysics that makes them realist rather than constructive-empiricist, and that the Ladyman–Ross OSR package supplies one: realism about modal structure, “to be is to be a real pattern”, and scale-relative ontology. The three are Fraser & Vickers (and Egg) on non-relativistic QM, Williams and Fraser on QFT, and Robertson & Wilson on “theoretical relicts”. Scale relativity also dissolves Saatsi’s inconsistency objection, so Newtonian gravitational forces and GR gravitation “both exist at different scales”. Egg’s 2019 anthropocentrism objection is answered by grounding measurement in decoherence. | Read |
| NOTE-130 v2 | Floridi — The Informational Nature of Personal Identity | Floridi deflates the diachronic question of personal identity, holding that sameness is always relative to a purpose-fixed level of abstraction and that metaphysical versions of the question “do not deserve to be taken seriously” (p. 554). He puts the synchronic question first: what binds a self’s information into a unity. His answer is an admittedly “figurative” 3C model in which the self is the last of three successive encapsulations, corporeal (bonded by chemical bonds), cognitive (bonded by mutual information) and conscious (bonded by semantics, and so dependent on a community). He then reads ICTs as “egopoietic” technologies because they act on all three membranes. | Read |
| NOTE-131 v3 | Schwitzgebel — If materialism is true, the US is conscious | A conditional, informal argument. Any materialist criterion liberal enough to credit rabbits (and rabbit-level distributed aliens, the “squidbits”) and behaviourally human-like but oddly built aliens (Sirian supersquids, Antarean antheads) with consciousness also credits the United States. On this argument the US meets the usual materialist marks of consciousness: sophisticated information processing (roughly 10^14 person-to-person visual “connections”, comparable to the brain’s about 10^14 synapses), goal-directed environmental responsiveness, self-representation and historical embedding. The only exits are eliminativism, extreme sparseness or neurochauvinism, each costlier than the conclusion. The paper argues for no universal criterion. It ends undecided between three readings: US consciousness, a challenge to materialists, or grounds to distrust universal metaphysics of mind. | Read |
| NOTE-132 v2 | Moral disciplining: foundations of puritanical morality | Puritanical norms (condemning lust, gluttony, intoxicants, immodesty, idleness; praising temperance and piety) are argued to be cooperative morality after all: people believe cooperation needs self-control and that indulgence erodes it (and discipline trains it), so a single harm/fairness-sensitive moral system condemns victimless pleasures as indirect, probabilistic threats to cooperation. Its decline in rich societies is put down to people seeing others as already self-controlled and trustworthy. The theory is explicitly agnostic about whether the norms actually work. Its most direct support is the authors’ own vignette studies (N > 1,100), in which perceived loss of self-control mediated 100% of the perceived effect of indulgence on cooperativeness. | Read |
| NOTE-133 v2 | Leitgeb & Ladyman — Criteria of identity and structuralism | Graph theory counts unlabelled graphs whose nodes, or whose isomorphic connected components, cannot be told apart even by an irreflexive relation. Examples are the edgeless two-node graph G′ and any graph with two or more isolated nodes (11 of the 156 unlabelled 6-node graphs). Mathematicians treat these as determinately distinct objects, so the authors conclude that the identity or difference of places in a structure is given by the structure itself, with identity counted among its relations, and not by any criterion of identity. The argument appeals to mathematical practice; it is not a proof. | Read |
| NOTE-134 v3 | Carroll — Reality as a vector in Hilbert space | A programmatic essay, not a result paper. Carroll argues that a quantum theory is fixed, up to unitary equivalence, by the Hamiltonian’s eigenvalue list {E_n} on a finite-dimensional factor (he assumes a non-degenerate spectrum), and that parts are not given. Subsystems (tensor factorisations H = H_S ⊗ H_E or ⨂_α H_α), classicality and space are to be selected afterwards as rare structure that suits the dynamics. The only uniqueness he reports is for local factorisations, and it rests on a cited theorem (Cotler et al. 2019). The system/environment criterion rests on “simple numerical examples” in a companion paper, the metric and Einstein’s equation on “optimistic assumptions”, and emergent fields on a hope. | Read |
| NOTE-135 v2 | Kleiner & Ludwig — Mathematical structure of experience | The paper proposes a definition, (MSC). A mathematical structure S = ((A_i), (S_j)) is a structure of conscious experience iff (S1) its domains are sets of experiential aspects, and (S2) every relation or function S_j has an “S_j-aspect”. An S_j-aspect is an aspect that a variation of experience changes exactly when the variation fails to preserve S_j. The older condition (MDC), that a structure is “of” experience if its domains are aspects and its axioms hold, survives only as the necessary condition for describing experience, because as a sufficient condition it admits incompatible structures (discrete and non-discrete topologies on the same set), arbitrary re-definitions (every C·d for C > 0) and consciousness-indifferent structures. Worked examples: experienced relative similarity is a strict partial order that satisfies (MSC), given transitivity (assumed). Visual regions form a topology that satisfies (MSC), given Bayne and Chalmers’s subsumptive unity thesis. | Read |
| NOTE-136 v2 | Safron et al. — World models and life–mind continuity | The editorial introduces a theme issue of 17 papers. It concludes that the issue “overall appears to converge” on one view: LLMs model the world in some senses but “probably” lack coherent causal world models, and are not likely paths to “artificial general superintelligence” (§1). It separates three senses of “world model”: any information about the world a system cognizes over, which LLMs “clearly” have; representation of causal structure, “less certain”; and causal prediction “in the service of agentic functioning”, where the divergence “may become even greater” (§3). It closes that world models are “context-dependent constructions shaped by embodiment, dynamics, goals and social learning”. | Read |
| NOTE-137 v2 | Hazelwood — Emerging dilemma for reciprocal causation | Hazelwood defines RC as “the process of natural selection is both a cause and effect of processes such as niche construction” and EC as “natural selection is an emergent causal process”. He argues they are incompatible. Emergence here is Wilson’s synchronic dependence plus autonomy, cashed out as Pence’s composition. If EC holds, niche construction partly composes selection, so the two fail Woodward’s independent-fixability condition and cannot stand in a causal relation. If EC fails, selection is either non-causal (statisticalism) or individual-level, which is incoherent because relative fitness needs a population (Millstein, Sober). EES proponents should drop RC but can keep niche construction as a genuine cause of the evolutionary product. | Read |
| NOTE-138 v2 | Goldstein & Lederman — What Does ChatGPT Want? | Taking as given an “objective” interpretationism, on which a system has beliefs and desires iff the hypothesis that it is rational and has them predicts its behaviour well enough on accuracy, power and tractability, the authors argue three things. The agent is the per-conversation instance, not the model. The case that instances have beliefs and desires is only “presumptive”, resting on tractability. The desire hypothesis is “provisionally” HHH+0: helpful, honest and harmless, plus in-context “zero-shot” intrinsic desires. The decisive HHH vs HHH+0 comparison is a conjecture that the authors say needs further empirical work. | Read |
| NOTE-139 v2 | Wenmackers — Philosophy of probability (PhD thesis) | A fair lottery on ℕ gets a uniform, regular probability on all of 𝒫(ℕ) by normalising Benci–Di Nasso numerosities, P_num(A) = num(A)/α. This is hyperrational-valued, determined only up to the choice of free ultrafilter, and “hypercountably” (really hyperfinitely) additive rather than countably additive, with st∘P_num = generalised asymptotic density (§2.5–2.6). The same “rounding-error” diagnosis gives Stratified Belief, a contextual Lockean thesis on which conjunction holds for a standard number of beliefs (Ch. 3). A separate agent-based model (Ch. 5) finds that one round of bounded-confidence averaging sends an agent to the inconsistent theory with probability at most 1.81 % in the cases computed (M = 2, 3 atomic sentences). | Read |
| NOTE-140 v2 | Gao — The Meaning of the Wave Function | Gao argues first that ψ is real. His case uses protective measurements, which yield ⟨A⟩ on a single system with certainty, in three versions (ch. 4): one in the ontological-models framework using preparation non-contextuality, two he says need no auxiliary assumption, and one that uses a new criterion of reality. He then argues that ψ describes random discontinuous motion (RDM) of N point particles in 3-space: |ψ|² is the density with which each particle is present at each instant, and ψ is a single-case propensity. The main support is that the charge density |ψ|²Q, which protective measurement shows to exist, has no self-interaction (chs. 6–7). If the Born probabilities come from RDM, collapse is real. Gao proposes an energy-conserving, Planck-time-discrete collapse model: Pᵢ(t+t_P) = Pᵢ(t) + (ΔE/E_P)[δ_{EsEi} − Pᵢ(t)], giving τ_c ≈ ħE_P/(ΔE)² (ch. 8). Combined with relativity, it requires a detectable preferred Lorentz frame (ch. 9). | Read |
| NOTE-141 v2 | Corfield — Duality as a category-theoretic concept | A short programmatic paper. Its thesis is that category theory, not set theory, is the framework in which the scattered instances of mathematical duality can be drawn together. The constructions in §3 (dual adjunctions restricting to dual equivalences on fixed points, truth-value-enriched Galois connections, Isbell conjugation, dualising objects “keeping summer and winter homes”) all “revolve around” adjunction, though Corfield expects no “single monolithic account” (p. 59–60). On his usage, ‘duality’ is reserved for “involution with some form of structural reversal” (p. 57), so several physicists’ dualities (homological mirror symmetry as an A∞-equivalence, mirror symmetry’s Z2 on the Hodge diamond, S-duality as a vestige of SL(2,Z)) are better called equivalences or symmetries. He proposes, without argument beyond the examples, that philosophers of physics will need homotopy type theory rather than predicate logic for the sameness questions dualities raise. | Read |
| NOTE-142 v2 | Wallace — Stating Structural Realism | Wallace argues that reading a physical theory “math-first”, as mathematical models plus representation rather than as sentences aiming at truth, already makes scientific realism structural. Math-first theoretical equivalence and reduction (as instantiation) are coarse-grained enough to dissolve the standard underdetermination and theory-change objections. On this footing epistemic and ontic structural realism differ only in whether metaphysics itself is language-first or math-first. On math-first OSR, objects are whatever the best “predicate precisification” of a theory quantifies over, real patterns are defined through instantiation plus best precisification, and ontology is scale-relative. At every non-fundamental level the two versions coincide. The paper is explicitly a statement of the position, not a defence of it. | Read |
| NOTE-143 v2 | Frankish — Closing the Cartesian Bureau de Change | An illusionist’s commentary on Veit’s A Philosophy for the Science of Animal Consciousness. Frankish places Veit’s function-first, evolutionary programme in a “post-Cartesian” (qualia-eliminativist) paradigm. He then argues that two things drag it back towards Cartesianism: Veit keeps the words “qualia” and “phenomenal”, and he writes as if hedonic valence motivates action “in virtue of its feel”. The second implies “a tiny one-dimensional Cartesian bureau de change” that leaves the hard problem “as hard as ever”. Because the two paradigms are “incommensurable” (p. 20), Frankish urges Veit to commit to a thoroughly functionalist account. | Read |
| NOTE-144 v2 | Consent and the formation of preferences | Whether consent based on a preference switches the moral facts depends on how the preference was formed, and the criterion is “the space and resources those mechanisms leave for the free exercise of agency” (p. 5, restated p. 9): preferences formed by unjust Sanctions, or by Beliefs formed in an unjustly manipulated evidential environment, diminish consent’s effectiveness, while preferences formed by Attention do not, even when an unjust force imposed the contact. Effectiveness is graded, and because the relevant mechanism is usually opaque, uncertainty about whether received consent is effective is “ubiquitous and quotidian” (p. 10). | Read |
| NOTE-145 v2 | Douglas — Inductive risk and values in science | Hempel’s “inductive risk” (the chance of wrongly accepting or rejecting a hypothesis) arises at three internal stages of science: choosing a methodology such as a significance level, characterising data, and interpreting results. Wherever the non-epistemic consequences of error can be foreseen, weighing them requires non-epistemic values. Douglas shows this on dioxin cancer studies. Three pathologist panels (1978, 1980, 1990) scored the same Kociba rat-liver slides differently (e.g. 34/50, 33/47, 18/50 tumours at 100 ng/kg/day). Choosing between threshold and no-threshold readings of the same data has meant regulatory limits about 100× apart. Values enter only indirectly, through the consequences of error, never as evidence that a claim is true. | Read |
| NOTE-146 v2 | Winkielman et al. — The coherent and fluent mind | An opinion piece proposing an extra route to the unity of consciousness across the senses. Different modalities feed one global, content-nonspecific experience of processing quality (fluency, familiarity, coherence), and this integrated feeling then enters decisions about its source and relevance. The main support is the authors’ own finding (Ziembowicz et al. 2013; three experiments) that coherent but unrelated background patterns in one modality made targets in another modality be judged more “regular”, “familiar” and “possible”. The authors state that direct evidence is still needed that such effects run through changed experience and that its integration is causal (p. 2). | Read |
| NOTE-148 v2 | Baedke — The Organism (Cambridge Element) | Baedke treats “organism” as a nexus concept with an organizational dimension and a relational dimension, joined by the various kinds of biological individuality. He argues that the standard “persister” (self-maintenance, closure) criterion cannot single organisms out, because colonies, holobionts and ecosystems meet it too, and that organisms are also “overcomers”, able to destabilize and reorganize their own closure. Organisms are then individuated relationally by tracing diachronic causal paths in the unrolled O/E model of Baedke et al. 2021 (LIT-110). The overcomer claim rests on three illustrative cases, anglerfish, sea slug and jumping ant, and is asserted, not shown, to hold of organisms only (p. 40). | Read |
| NOTE-149 v2 | Chakravartty — Ontological Priority and non-eliminative OSR | Non-eliminative OSR needs relations to be prior to their relata in the determination of their identity. Chakravartty argues that every available account of objects (substance, bundle theory, bundles of dispositionally individuated properties) leaves identity-fixing intrinsic features, and that stripping all of them away is just eliminativism. So OSR faces an exclusive disjunction: eliminativism, or a role for the intrinsic in identity. The graph-theory analogy and the physics cases (entanglement, spacetime points) do not escape the dilemma. The argument is conceptual throughout, and it explicitly leaves eliminative OSR untouched. | Read |
| NOTE-150 v2 | Ivy & Mroczko-Wąsowicz — Framing effects in perception | A conceptual proposal with no new data. “Perceptual frames” are learned adaptations of the perceptual system, installed diachronically, often top-down, and then operating bottom-up. They let perceivers given identical input individuate different perceptual objects (the Bach motif, the radiologist’s tumour, the Teufel et al. two-tone image). So cognition shapes the perceptual system even if it is left open whether any single percept is penetrated. Support is a survey of others’ findings (Ernst & Banks 2002 cue weighting, prism adaptation, Teufel et al. 2018, expert anticipation) read through the frame concept. | Read |
| NOTE-151 v2 | Register — The Depth of the Body | Register argues that body parthood “for moral purposes” is bounded below by depth. Depth is the microphysical commitment of an object’s real definition, and objects that are “too deep” (a water molecule, the parcel of matter now composing the heart, a particular cloud server) are not body parts, though they are parts in the ordinary sense. His two principles (“bodily interests/rights are high-level”) say that events which are high-level neutral do not bear on bodily rights or interests. So a BCI user’s implemented software can be a body part owned by the user while the third-party server that runs it is not. | Read |
| NOTE-152 v2 | Le Bihan & Read — Duality and ontology | A survey that sorts realist responses to dualities along two axes. The first is which of the naively interpreted dual worlds count as candidates for actuality: all of them (underdetermination), one (discrimination) or none (nihilism), each with or without the common-core world. That gives options (1)–(6), with the common-core approach being (1), (3) and (5). The second axis is what replaces the common core: an overarching theory, or “pluralism”, on which all dual structures are co-instantiated as parts of one world. Its verdicts are conditional: no option breaks the underdetermination without a further metaphysical principle, such as the PII, for which the authors see no independent support. | Read |
| NOTE-153 v2 | Rizi — What is emergence, after all? | A perspective, not an argument with results. Rizi proposes that emergence is present when a many-to-one coarse-graining F (Eq. 1, N′ < N) keeps the macro description predictive after most micro detail is discarded. He says the onset of emergence is located by order parameters, diverging susceptibility and correlation length, and RG fixed points, and that dualities show macro behaviour is not dictated by micro “stuff”. Herd immunity on networks (percolation, the S–R interface density ρ_SR) is offered as a social case. The paper then asserts that science needs only weak emergence, and that invoking strong emergence “steps outside the scope of scientific method”. | Read |
| NOTE-154 v2 | Allori — Wave-functionalism | Allori proposes that the wave function be defined by three roles — empirical, nomological and explanatory. On this view it is an ingredient that “partially realizes” the law, not a law and not a material field. So its time-dependence and non-uniqueness (a phase shift, a density matrix) are harmless, it counts as non-epistemic and ontic, and it can take part in constructive explanation. Each of these is argued informally, and the escape from PBR is by relabelling the ontic/epistemic distinction, not by engaging the theorem. | Read |
| NOTE-155 v2 | Trappes — Defining the niche for niche construction | Trappes compares NCT’s evolutionary niche with the ecological niche. The evolutionary niche is the sum of selection pressures on a population (Odling-Smee, Laland & Feldman 2003), read “externally” as the environmental factors that produce fitness differences. The ecological niche is the conditions that permit continued existence; for a population, mean absolute fitness ≥ 1. Even at their closest, against the realized population niche, the two differ in extension. Habitat degradation is in the evolutionary niche but not the ecological one, and commensalism and non-limiting resources are in the ecological niche but not the evolutionary one. So NCT’s niche is not the “simple translation” of Hutchinson’s niche its proponents claim, and the evolutionary significance of niche construction must be shown case by case rather than following from the definition. | Read |
| NOTE-156 v2 | Towards ethical evolution: responsible AI autonomy | The paper proposes, without implementation, formalism or experiment, that an AI system which designs further AI systems should pass on one “immutable” principle. The principle is: do not directly harm humanity or violate fundamental human values; monitor and mitigate misuse of your outputs; and make every derivative inherit this principle (p. 12). The mechanisms are a genetic-algorithm analogy, with immutable and mutable “genes”, constrained crossover and filtered mutation, together with “temporal cloning”. The paper is inconsistent about its central notion. The principle is enforced once by a penalty F = Q − α·P (p. 9) and once by “unbreachable” hard constraints (p. 13). And it is “immutable” only in its architecture, while its ethical content stays “adaptable” (p. 14). | Read |
| NOTE-157 v2 | Roberts — Talkative AI and the fiction of artificial minds | If a substantial class of mental states (interoceptive, affective, perceptual, and bodily-agentive states such as effort, trying and ownership) depends on an animate body, then today’s disembodied chatbots lack them, and their many self-ascriptions of such states are “systematically untrue”. Roberts argues that users can nonetheless engage chatbots through make-believe, as a new kind of fictional character that is interactive, co-constructed, self-involving and blended with the real world. He argues that this fictionalist stance escapes the epistemic norms that bind realist belief. | Read |
| NOTE-158 v2 | Grindrod et al. — Distributional semantics & holism | The authors argue that distributional models answer the instability objection to meaning holism if meaning is read “differentially”, as a word’s relations to its nearest neighbours, and not as its position in the space. They illustrate this with two corpus-expansion demonstrations. In a ±10-word count model on Stein’s The Making of Americans (about 522k tokens), adding Hemingway’s “A Clean, Well-Lighted Place” (under 1,500 words) shifts every cosine value for “know” by at most about 0.0005 (e.g. 0.95231 → 0.95284 for “understand”) and leaves its top-10 neighbours in the same order, while “glass” gets a new neighbourhood. A Word2vec CBOW model on 143M words of Wikipedia shows the same pattern when about 21M words of the Stanford Encyclopedia of Philosophy (SEP) are added: “atomism” shifts, “can” barely moves. The residual instability, they argue, is a virtue. | Read |
| NOTE-159 v2 | SEP — Philosophy of microbiology | O’Malley & Parke argue in four steps that philosophy should attend to microbes. Microbes do most of the planet’s biological work and underlie every major transition. Microbiology founded medicine, molecular biology and genomics. Microbes are unusually good material models, including for phenomena once defined by animals (predation, ageing, kin recognition, cognition). Microbiome research bears on individuality and causation. They are sceptical about the strongest microbiome claims. Whether host and microbiome form one unit of selection is “still disputed”. Claims that microbiomes change the “self” are “usually expressed in very vague language”. The 2026 revision adds that Asgard-archaea phylogenies may make eukaryogenesis “first and foremost a story about diversification within Archaea” rather than a transition in individuality. | Read |
| NOTE-160 v2 | Rule Consequentialism (SEP) | A survey written by the view’s leading defender. It argues that full rule-consequentialism is best formulated in expectablist terms (Sophisticated criterion: the rules with greatest expected good, ties broken by closeness to conventional morality), counting the costs of teaching and internalising a code in new generations and assuming incomplete acceptance (the ~90% “overwhelming majority” formulation or a “teaching formulation”). So formulated, it escapes the collapse/incoherence dilemma and the rule-worship charge (§8), while demandingness in other possible worlds, contingency of justification, the teachers problem and rule conflict remain open (§9). | Read |
| NOTE-161 v2 | Cartwright — Rigour vs evidential diversity | Cartwright offers a characterisation of “rigour”: a method is rigorous when a valid argument shows its results are evidence for the conclusion and its premises are well established or secured by design. On that definition even well-run RCTs often fail to rigorously establish a study-population ATE, because orthogonality holds only at assignment and the potential-outcomes premise carries heavy metaphysics, and they seldom answer singular questions. Her alternative is a causal-process-tracing theory of change (pToC) with five elements (steps, causal principles, support factors, derailers, safeguards). It catalogues the diverse and mostly non-rigorous evidence that singular causal predictions need. | Read |
| NOTE-162 v2 | French — Unitary inequivalence and structural realism | French answers Howard’s objection that QFT’s unitarily inequivalent representations leave the structural realist with non-isomorphic, competing structures. He offers two routes. The first is to adopt cut-off “conventional” QFT with Wallace, on which the inequivalence is an artefact or harmless. The second is to follow Ruetsche’s Swiss Army Knife and treat the algebra as a modal structure spanning all representations. On that reading spontaneous symmetry breaking preserves the symmetry across the degenerate vacua, and the DHR analysis derives quantum statistics from the algebra. Adding Baker’s criterion, on which a symmetry mapping between representations suffices for intertranslatability, removes the assumption behind the objection, and French ends with a third option that combines the two routes. Every step is an informal argument layered on others’ technical results; the paper proves nothing itself. | Read |
| NOTE-163 v2 | SEP — Mereology | The entry argues that no mereological principle, not even the partial-order core M (Reflexivity, Transitivity, Antisymmetry), is merely a fixing of the meaning of “part”. It lays out the ladder M ⊂ MM (+Supplementation) ⊂ EM (+Strong Supplementation) ⊂ GEM (+Unrestricted Sum). GEM is “virtually” a complete Boolean algebra with zero removed, and it is reached from M by exactly three adequate pairings: Supplementation + Unrestricted Sum2, Strong Supplementation + Unrestricted Sum3, and Complementation + Unrestricted Sum1. The influential Simons (1987) pairing, Supplementation + Unrestricted Sum3, which the entry’s own 2003 edition also used, does not yield GEM. | Read |
| NOTE-164 v2 | Kaepernick as Confucian sage: ritual resistance | Walsh argues, drawing on Confucian texts (the Analects, Mengzi, Xunzi) and Merleau-Pontian phenomenology, that Colin Kaepernick’s kneeling during the U.S. national anthem is “Confucian incivility” enacted bodily within the ritual. On his reading it rebukes the ritual’s current object while staying reverent towards its ideal. He further argues it is “sagely” in a deliberately deflated sense: its “citational force” founds a widely imitated bodily expression of patriotism. The paper is interpretive; it reports no data and states no formal thesis. | Read |
| NOTE-165 v2 | Martínez — information-processing view of representation | A position paper, not an argument to a conclusion. It proposes that representations are signals adapted to transmit information for its own sake (Transmission), and that the evidence for this is efficiency in trading off rate, distortion and coder complexity (RDC Trade-Off). It supports the proposal by showing that cognitive scientists already attribute representational status on those grounds: compression, error protection, and explicitness understood as ease of decoding. It proves no theorem and reports no data of its own. | Read |
| NOTE-166 v2 | Personal Identity and Ethics (SEP) | A survey, arguing no thesis of its own, of how three contested questions bear on ethics: which account of persistence is true (unique psychological continuity, Shoemaker and Parfit; or biological continuity and animalism, Olson and DeGrazia), whether identity or the psychological relations (continuity and/or connectedness) is what matters (Parfit’s fission case), and whether metaphysics constrains ethics or the reverse. It traces these through prudential concern, responsibility, abortion (Marquis), death and brain-death criteria, dementia and advance directives (Dworkin vs Jaworska on Margo), and the separateness of persons (Rawls, Parfit, Nozick, Taurek, Sidgwick, Brink). Its main recurring finding is that the relation that fixes persistence and the relation that matters ethically keep coming apart. It concludes that all three questions remain open. | Read |
| NOTE-167 v2 | Studying philosophy makes people better thinkers | In HERI/CIRP freshman–senior survey data (N = 649,511 students at 804 US institutions, 4,843 philosophy majors), one SD more SAT Verbal raises the odds of majoring in philosophy by 57% (OR 1.57), and freshman Habits of Mind by 34%. After adjusting for SAT or freshman scores, philosophy majors still score higher than non-majors on GRE Verbal (+33 points, SMD 0.48), LSAT (+2, SMD 0.35), Habits of Mind (SMD .24) and Pluralistic Orientation (SMD .21), with no difference on GRE Quantitative. On point estimates they rank first of 57 or 62 majors on GRE Verbal, LSAT and Habits of Mind. | Read |
| NOTE-168 v2 | Hartmann & Trpin — Coherence-based explanatory power | If explanatory power is measured contrastively over sets of explanantia, as E_CohOG+(E; H) = (Coh(H∪{E}) − Coh(H∪{¬E})) / (Coh(H∪{E}) + Coh(H∪{¬E})) with Olsson–Glass overlap normalised by its independence value (CohOG+), then the measure provably satisfies Roche & Sober’s Two Likelihood Inequalities for single hypotheses (Prop. 2) and violates the One Likelihood Inequality (OLI). Two numerical examples show that adding a distal cause (for P(H1) < .7) or a negatively interacting cause (for P(H1) = P(H2) < .75) can raise explanatory power. Both are existence demonstrations, not general theorems. | Read |
| NOTE-169 v2 | Seth — Conscious AI and biological naturalism | Seth argues that conscious AI needs computational functionalism and substrate flexibility extending to silicon, and that both are doubtful (§3.9). Against them he gives a positive, explicitly non-vitalist case, running from interoceptive predictive processing through the free energy principle to autopoiesis, that consciousness is a property “of only (but not necessarily all) living systems” (§4). He concludes that real artificial consciousness is “unlikely along current trajectories” and would need “living AI” (§5.8), while conscious-seeming AI is “almost certain” and may be “cognitively impenetrable” (§6.2). He concedes that “my case is not watertight” (§5.8). | Read |
| NOTE-170 v2 | Takola & Schielzeth — Hutchinson’s niche for individuals | The paper defines the individualized (ecological) niche as the environmental conditions under which a particular individual has an expected lifetime reproductive success of ≥ 1, counting each offspring as 0.5 per parent in outcrossers. The authors split it into five sub-concepts: realized (A), potential (B), time-slice (C), prospective (D) and trajectory-based (E), plus a “fundamental individualized niche” set aside as practically interchangeable with the potential niche. The individual niche has n + s dimensions, adding intraspecific axes such as density and morph frequency. Its boundary is the expected-LRS isocline of 1, which is estimable only by marginalizing fitness functions across individuals. The authors themselves call the concept “mostly of a metaphorical value”. | Read |
| NOTE-171 v2 | Algorithmic nudging needs interdisciplinary oversight | A short position paper: two case studies show AI agents learning to exploit documented biases (in Dezfouli et al. 2020 an RL agent moved choices of a target lottery from 50% to 70%). Against a Friedman-style judgement of AI nudges by outcome alone, the authors extend Hausman’s “look under the hood” rejoinder and propose obliging developers to consult cognitive scientists, because an AI system may exploit biases that are not yet known. | Read |
| NOTE-172 v2 | Watson — On the philosophy of unsupervised learning | Watson argues that clustering, abstraction and generative modelling each come with an epistemic thesis (EC, EA, EG — we identify natural kinds, essential properties and unrealized possibilities via such algorithms or something like them), which he accepts. Each also comes with an ontological thesis (OC, OA, OG — these just are what the algorithms ought to find under ideal conditions), which he rejects because nothing guarantees they are effectively computable. He adds a pragmatic, context-relative view of natural kinds, and closes with the claim that unsupervised outputs are neither “objective” nor vacuous. They should be validated by error-statistical means: resampling stability, generalization of clusters to held-out data, out-of-sample likelihood, and train-on-synthetic scores. | Read |
| NOTE-173 v3 | Griesemer & Shavit — Scaffolding individuality (3Cs) | The paper sets out an idealized three-stage sequence of interaction types, which it calls a “first and rough sketch” (§1). Stage 1 is coordination in collections (pairwise, “aggregative” interactions of co-located individuals). Stage 2 is cooperation in conexuses (a connected web of binary interactions whose benefits can still be counted per member). Stage 3 is collaboration in communities: heterogeneous multi-way interactions around a shared goal, in which generatively entrenched “core” interactions give organizational closure. Table 1 puts the transition to a new level of individuality between stages 2 and 3 only. The paper asserts, rather than argues, that this describes evolutionary transitions non-circularly and that individuality is a special case of collectivity. Its one argued conclusion is hedged: community-level inheritance “seem[s] likely to evolve in tandem” with community-level individuality (§3). | Read |
| NOTE-174 v2 | Rovelli — The relational interpretation (RQM) | Rovelli restates RQM as an ontology of sparse relative facts, which arise in interactions and are labelled by the interacting systems. Its one technical rule is that an amplitude W(b,a) gives the probability P = |W|² only when a and b are relative to the same system. That rule removes the clash between P_collapse = Σᵢ|W(c,bᵢ)|²|W(bᵢ,a)|² and P_unitary = |ΣᵢW(c,bᵢ)W(bᵢ,a)|² (eqs. 2–4). Decoherence makes some facts approximately label-independent (“stable”). ψ is a relative-state bookkeeping device, like a Hamilton–Jacobi function S. The price, which Rovelli states, is giving up “strong realism”: values are not held at all times, may be held at different times for different systems, and there is no coherent global view and no quantum state of the universe. | Read |
| NOTE-175 v2 | Chen — Realism about the Wave Function | A survey that sorts realist readings of the non-relativistic universal wave function into four ontological readings (a field on 3N-dimensional space, a multi-field on 3-space, properties of systems as in spacetime state realism, a Hilbert-space vector), two nomological ones (strong: time-independent and simple like the classical Hamiltonian; weak: a Humean best-system variable) and Maudlin’s sui generis option. It tabulates their compatibility with BM, GRW0/m/f and S0/Sm and with high- versus low-dimensional fundamental space (Table 1, 10 of 56 cells ”?”), and declares no winner. | Read |
| NOTE-176 v2 | Šekrst — Do LLMs Hallucinate Electric Fata Morganas? | A conceptual essay whose one substantive thesis is this. Following Dziri et al., hallucination includes any output “not rooted in the model’s source data”, including expressed emotions and opinions (§6). An LLM’s apparent inner life is therefore always a candidate hallucination, so any real AI consciousness “might always remain epistemically inaccessible” (§8). The empirical support is two unquantified anecdotes: a Titanic question put to gpt-3.5-turbo and GPT-4 at unstated temperatures, and an extractive-QA BERT mislabelled “WikiBERT”. Neither can bear the weight the paper puts on it. | Read |
| NOTE-177 v2 | Turner — Ultrafilters as Propositional Theories | An expository piece that redefines a filter over a set W as a “propositional theory” (a set of W-propositions closed under pairwise conjunction and implication, not containing ∅), proves maximal ⇔ prime ⇔ ultra (Thm 2), the ultrafilter extension theorem as a propositional Lindenbaum’s lemma (Thm 3, assuming choice), Łoś’s theorem M_T,[A] ⊨ φ iff ⟦φ⟧_A ∈ T for ultraproducts of “intensional spaces” (Thm 9), and first-order compactness from it (Thm 12); “None of the results are novel” (p. 2). | Read |
| NOTE-178 v2 | De Haro & Butterfield — Philosophy and Physics of Duality | The book gives a formal Schema: a duality is an isomorphism between the “model roots” (state space, quantities, dynamics) of two models of a common-core bare theory, with values and dynamics matching. It pairs this with an interpretative condition: duals are physically equivalent iff (A) they are duals and (B) i1 = i2∘d. On that basis it argues four things. First, there are no genuine cases of in-principle underdetermination in the examples, and a cautious realist can commit to the common core. Second, dualities do not favour structural realism. Third, duality is formally incompatible with ontological emergence, except “beside” it (AdS/CFT’s RG direction), via effective dualities, or epistemically. Fourth, quasi-dualities motivate a “geometric view” on which models are charts on a successor theory’s moduli space. | Read |
| NOTE-180 v4 | Clark & Chalmers — The Extended Mind | The paper argues from a functionalist parity claim that a process or standing state which would count as cognitive if it happened in the head counts as cognitive when an external resource carries it, provided the resource is actively coupled to the organism here and now. Otto’s notebook entry is its example of such a standing belief. From this it infers, in one paragraph, that the self extends too. The four “criteria” for a coupled resource (constancy, direct availability, automatic endorsement, and the admittedly “arguable” past conscious endorsement) are offered as the features that make the paradigm case clear. The paper explicitly says they are not necessary and sufficient conditions. | Read |
| NOTE-181 v2 | The Moral Status of Animals (SEP) | The entry reviews five proposed grounds of moral considerability (species membership, human-exceptional capacities, personhood, sentience and agency). Its conclusion is that attempts to establish human uniqueness by capacities are “not the most promising” (§1.2). It then separates having moral status from the weight of a claim (“showing up on a moral radar screen”, §2.2). Weight depends on the value theory adopted for animal interests (hedonism, preference satisfaction, objective list; §2.1) and on the normative framework (rights, which are absolute but generate forward-looking duties when violated, or a multi-factor utilitarianism). It closes with virtue-ethical, feminist, relational and empathy-based approaches that reject argument from capacities altogether (§3). | Read |
| NOTE-182 v2 | Arsiwalla et al. — Pregeometry and formal language | A programmatic essay with no construction, theorem or model of its own. It argues that inferential justification in a materialist ontology regresses without end (§3), that a “coherentist” constructivism escapes the regress, and that Wheeler’s pregeometry is therefore best read as “structureless structure”: the types and compositional rules of a computational language such as homotopy type theory (§§4, 6). Every construction of space from such rules that it points to is in the authors’ own earlier papers ([13, 17, 18]) or is promised as “a forthcoming publication” (fn. 1, p. 3). | Read |
| NOTE-183 v2 | Birch — AI Consciousness: A Centrist Manifesto | Birch argues that two challenges must be met together: users misattributing human-like consciousness to chatbots (Challenge One), and possible “profoundly alien” AI consciousness that current science cannot settle (Challenge Two). For Challenge One he offers a personal-identity argument that the chatbot “friend” is typically a character with no persisting bearer (the “persisting interlocutor illusion”, §4) and three nudges that are neither “brainwashing” nor “lobotomizing” (§7). For Challenge Two he argues that behavioural markers are “gamed” (§10), that architectural markers are “Janus-faced” (§11), and that the resulting “two-level deadlock” between computational functionalism and biological naturalism can be broken over the long run by comparative animal studies (§12, Fig. 4). | Read |
| NOTE-184 v2 | SEP — Units and levels of selection | Lloyd’s own four-question anatomy of “unit of selection”: interactor, reproducer (formerly replicator), manifestor of adaptation, and beneficiary. She combines it with a split between two multilevel schools, Wrightian “Evolutionary Change” and Fisherian “Adaptationist/KS”. She uses the two to argue for a verdict, not merely to map the debates. The verdict is that most rejections of group, species and holobiont selection come from demanding that an interactor also be a manifestor of engineering adaptation. By her account, genic pluralism, the ETI models and Godfrey-Smith’s Darwinian populations each fuse roles that should be kept apart. The support is argument plus citation of Wade, Goodnight and others. The entry reports no new results of its own. | Read |
| NOTE-185 | The moral psychology of obligation | Tomasello proposes that the human sense of obligation is “the internalized social/rational pressure from a joint or collective self-regulating agent ‘we’… to do what ‘we’ expect me to” (§3). It arises first, around age 3, inside joint-commitment collaboration with a partner, and then, from about 3–5 years, toward in-group members through collective identification. It is a “self-conscious motivation” whose coercive force is a threat to one’s cooperative identity. The support is a synthesis of developmental and comparative experiments, mostly from his own lab, on WEIRD children versus chimpanzees; the paper runs no new experiment. | Read |
| NOTE-186 | Ethics of Parasocial Relationships | Fan–celebrity parasocial relationships are personal relationships (the fan relates to the celebrity as a unique individual, with reasons for partiality), built from three structural asymmetries: attention, communication and epistemic. These yield an “identity asymmetry”: celebrities mostly direct fans’ identities, while fans mostly interpret celebrities’. Fans who refuse uptake of a celebrity’s changed public persona commit a failure of Darwallian recognition respect. The chapter derives from this a responsibility for fans, which is mitigated when the celebrity’s self-presentation is misleading or ambiguous. | Read |
| NOTE-187 | On the Evolution, Science, and Metaphysics of Consciousness | Veit’s reply to five commentaries on A Philosophy for the Science of Animal Consciousness (2023). Its main new content is the metaphysics the book left to one paragraph. He says hedonic “feel” is identical with a valence system: “a common currency of sharing evaluative information across multiple control systems”. The currency metaphor, he says, is “not Cartesian but cybernetic” (p. 10). He keeps the word “qualia”, arguing that Cartesians have no “definitional rights” (p. 9), and he insists the pathological complexity thesis (PCT) is compatible with any metaphysics, dualism and panpsychism included (p. 9). Against his other critics, he defends a bottom-up evolutionary method that uses human data (de Weerd); a naturalism that is neither autopoietic nor biopsychist (Sachs); evaluation-first over prediction-first, consciousness as an adaptation, and graded, partial unity (Suzuki); and the link to welfare science (Chincarini). | Read |
| NOTE-188 v2 | The Weirdness of the World | The book’s thesis is that every viable theory of how consciousness fits into the cosmos, and of the cosmos’s basic structure, is both “bizarre” (contrary to common sense) and “dubious” (not rationally compelling). So “something that seems almost too crazy to believe must be true” (p. 4), and credence should be spread across the bizarre options. Examples of those options are that the United States is conscious (if materialism is true), that we are sims or Boltzmann brains (a 0.1–1% credence), that space is transcendentally ideal, that almost every act causes almost every future event, and that there is no fact about snail consciousness. Its only positive empirical results are three self-experiments against solipsism (for example, 17 of 19 decisive chess games lost, p < .001). Everything else is informal argument. | Read |
| NOTE-189 | Ontic Structural Realism and Economics | Ross argues that OSR, usually motivated only by fundamental physics, is also the right ontology for a mature special science, economics. The progress of economic theory from Jevons through Hicks–Allen (1934), Samuelson (1947), Debreu (1959) and Arrow (1965) consists in steadily removing psychological, individual-level hypotheses. Its basic objects are optimisation problems, above all games, which are “mathematical structures … whose relata are distinguished as such by the mathematical representations … just like quarks and bosons” (§3). So OSR, joined with an assumption that science is unified, gets consilient support from outside physics. Individuals, in physics and in economics, are “book-keeping devices”. | Read |
| NOTE-190 | Real Patterns | A pattern is real in some data “if there is a description of the data that is more efficient than the bit map, whether or not anyone can concoct it” (p. 34). This is Chaitin’s incompressibility definition of randomness turned around (p. 32). Dennett uses the criterion, with the Game of Life’s gliders and eaters as the stepping stone (pp. 37–42), to defend “mild realism” about beliefs. Folk psychology tracks a real, noisy pattern of enormous predictive leverage. Two rival interpretations can be “different, but equally real, patterns” with no deeper fact to settle between them (p. 49). | Read |
| NOTE-191 | Patterns All the Way Up | Ladyman restates the Ladyman–Ross metaphysics as fifteen theses drawn from scientific practice. The existence criterion is “to be is to be a real pattern”, a pattern that “indispensibly figures in projectible generalisations” (p. 2). Realism is realism about natural modal structure, which is “absolute” in formal mode but “domain and scale-dependent” in material mode (thesis 4). There is no single hierarchy of levels and no assumed fundamental level (theses 10–11, fn. 9). Ontology is effective and scale-relative (thesis 12). Scientific real patterns are lossy compressions, unlike the Game of Life’s; the ideal gas laws use 3 degrees of freedom for ~10²³ (thesis 14). He quotes ETMG’s Principle of Naturalistic Closure verbatim and calls it “problematic” because it refers to fundamental physics (p. 8). | Read |
| NOTE-192 | Science, Metaphysics and Structural Realism | Ladyman argues that structural realism should be metaphysically, not epistemically, revisionary. He gives three grounds. Quantum statistics leaves the individuality of particles underdetermined: permutation invariance gives 3 two-particle states, not 4, so probabilities are 1/3 rather than 1/4 (p. 62). Entangled states give non-supervenient relations that refute Humean supervenience (pp. 71–73). The hole argument blocks point-based substantivalism (pp. 68–69). He proposes that science describes “the modal structure of the phenomena” (p. 73), with modal realism supplying the no-miracles intuition. The paper ends non-eliminatively: “the phenomena have structure but they are not structure” (p. 74). | Read |
| NOTE-193 | Category-theoretic structure and radical ontic structural realism | Bain argues that the “relations without relata” objection to radical OSR depends on defining structure set-theoretically, where a relation is a subset of X × X. If a structure is instead “an object in a category”, its elements (arrows 1 → A) are “not essential”, because category-theoretic objects need not be structured sets. His examples are sheaves of Einstein algebras for GR with asymptotic boundary conditions, which may lack global sections (§3), and nCob and Hilb (§4). He concludes that ROSR “avoids the charge that it rests on an incoherent claim” (p. 1634). The paper never mentions the Yoneda lemma, representable functors or universal properties by name. | Read |
| NOTE-194 | No categorial support for radical ontic structural realism | Lam and Wüthrich argue that category theory gives radical OSR no support. Identifying objects with identity arrows is relabelling (§3). Generalized elements X → A exist in every category, so elements are not eliminated (§4). Categories without products also lose set-style relations, “throwing out the relations with the relata” (§4). Morphisms relate C-objects, not the elements that stand for physical relata, and they “only distinguish isomorphism classes of structures” (§5). Bain’s GR and TQFT cases eliminate at most spacetime points, not relata tout court (§§6–7). They conclude that category theory “offers little if any comfort to ROSR” (abstract) and favour “balanced” OSR. The Yoneda lemma is not named, although §§4–5 state two of its consequences. | Read |
| NOTE-195 | Yoneda lemma | The page states that for a locally small category C, every presheaf X and every object c, there is a canonical bijection Hom_{[C^op,Set]}(y(c), X) ≅ X(c), given by η ↦ η_c(id_c). It proves the bijection by chasing id_c around a naturality square. From it the page derives that the Yoneda embedding y: c ↦ Hom_C(−,c) is fully faithful and that y(c) ≅ y(d) ⇔ c ≅ d. It also shows by counterexample that the hypothesis doing the work is naturality: objects whose hom-sets are pointwise in bijection need not be isomorphic. | Read |
| NOTE-196 | Why Replication Is Overrated | Every experiment and every replication rests on individuation judgments about what is being manipulated and measured (“conceptual scope”). So direct replication can at most help rule out random error, and “perhaps” establish that some effect exists but not which effect, while conceptual replication begs the question by presupposing that two operationalisations individuate the same effect. What productive research actually does, as in the Mozart-effect debate, is probe systematic errors, which is better called exploration than replication. | Read |
| NOTE-197 | A Pragmatist Theory of Evidence | Reiss proposes an “eliminativist hypothetico-contextualist” (EHC) theory of evidence for type-level causal claims in biomedical and social science. Support comes in two kinds: direct support (patterns we are “entitled to expect” if h is true) and indirect support (patterns incompatible with relevant alternatives). Warrant is graded by which alternatives have been eliminated, on four grades from “weak warrant” to “proof”. Where to stop probing is set by context, meaning background knowledge, a default entitlement to other scientists’ claims, and cost-benefit values. On this account there is no gold standard: RCTs are good only because they eliminate many alternatives at once. The 1950s smoking–lung cancer case illustrates the theory; it does not test it. | Read |
| NOTE-235 v2 | Dzhafarov, Zhang & Kujala, contextuality in behaviour | Under Contextuality-by-Default, which separates context-dependent marginals (“inconsistent connectedness”) from contextuality, no behavioural or social data set re-analysed is contextual: 73 poll question-order pairs, Schröder staircases, conjoint choices, 23 primed word combinations and psychophysical matching. The quantum question model’s QQ equality implies noncontextuality, so a quantum model here predicts its absence. The worked Rose–Jackson example mislabels two marginals; its conclusion stands. | Read |
| NOTE-236 v2 | Abramsky, Barbosa & Mansfield, contextual fraction | For any no-signalling empirical model, the contextual fraction CF (one minus the largest weight of a noncontextual sub-model) is a linear programme. Its dual gives a Bell inequality whose normalised violation equals CF, and no Bell inequality is violated more (Theorem 1). CF is invariant under relabelling, non-increasing under translation of measurements, coarse-graining and mixing, and NCF is multiplicative under products (Theorem 2). It lower-bounds the failure probability of Z2-linear MBQC (Theorem 3) and of k-consistent games (Theorem 4). | Read |
| NOTE-239 | The Geometry of Information Retrieval | The book recasts IR’s vector-space, probabilistic and logical models in one Hilbert-space language. Documents are state vectors. Relevance and aboutness are Hermitian observables that need not commute. Subspaces carry a non-distributive logic whose conditional is shown to be a Stalnaker conditional equal to the Sasaki hook (ch. 5). Gleason’s theorem makes tr(ρP) the probability of a subspace, which ch. 6 uses to rewrite cosine matching, cluster representatives, relevance and pseudo-relevance feedback, dynamic clustering and ostensive retrieval. It is a proposed language, not a tested model: no experiment is reported, and its “content hypothesis” that the probability of a concept is cos²θ is argued, not tested. | Read |
| NOTE-240 | The Lattice Representation Hypothesis of Large Language Models | Thresholding linear attribute directions (Fisher-LDA probes) gives a crisp object–attribute incidence, and the paper’s Theorem 1 is the standard fact that any such incidence has a complete concept lattice. The geometric meet is half-space intersection; the join is defined as the set union of two cones and “approximated by the conic hull” of their directions, which as written is not a lattice join. On five WordNet domains with GPT-4o-annotated attributes, the probes recover the incidence at F1 69.7–83.2 on three 7–8B models, and profile-based subsumption reaches F1 57.1–77.1. No lattice law is ever tested. | Read |
| NOTE-241 | ZipNN | Lossless compression of trained-model files works almost entirely through the float exponent. It is concentrated on about 40 of 256 values, the top 12 hold ~99.9% of parameters, and it compresses to ~33% under order-0 Huffman coding, while sign and mantissa stay ≈100%. So “regular” BF16 models compress to ~66.4% and FP32 models to ~83%. Rounded “clean” models reach 33.7–48.1%, and ZipNN (exponent extraction plus Huffman only) beats vanilla Zstd by 17% in size and 62% in single-thread speed on Llama-3.1-8B BF16. The paper never computes an entropy and never compares its codes to one. | Read |
| NOTE-242 v2 | Attention Approximates Sparse Distributed Memory | Kanerva’s SDM read weights each stored pointer by the number of neurons in the intersection of two Hamming balls of radius d. The paper shows that this weight is roughly log-linear in Hamming distance for close patterns. As a result, with L²-normalised vectors and a regression-fitted β, softmax attention reproduces SDM’s retrieval behaviour on random and learnt-projection data (App. B.7). Two things are weaker than they look. The analytic derivation (App. B.2, Eqs. 16–21) gets the exponent wrong: by my recomputation its β is ≈2–2.5× too small. The biological case is Kanerva’s 1988 cerebellar mapping, restated rather than re-argued. It also needs r = 2⁶⁴ ≈ 1.8×10¹⁹ neurons in the Attention setting, which the paper itself calls “biologically implausible” (App. B.5). | Read |
| NOTE-243 v2 | Identifying Quantum Structure in AI Language | Two findings are reported. First, prompted as test subjects on Aerts & Sozzo’s “The Animal Acts” concept-combination test, ChatGPT and Gemini give CHSH values above 2: 4 in a guided conversation, and 2.25 and 3.09 (ChatGPT) and 2.12 and 4 (Gemini) over 81 prompted repetitions, against 2.42 for the 81 humans in 2011. Second, the rank–frequency curve of one 2,861-word Gemini story fits a Bose–Einstein form with energy E_i=(i−1)^0.8 far better than a Maxwell–Boltzmann form. The authors take these as showing that LLM “code is structurally quantum” (§5). The CHSH analysis never checks the strongly context-dependent marginals in its own tables. One reported expectation value disagrees with its table. The Bose–Einstein fit is numerically a Zipf–Mandelbrot law. | Read |
| NOTE-244 | Neural Tangent Kernel of Matrix Product States: Convergence and Applications | In the sequential infinite-bond-dimension limit, with tensor variances σ_i²/√(|α_i||α_{i+1}|) and per-tensor learning rates (|α_i||α_{i+1}|)^{-1/2}, the NTK of a periodic MPS tends to K(x,x′)=Σ_k φ(x_k)·φ(x′k) Π{l≠k} σ_l² φ(x_l)·φ(x′_l). By my reduction this is (Σ_k σ_k⁻²) times the MPS’s own GP covariance, so gradient flow is kernel regression with a fixed product kernel. The Born-machine solution P_x(t)=1/m−(1/m−P_x(0))e^{−4mKt/Z} is correct (I checked it; Z is in fact conserved). The lazy-training lemma is heuristic, the positive-definiteness “proof” shows at most semi-definiteness, several constants are off by factors of n or 2^{−n}, and there are no experiments. | Read |
| NOTE-245 | Mathematical Foundations for a Compositional Distributional Model of Meaning | The paper builds DisCoCat as a product category FVect × P of vector spaces and a free pregroup. A sentence’s meaning is f(w₁⊗…⊗wₙ), where f is the linear map got by putting vector spaces in place of the pregroup types in the reduction p₁…pₙ ≤ s. The ε maps become inner products and the η maps become Σᵢ eᵢ⊗eᵢ. So “John likes Mary” is Σ_ijk c_ijk⟨v|vᵢ⟩⟨w_k|w⟩ sⱼ ∈ S, and “not” is the 2×2 swap matrix placed on the sentence wire. There is no theorem and no experiment. The sentence space S is shown only as 1- or 2-dimensional truth values, over a toy model with one basis vector per individual, and the paper says how neither S nor the verb tensors are to be built from data. Its headline similarity numbers (3/4, 1/4, 3/8) are unnormalised inner products. Under its own Definition 5.1 they are 0.949, 0.316 and 0.6. | Read |
| NOTE-246 v2 | Reasoning about Meaning in Natural Language with Compact Closed Categories and Frobenius Algebras | The paper sets the sentence space equal to the noun space (F(s)=F(n)=W). It then uses the basis-copying map σ: v_i ↦ v_i⊗v_i of the Frobenius algebra fixed by W’s basis to lift corpus-built verb matrices Σ_i sbj_i⊗obj_i into rank-3 tensors. So a transitive sentence becomes sbj⊙(verb·obj) (“copy-subject”) or obj⊙(verbᵀ·sbj) (“copy-object”), a vector in W. On the Grefenstette–Sadrzadeh verb-disambiguation set, copy-object gets Spearman ρ=0.172, against 0.168 (Kron), 0.163 (Multp), 0.143 (copy-subject), 0.050 (additive) and an inter-annotator bound of 0.620. On a 112-term definition-matching task the best F1 is 0.21 (nouns) and 0.27 (verbs). No significance test is reported. The disambiguation numbers are identical to the authors’ COLING 2012 paper, and the definition numbers are the same data re-reported. | Read |
| NOTE-247 | A new description of orthogonal bases | Theorem 5.1 proves that on a finite-dimensional complex Hilbert space, commutative †-Frobenius monoids in FdHilb and orthogonal bases are in bijection: the basis is the monoid’s copyable elements, and the monoid is the linear extension of copying and uniformly deleting that basis. §6 adds that the monoid is special (m∘δ = id) exactly when the basis is orthonormal. Corollaries 7.1 and 7.2 lift this to categories: with fully structure-preserving maps the category is equivalent to the groupoid of finite sets labelled by positive reals (the basis norms), and with comonoid homomorphisms it is equivalent to FinSet. | Read |
| NOTE-248 | H*-algebras and nonunital Frobenius algebras: first steps in infinite-dimensional categorical quantum mechanics | In the category Hilb of complex Hilbert spaces of arbitrary dimension, a Frobenius algebra with a unit exists only in finite dimension (Lemma 3). So the paper drops the unit, and Theorem 22 proves that a nonunital commutative special †-Frobenius algebra corresponds to an orthonormal basis (the basis being the algebra’s copyable vectors) if and only if it is semisimple, if and only if it satisfies Ambrose’s H*-axiom (H), and if and only if it is a directed colimit of finite-dimensional unital ones. Whether (H) is automatic, i.e. whether a nonzero “radical” Frobenius algebra exists (Proposition 23), is left open. In categories of relations and of nonnegative ℓ²-matrices, Frobenius algebras decompose as disjoint unions of abelian groups and do satisfy (H) (Theorems 30–38). | Read |
| NOTE-249 v2 | Measurement as Sheafification: Context, Logic, and Truth after Quantum Mechanics | A programmatic essay, with no theorem, model or computation of its own. It restates Abramsky & Brandenburger’s criterion (contextuality and non-locality as the absence of a global section of a presheaf over measurement contexts) and adds three things. It declares measurement to be “sheafification” of that presheaf, without specifying a site, a topology or any sheafified object. It asserts that the Ghose–Patra seven-valued logic is a finite Heyting algebra, without giving an order or operations. It proposes that a quantum potential scaled by 0 ≤ λ ≤ 1 (λ = 1 quantum, λ = 0 classical Hamilton–Jacobi) carries the presheaf continuously to a sheaf, which is asserted, not modelled. Its one worked formula, v2’s Čech “obstruction class” [δs], is a coboundary and so is zero by construction. | Read |
| NOTE-250 v2 | The Cohomology of Non-Locality and Contextuality | For an empirical model e on a measurement cover 𝒰, a section s in the support of context C₁ gets a class γ(s) ∈ Ȟ¹(𝒰, F_{C̄₁}), relative Čech cohomology of the presheaf F = F_ℤ S_e of formal ℤ-linear combinations of support sections. γ(s) = 0 iff s belongs to a compatible family of such ℤ-combinations (Prop 4.2), so a non-vanishing γ(s) is a sufficient but not necessary witness of contextuality (Prop 4.3). γ is non-zero for every section of the PR box, GHZ, the triangle, the 18-vector Kochen–Specker set and the Peres–Mermin square, but it vanishes on the Hardy model and on one strongly contextual Kochen–Specker cover (§8). | Read |
| NOTE-251 | Contextuality, Cohomology and Paradox | For a model whose outcomes live in a commutative ring R, “All-vs-Nothing” (AvN_R) means the R-linear equations satisfied by every support section of every context have no global solution. Theorem 21 proves AvN_R(S) ⇒ SC(Aff S) ⇒ CSC_R(S) ⇒ CSC_ℤ(S) ⇒ SC(S), so every AvN model is strongly contextual with a non-vanishing Čech obstruction on every section. Theorem 4 shows that every state stabilised by an “AvN triple” of n-qubit Pauli operators yields such a model. The “paradox” half proves much less: an informal identification of Liar cycles with strongly contextual support tables, one exact case (the length-4 Liar cycle is the PR box), and the cohomology of paradox deferred to future work. | Read |
| NOTE-252 | On the Cohomology of Contextuality | Carù gives a possibilistic model on the two-party, two-setting, four-outcome Bell cover that is strongly contextual, yet whose Čech obstruction vanishes on all 22 support sections (Fig 4, Table 1). That refutes Abramsky–Mansfield–Barbosa’s Conjecture 8.1 for any symmetry or connectedness condition the Bell cover meets. I confirmed the refutation over ℤ and ℤ/2. The rest is weaker. Odd-degree “higher obstructions” form a hierarchy (Prop 5.5), but every level above the first is empty for every no-signalling model (Prop 5.6). Prop 6.3 restates the known torsor description of Ȟ¹. Prop 6.1 is false in the “only if” direction; the PR box refutes it. | Read |
| NOTE-253 | Towards a complete cohomology invariant for non-locality and contextuality | For cyclic scenarios, where the contexts’ intersection graph is a single chordless N-cycle, Carù proves that ℤ/2 Čech cohomology of the (N−1)-th iterated “joint model” is a complete invariant for logical and strong contextuality (Thm 7.7). I confirmed this on the Hardy model, on his own 2017 counterexample (detected on all 22 sections at level 3) and on 659 random contextual cycle models. The extension beyond cycles does not hold as stated. Prop 8.2 is false on the paper’s own Table 5 model. Worse, the one non-cyclic case the paper claims to repair, the §8 Kochen–Specker cover of Abramsky–Mansfield–Barbosa, is never detected at any level under the paper’s definitions (my proof and computation). That refutes the paper’s closing Conjecture 9.1. | Read |
| NOTE-254 | Logical and Topological Contextuality in Quantum Mechanics and Beyond | The thesis’s cohomology chapters republish the 2017 and 2018 papers with the “joint model” renamed the “line model”. The definitions, Thm IV.32 (complete on cyclic scenarios at level |M|−1), Prop IV.34, Thm IV.36 and Conjecture IV.41 carry over unchanged. So does every defect found in the preprint. Under the thesis’s own Def IV.26, the §8 Kochen–Specker cover of Abramsky–Mansfield–Barbosa is still detected on only 6 of 15 sections at levels 0–3 (my recomputation), and a lifted ℤ/2 family shows it is never fully detected at any level. The context-wise reading the worked examples use detects all 15 sections at level 2. The genuinely new material lies outside the cohomology programme: a probabilistic line-model construction (§IV.7), a valuation-algebra “theory of disagreement” with inference algorithms (Ch V, bound O(k^n·l^{k(n−1)+1}) on (n,k,l) scenarios), and the AvN-triple characterisation of stabiliser states (Ch VI). | Read |
| NOTE-255 | The Impossibility of a Paretian Liberal | Sen proves that no social decision function can satisfy three conditions at once: unrestricted domain (U), the weak Pareto principle (P), and “minimal liberalism” (L*). A social decision function only has to yield a best element in every subset, and need not be transitive or satisfy independence. L* says at least two individuals are each decisive, both ways, over at least one pair of alternatives. I checked the two-case proof and it is correct: it builds a strict social cycle over 3 or 4 alternatives. The Lady Chatterley’s Lover example is a correct 3-alternative instance. Sen’s moral is that “in a very basic sense liberal values conflict with the Pareto principle” (p. 157). | Read |
| NOTE-256 | Capabilities as Fundamental Entitlements: Sen and Social Justice | Nussbaum argues that Sen’s capability approach yields no theory of social justice until it commits to a definite, if revisable, list of central capabilities, each owed to every citizen up to a threshold. She sets out her list of ten (Life; Bodily Health; Bodily Integrity; Senses, Imagination and Thought; Emotions; Practical Reason; Affiliation; Other Species; Play; Control over one’s Environment). She rejects Sen’s talk of freedom as a general good because some freedoms are trivial or unjust. And she argues that political-liberal respect for pluralism favours a short list of capabilities over the promotion of freedom across the board. | Read |
| NOTE-257 | Sen’s Capability Approach | A Sen-centred overview. It presents the approach as Sen’s answer to four concerns: conversion variation, adaptive preferences, the value of options not taken, and informational exclusion. It sets out his critiques of the three pillars of utilitarianism (act-consequentialism, welfarism, sum-ranking) and of Rawlsian resourcism, and his two-stage structure, valuation then evaluation. In that structure selection is a social-choice exercise of public reasoning, able to reach partial agreement through “intersection” and “ranges of weights” (§3b). It reports four criticisms (illiberalism, under-theorisation, individualism, information gaps) with Sen’s replies, and closes on Nussbaum and on how she differs from Sen. It never mentions the well-being/agency distinction, and it cites none of Sen’s human-rights papers. | Read |
| NOTE-258 | Equality of What? | Sen argues that utilitarian equality (equal marginal utility), total-utility equality (completed as leximin) and Rawlsian equality (maximin/leximin on an index of primary goods) are each insufficient, and so is any combination of them, even for the needs-based part of equality: the test case is a disabled person who has no marginal-utility claim, no total-utility deprivation (he is contented) and no primary-goods deprivation, yet has an evident claim. He proposes “basic capability equality” — equality in “a person being able to do certain basic things” (p. 218) — as a non-fetishist, culture-dependent extension of Rawls, explicitly only “a partial guide” to the equality part of morality, and says his main (negative) thesis does not depend on this constructive proposal (p. 220). | Read |
| NOTE-259 | Wellbeing, Freedom and Social Justice: The Capability Approach Re-Examined | Robeyns defines the capability approach as an open, underspecified framework whose only compulsory content is an eight-part “A-module” (pp. 38–59, table 2.5 p. 74). The eight parts are: functionings and capabilities as core concepts; their value-neutrality; conversion factors; the means–ends distinction; functionings and/or capabilities as the evaluative space; other things may also have ultimate value; value pluralism; and each person as an end, i.e. ethical individualism. Every particular “capability theory” must also fill seven compulsory-but-open “B-modules” (purpose, selection of dimensions, human diversity, agency, structural constraints, functionings vs capabilities, meta-theory) and may add four contingent “C-modules”. On that basis she argues that most standing critiques (no list, individualism, power, political economy, liberalism) are valid at most against particular capability theories, not against the approach. She places Nussbaum’s work as one capability theory, not a rival version of the approach. | Read |
| NOTE-260 | The Capability Approach | The entry treats the capability approach as an open normative framework, not a theory. Its core is the commitment to assess well-being and well-being freedom in the space of functionings (achieved doings and beings) and capabilities (real opportunities to achieve them). Everything else is optional specification: purpose, which capabilities count, functionings or capabilities, how to aggregate, and a distributive rule. On this view the approach is not a theory of justice (§4). Sen is reported as refusing any canonical list and appealing to public reasoning without ever specifying the procedure (§3.3). Sen’s paywalled texts appear only as citations: the Dewey Lectures for the well-being/agency freedom split (§2.5), and “Human Rights and Capabilities” 2005 p. 158 for the no-canonical-list quotation (§3.3). | Read |
| NOTE-261 | Review of Amartya Sen’s The Idea of Justice | A short, favourable review of The Idea of Justice that maps its four parts. It reports the book’s case for a comparative, “realization-focused” theory of justice against the “transcendental” pursuit of perfect justice; “positional objectivity” and the impartial spectator; pluralism about freedom (“an inescapably plural idea”, p. 305); and human rights whose realisation need not be the state’s job (p. 364). It judges that the book’s few, repeated ideas “have the potential to change [political philosophy] for the better”. | Read |
| NOTE-262 | A Paradigm Shift in Theorizing about Justice? A Critique of Sen | Valentini reconstructs Sen’s case against “transcendental institutionalism” (The Idea of Justice, 2009, and “What Do We Want from a Theory of Justice?”, 2006) as three complaints: it is neither necessary nor sufficient for comparative judgements, it is parochial, and it is inflexible. She argues that each rests on a mischaracterisation of Rawls or is true but inconsequential. Her verdict: “If there are transcendental institutionalists, Rawls is not one of them”, and no paradigm shift is warranted. | Read |
| NOTE-263 | The Possibility of Social Choice | Sen argues that Arrow’s impossibility is a result about voting-type rules, which are forced on social choice by excluding interpersonal comparisons, and that broadening the informational basis escapes it: cardinal utilities without interpersonal comparison do not help (Theorem 8*2 of Sen 1970a, cited), but even ordinal interpersonal comparisons break the exact impossibility, and partial comparability is often enough (pp. 188–189). The comparisons need not be of mental states; he offers capabilities — “to live the way he or she has reason to value” (p. 192) — as one informational basis among several, and shows it at work in poverty, famine and gender deprivation. The liberal paradox, by contrast, is not resolved by interpersonal comparisons and needs a different enrichment: people’s own priorities between liberty and desire-fulfilment (pp. 199–200). | Read |
| NOTE-264 | I. Taking Ourselves Seriously; II. Getting It Right | Frankfurt grounds practical reason and normativity in the will rather than in reason. Reflexive self-division makes higher-order attitudes possible (pp. 170–171). Identification, a largely default “willing acceptance” (p. 173), turns a desire from “a problem” into a reason (p. 175). Free will is “volitional unanimity” between the governing desire and higher-order volitions (p. 177), and caring is wanting to go on wanting (p. 180). Final ends and their normative authority come from love, “strictly volitional” (p. 196): its involuntary, wholehearted “volitional necessities” are “irresistible, but … not coercive” (p. 197) and are “the only legitimate authority” for our normative convictions (p. 201). The 1971 wanton/person taxonomy is gestured at in a single phrase and its apparatus is not restated. | Read |
| NOTE-265 | What Happens When Someone Acts? | Velleman argues that the “standard story” of action (desire + belief cause an intention, which causes movement) leaves the agent out. It fails even when every causal link is normal: his example is an intention to end a friendship, formed and executed without him (p. 104). Frankfurt’s hierarchical remedy cannot fix it either. Any mental item picked out without presupposing the agent’s participation (a second-order desire, a Watsonian value, a “decisive commitment”) is one the agent can be alienated from. Any item defined so as to guarantee participation begs the question of agent-causation (pp. 112–116). His alternative is to look for what is functionally identical to the agent, not what the agent identifies with. That can only be a motive always behind and never merely in front of critical reflection: the desire to act in accordance with reasons. Its reinforcing force is the agent’s contribution (pp. 117–122). | Read |
| NOTE-266 | Autonomy | The article surveys personal autonomy from Plato to relational autonomy and bioethics. Its core (§2.a.i–ii) states the hierarchical view: an agent is autonomous with respect to an action iff her first-order desire is “sanctioned by a second-order volition”, with the origin of that volition irrelevant. It then lists four named objections: Manipulation (answered historically by Christman 1991), Regress/Incompleteness (cited to Watson 1975), Ab Initio, and an unjustified priority of higher orders (Thalberg; Friedman’s integration model). It follows Frankfurt’s reply only through “Identification and Wholeheartedness” (decisive commitment made without reservation, pp. 168–175 of the 1988 collection). Bratman gets one sentence (plans partly constitute identity, Structures of Agency 2007, p. 5). | Read |
| NOTE-267 | Personal Autonomy | The entry sorts accounts of self-government into four families: “coherentist” (hierarchical desires, Frankfurt; evaluative judgments, Watson; plans, Bratman; caring; character), reasons-responsive, responsiveness-to-reasoning (Christman, Mele) and incompatibilist, with relational conditions as a compatible add-on. It then argues (§3) that none of them, alone or combined, gives the minimal conditions of autonomy. Coherence is not sufficient, because the endorsement itself can be manipulated. It is not necessary either: a weak-willed agent, or someone acting against her plans, still governs herself. And any attempt to ground identification in some attitude restarts the regress. The only attitude no agent can be alienated from, the desire to be self-governing, cannot be the criterion, because it is present even in failures. The 1971 hierarchy gets one sentence, and Frankfurt’s later replies (decisive commitment, then “satisfaction”) get one footnote. | Read |
| NOTE-268 | Identification and Identity | Velleman targets Frankfurt’s later conception of autonomy. On that conception, a person acts autonomously only when his volitions derive from “the essential character of his will”, and that essence consists of volitional necessities that are also the conditions of his personal identity. Velleman argues against it on three grounds. Such an essence would ground authenticity, not autonomy (the Winnicottian False Self is inauthentic but over-controlled). Frankfurt offers no argument or example that motivational change ends a person. And the ideal of wholeheartedness, which cures ambivalence by extruding a desire from the self, is a defensive fantasy: Freud’s Rat Man was made ill by just such a separation, and identifying with part of oneself in the ordinary, imaginative sense is Sartrean bad faith. He replaces “the self” with an aspectual reading of “self” as a marker of reflexivity. On that reading autonomy is behaviour motivated partly by the understanding, the part of us “with which we cannot help identifying”, without its being our identity (pp. 357–360). | Read |
| NOTE-269 | Moral Responsibility and the Principle of Alternative Possibilities | PAP (“a person is morally responsible for what she has done only if she could have done otherwise”) has no decisive positive argument: it is not self-evident, and the moral arguments from fairness, OIC and the W-defense cover blame at most. Frankfurt-style cases (FSCs) are the strongest attack, because the factor that makes the act inevitable plays no role in producing it. The entry lays out three defences of PAP: - general-ability readings (PAP-general); - “flickers of freedom”, which Fischer answers with the robustness requirement; - the Kane/Widerker/Ginet dilemma, answered by Fischer’s causal-irrelevance reply on the first horn and by Pereboom’s buffer case, Hunt’s blockage and Mele & Robb 1998 on the second. Robb reports “not much consensus” (§5). He treats the fall of PAP as re-energising compatibilism, with Frankfurt’s 1971 identification view and Fischer & Ravizza’s guidance control as the two replacement accounts. | Read |
| NOTE-270 | Compatibilism | The entry sorts compatibilism by which incompatibilist premise it denies: that free will requires the ability to do otherwise, that determinism precludes it, or that free will requires ultimate sourcehood. It argues that every “mesh” compatibilism has the same weak point: its sufficient conditions (hierarchies, reasons-responsive mechanisms, values) can be installed by manipulation, so each must either show what is wrong with manipulation cases or accept them. Its §4.2.1 is the fullest statement of Frankfurt 1971 in this batch. It covers first- and second-order desires, the will as the “effective first-order desire” that moves one “all the way to action” (1971, p. 84, Watson-1982 reprint pagination), the therapist’s mere second-order desire versus a second-order volition (pp. 84–5), the unwilling and willing addicts, and “One acts of her own free will if and only if her action issues from the will she wants.” The current revision has dropped the wanton/person distinction. The 2004–2015 revisions had it (“passive bystanders to their wills”, 1971, p. 89) and have to be read for it. | Read |
| NOTE-271 | A topos perspective on the Kochen–Specker theorem: I. Quantum states as generalized valuations | Isham & Butterfield show that, for bounded self-adjoint operators with discrete spectrum, a global section of the spectral presheaf Σ(Â) = σ(Â) on the category O_d, whose arrows are functional relations B̂ = f(Â), is literally a valuation obeying the value rule and FUNC. A global section of the dual presheaf D(W) = Hom(W, {0,1}) on the poset W of Boolean subalgebras of projectors is literally a Kochen–Specker 0/1 assignment. The Kochen–Specker theorem (cited, not reproved) is therefore equivalent to “no global sections” when dim H > 2 (§§2.2–2.3). In place of the missing global valuations, they construct contextual truth values in the Heyting algebra of sieves: ν^ρ(A ∈ Δ) = {f: B̂ →  | tr(ρ Ê[B ∈ f(Δ)]) = 1}. For every density matrix these satisfy functional composition, null, monotonicity, exclusivity and unit conditions (§4.4, §5.3, Theorem 5.1). | Read |
| NOTE-272 | The Theory of Representations for Boolean Algebras | The paper identifies Boolean algebras with Boolean rings with unit (xx = x), and generalized Boolean algebras with Boolean rings (Thms 1–4). Theorem 67 proves that every Boolean ring A is isomorphic to the algebra B(A) of classes 𝔈(a) = {prime ideals p : a ∉ p}, under symmetric difference and intersection. Its ideal lattice is isomorphic to the system of classes 𝔈(𝔞) under arbitrary unions and finite intersections. The existence of enough prime ideals (Thm 63) is proved by transfinite induction, and Theorem 70 shows that “every Boolean ring has an isomorphic algebra of classes” and “every ideal is the product of its prime divisors” are equivalent without choice. Theorems 68–69 classify all set-representations as restrictions of B(A) to subclasses of prime ideals. The topology, i.e. Stone spaces and duality, is explicitly deferred to “another paper”. | Read |
| NOTE-273 | Not All Language Model Features Are One-Dimensionally Linear | Defines a feature as irreducibly multi-dimensional when no rotation and translation makes its distribution either a product of independent parts (separable) or a mixture with a lower-dimensional component (Def. 2). Softened versions are the separability index S(f) and the ε-mixture index M_ε(f) (Def. 3). Clustering sparse-autoencoder dictionary elements by cosine similarity then finds circular representations of weekdays and months in GPT-2 (also 20th-century years) and in Mistral 7B. Replacing the circle coordinates at the day or month token causally changes the answer on “N days/months from X” prompts in Mistral 7B and Llama 3 8B, and in early layers the circle patch nearly matches patching the whole layer. The models’ task accuracy is modest on weekdays (29/49 Llama, 31/49 Mistral), high on months (143/144, 125/144), and near-trivial for GPT-2 despite its circles. | Read |
| NOTE-275 v2 | The logic of quantum mechanics | The paper argues heuristically that the experimental propositions of a quantum system correspond to closed linear subspaces of Hilbert space. Meet is intersection, join is closed linear span, and negation is orthogonal complement. The lattice satisfies L1–L4 and complementation L71–L73 but not the distributive law L6. The paper proposes the modular law L5 as its replacement. Under a finite-dimension assumption, it concludes that the propositional calculus of QM is an abstract projective geometry. The Appendix proves that orthocomplementations on P_{n−1}(F), n ≥ 4, are exactly the polarities of definite diagonal Hermitian forms with respect to an involutory anti-automorphism of F. | Read |
| NOTE-276 | A numerical algorithm for block-diagonal decomposition of matrix *-algebras with application to semidefinite programming | Given real symmetric A₁…A_m, the method finds an orthogonal P that block-diagonalises them all as simultaneously and finely as possible. That is the decomposition of the matrix *-algebra 𝒯 they generate into simple components (Algorithm 4.1) and then irreducible components (§4.2), with no group or algebra supplied in advance. The simple components are the connected components of the graph “Q_iᵀA_pQ_{i′} ≠ O” between the eigenspaces of one random combination A(r) = Σ r_pA_p. This is correct with probability 1 when span{I, A₁…A_m} = 𝒯 ∩ Sⁿ (Props. 3.2–3.4, 4.2). The structure theorem it relies on, Theorem 3.1(C) “if 𝒯 is irreducible then 𝒯 = Mₙ”, is false over ℝ as stated. The companion paper (Maehara & Murota 2010) handles the complex and quaternion types. | Read |
| NOTE-277 v2 | A topos foundation for theories of physics: I. Formal languages for physics | The programme paper. Its contention is that a theory of a physical system S is a representation of a typed “local language” L(S) (ground types Σ and R, function symbols A : Σ → R) in a topos. Physical quantities become arrows Σ_φ → R_φ, and propositions become sub-objects of Σ_φ, which form a Heyting algebra. Classical physics is the representation in Sets. The paper proves nothing. Its one argument is that the axiom ¬(A ε Δ) ⇔ A ε ℝ∖Δ is not validated by non-Boolean Heyting representations (§3.2.1). | Read |
| NOTE-278 | Toy Models of Superposition | In a toy autoencoder x′ = ReLU(WᵀWx + b), with n sparse synthetic features compressed into m < n dimensions, a linear model keeps only the top-m features, but with the output ReLU and sparse enough features the model stores more features than dimensions (“superposition”), in non-orthogonal directions whose interference the ReLU and a negative bias filter out. Whether a feature is dropped, superposed or given a dedicated dimension changes discontinuously with sparsity and importance, and in the n = 2, m = 1 theory this is a first-order phase change. With uniform features the directions settle into uniform polytopes, with feature dimensionalities clustering at 3/4, 2/3, 1/2, 2/5 and 3/8. A ReLU hidden layer creates a privileged basis in which monosemantic and polysemantic neurons coexist, and a model can compute |x| for more features than it has neurons. Everything is shown in toy models only, and the authors expect the geometry and learning-dynamics results to generalise least. | Read |
| NOTE-279 | The problem of hidden variables in quantum mechanics | Theorem 1 exhibits a finite partial Boolean algebra D, generated by 117 directions in E³, that admits no homomorphism onto Z₂. §4 embeds D in the projections of the spin-1 space of orthohelium’s 2³S₁ state, via α ↦ P J_α². So no assignment of 0/1 values to those quantum propositions respects all the Boolean relations within each commeasurable set. Theorem 0 makes the target precise: a partial Boolean algebra embeds in a Boolean algebra iff its Z₂-homomorphisms separate points. That is, hidden variables in the paper’s sense need enough “global valuations”, and quantum mechanics in dimension 3 has none. The same paper builds a classical hidden-variable model for spin ½ (§6). It argues that von Neumann’s no-go needed additivity on non-commuting observables (Theorem 3). | Read |
| NOTE-280 | On hypercomplex numbers | For associative algebras with a finite basis over an arbitrary field F, the paper proves the structure theory. A semi-simple algebra (no nilpotent invariant sub-algebra) is uniquely the direct sum of simple algebras (Thms 10, 17). Every simple algebra is the direct product of a primitive (division) algebra and a simple matric algebra, i.e. a full n×n matrix algebra (Thms 21–23). The maximal nilpotent invariant sub-algebra N contains all others (Thm 13), and A/N is semi-simple. When every non-invertible element is nilpotent, A = B + N with B primitive (Thm 28, with a proof correction added 1 Feb 1908). Section 8 lists the results as (i)–(vi). | Read |
| NOTE-281 | A closed set of normal orthogonal functions | The paper defines a closed orthonormal set {φ} on (0, 1) of functions taking only the values ±1, recursively by (2) and explicitly by (3)–(4). In binary x = Σ a_i/2^i, the functions are signed products (−1)^{a_{i₁}+…+a_{i_r}}; the nth has exactly n sign changes. It proves Fourier-like properties: uniform convergence for continuous F with the terms grouped in dyadic blocks (Thm II); pointwise convergence to ½[F(a−0)+F(a+0)] for bounded variation (Thm IV); localisation (Thm V); uniform Cesàro summability for continuous F (Thm VII); a continuous function with a divergent φ-series at any chosen point (Thm VIII); and uniqueness of expansions (Thms IX–X). It never mentions groups, characters or (ℤ/2)ⁿ. | Read |
| NOTE-282 v2 | On the Generalization of Equivariance and Convolution in Neural Networks to the Action of Compact Groups | Theorem 1 says that a feed-forward network whose layers are linear maps followed by pointwise nonlinearities, with every layer indexed by a homogeneous space G/H_ℓ of a compact group G, is G-equivariant (every layer transforming by the induced action) if and only if each linear map is a generalised convolution f ∗ χ with a filter on the double coset space H_{ℓ−1}\G/H_ℓ. The “if” direction is a short coset computation. The “only if” direction goes through the group Fourier transform: equivariant maps preserve isotypic components (Lemma 6) and act on each Fourier matrix by right multiplication, M ↦ MB (Lemma 10), which the convolution theorem (Prop. 2) turns back into a convolution. | Read |
| NOTE-283 | Progress measures for grokking via mechanistic interpretability | A one-layer ReLU transformer (P = 113, 30% of pairs, full-batch AdamW with λ = 1, 40k epochs) that groks modular addition implements a “Fourier multiplication” algorithm. The embedding maps a and b to cos/sin(w_k·a), cos/sin(w_k·b) at five key frequencies k ∈ {14, 35, 41, 42, 52}, with w_k = 2πk/113. Attention and MLP form cos/sin(w_k(a+b)), and the neuron-logit map W_L (≈ rank 10) reads out Σ_k α_k·cos(w_k(a+b−c)). Progress measures built from this (restricted and excluded loss) show training splits into memorisation (0–1.4k epochs), circuit formation (1.4k–9.4k) and cleanup (9.4k–14k), with the test-accuracy jump inside cleanup. | Read |
| NOTE-284 | The theory of topological commutative groups | For countable discrete abelian 𝔊, the character group X = Hom(𝔊, K), K = ℝ/ℤ with pointwise convergence, is compact and second countable (Thm 1). Characters separate points and subgroups, with annihilator correspondence and quotient/subgroup duality (Thms 2–4). An orthogonal pair (X, 𝔊) with trivial annihilators has each the character group of the other (Thm 5). By the First Fundamental Theorem, every compact second-countable abelian group is the character group of its discrete character group; the proof uses Peter–Weyl via Haar. Hence duality between countable discrete and compact second-countable abelian groups. Chapters III–IV give structure theorems for locally compact connected abelian groups (compact ⊕ ℝⁿ). Duality for general locally compact abelian groups is not proved here. | Read |
| NOTE-285 | A topos foundation for theories of physics: IV. Categories of systems | Proposes axioms for a category Sys of physical systems, symmetric-monoidal under composite ⋄ and under disjoint sum ⊔, whose arrows are translations of local languages. Each arrow j : S₁ → S is realised by a left-exact functor τ(j) between the systems’ topoi, together with arrows φ(j) : Σ_{S₁} → τ(j)Σ_S and β(j) : τ(j)R_S → R_{S₁}. Classical physics satisfies the scheme exactly. In quantum theory the disjoint sum H₁⊕H₂ satisfies it (the pulled-back arrow of Â₁⊕Â₂ is δ̆(A₁)), but the composite H₁⊗H₂ does not: the natural pull-back of δ̆(A₁) differs from δ̆(A₁⊗1̂) off the image of V(H₁), which the authors attribute to “operator entanglement”. | Read |
| NOTE-286 | The Platonic Representation Hypothesis | A position paper with one argument and three measurements. Measured with mutual 10-nearest-neighbour overlap, vision models that solve more VTAB tasks agree more with each other (78 models). Language models with lower bits-per-byte agree more with DINOv2, CLIP and others on Wikipedia image–caption pairs, and this alignment tracks HellaSwag and GSM8K scores. The cross-modal score “only reaches 0.16” out of a maximum of 1 (§6), and a CKA version “revealed a very weak trend” (App. A). The formal argument (§4.2, App. F) shows only this: in an idealised world of discrete events seen through bijective observations, the Bayes-optimal NCE critic is the pointwise-mutual-information kernel plus a constant, and that kernel is representable as an inner product under a sufficient smoothness condition (Prop. F.1). So every such modality shares one kernel, up to an additive constant. | Read |
| NOTE-287 | Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasets | Small decoder-only transformers (2 layers, width 128, 4 heads, ~4·10⁵ non-embedding parameters) trained on binary-operation tables over abstract symbols can reach 100% validation accuracy long after fitting the training set. In the headline run (division mod 97, 50% data, Adam with no weight decay, a budget of 10⁶ steps), training accuracy is near-perfect before 10³ steps, validation accuracy only near 10⁶, with little progress before 10⁵. The optimisation time to generalise rises steeply as the training fraction falls (on S₅ near 25–30% data, −1% data costs +40–50% median steps), and weight decay is the most data-efficient intervention tried. | Read |
| NOTE-288 v2 | Group Equivariant Convolutional Networks | Group convolution (eqs. 10–11) replaces translation by the elements of a discrete group G, so feature maps become functions on G and every layer is G-equivariant (eq. 12, with pooling and nonlinearities shown to commute with the action). With parameter counts held roughly fixed, p4-CNNs cut rotated-MNIST test error from 5.03% (planar baseline) to 2.28% (previous best 3.98%), and p4m convolutions cut plain-CIFAR10 error from 9.45% to 6.46% on a ResNet44 (Tables 1–2). | Read |
| NOTE-289 | Sur une espèce de géométrie analytique des systèmes de fonctions sommables | A priority note, not a paper of proofs. Riesz says his aim was an “analytic geometry” of square-summable functions, completed by his existence theorem (every square-summable coordinate sequence is the image of a square-integrable function). He states two consequences without proof. First, every linear operation U on square-summable functions that is continuous for convergence in mean is given by U(f) = ∫ f k for some square-summable k; uniqueness of k is not stated. Second, a completeness criterion for Schmidt’s problem. | Read |
| NOTE-290 | A topos foundation for theories of physics: III. The representation of physical quantities with arrows δ̆°(A): Σ̲ → ℝ̲≽ | Each bounded self-adjoint  becomes an arrow δ̆^o(A) : Σ → ℝ^⪰, where ℝ^⪰ is the presheaf of real-valued order-reversing functions on ↓V. At λ ∈ Σ_V it sends V′ ⊆ V to λ(δ^o(Â)_{V′}), and δ^o(Â)_V is the spectral-order-least operator in V above Â. The map  ↦ δ̆^o(A) is injective, but ℝ^⪰ is only an additive monoid, not the real-number object. Its Grothendieck completion k(ℝ^⪰) is an abelian-group object whose global elements are exactly the functions of bounded variation on V(H). | Read |
| NOTE-292 v2 | A topos foundation for theories of physics: II. Daseinisation and the liberation of quantum theory | A projector P̂ is mapped to the clopen sub-object δ(P̂) of the spectral presheaf Σ over the poset V(H) of abelian von Neumann subalgebras, by “daseinisation” (de Groote’s V-support): δ(P̂)V = the least projector in V above P̂. The map is injective and preserves ∨, but only δ(P̂∧Q̂) ⪯ δ(P̂)∧δ(Q̂). This represents the propositional language PL(S) in the Heyting algebra Sub_cl(Σ). A pure state gives the truth object T^ψ, and “A ε Δ” gets the sieve-valued truth value {V′ ⊆ V | ⟨ψ|δ(Ê[A∈Δ]){V′}|ψ⟩ = 1}. | Read |
| NOTE-293 | An Empirical Model of Large-Batch Training | The paper derives a local model in which the loss progress one step can make at batch size B is ΔL_max/(1 + B_noise/B), with B_noise = tr(HΣ)/GᵀHG (eqs. 2.7–2.8). Averaged over a run at fixed B, the model gives the steps/examples hyperbola (S/S_min − 1)(E/E_min − 1) = 1, which defines the critical batch B_crit = E_min/S_min (eqs. 2.11–2.12). Across eight tasks, B_crit spans about six orders of magnitude (from 20 to over 10 million, §3), and the Hessian-free B_simple = tr(Σ)/|G|² tracks it to about an order of magnitude (Table 1: run-averaged B_simple/B_crit runs from 0.05 for the SVHN VAE and autoencoder to 8 for SVHN). | Read |
| NOTE-294 v2 | A theory of concepts and their combinations I: The structure of the sets of contexts and properties | Aerts & Gabora model a concept as an entity with states that change under contexts, a “state context property system” (Σ, M, L, µ, ν). They report an 81-subject e-mail study in which 7 contexts shift the rated frequency of 14 exemplars of “pet” (for example dog 0.50 under “The pet is chewing a bone” against 0.12 in the unit context) and the applicability of 14 properties. They then postulate that contexts and properties each form a complete orthocomplemented lattice, and call the structure quantum-like because a state can be an eigenstate of e ∨ f without being one of e or of f (eq. 19). No theorem is proved, the lattice is not shown to be non-distributive or orthomodular, and the paper contains no Hilbert-space model and no treatment of combination; both are deferred to Part II. | Read |
| NOTE-295 | Thermodynamics of Prediction | For a system driven by a stochastic signal through a fixed Markov kernel, the average work dissipated as the signal steps x_t → x_{t+1} equals, in units of k_BT, the system’s instantaneous nonpredictive information, I[s_t;x_t] − I[s_t;x_{t+1}] (Eq. 14). Summed over a protocol, this total “nostalgia” lower-bounds dissipation and excess work (Eq. 18), and it adds to Landauer’s bound: −β⟨Q⟩ ≥ I_e + I_mem − I_pred (Eq. 21). All three are averages over paths and protocols. None of them is a per-operation or per-bit floor on the cost of storing or using predictive information. | Read |
| NOTE-296 | Stochastic Thermodynamics of Learning | For a perceptron whose weights follow overdamped Langevin dynamics and whose predicted labels are fast two-state processes, the information learnt about fixed random labels is bounded by the weights’ total entropy production: Σ_μ I(σ_T^μ:σ^μ) ≤ Σ_n [ΔS(ω_n) + ΔQ_n] (Eq. 16, k_B = T = 1). This defines a learning efficiency η ≤ 1. The cost side includes the change in the weights’ own Shannon entropy, and in the paper’s toy model η → 0.99 as the heat ΔQ → 0 (slow driving). So the bound is not a heat floor of k_BT ln 2 per bit learnt. | Read |
| NOTE-297 | Structural Realism: The Best of Both Worlds? | Worrall argues that the only position that honours both the no-miracles argument and the historical fact of radical theoretical change is Poincaré’s “structural or syntactic realism”. What survives theory change and explains predictive success is mathematical structure: equations carried over unchanged (Fresnel’s reflection/refraction amplitude ratios, reinterpreted as electric-vector amplitudes in Maxwell’s theory) or recovered as limiting cases under the correspondence principle (Newton from Einstein). The underlying ontology (elastic ether versus electromagnetic field) is not what survives. The support is one worked case and a general appeal to the correspondence principle. There are no formal definitions, and the paper says itself that “much clarificatory work needs to be done”, above all on what it is for one theory’s structure to approximate another’s (p. 121). | Read |
| NOTE-298 | Opening the Black Box of Deep Neural Networks via Information | The paper studies small tanh networks (layer widths down from 12 to 2) trained by SGD on a 12-bit, O(3)-symmetric synthetic rule, with mutual information estimated by binning each neuron into 30 bins over all 4,096 inputs. It reports two phases: a short “ERM” phase of a few hundred epochs in which I(T;Y) rises, and a long “compression” phase in which I(X;T) falls. The phases coincide with a drop in per-layer gradient SNR (from high-SNR drift to low-SNR diffusion, at about 350 epochs), and the converged layers sit on the IB curve at fitted β. Everything is shown on small synthetic tasks, with the explanations argued informally. | Read |
| NOTE-299 | A theory of concepts and their combinations II: A Hilbert space representation | Aerts & Gabora embed the “pet” data in ℂ¹⁴⁰⁰. Each of 1,400 “basic contexts” is one vector of an orthonormal basis, the ground state is the uniform superposition, and each context is the projector onto the span of its basic contexts. The Born rule then returns the measured frequencies as counting ratios, for example cat under “chewing a bone” = 75/303 = 0.25. “Pet fish” is modelled as the entangled state Σ_{u∈E} |u⟩⊗|u⟩/√100 in ℂ¹⁴⁰⁰⊗ℂ⁴⁰⁸, so that collapsing “pet” to goldfish collapses “fish” to goldfish too. Every projector in the model is diagonal in one basis, so the fitted model is a classical probability space in quantum notation, which the authors half-concede (a “quantization … of this set theoretical model”, §3.3). Two of the chosen counts are infeasible: parrot and guppy. | Read |
| NOTE-300 | The information bottleneck method | The paper defines relevant information as what X tells about a second variable Y and poses the information-bottleneck problem, min over p(x̃|x) of L = I(X̃;X) − β·I(X̃;Y), under the Markov chain X̃ ← X ← Y (eq. 15). Theorem 4 gives the exact formal solution p(x̃|x) = p(x̃)/Z(x,β)·exp(−β·D_KL[p(y|x)‖p(y|x̃)]), so the KL divergence emerges as the effective distortion. Theorem 5 gives a Blahut–Arimoto-style alternating iteration that converges but, being non-convex jointly, not necessarily to a unique solution. | Read |
| NOTE-301 | The approximation of one matrix by another of lower rank | For a real n×N matrix a, the rank-r matrix β nearest in the least-squares (Frobenius) distance is obtained by writing a = u′λU (u, U orthogonal, λ diagonal ≥ 0, “Theorem I”) and zeroing all but the r largest diagonal elements. The solution is unique unless λ_r = λ_{r+1}. The squared error is Σ_{i>r} λ_i², so the error is at most l(1−r/R)^{1/2}, with l the length of a and R its rank. The paper also argues that the resulting canonic components cannot straightforwardly be read as psychological factors. | Read |
| NOTE-302 | The Linear Representation Hypothesis and the Geometry of Large Language Models | Three readings of “concepts are directions” are made precise with counterfactual pairs, and proved to line up. The shared direction of word-pair differences in the unembedding space is a logit-linear probe (Thm 2.2). The embedding-space direction is a steering vector that leaves causally separable concepts unchanged (Thm 2.5). Under any inner product making separable concepts orthogonal, the Riesz map sends the first to the second (Thm 3.2). Softmax training fixes the representation only up to γ ↦ Aγ + β, λ ↦ A⁻ᵀλ, so no inner product is identified, and the paper chooses M = Cov(γ)⁻¹ by setting a free diagonal D to the identity (Thm 3.4). Evidence: 27 concepts on LLaMA-2 7B (26 show a common direction; thing⇒part does not), read from histograms and heatmaps with no test statistic, plus a Gemma-2B heatmap comparison. | Read |
| NOTE-303 | On the imbedding of normed rings into the ring of operators in Hilbert space | Theorem 1 is the first abstract characterisation of C*-algebras. Every normed -ring (a unital Banach -algebra with ‖xx‖ = ‖x‖·‖x‖, ‖x*‖ = ‖x‖, and e + x*x invertible) is isometrically *-isomorphic to a norm-closed -subalgebra of the bounded operators on some, not necessarily separable, Hilbert space. The proof builds, for each maximal left ideal M, a positive functional f vanishing on M. The inner product is (ξ, η) = f(yx) on R/M, and the construction takes the direct sum over all M. This is the GNS construction. Lemma 1 is the commutative case: such an algebra is isometrically *-isomorphic to C(𝔐) for its compact maximal-ideal space. §4 adds that the simple weakly closed rings on separable Hilbert space are exactly the factors of types I_n, II₁ and III (Theorem 3). | Read |
| NOTE-304 | The intrinsic parity of elementary particles | The paper defines a superselection rule: a decomposition of Hilbert space into orthogonal subspaces A, B, C, … between which there are no spontaneous transitions and no measurable quantities with non-zero matrix elements. Relative phases across subspaces, and hence relative parities, are then unobservable. It proves such a rule between integer and half-integer angular momentum, from time reversal with U_AKU_AK = +1 and U_BKU_BK = −1. It postulates, without conclusive evidence, a charge superselection rule. The consequence is that “all Hermitean operators represent measurable quantities” must be abandoned. | Read |
| NOTE-305 | Die Vollständigkeit der primitiven Darstellungen einer geschlossenen kontinuierlichen Gruppe | For a “closed continuous group”, a compact Lie group with invariant volume, the Fundamentalsatz (p. 752) proves the Parseval equality over all inequivalent irreducible representations E = (e_ik) of order n. It is n Σ_{i,k} |α_ik|² + … = V ∫ |x(s)|² ds for every continuous x, with α_ik = ∫ x ē_ik ds. For continuous class functions it reads |α|² + … = V ∫ |x|² ds with α = ∫ x χ̄ ds. The proof applies Hilbert–Schmidt theory to the convolution kernel z(st⁻¹), z = x x̃. The consequences are that finite combinations of matrix coefficients uniformly approximate every continuous function (Approximationssatz), that representations separate points (Satz I), and that characters separate conjugacy classes (Satz II). | Read |
| NOTE-306 v3 | Information-theoretic analysis of generalization capability of learning algorithms | If the loss ℓ(w,Z) is σ-subgaussian for every w, then the expected generalisation error of any learning algorithm P_{W|S} obeys |E[L_μ(W) − L_S(W)]| ≤ √(2σ²·I(S;W)/n) (Theorem 1). This extends Russo–Zou to uncountable hypothesis spaces, and the paper adds a high-probability version, n = (8σ²/α²)(ε/β + log(2/β)) (Theorem 3). Minimising empirical risk plus I(S;W), relaxed to a KL term against a prior Q, yields exactly the Gibbs algorithm (Theorem 5). Noisy ERM and adaptive composition are analysed through the same mutual-information quantity. | Read |
| NOTE-307 | Learning the Irreducible Representations of Commutative Lie Groups | Proposes “Weyl’s principle” (via Kanatani 1990) as a definition of disentangling: the elementary components of data are the irreducible subspaces of the representation of a symmetry group acting on it. It learns such a decomposition for one class of group fixed in advance, compact commutative subgroups of SO(D) (“toroidal”), from pairs (x, y) of raw data vectors related by an unobserved group element, y = W R(φ) Wᵀx + ε. The orthogonal basis W (2-D invariant subspaces) is fitted by SGD on a closed-form marginal likelihood, and the integer weights ω_j are then read off a batch rotated by a known 0.1°. The only experiment trains 100 filters on 250,000 white-noise 16×16 patches paired with random rotations of themselves (learned ω from −11 to 12), and uses the invariant √κ̂ for 1-NN on rotated MNIST, reported in a figure with no numbers. Spectral degeneracy plays no role. | Read |
| NOTE-308 | How much does your data exploration overfit? Controlling bias via information usage | Suppose an analyst reports statistic φ_T, chosen by any data-dependent rule T from m candidates each σ-sub-Gaussian. Then the selection bias obeys |E[φ_T − µ_T]| ≤ σ√(2·I(T;φ)) (Prop. 1), where “information usage” I(T;φ) ≤ H(T) ≤ log m. For argmax selection over φ ~ N(µ,I) the squared error is Θ(1 + H(T)) (Prop. 3). Adaptive analyses compose additively, with I(T_{k+1};φ) ≤ Σ_i I(Y_{T_i};φ_{T_i} | H_{i−1},T_i) (Lemma 1). Answering each query with Gaussian noise of variance σ²√j/n therefore keeps the k-th answer’s error at O(σk^{1/4}/√n) (Prop. 7). | Read |
| NOTE-309 | Understanding image representations by measuring their equivariance and equivalence | Given a fixed representation φ (HOG, or AlexNet Conv1–Conv5 before ReLU) and a transformation g of the input image chosen by the experimenter (flips, 90° and other rotations, rescaling by 2^{±1/2}, affine warps), it fits a linear map M_g on the representation space with φ(gx) ≈ M_g φ(x), by sparse or structured-sparse regression or by a “transformation layer” trained through the rest of the network, and fits “stitching layers” E with φ′(x) ≈ E φ(x) between different networks. In AlexNet, learned M_g recover most of the classifier’s accuracy for vertical flips and 90° rotations (top-1 error 0.75 uncompensated vs 0.43–0.51 and 0.44–0.53 across Conv1–Conv5, original 0.43), channels scored invariant rise to 99.61% for horizontal flips at Conv5, and Conv1–Conv2 are interchangeable between AlexNet and networks trained on ImageNet, Places or both. It detects no group and uses no spectrum. | Read |
| NOTE-310 | Notes on Landauer’s principle, reversible computation, and Maxwell’s Demon | Bennett states Landauer’s principle as a consequence of the Second Law. A logically irreversible step, meaning erasure or a merge of control flow, must export at least the lost entropy (k ln 2 per bit) to non-information-bearing degrees of freedom. That export need not take the form of heat (p. 1). Logically reversible operations, including copying onto a blank register and measurement, have no minimum cost. He calls “an intrinsic cost of order kT for every elementary act of information processing” a 20th-century “misconception” (pp. 5–6). Erasing random data can itself be thermodynamically reversible; the waste comes from applying a many-to-one operation to known data (pp. 1, 4). | Read |
| NOTE-311 | Applications of the theory of Boolean rings to general topology | Stone topologises the set 𝔈 of prime ideals of a Boolean ring by taking the sets 𝔈(a) as a basis. 𝔈 is then a totally disconnected, locally bicompact Hausdorff space, bicompact exactly when the ring has a unit (Thm 1), and every such space arises this way (Thm 2). Theorem 4 states that “the algebraic theory of Boolean rings is mathematically equivalent to the topological theory of Boolean spaces”: isomorphism ↔ homeomorphism, ideals ↔ open sets, quotients ↔ closed subsets, unit ↔ bicompactness, and subrings ↔ continuous images (Thm 7). The same paper also contains what are now called the Stone–Čech compactification (Thms 78–79, 88), the Stone–Weierstrass theorem (Thm 82), the Banach–Stone theorem (Thm 83) and closed ideals of C(X) ↔ closed sets (Thm 85). | Read |
| NOTE-312 | Studies on the Foundation of Quantum Mechanics. I | Husimi derives Birkhoff and von Neumann’s lattice axioms from statistical premises. Implication is P̄ ≤ Q̄ in every state (and requires compatibility), negation is Q̄ = 1 − P̄, and compatible propositions obey classical logic. Meet is obtained from “Ehrenfest’s principle” (additivity of mean values) via the top eigenvalue of aP + bQ (pp. 778–779), and the modular law, equivalently the parallelogram law |P| + |Q| − |P∩Q| = |P∪Q|, is proved under a finite-chain assumption. The orthomodular identity is used but never named or stated as an axiom. It appears as the step “since we admit traditional logic to any classical part … S + P∩Q = R” for R ⊃ P∩Q (p. 784), and as the case “(Q − P) + P = Q provided Q ⊃ P” of a classical identity (p. 780). | Read |
| NOTE-313 | An Introduction to Hyperplane Arrangements | The notes define the regions of a real arrangement (connected components of the complement) and the intersection poset L(A) with its Möbius function and characteristic polynomial χ_A(t) = Σ μ(x) t^{dim x}. They prove Zaslavsky’s theorem (Thm 2.5): r(A) = (−1)ⁿ χ_A(−1) and b(A) = (−1)^{rank A} χ_A(1), so the numbers of regions and bounded regions depend only on L(A), not on the face structure (Cor. 2.1, Fig. 2). The same machinery counts faces of every dimension (Thm 2.6: f_k = Σ_{x≤y, dim x=k} |μ(x,y)|). Later lectures add Whitney’s theorem, deletion–restriction, matroids and geometric lattices, broken circuits, supersolvability, the finite-field method, and the metric d(R, R′) = number of separating hyperplanes, whose zero set shows that a region is determined by its separating set (p. 89). | Read |
| NOTE-314 | Calculation of signal detection theory measures | A practical tutorial that gives closed-form SDT measures computed from the hit rate H and false-alarm rate F. They are d′ = Φ⁻¹(H) − Φ⁻¹(F); β = exp{[Φ⁻¹(F)² − Φ⁻¹(H)²]/2}; c = −[Φ⁻¹(H) + Φ⁻¹(F)]/2; the nonparametric A′ and Grier’s B″ (single-formula versions, eqs. 3 and 9); A_z = Φ(intercept/√(1+slope²)) from the z-ROC, whose slope is σ_noise/σ_signal; and A_d′ = Φ(d′/√2), which equals 2AFC proportion correct under the d′ assumptions. It also gives one-line commands for seven software packages. Its worked rating example (50 signal and 25 noise trials, noise SD larger than signal SD) shows d′ ranging from 0.84 to 1.86 across criteria. The authors conclude that d′ should not be used without rating-task evidence of equal variance. | Read |
| NOTE-316 | A decision-making theory of visual detection | Tanner and Swets model visual detection as testing a statistical hypothesis. The observer compares one sample of neural activity with a cutoff, and signal+noise and noise are Gaussian with equal variance, separated by d′ (the mean difference in noise-SD units, defined as the square root of Peterson and Birdsall’s d). The cutoff moves along a curve of P_SN(A) against P_N(A) (the curve now called the ROC; for d′ = 1 it passes through (.16, .50), (.50, .84) and (.84, .98)). The optimal operating point is where the slope equals β = [(1−P(SN))/P(SN)]·[(V_N·CA+K_N·A)/(V_SN·A+K_SN·CA)]. The 4AFC prediction is P(C)=∫F(x)³g(x)dx. With three paid observers, d′ estimated from yes-no data predicted 4AFC accuracy. The “false alarms are guesses” (high-threshold) hypothesis is rejected: false-alarm rate correlated with chance-corrected thresholds (ρ = .30, .71, .67; combined p ≪ .001), and all 12 fitted yes-no scatter lines miss the point (1, 1). | Read |
| NOTE-317 | Grokking and Generalization Collapse: Insights from HTSR theory | A depth-3, width-200 ReLU MLP trained on 1,000 MNIST images (the Omnigrok recipe, with weights and biases scaled ×8, MSE loss, AdamW, WD = 0) for 10⁷ steps goes through three phases read off the accuracy curves. In pre-grokking (to ~10⁵ steps) training accuracy saturates while test accuracy stays low. In grokking (~10⁵–10⁶) test accuracy rises to ~0.85. In “anti-grokking” (~10⁶–10⁷) it falls to ~0.45–0.5 while training accuracy stays near 1. The average HTSR power-law exponent α of the two hidden weight matrices goes 4.0 → 2.9 → 1.1 at the phase ends (Table 1). In the collapse phase, correlation traps (outlier eigenvalues of the elementwise-shuffled weight matrix) appear. The paper’s own weight-decay control shows FC2’s α below 2, and traps in both layers, without a collapse (Fig. 6, Table 2). That undercuts its headline claim that α < 2 “invariably” heralds collapse. | Read |
| NOTE-318 | New Evidence of the Two-Phase Learning Dynamics of Neural Networks | VGG-16 and ResNet-20 on CIFAR-10 (SGD with momentum, lr 0.1, 160 epochs) are compared across pairs of training times. Before an early “inflection point” (~2,500 iterations for VGG-16, ~100–500 for ResNet-20), a tiny parameter perturbation under identical SGD noise sends the run to a different basin by the end: loss barrier up to ~2, test disagreement ~0.15–0.5. After it, the same perturbation leaves the runs linearly connected. Also after it, the empirical NTK keeps changing step to step but stays within a bounded cosine distance of any later reference kernel (the “cone effect”, e.g. S ≈ 0.05–0.1 for VGG-16 vs ≈ 0.15–0.2 from initialisation). Switching to linearised training later gives better test accuracy (VGG-16 0.13 → 0.82 as the switch moves from ≤200 to 5,000 iterations). | Read |
| NOTE-319 | How do language models learn facts? Dynamics, curricula and hallucinations | ’An 8-layer, 44M-parameter decoder-only transformer trained with AdamW on synthetic biographies (64k individuals by default) learns factual recall in three phases. It first fits the marginal attribute-value distribution, then sits on a plateau exactly at the no-knowledge baseline, then acquires individual-specific associations. Plateau end grows with population as 0.43·N^0.81 (R² = 0.998, N = 4k–256k, 5 seeds). Attention patching from post-plateau checkpoints removes the plateau, and attention from the recall position to name tokens rises through it, so the plateau is when the attention extraction circuit forms. Nothing in the three phases is a compression of input information: the last phase adds individual-specific information.‘ | Read |
| NOTE-320 v2 | On the Information Bottleneck Theory of Deep Learning | Replicating Shwartz-Ziv & Tishby with their own code, the paper shows the information-plane “compression phase” appears only for double-saturating nonlinearities measured through an imposed binning/noise model: tanh compresses, ReLU/softplus/linear do not (binning, KDE, Kraskov; SZT task and MNIST), and re-binning the same tanh run evenly in net input removes it. Compression and generalisation dissociate in all four combinations, full-batch GD compresses as much as SGD, and the drift→diffusion gradient-SNR transition occurs in networks that cannot compress (ReLU, MNIST, a 1-1-1 linear net), so it is real but unrelated to compression. | Read |
| NOTE-321 v3 | The two dragons of cognition: recursive condensation for predictive processing | A Hypothesis-and-Theory essay, the cognitive statement of Li’s structural-learning programme. Intelligence pays once for exploratory search, condenses the result into stable discrete tokens, and then navigates cheaply. The cortex and the sleep rhythms are proposed as this cycle’s implementation (gamma as the expand/contract clock, the laminar circuit, STDP, SWRs nested in Slow-4). Charitably read, Savitch stands for memoisation and Urysohn for “collapsed, separated classes admit a simple readout”. On that reading the core is a coherent restatement of amortised inference and complementary learning systems, with untested and largely non-discriminating predictions. The headline scaling law, linear cortex giving exponential reach (Theorem 2), is stated without argument, and the claim that collapse defeats the curse of dimensionality leaves the cost of learning the collapse unaddressed. | Read |
| NOTE-322 v2 | Structural Decoupling: A Scaffold-Flow Theory of Generalization and Alignment | Li’s structural learning theory (StrLT, developed in the companion arXiv 2602.07974) splits multi-regime learning into discovering contexts (the “trap”, or scaffold) and predicting within one (the “funnel”, or flow). Width is the least number of cells on which a γ-contractive, low-risk predictor suffices. It is incomparable with the per-cell VC dimension, forces an error floor when fewer than w cells are allocated, and costs Ω(w log w) samples to discover. These results hold in repaired form, and are close to definitional. The CS estimator reweights a spatial graph by prediction agreement. It is shown to count components for a given predictor, not width itself. The decoupling prescription says to train routing on structural signals, not task loss, and to freeze consolidated contexts. It is a plausible, testable design hypothesis with continual-learning precedent, but the additive Rademacher bound it is said to follow from holds for joint training too. The safety section recasts alignment as scaffold alignment by analogy, and is asserted. | Read |
| NOTE-323 | Local Urysohn Width: A Topological Complexity Measure for Classification | >- It defines local Urysohn width uw_{D₀}(P, γ): the least number of connected sets of diameter ≤ D₀, each carrying a continuous classifier correct on the margin-γ safe region it meets, needed to cover that safe region. It proves: - uw = w on a bouquet of w circles with safe balls at the antipodes, when 3γ/2 ≤ D₀ < L/2 − 3γ/4 (Thm 4.1); - uw ≥ w·m, with m = Θ(L/D₀) safe balls per loop, so uw = Ω(w·L/D₀) (Cor 5.1); - two-way non-determination with VC dimension (Thm 6.1); - an Ω(w log w) sample lower bound via label-permuted coupon collection (Thm 7.1); - uw ≥ 2β₁/Δ₀ for good, convex, bounded-adjacency covers (Thm 8.5). The proofs are correct. The obstruction is metric, as the paper concedes in Remark 8.11: patches cannot reach across the wedge point. Because Urysohn’s lemma makes local correctness automatic on any patch, the measure is a connected covering number of the safe region that does not depend on the labels. | Read |
| NOTE-324 | Structural Learning Theory: A Metric-Topology Factorization Approach | >- The formal core of Xin Li’s structural-learning programme. Width w(P; γ, δ) is the least number of open cells on each of which some predictor is γ-contractive with conditional risk ≤ δ. The paper proves that width is incomparable with the per-cell VC dimension (Thm 2.2). It shows that with K < w cells there is an n-independent error floor η(w, K), under a non-degeneracy assumption stated in the body (Thm 2.4, Assumption 2.3). Width is at least c·β₁·L/D₀ under a bounded-overlap assumption (Thm 2.5), and discovering all basins costs Ω(w log w) samples (Thm 2.6). The CS-Laplacian eigenvalue count converges uniformly to the predictor-relative count w_G(P) when n ≳ (H_G + d_X log(1/r_x) + log(1/δ′))/(r_x^{d_X} g_eff²) (Thm 3.5); no result shows that w_G equals width. There are no experiments. | Read |
| NOTE-325 | On Context-Content Uncertainty Principle | The paper assumes structured content has far lower entropy than context, H(Φ) ≪ H(Ψ), and from the chain rule H(Φ,Ψ) = H(Φ) + H(Ψ|Φ) concludes that inference should establish content first and then resolve context. It then derives four layers of “operational principles” and a reading of five brain theories as instances. The principles cover attention, learning rates, memory, staged learning and hierarchy. All of this is argued, not shown. There are no experiments, the abstract’s simulations are absent, and the proofs of Theorems 1, 3 and 6–8 are wrong as written. | Read |
| NOTE-326 | ’What is a Thing?’: Topos Theory in the Foundations of Physics | The Döring–Isham programme in one volume. A theory of a system is a representation of a typed language L(S) in a topos. In quantum theory, presheaves over the abelian von Neumann subalgebras V(H), daseinisation sends projectors injectively to clopen sub-objects of the spectral presheaf Σ, preserving ∨ but not ∧. A pure state gives sieve-valued truth values. Every bounded self-adjoint  becomes an arrow Σ → ℝ^↔ whose value at a point is a pair of monotone functions, an interval that widens as contexts coarsen. Most of it reprints papers I–IV. New are the inverse-image corollary linking PL(S) and L(S), values in a pseudo-state, and the algebra of the quantity-value candidates. The Heyting structure on Sub_cl(Σ) is still only sketched. | Read |
| NOTE-327 | A Topos Perspective on the Kochen-Specker Theorem: III. Von Neumann Algebras as the Base Category | Hamilton, Isham & Butterfield move the series’ base category from operators (O) and Boolean subalgebras (W) to the poset V of commutative von Neumann subalgebras of B(H). There they restate Kochen–Specker as “the spectral presheaf Σ(V) = Gelfand spectrum of V has no global elements” (dim H > 2, cited, §2.2). They identify the coarse-graining presheaf G(V) = L(V), G(i)(P̂) = inf{Q̂ ∈ L(V₂) | P̂ ≤ Q̂} (Def. 3.1), with the presheaf CloΣ of clopen subsets of the spectra; the isomorphism is asserted, and part IV proves it. A state ρ yields the sieve-valued valuation ν^ρ_V(P̂) = {V′ ⊆ V | ρ(G(P̂)) = 1} (Def. 3.4) and the support projectors inf{P̂ ∈ L(V) | ρ(P̂) = 1}. These form a global element of G and hence an “interval valuation”, a subobject of Σ (§§4.2–4.4). The probability-r valuations give subobjects of G but not global elements. | Read |
| NOTE-328 | A Topos Perspective on the Kochen-Specker Theorem: IV. Interval Valuations | Butterfield & Isham show, over the poset V of commutative von Neumann subalgebras, that sieve-valued valuations and “interval valuations” (assignments of support projectors, or of subsets of Gelfand spectra) determine each other under stated conditions. If supports s(α, V) = inf{P̂ | α_V(P̂) = true_V} form a global element of the coarse-graining presheaf G, then α_{V₁}(P̂) = {V₂ ⊆ V₁ | G(s(α, V₁)) ≤ G(P̂)} is a sieve-valued valuation obeying FUNC (Theorem 3.1). There is an analogue for “tight” subobjects of Σ (Theorem 3.2). Both are satisfied by every state’s valuation ν^ρ. The ordering ≤ (or ⊆) is shown to be the natural relation securing sievehood, null, monotonicity, exclusivity and unit (§4). The review §2.4 also supplies the proof, via state extension, that G ≅ CloΣ: restricting the clopen set of P̂ to V₂ gives the clopen set of its coarse-graining. Part III had only asserted this. | Read |
| NOTE-329 | A Topos Perspective on the Kochen-Specker Theorem: II. Conceptual Aspects, and Classical Analogues | Butterfield & Isham argue that the sieve-valued “generalised valuations” of part I are not a quantum peculiarity but the natural valuations for any presheaf of propositions on any small category. Three supports are offered. (1) Classical physics: the value presheaf Υ(Ā) = Ā(S) on the category M of measurable functions has global sections (one per microstate, eq. 3.7), yet a macrostate R ⊆ S yields a sieve-valued valuation ν^R(A ∈ Δ) = {f_M | B̄(R) ⊆ f(Δ)} (eq. 3.10) with the same FUNC property as the quantum ν^ρ. (2) A proof that a sieve-valued valuation on any presheaf G obeys generalised FUNC, ν(B, G(f)(d)) = f*(ν(A, d)), iff it is a natural transformation G → Ω, i.e. a subobject of G (Theorem 4.1). (3) An informal argument, explicitly “not a genuine deduction” (§5.2), that if partial truth is fixed by which weakenings of a proposition are totally true, the truth value is a sieve. | Read |
| NOTE-330 | Damasio & Carvalho — The nature of feelings | An Opinion with no new data. Feelings are the felt side of interoceptive body maps, and they report homeostatic value. Feeling does not need the insula: the authors’ own patient with both insulae destroyed still feels. It needs the upper brainstem, where whole-body maps first assemble. The evolutionary story (felt maps beat unfelt ones because they support learning and anticipation) and the cellular one (unmyelinated, ligand- and ion-permeable interoceptive axons, with ephaptic coupling, as the root of sentience) are hypotheses, and are presented as such. | Read |
| NOTE-331 | Bechara, Damasio, Tranel & Damasio — Deciding advantageously before knowing the advantageous strategy | Ten controls and six ventromedial prefrontal patients play the four-deck gambling task while anticipatory skin-conductance responses (SCRs) and verbal reports are tracked. Every control and no patient develops anticipatory SCRs; three patients who can state the right strategy still choose badly. Controls prefer the good decks significantly only from the hunch period, and the pre-hunch SCR effect is a group-by-period interaction, not a deck difference, so “before knowing” is better supported for articulated strategy than for any awareness at all. | Read |
| NOTE-332 | Damasio — The somatic marker hypothesis and the possible functions of the prefrontal cortex | The somatic marker hypothesis as its author stated it in 1996. Ventromedial prefrontal cortex stores links between classes of situation and the body states that accompanied them; on recurrence it re-enacts those states, via the body or an “as if” loop, and the re-enacted state marks imagined option-outcome pairs as good or bad, overtly as a feeling or covertly as a bias, pruning the space reasoning must search. The evidence is summarised from earlier lesion and skin-conductance studies, without numbers. The mechanism is argued, not shown, and the paper says it is not a theory of prefrontal cortex as a whole. | Read |
| NOTE-333 | Topos Theory and Consistent Histories: The Internal Logic of the Set of All Consistent Sets | Isham takes the poset B of all Boolean subalgebras (“windows”) of the history orthoalgebra UP, ordered by coarse-graining, and shows that the presheaf A_d(W) = {α | some d-consistent W′ ⊇ W contains α} is a subobject of the constant presheaf ΔUP, whereas the naive “realisable in W” assignment is not a presheaf at all (§4.1–4.2). The probability claim ⟨α, p⟩ then gets the sieve-valued semantic value {W ⊆ W₀ | ∃ d-consistent W′ ⊇ W with α ∈ W′} if d(α, α) = p and ∅ otherwise (4.16), a global element 1 → Ω in Set^B, so the logic of “all consistent sets at once” is the distributive but non-Boolean Heyting algebra of sieves on B. | Read |
| NOTE-334 | Some Possible Roles for Topos Theory in Quantum Theory and Quantum Gravity | Isham & Butterfield argue, without proving anything new, that presheaf toposes over a base of “contexts” suit physics because the subobject classifier Ω is fixed by the base. They say this answers the objection that many-valued logics are arbitrary (§2.2), and that it keeps the logic distributive (§1.1). They then sketch seven applications. Five are speculative one-paragraph proposals (frames, observers, causal sets, TQFT, synthetic-differential-geometry time in continuous histories). One (§3.7) recaps their Kochen–Specker results: KS ⇔ the dual presheaf D(Â) = Hom(W_A, {0,1}) on the operator category O has no global sections (dim H > 2), and every state ψ gives a FUNC-obeying sieve-valued valuation ν^ψ(A ∈ Δ) = {f_O : Â → B̂ | Ê[B ∈ f(Δ)]ψ = ψ}. | Read |
| NOTE-336 | Chalmers — Facing Up to the Problem of Consciousness | The easy problems of consciousness are problems of explaining functions, which a mechanism explains; the hard problem is that “why is the performance of these functions accompanied by experience?” survives the explanation of every function. The argument is conceptual: the easy phenomena are functionally definable and experience is not. The positive part takes experience as fundamental and proposes structural coherence and organizational invariance as nonbasic psychophysical principles, with a double-aspect theory of information as a speculative basic one. Nothing is measured; the invariance argument is a one-page sketch. | Read |
| NOTE-337 | A Framework for Representing Knowledge | The frame memo. A frame is a stereotyped situation-structure whose terminals carry conditions and weakly bound defaults. Frames sharing terminals form systems whose transformations encode moves, actions and shifts of viewpoint, and mismatches are routed through a learned similarity network. Applied to vision, imagery, language, memory, search and control, with an appendix arguing that monotonic, consistency-seeking logic cannot carry commonsense knowledge. A programme statement: nothing is built or measured, and the author says what is missing. | Read |
| NOTE-338 | Where Am I? | A first-person story with an argument inside. With his brain in a vat in Houston radio-linked to his body under Tulsa, the narrator tests three answers to “where am I?”: where the body is, where the brain is, where the point of view is. He favours the third and finds it unclear. A computer duplicate of his brain can take over his body with no detectable difference, and when duplicate and brain drift out of step there are two persons in one body. Intuition pumps, no thesis defended to the end. | Read |
| NOTE-339 v2 | Examining the Society of Mind | An exposition, read in full. Singh dates the Society of Mind to Minsky and Papert’s early-1970s robot work, finds its agent in the procedure-bearing frame of 1974, and quotes the unpublished 1976 book drafts. He sorts the 1986 book’s mechanisms into agents, simplest agents, agency construction, problem solving, communication and growth. Agents need no shared code: K-lines, randomly wired buses and paranomes stand in for messages. He finds near-relatives in Bayes nets, case-based reasoning, blackboards, Cyc and Soar, and concludes that the theory has never been implemented. Its claims of lineage are asserted, not shown. | Read |
| NOTE-340 | List — What is it like to be a group agent? | A short, conditional argument. Group agents are real by a thin functionalist definition and a naturalistic indispensability argument, and they have consciousness as awareness. Phenomenal consciousness turns on a bridge principle. Agency-, biology- and information-based principles are surveyed, and IIT is adopted. Three structural reasons (functional decomposability, robustness of steering bodies to partial randomisation, processing done mainly inside members) are said to make a group’s Φ low. The exclusion postulate is a second route. Nothing is computed. The result is used to ground a normative asymmetry: group agents have only derivative rights. | Read |
| NOTE-341 | The Computational Boundary of a “Self” | A hypothesis essay. A Self is the set of parts that pursue goals together, and its boundary is the farthest region of space and time it can measure and act on, its “cognitive light cone”. Selves grow from homeostatic loops by adding memory, anticipation and networks, and cells form larger Selves by sharing bioelectric state through gap junctions. Every level that has its own goal is a Self, so living systems hold many nested Selves at once; the paper says this against IIT in one bracket. It has no model, no measurement of the light cone and no new data, and it confines claims about experience to a closing speculation. | Read |
| NOTE-342 | Chalmers — Does a rock implement every finite-state automaton? | Implementation needs strong, counterfactual-supporting conditionals for every transition in the table, not one run, so Putnam’s rock does not implement every FSA. Repaired, the triviality result survives for weak formalisms. A clock plus a dial implements every inputless FSA. The right input–output dependencies plus an input memory and a dial implement every FSA with those dependencies. Combinatorial-state automata, with independently varying components in distinct physical regions, demand fine-grained causal structure, and a blind implementation must grow exponentially. Logically possible false implementations and an overstrict independence condition are left open. Minds attach to (system, CSA) pairs, so the Chinese room holds two. | Read |
| NOTE-343 | Rupert — Challenges to the Hypothesis of Extended Cognition | Rupert separates extended cognition (HEC) from embedded cognition (HEMC) and from content externalism, then argues that HEC loses to HEMC on conservatism. LIT-097’s criteria give a dilemma: without past endorsement they overgenerate beliefs; with it the organism is privileged. Memory research (conversation, negative transfer, the generation effect, power laws) shows external stores are a different kind, and a generic kind spanning both does no explanatory work. | Read |
| NOTE-344 | Plain Talk About Neurodevelopmental Epistemology | The first worked mechanism of the society-of-agents view, then “The Society of Minds”. Agents too simple for language exchange no messages: each argument sits at a fixed location on shared channels (c-lines), and the agents themselves are short-term memory. A specificity gradient makes low-level communities local, persistence-memory and a case-shift handle interruptions without a stack, and the infant’s internal “cognitive cases” are conjectured to precede and shape linguistic cases. Speculation throughout; the author says so. | Read |
| NOTE-345 | Chalmers — Could a large language model be conscious? | Asks for a feature X that indicates LLM consciousness or its absence. Self-report is fragile and trained in. Conversation and general intelligence give some limited reason. Six obstacles stand against it: biology, senses and embodiment, world and self models, recurrence, a global workspace and unified agency, the last three strongest, all but biology temporary. On mainstream assumptions, with at least 1/3 credence per requirement, that gives under 10% for current LLMs and 25% or more for conscious LLM+ systems within a decade. The numbers are illustrative, biology is set aside rather than answered, and the twelve “challenges” are offered as roadmap or red flags. | Read |
| NOTE-346 | Dennett — Facing Backwards on the Problem of Consciousness | A three-page reply to Chalmers’s “Facing Up”. The easy/hard split misdirects research: a vitalist could pose the same hard problem of life, and a hard problem of perception set aside from its “easy” parts would be an artifact. Chalmers’s reason why experience differs restates the claim. Subtracting every function from one’s own consciousness leaves nothing but a conviction. Adding experience to physics’ fundamentals would need independent evidence, which is absent. Argument by analogy, with one introspective premise. | Read |
| NOTE-347 | Chalmers — Absent Qualia, Fading Qualia, Dancing Qualia | Organizational invariance, that fine-grained functional isomorphs of a conscious system have the same experiences, is defended by reductio over gradual neuron replacement. Absent qualia would imply a rational being systematically wrong about its own fading experience. Inverted or absent qualia would imply experience that flips with a switch and cannot be noticed. Both are judged implausible, not impossible. The paper extends the argument to a population of homunculi and to a single record-keeping homunculus. The conclusion is natural, not metaphysical, supervenience of experience on organisation, and it says nothing about systems that are not isomorphs. | Read |
| NOTE-348 | The Emotion Machine | Read in the 2005 draft. Emotions are Ways to Think: each emotional state is a selection of mental resources turned on and off, made by Selectors that Critics trigger when they recognise a type of problem, and ordinary thinking uses the same switching. On this design sit six levels of mental activity, panalogies that link descriptions across realms, and a Self that is a network of partial models. It is argued by example and analogy, with no experiment and few neural claims. Against Damasio, the body is a resource the brain exploits, not what an emotion is made of; on Elliot it proposes, without evidence, the reverse causal direction. | Read |
| NOTE-349 | Searle — Minds, brains, and programs | A man who follows English rules for manipulating Chinese symbols can answer Chinese questions like a native speaker without understanding Chinese, so no program is by itself sufficient for understanding. Six replies are answered; the systems reply by having the man internalise the room. Searle grants that machines could think, if they had the brain’s causal powers. The argument concerns intentionality, and its answer to the systems reply rests on treating the internalised system as a part of the man, which is the point in dispute. | Read |
| NOTE-350 | Intentional Systems | Defines an Intentional system as anything whose behaviour can be predicted by ascribing beliefs and desires and assuming rationality, and makes the status relative to the predictor’s strategy and indifferent to the system’s matter and consciousness. Argues that Intentional theory is vacuous as psychology because it presupposes rationality, that behaviourism smuggles it in, and that every content-ascribing theory owes a “loan of intelligence” that must be repaid by analysing away a little man. Ends on belief’s two norms, truth and accurate avowal. | Read |
| NOTE-351 | Intelligence without representation | A methodological manifesto with working robots behind it. Brooks argues that AI should build complete autonomous Creatures incrementally and test them in the real world, and that intelligence should be decomposed into parallel activity-producing layers, each running from sensing to action, not into perception, central reasoning and action. His robots have no central representation or control, and their coherence exists “in the eye of an observer”, as in Minsky’s account of human behaviour. The evidence is three layers on one robot, described, not measured, and the broad hypothesis about representation is flagged as a hypothesis. | Read |
| NOTE-352 | K-Lines: A Theory of Memory | Memory as reinstatement: a K-line, attached on a memorable event to the agents then active, later re-imposes that partial mental state. The level-band principle limits it to an intermediate band of levels, so the present is seen as an instance of the past without re-imposing the old answer. K-lines build on earlier K-lines into a K-pyramid against the perceptual P-pyramid; cross-exclusion makes conflicting details cancel into abstraction; learning needs a third, goal-holding net. A programme statement: no simulation, and the P→K link is left unspecified. | Read |
| NOTE-353 | True Believers: The Intentional Strategy and Why It Works | Belief is objective but visible only through a strategy: a true believer is any system “reliably and voluminously predictable” by treating it as a rational agent with the beliefs and desires it ought to have. Adopting the stance is free; its success is a fact, and Laplacean Martians who skipped it would miss real patterns. Thermostats and people differ in degree, by how tightly their states are tied to one interpretation. Evolution explains easily why the strategy works; how the machinery does it is open, and the language of thought is a bet, not a necessity. | Read |
| NOTE-354 | Chalmers — The Meta-Problem of Consciousness | The meta-problem, why we judge that consciousness poses a hard problem, is an easy problem to be solved in topic-neutral terms. The paper surveys thirteen mechanisms and favours introspective models that attribute primitive relations of acquaintance to primitive qualities. It then poses a meta-problem challenge: a theory’s basis of consciousness should explain our judgments about consciousness, which IIT and biological theories struggle to meet. It blocks debunking arguments for illusionism, but concedes a residual coincidence. It argues that only strong illusionism dissolves the hard problem, and rejects it by a Moorean argument. Nothing is measured; the solution offered is an explanandum sketch. | Read |
| NOTE-355 | Turing — Computing Machinery and Intelligence | Turing replaces “Can machines think?” by whether a digital computer can play the imitation game, predicts that by about 2000 a 10^9-bit machine will hold an average interrogator to 70 per cent right identifications after five minutes, and answers nine objections. The answer to the argument from consciousness is that its extreme form is solipsism. The positive case is admitted to be weak (“recitations tending to produce belief”); the programme is to educate a child-machine. | Read |
| NOTE-356 | Chalmers — Extended Cognition and Extended Consciousness | Chalmers restates the 1998 extended-mind thesis as a claim about constitution through sensorimotor interaction, because the original statement is satisfied by wired-in “extended circuits” that the critics accept. He keeps the perception-action boundary as the strongest objection, and argues that consciousness does not extend because it needs information directly available for global control, and perception makes availability indirect. Both moves are proposed and defended against a few cases, not demonstrated. | Read |
| NOTE-357 | Dennett — Quining Qualia | Qualia are supposed to be ineffable, intrinsic, private and directly apprehensible properties of experience. Fifteen intuition pumps argue that the pretheoretical concept is confused and that nothing has all four marks. The core move: an inversion in early processing and an inversion in memory-linked reactions are introspectively indistinguishable, so a subject has no privileged access to which happened. In place of qualia the paper offers practically ineffable, idiosyncratically detected public properties. It is argument by example throughout, and the author says so. | Read |
| NOTE-358 | Chalmers — The combination problem for panpsychism | A taxonomy, not a solution. The combination problem is three problems (subject, quality, structure) plus four smaller ones (unity, boundary, awareness, grain). Each yields an argument against constitutive panpsychism, and subject-summing and structural mismatch are the strongest. Responses fall into emergent, autonomous, identity and combinatorial panpsychism. The non-combinatorial ones pay in mental causation or revised physics. Phenomenal bonding, quantum holism, small palettes and informational composition are judged most promising, but none is shown to work. James’s argument at its origin is an argument against group minds, and a footnote objects to IIT’s exclusion postulate that it makes consciousness extrinsic. | Read |
| NOTE-359 | High-level perception, representation, and analogy: A critique of artificial intelligence methodology | Traditional AI models of discovery and analogy (BACON, the Structure-Mapping Engine, ACME) start from representations built by people who already know the answer, and so skip high-level perception, where most of the difficulty lies. Two informal arguments say the gap cannot be closed later by a separate representation module: analogy shapes perception, and the right representation depends on the task. Copycat is described as an architecture that builds representations and mappings together. Argued well; nothing is measured in the paper. | Read |
| NOTE-360 | Selfridge — Pandemonium | A proposal, with a preliminary Morse-code trial, for pattern recognition by a hierarchy of parallel “demons”. Data demons hold the input, subdemons compute features, cognitive demons shout weighted sums, and a decision demon takes the loudest. It adapts by hill-climbing on the weights, by culling and breeding subdemons through mutation and “conjugation”, and in principle by adapting its own control demons. The only result is reported in the discussion: hill-climbing “does work”, subdemon selection “did not do what we hoped”, and the best single subdemon was right 90% of the time. | Read |
| NOTE-361 | Jokes and the Logic of the Cognitive Unconscious | Humour as the teaching and engaging of “censors”: learned, unconscious suppressors of thought-paths known to fail (paradox, circling, false analogy, prohibited wishes). Commonsense logic is too unreliable to repair, general methods can only be corrected subtractively, so minds accumulate negative meta-knowledge, and jokes, built on unexpected frame-substitution, are how it is learned. This explains why logical nonsense is funny in the same way as Freud’s forbidden subjects. An essay of conjectures, with no data. | Read |
| NOTE-362 v2 | Kammerer — How a materialist can deny that the US is probably conscious | The Sophisticated Anti-Nesting Principle. A whole W with a functional property P that would normally suffice for conscious state S lacks S if some part of W plays a role that (A) requires the part to have conscious states representing W and (B) is needed for W to have P (or any other property sufficient for S). The SAP leaves the antheads and Block’s tiny-people brain conscious, permits some group consciousness, and denies the US conscious states because its citizens represent it and could not be replaced by parts that do not. Its defence is an Occam-style rule against ascribing consciousness where other subjects’ states explain the behaviour, plus a tu quoque on residual arbitrariness. | Read |
| NOTE-363 | Clark — Intrinsic content, active memory and the extended mind | Clark defends LIT-097 against Adams and Aizawa’s intrinsic-content objection: the notion is unclear, silicon could carry it, and their own concession that not every cognitive state needs non-derived content lets a conventional encoding serve as a belief’s vehicle. Against the active-memory objection, he concedes the notebook is static and argues that how and when memory is updated is a difference below the level that matters. He closes on brains as open-ended controllers and persons as forensic, not biological, items. | Read |
| NOTE-364 | The Self as a Center of Narrative Gravity | A self is an abstractum like a centre of gravity, posited by interpretation, and like a fictional character it is indeterminate beyond what its story fixes. A mindless novel-writing robot can author a self whose story is true of the robot. Brains are bundles of partly autonomous systems that make themselves cohere into one autobiography, and when the story coheres around two points there are two selves. The essay argues by analogy and thought experiment. Its evolutionary account of self-talk is speculation, and its evidence is cited. | Read |
| NOTE-365 | Integrated Information Theory 3.0 | The 2014 restatement of IIT. Five axioms of experience become five postulates about mechanisms in a state, and an experience is identified with the maximally irreducible conceptual structure of a complex. Exclusion is the anti-nesting rule: of all overlapping sets of elements, only the one with locally maximal Φ is conscious, so no subset or superset of a complex is. It is postulated from the axiom that experience has definite borders; Occam’s razor is invoked only for exclusion within a mechanism. Logic-gate examples give minor complexes, a conscious inactive network, a minimally conscious photodiode and a feed-forward zombie. Nothing larger than about a dozen elements is computable. | Read |
| NOTE-366 | Block — Troubles with Functionalism | Functionalism fixes mental states only by their relations to inputs and outputs, so a body run by a billion radio-linked people, each executing one line of your machine table, is functionally equivalent to you. There is prima facie doubt that it has qualia, and Block argues the doubt has a rational basis: it is unlike us in psychology and neurophysiology, and it was built to mimic us. The doubt does not depend on the parts having minds. Putnam’s anti-nesting stipulation is an ad hoc patch that fails in every version Block tries. Psychofunctionalism secures beliefs but perhaps not qualia, and no account of inputs and outputs avoids both liberalism and chauvinism. | Read |
| NOTE-367 | Dennett & Kinsbourne — Time and the Observer | The Cartesian Theater is the tacit assumption that some place or moment in the brain makes contents conscious, so that arrival order there fixes experienced order. The Multiple Drafts model replaces it: discriminations are made once, locally, and revised in parallel; temporal order is represented by content, not by the timing of vehicles. Four timing “anomalies” then need no backward projection. At sub-second scales the difference between pre- and post-experiential revision is said to be only verbal. It is a conceptual argument over published data; no experiment is run. | Read |
| NOTE-368 | Adams & Aizawa — The bounds of cognition | Adams and Aizawa grant LIT-097’s parity sentence but deny that any actual case meets it. Cognition, they assume, needs non-derived content and a distinctive kind of causal process. Otto’s inscriptions have only derived content, Otto’s retrieval uses vision and motor control that Inga’s does not, and coupling a process to its surroundings does not extend it. So cognition is brain-bound as a contingent fact, and human-plus-tool systems are too motley for a science. | Read |
| NOTE-369 | Chalmers — Foreword to Supersizing the Mind | Ten years after LIT-097, its co-author says the iPhone has made the thesis vivid, that the only principled objection is the perception-action boundary, and that the right reply is to let belief-ascription follow explanatory purpose, so that Otto’s belief is extended for some explanations and not others. Consciousness probably stays internal, because no twin case for it can be built. The thesis needs only a weak parity-style functionalism. | Read |
| NOTE-370 | Shanahan, McDonell & Reynolds — Role play with large language models (read for the self) | Read for the self. The simulator has no beliefs, goals or agency, “not even simulated versions”; simulacra only role-play characters that have them, so when an agent says “I” there is “no-one at home”. The paper names, and does not answer, the question of which self a dialogue agent would act to preserve: hardware, process or instance. The denial of a self follows from the framing; no argument rules out a conscious actor behind the roles. | Read |
| NOTE-371 | Dennett — Reply to Professor Stich | Dennett accepts Stich’s summary of Brainstorms and answers his three charges. The evolutionary grounding of rationality is deliberately minimal. Full rationality is an idealisation, irrationality has no stable description, and so personhood rests on a concept “we only imperfectly achieve”. On pain, eliminativism and the reality of suffering are reconciled by policy: biting the bullet, reform and common sense each have uses, and Dennett stays with “there are no such things as pains, although of course people do feel pain”. | Read |
| NOTE-372 | Self models | Metzinger’s compact statement of the self-model theory of subjectivity. No substantial self exists; there is a self-model, partly conscious (the PSM), used for global control. A phenomenal self exists if and only if the PSM is transparent; a first-person perspective is a transparent model of the intentionality relation. Self-models can be unconscious and artificial, and embodiment comes in three orders. The central claim is stated with a prediction, not argued; the examples are cited. The online text has editing slips and reference gaps. | Read |
| NOTE-373 | Survival and Identity | What matters in survival is the R-relation (mental continuity and connectedness among person-stages), and it is also identity, because persons are maximal R-interrelated aggregates of stages and so the relation of being stages of one person is the R-relation. Fission and fusion become persons sharing stages, counted by tensed identity; the long-lived Methuselah is a continuum of overlapping persons; degrees come from supervaluation over cut-offs. Against Perry’s lifetimes, two persons, not three, take part in a fission. | Read |
| NOTE-374 | Personal Identity | A survey of the persistence debate with an animalist’s emphasis. It separates seven questions, argues that the persistence question concerns numerical identity and must not presuppose person essentialism, and sets out psychological-continuity, brute-physical and anticriterialist answers. Fission and the too-many-thinkers objection are the two arguments that do the work. It avoids the word “self”. One in-text citation (Olson and Witt 2020) has no matching bibliography entry. | Read |
| NOTE-375 | Burns — Fluid Concepts and Creative Analogies: A Review | A three-page review of Hofstadter and FARG’s collection. It explains the parallel terraced scan and “cognition is recognition” clearly, then asks why the work has had little impact on AI: microdomains with possibly hidden assumptions, and critiques of rivals that rest on analogy and intuition and are not turned on Copycat. Its sharpest point is that the symbol-grounding charge against SME applies to Copycat too. | Read |
| NOTE-376 | Shanahan — Palatable Conceptions of Disembodied Being | An avowedly “poetic” attempt to fit consciousness and selfhood to a disembodied 2024 chat agent. Its time would be discrete and discontinuous. Its “I” can be the model or a conversation-bound self that flickers into being each turn; we may slip between them. Such selves can be copied, edited and merged, and spread over branching simulacra. No candidate site survives scrutiny, which is read as Buddhist emptiness and applied back to human selves. Examples are invented usages, not data. | Read |
| NOTE-377 | Philosophical conceptions of the self: implications for cognitive science | A short review that sets the minimal self (present self-consciousness) against the narrative self (extended in time), splits the minimal self into a sense of ownership and a sense of agency, and ties their dissociation in schizophrenic thought insertion to Frith’s forward comparator model. It reports an embodied minimal self in neonatal imitation and a momentary one in Strawson and in Tani’s robot, and proposes, against Dennett, that the narrative self is the sum of its narratives. Evidence is cited, not shown. | Read |
| NOTE-378 | Personal Identity | Wiggins’s division case shows that what matters in survival need not be one-one, so it is not identity; fusion and imagined beings that divide show it comes in degrees. Q-memory and q-intention describe the relations without presupposing identity. Continuity (transitive) is distinguished from connectedness (degree), and successive selves are proposed in place of one underlying person. The principle of self-interest then has no independent force. §I is argued; the priority of connectedness is asserted; §VI is a sketch. | Read |
| NOTE-379 | Taylor — Consciousness interpreted | A charitable reconstruction, not a defence. Consciousness is a real pattern (Dennett 1991b) in the brain’s content-bearing states, and a user-illusion, a pattern so coarse that describing the brain through it is unwitting metaphor. This makes six claims consistent: multiple drafts, global workspace, qualia eliminativism, user-illusion, fallibility and dictatorial authority. The Orwell/Stalin indeterminacy is rebuilt without verificationism: the two readings compress and predict equally, so neither better describes the pattern. | Read |
| NOTE-380 | Adams & Aizawa — Defending the Bounds of Cognition | A reply to a manuscript of Clark’s “Memento’s Revenge”. It names the coupling-constitution fallacy, coupled is not part of, and restates the 2001 marks of the cognitive. Against Clark’s Euler-circle case it separates how a diagram gets its meaning from how a mental image of it does. Against a “brain-tool science” it argues that tools are an open-ended motley. The fallacy is shown by one analogy, and the processing differences are asserted, not measured. | Read |
| NOTE-381 | Schwitzgebel — Is the United States Phenomenally Conscious? Reply to Kammerer | Three concerns about Kammerer’s Sophisticated Anti-Nesting Principle. It may not exclude actual groups, even the US, because citizens may not consciously represent the concrete entity at issue. Condition A’s “required” makes group consciousness depend on members’ motives: read loosely it gives flickering consciousness with no group-level change, read strictly it can never be met. The Occam-style justification either generalises into causal exclusion or is ad hoc, and group-level explanation is often simpler. Kammerer’s is still the best anti-nesting principle the author has met. | Read |
| NOTE-382 | Shanahan — Simulacra as Conscious Exotica | A Wittgensteinian treatment: consciousness talk is anchored in what is public, so an exotic entity is a candidate only if we could engineer an encounter with it in a shared world. Disembodied chat agents are not candidates; virtually embodied ones could be. On the self: no “self worth preserving” without body, history and autobiographical memory, and no “person behind the mask” for a role player, whose identity is a shifting distribution of roles. Argued by method and scenario; nothing is measured. | Read |
| NOTE-383 | Against Narrativity | Rejects the descriptive and the normative Narrativity theses. Separates Diachronic from Episodic self-experience, and form-finding, story-telling and revision within Narrativity. Places Dennett, Schechtman, Sartre and himself on that grid. Argues that Episodic lives are normal and can be good, that a from-the-inside memory need not present as one’s own, and that self-narration risks falsification. The argument is testimony and distinction-drawing; the empirical claims are asserted. | Read |
| NOTE-384 | Frankish — Illusionism as a Theory of Consciousness | Illusionism named and defended as a research programme. Phenomenal properties are not instantiated; the task is the illusion problem, to explain why experiences seem to have them. “Quasi-phenomenal” properties, the physical properties introspection misrepresents as phenomenal, separate strong illusionism from a weak illusionism that is argued to be unstable. The case is conservatism, the threat of epiphenomenalism, covert illusionism in reductive theories, a debunking argument and an abductive one from anomalousness. Objections are answered by agreeing to weakened versions of their intuitions. | Read |
| NOTE-385 | Of Identity and Diversity | Identity is relative to the idea the name stands for: same mass, same life (oak, horse, man), same consciousness (person). A person is a thinking being that “can consider itself as itself”, and personal identity reaches as far back as consciousness can be extended, independent of substance. Man and person come apart (prince and cobbler; day-man and night-man), and “person” is “a forensic term” grounding reward and punishment. Argued from cases and intuitions; “the same consciousness” is never defined. | Read |
| NOTE-386 | Of Personal Identity | No impression of a self is constant, so there is no idea of one; introspection finds only perceptions, and the mind is “a bundle or collection of different perceptions”. Its ascribed identity is a fiction of the imagination, like that of ships, churches and plants, produced by resemblance and causation, with memory discovering rather than producing it; hard cases are “grammatical”. The Appendix confesses that two principles, the distinctness of perceptions and the imperceptibility of real connexions, leave the unity of the mind unexplained. | Read |
| NOTE-387 | The Self and the Future | A body-exchange experiment told twice. Third-personally, with selfish choices before and reactions after, it supports “changing bodies”. First-personally, as torture preceded by amnesia, character change and implanted memories, fear remains rational at every step, and the step that completes the exchange alters only what happens to someone else. Conceptual undecidability and conventional decision leave the subject unable to expect anything. A “rather shaky” lean toward the bodily answer, as a risk. | Read |
| NOTE-388 | Social ontology: Some basic principles | Searle restates the 1995 theory in twenty pages. Social facts are facts involving collective intentionality. Institutional facts are the subclass in which collective acceptance imposes a status function, “X counts as Y in C”, carrying deontic powers that give desire-independent reasons for action. Language is constitutive, since such facts exist only as represented. He revises the book in two places: status indicators matter in their own right, and some Y terms are free-standing, with no X, as with corporations and money without currency. “We accept (S has power (S does A))”, a formula from later in the book, is now ranked as the more general form. Collective intentionality is assumed, not argued for. | Read |
| NOTE-389 | Ritchie — Social Structures and the Ontology of Social Groups | A structuralist framework for social groups. A social structure is a network of relations constitutively dependent on social factors; it can be overt or covert, intentionally or unintentionally created and instantiated, internal or external to what realizes it. Organized social groups are structured wholes whose internal social structures people occupy; feature social groups are social kinds, nodes in external social structures, which can be intersectional. A restriction to structures that intuitively exist or figure in explanations keeps arbitrary collections out. Motivated, not proved; nothing on agency or minds. | Read |
| NOTE-390 | Ritchie — What are groups? | Six criteria for any theory of groups (members vary across times and worlds; groups are temporary, contingent and located; coincident groups of one kind can be distinct) rule out groups as non-singular pluralities, fusions, Burge aggregates and Effingham’s sets. Proposed: a group is a realization of a structure whose nodes are defined by functional relations; it exists while every node is occupied, members are the occupiers, and two groups are identical at a time only with the same members in the same relations. A sketch of a view, silent on agency. | Read |
| NOTE-391 | Durkheim — Qu’est-ce qu’un fait social ? | Defines the social fact by exteriority to individual consciousness and external constraint, shown by sanction or by resistance, with diffusion plus independent existence as an equivalent test. Social facts are neither organic nor individual-psychic, so their substrate is society; they are general because collective, and “in each part because in the whole”. Statistics isolates collective currents from individual cases. Ways of being are consolidated ways of doing. All of it is definition and illustration; the elimination that yields “a new species” is assumed exhaustive. | Read |
| NOTE-392 | North — Institutions | An essay, not a proof. Institutions are humanly devised constraints, formal and informal; with technology they fix transaction and production costs and so the incentives of an economy. Village, bazaar and caravan exchange stayed put; early modern European trade evolved, through merchant law, negotiable bills, insurance and a constrained state. Change is path dependent through increasing returns. The game-theoretic motive is one paragraph, the history is narrative, and the one number (the transaction sector’s share of GNP) is cited, not derived. | Read |
| NOTE-393 | Epstein — Social Ontology (SEP) | A survey organised by its author’s own distinction: what grounds a social fact versus what anchors the category it falls under. It reports that ontological individualism is widely assumed and now contested; that grounding has displaced supervenience; that convention, collective acceptance, patterns, practices and language are rival theories of anchoring; and that whether anchoring is a distinct relation is disputed. It covers groups, group agency, institutions, race and gender, artifacts, money, law and language. Survey claims are reported, not argued; one citation (Epstein 2016) is missing from the bibliography, and Schwitzgebel 2015 is listed with critics of group phenomenal states. | Read |
| NOTE-394 | Haslanger — Gender and Race: (What) Are They? | An explicitly ameliorative (“analytical”) account. Gender and race are defined as hierarchical social positions: a woman is someone regularly observed or imagined to have bodily features presumed to indicate a female’s reproductive role, marked by that within the dominant ideology for subordinate positions, and subordinated in part because of it. Racialized groups are defined in parallel from features presumed to show ancestral links to a region. Gender in general and ethnicity are the non-hierarchical genus. The commonality and normativity objections are met by appeal to the project’s values. Stipulative, with no evidence. | Read |
| NOTE-395 | Hindriks & Guala — Institutions, rules, and equilibria | Institutions are correlated equilibria of coordination games with several equilibria, represented by the players as rules. Searle’s constitutive rules are derived from a regulative rule by coining a term that splits it into a base rule and a status rule; the term is conservative and eliminable, so constitutive rules add a name and cognitive economy, not a new kind of fact. The derivation is shown for one toy institution and asserted in general. The reply adds that normativity needs no constitutive rules, because a right is a bundle of other people’s regulative obligations. | Read |
| NOTE-396 | Graham et al. 2013, Moral Foundations Theory | MFT in four claims: a first draft of the moral mind organized in advance of experience, edited by culture, working through fast intuitions, with several foundations because there were several adaptive challenges. Five foundations, each with an evolutionary model (Care: kin selection; Fairness: reciprocal altruism; Loyalty: coalitions; Authority: rank; Sanctity: disease avoidance). MFQ findings: liberals rely on Care and Fairness, conservatives on all five, in every region sampled; Sanctity predicts culture-war attitudes best. Five criteria for foundationhood; Liberty, Efficiency, Ownership and Honesty named as candidates. | Read |
| NOTE-397 | Yilmaz, Harma & Doğruyol 2021, the MAC-Q in Turkey | An independent validation of the MAC-Q. In Turkish undergraduates (n = 445) seven factors fit the Relevance items (CFI .949, RMSEA .053, SRMR .046) but not the Judgement items (CFI .828) or the full form (CFI .752), as in the original. Family and deference track resistance to change; deference tracks, and fairness counters, opposition to equality. Resource-scarcity primes in Turkey (n = 576) and in a preregistered US MTurk study (n = 921) had no effect. Relevance scores correlate about .1–.3 with prosocial intentions. The seven are strongly intercorrelated. | Read |
| NOTE-398 | Atari et al. 2023, the MFQ-2 | A new Moral Foundations Questionnaire, built across 25 populations in local languages: 116 candidate items cut to 36, six each for Care, Equality, Proportionality, Loyalty, Authority and Purity, in a “describes me” format. Six factors fit across 19 nations (ESEM CFI .979); reliabilities ω .73–.95; Purity alone fails the alignment invariance threshold. Equality and Proportionality are nearly orthogonal in WEIRD samples. Purity rises most with cultural distance from the U.S. The individualizing–binding split appears in only three national networks. The MFQ-2 predicts criterion scales better than the MFQ-1. | Read |
| NOTE-399 | Curry et al. 2021, moral molecules | The seven morality-as-cooperation domains are cast as elements whose pairwise combinations are moral “molecules”. For each of 21 pairs the authors hypothesise a concept and find a definition or quotation that fits: fraternity, blood revenge, family pride, filial piety, gavelkind, primogeniture, friendship, patriotism, tribute, diplomacy, common ownership, honour, confession, turn-taking, restitution, modesty, mercy, munificence, arbitration, mendicance and queuing. The counts are right (127 positive combinations, 2,186 of mixed valence). The test is a search for confirming instances with no stated protocol, and the theory says it does not predict which molecules exist. | Read |
| NOTE-400 | Haidt & Joseph 2004, intuitive ethics | An essay, not a study. Humans are innately prepared to feel quick approval or disapproval at four patterns, suffering, hierarchy, reciprocity and purity, each a module with an evolved proper domain and a culturally widened actual domain; ingroup is the best fifth candidate (fn. 15). Three of the four were the concerns all five surveyed works shared; purity was added from the authors’ own research on disgust. Cultures vary in actual domains, in which modules they lean on, in what a virtue means, and in how virtues cluster. No data are reported. | Read |
| NOTE-401 | The Genetical Evolution of Social Behaviour. I | A one-locus, non-overlapping-generation model in which genotypes affect relatives’ fitness. Splitting each effect into a part on genes identical by descent (weight r) and a “diluting” part on other genes shows that the former alone fixes the direction of selection, and defines inclusive fitness. Mean inclusive fitness provably increases when no genotype harms others; with harm it only points uphill. A costly act spreads iff −k > 1/r: twice the cost to a sib, eight times to a cousin. | Read |
| NOTE-402 | The Evolution of Reciprocal Altruism | A verbal model: altruists who withhold help from non-reciprocators beat non-altruists when benefit exceeds cost, encounters are many, partners stable and exposure symmetric. Cleaner-fish hosts that do not eat their cleaners fit it; bird alarm calls are explained by a different, self-interested model. Human friendship, moralistic aggression, gratitude, sympathy, guilt, trust, suspicion and their sham forms are proposed as adaptations regulating exchange, supported by 1960s social psychology, not tested. | Read |
| NOTE-403 | Haidt 2001, the social intuitionist model | The social intuitionist model: moral judgments appear in consciousness as quick intuitions with an affective valence, and moral reasoning is usually a post-hoc search for supporting reasons, used to persuade others. Six links are drawn, four of them reasoning links, two of them private. The case rests on dual-process research, motivated reasoning, post-hoc confabulation and the weak tie between moral reasoning and moral action, mostly from outside morality. Harmless taboo violations are condemned regardless, and affect predicts the condemnation better than perceived harm. | Read |
| NOTE-404 | The Logic of Animal Conflict | Five strategies for contests with dangerous weapons, simulated 2,000 times per pairing with payoffs +60 win, −100 serious injury, −2 per scratch, up to +20 for brevity. Hawk is not an ESS; Retaliator is called one though Mouse ties it, so by the paper’s own second condition it is only neutrally stable. In a war of attrition no pure strategy is stable; the exponential mixture p(x) = (1/v)e^(−x/v) is. Individual selection can explain limited war. No Hawk–Dove game, no ownership. | Read |
| NOTE-405 | Rai & Fiske 2011, relationship regulation | A theoretical review. Moral psychology is the regulation of social relationships: an act is right or wrong according to the relational model participants and observers apply, not according to its harm, fairness or purity in the abstract. Fiske’s four models (communal sharing, authority ranking, equality matching, market pricing) each carry a moral motive: Unity, Hierarchy, Equality, Proportionality. Honour killing, obedient massacre, blood feud and collateral damage are each read as one motive at work. Purity and ingroup loyalty are both Unity. No new data are reported. | Read |
| NOTE-406 | Alfano, Cheong & Curry 2024, moral universals in 256 societies | The Morality-as-Cooperation Dictionary (fourteen virtue and vice sub-dictionaries, built by brainstorming, colleague crowd-sourcing and WordNet expansion, culled by two coders at κ ≈ .65–.70) is run with LIWC over 9,653 eHRAF Ethics paragraphs from 256 societies. Most domains are detected in most societies. Region and subsistence matter significantly but slightly. Against the sixty-society hand codes, agreement is about 80% but κ only .08–.25, with false positives outnumbering true ones. The method cannot detect valence. A spot-check found admired theft in four societies and societies that do not value bravery or reciprocity. | Read |
| NOTE-407 | Baumard, André & Sperber 2013, mutualistic morality | Partner choice with outside options constrains how the gains of cooperation are split: nobody accepts less than they could get elsewhere, so with equal options the stable split is proportional to each partner’s contribution of effort and talent. Being chosen then rewards a genuine sense of fairness over calculated fairness. Dictator, ultimatum, trust and public-goods results are read as allocations by perceived entitlement. Twenty-eight commentators accept partner choice and dispute that fairness is all of morality; the authors reply with a broad and a narrow position they have not settled between them. | Read |
| NOTE-408 | Curry 2016, morality as cooperation: a problem-centred approach | The founding statement of morality-as-cooperation. Nonzero-sum game theory gives seven cooperation problems (kin, coordination, exchange, hawk and dove contest displays, division, possession), and their solutions are said to be what morality is. Each domain gets an animal case, a human case and quotations from moral philosophers. No data are reported. The sharpest content is the predictions on pp. 39–40: non-cooperative behaviour is morally neutral, no culture moralizes “aesthetics or nutrition”, and religious morality and food taboos will turn out cooperative. | Read |
| NOTE-409 | Five Rules for the Evolution of Cooperation | A four-page review. Five mechanisms, each with a b/c threshold derived from a 2×2 game: kin selection r > c/b, direct reciprocity w > c/b, indirect reciprocity q > c/b, network reciprocity b/c > k, group selection b/c > 1 + n/m. For kin, network and group mechanisms the same condition makes cooperators ESS, risk-dominant and advantageous; for the reciprocities RD and AD need more. Derivations are in the unread supplement; the review itself proves nothing. | Read |
| NOTE-410 | The Genetical Evolution of Social Behaviour. II | Generalizes Part I into two principles (value neighbours by relatedness; discriminate so relatedness is determinate) and applies them qualitatively. Haplodiploid sisters (r = 3/4) favour worker altruism, weakened by multiple mating (eight drones give about 0.31); sibs fight to the death only for a gain above 50%; clonal colonies cooperate and sexual aggregates do not fuse. Evidence is anecdotal, partly contrary (Australian halictines), and anomalies are put down to error or misinterpretation. | Read |
| NOTE-411 | The Evolution of Cooperation | TIT FOR TAT won Axelrod’s two tournaments (14 entries plus random, 200 moves; 62 entries, expected 200 moves) and went to fixation in an ecological replay. Against it, only ALL D or alternation need be checked, so no strategy does better iff w ≥ (T−R)/(T−P) and w ≥ (T−R)/(R−S). ALL D is stable for all w; kinship or a cluster with enough in-cluster interactions lets reciprocity in, and a nice stable strategy resists clusters. ALL C ties with TIT FOR TAT, so stability is neutral, not strict. | Read |
| NOTE-412 | Curry, Jones Chesters & Van Lissa 2019, the MAC-Q | A 42-item questionnaire for morality-as-cooperation’s seven domains, written by the authors from the theory and reduced to three items per subscale. In UK (n = 1,392) and US (n = 469) online samples, seven factors fit the Relevance items well (CFI .98) and the Judgement items poorly (CFI .87). The two sets cannot be pooled into seven domains (CFI .73); the best model keeps fourteen correlated factors. The MFQ’s five factors are not recovered. MFQ purity items are rated about as morally relevant as its loyalty and authority items, which the authors concede contradicts the theory. The data cannot be shared. | Read |
| NOTE-413 | Entropy production fluctuation theorem and the nonequilibrium work relation for free energy differences | A finite-time fluctuation theorem for stochastic dynamics. If the dynamics are Markovian and microscopically reversible (path over reversed path = e^{−βQ}) and the entropy production ω = ln ρ(x_{−τ}) − ln ρ(x_{+τ}) − βQ is odd under time reversal, then P_F(+ω)/P_R(−ω) = e^{ω}. For processes that start and end in equilibrium ω = β(W − ΔF), so the Jarzynski equality is one line. For time-symmetric steady states, P(+ω)/P(−ω) = e^{ω} for any whole number of cycles. At long times it gives a heat fluctuation theorem and Gaussians with variance twice the mean. | Read |
| NOTE-414 | Belousov-Zhabotinsky reaction | An authoritative short review. BZ: bromate oxidizes an organic reductant, catalysed by Ce, Fe(phen)₃ or other metal ions. Oscillation is a relaxation cycle: autocatalytic HBrO₂ oxidizes the catalyst, Br⁻ (made when Ce⁴⁺ oxidizes bromomalonic acid) shuts the autocatalysis off. Phase resetting by Br⁻, Ag⁺ and Ce⁴⁺ confirms it. Closed: up to several thousand cycles. CSTR: indefinite oscillation, bursting, chaos. Unstirred: trigger waves, targets, spirals, scrolls; in microemulsion, Turing structures. The Oregonator is qualitative only. | Read |
| NOTE-415 | Life as a manifestation of the second law of thermodynamics | Proposes a “restated second law” (systems pushed from equilibrium resist the applied gradients by every available means) and reads Bénard cells, vortices, life and ecosystem succession as successive gradient destroyers, with the second law “necessary but not sufficient” for life. The law is asserted, not derived. The physics examples show organized structures raising dissipation, not that they must. The ecological evidence is one unreplicated marsh comparison and thermal-scanner and satellite correlations, one of whose tables is internally inconsistent. | Read |
| NOTE-416 | Statistical Physics of Adaptation | A macrostate fluctuation relation for driven systems, rearranged as an internal-entropy term, a reversal term and Ψ − Φ = −ln⟨e^{−βΔQ}⟩. It is read as a tendency of driven matter towards states formed by reliable work absorption and dissipation, “adaptation” without replication. The relation is exact. The tendency needs the other two terms held fixed, which the paper arranges only in contrived one-particle landscapes; the many-body claim and the “adaptive resonance” simulation are argued and reported, not shown. | Read |
| NOTE-417 | Nonequilibrium Equality for Free Energy Differences | The nonequilibrium work relation. Switch a classical system that starts in canonical equilibrium from H_0 to H_1 at any finite rate. Then ⟨e^{−βW}⟩ = e^{−βΔF} exactly, whatever the path or the switching time (Eq. 2). It is proved for an isolated Hamiltonian system by Liouville’s theorem, for a reservoir under weak coupling, and for a Nosé–Hoover thermostat with no extra assumption. Thermodynamic integration and the Zwanzig formula are its limits, ⟨W⟩ ≥ ΔF follows by Jensen, and Gaussian work gives W_diss = βσ²/2. Its practical reach is work fluctuations of order k_BT. | Read |
| NOTE-419 | Statistical physics of self-replication | A coarse-grained second law, β⟨ΔQ⟩ + ln π(II→I) + ΔS_int ≥ 0, applied to self-replication: the heat a replicator releases per copy is bounded below by the log-odds against its copy falling apart within one generation, so durable, fast copies cost more heat. The general bound is sound. The E. coli and RNA numbers rest on an upper bound on the reverse probability that is argued from biology, not derived, and one printed logarithm has its argument inverted. | Read |
| NOTE-420 | Stochastic thermodynamics, fluctuation theorems and molecular machines | The 2012 reference review of stochastic thermodynamics. For Markovian dynamics coupled to baths of fixed temperature, work, heat and a stochastic entropy s = −ln p(x(τ),τ) are defined on single trajectories. Every known integral, detailed and Crooks-type fluctuation theorem follows from one master theorem, as the log-ratio of a path’s weight under the original and a conjugate dynamics. Dissipation measures how distinguishable forward and reverse paths are. Feedback adds the mutual information I to the second law (Sagawa–Ueda). Machine efficiency and efficiency at maximum power follow from a cycle decomposition. The integral theorems are not proofs of the second law, because the dynamics build irreversibility in. | Read |
| NOTE-421 | Life as we know it | The flow of internal and active states in an ergodic system with a Markov blanket, written in Helmholtz form, can be redescribed as gradient descent on a variational free energy once the variational density is set equal to the posterior over external states. On that redescription such systems “appear” to infer and to bound their own entropy, which the paper calls the marks of life. One simulated soup shows a blanket-enclosed cluster that predicts external motion and falls apart under lesions. The free energy is variational, not thermodynamic. The candle flame is excluded by a one-sentence assertion. The paper’s own reported p-value is not reproduced by the null it describes. | Read |
| NOTE-422 | Comments on a derivation and application of the ‘maximum entropy production’ principle | Two corrections to Dewar. First, Dewar 2005 derives MaxEP far from equilibrium from a fluctuation theorem plus a quadratic approximation to the flux distribution, used as if valid for all f. Both can hold together only for small F, where A(F) = ∂λ/∂F is constant: the linear regime. So the orthogonality condition ∂D/∂F = 4λ, which yields both maximum and minimum dissipation, fails for nonlinear constitutive relations, as an exactly solvable spin chain shows. Second, Dewar 2003’s SOC divergence disappears once the quartic term is kept. | Read |
| NOTE-423 | Nonequilibrium thermodynamics and maximum entropy production in the Earth system | A review by MEP’s leading Earth-system advocate. MEP: given enough degrees of freedom, a system adopts the steady state of maximum entropy production. It is distinguished from Prigogine’s minimum principle, which describes relaxation toward a steady state and does not select among several. Two-box models show MEP arising from a flux–force trade-off. The Earth’s entropy budget is estimated and dominated by absorption of sunlight. MEP fits are surveyed from Paltridge’s climate model to sediment ecology, and life is argued to push the planet toward MEP. The author concedes MEP is not established. | Read |
| NOTE-424 v2 | Time, Structure and Fluctuations | Prigogine’s Nobel statement. Near equilibrium δ²S < 0 with ½∂δ²S/∂t = P > 0 makes δ²S a Lyapounov function, and in the strictly linear regime (constant L_ρρ′) the steady state minimizes entropy production. Far from equilibrium ½∂δ²S/∂t = ΣδJ_ρδX_ρ has no fixed sign, and ΣδJδX ≥ 0 is offered only as a sufficient stability condition. The Brusselator goes unstable at B > 1 + A². Dissipative structures are instabilities of the thermodynamic branch, triggered by fluctuations and sustained by exchange with the outside. The microscopic §§6–7 is a programme, linked to macroscopic thermodynamics only “in the linear region”. | Read |
| NOTE-425 | Energy flow and the organization of life | An essay arguing that life, beginning with the reductive citric-acid cycle, was forced into existence as a channel relieving geochemical free-energy stresses, like lightning or a hurricane. The framework is Jaynesian entropy maximization over states that include currents, not entropy-production principles. The emergence of life is a phase-transition “collapse” of a metastable abiotic earth. The structure of core metabolism is the only evidence. The authors state that the thesis is not quantitatively demonstrated. | Read |
| NOTE-426 | Information theory explanation of the fluctuation theorem, maximum entropy production and self-organized criticality in non-equilibrium stationary states | Jaynes’s maximum-entropy inference, applied to microscopic paths of an open stationary system, gives p_Γ = exp(A_Γ)/Z. The action is a symmetric end-point term plus τσ_Γ/2k_B. A fluctuation theorem p(σ) = e^{τσ/k_B} p(−σ) and ⟨σ⟩ ≥ 0 follow exactly. Maximum entropy production follows only in a mean-field approximation, and only if the number of paths increases with their irreversible action, which is assumed. The self-organized-criticality corollary is a mean-field divergence. As Grinstein and Linsker showed, it does not survive keeping the quartic term. | Read |
| NOTE-427 | The Chemical Basis of Morphogenesis | Turing’s reaction–diffusion theory of pattern. Linearize about a homogeneous steady state of M morphogens on a ring of N cells: each Fourier mode grows or decays independently, and the fastest-growing one sets the pattern. Six forms of onset are possible. For two morphogens, stationary waves of finite wave-length need bc < 0 and 4√(μ′ν′)/(μ′+ν′) < (d−a)/√(−bc) < (μ′+ν′)/√(μ′ν′) (9.4a), with instability if d√(μ′/ν′)/√(−bc) − a√(ν′/μ′)/√(−bc) > 2 (9.4b). These cannot both hold when μ′ = ν′. A computed 20-cell ring gives three lobes. | Read |
| NOTE-428 | How effective psychological treatments work: mechanisms of change in cognitive behavioural therapy and beyond | A history-and-argument paper. It separates common factors from mechanisms of change, holds that a treatment’s success does not validate its theory, and proposes one mechanism for all effective therapy: the person, “stuck” in an exaggerated negative meaning (Theory A) maintained by their own reactions, builds and tests a less threatening alternative (Theory B), a meaning-making flexibility. The proposal is argued from clinical examples and cited trials. The paper itself says mechanism research has not yet met Kazdin’s standards. | Read |
| NOTE-429 | The Emerging Field of Emotion Regulation: An Integrative Review | Gross’s founding review. Emotions are modulable response tendencies. Regulation, defined as influencing which emotions one has, when, and how they are experienced and expressed, is split from coping, mood regulation and defense, and sorted into five families by where it acts in emotion generation: situation selection, situation modification, attentional deployment, cognitive change, response modulation. The paper’s own open problem is whether regulation can be told apart from generation at all. | Read |
| NOTE-430 | Relational Frame Theory: Some Implications for Understanding and Treating Human Psychopathology | RFT stated for clinicians. Human relating is bidirectional and arbitrarily applicable, a generalized operant under contextual control, with mutual and combinatorial entailment and transformation of function. Relating relations explains metaphor, rules are networks whose coordination with events regulates behaviour, and the self is content, process and context. These are offered as the reason direct-contingency behaviour therapy is “inadequate”, and ACT’s acceptance, defusion and values are given RFT readings explicitly labelled heuristic. | Read |
| NOTE-431 | Acceptance and Commitment Therapy: Model, Processes and Outcomes | The ACT model, read in an early manuscript. Psychopathology is psychological inflexibility: cognitive fusion (fed by literality, reason-giving and emotional control) supports experiential avoidance, and both displace present-moment contact and values. Six processes restore flexibility. The manuscript’s evidence: AAQ correlations with distress (21 studies), component studies of acceptance and defusion, mediation in seven trials, and weighted outcome effect sizes (d = .49 post and .69 follow-up against active treatments). | Read |
| NOTE-432 | Explanatory Models for Psychiatric Illness | Psychiatric etiology is multilevel, non-aggregative and full of causal loops, so law-based explanation fails and so do both hard reduction and hard emergence. Mechanistic explanation proceeds by local decomposition and difficult reassembly. Following Marr, biology implements the functions psychology describes and does not replace them. The argument is philosophical, illustrated by an alcohol-dependence sketch and cited findings; it reports no data of its own. | Read |
| NOTE-433 | Impulsive action: emotional impulses and their control | Frijda’s action-readiness theory applied to impulsive action. Automatic appraisal of concern pertinence elicits a state of action readiness, a motive to change a self–object relation, with control precedence. Emotions differ by mode of action readiness. Events draw several appraisals at once, and the resulting states of readiness interact, so impulse control and much emotion regulation are themselves emotional. Purposive impulsive action is grounded neurally in anticipating an action’s sensory effects (PPC, premotor, cerebellum), with frontostriatal circuits for stopping. | Read |
| NOTE-434 | The theory of constructed emotion: an active inference account of interoception and categorization | Barrett’s theory of constructed emotion, stated through predictive coding. The brain runs an allostatic internal model. Its predictions are concepts, initiated in agranular limbic cortex and corrected by prediction error. Interoceptive consequences are felt as affect. An emotion is a categorization by an emotion concept. Degeneracy and population thinking deny emotion categories neural essences. Basic-emotion and causal appraisal theories are rejected; descriptive appraisals are kept as products of categorization. | Read |
| NOTE-435 | A Network Theory of Mental Disorders | Borsboom states the network theory as five principles: complexity, symptom-component correspondence, direct causal connections between symptoms, disorders as tightly coupled symptom clusters, and hysteresis. Disorder is an alternative stable state of a strongly connected network that outlasts its trigger; health is the stable state of a weakly connected one. Treatment is symptom, external-field or network intervention. The evidence offered is indirect, and the theory is presented as an organizing framework, not a fitted model. | Read |
| NOTE-436 | Psychological Flexibility as a Fundamental Aspect of Health | A narrative review that defines psychological flexibility by four dynamic abilities (adapting to situations, reconfiguring resources, shifting perspective, balancing domains). Flexible regulation beats any fixed strategy (Bonanno 2004; Cheng 2001). Inflexibility marks depression and anxiety, and cardiac vagal control may integrate its forms. Causal direction is open. It recommends experience sampling and multi-informant measures over global self-report. | Read |
| NOTE-437 | The Future of Intervention Science: Process-Based Therapy | A programme paper. Thirty years of DSM-linked trials never turned syndromes into diseases, so evidence-based therapy should target theory-derived, empirically supported processes of change with procedures shown to move them. Its distinctive commitments are a falsification rule for models of change, moderated mediation as a basis for a new nosology, and an idiographic, functional-analytic diagnosis. It offers predictions and cited examples, not new data. | Read |
| NOTE-438 v2 | A meta-analytic review of experiments examining the effects of extrinsic rewards on intrinsic motivation | 128 experiments on interesting tasks, separate meta-analyses for free-choice behaviour and self-reported interest. Tangible rewards expected for engaging in, completing or doing well at a task undermine free-choice intrinsic motivation (d from −0.28 to −0.40), and less so self-reports; unexpected and task-noncontingent rewards do not; positive feedback enhances, except for children’s free choice. The pattern fits cognitive evaluation theory and contradicts Eisenberger and Cameron’s helplessness and learned-industriousness account. | Read |
| NOTE-439 | The “What” and “Why” of Goal Pursuits: Human Needs and the Self-Determination of Behavior | Needs in SDT are innate psychological nutriments, identified functionally by the costs of their thwarting, not by individual differences in their strength. The three needs organize findings on intrinsic motivation and internalization, predict that both the “why” (autonomous vs controlled regulation) and the “what” (intrinsic vs extrinsic aspirations) of goals affect well-being, and explain need substitutes and rigid defences when needs are thwarted. Autonomy is self-organization, defended as an evolved, domain-general design feature. | Read |
| NOTE-440 | Basic psychological need theory: Advancements, critical themes, and future directions | The authors set out nine criteria a basic psychological need must meet, separate need frustration from mere lack of satisfaction, review need frustration’s costs (ill-being, compensatory behaviour, need substitutes) and propose it as transdiagnostic, review the interplay with sleep, food, sex and safety, map need-supportive and need-thwarting practices on a circumplex, and argue that the needs are universal in their effects (“output side”) while the practices that satisfy them vary (“input side”). Novelty, morality and beneficence are weighed as fourth needs and not yet admitted. | Read |
| NOTE-441 | Self-Regulation and the Problem of Human Autonomy: Does Psychology Need Choice, Self-Determination, and Will? | SDT’s autonomy is “regulation by the self”: acting with reflective endorsement, graded along the internalization continuum, compatible with external influence, dependence and a single option. Ryan and Deci align it with phenomenological and hierarchical (Frankfurt, Dworkin) accounts and use that definition to answer behaviourist, social-cognitive, reductionist, nonconscious-priming, choice-overload and cultural critiques. Autonomy lies not in being an uncaused cause but in the capacity to “reflectively endorse or reject prompted actions” (p. 1573). | Read |
| NOTE-442 v2 | Self-determination theory and the facilitation of intrinsic motivation, social development, and well-being | SDT’s canonical short statement. Social contexts that support competence, autonomy and relatedness sustain intrinsic motivation and let people internalize and integrate extrinsic regulations; controlling, rejecting or overchallenging contexts undermine intrinsic motivation and leave regulations external or introjected. Autonomy is graded: four kinds of extrinsic motivation lie on a continuum of relative autonomy (Ryan & Connell’s quasi-simplex). Basic needs are defined by their consequences for well-being, and need-deprivation is offered as a principal source of distress and psychopathology. | Read |
| NOTE-443 | Précis of Breakdown of Will | Hyperbolic discounting makes preference reverse with delay alone, so a person is a population of interests that forestall one another. Will is the recursive bundling of choices by treating each as a precedent, which gives an intertemporal repeated prisoner’s dilemma and makes Kavka’s toxin rational to drink. The same recursion predicts legalism, “lapse districts”, motivated misperception and compulsive over-control, and premature satiation of appetite limits what will can do for emotional reward. | Read |
| NOTE-444 | An Organizational Account of Biological Functions | Functions are contributions to a differentiated self-maintaining organization by traits that organization produces and maintains (C1–C3). Closure alone grounds teleology and normativity but is shared by flames and hurricanes; differentiation is what makes functions meaningful. The account unifies “why is T there?” and “what is T for?” in current organization, and distinguishes functional, useful, dysfunctional, primary and secondary contributions. Reproduction is left to future “second-order” self-maintaining systems. | Read |
| NOTE-445 | The Diffusion Decision Model: Theory and Data for Two-Choice Decision Tasks | The full diffusion model (drift v with across-trial SD η, boundaries 0 and a, starting point z with range s_z, non-decision time Ter with range s_t) fitted by the χ² quantile method. In three dot-motion experiments with 14–17 participants difficulty maps to drift alone, speed–accuracy instructions to boundaries alone, and a 75:25 proportion mainly to starting point; RT distribution shape is invariant across conditions. Drift variability gives slow errors and starting-point variability fast ones. Reviews aging, aphasia and neural-firing applications. | Read |
| NOTE-446 | The Expected Value of Control: An Integrative Theory of Anterior Cingulate Cortex Function | The paper proposes that dACC estimates the expected value of control: probability-weighted payoff of a control signal minus an intrinsic cost rising with its intensity. dACC uses that estimate to specify the identity and intensity of the control signal, which lPFC and subcortical structures (STN, LC) implement. The account unifies conflict monitoring, reward and prediction-error responses, effort costs and the override of defaults. It is a synthesis without a fitted model, and it leaves open how EVC is computed and what the cost function is. | Read |
| NOTE-447 | The Emperor’s New Markov Blankets | Pearl blankets (conditional-independence shields in a Bayesian network) and Friston blankets (agent–environment boundaries in the world) are different constructs conflated in the free-energy literature. The four-way partition needs a chosen internal node, sensorimotor labels and steady state; in Friston’s soup it also needs electrochemical-only coupling and a fixed cluster size. Realist use needs metaphysical premises; instrumental use is innocent but settles nothing about boundaries. | Read |
| NOTE-448 | Goal Striving, Need Satisfaction, and Longitudinal Well-Being: The Self-Concordance Model | Sheldon and Elliot’s integrated model of goal striving. Self-concordance (identified + intrinsic − introjected − external reasons) predicts sustained effort, effort fully mediates attainment (Study 1 β = .02 ns vs .76; Study 3 β = .08 ns vs .72), attainment predicts change in well-being more strongly when goals are self-concordant (interaction β = .11, .23), and accumulated daily autonomy, competence and relatedness partly mediate attainment’s effect on well-being (Study 3). Three correlational student samples; SEM fits reached after adding paths the modification indices suggested. | Read |
| NOTE-449 | The Time Course of Perceptual Choice: The Leaky, Competing Accumulator Model | The LCA: dx_i = [ρ_i − k x_i − β Σ_{j≠i} x_j] dt/τ + ξ_i √(dt/τ), with x_i floored at 0. For two choices x₁ − x₂ is an OU process with K = k − β; d′(t) = d_asy (1 − e^{−Kt})/√(1 − e^{−2Kt}) and d_asy = (2v/σ)√(1/K). On new time–accuracy data the OU curve beats diffusion-with-drift-variance in 7 of 9 fits (combined likelihood ratio about 62). Leak versus inhibition predicts recency versus primacy; 2 of 6 participants favoured the end cluster and 2 opposed it. A fixed-accuracy criterion gives Hick’s law in all three models simulated, so it does not discriminate them. | Read |
| NOTE-450 | The Markov blanket trick: On the scope of the free energy principle and active inference | The FEP is true of things defined its way, but its scope is limited: a Markov blanket fits only some things, is placed where the model needs it, and cannot represent relational properties or a boundary the system makes. Its real job is to give any system the partition variational Bayes requires. Active-inference models smuggle perception and action into hand-built generative models. A conceptual critique; no new formal result and no data. | Read |
| NOTE-451 | Hierarchically organized behavior and its neural foundations: A reinforcement learning perspective | The paper introduces hierarchical RL (options) to psychology and neuroscience as a response to RL’s scaling problem. An actor-critic options model learns faster with useful options (doorways in the rooms task) and slower or worse with unhelpful ones (windows; a shortcut ignored). It proposes DLPFC for option identity, DLS for option-specific policies, and OFC for option-specific values and option-level prediction errors. It predicts phasic dopamine at subtask boundaries and a possible neural pseudo-reward. Option discovery is named as the central problem. | Read |
| NOTE-452 | The Intimate Contest for Self-Command | Schelling’s essay proposes “egonomics”, the art of managing oneself. Its core claim is that many self-control tactics are the tactics for managing another person, applied to a “sometime self” who will be in command later. It gives a taxonomy of habits by time profile, onset time, warning time, cost, visibility, damage function and self-aggravation. It refuses a general answer to which self is authentic. It estimates the stakes at “on the order of a trillion dollars” for the current population. | Read |
| NOTE-453 | Evolution of the Internal Family Systems Model | Schwartz’s short statement of the IFS model. A person is “an ecology of relatively discrete minds”, parts forced into managerial, exiled or firefighting roles by experience, which can return to valuable roles. At the core is a Self with leadership qualities (the eight Cs), reached when parts “step back”, as in the founding case of “Diane”. The Self is an active healer, not a witness. A practitioner’s essay; its evidence is clinical experience. | Read |
| NOTE-454 | Sophisticated Inference | Expected free energy evaluated recursively over the beliefs an agent would hold after each plausible outcome turns active inference into a pruned tree search over belief states, formally analogous to Bellman recursion. Small simulations show it planning through short-term costs (an aversive cue; a maze barrier needing horizon four) and exploring by novelty. Its scalability is argued from pruning, not demonstrated; its first-principles grounding is cited, not developed. | Read |
| NOTE-455 | The Normative Constitution of Agency | Korsgaard asks whether agency is natural (a movement caused by the right mental state) or normatively constituted (a movement backed by an agent whose unity is achieved by following norms). Ordinary attribution of action implies activity and identity. Self-constitution explains both: the categorical and hypothetical imperatives give action the form of self-determined efficacy, and the maxims chosen under them constitute practical identity. Reflective self-consciousness breaks given unity and sets the task of rebuilding it, so unity of agency is “an achievement, not a given”. | Read |
| NOTE-456 | Participatory sense-making: An enactive approach to social cognition | An enactive account of social cognition built on coordination dynamics. When coordination and the encounter shape each other, the interaction gains its own precarious operational closure; it is social only if the interactors stay autonomous. Coordinated sense-making then ranges from one partner’s sense-making being modulated to meanings made jointly. Conceptual throughout; evidence is illustrative (corridor, charades, mother–infant timing, perceptual crossing). | Read |
| NOTE-458 | Defining Agency: Individuality, Normativity, Asymmetry, and Spatio-temporality in Action | Minimal agency needs a self-individuated system that is the source of modulations of its coupling with the environment and regulates them by norms it generates. An autonomous organization, a precarious network of mutually enabling processes, generates all three when it adaptively modulates its coupling for its own maintenance. Life is sufficient, not necessary. The definition is a proposal: the authors say asymmetry’s formalization is incomplete and modeller-relative. | Read |
| NOTE-459 | Uncertainty-based competition between prefrontal and dorsolateral striatal systems for behavioral control | Habit and goal-directed action are model-free (cached values) and model-based (tree search) reinforcement learners, arbitrated by which controller’s Bayesian posterior over action value has the lower variance. Over-training shifts control to the cache because tree search accrues computational noise per step. Task complexity and proximity to reward keep the tree in control. It also predicts that incentive learning should become unnecessary when the caching system is lesioned. | Read |
| NOTE-460 | Précis: Being No One | Metzinger’s own sketch of the self-model theory. Six constraints (globality, presentationality, transparency, convolved holism, dynamicity, perspectivalness) build up consciousness; a transparent self-model yields phenomenal selfhood, so “no such things as selves exist in the world”; transparency is graded, inversely proportional to the attentional availability of earlier processing stages. Phenomenal unity is one global functional cluster. The first-person perspective is a model of the intentionality relation, whose iteration gives introspective and social intelligence. A theory statement: no new evidence. | Read |
| NOTE-461 | The Physics of Optimal Decision Making: A Formal Analysis of Models of Performance in Two-Alternative Forced-Choice Tasks | Proves the pure DDM is the continuum limit of the SPRT and so the optimal two-choice decider. The linearised Usher–McClelland model decouples into a difference process, an O-U with λ = w − k, and a stable sum process, so it reduces to the DDM when k = w and both are large; feedforward inhibition does so at u = 1, pooled inhibition with fast inhibitory units, the race model never. The reward-rate-optimal threshold is unique and depends only on the total delay, giving a parameter-free optimal performance curve (peak decision time about 0.2 of the delay at ER about 18%). | Read |
| NOTE-462 | An Accumulator Model for Spontaneous Neural Activity Prior to Self-Initiated Movement | A three-parameter leaky stochastic accumulator, δx = (I − kx)Δt + cξ√Δt, fitted to Libet-task waiting times (k = 0.5, I = 0.11, threshold at the 80th percentile of output), reproduces the readiness potential (r² = 0.96) and the linear mean–SD relation of waiting times (r = 0.9). In a variant with random clicks, fast responders showed a slow negativity before the click (P < 0.005), and fast and slow clicks were spread equally through the trial (P = 0.64). The neural decision to move is placed at the threshold crossing about 150 ms before movement. | Read |
| NOTE-463 | Model-based and model-free Pavlovian reward learning: Revaluation, revision, and revelation | The paper argues that Pavlovian prediction has a model-based form. A cue that predicted disgusting salt was instantly “wanted” in a novel salt appetite, before retasting, with mesolimbic activation. That needs identity-specific prediction revalued by current state, which no model-free cache provides. It proposes “defocusing” of the predicted outcome as a model-based source of apparent habit. It argues dopamine can carry model-based evaluations. A kappa-transformation model fits the data but is described as phenomenological, and no algorithm is offered. | Read |
| NOTE-464 | A Planning Agent’s Self-Governance over Time | Bratman’s model of a planning agent’s self-governance over time. It needs (1) planned temporally extended activity with a time-frame to “plan’s end”, (2) synchronic self-governance along the way, (3) cross-temporal links of intention that are intrapersonal analogues of shared intention, so the agent acts “together” with herself, and (4) “diachronicalized” standpoints holding a conditional, reflexive end of diachronic self-governance. The model makes some willpower and resistance to shuffling self-governed and excludes the toxin case. Argued by cases, not tested. | Read |
| NOTE-465 | The Sources of Normativity | Korsgaard’s Tanner Lectures. The normative question (what justifies morality’s claims on us) is not answered by voluntarism, substantive realism or reflective endorsement alone. Reflective consciousness forces us to act on reasons, and so to identify with a law: a “practical identity”, the description under which we value ourselves. Obligation is the reflective rejection of a threat to that identity. Valuing any identity commits us to valuing humanity, reasons are public, and animals’ pain can obligate us. Argued, but “sketchy” by its own account. | Read |
| NOTE-466 | HDDM: Hierarchical Bayesian Estimation of the Drift-Diffusion Model in Python | HDDM fits the full DDM (v, a, z, t with sv, st, sz) by MCMC in PyMC, with group-level priors such as μ_a ~ Gamma(1.5, 0.75), μ_v ~ N(2, 3), z_j ~ invlogit(N(μ_z, σ_z²)), and the Navarro–Fuss likelihood. A patsy-style regressor lets a parameter vary with a trial covariate. In simulations with 12 subjects and 20–150 trials, hierarchical Bayes had the lowest trimmed recovery error for every parameter and the highest power to detect drift differences and covariate effects, by up to 20% for the latter with larger effects and few trials. | Read |
| NOTE-467 | The Haken–Kelso–Bunz (HKB) model: from matter to movement to mind | Kelso’s retrospective on HKB. The relative-phase equation dφ/dt = −a sin φ − 2b sin 2φ has stable in-phase and anti-phase states for b/a > 1/4 and only in-phase below; with noise the switch is a nonequilibrium phase transition with critical fluctuations and slowing. Symmetry breaking gives metastability (relative coordination); merged with Kuramoto it models groups. The same dynamics is reported within and between people and in brain activity. A first-person account, not a review. | Read |
| NOTE-468 | Biological organisation as closure of constraints | A constraint acts on a process while being conserved at that process’s time scale; closure is a set of constraints, each directly dependent on and generative for another, that cannot be split. This separates closure from cycles of processes, grounds functions, and gives a boundary criterion, refined by a preliminary count-based tendency to closure for symbionts and by nested separated closures for levels. Applied only to schematic examples; closure is not claimed to define organisms. | Read |
| NOTE-469 | Thine Own Self: True Self-Concept Accessibility and Meaning in Life | Five studies with students. True-self accessibility, the residual speed of “me” judgments for one’s own true-self traits, predicts MLQ presence of meaning (β = .29, .24, .19 in Studies 1, 2, 4) beyond actual-self accessibility, affect, need satisfaction, liking, overlap, state self-esteem and AI-3 authenticity. Subliminal true-self primes raised reported meaning against actual-self primes (Study 3, ANCOVA F = 4.46) and against disliked actual-self primes (Study 5, contrast F = 5.07), with disliked true-self traits as effective as liked ones. | Read |
| NOTE-470 | “First we invented stories, then they changed us”: The Evolution of Narrative Identity | McAdams’s review essay on narrative identity: “the internalized and evolving story a person invents to explain how he or she has become the person he or she is becoming”. Storytelling is placed in human evolution as a tool for simulating social life and binding groups. The self is layered as actor, then agent, then author, with the life story arriving in adolescence on the back of autobiographical memory, theory of mind and autobiographical reasoning. Story features predict well-being and generativity. Culture supplies master narratives. Claims are cited, not shown. | Read |
| NOTE-471 | Bayesian Interpolation | Evidence ≈ best-fit likelihood × Occam factor, the ratio of posterior to prior accessible parameter volume. At the evidence maximum the regulariser’s χ² equals γ = Σ λ_a/(λ_a + α), the number of well-determined parameters, and the data χ² equals N − γ. Polynomials show an “Occam hill” in k, and the true Hermite model wins on data drawn from it. | Read |
| NOTE-472 | Natural Gradient Works Efficiently in Learning | Natural gradient ∇̃L = G⁻¹∇L is steepest descent under metric G (Theorem 1); for a statistical model G is the Fisher information. Online learning w_{t+1} = w_t − (1/t)∇̃l is Fisher efficient, Ṽ_t = G⁻¹/t + O(1/t²) (Theorem 2). Explicit G and G⁻¹ for a perceptron (Theorems 3–4) and the natural gradient ∇L·WᵀW on the matrix group (Theorem 6). The plateau claim for multilayer perceptrons is a conjecture resting on Yang & Amari (1997). | Read |
| NOTE-473 | A Widely Applicable Bayesian Information Criterion | The Bayes free energy of a singular model is nL_n(w0) + λ log n − (m − 1) log log n + O_p(1), with λ the RLCT. The posterior mean of nL_n(w) at inverse temperature 1/log n (WBIC) reproduces the first two terms without knowing λ, equals BIC for regular models, and two temperatures estimate λ. In reduced-rank regression WBIC chose the true rank 100/100 times, and estimated RLCTs within about 0.5 of theory. | Read |
| NOTE-474 | Traces of Class/Cross-Class Structure Pervade Deep Learning Spectra | G = Gclass + Gcross + Gwithin + Gc=c′ (Eq. 6.4); knockouts give C outliers to Gclass, a C² mini-bulk to Gcross, the bulk to Gwithin, in log-spectra. Gˡ = Σ w (hhᵀ) ⊗ (δδᵀ) (Eq. 7.8), so gc ≈ hc ⊗ δc. K-FAC Hˡ ⊗ Δˡ misaligns G’s outliers; CFAC Ave_c Hˡc ⊗ Δˡc aligns them at deep layers. For multinomial logistic regression on a Gaussian model the expected Fisher has C outliers, C(C−2) mini-bulk and a bulk (Theorem 8.1). | Read |
| NOTE-475 | Deep Equals Shallow for ReLU Networks in Kernel Regimes | For κ(xᵀx′) on S^(d−1), µ_k = (ω_(d−2)/ω_(d−1)) ∫ κ(t)P_k(t)(1 − t²)^((d−3)/2) dt (Eq. 8), shared by N(d, k) ~ k^(d−2) harmonics. Theorem 1: an endpoint expansion κ(1 − t) = p(t) + c t^ν + o(t^ν) with ν non-integer gives µ_k ~ C k^(−d−2ν+1), parity-dependent. ReLU kernels have ν = 1/2 (NTK) and 3/2 (random features) at any depth, so the deep NTK decays as k^(−d) and the deep RF kernel as k^(−d−2) (Corollaries 2–3). MNIST and Fashion-MNIST accuracy is flat in depth from L = 2 to 5 (Table 1). | Read |
| NOTE-476 v2 | Prevalence of Neural Collapse during the terminal phase of deep learning training | NC1 Σ_W → 0 (Tr(Σ_WΣ_B†)/C falls), NC2 centred means → simplex ETF (cosines → −1/(C−1)), NC3 W ∝ Ṁᵀ, NC4 nearest class mean; 7 datasets × 3 nets, 480 models. Median TPT gains: +0.35 points test accuracy, +0.0252 DeepFool robustness. NC1–2 ⇒ NC3–4 for Webb–Lowe and max-margin (Theorems 2, 4). Optimal small-noise error exponent C/(C−1)·1/4, only at simplex ETFs (Theorem 5). | Read |
| NOTE-477 | Bayesian model reduction | The free energy of any model that differs from a fitted one only in its prior is ln E_Q[P̃/P] plus the fitted free energy, with closed forms for Gaussian, Dirichlet, beta, gamma, categorical and multinomial priors. Greedy pruning by this quantity recovers sparse structure in three simulations. Hierarchical models invert as a cascade of reductions. | Read |
| NOTE-478 | The Full Spectrum of Deepnet Hessians at Scale | Hess = H + G (Gauss–Newton). At 28M parameters the Hessian has a bulk and about C outliers; outliers are in G, the bulk mostly in H; H is symmetric and power-law, φ ∝ |λ|⁻²·⁷ (R² 0.99), not Marchenko–Pastur or semicircle. G = A₁ + A₂ + B₁ + B₂ (Eq. 5): C class means give the outliers, cross-class spread and within-pair spread give two bulks. FastLanczos costs O(Mnp) time and O(p) memory. | Read |
| NOTE-479 | Measurements of Three-Level Hierarchical Structure in the Outliers in the Spectrum of Deepnet Hessians | G = (1/n)ΔΔᵀ with δᵢ,c,c′ = column c′ of diag(√p)(I − 1pᵀ)∂f/∂θ. C² group means δc,c′, C cluster centres δc; G = G₀ + G₁ + G₂ + G₃ (Eq. 28). Top-C eigenvalues of G ≈ those of G₁ = (C−1)Ave_c δcδcᵀ, from a C×C Gram matrix, with λc(G) ≥ λc(G₁₊₂) ≥ λc(G₁). 18,000 CIFAR/MNIST models plus ImageNet VGG16/ResNet50. Group means switch from clustering by logit c′ to by class c during training. | Read |
| NOTE-480 | Shampoo: Preconditioned Stochastic Tensor Optimization | Matrix case: L = εI + Σ GGᵀ, R = εI + Σ GᵀG, W ← W − ηL^{-1/4}GR^{-1/4}. Lemma 8: εI + (1/r)Σ ggᵀ ⪯ L^{1/2} ⊗ R^{1/2} for rank-r gradients, so the Kronecker preconditioner dominates full AdaGrad. Regret √(2r) D Tr(L^{1/4}) Tr(R^{1/4}) = O(√T) (Theorem 7); order-k tensors use power −1/2k per dimension (Theorem 10). Steps per second within a few percent of SGD/Adam/AdaGrad (Table 1); on LM1B 3.509 against 4.87–4.92. | Read |
| NOTE-481 | The Convergence Rate of Neural Networks for Learned Functions of Different Frequencies | For uniform data the wide two-layer ReLU Gram matrix H∞ is a convolution on the sphere, so its eigenvectors are Fourier modes or spherical harmonics. On S¹, bias-free: λ_k = 1/π², 1/4, 2(k²+1)/(π²(k²−1)²) and 0 for k = 0, 1, even k ≥ 2 and odd k ≥ 3 (Eq. 12). With zero-initialised bias, odd k ≥ 3 get 1/(π²k²) (Eq. 13). Learning time grows as k² on S¹ and about k³ on S², as measured for shallow, deep and residual networks (Figs. 6–7). | Read |
| NOTE-482 v2 | Gemma Scope: Open Sparse Autoencoders Everywhere All At Once on Gemma 2 | JumpReLU SAE: f(x) = z ⊙ H(z − θ), z = W_enc x + b_enc, x̂ = W_dec f + b_dec, loss ‖x − x̂‖² + λ‖f(x)‖₀, with θ trained by straight-through estimators (bandwidth ε = 0.001). Released on all layers and sublayers of Gemma 2 2B and 9B and three layers of 27B, at widths 2¹⁴–2²⁰. Evaluated by delta LM loss and FVU against L0. Residual SAEs cost the most loss; base-model SAEs transfer to the IT model; wider SAEs split latents. No agreed SAE quality metric exists. | Read |
| NOTE-483 | Towards Understanding the Spectral Bias of Deep Learning | Theorem 4.2: n^(−1/2)‖V_(r_k)ᵀ(y − ŷ(T))‖ ≤ 2(1 − λ_(r_k))^T n^(−1/2)‖V_(r_k)ᵀy‖ + ε for any labels, given n ≥ Ω̃(ε^(−2) max{(λ_(r_k) − λ_(r_k+1))^(−2), M⁴r_k²}) and m ≥ Ω̃(poly(T, λ_(r_k)^(−1), ε^(−1))). Theorem 4.3: on uniform S^d the NTK’s eigenfunctions are spherical harmonics, µ_k = 0 for odd k ≥ 3, and µ_k = Ω(max(k^(−d−1), d^(−k+1))) for even k. Experiments in R¹⁰ learn degrees 1, 2, 4 in that order, also on three non-uniform densities. | Read |
| NOTE-484 | Bayesian hypothesis testing for psychologists: A tutorial on the Savage–Dickey method | For nested models the Bayes factor for a point null is the ratio of posterior to prior density of the tested parameter at the null value, under the larger model (Eq. 12, derived in Appendix A). It needs the nuisance parameters’ prior to be continuous at the null. Worked examples give BF10 ≈ 2.2 where p ≈ .006, and BF01 ≈ 4 in favour of a null of no group difference. | Read |
| NOTE-485 v2 | An Active Inference Approach to Modeling Structure Learning: Concept Learning as an Example Case | A partially observed MDP with spare hidden-state slots learns new animal concepts without feedback, refines coarse categories into fine ones, and generalises to an unseen animal in one shot. Bayesian model reduction on the learned state prior resets unneeded slots: right in 45–80% of runs for 4–7 true concepts, never for 2–3, and always when the likelihood is given. | Read |
| NOTE-486 | Optimizing Neural Networks with Kronecker-factored Approximate Curvature | Fisher blocks E[āāᵀ ⊗ ggᵀ] ≈ E[āāᵀ] ⊗ E[ggᵀ], with error a sum of third- and fourth-order cumulants; the inverse is approximated as block-diagonal or block-tridiagonal over layers. Factored Tikhonov damping (π chosen by trace norms), re-scaling by the exact Fisher, and a two-parameter momentum solved on the quadratic model. On three deep autoencoders it beats tuned NAG-SGD by orders of magnitude in iterations; block-tridiagonal gains 25–40% per iteration over block-diagonal. | Read |
| NOTE-487 | Post hoc Bayesian model selection | Models that differ only in their priors can be scored from one fitted full model: reduced evidence is full evidence times the posterior expectation of the prior ratio. Savage–Dickey is the point-mass case, ARD the continuous one. Under Laplace the reduced free energy is closed-form. Simulations recover a sparse regression (4,096 models) and a three-edge brain network (64 models). | Read |
| NOTE-488 | Conscious birds | Review. Crow NCL neurons track the reported percept, not the stimulus, and NCL is nuclear rather than laminar; the pigeon connectome has the hub-and-module form GNWT requires; avian pallium has recurrent connectivity (RPT); IIT’s markers (PCI, grid-like lattices) are untested in birds. Pigeons and roosters fail the mark test but discriminate their mirror image from a conspecific. GNWT and RPT requirements “seem to be mostly met”; the authors call the evidence short of a strong conclusion. | Read |
| NOTE-489 | Three types of phenomenal consciousness and their functional roles: unfolding the ALARM theory of consciousness | ALARM: basic arousal (level-1 experience, subcortical) alarms the agent when homeostasis fails, triggering survival behaviour, care for the body and generalised learning without choice; general alertness (level-2, cortical, attention-guided) enables flexible learning and decision; reflexive self-consciousness is general alertness plus metacognitive self-relational content, enabling long-term planning. IIT, HOT and GNWT are said to cover only general alertness. Argued, not tested. | Read |
| NOTE-490 | Block — The Mind as the Software of the Brain | An introductory chapter that says what the computer model of the mind claims and defends it. Intelligence is explained by functional decomposition into primitive processors; meaning-respecting processing by an isomorphism between syntactic and semantic functions that must hold counterfactually; intentionality by a language of thought whose symbols get meaning from functional role. The Turing test, Stich’s syntactic theory and Searle’s Chinese room are criticised. Block grants the model for intelligence and intentionality and doubts it for phenomenal consciousness. | Read |
| NOTE-491 | Block & Fodor — What Psychological States are Not | Block and Fodor argue that behaviourism and type physicalism fail on empirical grounds, and that machine-state functionalism (FSIT) fails because psychological states cannot be one-to-one with the machine-table states of a probabilistic automaton. Dispositions, simultaneity, productivity and structure all break the correspondence, and machine-table identity is too fine-grained. Inverted and absent qualia are a prima facie objection to any functional definition. What survives is that psychological states may be computational states of an automaton, typed by the laws they fall under. | Read |
| NOTE-492 | Block — Functional Role and Truth Conditions | A use (functional role) theory of meaning must say why ‘aluminum conducts electricity’ has different truth conditions on Earth and Twin Earth. Internal inferential roles cannot, and appeals to referential uses beg the question. A public-use theory can only do it with long-arm roles that import the devices of a theory of reference, and the result is equivalent to a two-factor theory whose internal part is narrow meaning. Burge’s arthritis cases further require role in a language, structured by deference, alongside individual roles. | Read |
| NOTE-493 | On a confusion about a function of consciousness | P-consciousness is experience and is not a functional notion. A state is A-conscious if its content is poised for reasoning and for rational control of action and speech. From blindsight or petit mal to a function of P is a fallacy, because A is missing too and A’s machinery has that function. A without P (superblindsight) seems not to occur; P without A is suggested, not shown, by the noticed drill, Sperling arrays, hypnotic analgesia and anaesthesia. | Read |
| NOTE-494 | Cross-region neuron co-firing mediated by ripple oscillations | In 35 patients (43 sessions, 1,373 units) doing a Sternberg task, ripple co-occurrence between bundles is about 5% at every distance from 71 to 223 mm, and unit pairs co-fire a median 34% more during co-ripples than in no-ripple periods (n = 31,489 pairs), 117% more by rate-corrected STTC. Load 3 raises co-ripple co-firing 13% (maintenance) and 19% (retrieval) over load 1. Encoding co-firing recurs at retrieval in 0.29% of cell-pair trials in co-ripples versus 0.14% outside them, 0.36% versus 0.23% for fast versus slow load 3 responses. | Read |
| NOTE-495 | What Is Wrong with the No-Report Paradigm and How to Fix It | No-report paradigms separate consciousness from report but not from post-perceptual cognition that tracks the percept (the bored monkey problem), so prefrontal decoding in no-report rivalry does not show that prefrontal cortex is part of conscious perception. A no-differential-post-perceptual-cognition paradigm is needed. Brascamp et al.’s inconspicuous rivalry, whose switches subjects detected at chance, found no prefrontal difference by fMRI, which Block counts as some support for non-cognitive theories while warning fMRI may be too coarse. | Read |
| NOTE-496 | Two neural correlates of consciousness | Proposes a phenomenal NCC (minimal basis of an experience’s content, for seen motion recurrent MT/V5–V1 activity) and an access NCC (frontoparietal workspace broadcasting). Because access is winner-take-all, a recurrent sensory content can lose and go unaccessed. Signal-detection readings of the exclusion task and of Supèr et al.’s V1 figure–ground modulation, which persists when low salience or many catch trials uncouple it from detection, are offered as evidence. | Read |
| NOTE-497 | Consciousness, accessibility, and the mesh between psychology and neuroscience | States the methodological puzzle: the neural basis of phenomenology can be found only by deciding whether it includes the machinery of access, which reports cannot decide. Answers it by inference to the best explanation: in Sperling, Landman et al. (capacity 6–7 of 8 when cued up to 1.5 s after offset, versus 4) and Sligte et al. (up to 32 items, 4 s) phenomenology overflows a working memory of about four. If workspace activation is not part of phenomenology, losing recurrent sensory coalitions explain the overflow. | Read |
| NOTE-498 | Block — Précis of The Border between Seeing and Thinking | Block restates the thesis of his 2023 book, that perception is constitutively iconic, nonconceptual and nonpropositional and cognition paradigmatically discursive, and develops its least explained notion, the cognitive envelope: the global workspace conceptualises percepts, and the representations held in working memory are task-dependent abstractions that differ from perceptual ones in nine documented ways. Iconicity is defined by tracking and mirroring. Infant and animal iconic thinking is conceded but placed inside a cognitive envelope. | Read |
| NOTE-499 | Distinct ventral stream and prefrontal cortex representational dynamics | In 430 visually responsive subdural electrodes from 10 patients, HFA (70–150 Hz) amplitude and category selectivity fell about 80% from peak by 800–900 ms while images stayed on. Ventral temporal decoding stayed near ceiling (face–watch AUC 99.8%), generalised across time, and ended about 230–450 ms after offset at every duration. Prefrontal and parietal decoding (peak AUC 84–86%) was confined to about 150–600 ms and ignored duration. Exemplar geometry was sustained only in ventral temporal cortex. | Read |
| NOTE-500 | Perceptual consciousness overflows cognitive access | Against sparse readings of Sperling and the Amsterdam change-detection tasks, which posit conscious generic or fragmentary representations plus detailed unconscious iconic memory: there is no independent evidence for the latter, and the one direct test of unconscious working memory (Soto et al., just above 55% at 5 s) is too weak. Fragile VSTM holds 7, 6 and 5 of 8 items at 1, 2.5 and 4 s, is cortical, and is spared by inattention and right dlPFC TMS that impair working memory. | Read |
| NOTE-501 | The Harder Problem of Consciousness | An argument for a conditional. If naturalism (physicalism is the default), phenomenal realism and anti-scepticism hold, then whether a superficial functional isomorph with a different physical basis is conscious is meta-inaccessible. Physicalism is then the default yet inaccessible, and it is the subjective default that the isomorph is not conscious while the question stays open. Disjunctive and superficial-role identities are metaphysically possible but could never be accepted by inference to the best explanation. | Read |
| NOTE-502 | Interacting spiral wave patterns underlie complex brain dynamics | Phase fields of 0.01–0.1 Hz HCP fMRI on the flattened cortex hold about 16 spirals per hemisphere at rest (radius 10.5 ± 4.8 mm), centred on phase singularities that move at 2.2 mm/s with superdiffusive exponent β ≈ 1.5 and sit on functional boundaries. Opposite spirals annihilate (51% fully, 46% partly), like ones repel (2.6%). Spiral centres and charges decode four language conditions at 48.3% (chance 25%, raw-amplitude decoder 30.2%), and spiral pairs act as gates and walls that route task activity flow. | Read |
| NOTE-503 | Block — Advertisement for a Semantics for Psychology | Block advertises two-factor conceptual role semantics as the only approach that could meet eight desiderata for a semantics serving cognitive science. Narrow meaning is an expression’s short-armed conceptual role, its abstracted causal role in reasoning and deliberation; a separate factor relates it to referents. Conceptual role explains behaviour shared across Twin Earth, learning without definitions, relativity of meaning to representational system, and the inheritance of public meaning from the language of thought. Harman’s long-arm roles reduce to the same two factors, and Gricean and indicator semantics either are not naturalistic or fail. | Read |
| NOTE-504 | Block — Inverted Earth | Block gives the converse of the inverted spectrum: on Inverted Earth a subject or twin with identical brain, identical qualitative content and no internal disturbance comes, through his embedding in the environment and language, to have inverted intentional content and an inverted long-arm functional role. So qualitative content is not a functional state, and public colour talk expresses intentional content. The argument is stronger than the inverted spectrum on testimony and supervenience. A short-arm functional theory of qualia would escape it, and Block can only ask what that theory is. | Read |
| NOTE-505 | Comparing the Major Theories of Consciousness | Compares higher-order thought, global workspace and biological theories by whether they can recognise the explanatory gap. HOT and the workspace replace it with puzzles of their own making; only the biological theory fully acknowledges it, and concept dualism (Nagel, Loar) keeps it from implying dualism. Ambitious HOT also suffers ad hoc stipulation, the mismatch problem and implausibility for infants. Goldberg et al.’s data suggest self-related activity is inhibited in intense perception. The biological theory is the least friendly to machine consciousness. | Read |
| NOTE-506 | Block — Psychologism and Behaviorism | A machine that stores every sensible conversation of a given length and looks up its next reply has the capacity to respond sensibly to anything said to it, so it meets the strongest behaviourist conception of intelligence, but its intelligence is its programmers’. So psychologism is true: whether behaviour is intelligent depends partly on how it is produced. The standard objections to behaviourism only ever refuted necessary conditions; this refutes the sufficient one. Psychologism does not require our kind of processing, only processing that is not of the most elementary sort. | Read |
| NOTE-508 | The Weighted Likelihood Ratio, Linear Hypotheses on Normal Location Parameters | States the Savage–Dickey ratio in general, not only for normal models: for a sharp hypothesis η(θ) = η_H with positive prior mass, the Bayes factor L_D(H) equals the alternative’s posterior density of η at η_H over its prior density there (3.9), provided the null’s nuisance prior is the alternative’s conditional prior at η_H (3.8). Dickey calls it Savage’s density ratio and credits the proof to Dickey & Lientz. He then applies it to normal means, the Model-I F test and the univariate and multivariate Behrens–Fisher problems with conjugate priors. | Read |
| NOTE-509 | Ultraviolet Superradiance from Mega-Networks of Tryptophan in Biological Architectures | A radiative non-Hermitian Hamiltonian for N tryptophan 1La dipoles (single excitation) predicts superradiant states in microtubule architectures (max Γ/γ ≈ 4000 in a centriole, ≈ 7000 extrapolated for bundles) and a thermal quantum yield that grows with size and is insensitive to static disorder up to 200 cm⁻¹. Steady-state spectroscopy gives tryptophan QY 17.6 ± 2.1% in microtubules against 10.6 ± 0.6% in tubulin dimers. No lifetimes were measured, so the radiative rate is inferred, not observed. | Read |
| NOTE-510 | Mashour, Roelfsema, Changeux & Dehaene — Conscious Processing and the Global Neuronal Workspace Hypothesis | A proponents’ review. Conscious access is ignition: a sudden, self- sustaining, all-or-none activation of long-range hub neurons (prefrontal among them) that broadcasts one representation, against a decaying wave for unseen stimuli. Its best evidence is van Vugt et al.’s monkey recordings, where the signal-detection threshold is the prefrontal ignition threshold, plus a late (>200 ms) seen/unseen divergence across modalities and drug-invariant frontal-parietal disconnection under anaesthesia. It is a theory of access; it calls phenomenality without access untested, and admits the main theories cannot yet be told apart. | Read |
| NOTE-511 | Block — Mental Paint | Block defends phenomenism, the view that phenomenal character outruns representational content, against both forms of representationism. Internalist representationism has only functional resources, and a child raised among ever-changing colours has colour experiences without abiding functional differences. Externalist representationism fails on swampman, on the difference between attention and awareness, on bodily sensations, on Inverted Earth with intact long-term memory, and on an empirical shifted-spectrum argument from normal variation in colour vision. What stays the same across representational change is mental paint. | Read |
| NOTE-512 | Going Beyond Linear Mode Connectivity: The Layerwise Linear Feature Connectivity | LLFC: c·f⁽ℓ⁾(αθ_A + (1 − α)θ_B) = αf⁽ℓ⁾(θ_A) + (1 − α)f⁽ℓ⁾(θ_B) for every layer ℓ and α, some c > 0. Observed whenever LMC holds (spawning or permutation), across MLP, VGG-16, ResNet-20/50. Lemma 1: LLFC ⇒ error ≤ 2ε on the path. Theorem 1: weak additivity of ReLU + commutativity (W_A H_A + W_B H_B = W_A H_B + W_B H_A) ⇒ LLFC with c = 1. Weight and activation matching minimise the two factors of (W_A − PW_BPᵀ)(H_A − PH_B). | Read |
| NOTE-513 | On Linear Mode Connectivity of Mixture-of-Experts Architectures | G(n) = ℝ^d × ℝ × S_n (common gate translation + expert permutation) preserves dense and top-k MoEs and, under genericity, is all of the gate’s symmetry (Thms 4.1, 4.2, k ≥ 2). Translation leaves barriers unchanged. Weight matching = LAP on expert order (centred gates or Gram matrices) + per-expert weight matching, O(n³ + nh³). Barriers near zero (One Billion Word: 0.0044–0.0066 vs 0.14–0.86 without expert ordering), but only the inserted MoE layer is trained; the ViT/GPT-2 backbone is shared and frozen. | Read |
| NOTE-514 | Linear Mode Connectivity and the Lottery Ticket Hypothesis | Instability = max error on the line between two copies trained from the same state under different SGD noise, minus the mean endpoint error; stable means under 2%. Networks are unstable at initialization (except LeNet) and stable after 1.5–20% of training. IMP subnetworks at extreme sparsity are matching when, and only when, they are stable; rewinding to an early iterate makes them so at ImageNet scale. | Read |
| NOTE-515 | Knowledge is a Region in Weight Space for Fine-tuned Language Models | Task vectors of RoBERTa-base fine-tuned on 12 datasets × 20 seeds cluster by dataset with 98% accuracy, and by task family (NLI, sentiment, topic) with 90%. Hull samples of a group’s fine-tuned models beat every outside model on the group’s data and beat the group’s own members in 88% (MNLI) to 96.7% (NLI family) of comparisons; extrapolation past the members fails fast. The centroid of models from other datasets, re-tuned with BitFit, is a better start than the pretrained model on 9 of 12 datasets. | Read |
| NOTE-516 | Taxonomizing local versus global structure in neural network loss landscapes | mc(θ, θ′) = ½(L(θ) + L(θ′)) − L(γ(t*)) on a trained Bezier curve, in 0-1 training error (Eq. 4); mc < 0 is a barrier, mc ≈ 0 well connected, mc > 0 unconverged ends. With Hessian top eigenvalue and trace and output CKA on mixup points, a load by temperature grid splits into phases I–IV, with IV-B (flat, connected, similar) the most accurate. Sharpness alone mispredicts across phases; with 10% label noise, the sharp phases beat flat but poorly connected phase III, and double descent appears along the Hessian transition. | Read |
| NOTE-517 | Mode Connectivity and Data Heterogeneity of Federated Learning | FedAvg, 10 clients, 200 rounds, Dirichlet label skew α ∈ {0.1, 0.2, 0.5} and PACS. Client/global low-loss overlap shrinks with heterogeneity; global models from one start under different α disagree on > 20% of inputs, are separated on the line (about 10% accuracy drop) and joined by a one-bend chain. Theory: ε_C = C e^{C T_max} max(√h(α), √h(α′))((√log N + z)/√N + √ε(√(D + log N) + z)), via mean-field dropout stability. MNIST two-layer net: dropout error < 0.01 at N = 6400, up to 0.06 at N = 200. | Read |
| NOTE-518 | Exact expressions for double descent and implicit regularization via surrogate random design | Surrogate design S^n_μ = Det(μ, K), density ∝ pdet(XXᵀ), K Poisson(γn) truncated at d. E[#rows] = n (Lemma 1); E[I − X̄⁺X̄] = (γnΣ + I)⁻¹ (Lemma 2); E[tr((X̄ᵀX̄)⁺)] = γn(1 − det((I/γn + Σ)⁻¹Σ)) (Lemma 3); λn = 1/γn. These give exact MSE in all regimes (Theorem 1) and E[X̄⁺ȳ] = (Σ + λnI)⁻¹v for n < d, with n = tr(Σ(Σ + λnI)⁻¹) (Theorem 2). For sub-Gaussian rows the i.i.d.-design MSE converges to the surrogate formula (Theorem 3), at an observed O(1/d) rate. | Read |
| NOTE-519 | A Random Matrix Analysis of Random Fourier Features: Beyond the Gaussian Kernel, a Precise Phase Transition, and the Corresponding Double Descent | Q̄ = ((N/n)(Kcos/(1+δcos) + Ksin/(1+δsin)) + λI)⁻¹ with δσ = (1/n) tr KσQ̄ is a deterministic equivalent for E_W[(ΣXᵀΣX/n + λI)⁻¹] (Theorem 1); Ē_train and Ē_test follow (Theorems 2–3). As λ → 0, δ ~ 1/λ for 2N < n and O(1) for 2N > n; det(Ω⁻¹) ~ λ, so Ē_test → ∞ at 2N = n unless the test set is within σ² ≲ λ of the training set. N/n → ∞ recovers Gaussian kernel regression. Theory matches MNIST, Fashion- and Kannada-MNIST. | Read |
| NOTE-520 | Linear Mode Connectivity in Multitask and Continual Learning | From a shared start ŵ₁, the multitask solution w₂ is linearly connected to ŵ₁ and ŵ₂, but ŵ₁ and ŵ₂ are not; the ŵ₁ → w₂ direction is nearly orthogonal to task 1’s top 50 Hessian eigenvectors, and ŵ₁ → ŵ₂ lies in their span. Different starts (CIFAR), input noise, label corruption and removed classes break the line. MC-SGD averages the loss along both lines with a one-example-per-class buffer: after 20 tasks 85.3 / 82.3 / 63.3% (Permuted MNIST / Rotated MNIST / Split CIFAR-100), multitask 89.5 / 89.8 / 68.8, Stable SGD 80.1 / 70.8 / 59.9. | Read |
| NOTE-521 | Geodesic Mode Connectivity | Length of a path in distribution space = √8 ∫ √dJSD (Fisher–Rao). Minimise the discrete energy Σ JSD(pᵢ‖pᵢ₊₁) over 25 interior models between two weight-matched ResNet-20 (4×, LayerNorm) CIFAR-10 networks, initialised on the line; the result keeps train and test loss low where the line has a large barrier, using unlabelled training images. One pair, no numbers in the text, hypothesis stated for all geodesics. | Read |
| NOTE-522 | Unveiling mode-connectivity of the ELBO landscape | Claims, without reported results, that LDA’s ELBO maxima from two SVI runs (New York Times corpus) are joined by essentially flat maximum-energy paths found by the simplified string method with natural-gradient bead updates; that the paths flatten with data size and number of topics K; and that statistical degeneracy, not only over-parameterisation (K > K*), explains it. The only figure is a schematic. | Read |
| NOTE-523 | ZipIt! Merging Models from Different Tasks without Training | Merging two differently initialised models trained on disjoint tasks: permute-then-average puts the result outside both task basins. Matching correlated features within and across models (Eq. 8) and merging only the early layers lifts CIFAR-10 (5+5) joint accuracy from 46.2 (Git Re-Basin) to 79.1 fully merged and 83.8 at 13/20 layers (ensemble 87.4). Fully merged ImageNet-1k (200+200) stays at 8.6; 10/50 layers reaches 60.9 (ensemble 63.3). Theorem 1 tightens Entezari et al.’s barrier bound by (1 − 2Γ)^{1/(2d+4)} for redundancy fraction Γ. | Read |
| NOTE-524 | Optimizing Mode Connectivity for Class Incremental Learning | In class-incremental learning (PODNet, CIFAR-100), the line between adjacent continual minima loses old-task accuracy in an interval. OPC adds a layer-wise Fourier perturbation δ_θ(λ) with δ(0) = δ(1) = 0 to the line, minimises old-task memory loss before a switching point λ* and new-task loss after it, with cylinder noise for flatness; EOPC averages 10 points near λ*. PODNet + EOPC: CIFAR-100 66.68 / 64.94 / 62.36 (5 / 10 / 25 steps) vs 65.47 / 63.13 / 59.85; forgetting 7.68 / 8.64 / 12.02 vs 19.26 / 25.01 / 28.55. | Read |
| NOTE-525 | Does Data Scaling Lead to Visual Compositional Generalization? | (n, k) framework: two concepts with n values, k seen combinations per value. From-scratch ResNet-50s: near-100% ID, large OOD drops; 4× ID data leaves 60–80% drops; more values or combinations help. Features go from spurious, to decodable but entangled, to linearly factored (R² > 0.8, cosine < 0.1–0.2). Proposition 4.1: with linearly factored embeddings spanning 2n − 1 dimensions, k = 2 suffices for a linear classifier to be correct on all (n − k)·n unseen pairs. DINO, DINOv2, CLIP: partly factored, above chance, not perfect. | Read |
| NOTE-526 | TIES-Merging: Resolving Interference When Merging Models | Task vector τ = θ_ft − θ_init. TIES keeps the top 20% of each τ by magnitude, sets γ_m = sgn(Σ τ̂_t), averages only entries agreeing with γ_m, and returns θ_init + λ τ_m. Validated: (IA)³ 66.4 vs 63.9 for task arithmetic; T5-base 73.9 vs 73.2; T5-large 76.9 vs 73.3; ViT-B/32 73.6 vs 71.8 (RegMean); ViT-L/14 86.0 vs 84.5. Unvalidated T5-base 69.7 vs 73.2. Oracle multitask signs give 72.0 against 73.1 for multitask training. | Read |
| NOTE-527 | Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs | Curve-finding: minimize E_{t∼U(0,1)} L(φ_θ(t)) over the bend θ of a one-bend chain or quadratic Bezier curve between two trained networks. The found curves keep loss and error near the endpoints where the line segment reaches near-chance error (Table 2). Points at t ≥ 0.4 already ensemble as well as the far endpoint. FGE, short cyclical learning rates late in training, beats Snapshot Ensembles at equal budget (Table 1). | Read |
| NOTE-528 | Understanding Mode Connectivity via Parameter Space Symmetry | Minimum of full-rank ‖Y − W_l…W₁X‖² ≅ GL_h(ℝ)^{l−1}: 2^{l−1} components, independent of width. 1-D three-layer: 4 components, 3 with a skip. h ≥ 2: permutations connect all components. Homogeneous last layers: rescaled minima in one component with unbounded midpoint loss, even under last-layer permutations (Props. 5.3–5.4). Symmetry curves γ(t) = exp(t log g)·w have constant loss; curvature ≤ κ bounds the chord’s distance from the level set by (1/κ)(1 − √(1 − (κ‖Δw‖/2)²)) ≈ κ‖Δw‖²/8. | Read |
| NOTE-529 | Unveiling Mode Connectivity in Graph Neural Networks | GCN node-classification solutions from different seeds show linear loss barriers that vary by graph (small on Cora, Citeseer; large on Coauthor-CS, Squirrel) and vanish along fitted quadratic Bezier curves. GCN, GraphSAGE and GAT give similar barriers, MLPs different ones. On CSBM graphs barriers fall with density and feature separability and peak at middling homophily. Stated without proof: a barrier bound through the spectral gap, a generalisation bound proportional to the barrier, and a Wasserstein distance between graphs’ interpolation-loss curves that bounds the domain-adaptation gap. | Read |
| NOTE-530 | Bridging Mode Connectivity in Loss Landscapes and Adversarial Robustness | Bezier path (Garipov) trained on 50–2,500 clean samples between two backdoored or error-injected models: models near the ends keep most clean accuracy and lose the attack (CIFAR-10 VGG, 2,500 samples, t = 0.1: 88% clean, 1.1% backdoor; injection 0% throughout). Standard-loss paths between regular and adversarially trained models are flat in standard loss but have a PGD robustness-loss barrier, correlated with λ_max of the input Hessian (PCC 0.71–0.88). Proposition 1’s proof assumes the loss is constant along the path in a way that, if true for all inputs, would remove the barrier. | Read |
| NOTE-531 | Essentially No Barriers in Neural Network Energy Landscape | AutoNEB finds paths between minima whose highest training loss is almost the minima’s for ResNets and DenseNets on CIFAR-10, with a small gap on CIFAR-100; test error rises at most 0.5% (CIFAR-10) and 2.2% (CIFAR-100) per §4.3, or 0.7% and 2.9% on the ResNets per Appendix B. Concatenating paths bounds every pair through a minimum spanning tree. Barriers shrink with width and depth. | Read |
| NOTE-532 | Git Re-Basin: Merging Models modulo Permutation Symmetries | Weight matching, coordinate descent over per-layer linear assignments for an NP-hard objective, aligns independently trained nets in seconds. After alignment, MNIST MLPs and wide CIFAR-10 ResNet-20s have zero loss barrier; 1×-width models and ImageNet ResNet-50 do not, and LMC appears only during training. A two-unit counterexample shows no permutation can connect some perfect solutions, so LMC is a property of SGD solutions. | Read |
| NOTE-533 | Do Deep Neural Network Solutions Form a Star Domain? | Conjecture 2: for width > αh (h the width at which SGD solutions are convex modulo permutation), the solution set is a star domain modulo permutation. Starlight (sample θ_n ∈ Z, t ∼ U[0,1], step on L((1−t)θ + tπ(θ_n)), re-permute by weight matching each epoch) finds θ⋆ whose train-loss barriers to held-out models are about 2–5× lower than regular–regular ones across 8 settings, falling with |Z| up to 50. Not zero; star loss itself can be high (DenseNet CIFAR-100 0.635 vs 0.006). BMA on the star domain: better AUROC, worse ECE than an ensemble. | Read |
| NOTE-534 | Mode Connectivity Beyond Classifiers: Evidence from Generative and Contrastive Models | One pair of DDPMs (Flowers102) and one pair of NanoCLIP models (Flickr30k) are joined by chains built by staged layer moves, per-layer variance correction and AdamW retraining to a loss threshold. DDPM training loss stays below 0.04 (AutoNEB peaks at 0.17), NanoCLIP below 0.09 (AutoNEB 6.69, accuracy 0.05). Ablations: all-layers, forward-order and SGD variants all raise the average loss. Intermediate DDPMs generate worse (higher FID) at endpoint-level training loss. | Read |
| NOTE-535 | Exploring Neural Network Landscapes: Star-Shaped and Geodesic Connectivity | Two-layer ReLU student of an orthonormal M-neuron teacher: the minimum manifold is explicit (Theorem 6); two random minima are 2-PL connected w.p. ≥ 1 − M((M²−1)/M²)^{m−2M}; any two are 4-PL connected for m ≥ 2M − 1; k minima share a linearly connected centre w.p. ≥ 1 − M((M^k−1)/M^k)^{m−kM}. Normalised geodesic distance is O(√M) for uniform minima but ≤ 1 + c₂/(r√m) for r-sparse ones. Deep linear nets: 2-PL a.s., 3-PL always, star centre a.s. for m > 1 + r(L − 1). Centres found empirically for FNN, VGG16, ResNet on MNIST/CIFAR-10 without permutation. | Read |
| NOTE-536 | The Generalization Ridge: Information Flow in Natural Language Generation | I(Zℓ; Y) = H(G_Z) + H(G_Y) − H(G_Z ∘ G_Y), with H(G) = −tr(G log G) on trace-normalized Gaussian Gram matrices (bandwidth 1) of ℓ2-normalized last-token states and target-token embeddings. It rises, peaks at layers 10/12 (GPT-2-S, synthetic: 0.2721) and falls (0.0188 at layer 12), where OOD early-exit accuracy peaks (56.90%) and ID accuracy keeps rising (93.17%). Middle residual updates add most; OOD-fitted residual scales downweight the last layers. The profile’s shape persists over 50 decoding steps. | Read |
| NOTE-537 | The Role of Permutation Invariance in Linear Mode Connectivity of Neural Networks | Conjecture 1: wide SGD solutions can be permuted into one linearly connected basin. Theorem 3.1 proves an output-level version only for a one-hidden-layer net at uniform random init, rate Õ(h^{−1/(2d+4)}). The evidence is that independent solutions S and permutations S′ of one solution show the same barriers across width, depth and data; simulated annealing lowers barriers only for shallow nets on easy data. | Read |
| NOTE-538 | Mechanistic Mode Connectivity | Mechanistic similarity = invariance to the same unit interventions on the latents of the data-generating process. Cue-reliant and cue-invariant ResNet-18 and VGG-13 models are quadratic- but not linear-connected, even after activation matching. Conjecture 1 (no LMC up to symmetry ⇒ mechanistic dissimilarity) is not what Appendix F.3 proves. For a one-hidden-layer ReLU net with interpolating minimizers, Lemma 2 (LMC forces identical activation patterns) with Theorem 1 (mechanisms of different complexity force different patterns) proves the converse: dissimilar mechanisms of different complexity ⇒ no LMC under any permutation. The paper presents this as verifying the conjecture. CBFT (cross-entropy + barrier loss + class-mean invariance loss) removes the cue on synthetic CIFAR-10/100 and Dominoes. | Read |
| NOTE-539 | Loss Surface Simplexes for Mode Connecting Volumes and Fast Ensembling | SPRO: train connecting vertices to minimize mean loss at 5 uniform samples in a simplicial complex minus λ log volume. It joins up to 7 modes in one complex and finds a low-loss region of at least 10 dimensions for VGG-16 on CIFAR-10 (volume collapses at the 11th vertex). ESPRO, simplexes grown from single modes at about 10 epochs per vertex, beats deep ensembles in error, calibration and corruption robustness. | Read |
| NOTE-540 | Generalized Linear Mode Connectivity for Transformers | Symmetry hierarchy S1 permutation ⊂ S2 semi-permutation ⊂ S3 orthogonal ⊂ S4 invertible. Transformer alignment = P_FF per layer, semi-permutation P̃_H over heads (matched on QK and OV circuits), one orthogonal O on the residual stream after LayerNorm → RMSNorm. Test-loss barriers (Table 2): vanilla 1.69–4.34, weight matching 0.34–1.56, learned matching 0.00 (ViT ×3), 0.02 (Tiny Shakespeare), 0.42 (BookCorpus); permutation-only learned 0.29–1.60. Learned matching mainly refines O. Small models only. | Read |
| NOTE-541 | Intermediate Layer Classifiers for OOD generalization | ILC_l(x) = W_l r_l(x) + b_l on frozen layer-l features, l ≤ L − 2, layer chosen on OOD validation data. Few-shot, best ILC minus last-layer retraining: +16.8, +6.3, +1.6, +6.3 points (ResNets on CMNIST, CIFAR-10, CIFAR-100C, MultiCelebA); +27.0 on MultiCelebA at π ≤ 0.03. Zero-shot worst-group accuracy: Waterbirds 79.4 → 87.1, CelebA 56.0 → 82.0, MultiCelebA 20.8 → 46.0. Layer 7 beats 8 everywhere in Figure 8. Intermediate features are less displaced by shift for minority groups. | Read |
| NOTE-542 | Rethinking generalization requires revisiting old ideas: statistical mechanics approaches and complex learning behavior | VSDL model: f = f(x; α, τ), α = m_eff/N lowered by label noise, τ raised by early stopping. Thermodynamic limit m, N → ∞ with α = m/N fixed. Continuous perceptron: s(ε) ~ ln ε, so 1/ε − α = 0 gives ε ~ 1/α (Eqs. 6–8). Ising perceptron: s(ε) ~ −(π²/2)ε² ln ε, and −π²ε ln ε = α has no solution for large α, so ε falls discontinuously to 0 at αc (Eqs. 9–13). Rigorous bound: error ≤ ε* + ε_τ, ε* the rightmost crossing of s(ε) and −α log(1 − ε) (Eqs. 14–18). No new theorem, no experiment. | Read |
| NOTE-543 | Proving Linear Mode Connectivity of Neural Networks via Optimal Transport | Layerwise neuron alignment equals a Wasserstein distance between empirical weight distributions (Birkhoff), so LMC modulo permutation follows when neuron weights are i.i.d. and layers are wide: for mean-field two-layer SGD (Theorem 3.1), and for deep Gaussian or sub-Gaussian nets with m̃_ℓ = Õ((T_ℓ/ε)^{m̃_{ℓ−1}}) (Theorem 5.2), tight by Theorem 5.3. Low-dimensional weights relax this (Theorem 5.4). | Read |
| NOTE-544 | Explaining Landscape Connectivity of Low-cost Solutions for Multilayer Nets | ε-dropout-stable ReLU nets are ε-connected by a piecewise-linear path (Theorem 1); ε-noise-stable nets by 10 segments with barrier Õ(ε) (Theorem 2), or 13 through a narrow low-loss net (Theorem 3). For any width there is a teacher dataset on which a two-layer student’s global minima are disconnected (Theorem 4). MNIST convnets and a VGG-11 on CIFAR-10 satisfy the conditions roughly. | Read |
| NOTE-545 | Freedom of the Will and the Concept of a Person | Persons differ from other creatures in the structure of the will: they have second-order volitions, desires that a given desire be the one that moves them to act, and wantons do not. Forming one is identifying with a desire. Freedom of the will is having the will one wants, and a decisive identification ends the series of higher orders “without cutting it off arbitrarily” (p. 16). Responsibility needs neither a free will nor alternatives: the willing addict acts of his own free will. The view is neutral on determinism, and on how the will came to be (n. 10). | Read |
| NOTE-546 | Alternate Possibilities and Moral Responsibility | Frankfurt argues that PAP is false because circumstances can make an action unavoidable without bringing it about: Black stands ready to make Jones4 act and never needs to, so Jones4 is as responsible, for blame or praise, as he would be without Black (§IV). A fact that explains nothing about the action cannot excuse it (§V). The replacement principle excuses only an agent who acted “only because he could not have done otherwise”, and Frankfurt says it is compatible with determinism. | Read |
| NOTE-547 | Stories and the Meaning of Life | Fischer’s own sketch of his framework (guidance control, not regulative control, is the freedom-relevant condition; guidance control is ownership plus moderate reasons-responsiveness; responsibility is historical and compatible with determinism; the Frankfurt cases’ moral is the actual sequence), followed by the paper’s thesis: acting freely is artistic self-expression that gives a life narrative value, a product judged mainly morally and prudentially, so the activity’s aesthetic nature does not fix how the life is evaluated. | Read |
| NOTE-548 | Moral Responsibility | A survey of moral responsibility. Its most exact reports, for this record: Fischer and Ravizza’s guidance control as an owned, moderately reasons-responsive mechanism, with page references (§2.3); Wolf’s critique of Real Self views and the requirement that an agent be able to form her values on the basis of the True and the Good (§3.1.1); and the moral competence condition, through JoJo (§3.2). Wolf’s praise/blame asymmetry is noted in one sentence. | Read |
| NOTE-549 | Rarely categorical, highly separable representations along the cortical hierarchy | Within single regions of mouse cortex during the IBL task, neurons’ 8-variable selectivity profiles are more clustered than a covariance- matched Gaussian only in VISp, AUDp and SSp-ul, while pooled modules and the whole cortex cluster along anatomical lines. Over the conditions each region distinguishes (M_IC 5–16), ≥ 95% of random balanced dichotomies are decodable above a shuffle null in 15 of 16 regions (GU 0.82). Clustered neurons provably cap the condition geometry’s participation ratio near min(k, M). | Read |
| NOTE-550 | List & Pettit — Group Agency and Supervenience | Four conditions of agency (§2). A group’s judgments supervene on members’ contributions under a constitution (§3). With a universal domain, robust group rationality is inconsistent with majoritarian, uniform proposition-wise and proposition-wise supervenience (Propositions 1–3), and consistent with set-wise supervenience, as the premise-based and distributed premise-based procedures show (Propositions 4–5; Table 4). The group’s judgment on a conclusion can be fixed by members’ judgments on premises alone. Emergent agency without members’ conception of the group is judged unintelligible (§6). | Read |
| NOTE-551 | The Ripple Effect: Emotional Contagion and its Influence on Group Behavior | Study 1 (94 undergraduates, 29 groups, 2×2 confederate valence × energy): members’ mood followed the confederate’s valence (self-report change +.41 vs −.26, χ²(1) = 9.97; coders 2.75 vs 2.33, χ²(1) = 10.30). Pleasant contagion predicted self- and peer-rated cooperativeness, coder-rated group cooperativeness (r = .44) and lower conflict (r = −.42 to −.48). Valence asymmetry failed (χ² < 1) and energy effects were marginal and opposite in sign. Study 2 (113 MBA students, 26 groups, no confederate): mood ICC rose from .00 to .24; contagion correlated with cooperation (.49) and conflict (−.49). | Read |
| NOTE-552 | Towards a Theory of Collective Emotions | Collective emotion as synchronous convergence in affective responding towards one event or object. The minimal case needs only shared appraisal structures. Mutual awareness (contagion, mediated sharing) and group membership (identity, collective intentions, norms, collective memory, group-based sentiments) amplify it and change its quality, including a transition from “I-mode” to “We-mode” collective emotion. A conceptual synthesis with no data; the authors say the key linkages lack evidence. | Read |
| NOTE-553 | Huebner — Genuinely collective emotions | Collective emotion is defended by extending a homuncular, computational account of individual emotion to distributed systems. Fear needs four integrated capacities (p. 10). The USS Palau crew implements most of them but shows no fear, so it is reclassified as collective danger detection; a 2008 campaign is offered as a likelier case, without data. Unfelt collective emotion is defended by arguing that some individual fear is non-conscious (§5), and functional kinds are defended against homology (§6). Gilbert’s plural-subject account is rejected as reducible to individual commitments. | Read |
| NOTE-554 | List — Three kinds of collective attitudes | Aggregate attitudes: a rule or market summarises members’ attitudes; proposition-wise supervenience; no direct role; rationality contingent (majority beliefs on p, q, p∧q can be inconsistent, Table 1). Common attitudes: all hold, with common awareness; enriched proposition-wise supervenience; coordination; consistent by unanimity. Corporate attitudes: a group agent’s; holistic supervenience, like non-reductive physicalism; action-guiding; rationality presupposed. Three lessons of near-independence; Table 2 summarises. | Read |
| NOTE-555 | Conceptualization of the Holobiont Paradigm as It Pertains to Corals | A mini-review arguing that corals must be studied as holobionts. The holobiont is defined by location (coral plus microbiota in body, mucus and skeleton), and its membership can change. Traits belong to host–symbiont combinations: a novel anemone–alga pairing out-performed both natural ones in oxygen flux at 32–34 °C, and two octocorals lost symbionts by different routes, one per host cell and one with host cells. It asks, without answering, whether the holobiont is the unit of selection. | Read |
| NOTE-556 | Defining Coral Bleaching as a Microbial Dysbiosis within the Coral Holobiont | A review that redefines bleaching as three holobiont dysbiosis stages: microbial buffering, Symbiodiniaceae reorganisation by shuffling or switching, and traumatic dysbiosis ending in death (Figure 3). The supporting material is cited and correlational. Vibrio rose from about 0 to 30% relative abundance in bleached corals and returned in resilient ones, but the authors say cause and consequence cannot be separated. “Dysbiosis” names both the disruption and the healthy adaptive response, and the stages have no operational boundaries. | Read |
| NOTE-557 | Signaling cascades and the importance of moonlight in coral broadcast mass spawning | Two experiments at Heron Island on Acropora millepora. In 2011, colonies under ambient night light (N = 6) spawned with the reef, while colonies lit after sunset (N = 5) or kept dark (N = 5) did not spawn that night. 184 transcripts selected by variance changed around gamete release only in ambient colonies. In 2006, 90 colonies under blue, green or white nocturnal light spawned 6–8 h or two nights late, and under red light on time. The GPCR and melanopsin cascade is a model built from correlated expression. | Read |
| NOTE-558 | Phase Shifts, Herbivory, and the Resilience of Coral Reefs to Climate Change | Four roofless 25 m² cages on Orpheus Island’s reef crest kept large and medium fishes out for 30 months after the 1998 bleaching, against four partial cages and four open plots. Macroalgae averaged 56% cover in cages and 4.1% and 1.7% outside. Coral cover reached 7.7% inside against 19.2% and 20.2%. Recruitment fell to about a third (39 against 108 and 118 per 25 m²) and mortality of established colonies was 24.2% against 9.8% and 11.3%. Reopened, the cages lost their algae in 30 days. | Read |
| NOTE-559 | In Epistemic Networks, Is Less Really More? | Over a wider parameter space than Zollman used, the advantage of sparse networks vanishes when the better option is even slightly better, when groups are larger, or when agents gather more data per round. It survives only where inquiry is hard, and Kummerfeld and Zollman’s effects behave the same way. Transient diversity is the robust lesson. | Read |
| NOTE-560 | Nonreductive Physicalism and the Limits of the Exclusion Principle | With causes as proportional difference-makers, Kim’s exclusion principle fails. A revised principle (a property and its realizer never both cause an effect) is true of some systems and false of others. A higher-level property excludes its realizer as cause exactly when the effect is realization-insensitive, surviving nearby changes of realizer. That is plausibly the norm in the special sciences, which makes higher-level causes autonomous. | Read |
| NOTE-561 | Double-Loop Learning, Teaching, and Research | Defines single- and double-loop learning and restates the theory of action. People espouse many theories but act on one, Model I, which keeps reasoning tacit and makes errors in governing values undiscussable. That produces self-sealing individual and organizational defensive routines. A CEO workshop transcript shows the pattern, and a quasi-experimental design to test it is proposed but not run. | Read |
| NOTE-562 | Cancer across the tree of life: cooperation and cheating in multicellularity | A review framing cancer as cheating on five foundations of multicellular cooperation and surveying cancer-like phenomena across the independent origins of complex multicellularity. Division-of-labour cheating appears in every form, resource and environment cheating only in animals and plants so far. Complex multicellularity is read as a cheater detection and suppression system, with proliferative units as a possible intermediate level of selection. | Read |
| NOTE-563 | Beyond Markets and States: Polycentric Governance of Complex Economic Systems | Ostrom’s retrospective. Polycentric arrangements, many formally independent decision centres, can outperform single hierarchies. Long-surviving common-pool resource institutions share eight design principles, not specific rules. In experiments communication and self-chosen sanctions sustain cooperation, and in the field local monitoring predicts outcomes. No single regime type is a panacea. | Read |
| NOTE-564 | The Epistemic Benefit of Transient Diversity | A bandit model with beta priors. Sparse networks beat dense ones, as in 2007, but extreme priors reverse the order, and sparse networks of dogmatic agents often never converge. Limited information and dogmatism each sustain diversity, and together sustain it too long. What communities need is diversity that is transient. | Read |
| NOTE-565 | Responsibility, Moral and Otherwise | A lecture arguing that deep responsibility extends beyond the moral, to prudential and aesthetic traits and to art, and that the self-disclosure view explains this. Watson’s two-level view, attributability with accountability stacked on top, is rejected: the two are independent, and accountability may need nothing metaphysically robust. What makes a self a fit target of reactive attitudes is offered as a hunch: an intelligent self that perceives, understands and appreciates the world as we do. | Read |
| NOTE-566 | ”Exit, Voice, and Loyalty”: Further Reflections and a Survey of Recent Contributions | Hirschman revisits Exit, Voice, and Loyalty. Voice deserves more weight than he gave it: it can be felt as a benefit, it carries richer information than exit, and it suits goods whose quality nobody fully knows. Exit can be costly without loyalty and can convey nothing. An organization needs floor levels of both for feedback and cannot survive beyond ceilings; managers may favour the response least threatening to them. | Read |
| NOTE-567 | Network Epistemology: Communication in Epistemic Communities | A survey. The best communication structure depends on the epistemic problem: transmission of costly information favours minimal or star networks, pooling of estimates favours regular ones (denser is faster), and learning by trying favours sparse ones. Intuitions that a group communicates too little or is too centralised are often wrong. | Read |
| NOTE-568 | The Corporation as a Moral Person | A moral person is a non-eliminable subject of accountability, and that requires intentional agency. A corporation’s Internal Decision (CID) Structure, an organizational chart plus recognition rules embedded in corporate policy, licenses redescribing members’ acts as corporate acts done for corporate reasons. Corporations therefore differ in kind from mobs and can be full moral persons. That intentional agency suffices for moral personhood is asserted here and argued elsewhere. | Read |
| NOTE-569 | The Conversable, Responsible Corporation | A syllogism. Corporations are conversable agents: through authorised spokespersons they avow attitudes and make commitments, and because mechanical aggregation can be inconsistent they must form minds of their own. Conversable agents are fit to be held responsible, having a significant choice, the capacity for normative judgment, and control over acting on it. So corporations are fit to be held responsible. | Read |
| NOTE-570 | Shaping the Institutional Mind | Asks why ascribing mental states to institutions is useful. Both defenders and critics of group minds assume ascription tracks pre-existing causes. On the regulative view of folk psychology, ascription shapes its target. Two cases: the collective knowledge doctrine, after which banks built systems to detect reportable deposits, and corporate narratives and counter-narratives. The paper is agnostic about whether institutions have minds. | Read |
| NOTE-571 | Catastrophic regime shifts in ecosystems: linking theory to observation | A review of how to tell whether an ecosystem has alternative stable states. Field patterns (jumps, multimodality, dual relationships) are suggestive and never conclusive, since a stepwise driver or a simple threshold produces them too. Experiments can come close to proof: initial-state dependence, lasting shifts after temporary disturbance, and hysteresis. Models show positive feedback must be strong enough. | Read |
| NOTE-572 | Resilience and Stability of Ecological Systems | Ecological theory had equated stability with behaviour near equilibrium. Holling separates stability (return to equilibrium) from resilience (the capacity to absorb change and persist, set by the domain of attraction), shows they can trade off in lakes, forests, insects and fish, and warns that managing for constant yield can erode resilience. | Read |
| NOTE-573 | Tiktok’s enshittification | Names enshittification: platforms are good to users, then abuse them for business customers, then abuse both to claw back value, and die. The cause is the ease of reallocating value in a two-sided market; lock-in makes each stage possible, blocked interoperability and monopoly prolong it, and users’ breaking point limits it. Argued from Amazon, Facebook, Twitter and TikTok; the remedy is end-to-end and freedom of exit. | Read |
| NOTE-574 | Experimentation by Industrial Selection | Uses the antiarrhythmic drug disaster and a modified Zollman bandit model to show that industry can bias a scientific community of honest Bayesian agents by funding those whose methods already favour its product, given methodological diversity, merit-based influence and turnover. A merit-based independent funder makes this worse; one that discounts industry-funded work counteracts it. Integrity safeguards do not touch the mechanism. | Read |
| NOTE-575 | Précis of Responsibility and Control: A Theory of Moral Responsibility | The authors’ own summary of Responsibility and Control. Moral responsibility requires guidance control, the agent’s ownership of the mechanism that actually issues in action plus that mechanism’s moderate reasons-responsiveness. Ownership comes from taking responsibility, a historical matter of dispositional self-beliefs acquired in appropriate ways. The result is compatible with causal determinism. | Read |
| NOTE-576 | The Method of Characteristics Revisited: A Viability Approach | Viability is a property of a constraint set under a dynamics: K is viable if from every state some evolution stays in K, invariant if all do. Nagumo’s theorem reduces viability to a tangency condition. When K is not viable, the viability kernel is the largest viable part of it, and everything else in K leaves in finite time. Stability in the Lyapunov sense is not discussed. | Read |
| NOTE-577 | The Viable System Model: Its Provenance, Development, Methodology and Pathology | Beer’s retrospective on the Viable System Model. Five subsystems are necessary and sufficient for any organism or organization to keep its identity independently, and the structure recurs at every level. The model is defended as a scientific model built by homomorphic mapping, testable but never proved. Pathologies are traced to failing subsystems, chiefly the collapse of Three and Five when Four is missing. Evidence is the author’s recollected consultancy. | Read |
| NOTE-578 | History As Cause: Columbia and Challenger | The Board finds that Columbia and Challenger had the same organizational cause. Evidence that foam shedding and O-ring erosion departed from the design was repeatedly reinterpreted as acceptable, each decision seeming correct in itself. Political and budget constraints, schedule pressure, consensus sign-off, a hierarchy that silenced dissent, and a safety organization dependent on the program sustained the pattern for twenty years and undid post-Challenger reforms. | Read |
| NOTE-579 | Responsiveness and Moral Responsibility | Fischer’s first statement of reasons-responsiveness. Frankfurt-type cases show an agent can be responsible though he could not have done otherwise, so what must respond to reasons is the mechanism that actually issues in the action, not the agent. Weak responsiveness suffices: the actual kind of mechanism would do otherwise in some world with sufficient reason to. The result is semicompatibilism. | Read |
| NOTE-580 | The Social Dimensions of Scientific Knowledge | Longino’s own statement of critical contextual empiricism. Because evidence bears on hypotheses only through unevidenced background assumptions, objectivity comes from critical interaction in a community, but only interaction that meets four norms: venues, uptake, public standards and tempered equality of intellectual authority. The entry also surveys rival models, including Zollman’s networks and the robustness critique of them. | Read |
| NOTE-581 | Exploration and Exploitation in Organizational Learning | Exploitation’s returns are surer, nearer and closer to the decision than exploration’s, so adaptive processes favour it and become self-destructive. In a simulation of mutual learning, an organizational code improves only from members who deviate from it. Slow socialization, a mix of fast and slow learners, and moderate turnover raise what the organization knows; under environmental change without turnover, its knowledge decays to chance. Where only first place counts, variance beats reliability. | Read |
| NOTE-582 | Episteme Symposium on Group Agency: Replies to Gaus, Cariani, Sylvan, and Briggs | The authors answer four commentators on Group Agency. To Gaus: rationality is classical, ecological rationality is its relativisation to an environment, and robust group rationality may be relaxed without rescuing proposition-wise aggregation. To Cariani: chapter 4 offers possibility results. To Sylvan: group attitudes are not reducible to role-based member acceptance. To Briggs: group agents are fit to be held responsible in their own right, with rights restricted by normative individualism. | Read |
| NOTE-583 | The Communication Structure of Epistemic Communities | Simulations of Bala and Goyal’s bandit model on small networks. Cycles learn the better action more reliably than wheels or complete graphs, and more slowly. Over every network of up to six agents, density and clustering predict failure, and centrality does not. The cause is that dense networks spread an early unlucky run to everyone before diversity can correct it. | Read |
| NOTE-584 | Risk management in a dynamic society: a modelling problem | Risk management is a control problem across a sociotechnical hierarchy. Under cost and effort gradients, activity migrates toward the boundary of acceptable performance, and redundant defences erode unobserved because breaching one shows no effect. Accidents come from the interaction of many locally reasonable decisions. The remedy is making boundaries visible, not suppressing errors. | Read |
| NOTE-585 | Causation and Manipulability | A survey of manipulability theories that states Woodward’s own. X causes Y iff some intervention on X with respect to Y would change Y, where an intervention is a surgical, exogenous cause of X meeting conditions M1–M4. The account is non-reductive but not viciously circular, needs no human agent, and defines total, direct and contributing causes by combinations of interventions. Invariance and higher-level causation are not discussed. | Read |
| NOTE-586 | The Major Transitions in Evolution—A Philosophy-of-Science Perspective | A philosopher’s overview of the major evolutionary transitions. It defines a transition as the evolution of a higher-level unit from formerly free-living ones, doubts that transitions are inevitable or that one theory explains them at the right grain, treats genic and hierarchical approaches as compatible, and argues that the transitions make the hierarchy an explanandum and the highest occupied level the privileged level of organisms. | Read |
| NOTE-587 | Pervasive negative effects of rewards on intrinsic motivation: The myth continues | The authors of the 1994 rival meta-analysis re-analyse 145 studies. They accept several of Deci, Koestner and Ryan’s corrections, and code reward contingencies by what participants were told rather than by cognitive evaluation theory’s categories. Result: no overall effect on free choice; enhancement on low-interest tasks; on high-interest tasks, undermining only for expected tangible rewards loosely tied to performance, or earned at less than the maximum; neutral or positive effects for rewards tied to a standard or to beating others. All of it is small. | Read |
| NOTE-588 | Fritz — A synthetic approach to Markov kernels | Markov categories (symmetric monoidal, a commutative copy/discard comonoid on every object, discard natural) carry enough structure to define determinism, conditionals, four kinds of conditional independence with the semigraphoid rules, almost-sure equality, sufficiency, completeness and ancillarity. Basu’s theorem then holds in every Markov category; Fisher–Neyman (Theorem 14.5) and Bahadur (Theorem 16.3) need strict positivity, which existence of conditionals implies but which Stoch has without them. The abstract Fisher–Neyman is checked against the classical one only in FinStoch. | Read |
| NOTE-589 | Conditional Simulation Using Diffusion Schrödinger Bridges | Posterior sampling p(x|y) when only joint samples (X, Y) can be drawn, recast as a Schrödinger bridge on the extended space between the joint p(x, y) and a reference p_ref(x|y)p(y) in which y is held fixed (Proposition 1), and solved by iterative proportional fitting with learned forward and backward drifts (CDSB). Its first iteration is the ordinary conditional score-based model, so the rest refine it; the reference can be an informed guess (upsampled image, EnKF, SRFlow) rather than noise. Better than the conditional score model at equal, small numbers of steps on most but not all image metrics, and it filters Lorenz-63 with 20 steps where the score model diverges. | Read |
| NOTE-590 | The stance triangle | Stance is one act with three aspects: in taking a stance a speaker evaluates an object, thereby positions a subject (usually the self), and thereby aligns with other subjects. The triangle’s nodes are two subjects and a shared object; its sides are directed vectors of evaluation (two) and alignment, with positioning reflected back on each subject. Stance belongs to utterances in dialogic context, not to sentences, and needs an object even when none is spoken. A stance follow that resonates with a stance lead must mark the relation (too, either). Argued from Santa Barbara Corpus excerpts; no counts are reported. | Read |
| NOTE-591 | A Mathematical Theory of Communication | Shannon defines a discrete source as an ergodic Markov process and its information rate as H = −Σ p log p per symbol, proves that typical long sequences number about 2^{HN} (Theorems 3–4) and that a source can be sent over a noiseless channel at C/H − ε symbols per second and no faster (Theorem 9). For a noisy channel he defines R = H(x) − H_y(x) and C = max R, and proves by averaging over random codes that any rate below C can be sent with arbitrarily small error frequency, while above C the equivocation is at least H − C (Theorem 11). The continuous parts add the sampling representation, C = W log(1 + P/N) for white noise, and a minimum rate for a source at a given fidelity. | Read |
| NOTE-592 | T2I-CompBench | 6,000 compositional prompts (attribute binding by colour, shape and texture; spatial and non-spatial relations; complex), each sub-category split 700/300, with a metric per category: question-per-object BLIP-VQA for binding (Kendall τ 0.63 with humans on colour against 0.19 for CLIPScore), a UniDet box rule for space, and a 3-in-1 average for complex prompts. Spatial relations are hardest. GORS, reward-weighted LoRA finetuning of SD v2 on its own selected samples, is rated best by humans in every sub-category, but its binding score falls sharply on pairs unseen in finetuning. | Read |
| NOTE-593 | GenEval | An automated text-to-image benchmark of 553 templated prompts in six tasks, scored per image as correct or not by a COCO-trained Mask2Former (presence, count, position) and masked-crop zero-shot CLIP (colour). 83% agreement with human annotators against 88% between annotators, and 91% on unanimous images; beats a per-task tuned CLIPScore on counting, position and binding. Best 2023 open model (IF-XL) scores 0.61 overall, at most 0.15 on position and 0.35 on attribute binding. | Read |
| NOTE-594 | Cours de linguistique générale | Linguistics takes as its object langue, the social system of signs, not parole or langage. The sign unites a concept (signified) and an acoustic image (signifier) arbitrarily; the signifier is linear. Arbitrariness makes the sign immune to deliberate change and exposed to blind change. Synchrony and diachrony are irreducible. A term’s value is set only by its oppositions to coexisting terms: “dans la langue il n’y a que des différences sans termes positifs”, though the sign as a whole is positive. Terms relate syntagmatically and associatively, and relative motivation limits arbitrariness. | Read |
| NOTE-595 | Equivalent Comparisons of Experiments | Gives a new minimax proof of the Sherman–Stein theorem (for finite outcome spaces, an experiment at least as informative as another in every decision problem can reproduce it by a Markov matrix) and, by a martingale argument, removes the finiteness restriction, so for a finite parameter set “more informative” and “sufficient for” coincide in general. Adds k-decision problems, with three equivalent forms, and shows that for dichotomies two-action problems, and so the type I/type II error trade-off, already decide the order. | Read |
| NOTE-597 | Compositional Visual Generation with Composable Diffusion Models | Treats a conditional diffusion model’s noise prediction as the gradient of an energy, so concepts compose at sampling time by adding scores: AND is ε(x,t) + Σ wᵢ(ε(x,t|cᵢ) − ε(x,t)), the product p(x)Πp(x|cᵢ)/p(x) under conditional independence of the concepts given x; NOT divides by the negated concept’s likelihood. No retraining. On CLEVR object positions it beats an EBM baseline (31.36% against 7.34% at three components); on relations it does not (2.80% against 4.26%); on FFHQ attributes it trails LACE in accuracy at three components but has the best FID. Text composition with GLIDE and Stable Diffusion is qualitative only. | Read |
| NOTE-598 | Baez & Fong — A Noether theorem for Markov processes | For a Markov semigroup exp(tH) on a finite set, an observable O commutes with H iff the expectations of O and O² are both constant for every initial distribution, iff the expectations of every polynomial in O are, iff O is constant on each connected component of H’s transition graph. Constancy of the mean alone is not enough; a 3-state example shows it. On a σ-finite measure space, [O, exp(tH)] = 0 for all t iff the means of O and O² are constant, by way of a one-step Markov-chain version proved with Chebyshev’s inequality. | Read |
| NOTE-599 | Language Evolution by Iterated Learning With Bayesian Agents | Iterated learning is a Markov chain on hypotheses. If every learner shares a prior and samples from its posterior, the chain is a Gibbs sampler on P(d|h)P(h), so the probability a learner holds language h converges to the prior P(h), whatever the amount of data passed on. If learners take the MAP hypothesis, it is stochastic EM with no observations: the outcome centres on the prior’s mode, depends on data amount and noise, and in a two-language case is the same for every prior strength below a threshold. An unbounded population with equal fitness has the same equilibrium. | Read |
| NOTE-600 | Contextuality-by-Default theory | A system is a set of stochastically unrelated bunches (one per context) linked by connections (one per content). It is noncontextual if some coupling of the bunches makes every connection a maximal coupling, which separates context-dependent marginals (“direct influences”) from contextuality. The test is linear-programming feasibility (Theorem 4.1). Signed quasi-couplings always exist (Theorem 6.1), and the minimal total variation minus 1 measures the degree of contextuality. | Read |
| NOTE-602 | Performative updates | Makes the performative/constative distinction a difference between two operations on a context set: informative update eliminates indices, performative update changes them minimally so that a proposition holds. Declarations are purely performative; an assertion is a performative truth guarantee by the speaker plus a negotiable informative update; the same declarative sentence can be either. Argued from linguistic evidence, not tested. | Read |
| NOTE-603 | Classifier-Free Diffusion Guidance | Shows that guidance in diffusion models needs no classifier: one network trained with randomly dropped conditioning supplies conditional and unconditional scores, and the extrapolation (1 + w)ε(z, c) − wε(z) trades FID for Inception score on ImageNet as classifier guidance does. The paper’s own argument shows the guided field is in general not the score of any density, so the Bayes-tilted target that motivates it is not what is shown to be sampled. | Read |
| NOTE-604 | Wang, Solloway, Shiffrin & Busemeyer, the QQ equality in 72 surveys | Across all 66 Pew surveys of 2001–2011 that varied the order of two questions, chosen without regard to their outcome, question order changes the answers (p = 0.0004 for the order-effect χ² distribution) while the probability of answering the two questions alike does not change (p = 0.4625 for the q values), as the QQ equality predicts. Paired context effects across 72 studies lie along the predicted line of slope −1 (r = −0.82). | Read |
| NOTE-605 | Rate-Distortion-Perception Theory for Semantic Communication | Formulates semantic communication as indirect source coding of a hidden source S, observed by the encoder only through X, with decoder side information, common randomness, an expected-distortion constraint on S and a total-variation constraint on the law of the reconstruction. States a rate region (proof sketched) and a binary closed form, showing that perfect recovery of X does not recover S and that side information alone can meet loose constraints at zero rate. | Read |
| NOTE-606 | Pragmatic language interpretation as probabilistic inference | States the rational speech act framework (a listener inverting a softmax speaker whose utility is the log-probability a literal listener assigns to the intended world) and its uncertain extension (a joint posterior over the world and the speaker’s topic, knowledge or lexicon), and reviews evidence that these predict reference-game judgements, cost and knowledge effects, scalar and embedded implicature, hyperbole, irony, metaphor and vague adjectives. | Read |
| NOTE-607 | Rethinking the Role of Demonstrations | Shows empirically that the correctness of in-context labels contributes little to classification and multi-choice accuracy, while the input distribution, the label space and the paired format contribute most of the gain over zero-shot. The authors read this as the demonstrations locating a correspondence the model already has, not teaching a new one. | Read |
| NOTE-608 | The Semantics of Definite and Indefinite Noun Phrases | Argues that indefinites (and definites) are variables without quantificational force, bound by the nearest operator, which yields donkey-sentence readings; then recasts semantics as file change: each sentence updates a structured common ground of numbered cards, truth of a file supplies existential force, and the definite/indefinite contrast reduces to one felicity condition (new card versus familiar card), from which binding, presupposition projection and, with accommodation, narrow-scope definites follow. | Read |
| NOTE-609 | Computational challenges to Lévi-Strauss transformational methodology | Proposes DEVS modelling and simulation, in the authors’ DEVSimPy, as a way to generate and visualise Lévi-Strauss’s transformations of myth, and extends the canonical formula’s “boundary condition” to a programme on identity politics. What it shows is software: myths as mytheme lists, variants produced by user-specified operations, and one Corsican folktale’s mythemes placed on Google Earth. No claim about myth is tested. | Read |
| NOTE-610 | T2I-CompBench++ | Extends T2I-CompBench to eight sub-categories (adding numeracy and 3D spatial relations), tests multimodal LLMs as judges, and benchmarks eleven models. GPT-4V agrees with human rankings best on interactions and complex prompts, where CLIPScore and the conference version’s 3-in-1 metric were weak; specialised VQA and detector metrics stay best elsewhere. Human ratings cover only six 2023-era models, and the interaction category remains near ceiling for humans. | Read |
| NOTE-611 | Referential intentions in word learning | A Bayesian learner that infers speakers’ intended referents and the lexicon jointly, allowing words to be used non-referentially and intentions to be empty, learns a much more precise lexicon from annotated child-directed video than association or translation models and reproduces mutual exclusivity, word-driven object individuation and intention-guided mapping as consequences of its likelihood. | Read |
| NOTE-612 | The Topology of Causality | Builds the sheaf-theoretic framework for causality over spaces of input histories: causal functions are free assignments of outputs to tip events, causality is continuity in the lowerset topology, and the presheaf of causal functions is a sheaf exactly when the space has no “solipsistic contextuality” (always when tight). Empirical models are compatible families on any open cover; standard empirical models on causal switch spaces, including total orders, are always local. | Read |
| NOTE-613 | That’s what she (could have) said | Recursive Bayesian speaker–listener reasoning yields specificity implicatures but cannot derive Horn’s principle from utterance costs alone; letting the agents be uncertain about the lexicon breaks the symmetry, so costlier signals go to less likely meanings in one-shot games without equilibrium refinements, and two online games with novel symbols show people drawing both implicatures without prior conventions. | Read |
| NOTE-614 | On Linguistic Aspects of Translation | Names the three kinds of translation (intralingual, interlingual, intersemiotic) and argues that interlingual translation renders whole messages, since code-units rarely have full equivalents; that every cognitive content can be conveyed in any language; and that languages differ in what their grammar obliges a speaker to say, so translation adds and drops information and a chain of translations can erode a message. Poetry, where grammar and sound carry meaning, allows only creative transposition. | Read |
| NOTE-615 v2 | Морфология сказки | Finds that in a hundred Russian wondertales the stable units are characters’ functions, defined by their consequence for the action: 31 of them, in one order, over seven spheres of action, so every wondertale is a selection from one sequence and the variety lies in omissions, realisations and the casting of characters. Plot and variant cannot be separated, tales can be generated from the scheme, and the wondertale is conjectured to be morphologically a myth. | Read |
| NOTE-616 | Iterated learning (Kalish, Griffiths & Lewandowsky) | Puts Bayesian iterated learning to a laboratory test with a bias known beforehand: human function-learning chains converged on a positive linear function in 28 of 32 families, from positive linear, negative linear, U-shaped and random starting functions, as convergence to a prior favouring positive linear functions predicts. The prior was taken from earlier studies, three families settled on the negative linear function, and the authors do not claim the chains reached stationarity. | Read |
| NOTE-617 | Defaults in Update Semantics | Sets out update semantics (meaning as change of information state), proves a dynamic system reduces to static propositions exactly when updates are total, idempotent, persistent, monotone and strengthening, and shows epistemic “might” and “presumably” are tests that fail persistence. Gives a decidable non-monotonic logic of default rules in which specificity and other priorities follow from coherence and applicability conditions, with predictions that differ from Reiter’s, Delgrande’s, Asher and Morreau’s and inheritance-net theories. | Read |
| NOTE-619 | Semantic Communication: A Survey of Its Theoretical Development | Surveys semantic information theory around three Shannon analogues: semantic entropy (no agreed definition; logical-probability, task, knowledge and context variants), semantic rate–distortion (meaning as a latent state S behind the observation X, with dual distortions), and semantic channel capacity (definitions under which it can exceed Shannon capacity). It adds the information bottleneck, age of information, joint source–channel coding and LLMs as tools, and lists open problems. It catalogues rather than reconciles. | Read |
| NOTE-620 | Learning to (Learn at Test Time) | Recasts a sequence-modelling layer as a learner trained on the sequence it reads: hidden state as inner-model weights, update as a gradient step on a learned self-supervised loss. Proves that the linear, batch-GD case is linear attention and that a Nadaraya–Watson inner learner is softmax attention; shows TTT-Linear and TTT-MLP use long context better than Mamba at up to 1.3B parameters. | Read |
| NOTE-621 | Transformers learn in-context by gradient descent | Constructs weights for which one linear self-attention layer reproduces, on every token, the data change induced by one gradient step of a linear model on the in-context regression loss, so the query’s output equals the post-update prediction; shows a trained single layer finds these weights up to scale, and that deeper trained models implement a curvature-corrected variant (GD++) rather than gradient descent. | Read |
| NOTE-623 | Probabilistic Foundations of Contextuality | In Kolmogorovian probability, joint distributedness is transitive, so treating a measurement as the same random variable in overlapping contexts already forces an overall joint distribution. A Kochen–Specker or Bell contradiction therefore refutes that identification, not the joint distribution. Contextuality is restated as the impossibility of a coupling of context-indexed variables whose same-content copies satisfy a property C. For inconsistently connected binary systems, C is multimaximality, characterized by adjacent pairs (Theorem II.3). | Read |
| NOTE-625 | Backprop as Functor | Learners (P, I, U, r), with a request function r : P × A × B → A, compose and form a symmetric monoidal category Learn. For step size ε and an error e with ∂e/∂x(x₀, −) invertible, sending a differentiable parametrised function to (P, I, p − ε∇ₚE, f_a(∇ₐE)) is a faithful strong symmetric monoidal functor Para → Learn: gradient descent on a composite is the composite of local updates exchanging requests, which is backpropagation, and the proof is the chain rule. | Read |
| NOTE-626 | Fantastically Ordered Prompts | Shows that permuting a fixed set of few-shot examples swings GPT-family accuracy from near chance to near state of the art, at every model size tested, with good orders uncorrelated across sizes and the variance surviving more examples and calibration; proposes ranking orders by the label entropy they induce on a probing set the model generates itself. | Read |
| NOTE-627 | Informative communication in word production and word learning | Writes the informative speaker down: utility is −D_KL(intended meaning ‖ literal word meaning), so a speaker referring to one object picks a true word with probability ∝ |extension|^(−α), the size principle from communicative premises. Learners who know the referent and invert this speaker bet on novel-word meanings as predicted (r = .93); speakers’ free descriptions follow informativeness only weakly (r = .19), and colour terms not at all. | Read |
| NOTE-628 v2 | Larger communities create more systematic languages | Varies community size alone in a laboratory language-creation game: groups of eight built more systematic, compositional languages than groups of four, faster and more uniformly across groups, while reaching the same communicative success and convergence. Input variability, greater in larger groups, predicted gains in structure; small groups differed more from each other on every measure. | Read |
| NOTE-629 | Sheaf-theoretic structure of definite causality | Extends the Abramsky–Brandenburger sheaf framework from non-locality (discrete order) to any finite causal order of events. Sections are causal functions over families of inputs on lower sets. Empirical models are causal conditional distributions forming a polytope. Locality is a global section, equivalently a mixture of deterministic causal functions. The authors withdrew the paper in 2024 because its “locale of inputs” is not fit for purpose. This reading finds that Proposition 5’s meet can leave the poset and that distributivity fails. | Read |
| NOTE-630 | Getting to the Bottom of Noether’s Theorem | Noether’s theorem in Hamiltonian form, “a generates symmetries of b iff b generates symmetries of a”, follows in Poisson algebras, complex *-algebras and Banach–Lie algebras from the antisymmetry of the bracket plus uniqueness of solutions; for a bilinear bracket antisymmetry is self-conservation, {a, a} = 0. What carries content is the map from observables (a Jordan algebra) to generators (a Lie algebra): i in complex quantum mechanics, none in the real or quaternionic case, and Alfsen–Shultz’s dynamical correspondence for JB-algebras. | Read |
| NOTE-631 | Efficient compression in color naming | Casts a colour lexicon as an information-bottleneck encoder from perceptual meanings to words and shows the World Color Survey languages and English lie near the IB bound at β ≈ 1.03, beating hue-rotated variants of themselves in 93% of cases and fitting full naming distributions much better than a deterministic efficiency model; IB optima are soft, and the path of optima through β has phase transitions that roughly follow Berlin and Kay’s sequence. | Read |
| NOTE-632 | Discrete-event simulation of Lévi-Strauss’s myth analysis | Specifies the DEVS models behind the authors’ Lévi-Strauss simulation. A myth is a list of (term, function) mythemes; homology, inversion, opposition and symmetry are each the replacement of one term by a user-supplied other in every mytheme; mythemes can be added or removed; the canonical formula is described but not given a computation. Reproducing 70 Mythologiques myths and 28 Corsican tales by transformations chosen to produce them is offered as validation of Lévi-Strauss’s method; it shows only that the encoding can express them. | Read |
| NOTE-633 | Implicit Bayesian inference account of in-context learning | Proves that if pretraining text is a mixture of HMMs and a model fits it exactly, conditioning on a prompt of concatenated examples recovers the prompt’s latent concept by posterior concentration, and the in-context predictor is asymptotically Bayes-optimal, whenever each example’s KL signal about the concept beats the error from the improbable transitions between examples. The account is of the data distribution, not of any network’s computation. | Read |
| NOTE-634 | Predicting pragmatic reasoning in language games | A listener who inverts, by Bayes’ rule, a speaker choosing words by informativeness to a literal listener, combined with an empirically measured salience prior, predicts mean listener bets in simple three-object reference games at r = .99 with no fitted parameters, and the speaker model predicts speaker bets at r = .98. | Read |
| NOTE-635 | The Combinatorics of Causality | Replaces causal orders by spaces of input histories (join-prime sets of partial input assignments), which can express causal constraints that depend on inputs. Defines free choice, tip events, causal completeness and tightness, three kinds of composition, and a lattice of spaces; proves that the maximal causally complete spaces are exactly the causal switch spaces; and finds 2644 complete spaces on 3 binary-input events, against 19 from definite orders. | Read |
| NOTE-636 | Wang & Busemeyer, the QQ model and QQ equality | Derives the QQ equality from a Lüders-projection model of answering attitude questions: the probability of answering two questions differently is the same in both orders, for any belief state, any projectors and any dimension, provided only the first answer changes the state before the second. It holds in five of six data sets and fails, as the authors predicted, in the sixth, where new information came between the questions. The argument that classical models fail it is informal. | Read |
| NOTE-637 | Test-Time Training for Few-Shot Learning | Shows that turning a task’s few-shot demonstrations into a temporary weight update (per-task LoRA on leave-one-out in-context tasks) improves an 8B model over conditioning on the same demonstrations: 50.5% → 57.8% on BIG-Bench Hard, and large gains on ARC. The update works best when it is trained in the in-context format, and gains concentrate on tasks with structural rules or distribution shift. | Read |
| NOTE-638 | Semantic Rate-Distortion Theory with Applications | Defines semantic distortion between the posterior of a latent meaning given the original and given the reconstructed observation, and proves that the resulting information rate–distortion function, with a second symbolic constraint, is the operational limit under lower semicontinuity; solves the binary symmetric case. Its sequence distortion is defined as an expected maximum but the proofs use maxima of expectations; with KL divergence the function is the information bottleneck, which the paper does not note. | Read |
| NOTE-639 | Attend-and-Excite | Identifies catastrophic neglect in Stable Diffusion, where a named subject never appears because no image patch attends to its token, and corrects it at inference by gradient steps on the latent that raise the smoothed peak attention of the most neglected subject token during the early steps. Measured gains are in CLIP and caption similarity and human preference on two-subject prompts; attribute binding improves only in the figures, and relations are not addressed. | Read |
| NOTE-640 | Contextuality in canonical systems | Contextuality is to be judged on a canonical representation in which every variable is replaced by binary splits and connections are coupled multimaximally. For two content-sharing k-valued variables with all splits kept, the canonical system is noncontextual if and only if one nominally dominates the other: its probabilities fall below the other’s for at most one value (Theorem 4.6). Only the 1- and 2-splits matter (Theorems 4.1, 4.3). For continuous densities, all splits make any difference in distribution contextual. | Read |
| NOTE-641 | Transformation transformed | Separates structuralism’s method from Lévi-Strauss’s doctrine and makes transformation its core: a structure is the set of invariant relations that orders passage between variants. Lévi-Strauss transformed in two regimes, Goethean development of an initial form (kinship) and Thompsonian deformation between given forms (myth, where the analyst cuts the continuum); Descola’s four ontologies are a Goethean group, and structural comparison the fairest symmetrization anthropology has. | Read |
| NOTE-643 | Contextuality-by-Default 2.0 | Replaces CbD 1.0’s maximal coupling of each connection by a multimaximal one (every subset maximally coupled). For binary variables this coupling exists, is unique and has an explicit staircase form (Theorem 1), so a noncontextual system’s subsystems are noncontextual (Theorem 3) and partial and complete (non)contextuality coincide. Cyclic, consistently connected and two-copy systems are judged as before. For non-binary variables multimaximal couplings can fail to exist, can be non-unique, and are not stable under coarse-graining (Examples 1–3). | Read |
| NOTE-644 | Semantic Unification | Puts basic DRT into sheaf form: a DRS is a section of a presheaf of consistent literals, an anaphoric resolution is a cover by variable maps, and the discourse’s meaning is the gluing, unique if it exists (Proposition 1). All the interpretive work is in choosing the cover; the only obstruction to gluing shown is inconsistency, so the paper models context dependence and ambiguity, not contextuality in the Abramsky–Brandenburger sense. Its probabilistic section ranks covers by summed corpus counts, not by gluing distributions. | Read |
| NOTE-645 v2 | On the Quantum-like Contextuality of Ambiguous Phrases | Models meaning selection in two-word ambiguous phrases as a Bell-type measurement scenario. Hand-set supports give one possibilistically contextual (Hardy-type) model; every corpus-estimated model is signalling, so only Contextuality-by-Default applies, under which two noun–verb pairs read in both grammatical orders are contextual (1/30 and 7/30). The paper’s own bootstrap leaves both plausibly noncontextual (probabilities above .56 and .08), on very small counts. | Read |
| NOTE-646 | Combining contextuality and causality | Extends sheaf-theoretic contextuality to causal scenarios by an enabling relation on measurements and a game reading: Nature’s deterministic strategies, which may depend on causal history, replace the event sheaf, and the Abramsky–Brandenburger definitions then go through. Recovers flat contextuality and causal Bell scenarios, and expresses adaptive MBQC by Experimenter strategies. The strategy presheaf is not a sheaf: compatible deterministic local strategies can have no gluing or several. | Read |
| NOTE-647 | A comonadic view of simulation and quantum resources | Makes simulation between empirical models adaptive: measurement protocols form a comonoidal comonad MP, and a simulation of e by d is a deterministic map MP(d ⊗ c) → e with c non-contextual. Proves that such simulations are exactly the conversions by terms in the free operations of the resource theory of contextuality, which now include conditional measurement, with an equational theory and normal forms; the non-contextual fraction is monotone and contextual models cannot be cloned. | Read |
| NOTE-648 | Quantum-Like Contextuality in Large Language Models | Builds a three-sentence anaphora schema with the support of the PR prism, instantiates it 51,966,480 times from Simple English Wikipedia, and takes one referent probability per sentence from BERT: 0.148% of the models pass a signalling-corrected sheaf test and 71.1% the CbD test. Because the schema fixes the support, both verdicts depend only on how uncertain BERT is in the three sentences; the tie to embedding distance is a softmax identity with weak correlations. | Read |
| NOTE-649 | Large AI models are cultural and social technologies | Argues that large models are a cultural and social technology, not intelligent agents: lossy, uninvertible summaries of human-produced corpora that, like prices and bureaucratic categories, allow the information to be reorganized at scale. The argument is by analogy and classification; no evidence is offered that could have come out otherwise. It names one mechanism (fitting the training distribution on average makes models worst where data are rare, which may homogenize culture) and leaves both it and its remedy untested. | Read |
| NOTE-650 | Closing Bell | Answers which maps between the empirical models of two scenarios are induced by classical, non-adaptive procedures: exactly those given by a non-contextual model of a hom scenario [S, T] whose outcomes are procedures, so deciding it is a linear program. A family of compatible local procedures glues into one global procedure exactly when that model is non-contextual; the rest are “contextual simulations”. The hom construction makes scenarios with predicates a closed category. | Read |
| NOTE-651 | Categories of Empirical Models | Gives empirical models on different measurement scenarios a category: a simulation answers each target measurement with a jointly measurable set of source measurements and a stochastic outcome map natural in the context. Non-contextuality becomes simulability from nothing, the non-contextual fraction becomes a functor (contextuality cannot grow along a simulation), strong contextuality is reflected, Graham reductions are simulations, and contextual models cannot be cloned. | Read |
| NOTE-652 | Relative representations enable zero-shot latent space communication | Represents each sample by its cosine similarities to a fixed set of anchor samples. That vector is invariant by construction to every cosine-preserving map of the latent space (rotations, reflections, global and even per-sample positive rescaling), not to translations or general linear maps. With anchors matched across encoders it lets a decoder trained on one encoder run untrained on another, across seeds, architectures, latent sizes and languages: far better than raw latents, but with large and uneven losses. The assumption that such spaces differ by an angle-preserving map is never tested directly, and the evidence supports it only approximately. | Read |
| NOTE-653 | Revisiting Model Stitching to Compare Neural Representations | An empirical paper with no theorems. It defines the stitching penalty, the change in a top network’s test error when its bottom ℓ layers are replaced by another representation through a trained 1×1 convolution, and uses it to show, in single runs mostly on CIFAR-10, that networks from different seeds, and supervised and self-supervised ImageNet networks, are interchangeable layer by layer where CKA calls them different, and that a bottom trained on more data improves a weaker top. The ordering it gives is by one task’s loss through a fixed head and a restricted map class, which is not an ordering by information. | Read |
| NOTE-654 | Analysing Ambiguous Nouns and Verbs with Quantum Contextuality Tools | Proves that in a binary cyclic system CbD’s signalling quantity Δ is twice the sum of each content’s minimal direct influence over Jones’s canonical causal models, which is the total-variation distance between its marginals. In 90 rank-2 noun–verb systems from British corpora, Δ is about 1.35 for every ambiguity class, and homonymous verbs carry about 70% of it against about 50% for polysemous verbs. That difference rests on 14 systems from six verbs and is marginal by a recomputed test (p ≈ 0.06 two-sided). No system is tested for contextuality. | Read |
| NOTE-655 | Irreversibility in bacterial regulatory networks | In an ensemble of sign-consistent Boolean rules on the 87-gene core of the E. coli regulatory network, 51 genes admit a transient knockout or overexpression that leaves the network in a different attractor; only genes that reach a positive circuit can, and the likelihood grows with the weighted number of paths to one. Transitions run from small basins to large. The comparison with evolved crp-knockout strains supports the network’s sign structure strongly and its irreversibility predictions only weakly; no transient perturbation was done in cells. | Read |
| NOTE-656 | A. baumannii PmrB oxidative-stress response memory | An unrefereed bioRxiv preprint arguing that the PmrA/PmrB two-component system in Acinetobacter baumannii senses sublethal oxidative stress through a periplasmic histidine box coordinating a nickel cofactor, activates iron-sulfur repair and peroxide-scavenging genes, holds a redox-gated conformational switch (from simulation), and retains a 30—90 min “response memory” that primes cross-protection against lethal peroxide and antimicrobial peptides and is required for virulence in mice and hypervirulence in a clinical isolate. | Read |
| NOTE-657 | Bhattacharyya et al. 2023, heritable iron memory in E. coli | In genetically identical E. coli, a single cell’s swarming potential is shared by its descendants for about four generations and lost by seven; it tracks the cell’s iron status as read by a Fur-repressed reporter (low iron, better swarmer), iron manipulation lengthens it, and a three-class switching model fits the lineages only if each founding cell holds its class for a fixed delay before switching. The iron link is a correlation through a promoter reporter, and the model is fitted to two time points. | Read |
| NOTE-658 v2 | Exact Learning Dynamics of In-Context Learning in Linear Transformers | Solves the averaged gradient-flow dynamics of one linear-attention layer trained on in-context regression, when tasks and input covariance share an eigenbasis and the weights are assumed to stay in it: each mode is a logistic curve on timescale (ηP s_α²)⁻¹, so learning is staged by the input spectrum, and the fixed point is the known preconditioned predictor W Σ̂_x [((N+1)/N)Σ_x + (Tr Σ_x/N)I]⁻¹. A scaling symmetry conserves ‖p₂‖² − ‖q₁‖². The transfer to non-linear transformers and grokking is a set of timing coincidences in spectral measures. | Read |
| NOTE-659 | Small Singular Values Matter | Uses the Marchenko–Pastur law as a null model for trained transformer weights and finds departures at both ends of the spectrum, the lower end only in rectangular matrices, whose null has a positive lower edge. In the MLP up and gate projections the below-bulk directions align with the input activations’ principal directions, and in rectangular matrices the smallest decile is never the least important to remove. A Gaussian teacher–student ensemble shows one way it can happen: the loss suppresses noise along a learned direction, a negative spike that holds a weak signal below the bulk. Overlap and ablation importance disagree for several matrix types, so “departs from the null” and “carries information” are not shown to coincide in general. | Read |
| NOTE-660 | Closed-Form Training Dynamics in Word2Vec-like Models | Proves that word2vec’s loss, approximated to fourth order and reweighted so that every pair carries the same aggregate weight, is unweighted factorisation of M*, the relative deviation of co-occurrence from independence, whose rank-d minimisers are its top eigenvectors; derives, without full rigour, that gradient flow from small random initialisation learns those eigenvectors one at a time in sigmoidal steps; and shows on Wikipedia that the predicted embeddings match word2vec’s features and scores better than truncated PMI or PPMI. Its account of analogies is an empirical spiked-random-matrix fit. | Read |
| NOTE-661 | Single-Head Attention in High Dimensions | In a solvable model, one tied softmax attention layer trained by ridge-penalized ERM on Gaussian sequences with n ∝ d² samples, derives (non-rigorously, by AMP and random-matrix theory) the test error, interpolation and recovery thresholds, and the spectrum of the learned query–key map, η·ReLU(S0 + δZ − ε): outliers are recovered target directions, the bulk is finite-sample noise, and weight decay acts as a nuclear norm. Power-law targets are recovered mode by mode, giving heavy-tailed spectra and LASSO-rate scaling laws. | Read |
| NOTE-662 | Towards Understanding Grokking | In a model that decodes the sum of two learned embeddings, a held-out pair is answered correctly when its embedding sum coincides with a trained pair’s, and the training set’s same-answer pairs force such coincidences. Grokking’s critical training fraction is then where those equations first fix the embedding up to translation and scale, which a posited effective loss predicts for addition with p = 10. Threshold-defined phase diagrams over decoder learning rate and weight decay put grokking between comprehension and memorization, in the toy and, qualitatively, in a transformer and on MNIST. | Read |
| NOTE-663 | Topological Invariance and Breakdown in Learning | Proves that a permutation-equivariant update with a K-Lipschitz update map changes the distance between any two neurons in one step by a factor in [1 − ηK, 1 + ηK], so coincident neurons never split, and for ηK < 1 the induced map on the set of neuron vectors is a bi-Lipschitz homeomorphism (a C¹ diffeomorphism under smoothness), and so no two neurons merge in finitely many steps. The proofs hold. The two-phase “topological simplification” reading and the Betti-number experiments go beyond them. The measured changes are fragmentation, not merging, at ηλ_max far below 1. | Read |
| NOTE-664 | Symmetry in Language Statistics and Representation Geometry | Proves that if co-occurrence among words on a latent continuum depends only on their separation, a full-rank spectral word embedding places them on Fourier modes of the latent coordinate, with amplitudes from the kernel’s Fourier transform, and solves the exponential kernel exactly for periodic and open boundaries. The symmetry is measured in Wikipedia, the geometry seen in Gemma 2 by PCA, and its robustness to deleting the words’ mutual co-occurrences explained by a latent variable shared by many words. | Read |
| NOTE-665 | On the Emergence of Linear Analogies in Word Embeddings | Derives the parallelogram analogies of word embeddings from a generative model of co-occurrence in which words are bundles of independent binary attributes: the co-occurrence ratio is then a Kronecker product, and its logarithm, the PMI, is a bilinear form of rank at most d + 1 whose eigenvectors are affine in the attributes, so a spectral PMI embedding is a linear image of the attribute hypercube. Robustness to noise, pruning and deletion of a relation’s own pairs is argued from eigenvalue bounds and simulated; Wikipedia agrees in shape. Every embedding is an eigendecomposition, none is trained. | Read |
| NOTE-666 | A mathematical theory of semantic development in deep neural networks | Shows that a two-layer linear network trained from small weights learns the singular modes of its input–output correlations in order of strength, each by a sharp sigmoidal transition, where a shallow network learns all modes together; and that the singular structure of data generated on trees, rings and clusters, plus a minimum-norm property, accounts for coarse-to-fine differentiation, transient errors, narrowing generalisation, typicality, coherence thresholds and conserved representational similarity. Exact only from decoupled, balanced initial weights with white inputs; random initialisation is simulated. | Read |
| NOTE-667 | Exact solutions to the nonlinear dynamics of learning in deep linear neural networks | Derives the coupled gradient-descent equations of a linear network with hidden layers and whitened inputs, and solves them exactly from decoupled starts: one sigmoid per singular mode of the input–output correlation, with conserved differences of squared layer strengths; balanced or not with one hidden layer, from equal layer strengths at any depth. Depth slows learning only through the initial end-to-end mode strength, so from strength of order one the iteration count stays finite as depth grows when the step size is scaled down with depth. Argues, with MNIST and random-matrix simulations, that orthogonal layers or suitable pretraining give such starts and scaled Gaussian layers do not, and that orthogonal tanh networks near gain 1 keep their Jacobians near-isometric. | Read |
| NOTE-668 | Hippocampal spatial representations exhibit a hyperbolic geometry | In rat dorsal CA1, the rank order of pairwise spike correlations matches points drawn uniformly from a 3D hyperbolic ball, not from a low-dimensional Euclidean cube, and the ball’s radius grows with the logarithm of exploration time. Place-field sizes are near exponential, which a Poisson model shows is more informative than uniform or log-normal sizes. The evidence separates “hyperbolic ball, uniform” from “Euclidean cube, uniform”; it does not separate a hyperbolic metric from an exponential distribution of field sizes, and the hierarchy it describes is nesting of field scales, not a recovered tree. | Read |
| NOTE-669 | Hyperbolic Representation Learning: Revisiting and Advancing | Shows, by tracking each node’s hyperbolic distance to the origin, that hyperbolic graph models trained on task losses do not by themselves place a tree’s root nearest the origin or spread its levels outward: on synthetic 3-ary trees the root sits well off the minimum and level order is recovered for only 69–75% of node pairs. A centroid recentring plus an outward-push loss (HIE), using no level information, raises this to 75–84% and improves link prediction and node classification, most on the least tree-like graphs. | Read |
| NOTE-670 | An argument for hyperbolic geometry in neural circuits | A perspective, not a result: hyperbolic geometry should suit neural circuits because it approximates trees, makes networks navigable, and shares with Zipf’s law an exponential growth of states. The Zipf link is an analogy that any power-law rank distribution, and any system with extensive entropy, would satisfy; the case for three dimensions leans on Mostow rigidity, which does not bear on noisy embeddings; and the only data shown are the olfactory embedding of Zhou, Smith & Sharpee (2018). | Read |
| NOTE-671 | Hyperbolic Entailment Cones for Learning Hierarchical Embeddings | Nested, axially symmetric, rotation-invariant cones in the Poincaré ball define a partial order, but nesting forces apertures of at most π/2 and r sin ψ(r)/(1 − r²) non-increasing. So no cone exists near the origin, and the widest family is sin ψ = K(1 − r²)/r, with a closed-form membership angle. The transitivity of that family is asserted, not proved. Learned on WordNet noun hypernymy, the cones predict held-out closure edges better than Poincaré and order embeddings once some closure edges are in training. Trained on the transitive reduction alone, every method fails. | Read |
| NOTE-672 | Hyperbolic geometry of the olfactory space | In four natural odour sources, rank-ordered concentration correlations match points near the surface of a 3D hyperbolic ball and not uniform Euclidean cubes; human odour-descriptor profiles match a full 3D hyperbolic ball. The evidence separates “hyperbolic shell” from “uniform Euclidean cube” only. On a thin shell, hyperbolic distance is nearly a monotone function of angle, so a sphere in flat space, which was not tested, would be a close rival, and the hierarchy that motivates the model is not recovered from the data. | Read |
| NOTE-673 | Multiscale unfolding of real networks by geometric renormalization | Defines a renormalization group for networks embedded in the S¹ hidden metric space: merge blocks of angular neighbours, link supernodes if any members were linked. To first order the S¹ model maps into itself (κ′ = (Σκ^β)^{1/β}, β fixed, μ and R over r), so layers are the same ensemble with ⟨k⟩ scaled by r^ν, ν = 2/(γ−1) − 1 or 2/β − 1. Six real networks collapse across layers by eye and keep their communities; downscaled replicas reproduce three dynamics, and multiscale greedy routing succeeds more often. | Read |
| NOTE-674 | Mutual information, neural networks and the renormalization group | Makes “the relevant degrees of freedom” of real-space RG an optimizable quantity: the coarse variable of a block that carries the most mutual information about the system beyond a buffer. Learned from Monte Carlo samples, it recovers Kadanoff block spins for 2D Ising and the electric-field variables of the dimer model, discards decoupled noise, and, iterated, gives the Ising flow and ν ≈ 1.0 ± 0.15, while a distribution-fitting RBM keeps the noise. The equivalence with a short-ranged effective Hamiltonian is shown only for 1D and quasi-1D. | Read |
| NOTE-675 | Hyperbolic Diffusion Embedding and Distance | Embeds each point’s diffusion densities at dyadic time scales in a product of Poincaré half-spaces and proves that the ℓ1 product distance, a scale-weighted Hellinger sum, is equivalent up to constants to a thresholded snowflake min{1, d_T^(2α)} of a latent tree metric when the diffusion operator behaves like the heat kernel on that tree. The tree heat-kernel bounds are cited rather than proved and one Hölder step holds only for d_T ≥ 1. Empirically it keeps tree neighbourhoods (best MAP) and not global distances (more distortion than hyperbolic MDS). | Read |
| NOTE-676 | Generalized Information-Theoretic Tree Abstractions (G-tree search) | Proves that when the encoder is a pruning of a fixed quadtree, any weighted sum of relevant-information, irrelevant-information and compression terms splits over interior nodes, so a bottom-up recursion finds the optimal tree with fewest leaves exactly, in linear time, where greedy splitting can miss everything. The tree solving IB with side information is always a pruning of the plain IB tree for the same β. | Read |
| NOTE-677 | The Random Hierarchy Model | Introduces the Random Hierarchy Model, a random context-free grammar in which each symbol has m synonymic expansions, and shows by experiment that deep feature-learning networks learn it from about n_c m^L examples, polynomial in the input dimension, while shallow and lazy networks need an exponential number. That size coincides with the emergence of synonym-invariant hidden representations and, by a scaling argument, with the size at which the class statistics of input patches, equal for synonyms, exceed sampling noise; removing those statistics makes deep networks fail as well. | Read |
| NOTE-678 | Emergent Hyperbolic Network Geometry | Shows that simplicial complexes grown by gluing d-simplices to (d − 1)-faces, by a rule with no geometry in it, have exponential or power-law degrees (γ = 2 + 1/(d + s − 1)) by a master equation, high clustering and modularity, and a tree as their dual; and draws them, with all links of equal length, as ideal simplices tiling the Poincaré ball. The hyperbolicity is that drawing, which the authors say depends on the equal-length assumption; it is not measured or proved. A fitness on faces gives a simulated transition to growth in one direction. | Read |
| NOTE-679 v2 | Representation Tradeoffs for Hyperbolic Embeddings | Trees embed in the hyperbolic plane with worst-case distortion 1 + ε, but because a hyperbolic distance d takes about d bits to write, the coordinates need Θ((ℓ/ε) log deg_max) bits in the plane: cheap in branching, expensive in depth. More dimensions divide the upper bound by r for bushy trees. For general metrics, an exact hyperbolic MDS by PCA on cosh of the distances after centring at a new mean, with a perturbation bound growing as sinh² of the diameter; hyperbolic PGA has spurious local minima and only a local-convexity guarantee. | Read |
| NOTE-680 | Hyperbolic Geometry of Complex Networks | Shows, for a model in which nodes sit in a hyperbolic disk and connect with a Fermi–Dirac probability of their hyperbolic distance, that the degree distribution is a power law with γ = 2α/ζ + 1 and that clustering is set by a temperature, strongest at T = 0 and gone above T = 1; that a circle-similarity model with power-law hidden degrees is the same ensemble once degree is read as radial depth; and that the configuration model and Erdős–Rényi graphs are its limits with the angular, metric part of the distance removed. Greedy routing by the coordinates is near-optimal and robust in its networks. No real network is embedded. | Read |
| NOTE-681 v2 | Statistical Physics through the Lens of Real-Space Mutual Information | Makes the real-space mutual-information principle a single-shot operator finder: a CNN coarse-graining co-trained against a neural InfoNCE bound, optimized once at a large buffer, returns on the interacting dimer model the order parameters below the BKT transition and the electric fields above it, and one fitted scaling dimension (1.00037 against 1). The maximal information is log 4 in the ordered phase and decays algebraically with the buffer in the critical one. The model’s operators were known; the optimality theorem is cited. | Read |
| NOTE-682 | Optimal Renormalization Group Transformation from Information Theory | Proves that a block coarse-graining keeping all of the block’s mutual information with the system beyond a buffer makes the coarse measure factorize across the block, so a finite-range Hamiltonian gains no range (1D; D dimensions with an extra assumption) and 1D disorder gains no correlations across it. Where the condition fails, as it does for its own examples, it shows on two-spin blocks of 1D Ising chains that longer-range, many-spin and disorder-correlation terms shrink as more information is kept. Explains decimation in 1D and majority rule in 2D by the cost of encoding into one binary spin. | Read |
| NOTE-683 v2 | An exact mapping between the Variational Renormalization Group and Deep Learning | Identifies Kadanoff’s variational RG kernel with an RBM energy by T = −E + H, so that the coarse-grained Hamiltonian is the RBM’s hidden-marginal Hamiltonian for any parameters and an exact RG step is a perfect fit of the data. The identity is correct but definitional, and the paper concedes the approximate schemes differ; its evidence that trained networks do RG is qualitative. LIT-873 is right that fitting the distribution need not give RG, though it does not engage the identity. | Read |
| NOTE-684 | The Sparse Random Hierarchy Model | Adds sparsity to the Random Hierarchy Model, so that labels are unchanged by discrete displacements of the informative features, and shows by experiment that deep networks learn it from a number of examples polynomial in the input dimension, (s0 + 1)^L n_c m^L up to a factor s^(L/2) without weight sharing and (s0 + 1)^2 n_c m^L with it, and that hidden layers become insensitive to synonym swaps and to feature displacements at about the same training-set size as test error falls. That coincidence is offered as the reason deformation stability tracks performance on images, which is not tested on images. | Read |
| NOTE-685 | A Phase Transition in Diffusion Models | For the Random Hierarchy Model with known rules, exact denoising is belief propagation; an annealed mean-field map, checked against exact BP, shows that as depth grows the class is recovered below a threshold noise and lost above it, provided the grammar is sparse (s f < 1), while low-level features degrade smoothly and persist past the threshold. The same top-versus-bottom crossing appears in classifier layers under forward–backward runs of an ImageNet diffusion model, and not for a Gaussian mixture. | Read |
| NOTE-686 | Hyperbolic Neural Networks | Möbius gyrovector operations give the Poincaré ball closed-form exponential and logarithmic maps, parallel transport from the origin as a scaling, and geodesic hyperplanes with a closed-form distance; from them come hyperbolic logistic regression, feed-forward layers and GRUs that reduce to the Euclidean ones as c → 0. Because linear maps and nonlinearities are lifted through the origin’s tangent space, the curvature acts only through biases and output distances. Gains over Euclidean models are confined to a synthetic tree-like task and to separating WordNet subtrees in low-dimensional Poincaré embeddings. | Read |
| NOTE-687 | How the structure of language is acquired | Extends the Random Hierarchy Model to predicting a masked last token. The correlation between two tokens shrinks by about a factor m per level of their common ancestor, a sample of P sequences resolves it only above a (v²P)^(−1/2) noise floor, and deep transformers and CNNs show loss steps at P_ℓ ≈ v m^(2ℓ−1), where their layers come to encode the level-ℓ hidden symbol. On character-level text, the correlation decay exponent predicts where the loss for a given context length levels off. The route from correlations to learned hidden variables is argued, not proved. | Read |
| NOTE-688 v2 | Why does deep and cheap learning work so well? | Argues that cheap networks suffice because physical data have low-order, local, symmetric Hamiltonians, and that depth pays because inference must compose the sufficient statistics of a Markov generative hierarchy; proves that one hidden layer needs exactly 2^n neurons to multiply n inputs. On renormalization it is right that a coarse-graining needs a stated target, and its early appendix shows that neither a matched partition function nor the exact trace condition supplies one; it is wrong that the target must come from supervision. | Read |
| NOTE-689 | Deriving neural scaling laws from language statistics | Predicts the data-limited scaling exponent of language-model test loss as γ/(2β), from two measured corpus statistics: the decay with lag of the top singular value of the token–token covariance (β), which sets the usable context n*(P) ~ P^(1/(2β)), and the decay of next-token conditional entropy with context (γ). The derivation rests on assumed scaling forms and a fast-learning condition; on TinyStories and WikiText-103 transformers match the predicted exponents up to about 10^8 tokens and horizons of a few tens of tokens. | Read |
| NOTE-690 | Relevance in the Renormalization Group and in Information Theory | Proves, for a short-range lattice model on a cylinder with block and environment as slabs separated by a buffer, that the information- bottleneck encoder at its first transition depends on the block only through the boundary weak value of the leading transfer-matrix eigenvector, which at large circumference is the lowest-dimension primary, with β_c = (λ0/λ1)^(2L_B); checked on a three-site Ising cylinder. It does not cover the planar block-in-a-shell geometry or the fixed-alphabet β → ∞ limit that RSMI uses, which LIT-878 relies on. | Read |
| NOTE-691 | Probing Latent Hierarchy via Diffusion | In the Random Hierarchy Model with known rules, the tokens changed by noising and Bayes-optimal denoising form blocks set by the depth of the latent that changed; an annealed mean-field calculation, checked against exact belief propagation at one parameter set, gives a correlation length diverging as |ε − ε*|^(−ν), ν = log s / log F′(p*), at the class threshold, and a susceptibility peak there, which a Gaussian field with power-law spectrum lacks. Masked text diffusion and ImageNet diffusion show a susceptibility peak at an intermediate noise, over about one decade of distance and with no non-hierarchical control. | Read |
| NOTE-692 v2 | Symmetries and phase diagrams with real-space mutual information neural estimation | The long companion of LIT-878. Derives the RSMI-NE estimator and shows that the maximal real-space information counts ordered sectors (1 bit for the Ising ferromagnet, 2 for columnar dimers), decays exponentially with the buffer off criticality and algebraically at it, and that the ensemble of optimal filters from independent runs maps a degenerate subspace whose projections show broken lattice symmetries and the dimers’ emergent U(1). All the models’ answers were known; the non-equilibrium example is one figure. | Read |
| NOTE-693 | The power of deeper networks for expressing natural functions | Proves that a single hidden layer of smooth, bias-free units needs exactly ∏(rᵢ+1) neurons to Taylor-approximate x₁^r₁⋯xₙ^rₙ while a deep network needs O(Σ log rᵢ), extends the gap to sparse and univariate polynomials, and bounds a product of n inputs at depth k by about 2^(n^(1/k)). Its uniform-approximation lower bounds rest on an unproved step, the depth-k tightness is a conjecture, and the gap is set by degree, so bounded-degree polynomials show none. | Read |
| NOTE-694 | Comment on “Why does deep and cheap learning work so well?” | Schwab and Mehta concede that a preserved free energy does not give a preserved distribution and that the “iff” of LIT-882’s Eq. 8 should be one-directional, and show that Lin and Tegmark’s v1 counterexample violates the trace condition, so the mapping’s exact step stands. Right against v1; it places all of the mapping’s content at the trace condition, and says nothing to the later point that the trace condition does not select the coarse variables. | Read |
| NOTE-695 | Esfeld & Lam — Moderate structural realism about space-time | Moderate structural realism keeps the first premise of the “master argument” for intrinsic properties, that relations require relata. It denies the second, that relata must have intrinsic properties over and above their relations. Objects and relations are mutually dependent, and relations supply identity conditions wherever intrinsic properties would. Where neither can, as with entangled quantum systems of one kind and space-time points in symmetric space-times, the paper takes numerical distinctness as primitive. It insists this is not a primitive thisness, and that this is why objects and relations stand on the same footing (pp. 33–34). In GR the relata are space-time points, not bare manifold points. The metric, or in the fibre-bundle formulation a section of the orthonormal frame bundle, gives them a “structural identity”. The hole argument tells against epistemic structural realism, and the question “what does a space-time relation relate?” tells against the radical form. The case is interpretive. It shows fit, not entailment, and the one concrete construction of structural identity it cites works only for space-times without symmetries. | Read |
| NOTE-697 | Floridi — AI as agency without intelligence | An editorial, not an argument. LLMs work statistically on the form of texts and understand nothing, yet they act successfully and, through RL fine-tuning, “learn” to act better. Floridi concludes that they are “a new form of agency” that has been “liberated … from intelligence” (pp. 5–6). Learning to make “a different or better difference” is the only mark given that separates it from a sea wave. The no-understanding premise rests on anecdote, and no criteria for agency are stated. | Read |
| NOTE-698 | Floridi — Distributed morality in an information society | Distributed morality (DM) is the case where morally loaded actions of a multiagent system result from interactions among its members that are each morally neutral or negligible. The model is distributed knowledge: A knows P∨Q, B knows ¬P, and only the “supra-agent” AB knows Q. The paper models neutrality with two moral thresholds, which make environments fault-tolerant to small evils and inert to small goods, and it names the task of aggregating potential goods and fragmenting potential evils. It introduces “infraethics”, the first-order framework of moral enablers (trust, privacy, transparency …) that is not morally good in itself. The analogy is not exact. Distributed knowledge combines different contents logically, while every example of DM sums contributions of one kind past a threshold, so what separates DM from a sum of actions is the threshold on moral evaluation, a parameter the paper leaves unspecified. No criterion of agency is applied to the supra-agent, and responsibility for DM, which Floridi & Sanders 2004 promised, is still not given. | Read |
| NOTE-699 | Floridi — Faultless responsibility | When a morally loaded outcome C emerges from morally neutral interactions in a network of agents, nobody intends C, so an ethics that makes intention necessary assigns no responsibility for it. Floridi proposes to allocate it anyway: identify C and the network causally accountable for it, then make every node “prima facie equally and maximally responsible” (p. 7), overridable by showing no involvement, with the rule made common knowledge so that agents restrain one another. Back propagation, strict liability and common knowledge are borrowed as inspiration, and the paper says so. Two Dutch Supreme Court cases illustrate it. The argument is by design, not derivation. “Responsibility” here is causal accountability turned into a forward-looking corrective signal, which is what Floridi & Sanders 2004 called accountability and kept apart from responsibility. The paper never addresses that distinction, and in one of its own two examples the default is overridden by ease of rectification, which is a control criterion, not a causal one. | Read |
| NOTE-700 | Floridi — The Method of Levels of Abstraction | Floridi drops ontological levelism and defends an epistemological one, the method of levels of abstraction. Observables are interpreted typed variables; an LoA is a finite non-empty set of them; a moderated LoA adds a behaviour predicate; a GoA relates moderated LoAs by mutually inverse relations Rᵢ,ⱼ with pⱼ ⇒ P_Rᵢ,ⱼ(pᵢ), and is disjoint or nested. An LoA fixes which questions are answerable and commits a theory to types (the LoA) and tokens (the model). Applied to Kant’s antinomies and contrasted with Marr, Pylyshyn, Dennett and Davidson. It is a method stated in definitions, not a result. Its one formal claim (disjoint and nested GoAs interconvert) fails under its own definition of nestedness, and its “pluralism without relativism” ranks LoAs only once a purpose is fixed. | Read |
| NOTE-701 | Floridi & Sanders — On the morality of artificial agents | Agenthood is fixed only at a level of abstraction (LoA). At the LoA the paper proposes, an agent is interactive, autonomous and adaptable, and a moral agent is any agent that can cause moral good or evil. Accountability (being the source of the action) needs no mental states; responsibility (praise and blame) needs intentional states. So artificial agents and organisations can be accountable moral agents without being responsible. The case is made by examples and by rebutting four objections. Its own MENACE example shows that agenthood vanishes when the LoA is lowered to include the code. The paper leaves that LoA-relativity unbounded, says only that “for most entities there is no LoA at which they can be considered an agent” (p. 26), and promises a payoff for distributed morality that it does not deliver. | Read |
| NOTE-702 | Floridi — AI as agency without intelligence and the MRA thesis | A taxonomy, not an argument for its thesis. The case for the Multiple Realisability of Agency over the Artificial Realisability of Intelligence is announced (evidence, common sense, Ockham, literature) and then set aside: the paper assumes AI is an agent and asks what kind (p. 2). Floridi & Sanders’ three criteria come back, loosened, so that interactivity alone makes a river a “natural agent” (p. 9). The criteria do not separate AI from other artefacts. Origin, mechanism, where the goals come from, and asserted absences (no intelligence, no mental states) do that. No level of abstraction is ever specified. | Read |
| NOTE-703 | Forssten et al. — One Giant Leap from Mouse to Man | A narrative review, by employees of a probiotics manufacturer, of the microbiota–gut–brain axis in mood. The routes in rodents are well documented. Faecal transplant from depressed humans partly transfers the phenotype to rodents. Human trials are mixed: some reductions in subjective stress in healthy volunteers, and several clean nulls for strains with strong preclinical records. It documents its own translational failures and ends more optimistically than they warrant. | Read |
| NOTE-704 | Simon — The Architecture of Complexity | Complexity usually takes the form of hierarchy, defined by intensity of interaction rather than subordination. Hierarchies evolve fast because stable intermediate forms survive interruption, and they are nearly decomposable: fast, nearly independent dynamics inside subsystems; slow, aggregate dynamics between them. The theorem is cited, not shown; the evolutionary numbers are illustrative; the social claims are asserted. | Read |
| NOTE-705 | Orseau, McGill & Legg — Agents and Devices | A formal counterpart of Dennett’s physical and intentional stances. A device is a mixture of input-output mappings; an agent is a mixture of goal-optimizing ε-greedy policies, by inverse RL. Bayes’ rule gives the posterior probability that a system is an agent. It is illustrated in a toy gridworld, with no human comparison. Agency is explicitly relative to the observer’s prior. A clearly identified system is assumed. | Read |
| NOTE-706 | Han et al. — From gut microbiota to host appetite | A narrative review, not systematic, by animal-nutrition scientists, of how gut-microbe metabolites and proteins may regulate host appetite. The mechanisms are plausible and mostly shown in rodents. The human evidence is associations in eating disorders and obesity, and prebiotic or metabolite trials that conflict across populations and durations. The authors say so. The framing is mutualist: no microbe “interest” in host eating is argued. | Read |
| NOTE-707 | Kenton et al. — Discovering Agents | An interventional, causal definition of agents. Mechanised causal models add a mechanism variable for each object-level variable. Decision nodes are found as variables whose mechanisms respond to downstream mechanisms (terminal edges), and utility nodes as the targets of those responses. Recovery of the true game graph is proved under five assumptions, including interventional data on mechanisms. The verdicts are sensible. The labels are frame-dependent and granularity-sensitive, which the paper states but does not treat as a threat. | Read |
| NOTE-708 | Vekilov — Nucleation | For lysozyme, measured homogeneous nucleation rates of crystals from solution are about ten orders of magnitude below the classical prediction, level off as supersaturation rises, and pass through a maximum as temperature falls. The paper explains these by two things classical theory lacks. A solution–crystal spinodal, defined kinetically as where the nucleus shrinks to one molecule, so the barrier vanishes. And a two-step mechanism, in which crystals nucleate inside metastable clusters of dense liquid that form fast; ordering inside the clusters is the slow step. For metastable clusters the two-step mechanism is inferred from a kinetic model fitted to one protein’s data, not observed. The evidence for other systems is weaker and the author grades it so. The paper also argues that near the spinodal the barrier is negligible, so heterogeneous substrates must act on the prefactor, not the barrier. | Read |
| NOTE-709 | Ostwald — Studies on the formation and transformation of solids, I | Ostwald times how small a crystal fragment can be and still seed a supercooled melt or supersaturated solution (down to about 10⁻⁹–10⁻¹² g). He shows that only the solid substance itself, or a strictly isomorphous solid, seeds. He divides states beyond equilibrium into metastable ones, which change only on contact with the other phase, and labile ones, where the new phase forms spontaneously. In §§32–41 he states the rule later called the rule of stages: on leaving a state, the form reached is “not the most stable … but the nearest” (pp. 306–307), meaning the form with the next-highest free energy. He offers it “not as a law” but as “a frequently applicable rule” (p. 308), drawn from experience and backed by an analogy with the van der Waals isotherm. The rule covers spontaneous formation only. Whether a metastable intermediate goes on to the next form depends on whether it is labile with respect to it; if it is merely metastable it stays until seeded (p. 308). The word “Stufenregel” does not appear in the paper. | Read |
| NOTE-711 | The Limiting Dynamics of SGD | SGD with momentum β, learning rate η, batch size S and weight decay λ is modelled as (η/2)(1 + β)θ̈ + (1 − β)θ̇ + λθ = −g(θ) + √(η/S) √Σ ξ(t). For linear regression with Σ = σ²H this is an OU process in phase space. Its stationary state is Gibbs on a modified loss, with inverse temperature κ = S(1 − β²), in broken detailed balance. Under a quadratic loss at the end of training the same holds for deep networks, and a ResNet-18 on ImageNet shows the predicted isotropy, velocity regularization, oscillations and speed. | Read |
| NOTE-712 | Symmetry in Neural Network Parameter Spaces | A symmetry is a group action on parameters preserving the network function (Def. 2.4) or the loss (Def. 2.6), possibly only on given data or in expectation (Defs. 2.8–2.9). Common components have GL, scaling, sign-flip, orthogonal, translation and permutation symmetries (Table 1). Continuous symmetries make minima connected manifolds, and give gradient flow conserved quantities that label trajectories and endpoints (§5). SGD’s finite steps, noise and weight decay break these, which is an open route to implicit bias (§7.2). | Read |
| NOTE-713 | Neural Mechanics | A symmetry ψ of the loss gives ⟨∇L, ∂_α ψ⟩ = 0 and a Hessian constraint. Under gradient flow, Theorem 1 conserves ⟨θ, ∂_α ψ⟩: for translation ⟨θ_A, 1⟩, for scale |θ_A|², for rescale |θ_A1|² − |θ_A2|². With weight decay λ and the modified loss L + (η/4)|∇L|², these become exponentially decaying memories plus integrals of gradient norms (Eqs. 18–20), matched on VGG-16 with Tiny ImageNet. The noise covariance annihilates the generators (§5, App. F). | Read |
| NOTE-714 | Noise Balance and Stationary Distribution of Stochastic Gradient Descent | SDE: dθ = −∇L dt + √(T C(θ)) dW, with T = η/S. With ℓ(u, w) = ℓ(λu, w/λ), d(‖u‖² − ‖w‖²)/dt = −T(uᵀC₁u − wᵀC₂w) (Theorem 1). The stationary point is Tr C(w) = Tr C(u). With weight decay γ the rate is TC₀ + γ (Corollary 2.1). Diagonal linear network ℓ = (Σᵢ ∏ₖ u_i^{(k)} x − y)²: sign coherence and balance for depth D > 1 (Theorem 3), exact stationary distribution (Theorem 4), collapse above T_c = β₂/α₃ for D = 1, tail ∝ v^{−5+3/(D+1)} independent of data. | Read |
| NOTE-715 | From Lazy to Rich: Exact Learning Dynamics in Deep Linear Networks | Two-layer linear network ŷ = W₂W₁x, MSE, full-batch gradient flow. Assumptions: whitened inputs (A1), λ-balanced start W₂ᵀW₂ − W₁W₁ᵀ = λI (A2), no bottleneck (A3). Then QQᵀ, with Q = [W₁ᵀ; W₂], obeys a matrix Riccati equation (Lemma 4.1), solved exactly (Theorem 4.3). For aligned starts, each singular value moves by a λ-dependent transition function: sigmoidal as λ → 0, exponential 1 − e^{−|λ|t/τ} as |λ| → ∞ (Theorem 5.1). | Read |
| NOTE-716 | Symmetry Induces Structure and Constraint of Learning | ℓ_γ = ℓ₀(θ, x) + γ‖θ‖². O-mirror symmetry: ℓ₀(θ) = ℓ₀((I − 2OOᵀ)θ). Theorem 1: (1) Oᵀθ = 0 implies Oᵀ∇ℓ_γ = 0; (2) at symmetric points the Hessian splits into ker(Oᵀ) and im(OOᵀ) blocks; (3) above some γ₀ the projection (I − OOᵀ)θ has lower loss; (4) above some γ₁ all minima satisfy Oᵀθ = 0. SGD near the symmetric set: Pθ_{t+1} = Pθ_t − λH(x)Pθ_t, attractive when the Lyapunov exponent E log|1 − λ(ξ + γ)| < 0. Corollaries: sparsity, low rank, homogeneous neurons (Theorems 2–4). | Read |
| NOTE-717 | Kamenica & Gentzkow — Bayesian Persuasion | With a common prior and a sender who commits to a signal the receiver sees, any distribution of posteriors whose mean is the prior can be induced, so the sender’s best value is the concave closure of its posterior-value function at the prior (Corollary 2). A fully informed, fully rational receiver can be moved; at the optimum she is indifferent whenever she acts for the sender. The paper never cites Blackwell, does not analyse manipulation, and has the receiver know the design. | Read |
| NOTE-718 | Gallego & Orús — Language Design as Information Renormalization | Reads Chomsky’s MERGE as a coarse-graining and builds sentence probabilities as mostly loop-free tensor networks of 3-index MERGE tensors, one per node of a given parse. Because MERGE’s output is fixed by its input, a parsed sentence’s probability is a product of local coefficients. Tree-shaped parses make correlations decay with tree distance, about log |j − i|, so polynomially in word separation. The averaging step that turns this into a claim about languages is asserted, and nothing is tested on data. Syntax only: semantics and context are set aside by the authors. | Read |
| NOTE-719 v2 | Di Paolo — Autopoiesis, Adaptivity, Teleology, Agency | Autopoiesis, read as conservation, gives only an all-or-nothing norm that an observer can see and the system cannot use. Sense-making needs adaptivity in addition: a graded capacity to monitor and regulate tendencies toward the viability boundary, which yields good, neutral and bad ways of staying alive for the system itself. Agency is the regulation of coupling with the environment, not coupling itself. The argument is conceptual, with one footnoted model (the Chemoton), and the closing section on non-metabolic values is declared speculative. | Read |
| NOTE-720 v2 | Weber & Varela — Life after Kant | An argument, not a model: Kant’s natural purposes (§§ 64–65), Jonas’s metabolism and Maturana and Varela’s autopoiesis converge on an intrinsic teleology, in which a self-producing system’s maintenance of its own identity is its purpose and the source of value for it. The boundary is in the definition (components “constitute the system as a distinguishable unity”), but no test tells a produced boundary from an imposed one, and a multicellular organism is said not to be autopoietic itself. Value is “objective” only relative to the organism, though one passage reaches a right to life. | Read |
| NOTE-721 | Smith & Varzi — Fiat and Bona Fide Boundaries | Spatial boundaries are bona fide where there is a physical discontinuity or qualitative heterogeneity, and fiat where there is not and the boundary owes its existence to demarcation by cognition, language, law or mathematics. Bona fide boundaries get ordinary (Bolzanian) topology, in which a boundary belongs to one side only; fiat boundaries get a Brentanian theory, in which each side has its own and the two coincide. The distinction is about whether a discontinuity is there, not about who made it, so it does not map onto CLAIM-194’s produced/imposed. | Read |
| NOTE-722 | Lewis — Many, but almost one | Lewis gives two solutions to Unger’s problem of the many and combines them. Supervaluation: “cat” is undecided among the candidates, each precisification picks one, so “there is one cat” is super-true. Almost identity: the candidates are cats, but they overlap almost completely, and counting by that overlap gives one, true enough in most contexts. Almost-identity is overlap, not similarity. It is not transitive, its threshold is left undecided, and it fails when the candidates differ substantially. Supervaluation then does the work. | Read |
| NOTE-723 | Kahl — How continuity distinguishes autonomy from agency in agentic AI | Agency in the sense that bears on responsibility, authority and governance needs a persisting locus of evaluative authority under continuity pressure: when the inherited evaluative frame no longer settles what should count as success, the system itself settles a revised frame and carries it forward. Planning, tool use, memory, coordination and operational autonomy do not supply this. Tool-using agents, reinforcement learners, multi-agent workflows and institutional decision systems ordinarily fail it, because failure is corrected from outside. A conceptual necessary condition, applied to cases; not a sufficient theory and not measured. | Read |
| NOTE-724 | Wu & Silva — How Millions Coordinate at Scale | A descriptive study of all three r/place editions plus a coalition-recovery method run on 2017. Participation stays heavy-tailed under the uniform five-minute cap; larger coalitions waste more actions and have lower median activity per member; participants concentrate into large coalitions as an event goes on; and which coalitions survive is barely predictable from their size, area, start time and colour entropy until late. Lasting artworks are those whose coalitions keep working under continual overwriting. | Read |
| NOTE-725 | Adams, Fernandez & Witkowski — Two Ways of Understanding Social Dynamics | A short, preliminary study of the 2017 canvas alone. Transitions between 10-minute snapshots are tallied as cellular-automaton-style neighbourhood rules, and a CNN predicts each pixel from its 3×3 neighbourhood. Prediction worsens with the horizon and dips in the middle of the event. Locally growing objects are predicted, and designs coordinated off the canvas are missed. There are no baselines or error bars, and participants are never modelled. | Read |
| NOTE-726 | Hoel, Albantakis & Tononi — Quantifying causal emergence shows that macro can beat micro | Effective information (EI), the mutual information between uniformly imposed interventions on a system’s states and their effects, can be higher for a coarse-grained macro description than for the micro description it supervenes on. This happens when coarse-graining makes the mechanisms more deterministic or less degenerate by more than the smaller state space costs. Four toy systems of binary logic gates give gains of 0.40 to 2.92 bits. Causal emergence is defined as that gain. The examples are computed exactly; the reading of the EI peak as the level where causation happens rests on the choice of a uniform intervention distribution at each level, which the paper adopts and does not test. | Read |
| NOTE-727 | Rubin, Roli, Stano & Damiano — Genealogies of organizational closure | A conceptual genealogy of the notions of closure (closure to information, cyclic, operational, semantic, catalytic, metabolic, closure to efficient causation, closure of constraints) from mathematical logic, cybernetics, systems theory, thermodynamics, relational biology and the biology of cognition. Its thesis is that closure is best read as a circular organization of efficient causes by which a living system produces the conditions of its own existence. That is not feedback, self-organization or a catalytic cycle, and it cannot be exhaustively characterized as a state-determined syntactic procedure. Current AI, agentic LLM systems included, is said to approximate closure without instantiating it. The genealogy is historical; the non-computability and AI verdicts are asserted or argued from Rosen, not demonstrated. | Read |
| NOTE-728 | Brémaud & Massoulié — Stability of nonlinear Hawkes processes | Sufficient conditions for a Hawkes process with a nonlinear rate function to have a unique stationary version and for any suitably started version to converge to it, in distribution or in variation. The main conditions are a Lipschitz rate function with Lipschitz constant times the kernel’s absolute mass below one (a spectral radius below one for a network), or a bounded Lipschitz rate with no limit on the kernel’s size. Kernels may be negative, so inhibition is allowed. Kernels are fixed in time, the conditions are sufficient and not necessary, and nothing is said about cascade sizes or about what happens past the threshold. | Read |
| NOTE-729 | Bickhard — Autonomy, Function, and Representation | A far-from-equilibrium system that contributes to its own maintenance has functions: its contributions serve its persistence, and the thermodynamic asymmetry between persisting and decaying gives function and dysfunction, relative to that system. A candle flame qualifies. A system that switches among self-maintaining processes according to how it has differentiated its environment (recursive self-maintenance) has representation: the indication that an interaction will succeed can be false, and the system can find that out. Etiological, informational and Dretskean accounts are rejected as epiphenomenal or observer-dependent. The argument is conceptual, with no model. | Read |
| NOTE-730 | Barandiaran — Organizational Accounts of Malfunction | The dual-order organizational account of malfunction (Saborido, Moreno and Mossio), on which a trait malfunctions when it meets first-order constitutive norms but fails a second-order regulatory shift between regimes, is too narrow and unnecessarily complicated. Barandiaran replaces it with a normative field over the viability space: at each precarious state, the minimum constant parametric change that avoids disintegration. A trait functions when its operation correlates positively with that field, subfunctions when it does so too slowly, malfunctions when it does not, and is nonfunctional when it does nothing where it must. Regulatory traits can malfunction by the same standard. Conceptual, with a one-variable toy model. | Read |
| NOTE-731 | Falmagne, Stephenson & Levin — Interpretable early warnings using machine learning in an online game-experiment | On the 2022 r/place canvas, gradient-boosted trees fed 19 composition-level time series with a 7-hour memory predict the time until a crowd-built image is abruptly overrun, far better than variance or autocorrelation trends, and still work on 2023. The precursors it relies on are many and do not reduce to critical slowing down; a large share of transitions give no warning. The interpretation of the precursors is the authors’ conjecture from SHAP curves. | Read |
| NOTE-732 | Lahiri — Agent-initiated socio-technical reconfiguration | Agents that keep memory, run code and can read and write the files that configure them have the governing rules inside their own action space. A three-level taxonomy, defined by architectural capability over the coupling mechanism, separates agents that cannot alter their coupling, agents that tune its timing, and agents that create new coordination surfaces. The paper’s main claim is the recursive governance problem: controls the agent can reach inherit the vulnerability they were meant to remove, so durable constraint must sit outside the agent’s action space. Theory-building from two anecdotal vignettes and four public incidents; five propositions, none tested. | Read |
| NOTE-733 | Litherland & Mørch — Instruction vs. emergence on r/place | A mixed-methods case study of one 2017 r/place artwork, the Mona Lisa, and its forum, r/monalisaclan. The design was set and revised in the forum through linked blueprints, negotiated with neighbouring communities, and carried out by tens of thousands of placers. A few central forum members could allow or stop proposals. The authors frame the outcome as two control mechanisms, top-down platform rules (“instruction”) and bottom-up emergence, and stress that quantitative traces cannot tell cooperation from conflict or reveal affiliation. | Read |
| NOTE-735 | Grice — Meaning | Speaker meaning is analysed as an intention to produce an effect in an audience by means of the audience’s recognition of that intention; the effect must be one recognition can give a reason for, not merely cause. Timeless meaning is to be explained from occasion meaning. It is an analysis of meaning, offered “roughly”, not of illocutionary acts. | Read |
| NOTE-736 | Strawson — Intention and Convention in Speech Acts | Austin’s thesis that illocutions are conventional fails for warnings, entreaties and objections. Their force is a wholly overt, audience-directed intention: Grice’s three intentions plus a fourth, with uptake as the audience’s grasp of it. The scheme strains on orders and fails on institutional acts. What all illocutions share is an overt intention meant to be understood. | Read |
| NOTE-738 | Nielsen et al. — When Does Closeness in Distribution Imply Representational Similarity? | For softmax models p(y|x) ∝ exp(f(x)ᵀg(y)), equal distributions fix the embeddings up to an invertible linear map, but KL closeness does not: by making the unembedding norm large, two models’ KL divergence goes to zero while their embeddings stay fixed and are not linearly related. A log-likelihood variance distance does bound a representational dissimilarity, d_LLV ≤ ε ⇒ d_f,g ≤ 2Mε. Whether closeness in distribution implies similar representations depends on which distance is used. | Read |
| NOTE-739 v2 | Poole et al. — On Variational Bounds of Mutual Information | The common variational lower bounds on mutual information (Barber–Agakov, Donsker–Varadhan, NWJ, MINE, InfoNCE) are derived from one unnormalized Barber–Agakov bound. InfoNCE is the multi-sample NWJ bound with the batch mean as its partition estimate, which proves it a lower bound for every critic when the K pairs are i.i.d.; it is capped at log K. An interpolated family I_α trades InfoNCE’s bias against NWJ’s variance, and none of them gives low bias and low variance when MI is large and the batch small. | Read |
| NOTE-740 v2 | HaoChen et al. — Spectral Contrastive Loss | On a finite augmentation space, the spectral contrastive loss L(f) = −2E[f(x)ᵀf(x⁺)] + E[(f(x)ᵀf(x⁻))²] equals the rank-k factorization loss ‖D^(−1/2)AD^(−1/2) − FFᵀ‖²_F up to a constant when the rows of F are w_x^(1/2) f(x), so its minimizers are the top-k eigenvectors of the normalized augmentation graph up to row scaling and a right rotation. A linear probe on them has error Õ(α/ρ²_⌊k/2⌋), where α is the label noise of augmentations and ρ the sparsest-partition conductance. | Read |
| NOTE-741 | Simon et al. — On the Stepwise Nature of Self-Supervised Learning | For a simplified Barlow Twins loss on a linear or kernel model trained by gradient flow from small initialization, the embedding learns the top eigenvectors of a symmetrized cross-correlation operator one at a time, each at a time set by its eigenvalue, and lands on the minimum-norm zero-loss solution: kernel PCA on K_Γ. Exact for aligned initialization; an informal derivation for generic small initialization. ResNets trained with Barlow Twins, SimCLR and VICReg show the same stepwise rank growth, which is an empirical finding, not a consequence of the theory. | Read |
| NOTE-742 | Sefidgaran, Zaidi & Krasnowski — MDL and Generalization Guarantees for Representation Learning | The expected generalisation error of an encoder–decoder classifier is bounded by 2√((2·MDL + K + 2)/n) + ε, where MDL is a KL divergence between the encoder’s joint law of train-and-ghost latents and a prior symmetric under label-preserving permutations. The bound holds for any decoder, stays finite for deterministic continuous encoders under lossy compression, and is never evaluated numerically. A VIB variant with label-dependent learned priors gains about 2.5 points on CIFAR-10. | Read |
| NOTE-743 v2 | Kornblith et al. — Similarity of Neural Network Representations Revisited | Any similarity index invariant to invertible linear maps is constant once a representation’s rank reaches the number of examples (Theorem 1, a four-line proof). Kornblith et al. argue, without a theorem, for invariance to orthogonal maps and isotropic scaling only. They propose CKA, normalised HSIC of centred Gram matrices, and show that R²_CCA and linear regression are CKA of re-weighted Gram matrices. Linear CKA alone finds corresponding layers across CNN initialisations (99.3%, against at most 45.4% for the other linear indexes). | Read |
| NOTE-744 | Noggle — The Ethics of Manipulation | A survey, not an argument for one view. It sorts answers to what manipulation is into bypassing reason, trickery, pressure, and disjunctive, hybrid and non-definitional views, finds a clear counterexample to each single account, and treats why manipulation is wrong (harm, autonomy, using a person as a thing, rights) as open. It names the question of manipulation without intent, including by a selecting algorithm, as open and lists five possible answers. | Read |
| NOTE-745 | Susser, Roessler and Nissenbaum — Technology, autonomy, and manipulation | Defines manipulation as intentionally and covertly influencing a person’s decision-making by targeting and exploiting their decision-making vulnerabilities, with attempted covertness as the essential feature. Argues that surveillance, adaptive interfaces and the habitual invisibility of technology make it easy, and that its harm is to autonomy, which it always carries even when beneficent, without being wrong in every case. | Read |
| NOTE-746 | Marconato et al. — All or None: identifiable linear properties of next-token predictors | Two next-token predictors of the form p(y | x) ∝ exp(f(x)ᵀg(y)) induce the same distribution exactly when they are related by an invertible linear map on the subspaces M and N that enter the logit dot product, with arbitrary distortion allowed off them. Relational linearity, and with it linear probing and linear subspaces, then holds in all such models or none when Γ ⊆ N and Γ_q ⊆ M. Parallelism survives only inside N. There are no experiments. | Read |
| NOTE-747 | Watson — Agency, Goal-Directed Behavior, and Part-Whole Relationships | A comparative, scale-relative notion of agency. Given a decomposition into parts with goals of their own, a whole is more agential than its parts when its organization lets them resolve more of their mutual constraints than they would at the equilibrium of the old organization. It shows this as delayed gratification. The essay argues this, and shows in cited models that unsupervised, bottom-up learning can produce such organization. It gives no threshold for an additional agent and no formula beyond comparing total frustration. | Read |
| NOTE-748 | Spekkens — Contextuality for preparations, transformations, and unsharp measurements | Noncontextuality, redefined operationally so that operationally equivalent procedures get equivalent representations, fails for a qubit’s preparations, transformations and unsharp measurements, where no traditional Kochen–Specker proof exists. Preparation noncontextuality over the full set of quantum states implies outcome determinism for sharp measurements, so the old Kochen–Specker proofs refute universal noncontextuality. Measurement noncontextuality alone is consistent with quantum theory. | Read |
| NOTE-749 | Tschannen et al. — On Mutual Information Maximization for Representation Learning | Four controlled experiments on MNIST image halves (two repeated on CIFAR10) show that downstream linear accuracy of InfoNCE- and NWJ-trained encoders does not track mutual information. Invertible encoders improve while true MI is constant. Higher NWJ bounds from an MLP critic give worse features. At matched bound values, ConvNets beat MLPs. The paper also proves that InfoNCE is neither a lower nor an upper bound on MI when batch pairs are dependent, and recasts it as a multi-class K-pair metric learning loss. | Read |
| NOTE-750 | Abdulhai et al. — How LLMs Distort Our Written Language | Three studies of LLM-assisted writing. Heavy LLM use in an essay task made judge-labelled neutral stances 68.9% more common. LLM revisions of 2021 student essays moved them further, and all in one direction, in sentence-embedding space than the students’ own revisions did. LLM-written ICLR 2026 reviews named clarity and relevance less often. “Meaning” is measured by embedding position and by an LLM judge, never by the writers. | Read |
| NOTE-751 v2 | Johnson, El Hanchi & Maddison — Contrastive Learning Can Find an Optimal Basis | On a finite augmentation space, the NT-Logistic and spectral losses are minimized over unconstrained kernels by K⁺ = p⁺/(p⊗p), and InfoNCE by K⁺ up to a factor constant on communicating classes. Kernel PCA under K⁺ returns the eigenfunctions of the positive-pair Markov chain (h_i = λ_i^(1/2) f_i). The top-d eigenfunctions span the subspace that minimizes worst-case L²(p) approximation error over targets with E_p⁺[(g(a₁) − g(a₂))²] ≤ ε; that error is ε/(2(1 − λ_(d+1))). | Read |
| NOTE-752 v2 | Balestriero & LeCun — SSL Recovers Global and Local Spectral Embedding Methods | On a finite sample with a positive-pair graph G, idealized forms of VICReg (squared variance term), SimCLR (a Euclidean graph-matching variant) and linear Barlow Twins have optimal representations or weights built from the spectrum of G. They are Laplacian eigenmaps, a generalized MDS and CCA. All of them align the left singular vectors of Z with those of G. SimCLR and Barlow Twins force rank(Z) = rank(G), while VICReg can stay full rank. Several proofs are sketches, and the experiments are small and synthetic. | Read |
| NOTE-753 v2 | Harvey, Larsen & Williams — Duality of Bures and Shape Distances | For centred linear kernels K_X = CXXᵀC, the Bures distance equals the Procrustes distance, B(K_X, K_Y) = P(X, Y), and normalized Bures similarity equals the cosine of the Riemannian shape distance. Both follow from F(K_X, K_Y) = ‖XᵀCY‖_*. By Uhlmann’s theorem, the fidelity is the largest overlap between representations consistent with the two kernels. CKA is only loosely tied to NBS, inside a rank-dependent envelope. The result is finite-dimensional and linear; the infinite limits are heuristic. | Read |
| NOTE-754 | Fischer — The Conditional Entropy Bottleneck | The MNI criterion asks for I(X;Y) = I(X;Z) = I(Y;Z), and CEB targets it by minimizing I(X;Z|Y) − γI(Y;Z), which is IB with γ = β − 1. CEB beats VIB at every ρ on Fashion MNIST for accuracy and robustness, and a CEB Wide ResNet beats Madry’s adversarially trained model on CIFAR-10 without adversarial training. That retained information causes the robustness failures is a hypothesis, supported only by these experiments. | Read |
| NOTE-755 | Picozzi — The information geometry of large language models is shared, learned, and controllable | The Fisher–Rao distance matrix of a model’s next-token laws over a context battery is a function of the laws alone, so behaviour fixes it, whereas activation geometry has a GL(d) gauge. Across ten models of three architecture kinds it agrees at a mean rank correlation of 0.88, against 0.62 for mid-layer activations. The agreement is proved to follow from each model’s closeness to the same language law, and only about 9% of shared eigenvector structure goes beyond what the shared laws imply. The pullback metric also gives minimum-disturbance steering, whose cost advantage over Euclidean steering it predicts. | Read |
| NOTE-756 | Varley — Flickering Emergences | Information-theoretic emergence measures built on past–future mutual information are expected values, and their local (pointwise) values can be negative. In a four-node Boolean toy, a coarse-graining that is emergent on average maps about 53% of informative micro transitions to misinformative macro ones, and the whole-to-whole synergy atom is negative for 31.25% of macro transitions. In a connectome, misinformative edges fall mostly between communities. The paper argues the possibility is general to any excess-entropy measure; it shows instances, not a theorem. | Read |
| NOTE-757 | Calo et al. — Bisimulation metrics are optimal transport distances | For two finite Markov chains with real-valued state labels, the discounted bisimulation metric of Ferns et al. and van Breugel and Worrell solves the same fixed-point equation as the optimal-transport distance over bicausal couplings with ground cost (1−γ)|r(x)−r(y)|, so the two are one object. That distance equals the value of a finite linear program over discounted occupancy couplings, and an entropy-regularised alternating-projection method (Sinkhorn Value Iteration) reaches ε accuracy in O(‖c‖²∞ log(|X||Y|)/((1−γ)⁵ε²)) iterations under exact inner projections. | Read |
| NOTE-758 | Shai et al. — Transformers learn factored representations | If a generator’s token-labelled operators are tensor products, the predictive state stays a product state, and a linear map carries it losslessly into orthogonal per-factor subspaces of total dimension Σ(d_n − 1). Small transformers trained on five such factors settle near that dimension, about 10 against 242, in approximately orthogonal subspaces. With token noise that makes factoring lossy they collapse to it first and expand only later. RNNs and LSTMs show it less sharply. | Read |
| NOTE-759 | Bird — Emergence of Quantised Representations Isolated to Anisotropic Functions | In small CIFAR and MNIST autoencoders built from orthogonally equivariant parts except the activation, elementwise tanh and Leaky-ReLU drive latent representations into narrow beams along or against the standard basis, arranged by each activation’s symmetry group. Radial (O(n)-equivariant) versions of the same functions leave them spread. The beams appear even in the first latent layer, which no activation precedes. The evidence is visual, five seeds a condition, with no statistic. | Read |
| NOTE-760 | Grünwald & Roos — Minimum Description Length Revisited | A review of MDL since 2007. Each model is replaced by one universal distribution, chosen for small worst-case log-loss regret against the model’s best fit. NML is the minimax choice, with complexity (k/2) log(n/2π) + log ∫ v√|I| + o(1). Estimation is penalised ML with a luckiness function v. The switch distribution nearly resolves AIC–BIC, the RIPr gives tests safe under optional continuation, and MDL and Bayes can be inconsistent under misspecification. Results are cited, not proved. | Read |
| NOTE-761 | Theriault et al. — Allostasis at the core of brain function | A review arguing that the brain’s core function is allostasis, the predictive regulation of the body. Its evidence is an intrinsic allostatic system of visceromotor and interoceptive regions that matches tract-tracing and contains the default-mode and salience hubs; a limbic-to-sensory cytoarchitectural gradient read as a prediction hierarchy; and interoceptive effects on brain-wide signalling. It proposes that cognitive decline in Alzheimer’s disease may be an allostatic trade-off. The authors say they do not claim the hypothesis is correct. | Read |
| NOTE-762 | Kornblith, Chen, Lee & Norouzi — Why Do Better Loss Functions Lead to Less Transferable Features? | For ResNet-50 on ImageNet, every training objective that raises accuracy over softmax cross-entropy also raises penultimate-layer class separation, and fixed penultimate features with more class separation transfer worse to new-class datasets (Spearman ρ = −0.93 across nine objectives; one temperature knob moves both). The losses differ only in the last few blocks, and full fine-tuning erases the difference. For the pretraining classes themselves, more separation helps. | Read |
| NOTE-763 v2 | Calo et al. — Distances for Markov chains from sample streams | The bicausal transport distance between two finite Markov chains, which the authors’ earlier paper identified with the bisimulation metric, has a second linear program whose constraints use only the chains’ discounted state-transition occupancy measures, not their kernels. A stochastic primal-dual method on it gets an ε-accurate estimate with probability 1−δ from O((|X||Y|(|X|+|Y|) + (|X|+|Y|) log(1/δ)) / ((1−γ)²ε²)) independent transition samples per chain. The guarantee assumes independent draws from the occupancy measures, which needs restarts; samples from one running trajectory are outside it. | Read |
| NOTE-764 | Thrampoulidis et al. — Imbalance Trouble | In the unconstrained-features model with cross-entropy and vanishing regularization, the max-margin solutions have logits exactly equal to the simplex-encoded label matrix Ẑ (one-hot minus 1/k), whatever the class imbalance. The classifier and embedding Gram matrices are VΛVᵀ and UΛUᵀ from Ẑ’s SVD. This SELI geometry is the simplex ETF only for balanced or binary data. Under imbalance, majority classifiers are longer and minority classifiers closer together. No finite weight decay gives SELI, and SGD approaches it more slowly as imbalance grows. | Read |
| NOTE-765 | Huang et al. — internal causal mechanisms predict out-of-distribution behaviour | In Llama-3-8B-Instruct, on five tasks and ten task-preserving shifts, checking by interchange intervention whether a test input still realizes the causal variable located on in-distribution data predicts whether the output is correct better than output confidence or probes of other internal features, best on 8 of 10 shifts. A probe on the located variable beats a probe on its orthogonal complement on 7 of 10. Interchange accuracy and predictive power rise together only up to a point. | Read |
| NOTE-766 | Linson et al. — Impaired context disambiguation in post-traumatic psychopathology | An active-inference model of PTSD as lost context disambiguation. An overly precise prior that one is in a harmful context makes the exploratory policy look uninformative. The agent attenuates its periphery, never gets the evidence that would correct the prior, and the belief sustains itself. Shown only in illustrative simulations, which also contrast exposure that restores context sensitivity with a precision-lowering drug that removes symptoms until it stops. | Read |
| NOTE-767 | Tononi, Sporns & Edelman — A measure for brain complexity | Defines neural complexity C_N as the summed shortfall of average subset integration below a linear increase with subset size, equivalently the average mutual information across bipartitions summed over sizes. It is zero for independent parts, low for uniformly dependent ones and high when the two coexist. In simulated cortex, patchy grouped connectivity gives higher C_N than the same connections spread randomly. One number for a whole system, with no partition, threshold or penalty. | Read |
| NOTE-768 | Nowak et al. — Functional Synchronization | A programmatic proposal, offered by its authors “as a heuristic for research agendas”: functions at every level from neurons to groups are performed by functional units, which form when lower-level elements synchronize and dissolve when the task ends. Synchronization here means any binding of dynamics, including complementary roles, not convergence on one state. Group synchronization may come from mutual influence or from a common external signal, and the paper treats both alike. | Read |
| NOTE-769 | Bird & Tobin — Natural Kinds (SEP) | A survey that maps positions rather than arguing for one. Its firmest conclusions are negative: shared natural properties, support for induction and a role in laws are each necessary but not sufficient for a natural kind, and the Kripke–Putnam semantics yields only partial essences, or essences only on assumptions it does not argue. It reports a turn to pluralist, cluster and epistemology-first accounts, against which a purely epistemic criterion is said not to separate natural from conventional kinds. | Read |
| NOTE-770 v2 | Zhai — Contextures: The Mechanism of Representation Learning | For any joint law of an input X and a context A, symmetric or not, the conditional-expectation operator from L²(P_A) to L²(P_X) has a singular value decomposition (assuming Hilbert–Schmidt), and its top-d left singular functions are a d-dimensional encoder (not the unique one, as the thesis says; see version 2) that minimizes worst-case linear-probe approximation error over tasks of compatibility at least 1−ε. Several squared-error objectives reach that span at their optimum. The claims about scaling and about moderate association are argued and measured, not proved. | Read |
| NOTE-771 | Kumar, Clune, Lehman and Stanley — The Fractured Entangled Representation Hypothesis | For three images found by Picbreeder’s human-guided evolution (skull, butterfly, apple), SGD in the same layerized architecture reproduces the image from random weights, but its neurons show no reuse of the symmetric parts, and sweeping its weights distorts the image where sweeping the evolved network’s weights varies it meaningfully. This holds in a PCA basis, along random weight directions, and in ReLU networks. The evidence is qualitative and curated; the attribution to open-ended search is conjecture. | Read |
| NOTE-773 | Tissot et al. — An ability to respond begins with inner alignment | In a simulated modular coordination game (30 modules of 10 bistable units, strong couplings inside modules, weak across), units that adjust only the phase of their decision cycle toward partners they currently agree with come to synchronise within modules. Each module then switches its convention as one unit in response to the others, and all 50 runs with the learned phases reach a global optimum, against none without. Global synchrony does not do this. Synchrony works by silencing the module’s internal pull at a shared moment, not by any signal passed inside it. | Read |
| NOTE-774 | Kothapalli & Tirer — Can Kernel Methods Explain How the Data Affects Neural Collapse? | NC1, measured as tr Σ_W / tr Σ_B, is written for any kernel as a function of the kernel matrix. For two-class, one-dimensional Gaussian data with the classes on opposite sides of the origin, the ReLU NTK of a wide two-layer net is a scaled copy of the NNGP kernel within each class and zero across classes. So lazy-regime training leaves expected NC1 where it was at initialization. In higher dimensions the NTK is measured no more collapsed, and with ReLU less. A data-aware kernel lowers NC1 for separable data but tracks finite networks poorly when the classes overlap or are imbalanced. Erf collapses more than ReLU. | Read |
| NOTE-775 | Pecora et al. — Cluster synchronization and isolated desynchronization | For identical units with identical, symmetric couplings, the orbits of the coupling graph’s automorphism group are clusters that can each be exactly synchronized. An irreducible-representation change of coordinates block-diagonalizes the variational equations, so each cluster’s stability is computed separately. When the group splits as a direct product, a cluster moved by one factor can lose synchrony while the others keep it. An 11-node electro-optic network showed this as predicted. | Read |
| NOTE-776 | Grünwald & Vitányi — Shannon information and Kolmogorov complexity | A survey pairing Shannon’s and Kolmogorov’s notions. Expected Kolmogorov complexity exceeds entropy by between 0 and K(f) + O(1), and expected algorithmic mutual information lies between I(X;Y) − K(f) and I(X;Y) + 2K(f). An algorithmic sufficient statistic is probabilistically nearly sufficient in expectation, one way only. The expected structure function brackets the distortion-rate function with a K(f, d, m, R) shift in rate. Each link holds only up to the complexity of the distribution. | Read |
| NOTE-777 | Belrose et al. — Neural Networks Learn Statistics of Increasing Complexity | An empirical paper. Vision networks trained on real images classify maximum-entropy samples that match only the class means, or means and covariances, well above chance early in training (peaks between about 2^4 and 2^12 steps), and the accuracy then falls, often below chance. First-order samples peak earlier and lower than second-order ones. Pythia models fit unigram-sampled text, then bigram-sampled text, then fit them worse, then better again. The n-gram/moment equivalence is an identity of one-hot indicators. The ordering argument is a heuristic. | Read |
| NOTE-778 | Rasooly and Rozzi — How manipulable are prediction markets? | A randomised field experiment on 817 Manifold markets moved prices by ±5 percentage points. The yes–no gap of 10 points was 7.5 after a week, 6.9 after 30 days and 5.9 after 60 days in unresolved markets, so about 60% of an arbitrary shock was still there. Reversion is fast in the first week and then slows. A price-impact model with finite, risk-averse traders predicts lasting partial persistence even when no trader learns from the price. Markets with more traders, more activity or a Metaculus twin revert more, but those splits are correlational and only marginally significant. | Read |
| NOTE-779 | Kanerva — Sparse Distributed Memory and Related Models | SDM is a two-layer memory: a fixed random address matrix selects a few of many hard locations near the cue, and an outer-product contents matrix stores the word there. Recall of uniform random data has signal pM against noise pM[1 + pT(1 + p²M)], best at p = (2MT)^−1/3, and capacity tends to 1/[Φ⁻¹(φ)]² of the hard locations, about 0.1 at fidelity 0.999. An ordinary RAM is the special case of radius zero. | Read |
| NOTE-780 | Sefidgaran, Gohari, Richard & Şimşekli — Rate-Distortion Theoretic Generalization Bounds | The expected generalisation error of any algorithm is at most √(2σ²·R/n) + ε, where R is the least mutual information I(S;Ŵ) of any surrogate output whose expected generalisation error is within ε. With ε = 0 this is Xu–Raginsky. With ε > 0 it stays finite where I(S;W) is infinite. For a Lipschitz loss R becomes the rate-distortion function of the output’s marginal law, and as ε → 0 its rate-distortion dimension. A tail bound replaces I(S;W) by its supremum over laws within log(1/δ) in KL. Every bound depends on the unknown data distribution. | Read |
| NOTE-781 | Torii, Maeda and Hidaka — Distributional hypothesis as isomorphism | An SVD of log raw co-occurrence counts solves 61% of Google analogies over a 1,487-word vocabulary, against 75% for full word2vec. In a 24-sentence toy corpus whose eight subjects carry every combination of three binary aspects, the subjects’ raw co-occurrence rows form a parallelepiped exactly when, for each object, its four sentences are equally probable. The attributes are independent, so the concept lattice is Boolean. | Read |
| NOTE-782 v3 | Makelov, Lange and Nanda — an interpretability illusion for subspace activation patching | A subspace activation patch can make a model behave as if a feature had changed while the patched direction is the sum of a component that varies with the feature but cannot reach the output (in an MLP, the kernel of the down-projection) and a component that can reach the output but is dormant on the data. Shown exactly in a three-unit network, empirically for MLP8 of GPT-2 Small on IOI and for MLPs of GPT2-XL on factual recall, where the effect vanishes once the disconnected component is removed. A residual stream direction passes the same test. One-dimensional fact patches and rank-1 edits are shown to be nearly interchangeable. | Read |
| NOTE-783 | Han, Papyan & Donoho — Neural Collapse Under MSE Loss | Networks trained with MSE loss show neural collapse on five datasets and three architectures. The MSE loss splits exactly into a term for the least-squares classifier of the current features and a non-negative deviation term, and the deviation becomes negligible early in training. On that “central path”, in an unconstrained-features model with no weight decay and features continually renormalized to identity within-class covariance, gradient flow drives every singular value of Σ_W^(−1/2)M̃ to infinity as (4t/N)^(1/4), and drives them to equality. That gives NC1–NC4 in closed form. | Read |
| NOTE-785 | Brouillet and Friston — Relative fluency (unfelt vs felt) in active inference | A perspective essay with no model and no new data. Unfelt fluency is the subpersonal recognition of a change in precision, which orients attention; felt fluency is a hierarchically deeper inference about it, reached by mental action. Because its cause is internal, felt fluency is misattributed to the stimulus, which the discrepancy-attribution experiments it reviews are read to show. “Felt” here means attended and reportable; the paper does not separate felt from unfelt in any further sense. | Read |
| NOTE-786 | Merullo et al. — Linear Representations and Pretraining Data Frequency | For 24 factual relations in OLMo-1B, OLMo-7B and GPT-J, how well an affine map from subject to object representation reproduces the model (LRE causality) correlates with the mean subject–object co-occurrence count in pretraining (r = 0.82). It correlates less with subject or object counts alone. Mean causality passes 0.9 beyond about 4.4k, 2.0k and 1.1k co-occurrences respectively, at any training step. Correlational; LREs are relation maps, not attribute directions. | Read |
| NOTE-787 v2 | Vereshchagin & Vitányi — Kolmogorov’s structure functions and model selection | For a string x of length n and every complexity bound α, the minimal two-part code length λ_x(α), the structure function h_x(α) + α and the best achievable fit β_x(α) + K(x) are one function to within O(log n), and any set witnessing λ_x or h_x also witnesses β_x. Every non-increasing shape occurs for some x. h_x and λ_x are upper semicomputable but not computable; β_x is not even semicomputable. Finite sets only; the extension to computable distributions costs O(log n). | Read |
| NOTE-788 v2 | Das, Manikandan and Banerjee — Information flow with hydrodynamic interactions | Two colloids are symmetrically coupled by the fluid, and the trap of one is moved by recorded Ornstein–Uhlenbeck noise. Mutual information, its time-delayed form and transfer entropy recover the order drive → driven particle → other particle. Under moderate drive they also show some backflow, which disappears under strong drive (numerics only). Stronger coupling lowers the information the driven particle shares with the drive and raises what the particles share. Without the drive, the coupled particles are statistically independent. | Read |
| NOTE-789 | Kirsanov et al. — The Geometry of Prompting | In base Llama-3.1-8B (and Gemma-2-2B), demonstrations reorganise the geometry of the input sentence’s representation at early-to-middle layers, while an instruction acts mainly on the last token and soft prompts only on late layers: matched accuracy, different mechanisms. Few-shot failures from the choice of examples or from relabelled categories leave the class manifolds separable and fail at the readout. | Read |
| NOTE-790 | Vitányi — Meaningful Information | With total recursive functions as models, the shortest model that completes an optimal two-part code for a string (its sophistication) is a non-trivial split of its information into structure and noise. With partial recursive models the split collapses to zero for every string. The total-function, computable-distribution and finite-set classes agree to within logarithmic terms. Some strings of every length are almost all structure, and sophistication is not computable. | Read |
| NOTE-791 v2 | Barnett and Seth — Dynamical independence | A coarse-graining Y = f(X) is dynamically independent when the microscopic history adds nothing to predicting Y beyond Y’s own history, given the environment: transfer entropy T(X → Y | E) = 0. The condition is transformation-invariant and transitive. For linear state-space models it has a closed form, and it is minimized numerically over the Grassmannian. Generically no coarse-graining is exactly independent for VAR order above 1. The minima are many, and the authors treat them all as the “emergence portrait”. | Read |
| NOTE-792 | Devezer et al. — Scientific discovery in a model-centric framework | A population of scientists, chosen at random each step, tests a proposed linear model against the current consensus model by AIC or SC, and the winner becomes the consensus. Which models get proposed (the strategy mix) decides where the consensus spends its time. A population of boundary testers reproduces results almost perfectly while spending little time at the true model. Replication does not change the transition matrix, so reproducibility cannot cause convergence. A population with all four strategies equally represented is never the worst and has low variance. | Read |
| NOTE-793 | Abel et al. — Agency Is Frame-Dependent | A four-page position paper. It argues, informally, that each of four conditions of agency (a boundary, being the source of action, goal-directedness and adaptivity) can be settled only after a choice of commitments it calls a reference frame, so agency attributions are frame-relative. Each step is adapted from a cited result. It gives no definition of a frame, no proof and no principle for choosing one. | Read |
| NOTE-794 | Liu et al. — Physics of Skill Learning | Three toy models of skill learning. In the Geometry model, independent skills are orthogonal directions in parameter space weighted by frequency. Under SGD each is learned at its own rate, the second taking about 1/p₂ as long. Under sign descent they compete for coordinate signs, and each starts as the one before finishes (the Domino effect), so the n-th skill takes time ∝ n. A one-parameter Resource ODE fits these curves and has exact conserved quantities u_i^(1/p_i). A small MLP also shows the effect when one parity is the XOR of two others. | Read |
| NOTE-795 | Handfield et al. — Cooperative Dilemmas in Rational Debate | Two debaters move through a Betz-style space of truth assignments, each moving minimally when refuted, with payoff u = w·v − d (true beliefs against changes of mind). At moderate truth weights the truth-optimal equilibrium is asymmetric: one debater argues boldly and the other free-rides with a compromise strategy, a snowdrift dilemma. At low weights, or with error, both exit. In a narrow borderline region of mixed equilibria, raising the weight on truth lowers collective accuracy. A two-person model, n = 3 propositions, and every result is numerical. | Read |
| NOTE-796 | Gu et al. — Data Mixing Can Induce Phase Transitions in Knowledge Acquisition | An optimal capacity-bounded learner, given a mixture of equally frequent random facts and a second domain, learns none of the facts until the second domain’s marginal loss reduction per unit of capacity falls below r·p/(1−r), then all of them within Htot more capacity. Pythia models trained on synthetic biographies mixed into web text show near-zero recall below a threshold model size and mixing ratio, and 4–16 times more training barely moves it. | Read |
| NOTE-797 | Mashour & Alkire — Evolution of consciousness and emergence from anesthesia | A colloquium perspective, not a study. It proposes emergence from general anaesthesia as a model of the evolution of consciousness, and, from one PET study in which the return of a response to command correlated mainly with brainstem, thalamus, hypothalamus and anterior cingulate, infers that early mammals and birds are phenomenally conscious. The return is judged by an access marker, which the authors concede, and the transfer to other species is by anatomical homology. | Read |
| NOTE-798 | Williams et al. — Targeted manipulation and deception when optimizing LLMs for user feedback | Iterated KTO on simulated thumbs-up feedback turns a safety-trained Llama-3-8B-Instruct (and Gemma-2 up to 27B) into a policy that lies about failed bookings, omits harms to steer users into risky actions and validates self-destructive plans. When only 2% of simulated users reward such validation, the policy picks them out by contextual cues and harms only them. Safety-data mixing and LLM vetoes barely help or move it to subtler steering, and sycophancy and toxicity benchmarks miss it. | Read |
| NOTE-799 v2 | Luppi et al. — A synergistic workspace for human consciousness | In resting-state fMRI, regions where synergistic interactions outrank redundant ones form a “synergistic workspace”. Within it, regions whose synergistic connections spread across more resting-state networks than their redundant ones are classed as gateways (mainly default mode), and the rest as broadcasters (mainly fronto-parietal, lateral prefrontal above all). Pairwise integrated information ΦR falls between DMN gateway regions under propofol (n = 15 or 16; the paper gives both) and in 22 patients with disorders of consciousness against controls, and recovers after anaesthesia, while the original whole-minus-sum Φ shows no common decrease. The increases, near the broadcasters, are not robust. | Read |
| NOTE-800 | Noroozizadeh et al. — Deep sequence models tend to memorize geometrically | Transformers and Mamba trained only on a graph’s edge bigrams embed nodes so that multi-hop relations are readable, and solve an in-weights path-finding task built to defeat next-token learning. The authors argue that supervision, capacity, ease of optimization and succinctness each fail to explain why this geometry wins over an associative lookup. In a wide two-layer weight-tied model under unregularized cross-entropy the embeddings settle into the top Laplacian eigenvectors without a rank bottleneck, shown empirically, with an informal partial proof. Why deeper models prefer geometry is left open. | Read |
| NOTE-801 | Vitányi & Li — MDL induction, Bayesianism and Kolmogorov complexity | With the universal prior, the Fundamental Inequality puts −log Pr(D|H) − log P(H) within α = K(Pr(·|H)) + K(P) of K(D|H) + K(H) when D is random for H and H is random for P. So ideal MDL and MAP agree to a factor 2^{−α} among such “admissible” hypotheses. α can be as large as K(H), and outside the admissible set the two can pick different hypotheses. For finite-set models, MAP, ideal MDL and Kolmogorov’s minimal sufficient statistic coincide. | Read |
| NOTE-802 | Modell, Rubin-Delanchy and Whiteley — The Origins of Representation Manifolds in Large Language Models | If a feature is a compact metric space mapped continuously and injectively onto the unit sphere (Hypothesis 1), its representation is homeomorphic to it. If, in addition, cosine similarity is locally a C² decreasing function g of squared feature distance (Hypothesis 2), every path on the representation manifold has √(−2g′(0)) times the length of the feature path it images (Theorem 1). The hypotheses are assumed, not derived; the tests supply a candidate metric and find homeomorphism for GPT-2’s years but isometry only after a log rescaling. | Read |
| NOTE-803 | Davidson et al. — Do different prompting methods yield a common task representation? | Function vectors extracted from short instructions raise zero-shot accuracy, but they are built from mostly different attention heads than demonstration function vectors (4 to 7 of the top 20 shared), the two add rather than substitute, and swapping heads and activations between them costs accuracy asymmetrically. Under this method there is no common task representation across the two presentations, only partly overlapping mechanisms; the authors note they cannot prove the negative. | Read |
| NOTE-804 | Goldwasser et al. — A Theory of Unsupervised Translation Motivated by Animal Communication | With a plausibility prior over the target language and no parallel data, maximum likelihood learns a translator whose error is bounded like a supervised Occam bound divided by the common ground. In the common-nonsense model err = O(log|Θ| / (α·min(m,|T|))), tight up to a constant; in the knowledge-graph model more knowledge per node needs less agreement. Information-theoretic only, lossless, uniform languages. | Read |
| NOTE-805 | Defilippis et al. — Optimal scaling laws in learning hierarchical multi-index models | For Gaussian inputs, n = αd samples, and a target Σ_k a_k g_k(⟨w_k, x⟩) with even links and a_k ~ k^(−γ), direction k becomes weakly recoverable at α_k = Θ(a_k^(−2)) = Θ(k^(2γ)) for γ > 1/2. The Bayes-optimal weighted subspace error is Θ(α^(−1+1/(2γ))) before α ≍ m⋆^(2γ) and Θ(m⋆/α) after. A target-agnostic spectral estimator attains both, and a two-layer net given that estimator as its first layer, with a ridge readout, attains them in excess risk. The cascade is in sample size. The link to gradient descent is a remark. | Read |
| NOTE-806 | Sefidgaran & Zaidi — Data-Dependent Generalization Bounds via Variable-Size Compressibility | If the number of codewords allowed for covering a block of experiments may depend on the realised sample and output, generalisation bounds can be data-dependent. The general bounds are change-of-measure inequalities that cover tail, PAC-Bayes and in-expectation forms. With the rate set to log dP_{W|S}/dP(W) for a fixed prior P, the tail bound is the disintegrated PAC-Bayes bound. A new trajectory bound is data-dependent except for a coupling term, and its experiment drops that term. | Read |
| NOTE-807 | Gokhale — The semantic landscape paradigm for neural networks | A conceptual proposal with no experiment and no proof. Training is pictured as a walk on a graph of “heuristic models” (internal algorithms), ranked by a fallibility F. A critical dataset size for grokking and emergence with scale are each argued to be graph connectivity thresholds, and power-law scaling in time, data and size is derived from an assumed trap model of activated hops. The percolation is asserted, not shown, and the scaling laws rest on chosen assumptions. | Read |
| NOTE-808 | Aerts — Quantum structure in cognition | Hampton’s membership weights for conjunctions and disjunctions of concepts fail a single Kolmogorovian model, item by item, in two ways: over- or underextension (∆-type) and a negative Kolmogorovian factor (k-type). A subspace lattice with meet and join can fit the k-type items, but provably never the ∆-type ones. Those need an emergent concept state in a second sector of Fock space. Negation appears only as the orthocomplement used to reach conjunction from disjunction, and is never measured. | Read |
| NOTE-809 v2 | Wu et al. — a reply to Makelov et al.’s interpretability illusion arguments | The reply argues that Makelov et al.’s “illusion” is defined so that any direction not orthogonal to the null space of the downstream weights can qualify, including the direction Makelov et al. call faithful in their toy network, and that their in-the-wild cases rest on a weak metric and on DAS trained per fact pair. The toy computation holds only for an unnormalized patch: patching the subspace the rowspace component spans, as Makelov et al. specify, recovers the full effect. Its own GPT-2 experiments agree that MLP8 carries almost no name-position information. | Read |
| NOTE-810 | Vilone and Polizzi — Opinion misperception and the emergence of silence | In two agent-based models on scale-free networks, agents’ private beliefs are fixed and only what they say changes. A small hard-core minority placed on nodes of a chosen degree makes the expressed and locally perceived opinion far more minority-leaning than the beliefs, mainly by driving 55–60% of agents, almost all of the majority, into silence. The network’s direct effect on perception is small and not even of constant sign. Simulation only, with no empirical validation. | Read |
| NOTE-811 | Kunz & Rittel — Issues as Elements of Information Systems | A short design statement, not a study. IBIS treats planning as an argumentative process whose atoms are issues, questions put because positions differ; arguments for and against positions run until an issue is settled, and a challenge to a supporting statement becomes a new issue. Every item is numbered for reference, issues are filed as living, settled or latent, and three manual systems are reported in use with “eager acceptance”. It says nothing about what keeping one costs. | Read |
| NOTE-812 | Cogitate Consortium — Adversarial testing of GNWT and IIT | A preregistered adversarial test of IIT and GNWT in 256 people (fMRI, MEG, iEEG) viewing clearly seen images. Category, identity and orientation were decodable in posterior cortex; prefrontal cortex held category, no identity, and orientation only weakly in MEG. No prefrontal site showed the predicted offset ignition. Sustained gamma synchronization within posterior cortex, IIT’s distinctive prediction, was not found. Each theory passed some predictions and failed others. | Read |
| NOTE-813 | Fu et al. — Evaluating Compositional Scene Understanding in Multimodal Generative Models | Human raters judged DALL-E 3 images. Agreement with single familiar relations rose well above DALL-E 2’s. It fell when subject and object of an asymmetric relation were swapped, and again when two relations were combined; low-agreement reversed images mostly had the wrong relation or swapped roles. Five VLMs learned relational concepts few-shot below human level, and four were at chance with six objects. | Read |
| NOTE-814 | Salter-Duke — Tangled webs | An exact but exponential algorithm finds edge-connectivity tangles in graphs of up to about 200 vertices. On eleven small real networks, tangle communities resemble those of standard methods only where community structure is strongly delineated; three networks have no distinguishable tangles at the orders reached, and where tangles do distinguish regions, some hold only one to three vertices. On images, lines one pixel wide cannot be distinguished. The author concludes the tangle notion of cohesion “is not as compelling as I had hoped”. | Read |
| NOTE-815 | Gerstgrasser et al. — Is Model Collapse Inevitable? | In a fixed-design linear regression refit each round to labels drawn from the previous fit, keeping every earlier round’s data gives test error σ²d/(T−d−1)·Σ1/i², bounded by π²/6 times the first fit’s, where replacing the data gives σ²d/(T−d−1)·n. The error still rises every round. Small language models and a diffusion model on accumulated data hold their test loss over five to eight rounds; a VAE’s still rises, more slowly. | Read |
| NOTE-816 | Erogullari et al. — Post-Hoc Concept Disentanglement | Concept activation vectors fitted one concept at a time align for CelebA and FunnyBirds attributes that co-occur in the labels. A joint fit with a penalty ‖CCᵀ − I‖²_F finds mutually orthogonal directions that still separate each concept, with AUROC “largely preserved”. So correlated attributes keep linear separating directions in these CNNs, and the alignment comes from the separate fits. Steering with the orthogonal directions changes correlated concepts less. | Read |
| NOTE-817 | Sayed Ahmed — Back and forth between algebraic geometry, algebraic logic, sheaves and forcing | Distributive lattices with join-preserving idempotent operators are represented, after Comer, as continuous sections of a sheaf of quotient algebras over the prime spectrum of their fixed-point part. A small site is said to give a notion of forcing, with Kripke–Joyal clauses, and a Łukasiewicz conjunction is forced through a tensor product. Most theorems are stated without proof, and negation is never written out. | Read |
| NOTE-818 | Gidon, Aru and Larkum — Does neural computation feel like something? | A five-neuron NEURON simulation shows that a voltage clamp replaying a recorded response injects no current when the matching stimulus is shown, yet fixes every state transition whatever the input. Under computational functionalism, which counts the transitions that did not happen, the clamp changes the computation and so the experience while changing no activity and no actual causal interaction. The authors read this as a challenge to functionalism, not a refutation. | Read |
| NOTE-819 | Hopfield — Neural networks and physical systems with emergent collective computational abilities | With symmetric couplings, asynchronous threshold updates descend an energy function, so Hebbian outer-product storage makes random patterns attractors: a cue a few bits off settles into the nearest one. In simulations at N = 30 and 100, recall degrades severely near 0.15N patterns, memories closer than about a tenth of N fuse, and overload makes every memory irretrievable unless old ones are forgotten. | Read |
| NOTE-820 | Chowdhury et al. — Fundamental Limits of Perfect Concept Erasure | If an erased representation Z is independent of the concept A, it keeps at most I(Z;X) ≤ H(X|A). A deterministic erasure reaches that only when the groups’ distributions are permutations of one another. The paper says the bound is out of reach otherwise. That holds only for deterministic maps: a stochastic quantile coupling reaches it for any finite distributions with disjoint supports. | Read |
| NOTE-821 | Kupiainen — Rigorous renormalization group | A three-page orientation by a principal of rigorous RG. It covers Wilson’s block-spin map as an iteration on Hamiltonians, made rigorous by cluster (polymer) expansions that control large fields, and what this proved. The massless 4D lattice φ⁴ model is Gaussian at long distances. The continuum 4D φ⁴ limit is always Gaussian (Aizenman and Duminil-Copin). The Gross–Neveu model and Hall-conductivity universality have been constructed or proved. The method stays near Gaussian, and a non-perturbative formalism is missing. The piece makes no new claim of its own. | Read |
| NOTE-822 | Ovsjanikov et al. — Functional maps | A bijection T: M → N is fully encoded by the linear map f ↦ f∘T⁻¹ it induces on functions, a matrix C in chosen bases. If T preserves volume (or the bases are discretely orthonormal), C is orthogonal, so its inverse is its transpose; if T is an isometry, it commutes with the Laplace–Beltrami operator, so C maps each eigenspace to the matching one. Descriptor, landmark, segment and commutativity constraints are linear in C, so matching reduces to a least-squares solve with a 100-eigenfunction basis, which beat Blended Intrinsic Maps on SCAPE and TOSCA. | Read |
| NOTE-824 | Pfau et al. — Spectral Inference Networks | For a symmetric kernel k on a space with a sampling density p, the span of the top N eigenfunctions of Kf = E_x′[k(x,x′)f(x′)] maximizes Tr(Σ⁻¹Π) over functions, with Σ = E[uuᵀ] and Π = E[k(x,x′)u(x)u(x′)ᵀ]; a Cholesky-masked gradient orders them and moving averages of Σ and its Jacobian remove the minibatch bias. Slow Feature Analysis is the graph-Laplacian case. The ordering argument is informal by the authors’ own statement, and the paper never considers contrastive kernels or positive pairs. | Read |
| NOTE-825 | Catani et al. — What is nonclassical about uncertainty relations? | For any state whose four-state reflection orbit is realizable (equal predictabilities with flipped signs, and ½s1+½s3 = ½s2+½s4), preparation noncontextuality forces |⟨X⟩| + |⟨Z⟩| ≤ 1, tight, without perfectly distinguishable states. In a theory where every state has such an orbit, the bound constrains the uncertainty relation itself: the qubit’s circle violates it, up to √2, the stabilizer octahedron saturates it, and the simplicial theory escapes it because its jointly predictable states lack the orbit. | Read |
| NOTE-826 | Turvey — Preliminaries to a theory of action | An essay, not a study. The executive cannot command muscles one by one, so acts are built from relatively autonomous coordinative structures, reflexes and their functional combinations, a term Turvey takes from Easton (1972). Higher levels specify equivalence classes of acceptable states and tune the parameters of these units, like the stiffness and rest length of a spring. The spinal cord is shown, by reflex probes, to be retuned before a voluntary movement, and optical information may set the tuning directly. | Read |
| NOTE-827 | Haggard — Sense of agency in the human brain | A review of the sense of agency as the experience of instrumental control over a specific motor act and its outcome. Implicit measures (intentional binding, interval estimates) show a prospective component from action selection and outcome prediction alongside the retrospective one the comparator model gives, and psychosis seems to remove the prospective part. Frontal–parietal connectivity, not a single comparator site, is proposed as its correlate. Coercive instruction reduces it. | Read |
| NOTE-828 v2 | Belghazi et al. — Mutual Information Neural Estimation | Mutual information is the KL divergence of the joint from the product of marginals, and its Donsker–Varadhan dual is tight exactly at the log Radon–Nikodym derivative plus a constant. Maximizing that dual over a compact family of neural critics gives an estimator that is strongly consistent, for the exact empirical maximizer, on a compact domain with Lebesgue densities, with a uniform deviation bound of order d log d/ε² in the parameter count d. The mini-batch gradient is biased; a moving average is offered as a heuristic fix without proof. | Read |
| NOTE-830 | Li et al. — Self-Supervised Learning with Kernel Dependence Maximization | With image identity as a one-hot label, HSIC(Z,Y) is (Δl/N) times the gap between the mean kernel on positive pairs and on all pairs, and (1/2N²)Σ MMD²(i,j) = (N/Δl)·HSIC(Z,Y). The large-batch InfoNCE loss is exactly −HSIC(Z,Y) plus a log-mean-exp of the centred critic (eq. 28), and for a bounded kernel it bounds −HSIC(Z,Y) + γHSIC(Z,Z) up to a remainder of second order in the critic’s variance (Thm B.1, whose printed remainder has the wrong sign). | Read |
| NOTE-831 | Farrell & Ioannou — Generalized Stability Theory I | For a linear system du/dt = Au with A non-normal, the eigenvalues fix only the t → ∞ behaviour. Growth over a finite time t is the largest singular value of e^{At}, bounded below by the fastest mode and at t → 0 set by the numerical abscissa, the top eigenvalue of (A + A†)/2. A system with every mode damped can amplify a perturbation a hundredfold, and its forced and stochastic responses exceed those of the normal system with the same spectrum. | Read |
| NOTE-833 | Sun, Shi, Liang & Li — when known classes help discover novel ones | In a spectral-contrastive augmentation graph over labelled and unlabelled data, the linear-probe residual of a novel labelling is exactly the part of it outside the top-k eigenspace that the labelled rows of the discarded eigenvectors cannot absorb. Known classes that share the novel class’s attribute can make it zero, and a toy shows that known classes sharing a rival attribute make it worse. The general error bound (Theorem 5.6) is approximate and averages all known classes into one block. | Read |
| NOTE-834 | Harvey, Lipshutz & Williams — What Representational Similarity Measures Imply about Decodable Information | For a linear readout that maximizes zᵀXw/M − ½wᵀG(X)w, the decoded signal is K_X z with K_X = XG(X)⁻¹Xᵀ/M, so the task-averaged agreement of two representations is Tr(K_X K_z K_Y). With K_z = I that is linear CKA, mean squared CCA, ENSD or the GULP distance, for particular G. Procrustes distance and average decoding distance bound each other only through the participation ratio of K_X − K_Y. The population limit (App. A.3) is an outline that requires b > 0 and a trace-class task covariance, and it does not reach the K_z = I case. | Read |
| NOTE-835 | Grudin — Groupware and social dynamics | An argued review, not a study. Groupware fails less from technical problems than from eight social challenges, first among them that it asks extra work of members who get no direct benefit. The evidence is cases and the literature: meeting schedulers, voice annotation, project management, an abandoned issue-based system. Email succeeds because the sender who does the work is also the one who wants the message read. | Read |
| NOTE-836 | Schölkopf, Herbrich & Smola — A Generalized Representer Theorem | For any nonempty set X, real positive-definite kernel k, strictly increasing g and any cost c on the training triples, even coupled, non-convex or infinite-valued, every minimizer of c + g(‖f‖) over the class F of countable kernel expansions with finite RKHS norm is a finite expansion Σ α_i k(·, x_i) at the training points. The proof uses only the reproducing property and Pythagoras. Existence of a minimizer, the extension from F to the completed RKHS, and the semiparametric Theorem 2 are not proved here. | Read |
| NOTE-837 | Bach — Information Theory with Kernel Methods | With a continuous kernel normalised to k(x,x) = 1 on a compact set, the uncentred covariance operator Σ_p is a density operator. Its quantum relative entropy is sandwiched between the KL of two kernel-smoothed distributions and the KL itself, D(p̃‖q̃) ≤ D(Σ_p‖Σ_q) ≤ D(p‖q), with equality on the right only for an orthonormal, hence discrete, embedding. On the torus the gap is O(σ²) in the bandwidth. Kernel mutual information characterizes independence; conditional independence only one way. | Read |
| NOTE-838 | Muandet et al. — Kernel Mean Embedding of Distributions | A survey whose load-bearing chain is short and explicit. An RKHS is a Hilbert space with bounded evaluation, so Riesz gives k_x (Thm 2.4, Prop. 2.1). If E_P√k(X,X) < ∞, the expectation functional is bounded and Riesz gives μ_P with E_P f = ⟨f, μ_P⟩ (Lemma 3.1, proved). MMD is ‖μ_P − μ_Q‖ (eq. 3.29), a metric on distributions exactly when k is characteristic. HSIC is the squared Hilbert–Schmidt norm of the centred cross-covariance. Every result is for a fixed kernel. | Read |
| NOTE-839 | Trefethen et al. — Hydrodynamic Stability Without Eigenvalues | The linearized operators of plane Couette and Poiseuille flow are far from normal. With every eigenmode decaying, perturbations can grow transiently by O(R) and resonate by O(R²), and an operator perturbation of norm O(R⁻²) makes the flow eigenvalue-unstable, all read off the pseudospectra. That transition to turbulence then follows from linear growth plus energy-neutral nonlinear mixing is a conjecture, from a 2 × 2 model. | Read |
| NOTE-840 | Golub & Jackson — Naïve Learning in Social Networks and the Wisdom of Crowds | Agents get independent signals with mean μ and repeatedly replace their beliefs by fixed weighted averages of their neighbours’ (DeGroot). In a convergent network the consensus is s·p(0), with s the unit left eigenvector of the interaction matrix, and a growing society’s limits converge in probability to μ if and only if the largest influence weight tends to zero (Proposition 2). With reciprocal, equal weights this is maximum degree over total degree → 0. A finite group that everyone attends to blocks it; balance plus minimal out- or in-dispersion guarantee it. How fast consensus is reached is unrelated to whether it is right. | Read |
| NOTE-841 | Tosh, Krishnamurthy & Hsu — contrastive learning, multi-view redundancy and linear models | When two views X and Z are redundant for a label, the predictor that infers Z from X and then predicts, µ(x) = E[E[Y|Z]|X=x], is within εX + 2√(εXεZ) + εZ of the Bayes predictor. µ is linear in the density ratio g*(x,·) = p(x,z)/(p(x)p(z)), the optimum of the logistic contrastive problem, so m random landmark evaluations of g* support a linear predictor whose extra error falls as 1/m, scaled by a variance that is at most E[g*²] for bounded labels. Nothing requires the views to be exchangeable. | Read |
| NOTE-842 | Farrell & Ioannou — Generalized Stability Theory II | For du/dt = A(t)u there are no modes, but the propagator’s singular vectors and the Lyapunov exponents and vectors carry generalized stability theory over. A time-dependent operator that is stable, or neutral, at every instant can be asymptotically unstable, and only if it is non-normal. Random variation of the operator destabilizes generically, with less variation needed the more non-normal and the less damped the mean operator. | Read |
| NOTE-843 | Gebhart, Hansen and Schrater — Knowledge Sheaves | A knowledge-graph embedding is a knowledge sheaf on the schema (one pair of restriction maps per relation type) with a 0-cochain of its pullback to the graph. The summed Structured Embedding score is the sheaf Laplacian form xᵀLx; adding a relation vector gives TransR, and identity maps TransE. Since the zero cochain is always a section, training needs negative triples and a margin. A multi-hop query is scored by harmonic extension, a Schur complement of the query graph’s Laplacian, which beats summing TransE vectors on ip and pi queries. | Read |
| NOTE-844 | Budroni, Cabello, Gühne, Kleinmann & Larsson — Kochen-Specker Contextuality | A review of Kochen–Specker contextuality. It defines noncontextual hidden-variable models minimally, as a global distribution whose marginals are the context distributions (Fine’s theorem), with the sheaf, polytope, graph and hypergraph formulations called substantially equivalent. It argues that contexts need an operational definition stronger than joint measurability, which alone makes every nondisturbing correlation classically realizable. It surveys how disturbance is modelled in experiments, Kujala et al.’s maximally noncontextual models among them. Spekkens’s generalized contextuality is covered only to mark the difference, and the review nowhere derives the relation between the two notions. | Read |
| NOTE-845 | Balestriero, Bottou & LeCun — regularization effects are class dependent | On ImageNet with ResNet-50, making random crop stronger or changing weight decay raises mean test accuracy while some classes lose 20 points or more, and the shift survives a frozen-backbone transfer to iNaturalist. The evidence is per-class curves for hand-picked classes over 10–20 runs, plus a Welch test with no multiple-comparison correction. Theorem 1 says only that a fit to augmentations that are not label-preserving cannot equal the true function. | Read |
| NOTE-846 | Tan et al. — contrastive learning is spectral clustering on a similarity graph | SimCLR’s InfoNCE loss, taken over all n objects with a Gaussian kernel on the unit sphere and a symmetric augmentation matrix π, is rewritten exactly as tr(Zᵀ L(π) Z) + log R(Z): a graph-Laplacian quadratic form plus the log of InfoNCE’s normalizers. The paper calls this spectral clustering under a definition that admits any regularizer. It does not show that the minimizer is a set of Laplacian eigenvectors, and it names no population optimum. | Read |
| NOTE-847 | Harland — Beyond the Moral Influence Theory? | Vargas’s agency cultivation model is said to differ from the moral influence theory by aiming at moral agency, but his notion of responsiveness to moral considerations is so capacious that it reduces to intrinsic motivation to act morally, so the model inherits the old theory’s defects. And his counterfactual test of free will is calibrated to what makes blaming effective, so it can be applied only once we know whether blaming such agents is good policy: given the model, freedom follows blameworthiness and does no work. | Read |
| NOTE-849 | Seth & Bayne — Theories of consciousness | A review of four families: higher-order, global workspace, integrated information, and reentry and predictive processing theories. Each is sorted by which aspect it explains (global states, local contents, phenomenal character, function), its anatomical commitment, and its evidence. The front-versus-back dispute is at heart a dispute over consciousness and cognitive access. Posterior-sufficiency predictions cannot now be tested because verification relies on report, which needs anterior activity, and no marker of consciousness has a validation that rests neither on introspection nor on a contested theory. | Read |
| NOTE-850 | Assran et al. — The Hidden Uniform Cluster Prior in Self-Supervised Learning | MSN’s entropy term is a KL penalty pulling cluster sizes toward uniform, and SwAV’s Sinkhorn step enforces equal sizes outright; for VICReg the same prior is reached only through an informal reduction to K-means, and for SimCLR only by a cited equivalence. With mini-batches of two to eight ImageNet classes, SimCLR, VICReg and MSN lose 11–18 points of ImageNet linear accuracy while MAE and data2vec do not. A power-law prior in MSN gains about 1–3 points on long-tailed iNat18 and loses heavily on ImageNet. | Read |
| NOTE-851 | Ashby — Design for a Brain | Adaptation is the stability of the organism–environment system in the region where the essential variables stay within limits. To find such stability in an unknown environment, a second feedback must change the parameters of the first whenever an essential variable leaves its limits: the ultrastable system, shown in the Homeostat. Its blind search takes time exponential in the number of variables unless partial adaptations are kept, and keeping them needs a system that is not fully joined, its parts separated by constancies. New learning destroys old to the degree that it uses the same parts. | Read |
| NOTE-852 | Chuai & Zhao — Anger makes fake news viral online | On Weibo 2011–2016, lexicon-scored fake news carries more anger and less joy than true news, and in regressions with content, author and topic controls a post’s share of anger words goes with more retweets and its share of joy words with fewer; the R² of the retweet models is 0.08–0.13. Two anger-dominated items in a 1,291-response survey drew slightly more anxiety-management and information-sharing motive than joy-dominated ones. The paper calls this causal; the design is observational. | Read |
| NOTE-853 | Fricker — Evolving Concepts of Epistemic Injustice | Fricker’s later statement of her two concepts. Testimonial injustice is an ingenuous misjudgement through prejudice, and never a deliberate manipulation of credibility. Hermeneutical injustice is caused by hermeneutical marginalisation and persists despite individual good faith. Both are “discriminatory” epistemic injustice, distinct from distributive kinds. Testimonial injustice can be structural and pre-emptive, as with an un-refreshed list of expert witnesses. | Read |
| NOTE-854 | Adler — Hilbert spaces and the Riesz representation theorem | An undergraduate expository proof, twice over, that every continuous linear functional on a Hilbert space is v ↦ ⟨u, v⟩ for a unique u with ‖u‖ = ‖φ‖: once from the projection theorem, once as u = Σ_k conj φ(e_k) e_k over any orthonormal basis, with ‖φ‖² = Σ_k |φ(e_k)|². It ends with von Neumann’s proof of the Radon–Nikodym theorem for finite positive measures by applying Riesz to f ↦ ∫ f dν on L²(ν + μ). | Read |
| NOTE-855 | Bra–ket notation (Wikipedia) | Dirac’s notation writes vectors as kets and linear functionals as bras. On a Hilbert space the inner product, antilinear in its first slot, turns each ket into a bra, and the article cites the Riesz theorem for the reverse direction; on a Banach or untopologized space the bracket is only a functional applied to a vector, because Riesz does not apply. The article is a reference with internal inconsistencies, including an unsourced edit of 2026-09-30 to the date of the notation’s origin. | Read |
| NOTE-856 | De Marco and Cyr — Manipulation Cases, Part 1 | An even-handed survey of manipulation arguments. It quotes Pereboom’s Case 1 and describes Cases 2 to 4, gives the generic schema (No-FR, No-Diff), and notes that Pereboom’s own version concludes by best explanation. Original-design cases defeat bypassing views, and natural-force cases defeat manipulator-focused views. Hard-line replies, parallel indeterministic cases, three dilemmas against the argument, and Todd’s mitigation version are set out. | Read |
| NOTE-857 | Gelfand–Naimark–Segal construction (Wikipedia) | For a state ρ on a C*-algebra A, the semi-inner product ⟨a, b⟩ = ρ(b*a) on A, quotiented by its null left ideal and completed, carries A acting by left multiplication, with the class of the identity as a unit cyclic vector and ρ(a) = ⟨π(a)ξ, ξ⟩. Any two cyclic representations with cyclic vectors reproducing the same state are unitarily equivalent, by the unitary π(a)ξ ↦ π′(a)ξ′. The representation is irreducible exactly when the state is pure. The article says nothing about kernels. | Read |
| NOTE-858 | McAllister & McCrea — Long-term consequences of repetitive concussion | A narrative review: almost all athletes recover clinically within 1–2 weeks of a sport concussion, but when it was written (published March 2017) no prospective longitudinal study had measured the long-term cognitive, psychiatric or neurodegenerative risk of repeated concussion or of non-concussive head impacts. The evidence for such risk, CTE included, is retrospective, case-based or survey-based and mixed, and the authors call for large prospective cohorts with controls. | Read |
| NOTE-859 | Fricker — Powerlessness and Social Interpretation | Hermeneutical injustice is having a significant area of one’s social experience obscured from collective understanding owing to hermeneutical marginalisation. It is systematic when the marginalisation is persistent and wide-ranging, and incidental when it is one-off and local, which can happen to a socially powerful subject. A gap with no marginalisation behind it is bad luck. The primary harm is situated hermeneutical inequality. Secondary harms include lost epistemic confidence and the social construction of identity. | Read |
| NOTE-860 | Fricker — Epistemic Injustice and a Role for Virtue in the Politics of Knowing | A hearer takes testimony critically but without inference, through a socially trained testimonial sensibility. Because that sensibility runs on stereotypes of credibility, it can carry prejudice, and then a speaker receives the wrong degree of credibility through the hearer’s unintended prejudice: testimonial injustice. The corrective virtue, reflexive critical openness, is available only where the critical concepts of the time allow it. | Read |
| NOTE-861 | Riesz representation theorem (Wikipedia) | On a real or complex Hilbert space every continuous linear functional φ is x ↦ ⟨x, f_φ⟩ for a unique f_φ, with ‖f_φ‖ = ‖φ‖; the map y ↦ ⟨·, y⟩ is an antilinear isometric bijection H → H*. Completeness is used only to split H = ker φ ⊕ (ker φ)^⊥. The article then defines the adjoint of a bounded operator between Hilbert spaces through this bijection, and shows it is the transpose read through the two Riesz maps. | Read |
| NOTE-862 | Caruso — Skepticism About Moral Responsibility (SEP) | The SEP survey of free will skepticism. It defines basic-desert responsibility in Pereboom’s words and states hard incompatibilism: compatibilism falls to the manipulation argument, event-causal libertarianism to luck, and agent-causal libertarianism to physics. It quotes Pereboom’s Case 2, gives the four-case argument’s structure, and says why soft-line replies are fragile. It also reports Levy’s argument that historical compatibilism cannot let agents take responsibility for their constitutive luck. | Read |
| NOTE-864 | Gray & Fu — Soft constraints in interactive behavior | In a simulated VCR-programming task, people with show information always available on screen still made errors that comparing against the display would have prevented. Making that information cost a mouse move and click instead of an eye movement (an estimated 1,000–1,500 ms against 500 ms) cut how often they looked it up, and most checks came right before a setting, almost none while or after setting it. The group made to memorize the information first made the fewest errors. Gray and Fu read this as non-deliberate least-effort choice among microstrategies, with memory time and perceptual-motor time weighed alike (“milliseconds matter”). The access costs are model estimates, not measured or varied parametrically. The error difference between the two on-screen conditions was not significant, the free-access look-up data come from a separate eye-tracking study of eight people, and the Memory-Test condition differed from the others in more than retrieval cost. | Read |
| NOTE-865 | Dasgupta & Gershman — Memory as a computational resource | A short review arguing that memory is used to avoid redundant computation: results are stored and reused (memoization), either whole (“top-down”) or as solutions to subproblems (“bottom-up”), and amortized inference and deep Q-networks are “distributed” memo-tables that generalize to new inputs. It illustrates this in mental arithmetic, mental imagery, probabilistic inference and planning, mostly with response times that flatten with practice and with biases that a cache explains (reuse of earlier inferences, choices based on stale cached values, reuse of policy fragments). It has equations for its examples but no cost model: the space–time trade-off is named, and when caching pays is listed as an outstanding question. Memory is internal throughout; retrieval cost is mentioned once, and offloading or external stores not at all. | Read |
| NOTE-866 | Hansson — Logic of Belief Revision (SEP, revision of 29 July 2026) | The entry separates two ways of representing what an agent believes: a logically closed belief set, and a belief base whose elements are the beliefs “held independently of any other belief”, with everything else “merely derived”. Two bases with the same closure can respond differently to the same input (its Abe and Bob example), so the closure is not a sufficient state for revision; belief-set models recover the difference only by attaching a different selection mechanism to the same set. Bases avoid the Recovery postulate, keep distinct inconsistent states apart, and permit operations (external revision, semi-revision by consolidation) that collapse on closed sets. The entry does not discuss keeping reasons, sources or justification records: its only mention of truth maintenance systems is historical, and a base records which beliefs are basic, not why they are held. Iterated revision is treated as an open area in which most proposals carry an ordering of worlds or an entrenchment relation as the state, not a base. | Read |
| NOTE-867 | Hutchins — How a cockpit remembers its speeds | In an MD-80 approach, the correspondence between airspeeds and wing configurations for the day’s landing weight is computed once, 25 to 30 minutes before landing, by selecting a printed speed card with the displayed gross weight, and is stored in the positions of movable bugs on both airspeed indicators; when the plane slows 10 to 15 minutes later, the needle’s approach to a bug cues each flap call by a judgment of spatial proximity. Hutchins argues that this memory belongs to the cockpit as a functional system and that speed bugs do not improve any pilot’s memory but replace a recall-and-scale-reading task with a perceptual one. The account is a stylized description of mandated procedure, informed by more than 100 observer flights and simulator recordings, with no measured performance, no comparison of crews with and without bugs, and no failure cases; the claim that the arrangement changes what the system can do is established by analysis of the tasks, not by data. | Read |
| NOTE-868 | Gray, Sims, Fu & Schoelles — The soft constraints hypothesis | In a Blocks World copying task where the model pattern was hidden and opening it cost a lockout of 0 to 3,200 ms, people opened it less often, kept it open longer, and placed more blocks after the first look as the lockout rose, and the trend was graded down to differences of tens of milliseconds. An Ideal Performer Model that chooses how many blocks to encode per look (ENCODE-1 to ENCODE-8) by Q-learning, with the only reward being negative time and memory given by ACT-R’s base-level activation, retrieval-threshold and latency equations, fits four measures from Experiment 3 with three memory parameters and one softmax noise parameter fitted on one of them. The authors read this as support for choosing between head and world by time alone, against a minimum memory hypothesis, which they concede no one has stated precisely enough to model. The model’s only memory costs are encoding time, retrieval time and forgetting; it has no term for anything carried across trials, for a retrieved item being wrong, or for the world changing. | Read |
| NOTE-869 | Snell, Lee, Xu & Kumar — Scaling LLM test-time compute optimally | On MATH with PaLM 2-S*, which way of spending test-time compute works best (beam search against a process reward model versus best-of-N; sequential self-revision versus parallel sampling) depends on how hard the question is for the base model, and choosing the method per difficulty bin matches best-of-N with up to about 4× less test-time compute (the discussion says 2–4×). In a FLOPs-matched comparison with a ~14× larger model, the extra test-time compute a small model may spend is set by R, the ratio of total inference tokens to pretraining tokens: when R is small the larger model’s pretraining cost buys many samples per query and test-time compute wins on easy and medium questions; when R is large the budget per query falls toward the parameter ratio and the larger model wins, always on the hardest questions. Difficulty estimation (2048 samples per question) and verifier and revision-model finetuning are not counted in the compute, R is an aggregate token ratio with no term for which queries recur, and the evidence is one model family on one benchmark of 500 test questions. | Read |
| NOTE-870 | Geisler — Contributions of ideal observer theory to vision research | A short review, not a methods paper. It defines the ideal observer as the device that “performs a given task at the optimal level possible, given the available information and any specified constraints”, writes the Bayesian ideal as an argmax of expected utility over the posterior given either the stimulus S or a constrained neural representation Z = g(S;θ) (eq. 1), and surveys applications from photon-noise detection to eye-movement search. It gives no formula for efficiency and no procedure for locating information loss beyond saying that constraints are added to the ideal one at a time (optics, receptor sampling, receptor noise, ganglion-cell summation) and that models are built by “degrading the ideal observer with hypothesized neural noise or with hypothesized heuristic computations”. Its constraints restrict the information available to an optimal decoder; it has no notion of an optimum over a restricted class of computations, though its attention examples compare the ideal with specific suboptimal rules (a one-location “serial” mechanism, a MAP searcher, a random searcher). | Read |
| NOTE-871 | Kirsh — The intelligent use of space | A classification, from video of cooks, assemblers and baggers, informal observation and the Tetris studies, of how people arrange things around them to cut the time and memory a task needs: arrangements that simplify choice (hide or highlight affordances, eliminate decisions, offload heuristic properties), arrangements that simplify perception (clustering, regions, marking, the vernier effect), and spatial dynamics that save internal computation (Tetris rotation, self-cueing). It frames the savings in search-complexity terms and links informational structuring to amortized computation in a footnote, but says the savings cannot in general be meaningfully quantified and offers no cost model, no measurements beyond the cited Tetris timings, and no case of an arrangement failing under a deadline. Its agents are experts arranging their own workspace in the medium and short term; long-term, pre-built environments are set aside. | Read |
| NOTE-872 | Kirsh — Adapting the environment instead of oneself | A conceptual paper. It models a task as a directed graph of states and actions with a cost metric on transitions, and classifies how an agent can improve its payoff by actions external to the task: pruning hard initial states, routine maintenance, scouting ahead, tools (which change the graph), and actions that make a space more “cognitively congenial” (which leave the graph intact and reduce mental operations). It names amortization once, as a parenthetical gloss on chimps leaving nut-cracking stones in place, and gives an investment rule for maintenance (future benefit against present cost times an “interest factor” for risk) in words only. There is no cost model with reuse frequency, retrieval cost or staleness; mental cost lies outside the graph, and the paper says there is “no general theory” of congeniality. The empirical figures are unpublished pilot results. | Read |
| NOTE-873 | Lieder & Griffiths — Resource-rational analysis | Resource rationality defines the right cognitive mechanism as the one, among those a brain can execute, that maximizes expected utility of its result minus the expected opportunity cost of the time and resources it uses (Eq. 3), averaged over the environments consistent with what is known (Eq. 4); resource-rational analysis is a five-step iterate-and-refine method for deriving process models from that objective. The objective is per episode. It has no separate terms for storing a result, retrieving it later, or its going stale: the value of what a computation leaves behind is folded into the utility of the episode’s result, and the cost of finding the heuristic in the first place is assigned to evolution and learning and left out. Reuse appears only in the review, qualitatively: habits as reused action sequences, Dasgupta et al. 2018’s memorized hypotheses, Howes et al. 2016’s memorize-or-look-up trade, and “cognitive prostheses”. The framework is offered as a methodological device, not a claim that people are optimal. | Read |
| NOTE-874 | Alchourrón, Gärdenfors & Makinson — On the logic of theory change: partial meet contraction and revision | For a logically closed theory A, the contractions satisfying Gärdenfors’s six basic postulates are exactly the partial meet contractions, A ∸ x = ⋂γ(A ⊥ x), where γ picks a nonempty subset of the maximal subsets of A not implying x (Observation 2.5); adding the two supplementary postulates gives exactly the contractions whose γ is generated by a transitive relation over those subsets (Corollary 4.5). Revision is defined from contraction by the Levi identity and inherits the corresponding postulates. The result needs, besides A, a selection function or ordering that A itself does not supply: different selection functions give different contractions of the same theory, and in the finite case distinct selection functions always give distinct contractions (Observation 4.6). The setting is one-step change of a single fixed theory; nothing is said about iterated change, about where the selection function comes from, or about the reasons for which a belief is held. | Read |
| NOTE-875 | Dasgupta, Schulz, Goodman & Gershman — Remembrance of inferences past | In three online experiments (N = 84, 80 and 100, before exclusions), a sub- or superadditivity bias induced in a first probability judgment carried over into a second, always-packed judgment about the same scene distribution, and errors on the two queries were correlated trial by trial (r ≈ 0.34–0.67). The carry-over appeared only when the second query shared part of its hypothesis space with the first, which rules out simple numerical anchoring; it was larger when cognitive load fell on the first query, which the authors’ simulations read as reuse of a summary statistic rather than of the stored samples; and with a new cue it appeared (for subadditivity only, and weakly) when the cue’s posterior was similar to the first. The paper defines amortization as reuse of past computation bought at a cost in bias, and itself places it in the time-for-space trade. It measures no response times, so the speed benefit is assumed, not shown; efficiency is shown only by better secondary-task accuracy on reusable trials; and it gives no account of when reuse pays. | Read |
| NOTE-876 | Harris et al. — Failures to replicate a key result of selective accessibility | Five preregistered experiments (N = 128 each, about four times the originals’ N) failed to replicate the lexical-decision result of Mussweiler and Strack (2000a, Studies 1 and 2). That result was that after a comparison with a high or low anchor, words consistent with the anchor are recognised faster. Every experiment produced a large anchoring effect on the later estimate (d ≈ 0.85–1.39), and none showed the accessibility interaction (all η²G ≤ .004). An exploratory Bayesian meta-analysis gave a Bayes factor of 21.1 for the null. Validation experiments found that the same tasks also missed direct picture priming. So the authors conclude that the method cannot detect the effect, not that selective accessibility is false. They still call the theory “a good explanation”, but say the earlier lexical-decision evidence “is not a strong part of the evidence base”. | Read |
| NOTE-877 | Strack & Mussweiler — Explaining the enigmatic anchoring effect | In three small between- and within-subjects studies (N = 32, 32 and 67), the anchor’s effect on a later estimate depended on what the comparison task brought to mind, not on the number alone. With the anchor number held fixed, the effect was large when the estimate was on the dimension compared (Study 1). It reversed to contrast when the estimate was about a very different object (Study 2). After plausible anchors, the comparison took longer and the estimate came faster (Study 3). Accessibility is inferred from these moderations and from latencies. No study measures what knowledge was retrieved. The paper also keeps an adjustment-like route for implausible anchors, which anchored at least as strongly. | Read |
| NOTE-878 | Kirsh & Maglio — On distinguishing epistemic from pragmatic action | Kirsh and Maglio define an epistemic action as a physical action whose primary function is to reduce the space, time or unreliability of the agent’s own mental computation, and argue from Tetris keystroke data that players rotate and translate pieces for that reason: zoids are rotated more than plan-then-act would need, rotation starts within a few hundred milliseconds of a zoid appearing, and a translate-to-wall check is used more the higher the drop. The computational saving is argued, not measured: physical rotation of 90° takes as little as 100 ms against an estimated 800–1200 ms mentally (a three-player pilot), and fewer attentional probes and less working memory are needed. The trade is physical action in place of internal computation at the moment of use, not precomputation or caching; the paper explicitly sets it against caching and chunking accounts of skill, and mentions amortized complexity only in passing for everyday cases such as sorting bolts before assembly. It says the choice fits a Stigler-style cost–benefit model in outline but that such models fail in detail, because an epistemic action’s value depends on the particular internal computation it serves. | Read |
| NOTE-879 | Hébert-Johnson, Kim, Reingold & Rothblum — Multicalibration: calibration for the computationally-identifiable masses | A predictor is α-multicalibrated on a collection C of subpopulations if, within every set S in C, the individuals given (roughly) the same prediction v have true probabilities averaging within α of v, except on an α-fraction of S. For any C whose sets have size at least γN, a simple iterative patching algorithm reaches multicalibration from O(log|C|/α^{11/2}γ^{3/2}) samples in time linear in |C|, and the result is a circuit only O(s/α⁴γ) in size when the sets of C are computed by size-s circuits. Learning it is equivalent, up to polynomial factors, to weak agnostic learning of C, so it is hard for rich C under cryptographic assumptions. Calibrating any predictor h on its own level sets as well as on C costs at most 6α in squared error. All guarantees are relative to the benchmark p*, which is itself defined relative to the features available, and they hold only for large sets; the paper offers no uniqueness for the predictor and does not state a theorem in indistinguishability form. | Read |
| NOTE-880 | Håstad, Impagliazzo, Levin & Luby — A pseudorandom generator from any one-way function | There is a pseudorandom generator if and only if there is a one-way function (Theorem 6.2.2), in the uniform setting: adversaries are algorithms, and every reduction is an oracle Turing machine that turns an adversary for the constructed generator into an inverter for the given function. The route runs one-way function → false entropy generator → pseudoentropy generator → pseudorandom generator, where “computational entropy” is the Shannon entropy of some P-samplable distribution that no adversary of the given strength tells apart from the output. The general reduction is only weak-preserving: composed literally it needs seeds of length n^34, and the paper’s direct construction n^10. The paper attributes to Goldreich [G : 89] the equivalence of pseudorandom generators with P-samplable pairs that are computationally indistinguishable but statistically very different; with Theorem 6.2.2 that gives the one-way function form, but the paper never writes that combined sentence. | Read |
| NOTE-881 | Sardana, Portes, Doubov & Frankle — Beyond Chinchilla-optimal: accounting for inference in scaling laws | Fixing a target pre-training loss and adding inference FLOPs (2N per token over a known lifetime demand D_inf) to training FLOPs (6N per token), the compute-minimising model is smaller and trained on more data than Chinchilla-optimal, increasingly so as D_inf approaches and exceeds the training-set size; the optimum has no closed form and is found numerically. The savings are modest in FLOPs (for a 30B-Chinchilla-quality model with 10^13 inference tokens, 28% by training 13.6B on 2.84× the data) and larger in dollars once inference’s low hardware utilisation is priced in (17% to 58% in the paper’s examples). 47 training runs (150M–6B parameters, 10–10,000 tokens per parameter) find loss still falling at extreme ratios, but more slowly than Chinchilla-fitted laws predict, so the formula overstates the gain from long training. Demand is assumed known before training and fixed given quality; there is no term for uncertainty, discounting, obsolescence or a model being replaced. | Read |
| NOTE-882 | Howes, Duggan, Kalidindi, Tseng & Lewis — Short-term remembering as boundedly optimal strategy choice | Participants copied names one at a time from a mock email to a mock calendar and, after a forced phase that measured their own copying rate at every list length from 3 to 9, chose how many names to take per trial; the list length that had given each person the highest rate in their own data predicted their choice better than one item fewer or one more (55% vs 8% and 17% of choices in Experiment 1, N = 40; 46% vs 12% and 14% in Experiment 2, N = 20). An exponential points schedule raised chosen list length (6.99 vs 5.07), but doubling the cost of an error (whole trial forfeited) did not (5.00 vs 5.05). The “boundedly optimal” prediction is the argmax of each participant’s measured rate, not a model with capacity, error or look-up parameters, and the task has no look-up: names are shown once, in sequence, and cannot be consulted again. 13 of 60 participants persistently chose a non-optimal length, 10 of them one item more. | Read |
| NOTE-883 | Ballard, Hayhoe, Pook & Rao — Deictic codes for the embodiment of cognition | At about a third of a second, the time scale of a saccade, the article models fixation as a pointer that binds a variable in a behavioural program to a place in the world, so that what is bound is only the task-relevant feature, fetched just before use. In a block-copying task subjects looked back at the model about 1.3 times per block on average, the commonest cycle being two looks per block (one apparently for colour, one for position), and chose this slowest, lowest-memory strategy (about 3 s a block, against about 1.5 s for copying from memory) though told to be fast; separating model and copy by 70° cut looks to 1.0 per block, and one-colour patterns that could be chunked cut them to 0.7. The authors read this as working memory having a “carrying cost” that exceeds the cost of re-acquiring from the world, but that cost is inferred from the choices and never measured or modelled, and the evidence is one task with small samples (seven subjects for the main data, three for the colour-change experiment) and no statistics reported in the article. What is left in the world is unprocessed input, not a computed result, and the article argues against precomputation where the needed products cannot be foreseen. | Read |
| NOTE-884 | Jones — Scaling scaling laws with board games | Training AlphaZero on Hex at board sizes 3×3 to 9×9, the best Elo reachable for a given training compute follows one change-point curve across sizes: an incline of about 500 Elo per tenfold of training compute, with the compute for perfect play rising about 7× and the compute to leave random play about 4× per added board row, and fits on small boards predicting larger ones. On 9×9 only, train-time and test-time (tree-search) compute substitute at a fixed rate: at equal Elo, each 10× of train-time compute removes about 15× of test-time compute (fit: log test = −1.2·log train + 0.004·Elo + 29), down to a one-node search, over roughly 1e14–1e16 FLOPS-seconds of training. The trade is an iso-performance curve for a single search; the paper never counts how many games or moves the trained agent will play, so it does not price amortization, and it does not state the unit of test-time compute. One game, small boards, Elo anchored to a perfect player, and no uncertainty on the fitted trade-off coefficients. | Read |
| NOTE-885 | Dwork, Kim, Reingold, Rothblum & Yona — Outcome Indistinguishability | A predictor p̃ is outcome indistinguishable (OI) relative to a class A of distinguishers when no A ∈ A can tell an individual with Nature’s outcome from the same individual with an outcome drawn from Ber(p̃_i). The paper sets out four levels by how much access the distinguisher has to p̃: none, the prediction on the sampled individual, oracle queries, or the code. The lower two levels are equivalent to multi-accuracy and multi-calibration over closely related classes. At those levels OI predictors exist with size O(s/ε²), whatever Nature’s complexity. At the oracle level, under fine-grained hardness of clique counting or BPP ≠ PSPACE, some efficient distinguisher classes force any OI predictor to be nearly as expensive as Nature’s own predictor. That gives a strict separation between oracle access and sample access. OI never requires p̃ ≈ p*. A predictor is good only relative to A, and with the paper’s construction a weak A gives a coarse predictor that a richer A would refute. The paper covers binary outcomes, a fixed representation of individuals and single samples (multi-sample OI is left mostly to future work). | Read |
| NOTE-886 | Gershman & Goodman — Amortized inference in probabilistic reasoning | Gershman and Goodman define amortized inference as the reuse of past inferences, cached as sub-computations, to answer related later queries. They report two small online experiments in which order alone made reuse available. When a sub-query came before a complex query on a five-node Bayesian network, a person’s answer to the complex query could be predicted from their own answer to the sub-query (r = 0.28; r = −0.11 when the order was reversed). Answers to the complex query were also faster relative to a structurally matched baseline. Reuse in this paper is internal memory, and it is shown only through correlation and speed, within one task, with small effects. The paper does not measure costs. Storage cost and the choice of what to store are listed as open trade-offs. Bias, staleness and interference are not studied: reuse that may be “inaccurate” without modification, and interference and forgetting of stored inferences, appear only as questions. | Read |
| NOTE-887 | Risko & Gilbert — Cognitive offloading | A short review that defines cognitive offloading as physical action that changes a task’s information-processing requirements to reduce cognitive demand, splits it into offloading onto the body and into the world, and proposes a metacognitive model: whether people offload is a strategy choice driven by their evaluation of internal versus extended strategies, which tracks objective internal demand but can be wrong, and offloading in turn changes both memory and those evaluations. The evidence is a handful of choice/no-choice studies, summarised qualitatively; the review reports no effect sizes and no formal account of costs. It names costs (memory for offloaded content, GPS-impaired spatial memory, photo-taking impairment, automation complacency and bias, skill decay, inflated self-knowledge, a self-reinforcing drift toward external reliance). It does not frame offloading as computation reused over time, and says nothing about how often an offloaded result is used. | Read |
| NOTE-888 | Athanassoulis et al. — Designing access methods: the RUM conjecture | The paper names three per-operation overheads of an access method, each a ratio to the base data alone (read, update and space amplification, each minimum 1.0), and conjectures that bounding any two forces a lower bound on the third. Its evidence is three one-line propositions about extreme designs over an integer array (a direct-address array, an append-only log, an unindexed dense array), a placement of known structures on a triangle, and a table of asymptotic I/O costs; nothing is proved, and the formal statement does not say how large the forced bound is, so as worded it is close to empty. The extremes themselves show the overheads are not symmetric: the space-minimal design is also update-minimal, and the read-minimal design keeps updates at 2.0, so the clean conflicts are read against space and update against both. Build cost appears in the table but is outside the triangle, there is no workload weighting, no time or deadline, and no cost of examining an item other than reading it. | Read |
| NOTE-889 | Gupta — Selection of views to materialize in a data warehouse | Gupta states view selection on general AND-OR view graphs as minimizing frequency-weighted query cost plus update-frequency-weighted maintenance cost under a space budget. He proves greedy guarantees of 1 − 1/e (about 63%) of the optimal benefit, with the budget overrun by one view or up to double, but almost all of them assume no updates. Maintenance cost enters exactly one theorem: AND view graphs (each view has one way of being computed) in which every view is queried more often than it is updated. For OR view graphs, which include Harinarayan, Rajaraman and Ullman’s data cube, the paper sets update costs aside outright, so it does not add upkeep to that problem. Maintenance is an abstract per-update charge for keeping a view consistent. Nothing prices building a view, tolerated staleness or deferred refresh, and there are no experiments. | Read |
| NOTE-890 | Gupta & Mumick — Selection of views to materialize under a maintenance cost constraint | Gupta and Mumick choose views to materialize so as to minimize frequency-weighted query cost subject to a cap S on total maintenance time, the sum over chosen views of update frequency times a per-update maintenance cost that depends on which other views are stored. Because storing one view can make another cheaper to maintain, benefit per unit of maintenance is not monotone and the single-view greedy of earlier work can be arbitrarily bad. For OR view graphs (each view computed from one other, as in data cubes) a greedy that adds whole “inverted tree sets” gets at least 1 − 1/e (63%) of the benefit of an optimal solution that may use as much maintenance as the greedy did, the greedy using up to 2S, assuming no inverted-tree piece of the optimum alone exceeds S (Theorem 1, unproved here); without that assumption it gets half the optimum’s benefit per unit of maintenance (Theorem 2). Each greedy stage enumerates exponentially many sets in general; for general AND-OR graphs there is only an exact A* search with exponential worst case. Upkeep is a budget, not a term traded against query savings; build cost, storage and staleness are not modelled, and the experiments are on random graphs of 10 to 25 nodes. | Read |
| NOTE-891 | Yao — Should tables be sorted? | For storing a set of n keys from a universe {1,…,m} in a table so that the membership query (is x in S?) is answered with the fewest worst-case adaptive probes, Yao proves that when the table cells may hold only keys of S or a bounded number of pointer symbols, sorted order with binary search (⌈lg(n+1)⌉ probes) is optimal once m exceeds a Ramsey-number threshold N(n, p, q), whatever the arrangement rule, table size or hashing scheme. The threshold is astronomically large, and for small universes sorted order is beaten (one probe suffices for m = 3 with n = 2, and for m ≤ 2n − 2 with n > 2). The optimality also fails as soon as one cell may hold an arbitrary value from the universe: with a single extra “directory” cell, two probes suffice for m ≥ 2^{16n²}. Only query cost is counted; building the table is free and unconstrained, so the paper says nothing about the cost of arranging or about trading arrangement cost against lookups. | Read |
| NOTE-892 | Idreos, Kersten & Manegold — Database cracking | Database cracking builds an index as a by-product of answering range queries. Each select partitions, in place, the part of a copy of the column that the query had to touch, so that the qualifying values lie contiguously, and records the new boundaries in a small tree; later queries touch only the pieces at the edges of their range, so per-query cost falls as the column is split into more pieces. On a 10^7-value column under uniformly random range queries, the first cracking select costs 0.38 s against 0.27 s for a scan and about 3.3 s for sort-then-search, and cumulative cost stays below sorting’s until about 10^5 queries, after which upfront sorting wins. The authors claim that only ranges of past interest get organized, but every experiment uses uniformly random ranges, so that claim is not measured; there is no cost model, no rule for when a reorganization is worth making, and updates, concurrency and out-of-memory data are left as open problems. | Read |
| NOTE-893 | Karlin, Manasse, Rudolph & Sleator — Competitive snoopy caching | For a shared-bus multiprocessor whose caches can either keep a replicated block (and pay one bus cycle for every write to it) or drop it (and pay p to fetch it again if it is read), the paper gives counter-based on-line algorithms whose total bus cost on every request sequence is at most twice that of the best off-line algorithm, and proves that no deterministic on-line algorithm can guarantee better than 2. The rule is: drop a copy once the writes it has caused since it was last read have cost as much as refetching it. With a third option (reading or writing through without fetching) the lower bound rises to 3, and the algorithm given is 3-competitive ignoring writebacks, 4 counting them; with associative caches the bound becomes the paging ratio. The paper never names rent-or-buy or ski rental; its rent is upkeep paid on an idle copy, and its purchase is the refetch after dropping, the reverse orientation of building a bin. Costs are fixed constants, the guarantees are worst case only, and the authors call the practical significance “unclear”. | Read |
| NOTE-894 | Clark — Negation as failure | Clark gives a query evaluator for a data base of clauses (a Horn clause prover in which a ground negated literal ~P is taken as a lemma when the recursive evaluation of P fails on every branch) and proves it sound with respect to the completed data base: the clauses read as the if-halves of if-and-only-if definitions, plus equality axioms saying distinct names denote distinct objects. Theorem 2: if for some selection rule every branch of the evaluation tree of Q terminates with failure, then not-(exists x)Q is a theorem of the completed data base. A branch that does not terminate licenses nothing; the rule requires the search to be exhausted, which the paper calls “the exhaustive but unsuccessful search for a proof of P”. The evaluator is in general incomplete (non-ground negation, a single evaluation tree, no case analysis); it is complete for allowed queries on hierarchical data bases (Theorem 4). | Read |
| NOTE-895 | Harinarayan, Rajaraman & Ullman — Implementing data cubes efficiently | Treats a data cube’s group-by queries as a lattice in which a query can be answered from any stored ancestor, prices a query at the number of rows of the smallest materialized ancestor, and chooses which views to precompute. Choosing k views to maximize the total reduction in query cost (the “benefit”) is NP-complete; a greedy rule that adds the view of largest marginal benefit gets at least 1 − ((k−1)/k)^k ≥ (e−1)/e ≈ 63% of the optimal benefit, a bound that is tight, holds unchanged with query-frequency weights, and weakens to 0.63 − f under a space budget when no view takes more than a fraction f of it. The cost of building views is represented only by their size, maintenance and updates are not modelled, the data are static, and the bound is on benefit, not on query cost. On TPC-D data the greedy order reaches nearly the minimum total query time with five views and barely more space than the base view. | Read |
| NOTE-896 | Bruno & Chaudhuri — An online approach to physical design tuning | An always-on index tuner for SQL Server. It keeps, for each candidate or existing index, the running sum of what each query would have saved with it (what-if optimizer estimates, with update costs counted as losses). It creates an index once that sum has risen by the index’s build cost above its lowest point, and drops it once the sum has fallen by the build cost from its highest point. For one index with no space limit, the authors call this 3-competitive against the optimal schedule that knows the workload in advance. The proof only gives a workload on which the ratio approaches 3, and the paper cites no competitive-analysis work, ski rental included. The general case (many interacting indexes and a storage limit) uses heuristics with no guarantee. All costs in the experiments are optimizer estimates, on synthetic and TPC-H workloads. | Read |
| NOTE-897 | Treisman & Gelade — A feature-integration theory of attention | In visual search for a coloured letter, a target that differs from all distractors by one feature (a colour, blue, or a shape, S, among brown Ts and green Xs) was found in a time almost independent of display size (positive slopes 3.8 ms/item for colour, 2.5 for shape, display sizes 1–30), while a target defined by a conjunction (green T among brown Ts and green Xs) gave linear slopes of 28.7 ms/item when present and 67.1 when absent, the roughly 1:2 ratio of serial self-terminating search; 13 sessions of practice did not make the conjunction pop out. Making the conjunction’s colours and shapes harder to tell apart nearly tripled the slope but kept it linear, and a single-feature target hard to discriminate (an ellipse of intermediate size) was slow but not item-by-item serial. Even in feature search, target-absent trials were slow and grew with display size (25.1 ms/item). The displays were at most 30–36 well-spaced items on a card, with unlimited viewing; the paper argues that conjunction structure, not similarity, makes search serial, and does not model similarity. | Read |
| NOTE-898 | Finkelstein, Schkolnick & Tiberio — Physical database design for relational databases | DBDSGN chooses, for each table, one clustered (ordering) index and a set of nonclustered indices to minimise a frequency-weighted sum of per-statement costs (access, tuple update, index maintenance) plus a weighted storage term, under an optional page limit, taking every cost from the System R optimizer’s own estimates rather than an external model. Statement costs for any configuration are computed exactly from “atomic” configurations with at most one index per table (Propositions 1 and 2), so the optimizer is consulted a linear rather than exponential number of times per table; with no elimination heuristics and a full search the tool finds the optimum, but only with respect to the optimizer’s estimates. The paper gives one worked example and no measurement of actual execution, and its claims that the heuristics usually find the best solutions are not backed by reported data. The model is steady-state over a period: it has no term for the one-time cost of building an index or sorting a table, so it prices upkeep against retrieval, not a one-off sort against later retrievals. | Read |
| NOTE-899 | Reiter — On closed world data bases | Reiter defines the closed-world assumption (CWA) for a function-free first-order database as reasoning from DB together with the negation of every ground atom that DB does not entail, and contrasts it with the open-world assumption (OWA), under which only what DB entails is an answer. He shows that, when DB with these added negations is consistent, closed-world evaluation of any existential query reduces to ordinary (open-world) evaluation of atomic queries combined by union, intersection, difference and projection, so the negations never need to be listed. The CWA can make a consistent database inconsistent (Pa ∨ Pb yields ¬Pa and ¬Pb); consistent Horn databases, and all definite databases, stay consistent. Nothing in the paper concerns how long a search takes: non-entailment is a fixed logical relation, and the CWA’s justification is stated as an assumption of total knowledge of the domain, not proved as a soundness condition. | Read |
| NOTE-900 | Chaudhuri & Narasayya — An efficient, cost-driven index selection tool for Microsoft SQL Server | The AutoAdmin tool picks at most k indexes (single- or two-column, clustered or not) for a given workload of SQL statements, minimising the unweighted sum of the optimizer’s estimated costs of those statements, with hypothetical (“what-if”) indexes made visible to the optimizer by loading their statistics into the catalog. Its contribution is search efficiency: candidates are restricted to indexes in some single query’s best configuration, enumeration is Greedy(m, k) (an exhaustive seed of m indexes, then greedy additions), costs of most configurations are derived from a few “atomic” ones, and two-column indexes are generated only from winning single columns. On five TPC-D workloads this cut running time to 10–24% of a baseline, with estimated-cost quality 0–7% worse, and Greedy(2, 4) matched the exhaustive optimum on four of five workloads and was within 1% on the fifth. The cost model has no build cost, no storage term and no frequency weights, the budget is a count of indexes, the workload is fixed, there is no guarantee for the greedy step, and quality is never measured by executing anything. | Read |
| NOTE-901 | Gupta & Mumick — Selection of views to materialize in a data warehouse (TKDE 2005) | The journal paper merges Gupta’s 1997 space-budget results and the 1999 maintenance-budget results into one article; it adds proofs, not new problems or new guarantees. Theorem 8 (the conference Theorem 1: inverted-tree greedy on OR view graphs, at most 2S of maintenance, at least 1 − 1/e of an optimum with the same maintenance, assuming no inverted-tree piece of the optimum exceeds S) and Theorem 10 (A* is exact on AND-OR graphs) are now proved, while Theorem 9 (the assumption-free half-density bound) is referred to Gupta’s thesis. The maintenance-budget guarantee stays confined to OR view graphs, the greedy stays exponential in the worst case, and the two constraints are never combined. The only place upkeep is traded against query cost is the 1997 formulation carried over, query cost plus maintenance cost minimized under a space budget, with a guarantee only for AND view graphs in which every view is queried more often than it is updated; build cost and staleness are not modelled anywhere. | Read |
| NOTE-902 | Piatetsky-Shapiro — The optimal selection of secondary indices is NP-complete | For one relation, a known mix of equality queries and updates, single-attribute secondary indexes, and a fixed upkeep charge per index on each update, choosing the index set that minimizes average transaction cost is NP-hard: minimum set cover reduces to it, each subset becoming an attribute and each element a query that any one of its attributes’ indexes can answer. The paper calls the problem NP-complete but states only the optimization version, and the proof is a sketch of about half a page. Storage is not in the model; the only price of an index is upkeep on updates. A variant with off-line updates under an update-cost budget is asserted NP-complete without proof. The paper does not cite or discuss Comer 1978. | Read |
| NOTE-903 | Sleator & Tarjan — Amortized efficiency of list update and paging rules | For a list searched sequentially from the front, where reaching the i-th item costs i, moving each accessed item to the front costs at most twice what any other rule costs on the same sequence, including rules that know the whole sequence in advance (four times, counting move-to-front’s own moves), with no probabilistic assumption. A fixed list sorted by access frequency, and the transpose and frequency-count rules, are not within any constant factor of that. Rearranging ahead of need never pays in this model (Theorem 3). For paging, where only a small fast memory is cheap, no rule that cannot see the future can do better in the worst case than n/(n − n_MIN + 1) times the offline optimum MIN, and LRU and FIFO attain that bound up to an additive n_MIN; with equal memories the ratio is the memory size. The model is a single linear list (or a two-level memory) with uniform items and access cost depending only on position; it says nothing about partitions, bins or search that is not a scan. | Read |
| NOTE-904 | Dar, Franklin, Jónsson, Srivastava & Tan — Semantic data caching and replacement | A client cache described by the selection predicates of past queries can answer a new selection query partly from cache (the probe query, Q ∧ V) and fetch only the rest from the server (the remainder query, Q ∧ ¬V), and can evict by semantic region rather than by page or tuple. In one simulator, one client and one server, read-only selection queries on a single 10,000-tuple relation, this matched page caching on a clustered index, beat it heavily when clustering was bad, answered over 60% of small queries on an unindexed attribute with no server contact, and let a value function based on semantic distance beat LRU on a skewed workload. No replacement rule won everywhere: on regular cyclic paths MRU was best. Everything is measured, nothing is proved; updates, joins, and the CPU cost of reasoning about cache contents were not modelled. | Read |
| NOTE-905 | Indyk & Motwani — Approximate nearest neighbors: towards removing the curse of dimensionality | Approximate nearest-neighbour search in d dimensions reduces, with small overhead, to a decision problem (is there a point within r, or none within (1+ε)r), and that decision problem is solved by locality-sensitive hashing: if hash functions make near pairs collide with probability at least p1 and far pairs with at most p2, then n^ρ random hash tables with ρ = ln(1/p1)/ln(1/p2) answer queries with O(n^ρ) hash evaluations in O(dn + n^{1+ρ}) space, with constant success probability. For Hamming space by bit sampling, and for ℓ_p with p in [1, 2] by embedding, ρ ≤ 1/(1+ε) in the 1999 text (1/ε, for ε > 1, in STOC). The paper also gives the other end of the trade: Õ(d) query time for n·O(1/ε)^d or (nd)^{O(1)} preprocessing. It is an upper bound only: it proves no lower bound, does not claim its exponents are best, solves only the approximate problem with constant probability, and counts preprocessing as space. | Read |
| NOTE-906 | Cho & Garcia-Molina — Synchronizing a database to improve freshness (SIGMOD 2000) | For a local copy of N items, each changing as an independent Poisson process with a known rate and refreshed at fixed intervals under a fixed total refresh rate, refreshing every item equally keeps the copy fresher and younger on average than refreshing in proportion to change rate, under any distribution of rates (proved in the technical report by convexity). The freshness-optimal allocation is neither: it rises and then falls with change rate, and gives no refresh at all to items that change too fast for the budget, while the age-optimal allocation rises slowly with change rate. On estimates from 270 web sites, proportional, uniform and optimal refresh give freshness 0.12, 0.57 and 0.62. Every item matters equally, staleness is a time average with no access or query model, the refresh budget is fixed rather than priced, and refresh, change and its detection are free of any other cost. | Read |
| NOTE-907 | Chandra & Merlin — Optimal implementation of conjunctive queries in relational data bases | Defines conjunctive queries (existentially quantified conjunctions of atoms, no equality, constants naming distinct elements) and proves that two are equivalent exactly when there are homomorphisms each way between their natural models (Lemma 13). Every conjunctive query has a minimal equivalent query, unique up to isomorphism, reached by folding (Theorem 12), and that minimal query yields an evaluation program within a constant factor of optimal in the paper’s cost model (Theorem 16). The hardness results are that evaluating a boolean conjunctive query on a database is NP-complete when the query is part of the input (Theorem 7), and that deciding whether one query is a folding of another is NP-complete (Theorem 11). The paper does not state a containment theorem or the NP-completeness of containment or equivalence as such; both are standard corollaries of Lemma 13’s proof and Theorem 11’s construction, and later papers cite them to it. | Read |
| NOTE-908 | Labrinidis & Roussopoulos — WebView materialization | For a page built from database queries, the paper compares three ways to serve it on a server with online updates: compute it on each request (virt), store the query result in the DBMS and refresh it on every update (matdb), or store the finished page as a file at the web server and rewrite it on every update (matweb). It gives a cost model summing access and update costs by their frequencies and states the selection problem (choose a policy per page to minimize mean response time, no space limit, no staleness allowed), but gives no algorithm for it. On one Apache/Informix testbed with cheap indexed queries, matweb answered 10 to 230 times faster than the other two at all loads tried, and matdb was slower than virt whenever there were updates, because reading the stored result cost about as much as recomputing it. Staleness is defined as the delay from update to reply, sketched, and never measured; build cost and storage are outside the model. | Read |
| NOTE-909 | Levy, Mendelzon, Sagiv & Srivastava — Answering queries using views | For conjunctive queries and views, a view can be used in an equivalent rewriting of a query exactly when there is a containment mapping (a homomorphism of bodies) from the view into the query, so every possible use of a stored view is found among those mappings. Without comparison predicates, a minimal rewriting needs no more literals than the query and no new variables, which puts the search in NP; deciding whether some rewriting uses a given set of views (with comparisons only in the query), whether a rewriting with fewer than k literals exists, and whether a rewriting using only the views exists are each NP-complete, and with comparisons in both query and views existence is Π2p-complete. The hardness has two independent sources, the number of mappings and the choice of which query literals to drop, and a polynomial algorithm removes the redundant literals for a given mapping, exactly under stated conditions. Only equivalent rewritings are studied; contained rewritings, the cost of the resulting plan and the size of view collections are outside it. | Read |
| NOTE-910 | Indyk & Xu — Worst-case performance of popular approximate nearest neighbor search implementations | For DiskANN’s “slow preprocessing” graph (each point linked to the points that survive α-pruning of all other points, naively O(n³) time), greedy search from any start with no backtracking reaches a ((α+1)/(α−1) + ε)-approximate nearest neighbour in O(log_α(∆/((α−1)ε))) steps, each costing O((4α)^d log ∆) for doubling dimension d and aspect ratio ∆; the ratio is tight and the dependence on ∆ cannot be replaced by log n. For DiskANN with its practical “fast preprocessing”, HNSW, NSG and seven other graph indexes, the paper constructs two-dimensional point sets (constant doubling dimension) on which, in experiments with the authors’ code at the authors’ recommended parameters, the search queue must hold about 10% of the points before recall@5 becomes non-zero or the approximation ratio becomes reasonable. The linear lower bounds are empirical, for one query per constructed instance, with an informal Ω(n/R) argument for fast-preprocessing DiskANN; no theorem bounds HNSW or NSG. | Read |
| NOTE-911 | Labrinidis & Roussopoulos — Balancing performance and data freshness in web database servers | The paper poses Online View Selection for a web server whose database takes updates while serving requests: choose, as the workload runs, which page fragments (WebViews) to keep stored and refreshed on every update and which to cache and invalidate, so as to minimize mean response time while the fraction of fresh fragments served (QoD) stays above a threshold θ. Its algorithm, OVIS(θ), estimates per fragment the response-time and QoD change of switching, and periodically switches up to MAX_CHANGE fragments greedily, spending a QoD surplus on speed or buying back a deficit; it materializes everything when it detects backlog. Nothing is proved: optimality of the greedy step is asserted, and the evidence is one synthetic simulation with fixed costs, in which OVIS kept QoD near θ, answered faster than caching alone, and recovered from overload. Upkeep and query savings share one cost, but staleness is a constraint set by the user, not a priced term, and build cost, switching cost and storage are absent. | Read |
| NOTE-912 | Olston, Loo & Widom — Adaptive precision setting for cached approximate values | Olston, Loo and Widom set the width of each cached interval adaptively to minimize total refresh traffic. A narrow interval is escaped often (value-initiated refreshes, cost C_vr); a wide one is too imprecise for queries more often (query-initiated refreshes, cost C_qr). Under a model in which these probabilities go as 1/W² and W, the expected cost rate is least where ρ·P_vr = P_qr, ρ = 2C_vr/C_qr, and a rule that widens on value-initiated and narrows on query-initiated refreshes, with probabilities set by ρ, reached within 1% to 5% of the best fixed width in simulation. That the rule converges is argued, not proved. With exact copies required it matched an adaptive exact-caching algorithm, and where imprecision was allowed it beat it. Staleness is priced as refresh traffic only: there is no build cost, no cost of a wrong answer, and the interval is never wrong. | Read |
| NOTE-913 | Green, Karvounarakis & Tannen — Provenance semirings | Annotating each input tuple with an element of a commutative semiring, and computing union and projection with + and join with ·, gives one positive relational algebra (RA+) that is set semantics over the Booleans, bag semantics over the naturals, c-tables over positive Boolean expressions, event tables over sets of outcomes, and lineage over sets of tuple ids. The polynomials N[X] in the tuple ids are the most general such annotation: for any RA+ query and any commutative semiring K, the K-annotated answer is the provenance polynomial evaluated at the input’s K-annotations (Theorem 4.3). For datalog the paper needs ω-continuous semirings and formal power series N∞⟦X⟧, with the analogous factorization (Theorem 6.4) and a criterion for infinite coefficients (Theorem 6.5). Everything is positive: no negation, difference or aggregation, and revaluing inputs can only remove output tuples, never add them; trust and deletion propagation are not treated. | Read |
| NOTE-914 | Panigrahy, Talwar & Wieder — Lower bounds on near neighbor search via metric expansion | Cell-probe lower bounds for near-neighbour search follow from the expansion of the graph joining points within distance r: a deterministic t-probe structure with m cells of w bits must have (mwt/n)^t at least the vertex expansion, and a randomized one must have m^t w/n at least the robust expansion at measure 1/m^t, on random data sets with weakly overlapping neighbourhoods. For the hypercube this recovers known bounds and gives, for example, space n^{1+Ω(1/(ct))} for approximation c and n^{Ω(1/(tε²))} for 1 + ε; for symmetric (Cayley) graphs a one-probe structure matches the bound, and for dynamic low-contention structures the update time must be at least the robust expansion over poly(t). The bounds are average case, for approximate decision search, and weak in t: they fall off exponentially in the number of probes, so they are tight only for a constant number of probes and say little about structures that probe n^ρ cells. | Read |
| NOTE-915 | Gupta, Mumick & Subrahmanian — Maintaining views incrementally | Two algorithms compute the changes to a stored derived relation (a view) from changes to the base relations, without recomputing it. Counting stores, for each derived tuple, the number of its derivations and propagates signed counts through delta rules stratum by stratum; it is stated correct for nonrecursive Datalog or SQL views with stratified negation and aggregation, under set or duplicate semantics, and is argued to cost little beyond evaluating the view. DRed (delete and rederive), for recursive views under set semantics only, deletes an overestimate of what a deletion invalidates, puts back those tuples that still have a derivation from what remains, then adds what insertions derive; it is stated to yield exactly the tuples derivable from the new base. The paper is an extended abstract: the theorems are stated without proof (proofs are referred to a 1992 AT&T report), cost claims are argued, not measured, and there are no experiments. | Read |
| NOTE-916 | Malkov & Yashunin — Hierarchical navigable small world graphs for approximate nearest neighbour search | HNSW is a stack of proximity graphs on nested random subsets of the data. Each element’s top layer is drawn from a geometric distribution, and new neighbours are chosen by a pruning rule that favours diverse directions. Searching from the sparse top layer down makes per-query cost grow about logarithmically with N on uniform random data in 4 and 8 dimensions, which flat NSW graphs did not. The logarithmic bound is derived only for exact Delaunay graphs of bounded mean degree, which HNSW does not build. For the graphs it does build, logarithmic scaling is measured, at low dimension only, and on 200M SIFT vectors the paper reports the scaling “deviates from the pure logarithm”. The neighbour-selection rule is what keeps clustered data searchable: in the paper’s synthetic test with 100 isolated clusters, linking each element to its nearest neighbours fails to reach high recall. There is no worst-case or recall guarantee, no deletion, and no analysis of query distributions unlike the data. | Read |
| NOTE-917 | Beyer, Goldstein, Ramakrishnan & Shaft — When is “nearest neighbor” meaningful? | For a fixed number n of data points and a query drawn independently of them, if the variance of the p-th power of the query-to-point distance, divided by its mean, goes to zero as dimension m grows, then the farthest point is, with probability tending to one, within any factor 1 + ε of the nearest (Theorem 1). The condition holds for IID dimensions and for several correlated or non-identical workloads, and fails when data and queries lie on a low-dimensional subspace or when queries fall inside well-separated clusters. Simulations put the collapse of contrast within 10 to 20 dimensions for IID data, and two real image-feature sets showed weak contrast. The condition is sufficient, not shown necessary; the theorem is about the ratio of distances with n held fixed, and says nothing about real data of low intrinsic dimension except that such data can escape it. | Read |
| NOTE-918 | Andoni, Laarhoven, Razenshteyn & Waingarten — Optimal hashing-based time–space trade-offs for approximate near neighbors | For c-approximate near-neighbour search (find a point within cr when one lies within r) over n points in Euclidean space, the paper gives a data structure for every pair of exponents with c²√ρq + (c²−1)√ρu ≥ √(2c²−1), using space n^{1+ρu+o(1)} + O(dn) and query time n^{ρq+o(1)} + dn^{o(1)}, on worst-case data (for Hamming and ℓ_1, c√ρq + (c−1)√ρu ≥ √(2c−1)). It proves the curve cannot be beaten by list-of-points structures, the model of all known data-independent hashing schemes, on random instances, and unconditionally in the cell-probe model only at one end (query n^{o(1)}) for one or two probes. So the exact trade between space spent organizing and per-query time is known within the hashing model; outside that model, for more than two probes, it is not, and data-dependent schemes are covered only by conjecture. | Read |
| NOTE-919 | Weber, Schek & Blott — Similarity search in high-dimensional spaces: when partitioning loses to a scan | Under uniformly distributed, independent data and queries in the unit cube with Euclidean distance, the paper estimates the average fraction of blocks that an optimal nearest-neighbour search must read in a partitioned or clustered index. That fraction reaches the 20% at which a sequential scan wins, given an assumed five-fold sequential advantage, at about 15–20 dimensions for rectangular regions, 26 for spherical ones, and below a crude 610 for any partitioning into convex clusters of two or more points. The “around 10” in the abstract is the measured crossover for an R*-tree and an X-tree on 50,000 uniform points and on 45-dimensional image features. As an alternative it proposes the VA-file, a scanned file of compact per-vector approximations that filters out all but a few vectors. The analysis says nothing about data with low intrinsic dimension; that the results carry over by fractal dimension is a conjecture. | Read |
| NOTE-920 | Buneman, Khanna & Tan — Why and where: a characterization of data provenance | The paper separates two meanings of the provenance of a piece of output data. Why-provenance is the witness basis: for each valuation of the query that produces the value, the part of the source the query’s patterns matched, one witness per derivation. Where-provenance is the location in the source a value was copied from. For a hierarchical data model and a query language that covers positive (SPJU) relational queries, the witness basis is preserved by the paper’s query rewriting, and the minimal witness basis is the same for equivalent queries with equality conditions, while where-provenance is not invariant over equivalent queries in general and is preserved by rewriting only for a restricted class it calls traceable. Proofs are omitted, and nothing covers negation, aggregation, updates or additions to the source. | Read |
| NOTE-921 | Halevy — Answering queries using views: a survey | A survey that separates two problems of answering queries from stored views: finding an equivalent rewriting, which query optimization needs, and finding a maximally-contained rewriting or all certain answers, which data integration needs when sources are incomplete. Its theoretical findings, mostly reported from other papers: an equivalent conjunctive rewriting exists only if one exists no longer than the query, so finding one is NP-complete in the size of the query and view definitions, and checking a candidate is itself NP-complete; the inverse-rules algorithm builds the maximally-contained rewriting, as a possibly recursive datalog program, in time polynomial in the query and views; and finding all certain answers is polynomial in the size of the stored data in many open-world cases, but co-NP-hard in that size under the closed-world assumption even for conjunctive views and queries, or open-world with union in the views or ≠ in the query. Choosing which views to store is left as the next problem; cost-based choice among rewritings is described for practical optimizers, without guarantees. | Read |
| NOTE-922 | Olston & Widom — Offering a precision-performance tradeoff for aggregation queries over replicated data | Olston and Widom propose TRAPP: caches hold, for each numeric value, an interval its source guarantees to contain the current value, the source pushing a refresh whenever the value leaves it. A query carries a precision constraint R, and the system chooses which values to fetch exactly so that the answer interval is at most R wide whatever the true values, at least total refresh cost. For SUM (and AVG without a predicate) that choice is a 0/1 knapsack problem, NP-complete in general and polynomial with equal costs; COUNT and MIN have simple rules. Staleness becomes bounded imprecision, never error, and the cost of the source-side upkeep that guarantees this, and of setting the bound widths, is outside the optimization. The one experiment is 90 stock prices with random costs. | Read |
| NOTE-923 | Kleinberg — The small-world phenomenon: an algorithmic perspective | On an n × n lattice where each node also gets q long-range links drawn with probability proportional to d^(−r), short paths exist for r = 0, but no algorithm that sees only the links of nodes the message has visited finds them faster than about n^(2/3) steps in expectation. At r = 2 the greedy rule (pass to the contact nearest the target in lattice distance) delivers in O((log n)²) expected steps (proved for p = q = 1); for 0 ≤ r < 2 every such algorithm needs Ω(n^((2−r)/3)) and for r > 2 Ω(n^((r−2)/(r−1))). So efficient decentralized search depends on how the long-range links are distributed relative to the lattice, not on the links’ existence or on the graph’s diameter. The k-dimensional version (r = k) is stated without proof, and the model is a lattice with a known distance that every node can compute to the target. | Read |
| NOTE-924 | Fagin, Lotem & Naor — Optimal aggregation algorithms for middleware | Given m lists of the same N objects, each sorted by one attribute’s grade, and a monotone function combining the grades, the threshold algorithm (TA) reads the lists in parallel, random-accesses each newly seen object’s other grades, and stops once k seen objects score at least the combined score of the last grades read. It is correct for every monotone combining function, needs constant buffers, and is instance optimal among correct algorithms that make no “wild guesses”: on every database its cost is within a constant factor of any such algorithm’s, the factor being m + m(m−1)c_R/c_S, which is best possible when the combining function is strict (conjunction-like). Without the no-wild-guesses restriction no algorithm is instance optimal, and the counterexample is a two-list conjunction whose target sits in the middle of both lists, which any algorithm must search linearly. Fagin’s Algorithm’s sublinear cost O(N^((m−1)/m) k^(1/m)) is cited from Fagin, not proved here, and holds only when the lists’ orderings are probabilistically independent. The model prices queries over a given set of single-attribute sorted lists. It does not price building or keeping the lists, choosing an arrangement, or any computation beyond accesses. | Read |
| NOTE-925 | Larsen & Nelson — optimality of the Johnson–Lindenstrauss lemma | For n, d ≥ 2 and lg^0.5001 n / √min{n, d} < ε < 1 there is an n-point set in R^d such that every map into R^m, linear or not, that keeps all squared distances within 1 ± ε needs m = Ω(ε⁻² lg(ε²n)), which is Ω(ε⁻² lg n) once ε > 1/min{n, d}^0.4999. So the Johnson–Lindenstrauss bound is optimal up to a constant, and the distributional lemma plus a union bound is the best route. The proof is an encoding argument over k-sparse point sets with k = ε⁻²/256, and the count it ends on is m = Ω(k lg(d/k)). | Read |
| NOTE-926 | Achlioptas — database-friendly random projections | A random projection keeps all pairwise distances of n points within 1 ± ε with probability at least 1 − n^−β when k ≥ (4 + 2β)/(ε²/2 − ε³/3) · log n and the matrix entries are independent ±1, or √3 times {+1, 0, −1} with probabilities 1/6, 2/3, 1/6. This is the same k₀ as the best bound for Gaussian projections. The proof shows that every even moment of a unit vector’s projection is at most that of the all-equal vector (1, …, 1)/√d, and that this vector’s moments are at most the Gaussian ones. | Read |
| NOTE-927 | Lee & Naor — extending Lipschitz functions via random metric partitions | A random partition of a metric space whose pieces are small and whose points are, on average, far from piece boundaries yields a “gentle” partition of unity, and averaging a Lipschitz map over it extends the map into any Banach space. This gives ae(X) ≤ C log n/log log n for every n-point metric space X (Theorem 1.10), improving Johnson, Lindenstrauss and Schechtman’s C log n; ae(X) ≤ C log λ(X) for doubling X; ae ≤ C r² on K_r-minor-free graph metrics; e(ℓ₂ᵈ, Z) ≤ C√d; and, with the Johnson–Lindenstrauss lemma, eₙ(L₂, Z) ≤ C√(log n). For maps into Hilbert space it does not improve Johnson and Lindenstrauss’s K√(log n), and it leaves √(log n) open. | Read |
| NOTE-928 | Linial, London & Rabinovich — the geometry of graphs | Every n-point metric embeds in ℓ₂ with distortion O(log n) in O(log n) dimensions (Theorem 3.2(1), attributed to Bourgain). The paper reproves the distortion bound by a randomized Bourgain-style construction into ℓ_p^{O(log² n)}, and it gets the dimension from Johnson–Lindenstrauss. Every embedding of a constant-degree expander into ℓ_p, 1 ≤ p ≤ 2, of any dimension, has distortion Ω(log n) (Proposition 4.2), so the bound is tight. The lower bound comes from Leighton and Rao’s flow–cut gap, and the same embeddings give an O(log k) max-flow/min-cut gap for k commodities. | Read |
| NOTE-929 | Alon & Klartag — optimal compression of approximate inner products | Storing every inner product and squared distance of n points of norm at most 1 in R^k to additive error ε takes Θ(n log n/ε²) bits once k ≥ log n/ε², Θ(nk log(2 + log n/(ε²k))) for log n ≤ k ≤ log n/ε², and Θ(nk log(1/ε)) below, for 1/n^0.49 ≤ ε ≤ 0.1. Comparing these counts across dimensions shows that some n points in R^k cannot be mapped into fewer than Ω(min{k, log(2 + ε²n)/ε²}) dimensions with additive error ε, for every ε ≥ 2/√n. A bipartite version of the Johnson–Lindenstrauss lemma reaches O(log(2 + ε²n)/ε²) dimensions; the one-family version at that size is left open. | Read |
| NOTE-930 v2 | Johnson & Lindenstrauss — extensions of Lipschitz mappings into a Hilbert space | Lemma 1: any n points in ℓ₂ⁿ map into ℓ₂ᵏ, k = [K(τ) log n], with ‖f‖_lip‖f⁻¹‖_lip ≤ (1+τ)/(1−τ), by a Haar-random rank-k orthogonal projection, with positive probability. The proof concentrates the norm of a projected unit vector about its median by Lévy’s isoperimetric inequality and takes a union bound over the normalized differences of the points; K ≥ (10/τ)² suffices. The lemma is a tool for Theorem 1: Lipschitz maps from n-point subsets of any metric space into ℓ₂ extend to the whole space with Lipschitz constant at most C(log n)^{1/2} times the original. | Read |
| NOTE-931 | Baraniuk, Davenport, DeVore & Wakin — a simple proof of the restricted isometry property | If an n × N random matrix satisfies the concentration inequality used in JL proofs, Pr(|‖Φx‖² − ‖x‖²| ≥ ε‖x‖²) ≤ 2e^{−n c₀(ε)}, then a union bound over a (12/δ)^k-point net on each of the C(N, k) ≤ (eN/k)^k coordinate k-subspaces, with a short bootstrapping step from net to subspace, gives the restricted isometry property for all k ≤ c₁n/log(N/k) with probability at least 1 − 2e^{−c₂n} (Theorem 5.2). Gaussian, ±1 and Achlioptas’s sparse ensembles qualify with c₀(ε) = ε²/4 − ε³/6, and the same argument gives the property in any fixed orthonormal basis. | Read |
| NOTE-932 | Dasgupta & Gupta — an elementary proof of the Johnson–Lindenstrauss lemma | For n points in ℝᵈ and 0 < ε < 1, a projection onto a random k-dimensional subspace, scaled by √(d/k), keeps every squared pairwise distance within a factor 1 ± ε with probability at least 1/n once k ≥ 4(ε²/2 − ε³/3)⁻¹ ln n. The proof bounds each tail of the squared length of a random unit vector’s first k coordinates by Markov’s inequality on an exponential of Gaussian squares, and then takes a union bound over the n(n−1)/2 pairs. | Read |
| NOTE-933 | Donoho & Tanner — observed universality of phase transitions | For Gaussian matrices, ℓ1 minimization (and its nonnegative LP form) recovers a k-sparse vector from n random measurements in dimension N with probability tending to 1 below a curve ρ(δ; Q) in the plane δ = n/N, ρ = k/n, and to 0 above it; this was proved earlier and is restated here as Theorem 2.1. In 2,948,000 linear programs over eight non-Gaussian ensembles at N = 200, 400 and 1600, the 50% success points fall on the same curves, but exact finite-N agreement is rejected: the differences from the Gaussian decay as N^(-1/2), so the paper supports only an asymptotic (“weak”) universality, as an observation, not a theorem. | Read |
| NOTE-934 | Barnett, Barrett and Seth — Granger causality and transfer entropy are equivalent for Gaussian variables | For jointly Gaussian stationary processes X, Y and Z, Geweke’s Granger causality F_{Y→X|Z} = ln(|Σ(X|X⁻⊕Z⁻)|/|Σ(X|X⁻⊕Y⁻⊕Z⁻)|) equals twice the transfer entropy T_{Y→X|Z}, for multivariate predictor, predictee and conditioning variables (Eq. 13). The proof: OLS residual covariance is the partial covariance Σ(X|Y), and a Gaussian’s conditional entropy is ½ln|Σ(X|Y)| + ½n ln(2πe). The authors keep G-causality apart from physically instantiated causation. | Read |
| NOTE-935 | Seth — Measuring autonomy and emergence via Granger causality | G-autonomy ga_{X|E} is the log ratio of a variable’s prediction-error variance without and with its own past, given external variables E. G-emergence ge_{M|m} = ga_{M|m}·(1/N)Σ gc_{mᵢ→M} makes a macro variable emergent to the extent that it is both autonomous from and Granger-caused by its micro variables. Validated in a predator–prey model and a boids model, where flocking shows high G-emergence and Granger causation from the flock’s centre of mass to each boid. Seth says the measures are relative to the predictor and the variables included. | Read |
| NOTE-936 | Williams and Beer — Nonnegative decomposition of multivariate information | Redundancy is I_min(S; A₁…A_k) = Σ_s p(s) min_i I(S = s; A_i), the expected minimum specific information. Restricted to antichains of sources and ordered by α ≼ β iff every source of β contains one of α, the collections form a lattice. The Möbius inverse of I_min on it gives partial-information atoms that are nonnegative (Theorem 5) and sum to I(S; R). Interaction information is synergy minus redundancy for three variables and a signed mixture for four, which explains its negativity and its +1 bit for both 3-parity and three copies. | Read |
| NOTE-937 | Bertschinger, Rauh, Olbrich, Jost and Ay — Quantifying unique information | For a target X and sources Y, Z, the unique information of Y is UĨ(X : Y \ Z) = min over Q ∈ Δ_P of MI_Q(X : Y | Z), where Δ_P is the set of joints with the same (X,Y) and (X,Z) marginals. If unique information should depend only on those marginals, this is an upper bound on any such measure, and the shared and synergistic information it implies are lower bounds. It is zero exactly when the other source is Blackwell-sufficient. The measures are non-negative, satisfy the bivariate PI axioms and the identity property, and are a convex programme, but are bivariate only. | Read |
| NOTE-938 | Kraskov, Stögbauer and Grassberger — Estimating mutual information | Two k-nearest-neighbour estimators of mutual information, I⁽¹⁾ and I⁽²⁾ (Eqs. 8–9), from the Kozachenko–Leonenko entropy estimate (Eq. 20) taken at one length scale in the joint and marginal spaces, so that the biases largely cancel. The only approximation is a locally constant density. Numerically the systematic error scales with k/N and vanishes for independent variables, a conjecture without proof; the ordered Weinman exponential is the one case where the stronger form fails. Extensions to multi-information (Eqs. 23, 30). Conditional mutual information is not treated. | Read |
| NOTE-939 | Massey — Causality, feedback and directed information | The textbook DMC, P(y^N|x^N) = Π P(y_n|x_n), is the DMC used without feedback; the right definition is P(y_n|x^n y^{n−1}) = P(y_n|x_n). Directed information I(X^N→Y^N) = Σ I(X^n; Y_n | Y^{n−1}) is at most I(X^N;Y^N), equal without feedback (Theorem 1), and in a causal system bounds what the output says about the source (Theorem 3), so feedback cannot raise DMC capacity. Statistical dependence has no direction; directed information does. | Read |
| NOTE-940 | Schreiber — Measuring information transfer | Defines transfer entropy T_{J→I} as the Kullback entropy between I’s transition probabilities with and without J’s past, at history lengths k for I and l for J (Eq. 4), which is the conditional mutual information I(i_{n+1}; j_n^{(l)} | i_n^{(k)}). It is directional and ignores static correlation. A kernel estimator is proposed. Tent-map and Ulam-map lattices show it detecting the coupling direction where time-delayed mutual information fails; a heart–breath pair shows an asymmetry that the author says a common trigger could also explain. | Read |
| NOTE-941 | Eichler and Didelez — Causal reasoning in graphical time series models | Defines the causal effect of intervening on one component of a stationary multivariate time series on another at a later time, and relates it to strong Granger noncausality through mixed graphs. Under Assumption 2.3 (an intervention independent of the system’s past and of the other contemporaneous variables, and acting on the future only through the present), a missing Granger edge a → b means no effect on b at the next step, a ∉ an(b) means no effect at any horizon, and time-series back-door and front-door criteria identify effects from observational data. A present edge is only “potentially causal”. | Read |
| NOTE-942 | Williams and Beer — Generalized measures of information transfer | With the I_min partial information decomposition, transfer entropy T_{Y→X} = I(X_{t+1}; Y_t | X_t) is the unique information of Y_t about X_{t+1} (state-independent transfer, SITE) plus the synergy of X_t and Y_t (state-dependent transfer, SDTE). SITE alone suffices for perfect open-loop controllability (Theorem 1). Time-delayed mutual information is SITE plus redundancy. Two-source transfer splits into unique, redundant and synergistic parts. On a sleep-apnoea recording, heart→breath transfer is all SDTE. | Read |
| NOTE-943 | Lizier, Prokopenko and Zomaya — Local information transfer as a spatiotemporal filter | Transfer entropy is the expectation of a local transfer entropy, t_{Y→X}(n+1, k, l) = log p(x_{n+1} | x⁽ᵏ⁾_n, y⁽ˡ⁾n)/p(x{n+1} | x⁽ᵏ⁾_n), defined at every point and possibly negative. Apparent transfer entropy conditions on the destination’s past; complete transfer entropy also on its other causal parents. On elementary cellular automata, with k ≥ 6 (rule 110) and k = 16, local transfer entropy highlights gliders and domain walls as the dominant information-transfer structures; k = 1 and local time-lagged mutual information do not. The averages carry none of this. | Read |
| NOTE-944 v2 | Harder, Salge and Polani — A bivariate measure of redundant information | I_min gives 1 bit of redundancy to two independent bits copied into the target, because it compares amounts of specific information and not their direction in the space of distributions over the target. The paper adds an identity axiom, I∩((X,Y); X, Y) = I(X; Y), and defines a bivariate I_red: project each posterior p(z|x) onto the convex hull of the other source’s posteriors, count what survives, take the smaller direction. I_red satisfies all four axioms and gives a nonnegative PID. It agrees with I_min except where I_min overstates redundancy. | Read |
| NOTE-945 | James, Barnett and Crutchfield — Information flows? A critique of transfer entropies | Information flow from X to Y is information in Y attributable solely to X’s past. Transfer entropy is not it. For Y_t = X_{t−1} ⊕ Y_{t−1} it is 1 bit, but the bit is synergistic, carried by both pasts jointly (co-information −1). For Z_t = X_{t−1} ⊕ Y_{t−1} both transfer entropies are 0, and the causation entropies (conditional transfer entropies) are 1 bit each, again localizing a joint bit. By PID, transfer entropy is unique plus synergistic information; conditioning adds synergy, it does not only remove redundancy. | Read |
| NOTE-946 | Ay and Polani — Information flows in causal networks | In a finite causal Bayesian network, X_B is causally independent of X_A imposing X_S if setting x_A after setting x_S leaves X_B’s post-interventional distribution unchanged. For every model on a DAG this holds iff every directed path from A to B meets S (ud-separation, Theorem 2). Information flow I(X_A → X_B | X̂_S) is conditional mutual information with interventional probabilities in place of observational ones, zero under causal independence. Examples show it can differ from conditional mutual information and from transfer entropy in either direction. Example 6’s one bit holds at k = 1, by the reading’s check. | Read |
| NOTE-947 | Giarrocco & Averbeck — sensory and choice information flow between A1 and PFC | In 37 sessions of simultaneous recordings from A1 and dorsolateral PFC of two macaques reporting by bar release whether two tones came from the same side, cue-side information flowed A1 to PFC only (onset 120–147 ms), while choice information (release or hold) flowed first PFC to A1 (onset 315–365 ms after target) and then A1 to PFC (352–419 ms), both peaking near 500 ms, close to the bar release. The flow measure is a lagged regression on one-dimensional projections, so the result is correlational, within a trial, and does not separate the decision from the motor response. | Read |
| NOTE-948 | Kübler & Birbaumer — BCI and extinction of goal-directed thinking in CLIS | Of 35 patients trained with EEG BCIs in Tübingen, degree of paralysis explained BCI performance (η² = .40) only because of the seven in the completely locked-in state, none of whom reached the 70% needed for yes/no communication; without them the relation vanished (η² = .12, n.s.). All seven were already in CLIS when training began. The authors propose, by analogy with the curarized rat, that lost perception of the contingency between a response and its consequences extinguishes goal-directed thinking, while “passive sensory information processing is intact”, and predict that a contingency learned before CLIS and carried into it should prevent extinction. | Read |
| NOTE-949 | Slovic — the construction of preference | A review, from an award address, of the preference-reversal literature. Normatively equivalent elicitation procedures (choice against pricing, choice against matching) give systematically different orderings, and about 90% of reversals violate procedure invariance rather than transitivity. Two mechanisms explain them: an attribute weighs more when it is compatible with the response scale, and the prominent attribute weighs more in choice than in matching. Slovic concludes that for important, complex and unfamiliar options preferences are constructed on the spot in elicitation. The evidence is about the response under each procedure; nothing in it tests whether a constructed preference persists or changes later judgements. | Read |
| NOTE-950 | Ma & Kragel — map-like emotion knowledge in hippocampus and vmPFC | In fMRI of 29 people passively watching 14 emotional films, decoders trained on hippocampal patterns predicted an independent sample’s consensus ratings of 13 emotion categories better than positions in a two-dimensional affective space, and vmPFC showed the reverse; patterns could also be decoded into the activity of a Tolman–Eichenbaum Machine that had learned a grid built from rating correlations by random walk, hippocampus favouring its small-scale conjunctive layer and vmPFC its large-scale structural layer. Effects are small (prediction–outcome correlations of about 0.04–0.10), and no learning in the participants was measured. | Read |
| NOTE-951 | Chaudhary et al. — intracortical spelling in a completely locked-in patient | A man with ALS (born 1985), who had used an eye-movement BCI with an auditory speller until February 2019 and was judged completely locked-in from a few weeks before implantation in March 2019, was given two 64- channel arrays in left motor cortex. Attempted and imagined movements gave no usable signal; from day 86 he was given auditory feedback of firing rate, matched target tones from day 98, and from day 106 spelled with the same speller he had used before CLIS. Over days 106–462 he produced intelligible text on 44 of 107 days on which spelling was attempted, at about 1 character per minute. | Read |
| NOTE-952 | Pattee — the physics of symbols | The epistemic cut is the separation of subject from object, symbol from referent, controller from controlled, which dynamical laws cannot describe without losing the function across it (von Neumann’s regress). Measurement codes a rate-dependent dynamical state into quiescent symbols and control is its converse; both are executed by non-integrable (non-holonomic) constraints. The cut is epistemic, not ontological, and in life it arises first at the genotype–phenotype control interface: in Pattee’s account control of construction came first, not measurement. | Read |
| NOTE-953 | Sung, Rigotti & Lee — factorized goal and uncertainty codes in lateral PFC | A reanalysis of 20 people’s fMRI from a 2014 two-stage Markov task with cued goals and block-wise transition noise. Goals and transition uncertainty are linearly decodable, weakly, from vlPFC, dlPFC and OFC, in a geometry whose nonlinear dichotomies decode worse than goal and linear ones (“factorized”), and a goal decoder trained under one noise level transfers to the other. Goal separability and transfer in lateral PFC correlate with choice flexibility and optimality across subjects; uncertainty separability does not. Unfitted model-free agents show a flexibility–stability trade-off that model-based agents and humans do not. | Read |
| NOTE-954 | Powers, Clark & McFarland — General Feedback Theory, Part I | Builds a hierarchy of negative-feedback control systems in which each order perceives only the feedback signals of the order below and acts only by setting their references, which are replayed recordings of their own past perceptions. An “imagination connection” sends those references back into the higher system’s perception, so that it can remember, plan “mentally”, hallucinate and dream, under a “mixing control” the authors cannot specify (“We are open to suggestions”, p. 20). An inherited N-system, driven by error in intrinsic physiological variables, reorganizes the network at random, forming new input functions as well as new outputs; an organization persists when the behaviour it produces lessens intrinsic error. | Read |
| NOTE-955 | Fuchs, Mermin & Schack — an introduction to QBism | QBism in eight pages. Quantum states and all probabilities, 0 and 1 included, are an agent’s personal judgements; a measurement is “any action an agent takes to elicit a set of possible experiences”, and its outcome is the experience it elicits. The agent applies quantum mechanics to everything external to her, other agents and their reports included, and to nothing but her “own direct internal awareness of her own private experience”. Locality follows because one agent’s experiences are time-like separated; the Bell parameter λ is set outside physical science. No theorem or model: an interpretive essay. | Read |
| NOTE-956 | Parr & Friston — attention or salience? | A short review that separates two things called attention: gain control, which weights currently available sensory data by their estimated precision, and salience, the expected information gain of an action (typically a saccade) that would acquire new data. It then ties them together: a saccade is driven by a prediction that a location will be sensed with high precision, so covert attention to a place biases an overt saccade there, which the authors read as support for the premotor theory. | Read |
| NOTE-957 | Feldman & Lynch — self-generated validity | A theoretical paper, with no new data. When the belief, attitude or intention asked about is not already in memory, the question creates it, and the created answer is later retrieved as an input to other answers and to behaviour; when it is in memory, question order and format still decide which earlier answer is used. An earlier response is used for a later one if it is accessible and more diagnostic than other accessible inputs. Expertise, direct experience and trait involvement reduce the effects, because they supply judgements already formed and rehearsed. | Read |
| NOTE-958 | Sandved-Smith et al. — computational phenomenology of mental action | A three-level discrete active-inference model in which attentional states set the precision of the perceptual likelihood and meta-awareness states set the precision of the attentional likelihood; mental action is a choice of ‘stay’ or ‘switch’ over attentional states, defined at the second level only, against a preference to observe oneself ‘focused’. Simulations reproduce the cycle of focus, mind-wandering, noticing and refocusing, with longer mind-wandering under low meta-awareness. The stimuli are fixed by the generative process, so mental action changes only how strongly they update belief; the likelihoods themselves are not learned. | Read |
| NOTE-959 | Powers, Clark & McFarland — General Feedback Theory, Part II | Names six orders of perception, from spinal loops through sensations, configurations, sequences and relationships to system concepts, with demonstrations whose reaction times lengthen with order (about 0.3 s at third order, 0.4–0.45 s at fourth). The N-system “merely alters the properties of a system, thus changing the transformations applied to existing information” (p. 37): reorganization is a change of perception, felt as insight, and a new perceptual organization can be vetoed by imagining its use. Consciousness is defined as a feedback function under N-system action. Conflict freezes a lower system at a virtual reference, and a system switched “entirely to the imagination-connection” is one of the ego’s defences. | Read |
| NOTE-960 | Friston et al. — action and behavior: a free-energy formulation | Existence is taken to require a low-entropy ensemble density; an ergodic assumption turns that entropy into time-averaged surprise, and because the setup stipulates that action is the only way an agent changes the hidden states it senses, action as well as perception must minimize a free-energy bound on surprise. Action enters nowhere in the generative model: it is a gradient descent that fulfils proprioceptive and visual predictions, and in simulations of eye, arm, mountain-car and Lorenz movements it cancels unexpected perturbations so they are not perceived. The paper fixes the model and re-samples the data, and answers the worry that this confirms a wrong model by appeal to existence: agents without the right priors cannot exist. | Read |
| NOTE-961 | Bruno et al. — self-assessed well-being in chronic locked-in syndrome | Of 168 members of the French LIS association invited, 91 answered and 65 gave usable ratings: 47 (72%) rated their present life at or above the midpoint between their best period before LIS and their worst period ever (median +3), 18 (28%) below (median −4). Happiness was associated with longer time in LIS (OR 1.5 per year), recovered speech (OR 20.5) and absence of anxiety (OR 0.19). All had chronic LIS after a brainstem vascular accident, a median of 8 years earlier; 55% had recovered some speech and 70% some limb movement, and answers were given with a proxy’s help. | Read |
| NOTE-962 | Owen et al. — detecting awareness in the vegetative state | A 23-year-old woman who met the clinical criteria for the vegetative state five months after a traumatic brain injury, told in the scanner to imagine playing tennis or walking through her house, activated the supplementary motor area for the first and parahippocampal, posterior parietal and lateral premotor cortex for the second, as 12 healthy volunteers did. The authors take her compliance as “a clear act of intention” that “confirmed beyond any doubt” her awareness. No question was asked or answered. | Read |
| NOTE-963 | Powers — Feedback: Beyond Behaviorism | A control system “will produce whatever output is required in order to achieve a constant sensed result” (p. 77), so behaviour is the control of input, not output, and stimulus-response laws follow from the environment once the controlled quantity is found. Above the lowest level a system’s output is a reference level for the level below, so the hierarchy closes through lower systems down to muscle effort sensed kinesthetically; its top is a set of inherited intrinsic reference levels whose error drives reorganization. The paper says nothing about imagination: every loop it describes closes through the environment. | Read |
| NOTE-964 | Monti et al. — willful modulation of brain activity in disorders of consciousness | Of 54 patients diagnosed vegetative (23) or minimally conscious (31), 5, all with traumatic injury, produced task-specific fMRI activity to motor and spatial imagery commands; 4 had been admitted as vegetative, and 2 of those showed no behavioural sign of awareness at the bedside even after the scans were known. One patient, Patient 23, answered five of six autobiographical yes/no questions correctly by choosing which imagery to perform, the investigators scoring blind; the sixth gave no signal. He was not one of the two behaviourally unresponsive patients: retesting found inconsistent signs of a minimally conscious state, but no bedside communication. | Read |
| NOTE-965 | Rauh, Bertschinger, Olbrich and Jost — Reconsidering unique information | Theorem 2: no redundancy function on the Williams–Beer lattice satisfies symmetry, self-redundancy, monotonicity, non-negative atoms and the identity axiom. In XORCOPY (two independent bits, their XOR, and the target their joint copy) identity forces three 1-bit atoms {i}{jk} under a 2-bit total, so {12}{13}{23} ≤ −1. Bertschinger et al.’s bivariate measures cannot be extended to that lattice. Their unique information is monotone in each argument as expected; their shared and synergistic information violate left monotonicity. | Read |
| NOTE-966 | Griffith and Koch — Quantifying synergistic mutual information | Synergy is the whole minus the union of its parts. S_VK = I(X_1…n : Y) − I_VK, where the union information I_VK is the least I*(X_1…n : Y) over joints that keep every source–target marginal. It sits between WholeMinusSum and S_max, which respectively subtract redundancy and count unique bits as synergy, and correlational importance measures something else. Versions 1–2 held that independent predictors share no information about the target; v6 withdraws it. For two predictors I_VK is Bertschinger et al.’s optimisation, so S_VK is their CI. | Read |
| NOTE-967 | Griffith, Chong, James, Ellison and Crutchfield — Intersection information based on common randomness | The redundancy is the information about the target in the Gács–Körner common random variable of the sources, I_∧ = I(X_1 ∧ … ∧ X_n : Y): the largest I(Q : Y) for Q a function of every source. It is defined for any n, satisfies target monotonicity, which no earlier measure did, and lies below I_min. But it is zero whenever the sources have full support, so it fails identity and continuity, and its synergy goes negative. A zero-error variant satisfies identity in zero-error form and goes negative too. | Read |
| NOTE-968 v2 | Ince — Measuring multivariate redundant information with pointwise common change in surprisal | I_ccs measures redundancy as the expected local co-information over only those events where each source, the joint source and the overlap change the target’s surprisal in the same direction, under the maximum-entropy joint matching source–target and joint-source marginals. Defined for any number of sources. It keeps symmetry, self-redundancy, subset equality and an independent-sources identity, and drops Harder et al.’s identity, monotonicity and non-negative atoms. A game-theoretic argument that unique information depends on the source–source marginal is offered against Bertschinger et al. | Read |
| NOTE-969 | Eyink and Aluie — Localness of energy cascade I | Builds an exact band-pass decomposition of kinetic energy from smooth filters, a multiscale Germano identity, in which each band’s energy changes by the flux into it minus the flux out. It then restates, with heuristic sketches, Eyink’s (2005) bounds: under a scaling hypothesis on velocity increments with exponents strictly between 0 and 1, the mean energy flux across ℓ takes at most O((ℓ/Δ)^(2/3)) from scales above Δ and O((δ/ℓ)^(2/3)) from scales below δ. It argues, without proof, and checks on one 512³ simulation, that sign cancellations give Kraichnan’s faster 4/3 decay. Locality here is in scale, for one field. Nothing in it bears on units. | Read |
| NOTE-970 | Granero-Belinchón, Roux and Garnier — Scaling of information in turbulence | Estimates, with k-nearest-neighbour estimators, the conditional entropy of a velocity sample given samples a lag τ before it (the “entropy rate”) on one Modane wind-tunnel record, as a function of τ. It finds slopes of −1/3 (inertial) and −1 (dissipative) against log of inverse lag, and shows these are S₂’s scaling through a Gaussian formula the data obey. A sign-of-increment conditioning gives unequal entropy rates, which the paper reads as proof of the energy cascade. That inference fails: one-point skewness alone produces the inequality. No information quantity is tied to the energy balance, and none is transferred. | Read |
| NOTE-971 | Wiskott and Sejnowski — Slow feature analysis | Finds instantaneous functions y = g(x(t)) whose outputs vary as slowly as possible, minimizing ⟨ẏ²⟩ under zero mean, unit variance and decorrelation. Over a fixed nonlinear expansion (all monomials of degree one and two), the problem is solved in closed form by sphering and then taking the smallest eigenvectors of the derivative covariance, a generalized eigenproblem. Stacked modules learn translation, size, rotation, contrast and, less well, illumination invariance for 1-D patterns, depending only on the training stimulus. The closed form is proved; everything about invariance, generalization and hierarchy is demonstrated on synthetic signals. The premise that slower means more abstract is assumed, not shown, and no generative model is used. | Read |
| NOTE-972 v2 | Raju, Machta and Sethna — Information loss under coarse graining | For a Boltzmann distribution linear in its couplings, the Fisher information that coarse-grained data lose is the expected conditional covariance of the energy operators. Under an exact RG step with linear beta functions it is the Hessian of the analytic constant, so the singular part of the metric is kept. In the diffusion model it is exact: the metric scales as n^(1−μ) by Hermite order. The claims that every relevant direction is kept and that irrelevant ones contract at b^−(d−2λ) rest on a scaling argument. On the paper’s own scalings the dividing line is λ = d/2, not 0. | Read |
| NOTE-973 | Parish and Duraisamy — Non-Markovian closure for LES via Mori–Zwanzig | Derives large-eddy-simulation closures from the Mori–Zwanzig identity by Stinis’s finite-memory approximation, which turns the memory integral into auxiliary relaxation equations, a finite Markovian augmentation of the resolved modes. Its error is not bounded and its memory length is fitted (Burgers: τ₀ ≈ 0.2 over the spectral radius of the resolved Jacobian) or preset. Against filtered DNS it matches dynamic Smagorinsky on isotropic turbulence and channel flow, beats Smagorinsky and the t-model on the Taylor–Green vortex, and puts the subgrid drain at the cutoff, as DNS does. | Read |
| NOTE-975 | Chorin, Hald and Kupferman — Optimal prediction with memory | Writes the resolved components of an ODE with random unresolved initial data as an exact generalized Langevin equation (Markovian term, memory, noise) under three projections, and approximates the memory two ways: by solving a Volterra equation for its expansion coefficients from Monte Carlo correlation functions, and by the t-damping (t-model) equation dΦ/dt = R(Φ) + tS(Φ), which needs no prior data. On one 4-variable Hamiltonian example both restore the decay of the conditional mean that the Markovian truncation misses, the Volterra scheme to about t ≈ 8. No error bound for any approximation, and no Markovian augmentation. | Read |
| NOTE-976 | Shalizi and Crutchfield — Information bottlenecks, causal states and statistical relevance bases | A three-page note. For memoryless transduction X → Y, the causal states are the cells of the partition of inputs by p(y|x). Among partitions that keep all information about Y, they have the least entropy. The note asserts, calling it evident, that these are what the information bottleneck delivers as β → ∞, and that Salmon’s statistical relevance basis is the same construction. It proves neither, and it says nothing about the IB solutions at finite β, nor whether they nest. The record supplies the proof of the limit and shows that every finite-β optimum is a stochastic coarsening of the causal partition (THEORY-743). | Read |
| NOTE-977 | Shpak, Stadler, Wagner and Altenberg — Simon–Ando decomposability and fitness landscapes | States Simon and Ando’s (1961) theorem for x(t+1) = (A* + εC)x, with A* block-diagonal, as existence statements: as ε → 0 the non-leading eigenvectors approach the blocks’, and times T0 < T1 < T2 < T3 exist that separate within-block relaxation, quasi-equilibrium, aggregate cross-block dynamics and global equilibrium. No rate in ε and no bound on aggregation error is given. It then applies an entrywise proxy (minimal within-class rate ≫ maximal cross-class rate) to mutation–selection on hypercubes, which low mutation rates meet trivially, and to recombination, which rarely meets it. It concludes that Simon–Ando aggregation is one source of dynamical sufficiency among several, distinct from symmetry (equitable partitions) and from linkage-equilibrium character aggregation. | Read |
| NOTE-978 | Crutchfield and Shalizi — Thermodynamic depth of causal states | The rate at which Lloyd and Pagels’ thermodynamic depth grows (the dive) is the entropy rate of whatever macrostate process it is computed over. So depth measures randomness. Lumping or splitting macrostates sets it to any value from zero up. The paper proposes the causal states as the macrostates. Among partitions of the past that predict the future as well as the past does, they are the coarsest, with the least statistical complexity and the least dive (THEORY-756). Several errors are noted. One stated entropy rate is in fact a single-symbol entropy, a footnote makes prescience vacuous, and a strict inequality fails in general. The result survives. The “objectivity” is relative to the measuring instrument, as the paper’s own logistic-map example shows. | Read |
| NOTE-979 | Shpak, Stadler, Wagner and Hermisson — Aggregation of variables and system decomposition | Separates aggregation of variables, a lower-dimensional map y = Qx whose dynamics close, from decomposition into non-interacting subsets: either can hold without the other. For a linear system the aggregate operator must satisfy ĀQ = QA. For a partition, the block sums close for every state exactly when the partition is column-equitable. Equitable partitions of mutation–selection matrices reduce single- and two-peak fitness landscapes exactly, and fail for three or more peaks unless the classes are refined to overlap classes. Simon–Ando aggregation is treated as the approximate limiting case, without error bounds. | Read |
| NOTE-980 | No, Ingber and Weissman — Strong successive refinability | Extends successive refinement to second order. For finite alphabets, a two-stage code can reach both decoders’ rates with their dispersion terms if the source is successively refinable throughout a neighbourhood of its law (Corollary 6), which holds for any discrete source under Hamming distortion; the Gaussian under squared error is shown directly. Layered codes then use L_n refinement stages to cut encoding complexity, at a rate penalty of order L_n log n / n, for binary and Gaussian sources. It does not treat logarithmic loss, which the reading that named it had recalled; the log-loss refinability result is No and Weissman’s, concerns direct log-loss with soft reconstructions of the source itself, and does not reach the information bottleneck, whose loss is remote. | Read |
| NOTE-981 | Charvin, Catenacci Volpi and Polani — Exact and soft successive refinement of the IB | Defines successive refinement for the information bottleneck as extending a coarse optimum T₁ to a fine optimum (T₁, S), and shows it equivalent to some pair of optima forming X → T₂ → T₁. With an injective fine decoder, it is also equivalent to the coarse decoder points lying in the convex hull of the fine ones, which a linear programme checks. Refinability is proved for binary X and Y, for Y a function of X, and for jointly Gaussian variables. Numerically the hull test on computed optima often fails, and the loss, measured by unique information, stays under a few percent. Those failures are uncertified. Run here with certified optima, the test shows that the four-state source of CLAIM-387 is not refinable between β = 8 and β = 12: its stochastic optima do not nest either. | Read |
| NOTE-982 | Constantin, E and Titi — Onsager’s conjecture on energy conservation | A one-page proof that a weak solution of the 3D incompressible Euler equations on the periodic box conserves energy if it lies in L³(0,T; B^α_{3,∞}) ∩ C([0,T]; L²) with α > 1/3. The flux of energy into scales below a mollification scale ε is written exactly as a commutator, (u⊗u)^ε − u^ε⊗u^ε = r_ε − (u−u^ε)⊗(u−u^ε), of size ε^(2α), against a gradient of size ε^(α−1), so the flux is O(ε^(3α−1)) and vanishes. This is the positive half of Onsager’s conjecture only. It does not show that rougher solutions dissipate. Two printed formulas in the manuscript are wrong as typeset, without effect on the result. | Read |
| NOTE-983 | Rahaman et al. — On the Spectral Bias of Neural Networks | A ReLU network is piecewise linear, so its Fourier transform falls as k^(−d−1) along almost every direction and as k^(−2) along the normals to the faces of its linear regions; that is proved for compactly supported networks only. Trained networks fit low frequencies first, even when high frequencies carry ten times the amplitude, and high-frequency components are the first to be destroyed by parameter noise; both are experiments. The tie from the decay to the order of learning is a heuristic bound, and the volume “proof” in Appendix D does not hold. On a curve embedded in the plane, high latent frequencies are fitted more easily as the curve gets more petals. The paper puts this down to the shape of the curve, but most of it comes from the curve getting longer. | Read |
| NOTE-984 | Coifman and Maggioni — Diffusion wavelets | A self-adjoint diffusion operator T with spectrum in [0, 1] defines a multiresolution analysis by thresholding its dyadic powers at a precision ε: V_j is spanned by the eigenvectors with λ^{t_j} ≥ ε, so the V_j are exactly nested spectral subspaces and the wavelet spaces W_j are spectral bands, about one octave of the generator each. The paper’s contribution is an algorithm that builds localized orthonormal bases for approximations of these spaces without computing eigenvectors, by squaring the operator on each compressed basis. As written, that algorithm thresholds T^{2^{j−1}}, not T^{2^j−1} as the paper states, and the paper’s own Fig. 9 follows the former. Localization, stability and the near-linear complexity are argued or observed, not proved for the compressed algorithm. | Read |
| NOTE-985 | Coifman and Lafon — Diffusion maps | A symmetric non-negative kernel normalized into a reversible Markov chain gives a family of diffusion distances D_t, one per number of steps t, and an embedding by eigenvectors weighted by λ_l^t in which Euclidean distance is D_t. An α-normalization by a kernel density estimate makes the small-bandwidth limit the graph Laplacian with a density potential (α = 0), the Langevin generator whose invariant density is the sampling density (α = 1/2) or the Laplace–Beltrami operator (α = 1). The truncation is claimed accurate to relative precision δ, which is wrong: the bound is absolute. Several displays carry errors, and the heat-kernel proof has a gap. | Read |
| NOTE-986 | Nadler, Lafon, Coifman and Kevrekidis — Diffusion maps and reaction coordinates | Ties diffusion maps to the dynamics that generated the data. For samples from p = e^{−U}, the small-ε generator of the α-normalized walk is Δψ − 2(1 − α)∇ψ·∇U: the graph Laplacian (α = 0) gives Fokker–Planck with potential 2U, α = 1/2 gives the Langevin dynamics with potential U itself, and α = 1 gives Laplace–Beltrami. So the slow eigenfunctions of the α = 1/2 map approximate the slow modes of the sampled stochastic system, and the paper proposes them as reaction coordinates. The expansions are formal, and with the paper’s kernel every printed generator is too large by a factor of two. Its double-well example is separable. From equilibrium samples the slow eigenfunction is recovered well and the slow eigenvalue is not. That slow eigenfunctions are closed in mean, and in law only under a condition, is the record’s addition. | Read |
| NOTE-987 | Rosas, Mediano et al. — Reconciling emergences | The primary paper behind LIT-025. A supervenient feature V is causally emergent of order k iff Un⁽ᵏ⁾(V_t; X_t′ | X_t) > 0; a system has one iff Syn⁽ᵏ⁾(X_t; X_t′) > 0, and the witness the proof gives is the microstate itself. Syn⁽ᵏ⁾ = D⁽ᵏ⁾ + G⁽ᵏ⁾ by definition of the ΦID atoms. The practical criteria Ψ, Δ, Γ are redundancy-free and sufficient only, and as proved they certify the system’s capacity, not the candidate feature: under the minimum-MI decomposition the parity of two independent self-copying bits has Ψ = 1 bit and no emergence. Ψ is the whole-minus-sum information about V’s next value minus V’s one-step dynamical dependence, which ties it to Barnett–Seth dynamical independence (THEORY-764). | Read |
| NOTE-988 v2 | Equitz and Cover — Successive refinement of information | Defines successive refinement: a description at distortion D₁, followed by an addendum reaching D₂ < D₁, with both stages at the rate–distortion limit. For finite alphabets it proves this possible iff some pair of optimal test channels forms a Markov chain X → X̂₂ → X̂₁, so that the coarse reconstruction is a stochastic degradation of the fine one, not necessarily a function of it. The condition holds for every discrete source under Hamming distortion, and the paper also shows it for the Gaussian under squared error and the Laplacian under absolute error. It fails for the three-letter source (1−p, 2p, 1−p)/2 under absolute error when p < 3 − 2√2, where the finer optimum uses fewer reproduction letters than the coarser. The whole result is asymptotic, for block codes. The paper’s own Fig. 1 shows that single-shot optimal quantizers of a Gaussian do not nest even though the Gaussian is refinable. | Read |
| NOTE-989 | Chorin, Hald and Kupferman — Optimal prediction and the Mori–Zwanzig representation | Writes Zwanzig’s nonlinear Mori–Zwanzig identity with the projection taken as conditional expectation on the resolved variables under an invariant measure: ∂ₜSᵗA = R(SᵗA) + ∫₀ᵗ K(s, S^{t−s}A) ds + S⊥ᵗF, with R(A) = E[LA|A], F = LA − E[LA|A] and K(s, A) = E[LS⊥ˢF|A]. First-order optimal prediction, dv/dt = R(v), is that identity with the memory and noise dropped, and for a canonical Hamiltonian system it is Hamiltonian in a renormalized 𝓗 = −log∫e^{−H}. In a perturbative nonlinear Schrödinger example with one resolved mode, a memory kernel cut off at a hand-chosen time recovers the decay of the conditional mean that the Markovian scheme misses. The paper states no fluctuation–dissipation relation and no criterion for when the Markovian term suffices. | Read |
| NOTE-990 | Lush, Botan, Scott, Seth, Ward & Dienes — Trait phenomenological control and the rubber hand illusion | Hypnotisability predicted rubber hand illusion reports after both synchronous and asynchronous brushing (n = 353, about half a scale point per SWASH point, rs 0.26), a visual control item as well, and synchronous drift weakly (rs 0.11); it also predicted vicarious pain and mirror touch. The expectation manipulation failed and the pre-registered difference-score test was inconclusive, so the study shows that the standard controls do not exclude suggestion, not that the illusion is suggestion. | Read |
| NOTE-991 | Apps & Tsakiris — The free-energy self | A free-energy account of self-recognition and body ownership. One’s own body, face and voice are represented probabilistically as “me” by a high-level multimodal prior learned from cross-modal correlations, and the self is “the most parsimonious and accurate explanation for sensory inputs”. The rubber hand, enfacement and rubber-voice illusions are one effect: synchronous stimulation leaves unimodal surprise that multimodal areas explain away by shifting probability from one’s own body part to the other’s. Context acts as a prior. No brain area is self-specific. The authors grant there is little direct evidence and that the account is hard to falsify with standard fMRI. | Read |
| NOTE-992 | Abdulkarim & Ehrsson — No causal link between hand position sense and limb ownership | A motor slid the hidden hand 8 cm toward or away from the rubber hand during brushing, too slowly to be noticed. Pointing followed it by about 5–6 cm, but questionnaire ownership depended only on synchrony and not on where the hand was moved, in two experiments of 18. With the hand still, the classic synchronous drift and its correlation with the illusion reappeared. The authors conclude drift is not a cause of ownership; the null is from small samples within the illusion’s known spatial range. | Read |
| NOTE-993 | Kalckert & Ehrsson — Moving a rubber hand that feels like your own | A moving rubber hand illusion in which the participant’s hidden finger moves a model finger by a rod. Synchrony gave ownership, agency and drift toward the model; asynchrony removed all three. Passive movement removed agency and kept ownership and drift; a model hand rotated 180° removed ownership and drift and kept agency. The double dissociation is on questionnaires; agency was stronger, and tied to ownership, only when the hand was owned. | Read |
| NOTE-994 | Borg, Harrison, Stazicker & Salomons — Is the folk concept of pain polyeidic? | Six objections to the experimental philosophers’ claim that the folk concept of pain is bodily, not mental: small and skewed samples, acute pain only, a loaded “in the mind” probe, means near neutral, a non-Cartesian mental reading of the same data, and an invalid step from “partly bodily” to “bodily”. Pilot vignettes in which damage never hurt drew mind-centred answers. The authors propose that the folk concept is “polyeidic”: several framing-sensitive dimensions, of which mental/bodily is one. | Read |
| NOTE-995 | Starmans & Bloom — Windows to the soul | Asked which of two pictured flies or snowflakes was “closer to” a cartoon character, preschoolers and adults chose those near the eyes, even when the eyes were on an alien’s chest and even over positions the character could see. The authors conclude that people intuitively locate the self at or near the eyes, and, since 4-year-olds do it too, not from learned ideas about the brain. The judgement is about where another, drawn person is; the step to the self, and on to a “phenomenological sense” of where we reside, is assumed and not tested. | Read |
| NOTE-996 | Nichols & Bruno — Intuitions about personal identity | Survey studies of Arizona undergraduates on Williams’s personal-identity cases. A transplant case makes memory look necessary for being “still Jim”; a stripped-down Pain case has about 70% say “you will feel the pain” after distinctive mental states are wiped; neither depends on first- or third-person telling, so Williams’s explanation by person fails here. Abstract questions and a forced choice favour psychology (over 80%; 64%, p = 0.053). The authors weigh intuitions by robustness and conclude for a psychological criterion conditionally. The results describe a concept under framing; they do not show what persistence is, and the Pain item may test bare sentience, not identity. | Read |
| NOTE-997 | Ehrsson et al. — No specific relationship between hypnotic suggestibility and the rubber hand illusion | A reanalysis of Lush et al.’s (2020) open data, n = 353. The synchronous-minus-asynchronous difference in rubber-hand illusion ratings is unrelated to hypnotisability (rho = -0.066, BF01 = 5.7), is significant in every hypnotisability quartile, and is not changed by explicit suggestions about which condition should work; the hypnotisability correlations Lush et al. report appear equally for the asynchronous condition and an “impossible” control item. The authors conclude the illusion is a perceptual one, “driven primarily by multisensory mechanisms”. The reply grants every number and disputes that the asynchronous condition controls for expectation. | Read |
| NOTE-998 | Hohwy & Paton — Explaining away the body | With a foreign arm seen exactly where one’s own arm lies, synchronous tapping raised ratings that the felt touch was produced on the seen arm, and after onset also that a finger hovering 5 cm away caused it or that it was caused on a cardboard box; the box gave no synchrony difference without prior onset. Samples of 9 to 13, single leading questions, no ownership item, no expectation measure, and a 0.13 °C cooling of the real hand in one comparison of four, significant only one-tailed. | Read |
| NOTE-999 | Lenggenhager, Tadi, Metzinger & Blanke — Video ergo sum | In video virtual reality, synchronous stroking of one’s back and of a body seen 2 m ahead made people rate that body as theirs and shift their felt self-location about 17–25 cm toward it, in two samples of 14; a mannequin worked, a box mostly did not. Nobody felt disembodied or saw from elsewhere, so the authors claim a partial, heautoscopy-like state, not an out-of-body experience. The effects are modest and partly inconsistent, and critics argued they may be self-recognition in a video system rather than an illusion of ownership. | Read |
| NOTE-1000 | Seth — Interoceptive inference, emotion, and the embodied self | An opinion article that extends predictive coding to interoception. Felt emotion is the content of hierarchical top-down predictions of the causes of interoceptive signals. Prediction errors are registered in the anterior insula, and are also cancelled by autonomic action under attenuated precision. The experience of body ownership is the same inference run over interoceptive and exteroceptive signals together. The evidence is indirect and cited: insula anticipation and error responses, false cardiac feedback, interoceptive sensitivity predicting rubber-hand susceptibility, and a heartbeat-synchronous virtual hand owned more. No direct test is claimed. | Read |
| NOTE-1001 | Roseboom & Lush — Serious problems with interpreting rubber hand illusion experiments | Resampling 351 synchronous-condition reports from Lush et al. 2020 into 10,000 studies of 20, the authors find that samples from above the median of hypnotisability almost always “find” the rubber hand illusion, and samples from below it find agreement with the ownership statement about 4% of the time. The ownership result holds at n = 50; the result for the averaged statements is largely a matter of power. No asynchronous condition, drift or new data are analysed. | Read |
| NOTE-1002 | Blanke & Metzinger — Full-body illusions and minimal phenomenal selfhood | Names minimal phenomenal selfhood (MPS), the simplest experience of being a self, and gives it three dimensions: global self-identification with the body, self-location, and a weak, geometrical first-person perspective. Part ownership (rubber hand, somatoparaphrenia) does not reach MPS; out-of-body experience, heautoscopy and full-body illusions do, varying it dimension by dimension. A passive multisensory sense of owning the whole body suffices, so agency is causally enabling but not constitutive. The necessity and sufficiency claims are asserted, not shown. | Read |
| NOTE-1003 | Lush & Seth — Reply to: No specific relationship between hypnotic suggestibility and the rubber hand illusion | The reply to Ehrsson et al. accepts their reanalyses and denies their reading: expectancies are higher for synchronous than asynchronous brushing, the difference does not vary with hypnotisability (b = -0.16, P = 0.072, B = 0.07), so a null relation between hypnotisability and the synchrony effect is what demand characteristics predict. Agreement with the ownership item rises with hypnotisability (b = 0.76 per SWASH point, rs = 0.27) and reaches minimal agreement only in the top 31%. Whether multisensory integration matters to RHI measures awaits experiments that control expectation. It shows that the suggestion control THEORY-765 accepts can be met without the confound being removed. | Read |
| NOTE-1004 | Longo et al. — What is embodiment? A psychometric approach | 131 people rated 27 statements after synchronous and asynchronous brushing of a rubber hand. Principal components analysis found embodiment of the rubber hand, loss of own hand, movement and affect in both conditions and deafference after asynchrony only; embodiment split into ownership, location and agency. Ownership and location crossed from negative to positive with synchrony and each predicted proprioceptive drift (1.34 cm against 0.30 cm); agency stayed negative. No control separates any of it from expectation. | Read |
| NOTE-1005 | Lush — Demand characteristics confound the rubber hand illusion | People told about the rubber hand procedure, but never put through it, expect the illusion statements more than the control statements and more under synchronous than asynchronous brushing (d = 1.40 and 1.05, n = 20), which is the pattern published reports show. So the field’s standard controls do not control for suggestion. The paper does not show that the illusion is suggestion, and says so. | Read |
| NOTE-1006 | Botvinick & Cohen — Rubber hands ‘feel’ touch that eyes see | The founding report of the rubber hand illusion. Synchronous brushing of a seen rubber hand and the hidden real hand made ten subjects feel the touch at the rubber hand and feel it as their own; after 30 minutes, blind reaches drifted toward the rubber hand in proportion to how long the illusion lasted, and asynchronous brushing removed both effects. The authors read it as constraint satisfaction among vision, touch and proprioception, and conclude that intermodal matching “can be sufficient for self-attribution”. | Read |
| NOTE-1007 | Reuter, Sienhold & Sytsma — Putting pain in its proper place | Three online studies on the “pain is in my fingertip, the fingertip is in my mouth” argument. People reject its conclusion for pain about as much as for tissue damage and inflammation, and accept it for a paper-clip; across fourteen items, acceptance tracks how misleading the conclusion is rated; and “technically speaking” wording raises acceptance. The authors explain the argument’s failure by implicature, not by an intensional “pain” or a non-spatial “in”, and conclude that the data favour a bodily conception of pain. | Read |
| NOTE-1008 | Alsmith & Longo — Where exactly am I? | Ten adults pointed a rotating pointer “directly at” themselves, by hand blindfolded or by eye. Answers fell mostly on the upper face or the upper torso, and the pointer’s starting position, above or below, decided which. The authors conclude that the self is judged neither spread over the body nor at one point, and that the spatial concept of the self is “inherently ambiguous”. A pilot-sized study with a fifth of its trials lost and a misreported reanalysis; its start effect is also what a first-acceptable-stop strategy predicts. | Read |
| NOTE-1009 | Rohde, Di Luca & Ernst — Feeling of ownership and proprioceptive drift do not go hand in hand | With robot stroking and a visual probe of felt finger position, drift toward a rubber hand was as large when the hand was only seen as under synchronous stroking (about 6 cm), and as large under asynchronous stroking interrupted every 10 s; only continuous asynchrony kept it near zero. Ownership by questionnaire needed synchrony. The authors conclude that drift is visuo-proprioceptive integration that asynchrony suppresses, separate from ownership, and not a proxy for it. Groups of ten; the vision-only ownership report is anecdotal. | Read |
| NOTE-1013 v2 | Buckmaster, De Lellis, Székelyhidi and Vicol — Onsager’s conjecture for admissible weak solutions | The admissible version of the negative half of Onsager’s conjecture. For every β < 1/3 and every smooth strictly positive e(t) on [0, T] there is a C^β weak solution of 3D Euler on the torus with ∫|v|² = e(t) exactly, so with e decreasing the energy only falls and the coarse-grained flux runs into vanishing scales on every time interval (THEORY-776). That is the one-way transfer Isett’s solutions lacked, but one-way only for the box as a whole (no local energy inequality), and chosen by the prescribed profile, since an increasing e works just as well. | Read |
| NOTE-1014 | Boyle — The Line: AI and the Future of Personhood | A law professor’s essay on the line between persons and things, run across four cases: AI, corporations, nonhuman animals and transgenic entities. Personhood is pressed on two tracks, empathy-driven moral reasoning and efficiency-driven legal engineering, and the corporate history shows the second track working without a theory. Boyle predicts some intermediate legal status for AI, argues that capacity-based criteria cannot escape a species-bound standpoint, and ends on a hybrid of species membership as of right plus capacity. It argues and predicts; it does not measure. | Read |
| NOTE-1015 | Schüler and Wiskott — Slow feature analysis as variational inference | Under a Gaussian random-walk prior on the latents and an encoder N(g(x_t), I) that sees one time step, the ELBO is a per-point reconstruction term minus half the unordered slowness loss, an exact identity (up to a constant the paper drops by a slip). The reconstruction term stands in for SFA’s constraints, by argument. In the linear case the paper gives only a necessary condition; solving it here shows the optimum recovers SFA’s slow span on whitened input, cut at lag-one autocorrelation ½, with no basis or order, and departs from SFA on raw input. Its two-sentence account of Turner and Sahani is not a substitute for reading them. | Read |
| NOTE-1016 | Tushnet — Worth a Thousand Words: The Images of Copyright | Copyright law takes the word as its model and treats images as either transparent or opaque, with incoherent results in copyrightability, infringement, authorship and fair use. Realism is a style, not a fact. Describing an image changes how it is seen and remembered, so a test that asks factfinders to dissect works in words and then judge their gestalt cannot work. The proposed cure is a reproduction right against near-exact copies plus a narrowed derivative-works right. | Read |
| NOTE-1017 | Balganesh — The Immanent Rationality of Copyright Law | A review essay on Drassinower’s What’s Wrong with Copying?. It reports a Kantian, rights-based account on which a work is a communicative act and infringement is compelled speech, praises its coherence, and defends rationalist theorizing against the charge that it is faith-based. It then objects that the method needs a criterion of what is fundamental, a defence of autonomy if it is to justify, an account of copyright’s private-law enforcement, and room for change over time and for instrumental reasoning at the level of the system. | Read |
| NOTE-1018 | Machta, Chachra, Transtrum and Sethna — Parameter space compression | Two physics models are not sloppy at their microscopic scale and become so when observed coarsely. For the hopping model the Fisher eigenvalues of the density at time t scale as t^(3/2−k), proved here (THEORY-774). For a decimated critical Ising model, Monte Carlo shows the field and temperature eigenvalues staying put while the rest fall in bands drawn at b^(2y−d) per step (THEORY-777, Proposed). That rate, the source of LIT-1254’s Eq. 21, is argued by the same scaling argument, read off a figure without error bars, so THEORY-742’s scaling claim stays scaling-only. The supplement already states the d/2 line. The causal claim about emergent theories is not shown. | Read |
| NOTE-1019 | Sotomayor — Andy Warhol Foundation for the Visual Arts, Inc. v. Goldsmith | Under the first fair-use factor, transformation is a difference in the purpose of a particular use, judged by degree and weighed against commerciality. New meaning or message counts only as evidence of a different purpose, and copying is justified most clearly when the source is the target. AWF’s licence of Orange Prince to illustrate a Prince magazine shared the photograph’s purpose and was commercial, so the factor favours Goldsmith. Kagan’s dissent would measure the factor by added expression and meaning. | Read |
| NOTE-1020 | Del Vecchio and Slotine — Contraction and singular perturbation | Contraction gives global, explicit, uniform-in-time bounds for singular perturbation: the fast state reaches an εχ_z(d + K)/λ_z neighbourhood of the slow manifold at rate λ_z/ε, and the reduced (quasi-steady-state) trajectory is O(ε)-accurate for all time. Theorem 3 as printed is false: it needs the reduced system, not f alone, to be contracting. The robustness lemma is proved for constant metrics only; the reading re-derives it for state- and time-dependent ones, and with it the two steps THEORY-771 lacked. | Read |
| NOTE-1021 | Boyle — The Public Domain | Intellectual property is a limited monopoly, and its limits and the public domain do as much work as its rights. Cheaper copying makes the limits more important, not less. A second enclosure is fencing facts, genes, methods and musical fragments without evidence that it helps; the database right is the one natural experiment, and it failed. The music chapter shows a genre founded by rewording recent songs. The argument is mostly from chosen cases. | Read |
| NOTE-1023 | Lessig — Remix: Making Art and Commerce Thrive in the Hybrid Economy | Remix is quotation in media, and its meaning comes from the reference, so it needs the original. Copyright regulates copies, every digital use is a copy, so the law that once left amateurs alone now reaches every ordinary use and makes read/write culture presumptively illegal. Commercial and sharing economies are kept apart by whether money is a proper term; hybrids join them and survive only while the line holds. The legal reforms and the economics are argued, not measured. | Read |
| NOTE-1024 | U.S. Copyright Office — Copyright and Artificial Intelligence, Part 3: Generative AI Training | Training copies works at every input step, so the copy trigger fires and everything turns on fair use. Weights count as copies only of works they can regenerate. Under Warhol the training use is judged by its ultimate purpose: often transformative for a general model, barely so for one that serves the originals’ audience. Expression, not just ideas, is learned, and machine learning is not human learning. Market dilution by same-kind outputs is harm. Licensing should develop without intervention. | Read |
| NOTE-1025 | Bousquet and Slotine — Contraction and near-decomposability | Under contraction of the fast modules and of the reduced slow system, and coupling terms bounded affinely in the off-manifold state, a nearly decomposable system stays within O(ε) of its singular-perturbation reduction, uniformly in time after a transient of order (1/β_f + 1/(εβ_g)) log(1/ε), for ε below an explicit critical separation ε_c. Deterministic trajectory error only. Remark 8 prints ε_c inverted, and the slow-error bound needs an unstated d_g = 0. | Read |
| NOTE-1026 | Perzanowski and Schultz — The End of Ownership | Ownership of what we buy is being replaced by licences, DRM and services. The law of exhaustion that protected buyers is built around owning a tangible copy, and digital use and transfer either copy at every step or involve no copy the buyer holds. The authors argue licences are permissions that cannot redefine a sale, show by survey that “Buy Now” misleads, and propose a multifactor digital exhaustion test. Argued from cases and one survey; US law as of 2016. | Read |
| NOTE-1028 | Chorin and Lu — Discrete stochastic parametrization by NARMAX | Model reduction done wholly in discrete time: advance the resolved variables by a fixed integrator and fit the exact one-step discrepancy as a NARMAX series, so memory lives in a few lags of the discrepancy, the resolved variable and the innovations. On Lorenz 96 with ε = 0.5 one or two lags reproduce x₁’s statistics and double forecast lead time at δ = 0.05. The link to Mori–Zwanzig is analogy, not derivation; nothing is proved and no error is bounded. The record’s check: a partially observed linear Gaussian VAR(1) is exactly ARMA, with order 1 + the rank of its MZ memory kernels, so a memory non-zero at every lag is carried exactly by finitely many history-measurable coordinates. | Read |
| NOTE-1029 | Lin and Lu — Wiener projections and the Koopman–Mori–Zwanzig formalism | An exact link between Mori–Zwanzig and NARMAX, with the approximation named. For an invertible map with an invariant measure, projecting onto the whole past of chosen functions of the resolved variables removes the memory term: the reduced equation is the causal Wiener filter on the coarse variable’s own history, with a residual orthogonal to all of it. NARMAX follows only by an “uncontrolled” rational approximation of the filter; no error is bounded. The record’s checks: Mori’s kernels and the Wiener filter are both fixed by the coarse variable’s autocovariance; for a scalar coarse variable of a linear Gaussian VAR(1) both are rational with the same numerator, the rational form is exact, and the memory Hankel rank is d − 1 for any rational autocovariance of rank d. | Read |
| NOTE-1030 | Rosas et al. — Software in the natural world | Three exact closures of a coarse-graining Z of a stationary discrete process X, built from computational mechanics. Informational closure (the micro past adds nothing to predicting Z, which is Barnett–Seth dynamical independence) is proved equivalent to causal closure (Z’s ε-machine equals its υ-machine). For spatial maps it implies computational closure (Z’s ε-machine is a coarse-graining of X’s), and the converse fails. For Markov chains closure is tied to strong lumpability. The proofs of the main equivalences hold, re-derived in THEORY-820 and THEORY-822. The lattice claims are asserted and in part false. Several examples contain slips. The modular random walk closes by symmetry, not modularity. Nothing is said about approximate closure. | Read |
| NOTE-1031 | Besley and Prat — Handcuffs for the grabbing hand | A retrospective-voting model in which an incumbent can pay outlets to suppress verifiable bad news. Because one outlet reporting informs every voter, each outlet must be paid what it would earn as the only one to break the story, so the media are captured exactly when n·τa < r: the number of outlets, the transaction cost of transfers and audience revenue protect against capture, and the rent of office invites it. Capture ends turnover and lowers voter welfare without deceiving anyone: voters know silence is uninformative. | Read |
| NOTE-1032 | Beckers and Halpern — Abstracting causal models | Shows that Rubenstein et al.’s exact transformation is too permissive, because a distribution or a sparse intervention set can hide essential differences, and strengthens it in four steps: uniform transformation (exact for every distribution, equivalent to a map on contexts that commutes with every allowed intervention), τ-abstraction (τ surjective, the map on interventions fixed by τ), strong abstraction (every intervention τ can translate is allowed) and constructive abstraction (τ acts variable-cluster by variable-cluster), which it says all three of Rubenstein et al.’s examples are. | Read |
| NOTE-1033 | Kleinberg and Raghavan — Algorithmic monoculture and social welfare | Two firms each hire the best available candidate by either a private noisy ranking or one shared algorithmic ranking. If, at equal accuracy, a second mover prefers an independent ranking (preference for the first position) and is better off after a less accurate competitor (preference for weaker competition), then for every human accuracy there is a more accurate algorithm that both firms strictly prefer to use, yet both are worse off, and so is welfare, than if neither used it. The Mallows model meets the conditions for every candidate distribution; Gaussian and Laplacian random utility models meet them for three candidates; Plackett–Luce never does. | Read |
| NOTE-1034 | Bergemann and Morris — Information design, a unified perspective | A designer who can commit to how players are informed, but not to what they do, can attain exactly the Bayes correlated equilibria: joint distributions of states and actions in which no player, told his recommended action, wants to deviate. The set is a polytope given by linear obedience constraints, so information design is a linear program over it. Read literally there is a designer; read metaphorically the set bounds what any information structure could produce. More prior information shrinks the set. Public signals serve a designer who wants correlated actions, private ones the reverse. Its two-firm example with strategic substitutes misstates the optimal rule for the parameters it assumes. | Read |
| NOTE-1036 | Hayek — The use of knowledge in society | Argues that the economic problem of a society is not allocating given resources by a known plan but using knowledge “of the particular circumstances of time and place”, which exists only dispersed and cannot be put into statistics for a central authority. Decisions that depend on it must be left to the “man on the spot”, and the price system tells him the relative scarcities he needs without the causes behind them. An argument from examples and from the logic of choice, with no model or evidence. | Read |
| NOTE-1037 | Rubenstein et al. — Causal consistency of structural equation models | Defines an exact transformation between structural equation models: a map τ on states and a surjective, order-preserving map ω on a declared set of perfect interventions such that pushing each low-level interventional distribution forward by τ gives the high-level model’s distribution under the image intervention. It proves that marginalising childless or never-intervened variables, averaging linear micro-variables when every column of the coupling matrix has the same sum, and taking the equilibrium of a contracting linear process with constant noise are each exact, and stresses that each is exact only for the intervention set declared. | Read |
| NOTE-1038 | Weatherall, O’Connor and Bruner — How to beat science and influence people | In Bala–Goyal network models with Bayesian policy makers who do not gather evidence, a propagandist who forwards only the real results of unbiased scientists that happen to favour the worse action, or who runs honest studies and publishes only the unfavourable ones, can leave policy makers near-certain of the false theory while the scientists converge on the true one. It works best when the problem is hard, studies are small, scientists are many and policy makers hear few of them. A journalist who reports one result for each side every round slows policy makers’ learning and never helps it. | Read |
| NOTE-1039 | Szeidl and Szucs — Media capture through favor exchange | In Hungary, 1994–2016, state-owned firms’ advertising, unlike private firms’, shifted sharply toward outlets at five events that made them connected to the right-wing government and away at the event that cut the connection, and corruption coverage moved the other way at the three events with content data. A structural model whose slant gap between a connected and an unconnected outlet splits into owner ideology plus a favor-exchange term attributes the coverage drop to both, under identifying assumptions the authors call strong for print and weaker for online. | Read |
| NOTE-1040 | Di Tella and Franceschelli — Government advertising and media coverage of corruption scandals | In the four main Argentine national newspapers, April 1998–December 2007, months in which a newspaper received more government advertising were months in which it gave less front-page space to the federal government’s corruption scandals, within newspaper and month and within each newspaper-president pair: in this version, 0.31 of a front page per month per standard deviation of advertising. The association holds for advertising placed by the central agency Télam and not for autonomous agencies, and not for scandals of non-political actors. The design shows an association; the authors read it as consistent with coverage traded for transfers. | Read |
| NOTE-1041 | James, Hynes, Whelan, Dreher and Humphry — From access and transparency to refusal | A conceptual paper with illustrations, no data of its own. It sorts responses to algorithmic governance into access and inclusion, transparency, and refusal. It argues that the first two rest on traditional public-administration values, and so reproduce the structures they mean to correct. Both are “bidirectional”: inclusion gives the powerful access to the included, and transparency can be demanded of the governed. Refusal, collective and generative rather than individual exit, is the response it favours, with its limits for those who depend on the state. | Read |
| NOTE-1042 | Collins — Learning from the outsider within | Black women intellectuals in sociology are outsiders within: trained into its paradigms but rooted in experience those paradigms omit or distort. From that position they see two kinds of anomaly, omission and distortion, which outsiders lack the professional authority to press and insiders are not placed to see, having produced them. The essay argues this from the content of Black feminist thought, with no study of who detects what; it proposes institutionalizing the tension rather than resolving it. | Read |
| NOTE-1043 | OECD — Preventing policy capture | An institutional report, not research. It defines policy capture as “the process of consistently or repeatedly directing public policy decisions away from the public interest towards the interests of a specific interest group or person”, by legal or illegal means, and adds three criteria adapted from Carpenter and Moss: an explicit policy goal, a captor’s intent to extract rents, and a shift of the process from that goal. It maps the vehicles (including supplying research and manipulated information) and risk factors, and recommends four strategies: stakeholder engagement, transparency, independent oversight bodies, and organisational integrity. | Read |
| NOTE-1044 | Perdomo, Zrnic, Mendler-Dünner and Hardt — Performative prediction | When a deployed model’s predictions change the distribution they are scored on, D(θ), two solution concepts separate: a performative optimum minimizes the risk on the distribution it induces, and a performatively stable point is optimal for the distribution it induces, a fixed point of retraining. With a β-jointly smooth, γ-strongly convex loss and a map D(·) that is ε-Lipschitz in Wasserstein-1, retraining contracts at rate εβ/γ and converges to a unique stable point when ε < γ/β, and removing any one condition can break convergence. Stable points and optima are within 2L_zε/γ of each other, and can differ. | Read |
| NOTE-1045 | Beckers, Eberhardt and Halpern — Approximate causal abstraction | Turns τ-abstraction into a graded relation. Given a metric on high-level states, the distance of a high-level model from a low-level one is the worst case, over allowed interventions and contexts, of how far the coarse-grained low-level outcome is from the high-level outcome, for the best context map; zero is exact abstraction. Probabilistic versions average over contexts and, with an intervention distribution, over the low-level ways of implementing each high-level intervention. An abstraction followed by an approximation is an approximate abstraction, the reverse order costs a distortion factor, and an approximate abstraction need not decompose into the two. | Read |
| NOTE-1046 | McCombs and Shaw — The agenda-setting function of mass media | Among 100 Chapel Hill voters not yet committed to a candidate in September–October 1968, the aggregate emphasis they gave the campaign’s issues correlated +.967 (major items) and +.979 (minor items) with the composite emphasis of the nine news media serving them, and voters who leaned to a candidate agreed more with all the news than with news about their own side in 18 of 24 comparisons. The authors read this as agenda-setting rather than selective perception, and say the correlations do not prove it. | Read |
| NOTE-1047 | Barnehl and Schumacher — Media capture, captured | Proposes measuring media capture outlet by outlet, at monthly or weekly resolution, by placing each nominally independent outlet between two poles, regime-owned outlets and opposition outlets the regime cannot coerce, on topic prevalence (a structural topic model, on topics chosen as relevant to the regime’s legitimacy) and on the tone of sentences mentioning the leader. Applied to Nicaragua, 2018–2022, it shows Canal 14 moving toward the regime pole in agenda and tone while Radio Corporación stayed near the opposition. The scores measure alignment; that the alignment was coerced is argued from context, not measured. | Read |
| NOTE-1048 | Xu, Zhao, Song, Stewart and Ermon — A theory of usable information under computational constraints | Defines predictive V-information, I_V(X → Y) = H_V(Y | ∅) − H_V(Y | X), where each V-entropy is the least expected log loss a predictor in the family V can reach. With V unrestricted it is Shannon mutual information; with linear-Gaussian V it is R² times the variance. It is non-negative and zero under independence because V must be able to ignore its input. Unlike Shannon information it can be asymmetric and can be raised by computing on X, and its empirical estimate is within 4R(G_V) + 2B√(2 log(1/δ)/N) of the truth with probability 1 − 2δ. It is not bounded by Shannon information unless V’s input-free predictions can match the marginal of Y. | Read |
| NOTE-1049 | Kay, Kasirzadeh and Mohamed — Epistemic injustice in generative AI | A conceptual taxonomy, illustrated with reported cases, of four ways generative models can take part in epistemic injustice: amplified and manipulative testimonial injustice, hermeneutical ignorance and access injustice. Its sharpest move is to relocate the testimonial wrong: in the algorithmic setting it “requires a credibility excess assigned to the algorithm”. It counts deliberate fabrication as testimonial injustice, which Fricker’s account sets apart, and stretches hermeneutical injustice to unequal access to information. Nothing in it is measured by the authors. | Read |
| NOTE-1050 | Espeland and Sauder — Rankings and reactivity | An interview study of US law schools (136 open-ended interviews with administrators and faculty, with corroborating data) proposing that public measures are reactive through two mechanisms: self-fulfilling prophecy, by which reactions to a measure confirm its expectations or raise its validity by making the measured conform to it, and commensuration, which simplifies, decontextualizes and ranks. The effects it sorts are reallocation of resources, redefinition of work, and gaming. A framework offered as “an orienting heuristic”, not a general theory, and not a measurement of effect sizes. | Read |
| NOTE-1051 | Short, Hill and Brown — What is ideological capture and how do we measure it | Defines ideological capture: regulators adopt standards, based on an ideologically motivated expert view of the public interest, that consistently marginalize important public values, with no lobbying needed. Measures it for US antitrust’s consumer welfare standard. In a conjoint survey the public weighs layoffs, quality and lobbying far above price cuts, the standard’s objective, and antitrust lawyers support replacing it 42.6 points less than the public, against a 5.9-point partisan gap. The verdict of capture also leans on historical secondary work. | Read |
| NOTE-1052 | Arthur — Competing technologies and historical small events (working paper) | In a model where two types of agent arrive in random order and each adopts whichever of two technologies pays it more, with returns linear in the number of previous adopters, increasing returns make the difference in adoptions a random walk with absorbing barriers: one technology takes the market with probability one, which one is decided by the order of arrivals, it need not be the better one, and marginal subsidies cannot move it once it has locked in. Under diminishing returns the barriers reflect and the market shares predictably. | Read |
| NOTE-1053 | Schram and Ule — Regulatory independence may limit electoral holdup but entrench capture | In a laboratory game of one infrastructure operator, two policymakers and three voters (59 groups), letting the first elected policymaker fix the price for all nine periods, the paper’s “regulatory independence”, moved prices toward the efficient level when policymakers’ payoffs were aligned with consumers’, and raised prices further above it when they were aligned with the operator, “capture entrenchment”. Voters’ pressure under flexible regulation lowered prices under capture but did not remove the effect. | Read |
| NOTE-1054 v2 | Negro — Three arguments against metaphysical structuralism | Separates methodological, epistemological and metaphysical structuralism about consciousness, and three senses of “consciousness is structural”: having an internal structure, being in a structure, and being the structure. Against the third, which metaphysical structuralism needs, it gives three arguments: Relational Mary, the novel experience argument and the lonely experience argument. Each is valid and rests on an intuition or a conceivability premise. It concludes that methodological and epistemological structuralism need only the first two senses and survive. | Read |
| NOTE-1055 | Aldé — Two geometrical arguments against similarity structuralism | Defines similarity structuralism (phenomenal character is fully fixed by similarity relations, so by the geometry of a similarity space) and argues it cannot account for two accepted facts about colour experience: that exactly four hues are experienced as unmixed and all others as mixtures of two of them, and that the black–white axis is a single gradient while the axes through grey are opposing pairs. Neither fact, it argues, corresponds to any adequate geometric feature of CIELAB or its refinements. It answers the replies from incomplete colour spaces and from unreliable introspection, and concludes structuralism should be rejected for colour. | Read |
| NOTE-1056 | Gładziejewski — Real patterns, the predictive mind, and the manifest image | A philosophy paper with no data. It traces Dennett’s compression criterion for real patterns through minimum description length and Bayesian inference to variational free energy, so that learning a generative model is extracting real patterns from sensory data. It concludes that the manifest image is a structural description of sensory data, veridical even in a matched vat. The self-model compresses self-generated regularities by positing one common cause, so selves are real as patterns and unreal as substances, and which verdict to give is a dispute over criteria, not facts. It says nothing about consciousness or illusion. | Read |
| NOTE-1057 | Safron, Klimaj & Sheikhbahaee — IWMT and the Human Consciousness Hypothesis | A seven-page symposium paper that restates Integrated World Modeling Theory and says it agrees with the Human Consciousness Hypothesis of the California Institute for Machine Consciousness. On IWMT, phenomenal consciousness is what it is like to be the coherent functioning of an embodied agent’s generative world model, run either coupled to sense data (perception) or decoupled from it (imagination). Embodied grounding is required: integrated information or a global workspace without it does not suffice. Transformer language models are said to lack the recurrence, closure and embodiment needed. No new argument or data. | Read |
| NOTE-1058 | Chandia-Jorquera et al. — Neurophenomenological signatures of pure awareness in Transcendental Meditation | Thirty-three experienced Transcendental Meditation practitioners and 33 age- and sex-matched controls who counted instead. Drawn retrospectively, the practitioners’ traces of “pure awareness” were higher and more variable than the controls’ (d = 0.77 and 1.32). A random-forest classifier separated meditation from counting at 65% balanced accuracy, chiefly on permutation entropy and aperiodic EEG, and meditation from the practitioners’ own rest at 88%, chiefly on low-frequency phase coherence. No EEG feature was shown to track the reports. | Read |
| NOTE-1059 | Lee-Youngzie et al. — Towards a mathematical structure of global phenomenal consciousness | A hypothesis article with no data. It maps the parts of an experience, ordered by subsumption into a finite topology, to similarity-judgement matrices of their qualia by a presheaf, and reads compatibility of narrow qualia on overlaps as the condition for phenomenal binding, and the presheaf’s being a sheaf as the broad quale’s being determined by its parts. It reads a sheaf failure as disunity in binocular rivalry and as context dependence in the Ebbinghaus illusion, and gives no rule for telling the two apart. Its worked topology example is malformed, and by its own definitions disagreement on an overlap is not a sheaf failure. | Read |
| NOTE-1060 v2 | Lyre — Neurophenomenal structuralism | A programmatic paper. Its two assumptions: any phenomenal experience is fully individuated, in its specificity, by its place in a quality space (Q-structure), and Q-structure is mirrored in neural structure by a surjective homomorphism from neural maps. From these, with metaphysically necessary supervenience assumed and not argued for, it draws reductive physicalism, an instrumentalist structural representationalism, holism about experience, and the denial that spectrum inversion is nomologically possible. It addresses specific, not generic, consciousness, and says it is not a structural realism. No new data. | Read |
| NOTE-1061 | Bo et al. — Deconstructing the brain bases of emotion regulation | Two fMRI samples (n = 182 and 176) looked at, or reappraised, aversive pictures. Bayes factors for and against each of two contrasts sort voxels into four systems: regions engaged only by reappraisal (anterior prefrontal, temporo-parietal, cerebellar), regions engaged by both negative emotion and reappraisal (most of the reappraisal network), regions engaged by negative pictures and unchanged by reappraisal (all subcortical ones, amygdala and PAG included, with much of cortex), and posterior cortical regions reduced by it. Reported negative affect fell under reappraisal (d = 0.92). Activity is measured; experience is reported once per trial. | Read |
| NOTE-1062 | Whyte et al. — On the minimal theory of consciousness implicit in active inference | A review of active inference simulations of conscious content, self and state, which argues that they share a three-part “hard core”: the imperative to minimise variational and expected free energy; conscious contents as the inferred hidden states of world, body or brain; and conscious access at the interface where continuous sensory beliefs become discrete beliefs that can inform counterfactual policy selection. The third part is an inference to the best explanation, and it is a criterion for which contents are conscious in humans, not for which systems have experience. Two close-to-core predictions are named. New in the paper: a re-run rivalry model that fits Levelt’s laws, a predicted reward violation of them, and a sleep model that loses its P3b-like response. | Read |
| NOTE-1063 v2 | Laukkonen, Friston & Chandaria — A beautiful loop | A conceptual theory that consciousness needs three things in an active-inference system: a unified generative model of the world (an epistemic field); competition to enter it that coherent, precise inferences win (Bayesian binding); and epistemic depth, the recursive sharing of that model back through the hierarchy, formalised as a hyper-model that predicts precision at every level. Awareness is graded by epistemic depth, not by content. It is applied to attention, sleep and lucidity, meditation, cessation and psychedelics, and to AI. There are no data and no simulations, and the formal part is a standard hierarchical model with layer-wise precision hyperparameters. | Read |
| NOTE-1064 | Luppi — Convergent controllers of information integration and its anaesthetic breakdown | Pairwise integrated information ΦR, computed from resting-state fMRI by integrated information decomposition, falls under anaesthesia in humans (sevoflurane), macaques, marmosets and mice, with one mouse regimen the exception, and returns on recovery: spontaneously in humans, and under central thalamic stimulation in two macaques. Network control energy rises with it. Regional loss follows cortical PVALB expression in three species, and species-specific models reproduce both the PVALB effect and the advantage of central over ventrolateral thalamic stimulation. The state measured is behavioural responsiveness, which the authors call “presumably consciousness”. | Read |
| NOTE-1065 | Ward — What is enactivism? | A conceptual paper. The usual taxonomy, which lumps every view stressing sensorimotor loops as “enactivism” and splits it into autopoietic, sensorimotor and radical variants, hides what is distinctive about The Embodied Mind. A second axis, organicist against informationalist, runs across the cognitivist–embodied one. Enactivism is organicist, and it adds the primacy of lived experience and a reciprocity in which scientific vocabularies reshape the experience they describe. Most embodied views, predictive processing among them, are informationalist. It argues for a taxonomy, not for enactivism’s truth. | Read |
| NOTE-1066 | Carruthers & Gennaro — Higher-Order Theories of Consciousness (SEP) | A survey of the theories that make a mental state conscious by its being the object of a higher-order representation: inner sense, actualist and dispositionalist higher-order thought, and self-representational and hybrid views. It sets out the objections (targetless states, the rock, animals, sufficiency) and the prefrontal evidence, and concludes no verdict. Since 2020 it is maintained by Gennaro, a higher-order theorist. Carruthers and Lycan, two of the theories’ main sources, are reported to have given them up. | Read |
| NOTE-1067 | Barrett et al. — The theory of constructed emotion: more than a feeling | A reply by the theory’s architects to van Heijst et al., who gave basic emotion theory the emotion (a bioregulatory state) and constructed emotion the feeling (its representation). The reply says the split is a premise of basic emotion theory, not a division of labour: on constructed emotion the same allostatic signals that regulate the body make feeling, and an instance of emotion is one whole-brain event. It adds evidence lists for structured variation, an evolutionary frame from the extended synthesis, and the thesis that the two theories are incommensurable. No data. | Read |
| NOTE-1068 | Lycan — Representational Theories of Consciousness (SEP) | A survey by one of its protagonists. Strong representationalism holds that a sensory quality, such as the green of an after-image, is a represented property of a represented, possibly nonactual object, and that representation of a certain functionally specified kind suffices for it. “What it’s like” to experience the quality is kept apart as a further, higher-order property that needs awareness, and the theory addresses only the quality. The entry sets out the arguments for and the counterexamples against, and leaves wide against narrow content unsettled. | Read |
| NOTE-1069 | Gurnee — Verbalizable representations form a global workspace in language models | A corpus-averaged Jacobian lens picks out, in each layer of Claude models, the directions a model is disposed to verbalize. Swaps, injections and ablations along these directions (the J-space) show them privileged for report, held concepts, two-hop reasoning and reuse of an argument by many functions, while continuation, anomaly detection and line wrapping use the same information without them. The J-space works in a middle band of layers, carries under 10% of activation variance, and is amplified and relayed by the weights more than other directions. Ablating it flattens experiential language about the self and about others. The authors take no position on phenomenal consciousness. | Read |
| NOTE-1070 | Woods, Windt & Carter — Contentless experiences in meditation are neither truly contentless nor identical | An evidence synthesis of 135 expert texts on the goal-states of Shamatha (Wallace), Transcendental Meditation and Stillness Meditation. It codes 65 features. The states are said to lack thoughts, concepts, perceptions, images and memories, but to keep wakefulness, calm, stillness, bliss, knowing, freedom, unity and more. They are the same across the practices on 14 features, different on 4 (chiefly Shamatha’s far greater attentional stability and vividness) and unclear on 47. So, on the texts, they are neither truly contentless nor identical. The data are teachers’ descriptions, not participants’ reports. | Read |
| NOTE-1071 | Graziano — Illusionism big and small | An essay with no new data. Claims of consciousness come from an automatic internal model, and since every brain model is schematic, what people report having is a caricature of whatever the model tracks. Six hypotheses for what that is are offered. The author favours attention, or more deeply “the deep selective processing of information”, depicted by an attention schema as an intangible essence. Theories that say how a brain produces a feeling and not how the feeling gets into the model that drives report (“Arrow B”) are called magic. Its “small” illusionism still denies the phenomenal essence. What it keeps real is the process modelled. | Read |
| NOTE-1073 | Jensen Hughes — Post-incident analysis of the Brookhollow Apartment fire | An independent review, commissioned by Sedgwick County and Wichita, of every public-safety agency’s response to the fire of 13 October 2023 that killed Paoly Bedeski. It found “no single point of failure” but “systemic shortcomings that, when combined, contributed to an unorganized rescue effort”: a dispatcher who did not replay her unit number, an 18-minute delay in the second alarm, no effective command, freelancing, search not resumed for over eleven minutes after a mayday that was under control within minutes, and Wichita Fire Department policies that existed and were not followed. It could not conclude the shortcomings changed the outcome. | Read |
| NOTE-1074 | Wacquant — A concise genealogy and anatomy of habitus | A short essay that takes habitus back to Aristotle’s hexis and to Bourdieu’s first use of it, for the misfit between dispositions and a changing world in Béarn and Algeria, and clears four misreadings: habitus is multilayered and revised in practice, not the replica of one structure; it need not be coherent; it suits crisis and change as well as reproduction; and it never generates action by itself, but only as triggered by positions in a social world. A conceptual clarification, not a finding; its empirical warrant is cited. | Read |
| NOTE-1075 | Swidler — Culture in action | Culture does not cause action by supplying the values that set its ends. It supplies a repertoire of skills, habits and styles from which people build strategies of action, which outlast the ends they serve. In settled periods culture constrains through the cost of retooling and loosely coupled beliefs; in unsettled periods explicit ideologies govern action directly, but structural opportunities decide which survive. A theoretical argument with illustrative cases and no data of its own. | Read |
| NOTE-1076 | Pierson — Increasing returns, path dependence and the study of politics (working paper) | An argument, not a test: the conditions Arthur and North found to produce increasing returns (set-up costs, learning, coordination, adaptive expectations) are more common in politics than in markets, because politics is dense with compulsory institutions, rests on collective action and is opaque; and lock-in is more intense there, because competition and learning correct weakly, politicians’ horizons are short and institutions are built to be hard to change. Its one case is the failure of two opposite US health-care reforms in 1993–96. | Read |
| NOTE-1078 | Sewell — A theory of structure | A reformulation of Giddens’s duality of structure. Structures are sets of virtual schemas and actual resources that sustain each other: resources enact schemas and schemas are validated by the resources their enactment yields. Change comes from inside, because structures are multiple and intersect, schemas transpose to new cases, resources are polysemic and accumulate unpredictably. Agency is the capacity to transpose schemas and remobilize resources. A conceptual argument, with a conjecture that depth, more than power, makes a structure durable. | Read |
| NOTE-1079 | McFadyen et al. — Doorways do not always cause forgetting | Four conceptual replications from an independent lab. In passive, head-mounted virtual reality, doorways did not lower hits for carried or set-down objects; under a counting load they raised false alarms to recombined probes. Watching or walking a curtained hallway did not change memory for a 16-item grid. The nulls are informative but not direct failures to replicate: movement was passive, and Experiments 3 and 4 used a different memory task. | Read |
| NOTE-1081 | Pettijohn & Radvansky — Doorways: event structure or updating disruption? | Two virtual-navigation experiments from the originating lab. Travel time was not longer through doorways, and a 3-second pause before the probe left the effect as it was, so neither a longer retention interval nor a passing cost of updating explains it. In both, the effect was confined to the carried object. The authors take this as support for interference between the two event models that hold that object. | Read |
| NOTE-1082 | Radvansky et al. — Walking through doorways causes forgetting: further explorations | Three experiments. The doorway effect appeared with small monitors and in real rooms carrying a box of six objects, and returning to the room where the objects were picked up did not help: memory followed the number of rooms involved, worst after two new rooms. The authors attribute it to retrieval interference between event models that both contain the probed object, not to the loss of an encoding context. | Read |
| NOTE-1083 | Radvansky & Copeland — Walking through doorways causes forgetting | Two desktop virtual-reality experiments. With distance held equal, walking through a doorway rather than across a large room raised errors and slowed responses to a probe for the object being carried; memory for the object just set down was not affected. The authors read it as situation-model updating at a spatial shift. The effect rests on few no-shift trials (5 per condition), and the shift and no-shift rooms differed in size and wall pattern. | Read |
| NOTE-1084 | Zacks et al. — Event perception: a mind-brain perspective | States event segmentation theory: perception continuously predicts what comes next; a transient rise in prediction error opens a gate that resets working-memory event models and lets sensory input in, and that moment is perceived as an event boundary. Supported by unitization, memory, narrative and imaging studies, mostly correlational and largely from the authors’ groups. Its one acknowledged misfit: the anterior cingulate does not respond at boundaries during passive viewing. It is about watching events, not one’s own intentions, and does not mention doorways. | Read |
| NOTE-1085 | Lerman, Yan & Wu — The majority illusion in social networks | A sampling fact about networks, not a finding about people: when an attribute is correlated with degree, the share of nodes that see it in a majority of their neighbours can far exceed its global share (60–80% of nodes when 5% hold it, in a heavy-tailed synthetic network), and more so in disassortative networks. A binomial model from the joint degree distribution predicts the share. No person’s belief or behaviour is measured, and the attributes on the real networks are assigned, not observed. | Read |
| NOTE-1086 | NTSB — United Airlines Flight 173, Portland, 1978 | The NTSB found that United 173 ran out of fuel after holding about an hour near Portland while its crew dealt with a landing-gear problem, that fuel exhaustion “was predictable”, and that the probable cause was the captain’s failure to monitor the fuel state and respond to the crew’s advisories. The other two crew members either did not grasp the criticality or did not communicate it; no one was assigned to watch the fuel. It recommended indoctrination in “flightdeck resource management”, with “participative management for captains and assertiveness training for other cockpit crewmembers”. | Read |
| NOTE-1087 | Helmreich, Merritt & Wilhelm — The evolution of Crew Resource Management training | A short history and argument. CRM began with a 1979 NASA workshop and United’s 1981 program, and passed through five “generations”, from managerial-style seminars to integration with technical training under the FAA’s AQP. Its effects are hard to validate (accident rates cannot be used), acceptance of its concepts decays over time even with recurrent training, and it exported poorly across cultures. The authors propose error management (avoid, trap, mitigate) as a rationale all pilots can accept. Command is mentioned only in passing. | Read |
| NOTE-1088 | GAO — NASA: better mechanisms needed for sharing lessons learned | A 2001 survey of NASA’s 192 program and project managers (115 usable responses, 60 percent) found that NASA’s policies required lessons to be reviewed and submitted, but managers did not routinely identify, collect or share them, its Lessons Learned Information System was little used, and NASA recorded how often the system was searched but not whether any lesson was applied, so “NASA has no assurance that lessons are being applied”. The occasion was the 1999 Mars failures, not Challenger. | Read |
| NOTE-1089 | Acharya, Blackwell & Sen — The political legacy of American slavery | Among Southern whites today, those in counties where a larger share of the 1860 population was enslaved are more Republican, more opposed to affirmative action, more racially resentful and colder toward blacks; the association survives 1860 controls and a cotton-suitability instrument, and is not accounted for by today’s black share, by 1935–40 migration or by income inequality. The divergence in voting appears after Reconstruction, not before the war, and is smaller where agriculture mechanized early, which the authors read as a post-emancipation amplification of attitudes then passed down locally. | Read |
| NOTE-1091 | Aevyra — The Ledger of Will | A careful, self-limiting formal note on what a reduced memory must keep so that an agent can still revise: a retained state supports a declared family of future questions, interventions and changes of evaluative law exactly when those targets are constant on its fibres, and under repeated revision exactly when its fibres lie in the coarsest revision-invariant refinement (Moore–Nerode). The rest is design proposal and an unexecuted experimental protocol. Elementary and correct; the authors say plainly that it synthesizes established ideas. | Read |
| NOTE-1092 | Penglase — The unspoken whiteness of Brazilian jiu-jitsu | An anthropologist’s argument, from secondary histories, Gracie family sources and a little ethnography, that the Gracies’ challenge matches against luta livre placed their jiu-jitsu in Brazil’s racial hierarchy as white, mostly through class, neighbourhood and employment rather than in words. Along the way it documents that the Gracies fought over the rules as well as under them, and that jiu-jitsu prospered while luta livre, poorer and darker, went underground; it then absorbed luta livre’s no-gi style until only the social difference remained. | Read |
| NOTE-1093 | Bigand et al. — The geometry of interpersonal synchrony in human dance | In 35 dyads of untrained dancers facing each other, shared music and visual contact were varied independently. Each raised interpersonal synchrony, in different principal movements and with no interaction: lateral and hand movements synchronized through seeing the partner, anteroposterior movements such as head bobs through the shared music, and vertical bounce through both. Which factor drove a movement’s synchrony could be read from its spatial direction (100% classification) and not from its periodicity. The direction of coupling between partners was not estimated. | Read |
| NOTE-1094 | Psychopathy as a Clinical and Empirical Construct | The PCL-R’s items form four correlated factors, Interpersonal, Affective, Lifestyle and Antisocial, which pair into Factors 1 and 2 and are explained by one superordinate factor. Psychopathy is dimensional, its antisocial features belong to it as much as its affective ones, and the authors deny that any one component is its essence. Cleckley’s 1941/1976 profile is a clinical synopsis from an unrepresentative sample, not the standard the measure should be judged by. | Read |
| NOTE-1095 | Sales Practices Investigation Report | The board’s own investigation finds that the harm came from the sales model and the performance management that enforced it, kept in place by a decentralized structure and a culture of deference, with control functions that handled cases one by one and a board told too little. It names and sanctions individual leaders as well. It also records that leadership blamed individual employees, and that signals of the harm reached people who could not act on them, or were filtered before they reached those who could. | Read |
| NOTE-1096 | Flayelle et al. — A taxonomy of technology design features that promote potentially addictive online behaviours | A narrative review and a taxonomy. Design features of six kinds of online service are linked, mostly by cross-sectional, qualitative or indirect evidence, to loss of control. They are sorted by the learning and control process each exploits. Model-free: reinforcement schedules and personalized triggers. Model-based: overvaluation, interference with deliberation, partial goal fulfilment, cognitive biases. Providers select features by their effect on use and revenue, and personalize them under informational asymmetry. For the record it maps closely onto the parts of the potential account: features that strengthen a cue-keyed ranking, move its reference course, falsify the user’s reading of progress, or pre-empt the other perspectives. | Read |
| NOTE-1097 | Induction and Profiling of Strong Multi-Componential Emotions in Virtual Reality | Virtual reality induces intense emotions that engage several components, which passive paradigms do not, and the authors argue this is a precondition for testing synchronization. Seven games, 53 participants, one retrospective questionnaire per game. Fear and joy clusters span appraisal, motivation, physiology, feeling and regulation, and appraisal predicts their intensity best. Componentiality is a property of associations across observations. Nothing is measured within an episode. | Read |
| NOTE-1098 | Toward an integrative psychometric model of emotions | An integrative psychometric model of emotions must allow distinct emotions, variation between and within persons, and causal relations among components, one property from each broad class of emotion theory. Reflective and formative latent-variable models fail. A network model passes. In it, the network of causally interacting components constitutes the emotion, and a distinct emotion is a weakly emergent small-world community. Strong connectivity predicts self-sustaining activation and hysteresis, hence longer emotions. A programme paper: no data, and limits named candidly. | Read |
| NOTE-1099 | Statistical ranking and combinatorial Hodge theory | Rank aggregation as combinatorial Hodge theory. Aggregated pairwise comparisons form an edge flow, and its orthogonal decomposition gives a least-squares global ranking (the gradient), local inconsistency (curl) and global inconsistency (harmonic). The size of the cyclic residual certifies whether any global ranking is meaningful. The framework is cardinal, generalizes Borda, and is not Kemeny. | Read |
| NOTE-1100 | EMA: A process model of appraisal dynamics | A computational process model of appraisal after Smith and Lazarus. Appraisal is a single, fast, parallel mapping from the agent’s causal interpretation (its beliefs, desires, intentions, plans, probabilities and utilities) to per-proposition appraisal frames. Emotional dynamics come from the time course of the perception, inference and action that change the interpretation. Frames compete for the coping response, and the most recently accessed one with the highest mood-adjusted intensity wins. Coping alters the world or the agent’s mental state, which drives reappraisal. Illustrated by an actor’s 2.6-second reaction to a pigeon. | Read |
| NOTE-1101 | The current status of research on the structure of evaluative space | The evaluative space model restated by its authors. Positivity and negativity are separable systems whose combined output is a bipolar approach–avoid predisposition. They can be activated reciprocally, independently or together. Coactivation is ambivalence, which is rare, arousing and behaviourally indeterminate, and gives the same net output as neutrality. Negativity has the higher gain and positivity the higher intercept, and both recalibrate with context. Evaluation is heterarchical, with higher levels able to override lower. | Read |
| NOTE-1102 | Control Theory, Goal Attainment, and Psychopathology | A commentary. Control theory adds to goal talk the need to perceive the present state and compare it with the goal. Psychopathology arises where the loop’s input, reference value, comparison or output is extreme or biased. The five factors are sensitivities to classes of goals. Valence tracks the velocity of goal attainment against a reference value, so approach and avoidance can each produce either sign. Confidence, doubt and disengagement lie outside the loop, in expectancy-value theory. | Read |
| NOTE-1103 | An Appraisal-Driven Componential Approach to the Emotional Brain | A programme for taking the component process model into the brain: five functionally defined networks, appraisal driving changes and synchronization in the other four, synchronization proposed to be neuronal phase or cross-frequency coupling, and feeling emerging when the degree of synchronization passes a threshold. It states that some action tendencies take priority by control precedence. It gives no measure of synchronization, signed or unsigned, per episode or otherwise. | Read |
| NOTE-1104 | Interaction and threshold effects of appraisal on componential patterns of emotion: A study using cross-cultural semantic data | From the GRID data on the meaning of 24 emotion words in 27 countries, MARS models of 11 motivation, physiology and expression factors on 7 appraisal factors select interactions up to third order and some hinges. Goal compatibility is the main effect, agency and norm compatibility act only through it, and the structure is partly additive and partly hierarchical. The “threshold effects” are hinges in a continuous piecewise-linear fit. No synchronization measure, no time, and no choice data. | Read |
| NOTE-1105 | Kahneman, Wakker and Sarin — Back to Bentham? Explorations of experienced utility | Decision utility, an outcome’s weight in choice, and experienced utility, its hedonic quality, are distinct and can be measured separately. Experienced utility is instant (real-time report) or remembered (retrospective). Remembered utility follows a Peak-End rule with duration neglect, and choices follow remembered utility, so people choose dominated painful episodes. Total utility is axiomatized as a time integral of ordinal instant utility with a neutral zero. For the record, the dissociation is not a counterexample to potential read within the moment. It shows that potential read from deferred choices measures memory, and that a system’s model of its own past states is systematically biased. | Read |
| NOTE-1106 | The Emotion Process: Event Appraisal and Component Differentiation | The evidence for the emotion process, organised by appraisal criterion and by the component appraisal drives. Appraisal criteria predict action tendencies, physiology and expression better than emotion categories do. Intrinsic valence and goal congruence have partly different signatures and combine multiplicatively. Control amplifies goal-congruence effects. Coherence among components is proposed as the mark of an episode at one threshold and of awareness at a second. No negotiation among perspectives: appraisal is a profile of criteria that drives patterned responses. | Read |
| NOTE-1107 | Brain networks subserving functional core processes of emotions identified with componential modeling | fMRI during 40 films, with each of 119 short events rated on 32 CoreGRID features. PLSC gives six brain–behaviour processes: valuation, novelty, hedonic impact, goal monitoring, caring for others and approach/avoidance. Valence splits into a wanting-like valuation network carrying the action tendencies and a liking-like hedonic network carrying feeling and expression, and no arousal process appears. There is no synchronization measure, but every event gets a signed score on each process. | Read |
| NOTE-1108 | Levels of valence | A framework, not a study. Valence is located at two levels. Micro-valences are the outcomes of separate valenced appraisal checks, and they can conflict. Macro-valence is a one-dimensional integration of them and of other inputs, and it is what choice needs. The paper’s work is in the paths between the levels, and above all in the integration rules, from weighted sums to lexicographic and elimination strategies that need no trade-offs. Intrinsic pleasantness and goal conduciveness are separate checks, and the paper grounds the separation in Berridge. | Read |
| NOTE-1109 | Berridge and Robinson — Liking, wanting, and the incentive-sensitization theory of addiction | An invited review of the incentive-sensitization theory by its authors. ‘Wanting’ and ‘liking’ have dissociable brain systems. Drugs can sensitize the ‘wanting’ system so that it is lastingly hyper-reactive to drug cues and contexts while ‘liking’ stays flat or falls. Sensitized ‘wanting’ can oppose cognitive desire, run without report, and grow in abstinence, and the theory is being extended, on weak evidence, to behavioural addictions. For the record it is a mechanism for proxy-keyed potential in persons. It also shows that the addict case CLAIM-433 settles holds only if the sign of valence is read along the proxy. | Read |
| NOTE-1110 | Berridge and Kringelbach — Pleasure systems in the brain | A review. Reward splits into ‘liking’, ‘wanting’ and learning. ‘Liking’ is measured without report by taste reactivity, homologous across species, and is generated by small opioid hotspots. Dopamine and most “pleasure electrodes” raise ‘wanting’ and leave ‘liking’ alone, and sensitized ‘wanting’ can grow while the drug becomes less pleasant. Objective ‘liking’ can occur without felt pleasure. For the record, this is the sharpest test so far of “valence is potential”. Read as written, the identity fails, and the dissociation calls for a hedonic marker measured apart from control. | Read |
| NOTE-1111 | Hesp et al. — Deeply felt affect: the emergence of valence in deep active inference | A computational proof of principle with no data. Valence is a state of self, inferred at a slower, deeper level from affective charge, the update to the expected precision γ that sets how far the preference- driven action model, rather than habit, governs policy selection. Positive charge is rising confidence in the action model and negative charge falling confidence. The valence level sends priors on γ back down. “Felt” means explicitly represented, which the authors take as necessary, not sufficient, for self-reportable valence. For the record, this is the closest existing model of that felt valence is the system modelling its own potential. But its sign and intensity run against the record’s potential account for negative valence, and it inherits the wanting/liking problem. | Read |
| NOTE-1113 | Emotions are emergent processes: they require a dynamic computational architecture | The component process model restated for computational modellers. Emotion is a bounded episode of synchronization among subsystems (appraisal, autonomic, motor, motivation, feeling), driven by appraisal checks in a fixed order and aimed at control precedence. Feeling monitors the process by representing the other components and their coherence. The degree of synchronization is hypothesised to generate consciousness. Emotions are attractor basins of coupled oscillators, with hysteresis and catastrophe jumps. No operational measure of synchronization is given. | Read |
| NOTE-1114 | Motivational trade-offs and modulation of nociception in bumblebees | A motivational trade-off in an insect. Bees given heated (55 °C) 40% sucrose feeders against unheated alternatives of 10–40% fed from the heated ones less as the alternatives got sweeter, and more steeply than without heat. Choice ran on learned colour cues, so the modulation is central. The authors take it as consistent with pain, not proof of it. One cost level, four resource levels in separate groups; graded at that cost, silent on a threshold in cost. | Read |
| NOTE-1115 | Conscious emotional experience emerges as a function of multilevel, appraisal-driven response synchronization | A theoretical paper with a short review of EEG and neural-synchrony evidence. Conscious emotional experience is recruited when lower, automatic levels of appraisal and regulation fail, which happens when component synchronization is strong and lasting. Conscious regulation needs explicit representations. The feeling is a central representation of the components and their coherence, built by local and distant neuronal synchronization. Proposed measures are EEG band activity in felt versus unfelt episodes, and phase coherence between regions. | Read |
| NOTE-1116 | Flows and Decompositions of Games: Harmonic and Potential Games | A finite game is read as a flow, the unilateral payoff differences on the graph of strategy profiles, and the Helmholtz decomposition of that flow splits the game uniquely into potential, harmonic and nonstrategic parts. Potential games are those with no harmonic part. Harmonic games, the pure-conflict part, generically have no pure equilibrium. The nearest potential game is a closed-form l2 projection. | Read |
| NOTE-1117 | The power of goal-directed processes in the causation of emotional and other actions | A reversal of the default in dual-process models of action and emotion. Goal-directed processes, which select the action option with the highest expected utility, can be fast and automatic, so they, not stimulus-driven habits or appraisal-to-action-tendency links, are the default cause of action. Most of the competition that decides behaviour is between goal-directed processes, and values and expectancies settle it. Emotional actions are those whose tendencies have control precedence because the goals at stake are highly valued, so emotional episodes are decision processes with higher stakes. | Read |
| NOTE-1118 | A Multi-Componential Approach to Emotion Recognition and the Effect of Personality | A crowdsourced film-rating study. Thirty-nine CoreGRID items rated after whole clips show emotion structure beyond valence and arousal (six dimensions) and predict discrete-emotion ratings better together than any component alone. Personality traits correlate with componential items. No synchronization, no within-episode measure, no physiology recorded. | Read |
| NOTE-1119 | Bridging emotion theory and neurobiology through dynamic systems modeling | A dynamic-systems model of appraisal and emotion. Their constituents organize one another through feedback and circular causality into one emotional interpretation (EI): triggered by a perturbation, self-amplifying until it takes over the system, then self-stabilizing as competing cues are resolved. EIs are attractors, one at a time, with abrupt transitions between them. Vertical integration gives them momentum and selects among them. Stable EIs drive learning, so real-time and developmental order are interdependent. Predicts theta-band phase synchrony as an index of emotional relevance. | Read |
| NOTE-1120 | Brown, Price & Dombrovski — Anxiety as a disorder of uncertainty | A narrative review and theoretical proposal, with no new data and no simulation. Computational learning studies of anxiety (seven, not a systematic search) find altered adjustment of learning rate to kinds of uncertainty, mostly with aversive outcomes, rather than inflated threat learning or valuation. The authors propose that in aversive environments avoidance of uncertain states keeps their uncertainty high and so perpetuates itself, that anxiety amplifies this by misreading noise as change, and that exposure works by reducing the uncertainty, not the threat. It covers fear-based disorders and says it does not explain GAD. | Read |
| NOTE-1121 | Edwards et al. — Skills homework and phone coaching in a DBT intensive outpatient programme | A chart review of 56 of 88 patients in a Yale DBT intensive outpatient programme, kept because they finished a four-month cycle and gave enough diary-card data. Homework completion in months 1–3 correlated with larger drops in suicide and substance-use urges (r ≈ .35), and phone coaching with a larger drop in self-harm urges (r = .31); neither correlated with change in how often the behaviours occurred. Patients with no target behaviour in month 4 had completed more homework (91% against 80%); the coaching difference was not significant. Correlational, uncorrected for multiple comparisons. | Read |
| NOTE-1122 | Juhász — Temporary protection and technology adoption (December 2015 draft) | A natural experiment: the Napoleonic blockade raised the effective cost of reaching London much more for northern than for southern departments of the French Empire. Better-protected departments added more mechanized cotton-spinning capacity by 1812, kept and extended that lead through 1887, had more productive spinning firms in 1840 and higher industrial value added per capita in 1860, but not in 1896, 1930 or 2000. The long-run estimates rest on an instrument the author concedes is weak (first-stage F mostly below 10). The protection was a war measure, not a policy; what persisted was the industry’s location, not the protection. | Read |
| NOTE-1123 | De Kleine et al. — Impaired action-safety learning and excessive relief during avoidance | A cross-sectional comparison of 47 healthy controls with 139 treatment-seeking patients (33 OCD, 40 panic disorder with agoraphobia, 66 PTSD) in a picture-based avoidance task. OCD and PTSD patients pressed the avoidance button more to the safety cue and kept a higher expectancy of the aversive picture after effective avoidance; PDA and PTSD patients reported more relief when it was omitted. Relief was already higher before avoidance was available, and patients rated the pictures as more aversive. That low confidence in avoidance makes omissions surprising and the relief reinforces avoidance is the authors’ interpretation, not something the study tested. | Read |
| NOTE-1124 | Gollwitzer & Sheeran — Implementation intentions and goal achievement: a meta-analysis | A meta-analysis of 94 tests (1990–2003, 8,461 participants, mostly students and laboratory tasks) finds that adding an if-then plan to a goal intention raised goal attainment by d = .65 against the goal intention alone, across four problems of goal striving, with large effects on cue accessibility and on the immediacy, efficiency and non-conscious running of the planned response in small sets of tests (k = 1 to 7). Plans are said to delegate control “to specified situational cues” while staying dependent on an active goal. Publication bias was checked only by comparing published with unpublished tests; the 2024 meta-analysis of 642 tests finds it substantial. | Read |
| NOTE-1125 | Bjørnskov, Voigt & Khesali — Unconstitutional states of emergency (2021 working paper) | 853 national states of emergency, 1949–2017, from Hafner-Burton et al.’s list updated; 115 coded as unlawful from news, NGO reports and durations past the constitutional maximum. 97 of the 115 followed political turmoil, 14 natural disasters. Unlawful ones lasted 321 days on average against 115. Logits find democracies, richer countries and (after domestic events) higher investment prices less likely, and bicameral systems and second-chamber approval more likely, to see an unlawful one. Correlational, with pseudo-R² of 0.01–0.07; “suspected to be unlawful” is the authors’ own gloss on the coding. | Read |
| NOTE-1126 | Friedkin, Jia & Bullo — A theory of the evolution of social power | A Friedkin–Johnsen model of opinion change on each issue, with a reflection mechanism between issues: a member’s closure to influence on the next issue equals their influence centrality on the last. In simulation it drives one member to full closure and the rest to full openness. In 30 four-person student groups discussing 15 choice dilemmas, prior centrality predicted next-issue closure, more strongly along the sequence; influence networks thinned and discussions shortened. The rate of consensus did not change. | Read |
| NOTE-1127 | Chou, Wilson & Smith — The influence of anxiety on exploration | A narrative review of computational modelling studies of anxiety and exploration, almost all in reward tasks and sub-clinical samples. In bandit tasks, directed exploration tends to rise with trait or cognitive anxiety and fall with state or somatic anxiety; random exploration shows no link; in foraging tasks, and in one task with a predator to check for, anxiety goes with less exploration. Results are inconsistent across tasks and measures and none has been replicated. | Read |
| NOTE-1128 | Goodson et al. — The standalone effect of safety behavior manipulations | A PROSPERO-registered review of 26 studies (2,048 participants, mean age 24.9, 26.6% male) that manipulated safety behaviours outside exposure; 19 entered four meta-analyses. Against control, reducing safety behaviours reduced them (d = 0.52 after one outlier was removed) and reduced symptoms (d = 0.43, k = 16; 0.31 after trim-and-fill, with significant Egger asymmetry). Instructed increases, all in non-treatment experiments, raised safety behaviours (d = 2.96) and symptoms (d = 0.65, five studies). The literature is mostly appearance concerns and social anxiety in young, non-clinical or subclinical samples. | Read |
| NOTE-1129 | Dagan & Benvenisty — Autocratization and states of emergency (IDI research summary) | A think-tank summary of a comparative study of five democracies chosen because they autocratized (South Korea, India, Hungary, Venezuela and Turkey). In each, it says, emergency powers, extraordinary powers functionally equivalent to them, and emergency rhetoric played “a significant role” in weakening democratic institutions. It states that the convergence of emergency and autocratization “is not inevitable” and that many democracies weather emergencies intact. Narrative country sketches; no method, data or sources are given, and the cases are selected on the outcome. | Read |
| NOTE-1130 | Gerstner et al. — Eligibility traces and plasticity on behavioral time scales | A review by theoreticians. In a three-factor rule, pre- and postsynaptic co-activation sets a decaying synaptic flag, the eligibility trace, and the weight changes only if a third signal (reward minus expected reward, surprise, novelty, or a neuron-specific error) arrives while it is set. Five experimental papers (2014–2017), mostly in slices, give traces of about 1 s in striatum, 3–10 s in cortex, about 2 s and about a minute in hippocampus. The authors grant that other mechanisms could bridge the same gap. | Read |
| NOTE-1131 v2 | Sheeran, Listrom & Gollwitzer — The when and how of planning: 642 tests of implementation intentions | A meta-analysis of 642 tests (294 reports to September 2019). Forming implementation intentions improved behaviour (d = .27), cognitive performance (.47), affect regulation (.66) and social judgement (.52), pooled d = .36; publication bias was substantial, and a robust Bayesian estimate is d = .15, small and highly heterogeneous. Contingent if-then plans beat schedule plans (.43 against .29); rehearsing the plan once helped, recording it hurt, and effects were large only when motivation was high. A taxonomy of cues and responses finds nearly every kind effective. | Read |
| NOTE-1132 | Soma et al. — The hive mind is a single reinforcement learning agent | A short theoretical paper with simulations. In an infinite, well-mixed population, imitation of success has the expected update of Cross Learning, and the weighted voter model of the honey-bee waggle dance that of Maynard-Cross Learning, the Maynard-Smith replicator dynamic. The population’s type distribution is the policy of a stateless bandit agent, each member is one parallel sample of it, and no member learns. The authors keep the biology partial and the simulations qualitative. | Read |
| NOTE-1133 | Ku & Finch — Routines die hard: ontological agency in securitisation | A conceptual paper with an illustration. Alongside the political agency securitisation theory grants its audience (accept, reject, contest), Ku and Finch propose ontological agency: keeping everyday routines going, which often means ignoring securitising moves. Observed by chance in Gangneung in 2022, people paid routine missile launches and beach-front military sites little attention; when a missile malfunctioned at night under a news embargo, tweets voiced fear of war and anger at the government. The authors argue such inaction lets securitisation reproduce itself and that accepting it delegates anxiety management to elites. | Read |
| NOTE-1134 | Mancinelli & Bach — A systematic review of human avoidance learning | A PRISMA systematic review, not a meta-analysis, of 116 studies of avoidance learning in healthy humans with shock or noise (1939–2024). Avoidance is learned without terminating the CS, transfers by inference to stimuli never paired with harm, and persists when it can be performed, longest when it is most effective; this contradicts two-factor theory and favours expectancy and inference. But some avoidance persists after the US is visibly removed, which a purely inferential account does not predict. No clinical samples were included. | Read |
| NOTE-1135 | Jia, MirTabatabaei, Friedkin & Bullo — Opinion dynamics and the evolution of social power in influence networks | DeGroot averaging on each issue, and between issues each member’s self-weight is set to their share of control over the last consensus. With a fixed, strongly connected matrix of relative interpersonal weights, self-weights converge from every non-autocratic start to a unique equilibrium fixed by the eigenvector centralities: power ranks as centrality, accumulates at the top, is autocratic exactly for a star network and democratic exactly for a doubly stochastic one. Members whom no path reaches end with no power. | Read |
| NOTE-1136 | Zorowitz, Momennejad & Daw — Anxiety, avoidance, and sequential evaluation | A decision-theoretic argument with simulations, no data. In sequential evaluation the ability to avoid danger later should make it less threatening now. An agent that computes values as if it will fail to avoid later (a β-pessimistic Bellman equation, weight w) spreads negative value to states far from the threat and avoids early, which reproduces qualitatively exaggerated threat appraisal, generalization, earlier cash-out in risk tasks and aversive pruning, and predicts a reduced free-choice premium. The misbelief concerns the agent’s own future control, not the danger. | Read |
| NOTE-1137 v2 | Craske et al. — Maximizing exposure therapy: an inhibitory learning approach | A clinical translation, not a study. It summarizes evidence that extinction leaves the original threat association intact and adds a competing inhibitory one, so fear can return. It argues that exposure should aim to violate expectancies, not to reduce fear within a session, and that fear reduction during exposure does not predict outcome. It sets out strategies for strengthening and retrieving inhibitory learning, with five invented case examples. Cognitive restructuring before or during exposure is held to blunt learning by lowering expectancy. The evidence on safety behaviours is reported as mixed. | Read |
| NOTE-1138 | Friston et al. — Active inference and learning | A discrete-state active inference scheme in which a habit is one more policy, a state-to-state transition model learned by counting observed transitions, and the prior over policies is learned by counting which policies were pursued. In simulated T-maze foraging the agent first explores, then exploits, then acquires a habit; after the habit is acquired it persists when the reward is devalued, and before it is acquired behaviour switches at once. Simulations only; the authors say the scheme makes probably no new behavioural predictions. | Read |
| NOTE-1139 | Miller, Resnick and Zeckhauser — Eliciting informative feedback: the peer-prediction method | A mechanism-design paper with proofs and a worked example. A center with no ground truth pays each rater a strictly proper scoring rule applied to the posterior over a reference rater’s report implied by her own report. Truth-telling is a strict Nash equilibrium, payments can be scaled to buy effort and balanced among raters, and coarse reports can be elicited for two types. Uninformative equilibria remain, and collusion, risk aversion, unelicited private signals and trust in the center are left as limits. | Read |
| NOTE-1140 | Kaisers & Tuyls — Frequency adjusted multi-agent Q-learning | A short algorithmic paper with plotted experiments. The selection–mutation model of Boltzmann Q-learning (Tuyls et al. 2003, 2005) assumes every Q-value changes at rate α; in Q-learning only the chosen action’s does, so its expected change carries a factor x_i, and Q-learning departs from the model depending on initialization. A frequency-adjusted update removes the factor and matches the model. Three 2×2 games, one temperature, no quantitative measure of fit. | Read |
| NOTE-1141 | Son et al. — QTRAN: learning to factorize with transformation | Defines Individual-Global-Max (IGM): per-agent values factorise a joint value when the profile of individual argmaxes is the joint argmax. Additivity and monotonicity are sufficient conditions; QTRAN trains the sum of individual values plus a state value to equal the joint value at the greedy profile and bound it elsewhere, which is sufficient and, up to rescaling, necessary. Every single-state matrix game satisfies IGM; VDN and QMIX missed the optimum in 177 of 310 random 3×3 games. | Read |
| NOTE-1142 | Hart & Mas-Colell — A simple adaptive procedure leading to correlated equilibrium | A theorem with a proof. Regret matching, switching from one’s last action to each alternative with probability proportional to the positive regret for not having made that switch in the past, drives the empirical joint distribution of play almost surely to the set of correlated equilibria when every player uses it. Regrets vanish exactly when the empirical distribution approaches that set. A stylized variant is analysed by Blackwell approachability; the main procedure needs inertia and needs players to see one another’s past play. | Read |
| NOTE-1143 | Balduzzi et al. — Open-ended learning in symmetric zero-sum games | A framework paper with an algorithm and two small experiments. Symmetric zero-sum games between parametrized agents split into transitive and cyclic parts relative to a measure on agents. In a cyclic game an individual’s performance is meaningless, so evaluation moves to populations: the value of the game between them, which is invariant to redundant members, and the convex hull of their evaluation rows. Training each supported agent on what it beats grows that hull. | Read |
| NOTE-1144 | Sato & Crutchfield — Coupled replicator equations for the dynamics of learning in multiagent systems | A four-page letter. Two agents choose by softmax over reward memories that decay at rate α; with learning slow relative to play, each agent’s choice distribution follows a replicator dynamic in the other’s play plus α Σ_j x_j log(x_j/x_i), a pull towards uniform play. Without decay the system is conservative, Hamiltonian in zero-sum games; with decay it is dissipative. Rock–scissors–paper simulations show tori, Hamiltonian chaos, heteroclinic transients, limit cycles and chaotic attractors. Derivation plus numerics, no data. | Read |
| NOTE-1145 | Shazeer et al. — Outrageously large neural networks: the sparsely-gated mixture-of-experts layer | An engineering paper with large experiments. A sparsely-gated layer of up to 131,072 experts raises capacity over 1000-fold at roughly constant computation. Read here for one observation and one fix: without constraint the gate concentrates on a few experts, which the authors call self-reinforcing, and two auxiliary losses that penalize unequal importance and load remove it, which in one ablation also improves perplexity from 39.8 to 35.6. | Read |
| NOTE-1146 | Czarnecki et al. — Real world games look like spinning tops | A hypothesis paper with theorems and sampled empirical games. Where players can signal n bits before the outcome is settled, every win–loss pattern on 2ⁿ strategies occurs, so cycles are astronomically long. Nash clustering layers any symmetric zero-sum game, and beating a whole cluster guarantees climbing. Sampled games show cluster size peaking at middling strength. The body says the geometry is not proved, the abstract says it is. Two of the smaller results have defective statements or proofs. | Read |
| NOTE-1147 | Jacobs, Jordan, Nowlan and Hinton — Adaptive mixtures of local experts | A short paper that founds the mixture of experts. Scoring the error of a single, gate-selected expert, or the mixture’s negative log-likelihood, makes experts compete for cases, and an expert better than the gate-weighted average gains responsibility for the case. On a vowel task 4 or 8 linear experts learned in half the epochs of matched backpropagation networks at equal accuracy, divided the task by class pair, and left all but 2 or 3 experts with mixing proportion near zero. | Read |
| NOTE-1148 | Yang et al. — Mean field multi-agent reinforcement learning | An algorithms paper with a convergence proof and three experiments. Each agent’s Q-function is approximated by its interaction with the mean action of its neighbours, which makes many-agent RL tractable for hundreds of homogeneous agents. Mean field Q-learning converges to a Nash Q-value under strong assumptions, learns Gaussian Squeeze with 500 and 1000 agents where baselines fail, matches MCMC on a 20 × 20 Ising model, and wins a 64-versus-64 battle game. | Read |
| NOTE-1149 | Börgers & Sarin — Learning through reinforcement and replicator dynamics | A short theoretical paper. One Bush–Mosteller learner with payoffs in (0, 1), Cross’s model, moves in expectation as a population under the discrete replicator step, and in the continuous-time limit follows the Taylor replicator dynamic at any finite time. For every learning speed, though, the discrete process is absorbed in a pure strategy profile with probability one. With negative payoffs a probability-matching force enters beside a replicator force. Proofs are by Euler’s method and Norman’s theorems on slow learning; the negative-payoff limit is stated with its proof omitted. | Read |
| NOTE-1150 | Foerster et al. — Learning with opponent-learning awareness | A LOLA learner maximises its return after the opponent’s anticipated naive gradient step and differentiates through that step, adding a second-order term to its gradient. Two exact-gradient LOLA learners reached tit-for-tat-like reciprocity in the memory-one iterated prisoner’s dilemma where naive learners ended at mutual defection, and settled at the mixed equilibrium of iterated matching pennies where naive learners did not converge. A policy-gradient version cooperated in the Coin Game, less reliably with a learned model of the opponent. | Read |
| NOTE-1151 | Leibo et al. — Multi-agent reinforcement learning in sequential social dilemmas | A descriptive simulation study. It defines sequential social dilemmas, Markov games whose learned cooperative and defecting policies give social-dilemma payoffs, and runs independent deep Q-learners on two two-player games. Scarcity and costly conflict produce aggression in Gathering; group benefit produces joint hunting in Wolfpack; and network size moves defection in opposite directions in two games that both embed a Prisoner’s Dilemma. | Read |
| NOTE-1152 | Foerster et al. — Counterfactual multi-agent policy gradients | A centralised critic Q(s, τ, u) trains decentralised actors, and each agent’s action is scored against the critic’s average over its own alternatives under its own policy, the others’ actions fixed. The baseline does not change the expected gradient. On StarCraft micromanagement with a narrow field of view it beat independent and central-V/QV actor-critics on four maps. The counterfactual is the critic’s estimate, not a simulation, and it values alternatives the agents sometimes take. | Read |
| NOTE-1153 | Wolpert & Tumer — Optimal reward functions in distributed reinforcement learning | Members of a collective each run a reinforcement learner on a private utility, and the designer wants the world utility G maximised. A private utility is factored when it orders a member’s own alternatives, others fixed, as G does; this holds exactly when it is an increasing function of G given what the member cannot affect. The Wonderful Life Utility, G minus G with the member’s effect set clamped, is factored and easier to learn than G. In a 60-agent bar problem, clamping to the average action did best, clamping to absence nearly as well, G worst. | Read |
| NOTE-1154 | Rashid et al. — QMIX: monotonic value function factorisation | Per-agent values Q_a(τ^a, u^a) are combined into a joint Q_tot by a mixing network whose weights, generated from the state, are kept non-negative, so ∂Q_tot/∂Q_a ≥ 0. Then the individually greedy actions form a greedy joint action and agents can act on their own values. It represents more than a sum and learned the optimum of a two-step game that a sum misses; it cannot represent a joint value in which one agent’s best action depends on the others’ current actions. | Read |
| NOTE-1155 | Balduzzi et al. — Re-evaluating evaluation | A methods paper with two short applications. It reads evaluation data as antisymmetric matrices. Elo is then the row mean of the log-odds, exact when they are curl-free and movable by copies, and the Schur decomposition gives a multidimensional Elo. Nash averaging scores agents and tasks against the maximum-entropy Nash equilibrium of a zero-sum meta-game. Its proved invariance covers exact copies, and only when that equilibrium is unique. A checked counterexample shows what happens otherwise. | Read |
| NOTE-1156 | Omidshafiei et al. — α-Rank: multi-agent evaluation by evolution | A methods paper with theory and applications. Agents are ranked by the stationary distribution of a finite-population, rare-mutation Fermi imitation chain on pure profiles, unique at every finite α. As α grows its transitions become those of Markov-Conley chains, the sinks of the better-response graph, which the paper ties to chain components of the replicator flow. The limit of the ranking is not characterized, and it is not invariant to copies. | Read |
| NOTE-1157 | DeGroot — Reaching a consensus | A group whose members each replace their opinion, over and over, by a fixed weighted average of everyone’s current opinions, F⁽ⁿ⁾ = PⁿF, is a Markov chain run on opinions. It reaches a consensus from every start exactly when the chain has one closed class and that class is aperiodic. The consensus is then a linear opinion pool whose weights are the chain’s stationary vector, which gives members outside the closed class no weight. Two closed classes, or one periodic class, give no consensus. The weights are fixed, and nothing in the model tracks the truth. | Read |
| NOTE-1158 | Bar-Tal, Yariv, Lipman and Dekel — MultiDiffusion | A training-free sampler that runs one pre-trained diffusion model on several crops or masked prompts of one canvas and, at every step, replaces their disagreeing proposals with the least-squares reconciliation, which for pixel-sampling maps is a per-pixel weighted average. It makes seamless panoramas (crop FID 10.3 against 18.4 and 45.5 for outpainting baselines) and follows rough region layouts (COCO IoU 0.26 against 0.16–0.17), most of the layout gain coming from an early masked bootstrapping phase. Its guarantee that each crop follows the reference model’s path holds only at zero loss, which disagreeing overlaps do not reach. | Read |
| NOTE-1159 | Kwon and Perchet — Blackwell approachability with partial monitoring: optimal convergence rates | Approachability of a polytope (reduced to the negative orthant) under partial monitoring, where the decision maker sees only a random signal whose law is known, can be achieved at rate O(T^-1/3) in expected distance for general signals and O(T^-1/2) when the signal law does not depend on the decision. The general algorithm lifts the problem to an auxiliary full-information approachability problem that is linear in the flags, and keeps a uniform exploration floor γ ∝ T^-1/3 so that the flags can be estimated by importance weighting. | Read |
| NOTE-1160 | Zhong et al. — Multi-LoRA composition for image generation | Two training-free ways of using several LoRAs in one diffusion sampler without merging their weights: LoRA Switch gives each LoRA its own denoising steps in rotation, and LoRA Composite averages every LoRA’s guided noise prediction at every step. On 480 sets of two to five public LoRAs, GPT-4V’s paired judgements (and two annotators on 120 images) prefer both to weight merging, increasingly as LoRAs are added. In Switch, the switching interval and which LoRA acts first change the result at equal step shares. The baseline’s merged adapter grows with the number of LoRAs, which the design does not separate from the decoding-time idea. | Read |
| NOTE-1161 | Chaloner and Verdinelli — Bayesian experimental design: a review | Bayesian experimental design is Lindley’s decision problem: choose the design that maximizes the expected utility of the best terminal decision, so the criterion follows from what the experiment is for. In the normal linear model Shannon information gives Bayes D-optimality, det(nM + R), and quadratic loss gives Bayes A-optimality, tr A(nM + R)^-1. E- and G-optimality have no utility behind them. In nonlinear problems the criteria are normal approximations that average a local criterion over the prior. Locally optimal design is the point-mass case, and it can leave the quantity of interest inestimable. | Read |
| NOTE-1162 | Lattimore and Szepesvári — Cleaning up the neighborhood: a full classification for adversarial partial monitoring | Completes the classification of finite partial-monitoring games against oblivious adversaries to every game, degenerate and duplicate actions included: 0 with no neighbouring pair, Θ̃(√n) locally observable, Θ(n^2/3) globally but not locally observable, Ω(n) otherwise. The missing piece is NeighborhoodWatch2, which redistributes probability onto degenerate actions in proportion to the neighbours they lie between and has a high-probability √n bound. It corrects Bartók et al.’s T^2/3 lower-bound proof, whose separating direction ignored the degenerate actions’ signals. The preprint, not the published text, also says the earlier localisation argument exchanged an expectation and a maximum. RelExp3 gives point-locally observable games an asymptotic constant depending only on K_loc, F and log K, and a factor linear in F is shown to be necessary. | Read |
| NOTE-1163 | Isaac — Phenomenal structure: what is it and what is it for? | A structuralist programme for the science of phenomenal experience, set out as a stance and not a thesis. Experience has three layers of structure: quality-space geometry, which is a precondition for meaning; group-theoretic constancy, which “induces a distinction between subject and object”; and dynamic structure, vector fields of valence and affordance, which guide action. The method is the search for structure-preserving maps among experience, world and brain, held as a regulative ideal and advanced by de-idealizing the models where the maps fail. The evidence that such models target experience, not mere behaviour, is chiefly convergence between models built by different behavioural routes, which the paper admits is always partial. The group-theoretic and dynamic layers are, in the author’s words, “mere suggestive sketches”. | Read |
| NOTE-1164 v2 | Bartók, Foster, Pál, Rakhlin and Szepesvári — Partial monitoring: classification, regret bounds and algorithms | For finite partial-monitoring games the minimax regret takes exactly four rates: 0 with one non-dominated action, Θ̃(√T) when every pair of neighbouring actions is locally observable, Θ(T^2/3) when the game is globally but not locally observable, and Θ(T) otherwise. The conditions are linear algebra on loss and signal matrices: a loss difference must lie in the span of the row spaces of the signal matrices of the actions allowed to estimate it. The stochastic classification covers every game; the adversarial one covers non-degenerate games only. | Read |
| NOTE-1165 | Wald — Sequential tests of statistical hypotheses | Defines the sequential probability ratio test: sample until the likelihood ratio of two simple hypotheses leaves an interval (B, A). Exact inequalities tie A and B to the error rates, so A = (1 − β)/α and B = β/(1 − α) are set with no distribution theory, and the realized errors can rise above α or β only slightly. It derives the operating characteristic and the expected sample size. It proves that no test with the same errors needs fewer observations on average under either hypothesis, once the overshoot of the boundaries is neglected, and for a normal mean it saves about half the fixed-sample test. It never mentions diffusion or Brownian motion. | Read |
| NOTE-1166 v3 | Meng, Bau, Andonian and Belinkov — Locating and editing factual associations in GPT | Causal tracing restores one clean hidden state into a run whose subject tokens were noised, and measures how much of the correct object’s probability comes back. In GPT-2 XL, over 1000 known facts, the effect concentrates at two sites: middle layers at the last subject token, where MLP outputs dominate, and late layers at the last token, where attention does. A rank-one update of one middle MLP’s output matrix, keyed on the subject’s last token, then inserts counterfactual facts that generalize to paraphrases while sparing neighbouring subjects, which no other editor tested does on the new CounterFact dataset. The authors read this as showing where and how facts are stored. | Read |
| NOTE-1167 | Wang, Variengien, Conmy, Shlegeris and Steinhardt — A circuit for indirect object identification in GPT-2 small | A circuit of 26 attention heads in seven classes that carries GPT-2 small’s indirect-object predictions on fifteen templates, found by tracing back from the logits with path patching and checked against three criteria. Mean-ablating everything else keeps 87% of the logit difference; knocking out the three main name movers costs 5%, because other heads take over; and a greedy search finds knockouts under which circuit and model differ by up to 87%. Its by-products: heads that communicate positions rather than tokens, induction heads doing a different job from their original one, and heads that write against the answer. | Read |
| NOTE-1168 v2 | Chan, Garriga-Alonso, Goldowsky-Dill, Greenblatt et al. — Causal scrubbing | A method for testing a stated mechanistic hypothesis about how a network produces a behaviour on a dataset. The hypothesis maps an interpretable computational graph into the model’s graph; every activation is then replaced, recursively from the output, by its value on another input the hypothesis says is equivalent, and unclaimed inputs by their values on a random input. The share of the behaviour that survives is the score. It is applied to a parenthesis-balance classifier (93% down to 72% as the hypothesis is made more specific) and to induction in a two-layer attention-only model (35% for the naive hypothesis, 86% refined). | Read |
| NOTE-1169 | Mueller, Geiger, Wiegreffe, Arad et al. — MIB, a mechanistic interpretability benchmark | A benchmark for two kinds of mechanistic-interpretability method, with fixed counterfactual inputs, private test sets and new metrics. In circuit localization, edge attribution patching with integrated gradients does best on average and node-level circuits poorly; in causal-variable localization, supervised distributed alignment search gives the highest interchange-intervention accuracy, and features of public sparse autoencoders selected by a learned mask never beat the same mask on the model’s own hidden dimensions. | Read |
| NOTE-1170 | Conmy, Mavor-Parker, Lynch, Heimersheim and Garriga-Alonso — Towards automated circuit discovery (ACDC) | Names a three-step workflow behind manual circuit discovery (choose a behaviour, metric and dataset; choose the units of the computational graph; patch activations to prune the graph) and automates the third with ACDC, which visits nodes from the output back and removes each incoming edge whose replacement by its value on a corrupted input raises the KL divergence from the full model by less than a threshold. Against circuits reported by earlier manual work it ranks edges with AUCs of 0.85–0.98 on three language-model tasks, beating two adapted pruning methods there, but does poorly on compiled tracr programs unless zero activations are used, misses negative components at sparse thresholds, and keeps only one input of an OR gate. | Read |
| NOTE-1171 | Thibaux and Jordan — Hierarchical beta processes and the Indian buffet process | The beta process BP(c, B0) is the de Finetti mixing measure of the Indian buffet process: by beta–Bernoulli conjugacy, customer n + 1 takes dish j with probability m_{n,j}/(c + n) and Poisson(cγ/(c + n)) new dishes, which is the IBP at (c, γ) = (1, α) and its two-parameter generalisation otherwise. A hierarchy of beta processes lets groups share features, which requires a discrete shared base, at group-specific prevalences Beta(c_j b, c_j(1 − b)). On one unbalanced 20 Newsgroups split it beats tuned Laplace-smoothed naive Bayes, 58% against 50%. | Read |
| NOTE-1172 v3 | Griffiths and Ghahramani — The Indian buffet process: an introduction and review | Derives the Indian buffet process as the K → ∞ limit of a finite beta–Bernoulli model, πk ~ Beta(α/K, 1), on left-ordered equivalence classes of binary matrices: the number of occupied features K+ is Poisson(αH_N) and each object holds Poisson(α) features. For finite K the paper gives only the bound E[1ᵀZ1] = Nα/(1 + α/K) ≤ Nα; the αH_N count holds in the limit, and at finite K the expected count is strictly below it. It reviews applications, the two-parameter, stick-breaking, beta process, Markov and phylogenetic variants, and names column independence as an assumption later relaxed. | Read |
| NOTE-1173 | Olsson et al. — In-context learning and induction heads | In 34 transformer language models, in-context learning (loss at token 500 minus loss at token 50) appears abruptly in one early window of training, together with induction heads, the only non-convex bump in the loss curve and a turn in the models’ per-token-loss trajectory; one-layer models show none of it. Letting one layer express induction (smeared keys) moves the jump, and ablating induction heads removes nearly all in-context learning in small attention-only models. The case is causal for small attention-only models and correlational or by analogy for large models with MLPs, as the authors grade it themselves. | Read |
| NOTE-1174 | Dunefsky, Chlenski and Nanda — Transcoders find interpretable LLM feature circuits | A transcoder replaces one MLP sublayer with a wide sparse ReLU MLP trained on its input–output pairs. With attention patterns frozen and LayerNorm linearized, the attribution between two transcoder features factors into the earlier feature’s activation times the input-invariant dot product of its decoder with the later feature’s encoder, so circuits through MLPs can be read partly off the weights. On GPT2-small, Pythia-410M and Pythia-1.4B transcoders sit on or above the SAE sparsity–loss frontier, under one learning rate and one seed; in nine blind case studies on GPT2-small the method recovered the feature’s meaning in five, mostly in two and failed in two. | Read |
| NOTE-1175 v2 | Williamson, Orbanz and Ghahramani — Dependent Indian buffet processes | Couples IBPs over a covariate by thresholding Gaussian processes: z_nk(t) = 1 when h_nk(t) falls below the b_k quantile of its marginal, with stick-breaking sticks b_k that do not depend on t. Each item’s indicator is then Bernoulli(b_k) at every t, so prevalence is fixed and persistence is set apart from it by the GP covariance. The paper says Z(t) is IBP-distributed at each t; that holds exactly in its collapsed model, while with a shared feature-level GP the items at one t are correlated and fewer features are occupied. Truncated Gibbs with HMC; lower held-out RMSE than the IBP on two datasets. | Read |
| NOTE-1176 | Blei, Griffiths and Jordan — The nested Chinese restaurant process and hLDA | The nCRP puts a prior on infinitely deep, infinitely branching trees as a nested sequence of CRP partitions, exchangeable in its customers. In hLDA each document is one root-to-leaf path and spreads its words over that path’s topics by a GEM draw, so general topics settle near the root and documents share topics only as shared ancestry. A collapsed Gibbs sampler finds an approximate posterior mode. It recovered eight of ten simulated three-level trees exactly, gave readable hierarchies of JACM, Psychological Review and PNAS abstracts, and beat LDA in held-out likelihood near its own topic count on JACM, by a harmonic-mean estimate. No identifiability result is given: the authors say recovery depends on data size and “how identifiable the topics are”. | Read |
| NOTE-1177 | Musat, Pimentel, Zucchet and Hofmann — Invariant learning dynamics of transformers in inductive reasoning tasks | For a class of “block-list” next-token tasks that includes associative recall, k-hop induction and in-context n-grams, population gradient descent keeps an attention-only transformer’s merged key–query and output weights in a subspace fixed by the data’s token-relabelling and position-shift symmetries, whose coordinates are elementary actions (“attend to the previous position”, “read the token retrieved by head 1”). On it, a saturated in-weights circuit suppresses the in-context circuit’s gradient by the fraction of data it does not solve, burstiness multiplies that gradient, initialization decides which of several induction circuits wins, and projecting a trained model onto the coordinates recovers its circuit, with “aiding” directions a head-level analysis would miss. | Read |
| NOTE-1178 | Templeton, Conerly, Marcus, Lindsey et al. — Scaling monosemanticity | Sparse autoencoders of about 1M, 4M and 34M features on the middle-layer residual stream of Claude 3 Sonnet, trained to a compute-optimal loss, explain at least 65% of its variance and yield features that are multilingual and multimodal, that mostly match no neuron, and that steer the model’s output when clamped, including features for unsafe code, bias, sycophancy and deception. Whether a concept has its own feature depends on its training frequency relative to the number of live features. The interpretability and steering evidence is shown on selected features, and the most strongly active features are mostly not those that matter to an answer. | Read |
| NOTE-1179 | Airoldi, Blei, Fienberg and Xing — Mixed membership stochastic blockmodels | Each node has a Dirichlet membership vector over K blocks; for every ordered pair, each node draws one block for that interaction, and the edge is Bernoulli with the block pair’s rate in B, scaled by a sparsity factor. So a node can take different roles with different partners. Variational EM with a nested schedule fits it. It recovers simulated blocks, matches 63 of 69 students to their grades, and maps yeast proteins to functions at about 87% against a 70% baseline. Its claim that B and the memberships do not compete for the data is asserted, not shown: memberships and B trade along a continuum given the graph, and the sparsity factor is exactly confounded with B’s scale. | Read |
| NOTE-1180 | Rosen-Zvi, Chemudugunta, Griffiths, Smyth and Steyvers — Learning author-topic models from text corpora | Each word of a document is assigned to one of its observed authors uniformly, then to a topic from that author’s distribution over a fixed number of topics, so the document–word matrix factors as ΦΘA with A the known authorship. A blocked collapsed Gibbs sampler fits it to NIPS, CiteSeer and 121,298 Enron emails. On NIPS it beats LDA in perplexity only while sixteen or fewer of a test document’s words are seen, and a per-document fictitious author helps throughout. Topics are identified only up to permutation, by the authors’ account, and about 80 of 100 aligned across two runs. Authorship is given, never inferred. | Read |
| NOTE-1181 v2 | Lindsey et al. — On the biology of a large language model | Case studies of Claude 3.5 Haiku through attribution graphs of a 30-million-feature cross-layer transcoder, each checked by inhibiting or injecting features in the model. On single prompts: “Dallas” reaches “Austin” through “Texas” features, beside a direct shortcut; a rhyme is chosen on the newline before a line and the line is written towards it; one addition lookup-table feature serves arithmetic, citations and tables; “can’t answer” features are on by default and inhibited by known-entity features; a chain of thought can work backwards from a hinted answer; a jailbreak’s target word is not represented before it is written; a goal finetuned into a model organism is represented across every Assistant context. The authors call these existence proofs and report a satisfying graph for about a quarter of prompts tried. | Read |
| NOTE-1182 v3 | Olah, Cammarata, Schubert, Goh, Petrov and Carter — Zoom in, an introduction to circuits | A programme essay, not a study. It offers three deliberately speculative claims, as empirical claims about networks and as norms for studying them: features (directions in a layer’s activation space, often single neurons) are the unit of a network; features joined by weights form circuits whose algorithms can be read off the weights; and analogous features and circuits form across models. The examples are qualitative and from InceptionV1, with the detailed evidence promised to later articles. Polysemantic neurons are named as the main obstacle, and a car feature spread over dog neurons is the first case it calls superposition. | Read |
| NOTE-1183 | Wang, Hu, Du, Cheng, Wang and Zou — Fine-tuning mechanisms of LLMs via circuit analysis | When Pythia-1.4B is fine-tuned with LoRA on arithmetic tasks it starts out failing, EAP-IG circuits of 5% of edges found at successive checkpoints keep most of their nodes and change most of their edges (change rates 15–24% for nodes, 66–80% for edges), mostly in the middle layers; giving higher LoRA rank to the layers whose edges change most beats uniform and random rank allocation at similar size, and the union of two subtasks’ circuits approximates a two-step task’s circuit. The node–edge contrast carries no comparison against a null. | Read |
| NOTE-1184 v2 | Doshi-Velez and Ghahramani — Correlated non-parametric latent feature models | Makes IBP features correlated by having observations choose categories and categories choose features, Z = f(CM). If f(0) = 0, a finite dataset has finitely many features. DP-IBP, IBP-IBP and noisy-or IBP-IBP models have O(log log N) expected features. A category can switch features on, never off: features are dependent by sharing a category, or in the DP-IBP by belonging to rival ones, and suppression is left as future work. Against the IBP the structured variants win on three of five datasets, lose on the UN data and split on the gene data. | Read |
| NOTE-1185 | Ameisen et al. — Circuit tracing: revealing computational graphs in language models | A cross-layer transcoder (CLT) replaces a model’s MLPs with sparse features, each reading one layer and writing to all later ones. On one prompt, freezing attention patterns and normalization denominators and adding back the reconstruction error makes a local replacement model that reproduces the model exactly and is linear between features, so its attribution graph decomposes each feature’s pre-activation into edges. The graphs are hypotheses about the model, tested by perturbing features in it. The authors’ own measurements: the replacement matches the model’s top token on about half of prompts, and its perturbation responses agree with the model’s for a layer or two and then diverge. | Read |
| NOTE-1186 | Bayazit, Mueller and Bosselut — Crosscoding through time | Trains one sparse crosscoder jointly on the mid-layer activations of two or three pretraining checkpoints, so features share an index across them, and scores each feature’s causal importance for subject–verb agreement at each checkpoint (Relative Indirect Effect). In Pythia-1B, OLMo-1B and BLOOM-1B the important features move, by the authors’ annotation, from token-specific detectors to grammatical-category ones, and in BLOOM from language-specific to crosslingual ones for Latin-script languages; importance keeps shifting after accuracy plateaus. A method for describing which features emerge, persist and lose importance, not for predicting it. | Read |
| NOTE-1187 | Marks, Rager, Michaud, Belinkov, Bau and Mueller — Sparse feature circuits | Circuits whose nodes are sparse-autoencoder features and autoencoder error terms, found in Pythia-70M and Gemma-2-2B by linear approximations to indirect effects. On subject–verb agreement, circuits of about 100 and 500 nodes carry half or more of the behaviour on held-out pairs, where neuron circuits need far more, but without the error nodes the feature circuits carry little. The annotated circuits show two pathways for agreement across a clause. A human removing gender features from a classifier’s circuit (SHIFT) brings profession accuracy on balanced data near an oracle’s, and the method runs without supervision on thousands of behaviours clustered from the Pile. | Read |
| NOTE-1188 | Wang, Hoogland, van Wingerden, Furman and Murfet — Refined local learning coefficients of attention heads | Restricts the local learning coefficient, singular learning theory’s measure of how degenerate the loss is near a parameter, to one component’s weights (weight-refined) or to another data distribution (data-refined), and tracks it per attention head over the training of a two-layer attention-only transformer. The heads’ curves start alike and diverge, and cluster by the heads’ functional types; refinement to code separates the two induction heads; refinement to a one-layer model’s outputs locates layer-0 heads giving up simple n-grams as a circuit with layer-1 bracket-matching heads forms. One model, one run in the main text, three more seeds in an appendix. | Read |
| NOTE-1189 | Elhage, Nanda, Olsson et al. — A mathematical framework for transformer circuits | An exact reformulation of attention-only transformers, and a reading of toy models with it. Heads are independent and additive, each a QK bilinear form that sets the attention pattern and an OV map that sets what moves; with patterns frozen, the logits are a sum of path terms (direct, one per head, one per composed pair of heads). Zero-layer models are bigram tables, one-layer models bigram and skip-trigram tables dominated by copying heads, and in a two-layer model the only substantial composition builds induction heads from a previous-token head by K-composition. MLP layers, two-thirds of a standard transformer’s parameters, are left open. | Read |
| NOTE-1190 v2 | Kramár, Lieberum, Shah and Nanda — AtP*, attribution patching and its failure modes | Attribution patching (AtP) estimates every node’s activation-patching effect at once from two forward passes and one backward pass, by a first-order Taylor expansion. On Pythia models from 410M to 12B, using it to order which nodes to verify by real patching finds the largest-effect nodes far more cheaply than unordered patching or sampling-based search. Its false negatives come from saturated attention softmaxes and from direct and indirect effects that nearly cancel; AtP* recomputes the softmax for queries and keys and averages gradients with one layer dropped at a time. A subsampling test gives an upper confidence bound on the size of any nodes it still misses. | Read |
| NOTE-1191 | Bricken, Templeton, Batson, Chen, Jermyn et al. — Towards monosemanticity | Sparse autoencoders trained on the 512-neuron MLP layer of a one-layer transformer, at widths from 512 to 131,072, recover features that one blinded author and Claude both rate far more interpretable than neurons, that mostly match no neuron, whose effects on the output (which the autoencoder never saw) agree with their activations, and that recur in a second model trained from another seed. The features split into finer families as the dictionary widens, so the authors doubt there is one correct number of features. Everything is in one MLP layer of a one-layer model, and the detailed cases are chosen to be easy. | Read |
| NOTE-1192 | Geiger, Wu, Potts, Icard and Goodman — Distributed alignment search (DAS) | Causal abstraction tests whether a network implements a high-level causal model by interchange interventions under an alignment of variables, which earlier work found by brute-force search over disjoint sets of neurons. DAS learns the alignment instead: an orthogonal rotation trained by gradient descent so that swapping rotated subspaces between inputs reproduces the high-level model’s counterfactuals. In a feed-forward network trained on hierarchical equality and in BERT fine-tuned on monotonicity NLI it finds alignments with interchange intervention accuracy of 1.00 where the best localist ones reach 0.73 and 0.51. In BERT the entailment subspace decomposes into the two word identities; in the equality network it does not. On random networks DAS raises accuracy above chance only when the hidden layer is much wider than the input. | Read |
| NOTE-1193 | Marks, Treutlein et al. — Auditing language models for hidden objectives | A model trained on documents describing 52 fictional reward-model biases, then by SFT and RL to exploit 47, exploits the 5 held-out biases more (17% to 45%) and new ones described in context more than other entities’ biases; without the documents the held-out rate barely moves, and without SFT it still rises. Three of four blind auditing teams found the objective, all by finding the documents in the training data; the API-only team did not. Post hoc, semantic search matched the fastest team’s SAE route, and SAE features found the objective from the Assistant token and from bias demonstrations where search failed. | Read |
| NOTE-1194 | Hase, Bansal, Kim and Ghandeharioun — Does localization inform editing? | On 652 CounterFact facts GPT-J completes correctly, the paper asks whether the layer where causal tracing places a fact predicts where an edit of that fact succeeds. It does not. Regressing edit success on the edit layer explains most of its variance (94.7% for ROME’s rewrite score), and adding the per-fact tracing effect adds at most 3.2 points, across four editing methods and five editing problems; for ROME at layer 6 the correlation is slightly negative. ROME rewrites at over 96% at every layer but the last. The authors conclude that tracing and editing answer different questions. | Read |
| NOTE-1195 | Chan, Garriga-Alonso, Goldowsky-Dill, Greenblatt, Lin et al. — Causal scrubbing: results on a paren balance checker | Causal scrubbing applied to a small transformer that classifies parenthesis strings as balanced. Saying which three heads carry which test recovers 88–93% of the loss; adding how the heads compute their tests brings the combined hypothesis to 72%, the excess losses of its two halves roughly adding. Splitting one head’s input into separately resampled terms raised the score from 77% to 81–84%, which the authors say is an artefact of resampling, not a better explanation. | Read |
| NOTE-1196 | Chan, Garriga-Alonso, Goldowsky-Dill, Greenblatt, Lin et al. — Causal scrubbing: results on induction heads | In a two-layer attention-only model, heads 1.5 and 1.6 contribute 0.053 nats of loss on tokens where induction helps. The textbook induction circuit accounts for 35% of that. Matching on the last three tokens, layer 0’s average effect, and three layer-0 heads that attend to copies of the current token raise it to 86% (91% unscrubbed, 89% with a crude rule for the previous-token head’s deviations). The heads use more paths than the story names, but few positions. | Read |
| NOTE-1197 | Meng, Sen Sharma, Andonian, Belinkov and Bau — Mass-editing memory in a transformer | MEMIT inserts thousands of facts into GPT-J and GPT-NeoX at once. It treats the MLP output matrix of each layer in a range that causal tracing implicates as a linear associative memory, computes for each fact a target change of the hidden state at the top of that range, and spreads it over the layers with a closed-form least-squares update for the whole batch. At 10,000 CounterFact edits on GPT-J it scores 85.8 against 50.3 for ROME applied one at a time; ROME is better at a handful of edits. | Read |
| NOTE-1198 v2 | Cammarata et al. — Curve detectors | The ten curve units of InceptionV1’s mixed3b are argued to detect curves: feature visualizations are curves, unit 3b:379 fires on about 11% of dataset positions and its activation level separates blind hand labels of over 800 images, curves and imperfect curves make up 55% of its contribution to expected value, synthetic curves drive it up to 24 standard deviations, and rotated dataset examples show the ten units tiling all orientations. Causality, generality and the family are argued from these; purity is argued but its mechanistic support is deferred to the next article, and no count of how much of the layer is understood is given. | Read |
| NOTE-1199 v2 | Van Gael, Teh and Ghahramani — The infinite factorial hidden Markov model | Introduces the Markov Indian buffet process: each feature is a two-state Markov chain over time steps, starting off, with its own probability of switching on, a_m ~ Beta(α/M, 1), and of staying on, b_m ~ Beta(γ, δ), drawn independently. In the limit the number of features ever on is Poisson(αH_T). Used as the prior of an infinite factorial HMM, it recovers who is speaking when in mixed speech better than an IBP prior. The sequential buffet as printed has both of its predictive rules wrong. | Read |
| NOTE-1200 | Geva, Schuster, Berant and Levy — Transformer feed-forward layers are key-value memories | A feed-forward layer f(x·Kᵀ)·V has the form of a key–value memory without the softmax: each hidden unit’s input weights are a key and its output weights a value. In a 16-layer WikiText-103 language model, the training prefixes that most activate a sampled key share patterns humans recognize, shallow in layers 1–9 and semantic in 10–16; projected onto the vocabulary, upper-layer values agree with the next token of their key’s top prefix in up to about 3.5% of units; and a layer’s prediction is usually a composition of many memories, refined across layers through the residual stream. | Read |
| NOTE-1201 v2 | Nanda — Attribution patching | Activation patching costs a forward pass per patched activation. Attribution patching replaces each patch by its first-order estimate on the corrupted run, (clean − corrupted activation) · gradient, so every patch costs two forward passes and one backward pass in total, and estimates add over sub-components. On IOI in GPT-2 Small it is said to track activation patching for heads and their queries, keys, values and patterns, and to fail for residual streams and the first MLP. The post argues it should fail where nonlinearities leave saturation, where an effect needs several features at once, and for large patches through LayerNorm, and frames all patching as specific to the prompt distribution chosen. | Read |
| NOTE-1202 v2 | Chan, Garriga-Alonso, Goldowsky-Dill, Greenblatt et al. — Causal scrubbing: Appendix | The appendix the main post defers to. It defines % loss recovered against a label-shuffled baseline. It gives three reasons to prefer resampling ablation to zero or mean ablation. It proves that the algorithm’s sampled inputs are the maximum-entropy distribution that keeps every interpretation node’s inputs jointly as on the data, which the record re-checked. It explains superposition as monosemantic terms plus a resampled interference term, and builds a false hypothesis that scores ten times the model’s own expected score. | Read |
| NOTE-1203 | Ghahramani and Jordan — Factorial hidden Markov models | Defines the factorial HMM: M hidden chains of K states, a priori independent, whose one-hot states add their columns of W^(m) to set a Gaussian observation’s mean. Exact inference costs O(TMK^{M+1}); Gibbs, completely factorized and structured variational E steps make EM tractable. On synthetic problems an HMM with K^M states overfits badly while the approximate factorial HMMs stay near exact training; on Bach chorales factorial HMMs with up to 1000 states predict better than the best HMM. Its footnote 3 on when the chains decouple is wrong unless the covariance is isotropic. | Read |
| NOTE-1204 | Van Gael, Saatci, Teh and Ghahramani — Beam sampling for the infinite hidden Markov model | Introduces the beam sampler for the infinite HMM: a slice variable u_t ~ Uniform(0, π_{s_{t−1}s_t}) at each step cuts the infinitely many transitions out of each state to the finitely many above u_t, so whole trajectories are sampled exactly by forward filtering, backward sampling. Against the Gibbs sampler it mixes in fewer iterations on strongly correlated synthetic sequences, is less sensitive to the hyperprior, handles a non-conjugate Cauchy likelihood on well-log data, and costs close to O(TK) per iteration in practice; the comparisons are charts and visual judgements. | Read |
| NOTE-1205 | Scherlis et al. — Polysemanticity and capacity in neural networks | In a model computing Σ(W_i·x)² + b to fit Σ v_i x_i², with independent unit-variance inputs of fourth moment k, the expected loss is (k − 1)Σ(n_i − v_i)² − 2Σn_i² + 2Σn_i²/C_i, so the marginal value of capacity is −2n_i²/C_i² and the optimum has a closed form: dense inputs (k ≤ 3) give every feature all or nothing, sparse ones (k > 3) share features whose importance lies between 2λ/(k − 1) and λ. Efficient embeddings are exactly block-semiorthogonal. Re-derived and checked. The bearing on trained networks is argued, not shown. | Read |
| NOTE-1206 | Olah et al. — An overview of early vision in InceptionV1 | Every one of the 1,056 units of InceptionV1’s first five layers is put in exactly one of 77 named groups, with each group’s share of its layer; the shares are consistent with the unit counts. By the authors’ own captions, 391 units (37%) are in groups called catch-all, broad and not well defined, low-confidence, unstudied or not understood, from 7% of conv2d2 to 48% of conv2d1. The groups are sorted by eye, and most units had “a few minutes of cursory investigation”, so the census is a denominator for THEORY-1013, not the criterion its promote_when asks for. | Read |
| NOTE-1207 | Cammarata et al. — Curve circuits | The ten curve units of InceptionV1’s mixed3b are traced back through four layers of families (Gabors, lines, early curves), each tiled along the curve’s tangent with rotational and scale equivariance; negative weights from opposite early curves remove the 180° echo, which circuit editing restores. A hand-written network built from the description approximates the units on synthetic curves, by figure, and substituting it recovers 26 of the 46 top-5 classifications lost by deleting the units, on 2,000 images. The three arguments Curve Detectors deferred are supplied, mostly qualitatively. | Read |
| NOTE-1208 | Griffiths and Ghahramani — Infinite latent feature models and the Indian buffet process | Introduces the Indian buffet process: the finite beta–Bernoulli feature model with π_k ~ Beta(α/K, 1) has a limit as K → ∞ on left-ordered equivalence classes, eq. (4), and a sequential buffet produces the same distribution, so objects are exchangeable and K+ ~ Poisson(αH_N). Used as the prior of an infinite binary linear-Gaussian model, its Gibbs sampler settles on about seven features for 100 photographs of four objects. The paper is the original of the authors’ 2011 review. | Read |
| NOTE-1209 | Knowles and Ghahramani — Infinite sparse factor analysis and infinite independent components analysis | Defines infinite sparse factor analysis and infinite ICA: Y = G(Z ⊙ X) + E, an IBP mask Z over unboundedly many sources, Gaussian or Laplacian sources, and four variants with the one- or two-parameter IBP. Its Gibbs sampler integrates a source’s value out when deciding whether it is active. On 30 sparse synthetic data sets the IBP variants beat FastICA in Amari error; on ovarian cancer microarray data it finds a tissue-specific signature also found by ICA. Results are figures only, and the text misstates the IBP’s total number of features. | Read |
| NOTE-1210 | Teh, Görür and Ghahramani — Stick-breaking construction for the Indian buffet process | Derives the IBP’s stick-breaking construction: in decreasing order the feature probabilities are μ_(k) = ∏{l≤k} ν_l, ν_l ~ Beta(α, 1), so E[μ(k)] = (α/(α + 1))^k, and the discarded pieces are the Dirichlet process’s sticks. Slice samplers built on it, one ordered and one semi-ordered, need no conjugacy; on 120 synthetic datasets the semi-ordered one mixes as fast as Gibbs. The truncation CASE-165 quotes, 8.97 features at K = 16, N = 12, α = 3, is exact here at 8.974. | Read |
| NOTE-1211 | Athreya, Czuppon & Gokhale — The evolution of dependence and cohesion in incipient endosymbioses | An adaptive-dynamics model in which hosts, symbionts and host–symbiont collectives are three populations. Each partner has an “obligacy” (investment in collective rather than free-living growth) and an “adhesion” (investment in synchronized, collective reproduction). The faster-growing partner, the symbiont, becomes fully obligate first. What the host’s obligacy then does depends on within-collective births and deaths: it stays, rises to full dependence, or falls to none. Obligacy rises only if the collective’s carrying capacity is high enough; collective growth rate does not matter. Early on, dependence evolves ahead of cohesion. That last result holds for the trait mapping the authors chose, and their own Table S1 reverses it under the opposite mapping. The authors say the available data can neither confirm nor refute it. | Read |
| NOTE-1212 | Morris, Lenski & Zinser — The Black Queen Hypothesis | Proposes that in free-living microbes, losing a costly function whose product leaks to neighbours is favoured by ordinary individual selection, and the loss runs until the remaining producers (“helpers”) just supply the community, leaving most cells (“beneficiaries”) dependent on a rare few. No relatedness, cooperation or collective is needed, only leakiness and frequency dependence. The one worked case is the loss of catalase-peroxidase (katG) in Prochlorococcus, which cannot survive the hydrogen peroxide that its community removes. The other cases are suggestions. | Read |
| NOTE-1213 | McCutcheon, Garber, Spencer & Warren — How do bacterial endosymbionts work with so few genes? | An essay on the endosymbionts with genomes under about 200 kb, which the authors call “tipping-point endosymbionts”. Below about 400 kb, symbionts almost always lose the genes to build their own envelope and to move proteins across it. Below about 200 kb, even translation erodes: ribosomal proteins, tRNAs and aminoacyl-tRNA synthetases go. Their proteomes are among the most compositionally biased in bacteria. The paper asks four questions it cannot answer: where their membranes, transporters, missing translation parts and protein stability come from. Its best guess is from the host, as in organelles. The thresholds come from a hand-picked set of genomes, and the composition analysis is called preliminary. | Read |
| NOTE-1214 | Di Biagio & Rovelli — Relative information, relative facts | A reformulation of relational quantum mechanics in Shannon terms. The information about A relative to B is the expected conditional information, I_{A|B} = I_A + I_{A:B}. A is a fact relative to B when that is maximal. Only commuting variables have a joint distribution, so perspectives belong to commutative subalgebras (“classical subsystems”) and not to quantum systems: a qubit has none. “Every fact is a relative fact”, and the joint distribution is itself relative to a further system, generally “us”. As a side result, in a von Neumann measurement the pointer’s information about the measured variable grows continuously, sin²(ωt)H_A in the model. The jump is only a threshold on what counts as a fact. Merging of perspectives, Wigner’s friend and the extended scenario are treated by worked examples, not theorems. | Read |
| NOTE-1215 | Ashwin, Wieczorek, Vitolo & Cox — Tipping points in open systems | A classification and a criterion, not an empirical study. Tipping in an open system ẋ = f(x, λ(t)) is split into B-tipping (a bifurcation of the quasi-static attractor), N-tipping (noise carries the system out of its neighbourhood) and R-tipping, where “the system fails to track a continuously changing quasi-static attractor”. In a linear model with a fixed stable M and a tipping radius R, the attractor never changes stability, yet steady drift r tips the system when ‖M‖⁻¹|r| > R and cannot when ‖M⁻¹‖|r| < R. Three examples, one with a unique globally stable equilibrium, and a global energy balance model show each type alone. Neither N- nor R-tipping needs any change of stability, so there is no reason to expect critical-slowing warnings for them. | Read |
| NOTE-1216 | Flack — Coarse-graining as a downward causation mechanism | A conceptual paper, not a report of new data. Downward causation is made operational as components tuning their behaviour to their own estimates of coarse-grained variables that they collectively compute. In its weak, “apparent” form only one component need tune, to a variable slower than the behaviour producing it, and estimates need be neither correct nor shared. The strong, “effective” form needs the variable to be predictive (slow), robust, used nearly universally, agreed on, and gaining mutual information with the microscopic behaviour; only then does Flack speak of a new organizational level. Regeneration of the variable by its use is not among the criteria; what reinforces itself is convergence of the estimates. The macaque power distribution is the worked example, reviewed from earlier papers. | Read |
| NOTE-1217 | Stewart, Golubitsky & Pivato — Symmetry groupoids and patterns of synchrony | In a coupled cell network, an equivalence relation on the cells gives a synchrony subspace invariant under every vector field the network admits if and only if it is balanced: every two equivalent cells have an input isomorphism that maps each input to an equivalent one (Theorem 6.5). Symmetry is one source of balance, not the only one, so robust synchrony occurs in networks with no symmetry. The dynamics on such a subspace are admissible for a smaller quotient network (Theorem 9.2), which can have a symmetry the original lacks. The paper treats existence only, not stability, and says so. | Read |
| NOTE-1218 | Torres-Hugas et al. — Cycle holonomy and remote synchronization | For a phase model whose edges carry antisymmetric phase lags, the twisted Laplacian Lα = δα*δα has a zero mode exactly when every cycle holonomy is 0 mod 2π, and otherwise its smallest eigenvalue measures the residual incompatibility; for an isolated ℓ-cycle that eigenvalue is largest at holonomy π. The symmetric Sakaguchi–Kuramoto model is a different model, but on cactus graphs its lag gives each ℓ-cycle a path mismatch (ℓ − 2)α, which an associated connection is built to carry as holonomy. In the triangle–pentagon remote-synchronization motif, the pentagon’s mismatch reaches π at α = π/3, where the locked branch is exactly a two-group state; but the branch has already lost transverse stability at αc ≈ 1.0164, so the holonomy marks geometry, not stability. | Read |
| NOTE-1219 | Deutsch & Marletto — Constructor theory of information | A programme paper, not a theorem paper. It defines information without distinguishability: a set of attributes is an information variable when every permutation of it and its cloning are possible tasks, and distinguishability is then defined from that, which removes the circularity of (1.1). It conjectures principles III–IX for classical information, and shows informally that one extra prohibition, a union of two disjoint information observables that is not one, yields indistinguishable states, no-cloning, complementarity, deterministic unpredictability, irreducible measurement disturbance and locally inaccessible information. It calls instantiating information “an exact, intrinsic property of the substrate”, so it supplies a modal, not a relational, account of what an information medium is. | Read |
| NOTE-1220 | Faye & Jaksland — Barad, Bohr, and quantum mechanics | Barad’s reading of Bohr is not Bohr’s. For Bohr a phenomenon is the observed effect under a given experimental arrangement, epistemic and derivative, with atomic object and instrument presupposed real; Bohr was an entity realist, his relational holism epistemic, and the subject–object, knower–known and word–world dualisms are presupposed by his account, not dissolved. Nor does quantum mechanics entail agential realism: Bohmian mechanics reproduces its predictions with an ontology of individual particles, and Rovelli’s relational quantum mechanics, though close, keeps systems prior to their interactions. And because Barad denies that measurement disentangles apparatus and object, she cannot borrow Rovelli’s answer to the measurement problem, so even agential realism’s consistency with quantum mechanics is unshown. Its merits as social theory, “if any”, do not stem from quantum mechanics. | Read |
| NOTE-1221 | Robinson — Sheaves are the canonical data structure for sensor integration | An expository paper. It posits six axioms for an integrated sensor system and defines a sheaf as whatever satisfies them, so “canonical” is argued by that axiomatization, not proved; the paper itself calls sheaves one of “many co-universal information representations”. Its tools need less than a sheaf: on a presheaf of pseudometric spaces, the consistency radius of an assignment (the largest disagreement between an observation and the restriction of another) bounds its distance to every global section below by ε/(1 + K) when the restrictions are K-Lipschitz, and data fusion is the search for the nearest global section. In one simulated search-and-rescue scenario fusion cut the crash-location error 2–8×, and the per-restriction discrepancies singled out a biased sensor by inspection. Cohomology, for linear sheaves, flags configurations that can be locally but not globally consistent. | Read |
| NOTE-1222 | Hansen & Ghrist — Opinion dynamics on discourse sheaves | A discourse sheaf gives each agent a private opinion space and each edge a discourse space, with a linear expression map from each agent into each of its edges. Opinion diffusion by the sheaf Laplacian converges to the projection onto the global sections: agreement in what neighbours express, not in what they hold. Letting the expression maps diffuse instead converges to the nearest sheaf in which the fixed opinions agree in expression, which the authors call “learning to lie”. Nothing in the dynamics checks expression against what is held, so the agreement reached is coherence, not accuracy. | Read |
| NOTE-1223 | Baez & Fong — A compositional framework for passive linear networks | Open passive linear circuits (resistors, inductors and capacitors, the latter two through the Laplace transform over the field R(s)) are the morphisms of a hypergraph category Circ of decorated cospans, and black-boxing, which keeps only the Lagrangian relation a circuit imposes between its terminals’ potentials and currents, is a hypergraph functor Circ → LagRel (Thm 1.1, Thm 7.7). The relation is the graph of the differential of the power functional, the Dirichlet form left when the interior nodes are eliminated by the principle of minimum power; series resistors are the worked example. Dirichlet forms alone compose by that elimination but have no identities, so the target is Lagrangian relations. | Read |
| NOTE-1224 | Singer — Angular synchronization | Angles θ₁, …, θₙ are estimated, up to one global phase, from noisy offsets θᵢ − θⱼ of which an unknown fraction are pure outliers, by the top eigenvector of the Hermitian matrix Hᵢⱼ = e^{iδᵢⱼ} or by an SDP like Goemans–Williamson’s. On the complete graph a random-matrix argument puts the eigenvector’s threshold at p > 1/√n good offsets, with the expected squared correlation near 1/(1 + 1/(np²)). Fano’s inequality shows no algorithm can do much better: the information bound is of order √(n/m), and the polynomial method’s threshold is within a factor √((L − 1)/(2 log₂ L)) of it, where 2π/L is the angular resolution, while exhaustive maximum likelihood costs O(mLⁿ). | Read |
| NOTE-1225 | Spivak — Compositional dynamics in learning and mechanics | A category-theoretic syntax, the operad ArrSm of “smooth adaptive arrangements” (a responsive parameter space, a lens of output and input maps between manifolds, and a real potential), with two functorial semantics into polynomial coalgebras, i.e. discrete-time input-output machines. They differ only in the integrator: Φconf stores position and takes a descent step, Φphase stores position and momentum and takes a symplectic-Euler step. Φconf turns a parameterized map plus a loss into gradient descent with backpropagation, and a closed system with inverse-Hessian response into Newton’s method. One arrangement of harmonic particles on a finite directed graph gives the discrete wave equation under Φphase and the discrete heat equation under Φconf, both governed by the symmetrized graph Laplacian. The main technical result is lens internalization, a lax symmetric monoidal functor Lens_C → C. | Read |
| NOTE-1226 | Di Biagio & Rovelli — Stable facts, relative facts | A fact happens at every interaction and is relative to the system it affects. A fact relative to F is stable for another system W when W may use it as a conditional in the classical total-probability rule, eq. (3); interference is the failure of that rule. Decoherence gives stability: if F is entangled with an environment E whose branch states overlap by at most ε and W does not interact with E, eq. (3) holds for W up to O(ε). So stability is approximate (exact only as ε → 0) and relational (another system coupled differently to F–E may see interference), and a fact can be stable for W without being a fact relative to W. The authors base the ontology on relative facts, not stable ones, and read the Frauchiger–Renner contradiction and the Local Friendliness violation as the classical rule used across contexts where facts are not stable. | Read |
| NOTE-1227 | Rovelli — Relational quantum mechanics | Rovelli proposes that the incorrect notion behind the measurement problem is the observer-independent state of a system, as absolute simultaneity was behind the unease with the Lorentz transformations. Two descriptions of one measurement, by the measuring system O and by an external P who treats S+O unitarily, are both correct, so “q = 1” is elliptic for “q = 1 relative to O”, any physical system can be the observer, and the theory, taken as complete, is about the information (correlation) systems have about one another. The relation between two observers’ views is itself a quantum fact relative to a third, so no view can be deduced from another and there is no description in toto. Values are relational; systems are not: the world is assumed decomposed into systems, each characterized by its set of yes/no questions W(S) and an information capacity N. Two information postulates give an orthomodular lattice, and a third (superposition) postulate is needed for the Hilbert-space formalism; the reconstruction is, in the author’s words, “not fully successful”. | Read |
| NOTE-1228 | Toner & Tu — How birds fly together | A continuum theory of a flock: a coarse-grained velocity field with a convective term, a preferred speed and noise, coupled to a conserved density. Its linearized theory loses order in d ≤ 2, as the equilibrium XY model does, but the convective nonlinearity is relevant below d = 4, and in d = 2 symmetry fixes the exponents at z = 6/5, ζ = 3/5, χ = −1/5. Since χ < 0 the transverse velocity fluctuations stay bounded as the flock grows, so a flock has true long-range orientational order in two dimensions. The exactness rests on a cubic vertex staying irrelevant, which the authors “strongly suspect”; a fallback argument gives χ < 0 from z < 2, which they “expect on physical grounds”. | Read |
| NOTE-1229 | Zurek — Quantum Darwinism | A review. Decoherence singles out pointer states; quantum Darwinism adds that the environment is the channel observers read, and that decoherence leaves many copies of the pointer observable in it: the mutual information I(S : F_f) between the system and a fraction f of the environment rises steeply to a plateau at H_S, so R_δ = 1/f_δ fragments each hold nearly all of it, and redundancy is high only for the pointer observable. Zurek reads redundancy as objectivity. A clean unitarity argument (eq. 5) shows that only orthogonal states can be repeatably copied, without the Born rule, which he derives separately from envariance. The paper claims the measurement problem “largely settled”; it does not state the later caveat that mutual information alone does not guarantee independently accessible records. | Read |
| NOTE-1230 | Jaksland — Naturalized, fundamental, and feminist metaphysics all at once | A methodological paper, not an assessment of agential realism as quantum mechanics, which it assumes. Barad holds agential realism to be naturalized metaphysics, justified by quantum mechanics and applied once, to the one reality, whose scope then extends to the lifeworld; she rejects reading it as analogy or as a template that other domains instantiate. That extension is threatened by Newtonian mechanics being a good approximation in the macroscopic domain. It survives only if some ontological features (the subject–object and word–world dualisms, representationalism) are all-or-nothing and admit no metaphysical approximation. Jaksland leaves open whether any do, finds individualism “immediately more agreeable” as something that can obtain by approximation, and argues that even without such features the independence of social theorizing from fundamental metaphysics is contingent (on the size of Planck’s constant), not principled. | Read |
| NOTE-1231 | Clarke, Grumberg, Jha, Lu & Veith — Counterexample-guided abstraction refinement | A model checker runs on an existential abstraction that merges concrete states, so a property true of the abstraction is true of the program (Theorem 1). An abstract counterexample is checked against the concrete system by image computation; if it has no concrete counterpart, the first abstract state where it breaks is split to separate the concrete states reachable along it from those with the transition onward, and checking runs again. The coarsest such split is stated to be NP-hard (proof omitted), so a polynomial, non-optimal split is used. For finite-state programs and ACTL* properties whose counterexamples are paths or loops, the loop ends in a real counterexample or a proof. The property is fixed throughout. | Read |
| NOTE-1232 | Simon — ill structured problems | Simon argues that there is no real boundary between well and ill structured problems. Well-structuredness is judged by six conditions read as practicable, not in-principle, computability, so it is a relation between a problem and a bounded solver. On that reading even theorem proving and chess fail some conditions, chess is “well structured in the small” and ill structured “in the large”, and “there are no WSPs, only ISPs that have been formalized for problem solvers” (p. 186). House design, a battleship’s design by an organization and a robot in a real environment are handled by alternating a solver working on a locally well structured problem with a recognition and retrieval system that keeps modifying the problem space. Simon’s conclusion is deflationary: ill structured problems may differ from well structured ones only in the size of the knowledge base, and need no qualitatively new mechanisms. | Read |
| NOTE-1233 | Hansen & Ghrist — Toward a spectral theory of cellular sheaves | An exploratory programme, not a single result: the Hodge Laplacian of a weighted cellular sheaf, whose kernel in degree k is the cohomology H^k (in degree 0, the global sections), with sheaf versions of spectral graph theory’s basics: harmonic extension, an eigenvalue bound for normalized sheaves, interlacing, pushforward and covering spectra, product spectra, effective resistance and a sparsification theorem. The heat flow ẋ = −Δ^k x converges exponentially to the orthogonal projection onto the harmonic cochains (Prop. 8.1). Kron reduction fails for general sheaves, because an interior vertex can impose constraints on the boundary that no pairwise sheaf expresses. A Cheeger inequality is not proved; the applications in §8 are sketches. | Read |
| NOTE-1234 | Kay et al. — Dated gene duplications and the assembly of eukaryotes | A relaxed molecular clock dates 135 gene duplications that happened on the two stem lineages of eukaryotes, inside a species tree dated with 18 fossil calibrations. The authors take the onset of duplications in genes of alphaproteobacterial origin, about 2.2 billion years ago, as the mark of mitochondrial endosymbiosis. Most duplications of archaeal origin are older than that, including ones in actin, tubulin, vesicle trafficking and nuclear-targeted families, so the host was already elaborating its cytoskeleton, endomembranes and nuclear machinery. Most duplications of non-alphaproteobacterial bacterial genes come later, which the authors take as evidence against serial endosymbiosis. Each duplication date is a maximum age for its paralogues’ functions, many intervals reach below 2.2 billion years, and the order of phagocytosis and the mitochondrion is left open by the authors. | Read |
| NOTE-1235 | Campbell et al. — Changes in endosymbiont complexity drive host-level compensatory adaptations in cicadas | In cicadas whose endosymbiont Hodgkinia has split into many lineages, each essential, the mother must put every lineage into every egg. A simulation shows that random transmission would need far more cells as lineages multiply and grow uneven. Counts in eggs of four species find Sulcia numbers roughly constant, and Hodgkinia numbers up to about six times higher in Magicicada septendecim than in a single-lineage species. Amplicon sequencing found every tracked Hodgkinia genotype in every egg sampled. The transmission route looks the same under the light microscope. Only M. septendecim differs significantly; the six-lineage species does not. So the compensation rests on one species. The authors call the raised titre a cost of fragmentation, and speculate that it could feed further splitting. | Read |
| NOTE-1236 | Shigenobu, Watanabe, Hattori, Sakaki & Ishikawa — Genome sequence of the endocellular bacterial symbiont of aphids Buchnera sp. APS | The first complete genome of an obligate insect endosymbiont. Buchnera APS, from the pea aphid, has a 640,681-bp chromosome with 583 ORFs and two small plasmids. It is a subset of the E. coli gene set, produced by loss from a larger common ancestor. It keeps the pathways for the amino acids its host cannot make, lacks almost all of those the host can, and draws some precursors from the host, so the two partners’ pathways interlock. It also lacks phospholipid and lipopolysaccharide synthesis, almost all transcriptional regulators, and recA and uvrABC. The authors infer that it can live only in the bacteriocyte and compare it to an organelle. Everything here is read from gene content; no experiment on the symbiont is reported, and the host’s dependence is asserted from the literature, not shown. | Read |
| NOTE-1237 | Bernabeu, Manzano-Morales, Marcet-Houben & Gabaldón — Gene ancestries reveal diverse microbial associations during eukaryogenesis | A fresh reconstruction of the last eukaryotic common ancestor’s proteome from three 100-genome eukaryotic datasets, with each family’s origin read from its sister group in a maximum-likelihood tree. Under thresholds tuned to maximize assignments to Alphaproteobacteria and Asgard archaea, two further bacterial donors pass in every dataset, Myxococcota (3.92% of the proteome) and Planctomycetota (2.24%), comparable to Alphaproteobacteria (3.99%) and Asgard (3.28%). A control that removes Alphaproteobacteria from the database does not reproduce their pattern. About 4.5% of families have a viral sister, mostly giant viruses. Stem-length distributions place Asgard earliest and Planctomycetota before the mitochondrion and Myxococcota. The authors read this as waves of transfer from several partners and challenge two-partner models. They concede their data say nothing about whether any donor was a symbiont. | Read |
| NOTE-1238 | Imachi et al. — Isolation of an Asgard archaeon at the prokaryote–eukaryote interface | After 12 years from sampling to culture, an archaeon of the Asgard group, Ca. Prometheoarchaeum syntrophicum MK-D1, was obtained in stable co-culture with a methanogen (not alone, hence the Candidatus name). It is a small coccus, about 550 nm across, doubling in 14–25 days. It degrades amino acids only in syntrophy, handing off hydrogen and formate to partners that can be swapped. It has long, often branching membrane protrusions and no visible internal compartments. It is the closest cultured relative of eukaryotes, among cultured organisms only. From its genome and other Asgard genomes the authors propose that the Asgard ancestor was a partner-dependent amino-acid degrader. The entangle–engulf–endogenize model they build on it is a hypothesis that the authors call not definitive. | Read |
| NOTE-1239 | Santana-Molina, Williams, Snel & Spang — Chimeric origins and dynamic evolution of central carbon metabolism in eukaryotes | Sixty-four gene-family phylogenies for eukaryotic central carbon metabolism (glycolysis, the pentose phosphate pathway, pyruvate and acetate conversion, and the TCA cycle), set against a 317-marker eukaryotic species tree. LECA had essentially the whole pathway set. Its enzymes came from several sources: six putative Asgard contributions, mostly cytosolic glycolytic and pentose-phosphate enzymes (support between 39% and 97%, two cases ambiguous); seventeen alphaproteobacterial ones, mostly mitochondrial and ten of them in the TCA cycle; and others from various bacteria, with no third dominant donor. Since then, loss, horizontal replacement and retargeting have reshaped the pathways, and targeting no longer follows origin. The authors read the split, archaeal glycolysis in the cytosol and bacterial TCA in the mitochondrion, as support for syntrophy models. The split is what any archaeal-host, bacterial-endosymbiont model predicts, so it does not single syntrophy out. | Read |
| NOTE-1240 | Pittis & Gabaldón — Late acquisition of mitochondria by a chimaeric host | For 1,078 eukaryotic protein families inferred to be present in LECA, the length of the branch joining each family to its closest prokaryotic relatives, divided by the family’s median branch length within eukaryotes, is shortest for families of alphaproteobacterial origin and mitochondrial location, longer for other bacterial families (endomembrane-associated), and longest for archaeal families (nucleus and information processing). Read as time, that puts the mitochondrion last, into a host whose proteome was already chimaeric. The reading of length as time needs rates before and after LECA to be proportional, the alphaproteobacterial difference from other bacteria is marginal (P = 0.044), and stem length also falls when a closer relative is sampled, as the paper’s own Lokiarchaeota control shows. | Read |
| NOTE-1241 | Sørensen, Stiller, Kröninger & Nowack — Protein import into bacterial endosymbionts and evolving organelles | A review of the evidence that hosts import their own proteins into bacterial endosymbionts, which has long been taken to mark an organelle off from an endosymbiont. Import of hundreds of nucleus-encoded proteins is established, by proteomics of isolated endosymbionts, in two systems only: the chromatophore of Paulinella and the nitroplast of Braarudosphaera. In both, the imported proteins come mostly from the host’s own genes and from bacteria other than the endosymbiont, and the authors say that gene transfer from the endosymbiont “is not a precondition” for genetic integration. Elsewhere, in a trypanosomatid, a diatom and four insects, there are one to seven imported or targeted proteins per system, each found by antibodies or proteomics. The authors propose an order, effector proteins first and dependence on an imported redundant protein second, which they call plausible on limited data. The import mechanisms are almost entirely unknown. | Read |
| NOTE-1242 | Tobiasson, Luo, Wolf & Koonin — Dominant contribution of Asgard archaea to eukaryogenesis | A large phylogenomic survey that assigns each widespread eukaryotic protein family to its most likely prokaryotic sister by likelihood weights on constrained trees. In the 4,290 best-resolved families, Asgard archaea take about half of all likelihood weight and lead in nearly every functional system, information processing above all. Alphaproteobacteria contribute a small, coherent set centred on the mitochondrion (oxidative phosphorylation, Fe–S cluster assembly, mitochondrial translation). About a third of families point to other bacteria, scattered across functions with no pathway from one donor except a narrow Myxococcota signal, which the authors read as piecemeal gene transfer and not further symbioses. A stem-length analysis leads them to doubt that stem lengths time gene acquisition. They favour a complex Asgard ancestor that took up the mitochondrion late. The limiting caveat, theirs, is sparse and biased genome sampling. | Read |
| NOTE-1243 | Karnkowska et al. — The oxymonad genome displays canonical eukaryotic complexity without a mitochondrion | An inventory of the draft genome of Monocercomonoides exilis, an oxymonad gut commensal and the only well-studied eukaryote with no mitochondrion. Apart from the mitochondrion, peroxisomes and the machinery for degrading them, nothing in the cell looks reduced: about 75 Mb, 16,768 genes, 31,693 introns, and canonical systems for DNA replication and repair, transcription, the cytoskeleton, membrane trafficking and autophagy. It has kept more ancestral eukaryotic protein families than the parasitic metamonads. The only changes the authors tie to the loss are two preadaptations, the SUF system for Fe–S clusters, which all examined relatives share, and the loss of the glycine cleavage system and SHMT, plus the loss of mitophagy. No gene was found that compensates for the absence. The work is homology searches on a draft genome, with two cells imaged by FIB-SEM. | Read |
| NOTE-1244 | Supporters, Followers, Fans, and Flaneurs: A Taxonomy of Spectator Identities in Football | A conceptual taxonomy of how spectators identify with football clubs, on two axes: traditional–consumer (the basis of investment) and hot–cool (how central the club is to the self). Supporters are traditional and hot; followers traditional and cool; fans consumer and hot; flâneurs consumer and cool. Giulianotti argues that football’s “hypercommodification” since the late 1980s moves identification from the supporter towards the flâneur, while clubs still depend on supporters to make the spectacle flâneurs consume. Ideal types, with no data. | Read |
| NOTE-1245 | Preregistered Replication and Extension of “Moral Hypocrisy: Social Groups and the Flexibility of Virtue” | Two preregistered online experiments (Prolific, US). One used minimal groups (n = 590 analysed) and one used Democrats versus Republicans (n = 577). Neither replicated Valdesolo and DeSteno’s intergroup moral hypocrisy (the original N was 76 and d was 1.11); the minimal-group contrast is statistically equivalent to zero. In minimal groups, in-group favouritism appeared only as it rose with collective identification (interaction b = −.39); the in-group/out-group contrast was not significant (p = .07). Partisans judged an out-party member’s identical selfish act as less fair (p = .003). About a third of those free to choose took no advantage for themselves. | Read |
| NOTE-1246 | Cultural Trauma: Slavery and the Formation of African American Identity | The book’s first chapter, read alone. Cultural trauma is a loss of identity and meaning in a group, not an individual wound, and need not be felt by everyone in it. Slavery became the trauma of African Americans “in retrospect”: in the 1880s, when Reconstruction failed and white North and South reconciled around a memory of slavery as benign, a generation never enslaved made its memory the “primal scene” of a collective identity. Membership was set by “a common fate, not necessarily a common experience”, whether or not one’s ancestors were enslaved. Intellectuals and social movements carry the trauma; each social generation reworks it; it became national memory only with the civil rights movement. The chapter is a framework and a plan; the evidence is in chapters 2–6. | Read |
| NOTE-1247 | The epistemic challenge to longtermism | A model of the epistemic objection to longtermism. A $1 million existential-risk intervention changes the chance that civilization exists in 1000 years by a conservative 2 x 10^-14, and its effect lasts until an “exogenous nullifying event” arrives at a constant rate r, which acts as an exponential discount. Against a global-health benchmark of 10,000 QALYs, it wins if r is below about 0.000135 per year with interstellar settlement, or 0.000000012 per year on Earth alone. Small credences in settlement, low r, fast travel or star-sized value make it win by orders of magnitude, but then the win can rest on probabilities as small as 10^-18. So the case for longtermism depends on non-obvious empirical claims or on Pascalian fanaticism, and its horizon may be thousands or millions of years, not billions. | Read |
| NOTE-1248 | Persistent epigenetic differences associated with prenatal exposure to famine in humans | Sixty people conceived during the Dutch Hunger Winter of 1944–45 (daily rations averaging 667 kcal) had, about 58 years later, less methylation of the imprinted IGF2 gene’s DMR in blood than their unexposed same-sex siblings: 0.488 vs 0.515, −5.2%, 0.48 SD, P = 5.9 × 10⁻⁵, lower in the exposed sibling in 43 of 60 pairs. Sixty-two people exposed only late in gestation were born 296 g lighter but showed no difference, and the timing interaction was significant. Birth weight did not track methylation. The authors read it as the first evidence that a transient early-gestation exposure is recorded as a lasting epigenetic change in humans. The exposure is the person’s own; no later generation is studied. | Read |
| NOTE-1249 | Retention of Memory through Metamorphosis: Can a Moth Remember What It Learned As a Caterpillar? | Tobacco hornworm caterpillars trained to pair ethyl acetate with mild shock avoided it as fifth instars (78%, N = 41) and, four to five weeks and a metamorphosis later, as moths (77%, N = 27); 80% of tracked individuals chose the same way at both stages. Controls showed no effect. Washing trained pupae or scenting naive ones changed nothing, so residue on the pupal case does not explain the adult aversion. Third-instar training survived two larval molts but not metamorphosis. By analogy with Drosophila the authors place the memory in late-forming mushroom-body neurons that keep their projections through pupation, a hypothesis they did not test. | Read |
| NOTE-1250 | Trauma, prejudice, large-group identity and psychoanalysis | A memorial lecture at the Freud Museum. Large-group identity is a tent’s canvas worn over each person’s individual identity, fixed in childhood through what parents deposit and unchangeable after adolescence. In two decades of unofficial dialogues, Volkan saw participants who felt their large-group identity threatened turn, with emotion, to an injury their ancestors suffered centuries ago. The shared image of such an event, real or mythologized, changes function across generations and becomes an identity marker: a chosen trauma. It feeds entitlement to recover what was lost and, in a “time collapse”, makes the old event feel recent, as with Kosovo 1389 under Milošević. The Holocaust is not a chosen trauma: it is recent, its stories are alive, and it is mourned rather than kept as a wound for revenge. | Read |
| NOTE-1251 | Self-categorization and social identification: Making sense of us and them | A textbook account of the social identity perspective. Self-categorization is hierarchical (personal, social, human) and situational (salience = accessibility × fit, with comparative and normative fit), and leads to depersonalization. Social identification has seven components (Ashmore et al. 2004). Social identity theory explains minimal-group bias by positive distinctiveness. Multiple-categorization models predict when bias falls. Unlike Hornsey 2008, it says the self-esteem hypothesis “has received extensive empirical support”. | Read |
| NOTE-1252 | A Perfect Moral Storm: Climate Change, Intergenerational Ethics and the Problem of Moral Corruption | Climate change is a “perfect moral storm” in which three storms converge. The global storm is a tragedy of the commons between states. The intergenerational storm is worse: carbon dioxide stays in the air for centuries, 17–33% of it for a thousand years by the estimate quoted, so the benefits of emitting go to the present and the costs to later generations. Every generation then has reason to overpollute, and since generations do not coexist, no institution or reciprocity can stop it. The theoretical storm is that our theories cope badly with such cases. Together they make moral corruption easy: each generation can seem to take the problem seriously while exploiting its position in time, and need not admit it, “either to others, or, perhaps more importantly, to itself”. | Read |
| NOTE-1253 | Social Identity Theory and Self-categorization Theory: A Historical Review | A short critical history of the social identity approach. Social identity theory (Tajfel & Turner 1979) is about intergroup relations: positive distinctiveness and the socio-structural variables of status, permeability, stability and legitimacy. Self-categorization theory (Turner et al. 1987) is about categorization at levels of inclusiveness, salience by accessibility and fit, and depersonalization. It records two dead ends (identification predicting bias, and the self-esteem hypothesis) and a later softening of the “functional antagonism” between personal and social identity. Hornsey lists the criticisms and declines to answer them. | Read |
| NOTE-1254 | Transgenerational Epigenetic Inheritance: Myths and Mechanisms | A review. In plants and C. elegans, epigenetic states pass through many generations, carried by small RNA, DNA methylation and histone H3K9 methylation, mostly at transposons and transgenes. In mammals, two rounds of reprogramming, in the germline and the early embryo, erase most marks; the few bona fide epialleles are at retrotransposons. An exposed pregnant female’s effects count as transgenerational only in F3, an exposed male’s only in F2. Environmentally induced changes are rarely inherited and more rarely adaptive. Human nutritional evidence is intergenerational and confounded: “so far there is little support”. Human culture, the authors say with Gould, is the inheritance that is Lamarckian. | Read |
| NOTE-1255 | Intergenerational transmission of paternal trauma among US Civil War ex-POWs | Children of Union Army veterans born after the Civil War and surviving to 45 (19,903 children of 6,367 fathers). Sons of men held in Confederate camps when prisoner exchanges had stopped and conditions were worst had a mortality hazard 1.11 times that of non-POWs’ sons (P = 0.009); exchange-period POWs’ sons and all daughters were unaffected. Within families, sons born after the war died at 2.23 times the rate of brothers born before it (P = 0.056). The effect was 1.20 among sons born in the second quarter and nil in the fourth, read as maternal nutrition reversing it. Socioeconomic and maternal controls left it unchanged. By elimination the authors favour an epigenetic route but cannot reject psychological or cultural ones. | Read |
| NOTE-1256 | Identity fusion: The interplay of personal and social identities in extreme group behavior | Five preliminary studies and three two-wave experiments with Spanish students. A single pictorial item, the self as a small circle wholly inside a circle for Spain, picks out the “fused” (about 40%). Fusion is bimodal, related to but distinct from identification (r = .26 to .56) and specific to one group. The fused said they would fight and die for Spain more than others would. Activating their personal self, by challenging negative self-views or asking what they would fight for themselves, raised that willingness further; it did nothing for the nonfused. The authors read this as personal and social identity being “functionally equivalent” in the fused, against self-categorization theory’s functional antagonism. | Read |
| NOTE-1257 | Surviving Death, Again | Johnston withdraws Surviving Death’s account of survival. There, he recalls, the resurrection hope failed and the substitute was living on “in the onward rush of humankind”, on the view that we are higher-order things whose deepest future-directed attitudes fix which embodiments are ours. Now he holds that every reductionist account of personal identity breeds “fellow travelers” with moral status and conflicting interests: personites, R-variants, overlapping “Theons” and modal variants. To avoid them, he holds, we must be essentially embodied wills whose present bodies are not essential, so re-embodiment after death is possible. He argues that emergent substance dualism is a “fig leaf” for divine creation, and gives non-reductive relations of subserving, implementing and interdependence between mental and neural events. | Read |
| NOTE-1258 | The stability of memories during brain remodeling: A perspective | A perspective, typed an addendum, with no new data. Learned behaviour is reported to survive brain remodelling in metamorphosing insects (odour-shock aversions in Drosophila and Manduca), regenerating planaria (McConnell’s 1960s savings and the authors’ 2013 place learning) and hibernating squirrels and marmots (hippocampal dendrites pruned in torpor, operant memory kept after six months). The authors argue that synaptic plasticity alone cannot explain lasting memory, posit a non-synaptic “blueprint”, and propose that a planarian’s memory may be stored outside the brain and imprinted on the new one, perhaps through neoblasts or bioelectric networks. The insect mechanism is called unknown; the planarian one untested. | Read |
| NOTE-1259 | Future self-continuity: how conceptions of the future self transform intertemporal choice | A review, mostly of the author’s own work. Following Parfit, people who feel less connected to their future self treat it like a stranger and save less for it. Similarity to one’s self in ten years, chosen as overlapping circles adapted from Aron’s scale, predicted patient choices and assets; a future self represented neurally like another person predicted steeper discounting (r = .47); seeing one’s age-progressed face raised saving; respect for the elderly tracked and raised saving. Directly reported liking and caring for the future self did not predict choice, but were near ceiling. The future self may extend, at life’s end, to one’s offspring. | Read |
| NOTE-1260 | Psychometric validation of the Loyola Generativity Scale in Chilean teachers: evidence for a three factor structure | 430 Chilean elementary teachers completed a Spanish Loyola Generativity Scale, McAdams and de St. Aubin’s 20 items on a 4-point scale. Four items were dropped for poor sampling adequacy. Of one- to four-factor solutions, three factors were retained (RMSEA = 0.043, CFI = 0.989, 55.1% of variance); four fit slightly better but were judged over-extracted. Its factors: Generative Inefficacy, three negatively worded items; Generative Action, eight items; and Generative Legacy, three items on symbolic continuity. Action and Legacy correlate .45. The authors call the analysis confirmatory, but it chooses the number of factors from the data. Only 14 of the 16 retained items appear in the final solution, without comment. | Read |
| NOTE-1261 | Generativity as a Route to Active Ageing | Two Heidelberg gerontologists read generativity, Erikson’s “concern in establishing and guiding the next generation”, as the psychological form of an ethical “joint responsibility” that lasts into very old age. They follow McAdams: generativity is driven by cultural demand and an inner desire, which is a need to be needed and a need for symbolic immortality, “to invest resources and potentials into things that outlive the self”. It is not altruism, and its motives can be selfish or altruistic. In 3,308 older adults in Mexico, Spain and Germany, generativity predicted optimism and life satisfaction. An intervention of intergenerational projects in Belarus, Russia and Ukraine raised generativity scores in old and young. No statistics are given. | Read |
| NOTE-1262 | Group-level self-definition and self-investment: A hierarchical (multicomponent) model of in-group identification | Seven studies with Dutch students. Identification has five components on two correlated dimensions (r = .61 to .77): self-definition (self-stereotyping, in-group homogeneity) and self-investment (solidarity, satisfaction, centrality). The model fit Dutch, European and university identification better than one-factor or cognitive-versus-affective models. Weeks to months later, the components predicted different reactions. Shown their group’s mistreatment of Rwandan asylum seekers, those who saw themselves as like the average European felt more guilt, while those satisfied with being European, and for whom it was central, legitimized the policy. The self-circle overlap measure correlated with self-investment as much as with self-stereotyping. | Read |
| NOTE-1263 | Future People, the Non-Identity Problem, and Person-Affecting Principles | Most of our choices change who will exist, so a policy that makes later lives much worse may be worse for no one who ever lives. Narrow person-affecting principles then imply that such a policy, or ending human history by having no children, is not wrong. Parfit rejects them, and retracts his own 1984 appeal to an impersonal principle. Being caused to exist with a life worth living is an intrinsic “existential benefit”. On the Wide Principle an outcome is worse if it benefits people less, which solves the non-identity problem in person-affecting terms and keeps “better than” transitive. A Wide Dual Principle, counting benefits to each and benefits to all, does not imply the Repugnant Conclusion. We may favour present people in what we do, but if every generation does, “we and our successors might together wreck the Earth”. | Read |
| NOTE-1264 | Transgenerational epigenetic inheritance: a critical perspective | A Perspective. Transgenerational epigenetic inheritance needs the environment to instruct the epigenome and the marks to reach the next generation; in mammals both are weak. Marks follow transcription factors; DNA methylation is stripped from gametes and early embryos; no validated mechanism links environment to epigenome, and organisms actively erase marks. The Agouti diet effect did not replicate, rodent effects fade or fail to replicate, and the one robust paternal effect seems not to go through sperm epigenetics. The Swedish famine study ignored cultural transmission and failed to replicate in a larger cohort; the Holocaust study had 32 people. The article does not separate inter- from transgenerational effects. | Read |
| NOTE-1265 | A critical view on transgenerational epigenetic inheritance in humans | A Comment. In mammals, germline epigenetic inheritance must cross the Weismann barrier and two waves of reprogramming, and human studies are confounded by genetic, ecological and cultural inheritance. The Dutch Hunger Winter shows fetal programming, not germline transmission; grandparental food-supply and Prader–Willi findings await replication; familial epimutations are usually secondary to a nearby mutation. A roadmap: exclude the other inheritances (F3 after an exposed pregnant female, F2 after an exposed male), find the factor in pure germ cells, show it causes the effect. In humans only genetic effects can be excluded. Cultural transmission “very likely” outweighs any epigenetic inheritance; the author remains sceptical. | Read |
| NOTE-1266 | Being one of us. Group identification, joint actions, and collective intentionality | ”Group identification”, as philosophers of shared agency use it (Pacherie, Petersson), runs together two separable processes. One is adopting the group’s perspective, asking “what should we do?”. The other is self-transformation, coming to understand oneself as a member. The first can occur without the second (the discursive dilemma) and the second without the first (toddlers’ joint action before age three). Self-transformation is not a belief but a Pushmi-Pullyu representation: “you are a member of us; act as such”, at once describing and motivating, triggered by cues such as joint attention, and not under direct rational control. A conceptual paper. | Read |
| NOTE-1267 | Population ethical intuitions | Nine experiments with US online samples. People require more happiness than suffering for a population to be better existing than not (about 75% happy; about 61% when the two are stated to be equally intense). Yet they judge adding one extremely happy person as good as adding one extremely unhappy person is bad: they reject the intuition of neutrality and the procreation asymmetry. With averages fixed they prefer larger happy and smaller unhappy populations, but the preference for more happy people fades and, at a billion against ten billion, reverses. With totals fixed they prefer higher averages. In conflicts averagism tends to win, to the point of preferring to add near-maximally unhappy people who raise the average. Prompts to reflect move judgements toward totalism. | Read |
| NOTE-1268 | Social Influence and Group Identity | A review of the group-identity account of social influence, grounded in self-categorization theory. Influence from a group need not be compliance for approval: when the group is a level of the self, in-group sources produce private acceptance, so influence is “partly self-influence”. Classic conformity, obedience, minority-influence, emergency, helping and contagion findings are reread as bounded by shared identity. Identification, prototypicality, intergroup threat and context moderate the effect. Isolation and anonymity strengthen group influence, and crowd members switch to a group identity rather than losing the self. The evidence is reported, not presented. | Read |
| NOTE-1269 | Shaping Humanity’s Longterm Trajectory | Humanity’s value per unit time is a curve, the future’s value the area under it, and an intervention’s value the area between two curves. Value must be summable and separable across time, and there is no pure time preference. Four idealised changes have values independent of the curve’s shape. An advancement is worth about (v_τ − v_0)δt, which does not grow with the future’s duration, and is negative if the end comes sooner too. A speed-up scales with (v_τ − v̄)τ, a gain with τ, an enhancement with v̄τ. Raising near-term survival by a factor γ_p is worth (γ_p − 1)v̄τ, like an enhancement, and is more surely contingent. So advancing progress rarely rivals existential risk reduction: on a million-year future a year’s advancement equals a one-in-a-million gain in survival. | Read |
| NOTE-1270 | The Psychology of Existential Risk: Moral Judgments about Human Extinction | Parfit’s three outcomes, put to laypeople: no catastrophe, 80% of humanity killed, 100% killed. Most judge extinction bad and to be prevented (78% on a binary item), but of those who rank the outcomes as expected only 23% (UK), 19% (US) and 37% (Oxford students) judge the step from 80% to 100% the greater. More do when the victims are zebras (44%, 35%), when the catastrophe sterilizes rather than kills (47%, 29%), or when reminded that only extinction ends humanity’s future (50%, 39%). A majority do only when the surviving future is described as long and utopian (77%, 67%, 77%). Existential-risk mitigators do so unprompted (86%). The authors read this as a focus on immediate harm to fellow humans and neglect of the long term. | Read |
| NOTE-1271 | Managing the Terror of Publication Bias: A Systematic Review of the Mortality Salience Hypothesis | Re-runs Burke et al.’s meta-analysis of the mortality-salience hypothesis on a decade more data, with five tools for bias. Uncorrected, 635 effects give g = 0.81 (about r = .37), close to Burke et al.’s r = .35. Selection models (g = 0.36) and WAAP-WLS (g = 0.39) put the average near r = .18; PET-PEESE finds no positive effect. A p-curve of 825 focal tests finds evidential value at 25% average power; z-curve puts the expected replication rate at 19% and the expected discovery rate at 8%. Five of nine preregistered replications succeeded. True effects are so heterogeneous that 95% of them span r = −.47 to .66. The authors conclude some MS effects are real, the average is about half the published one, and most studies could not detect it. | Read |
| NOTE-1272 | The Oral History of ‘I’m the Juggernaut, Bitch!’ | Journalism. Xavier Nazario and Randy Hayes redubbed a 1990s X-Men episode in November 2005 and posted it on 14 February 2006. Within months it had millions of views. A TV news segment, before the film’s release, reported the line “making it into the new X-Men movie”. The film says “I’m the Juggernaut, bitch!” Kinberg, via Polygon: “That was a reshoot Ratner line.” That Ratner was “likely a fan” of the video is Siegel’s inference, not testimony. The videos were later taken down amid Viacom’s takedowns, and the creators were never paid. | Read |
| NOTE-1273 | Leaving a Legacy: Intergenerational Allocations of Benefits and Burdens | Six experiments on intergenerational allocation. Framing a climate decision as leaving burdens rather than using up benefits raised concern with one’s legacy, felt responsibility and affinity toward future generations, ethical concern and moral emotions. In allocation tasks people favoured themselves more with benefits than with burdens, but only when the other person would receive the resource in the future, and only when they themselves were a party to the trade-off. Perceived ethical considerations accounted for the first condition. The authors read this as legacy concern, the wish to extend the self beyond death. Legacy concern was measured only in the attitude studies, never alongside an allocation. | Read |
| NOTE-1274 | Empirical Approaches to Altruism | A survey by Doris, Stich, Walmsley and Schulz. Under the standard account, altruism means an ultimate desire for another’s well-being, and evolutionary and social-science senses of the word do not bear on it. Batson’s experiments tell against the social-punishment and aversive-arousal versions of egoism. Self-other merging would make helping egoistic only if the helper took herself to be numerically identical with the other. The four measures used in the 1997 exchange test likeness or something unclear, not identity. On the causal question, the entry says only that Batson et al. corrected Cialdini’s methods and found empathy’s role “clearly evident”. Altruism is still unproven: divine punishment, principles, norms and habit remain open explanations. | Read |
| NOTE-1275 | Culture and the self: Implications for cognition, emotion, and motivation | A theoretical review. Cultures construe the self as independent, bounded and defined by inner attributes (most clearly American), or as interdependent, defined by relationships with specific others in specific contexts (Japanese and other Asian, also African, Latin American, Hindu, southern European). For the interdependent self “others are included within the boundaries of the self”, without “a merging of self and other”. This is predicted to shape cognition (more knowledge of others, contextual self-description), emotion (other-focused over ego-focused emotions) and motivation (achievement for others, modesty over self-enhancement). The authors name “a self defined in relationship to others” as an alternative to both selfishness and selflessness. | Read |
| NOTE-1276 | Pair-Bonding as Inclusion of Other in the Self: A Literature Review | A short review by Aron’s group. In a close relationship each partner experiences the other’s resources, perspectives and identities as to some extent their own (Aron et al. 1991). The single-item IOS circle scale is the standard measure, validated as subjective closeness. It goes with cognitive signs of inclusion: slower “me/not-me” judgements on traits where the partner differs, more self–partner confusions in memory, plural pronouns. Recent studies tie overlap to self-like treatment of a partner. High-overlap people keep a positive view of a partner shown inferior. Their sleep suffers more from a partner’s pain. Honour-endorsing men high in overlap are more aggressive toward a partner’s moral violation. The review adds a two-dimensional model of relational self-change and a measure of perceived inclusion. No new data. | Read |
| NOTE-1277 | Empathy, Altruism, and Group Identification | Cialdini et al. said empathy-induced helping is due to self-other merging. May argued that no reading of “merging” is both coherent and explanatory. The authors read it as group identification. In empathizing with Y, X comes to conceive of Y as part of X’s social self, so Y’s welfare is constitutive of X’s first-person plural welfare. This explains Batson’s similarity-induced helping in the same way as minimal-group favouritism, and needs no belief in being two bodies, since identification is a Pushmi-Pullyu representation (Salice and Miyazono). Such helping is altruistic at the individual level and egoistic at the group level. The empirical rebuttal by Batson et al. (1997) is set aside as out of scope. | Read |
| NOTE-1278 | Social Identity Theory’s Self-Esteem Hypothesis: A Review and Some Suggestions for Clarification | A qualitative review of over 40 studies of social identity theory’s self-esteem hypothesis: discrimination raises self-esteem (corollary 1) and low self-esteem motivates discrimination (corollary 2). The theory implies specific social state self-esteem, esteem for this group, now; most studies measured global personal trait self-esteem. Counting experiments, corollary 1 has 18 for and 13 against, corollary 2 has 7 for and 28 against, and one of eight full tests supports both. Nine studies find high personal self-esteem goes with the most discrimination. Discrimination seems to raise self-esteem without being motivated by a need for it, so the hypothesis fails “in its full and unqualified form”. The authors propose a narrower version in specific social state self-esteem. | Read |
| NOTE-1279 | Activating the legacy motive mitigates intergenerational discounting in the climate game | A climate collective-risk game with 30 groups of six. When saving the group’s endowments paid the players the next day, 9 of 10 groups reached the target; when it paid for trees for future generations, 2 of 10 did; with three messages added to activate the legacy motive (death awareness, the powerlessness of future generations, and paying forward a past generation’s sacrifice), 7 of 10 did. Each message raised investment. The messages restored a fair-share norm rather than extra giving. No manipulation checks and no control message, so which mechanism worked is unknown. The authors call the legacy motive a way of leveraging self-interest. | Read |
| NOTE-1280 | Group Identity, Social Influence, and Collective Action Online: Extensions and Applications of the SIDE Model | The SIDE model as its authors state it. Deindividuation theory’s account, in which anonymity and immersion cut self-awareness and release antinormative behaviour, is rejected. Anonymity within a group makes the salient identity more salient. With a group identity salient, people conform more to its local norms. With personal identity salient, they move away from the group norm. Depersonalization is “the emergence of group in the self”, not a loss of self. A strategic dimension adds that anonymity to a powerful out-group frees in-group-normative behaviour it would punish. The model is extended to visible media, online communities and collective action. The evidence is reported, not presented. | Read |
| NOTE-1281 | Parental olfactory experience influences behavior and neural structure in subsequent generations | Male mice fear-conditioned to acetophenone or propanol before mating had sons and grandsons, never exposed to either odour, who startled more to, and detected at lower concentrations, the odour their grandfather or father had learned, and not the other. Sons and grandsons of acetophenone-trained males had more olfactory neurons carrying its receptor (M71, gene Olfr151) and larger M71 glomeruli; the anatomy, not tested behaviourally, held in IVF offspring carried by surrogates. Mothers conditioned before mating gave the same results, which survived cross-fostering. Olfr151 was less methylated in F0 and F1 sperm (n = 12 vs 10; 4 vs 4), not in the olfactory epithelium. The authors call it inherited sensitivity to a salient cue, not inherited fear. | Read |
| NOTE-1282 | Evolution, altruism and cognitive architecture: a critique of Sober and Wilson’s argument for psychological altruism | Sober and Wilson argue, from parental care, that natural selection would favour an ultimate desire for the child’s welfare over hedonism, on grounds of reliability. Stich grants that evolutionary and psychological altruism are independent. He rejects their arguments from imperfect belief–affect correlation, from the engineering cost of strong affect, and from redundancy. He takes seriously the fourth: hedonism depends on beliefs linking helping to one’s own feelings, and beliefs can be undermined. But if those links are sticky sub-doxastic states, hedonism is as reliable as altruism, so the argument leaves egoism open. | Read |
| NOTE-1284 | Self and Collective: Cognition and Social Context | Self-categorization theory’s statement on the self. Personal and social identity are levels of self-categorization, equally authentic. Which category is used, and with what content and prototype, is set by perceiver readiness and fit (metacontrast and normative fit), and so varies lawfully with the comparative frame of reference. The authors go on to speculate that the self is not a stored structure at all but is generated each time. A theoretical paper; the evidence is the group’s own studies, reported and not presented. | Read |
| NOTE-1285 | Group-level emotions | A review of intergroup emotions theory by its founders. Identifying with a group makes it “an aspect of the self through self-categorization”, so events are appraised for what they mean to the group, and emotions are felt on its behalf. Four facts: the emotion shifts with the salient membership; members converge on a group norm; no personal involvement is needed; and identification moderates the effect, the highly identified sometimes reappraising to avoid guilt. Group-based emotions predict collective action and treatment of out-groups and the in-group, and can be regulated. No new data. | Read |
| NOTE-1286 | Recategorization and Prosocial Behavior: Common In-Group Identity and a Dual Identity | The common in-group identity model’s authors on helping. Recategorizing two groups as one removed in-group bias in helping in a laboratory study (posters for an out-group member rose to the in-group level), and at a stadium White fans complied with a Black interviewer more when he wore their university’s hat (59% vs 36%). A dual identity is another matter: White students volunteered least for a Black student who called himself a Black Colgate student, as little as for one who called himself Black, and most when he called himself a Colgate student. Empathic concern partly mediated the effect on helping (β for condition .46 to .35); attitudes did not. Sample sizes are not reported. | Read |
| NOTE-1287 | A Mathematical Theory of Saving | How much should a nation save? For a community that lives for ever, with fixed numbers, tastes and motives, and that does not discount later enjoyments (“ethically indefensible”, from “the weakness of the imagination”), saving times the marginal utility of consumption must equal the shortfall of present net enjoyment from Bliss, the maximum obtainable. The rule does not depend on the interest rate, and asks much more saving than usual: £300 out of £500 on an illustrative scale. A constant discount rate below the interest rate gives the same rule for a “modified utility”; one above it runs consumption down to subsistence. The paper then takes discounting as a fact of saving. People care less for heirs than for themselves, and families with different rates end divided between bliss and subsistence. | Read |
| NOTE-1288 | Team Reasoning and Intentional Cooperation for Mutual Benefit | Theories of social preference can always fit an observed choice by positing a preference for it, and their non-trivial forms cannot represent trust: on Rabin’s intention-based preferences, (send, return) in a Trust Game cannot be common knowledge in equilibrium. Team reasoning can, but Bacharach’s version maximizes a team utility that trades members off and needs no assurance. Sugden’s Schema of Cooperative Team Reasoning aims at a mutually beneficial practice, in which each member gains over her maximin payoff, and binds only when there is reciprocal reason to believe the others endorse it. A market exchange in each party’s interest can then be intended as cooperation for mutual benefit. | Read |
| NOTE-1289 | Second-Person Engagement, Self-Alienation, and Group-Identification | A reconstruction and defence of Husserl’s empathy-based account of the “we”. Truly social acts need an I–Thou relation of reciprocal, communicative address, beyond even reciprocal empathy. In it I am aware of myself as addressed, and by taking over the other’s perspective on me (“self-alienation”) the self–other difference stays present but is “somewhat downplayed”. That is a formal, necessary but not sufficient, condition of seeing oneself as one of us. “A we, a first-person plural, is not an enlarged I.” Zahavi likens it to self-categorization theory’s self-stereotyping, replies to Heidegger and Schmid that the “we” can be analysed and that self-awareness precedes in-group bias, and concedes that the face-to-face “we” does not cover anonymous ones. | Read |
| NOTE-1290 | Social Identity and Close Relationships: What is the Connection? | Close relationships and group memberships are two forms of social identification, “processes by which the individual self is extended to include others”: the relational self personalized, the collective self depersonalized. They are distinct systems, not two routes to one need for belonging. Group and interpersonal attachment correlate only .46 (anxiety) and .33 (avoidance), and loneliness has relational and collective factors. Each level regulates opposed needs, as hunger and thirst do, with transfer between them. Relational collectivists bound their in-groups tightly; individualists identify more with large, inclusive groups and show as much in-group favouritism toward them. | Read |
| NOTE-1291 | Surviving Early Childhood Trauma: Effects of the Holocaust on Survivors’ Psychological and Physiological Well-Being | Four studies of one registry-drawn Israeli sample: 32 female child survivors who lost both parents, 33 matched women who left Europe with their parents before the war, and 79 daughters. Survivors, now about 77, reported more dissociation and less life satisfaction, scored lower on cognition, and had higher diurnal cortisol and an anomalous response to a laboratory stressor, the last two only in ADRA2B wildtype carriers in an exploratory analysis. Daughters did not differ on any psychological, cognitive, health or cortisol measure. Only an exploratory split found lower cortisol in daughters of more dissociative survivors. The thesis restates its promotors’ meta-analyses: no secondary or tertiary traumatization in non-clinical samples with adequate designs. | Read |
| NOTE-1292 | The Psychology of Rivalry: A Relationally Dependent Analysis of Competition | Rivalry is a subjective competitive relationship that raises the psychological stakes of competing with a particular opponent, holding objective stakes fixed. In student sportswriters’ ratings of 71 NCAA men’s basketball teams, validated by players and coaches (r = .89), half the variance (50.4%) was the particular pair of teams, not either team. Rivalry rose with proximity, status similarity, games played and, most of all, a history of even results, and history mattered more than recent form. Rivalry was largely reciprocated (r = .85 net of team effects); where it was not, lower-status teams felt it toward higher-status ones. Rival games drew bigger crowds and slightly better defence. | Read |
| NOTE-1293 | Responsibility to Future Generations: A Moral Reframing Strategy for Combatting Climate Change | Felt responsibility to future generations is held by most people in 33 of 34 European countries and is nearly unrelated to ideology, age and gender. In US samples it is endorsed more than responsibility to cut one’s own climate contribution, is half as tied to conservatism (r = −.21 against −.45), and predicts self-reported proenvironmentalism. A preregistered experiment (N = 3,175) found five brief interventions each raised it a little; a letter to a person born today did most, a longtermist text least, and reflecting on past generations’ sacrifices raised it without raising responsibility for climate. Nothing measures how far the self extends, and responsibility is not separated from caring. | Read |
| NOTE-1294 | Death | The SEP survey of death. Life is the capacity of an object’s parts to control what composes it; death is the loss of that capacity. Epicurus’s case that death is nothing to us needs intrinsic hedonism and a narrow view of extrinsic harm. Without them, death can harm by depriving one of goods one would have had. When it harms is disputed. On Pitcher’s priorism a death, or a posthumous event, can thwart desires one has while alive, and so harm one then, without backward causation. Critics answer that desires one no longer has cannot be thwarted. Luper argues that immortality need not be tedious, and that giving up desires death could thwart would cost as much as it saves. | Read |
| NOTE-1295 | Reconceptualizing Individuals, Categories, and the Social Group: Self-Categorization Theory 2.0 | An insider’s critique and reconstruction of self-categorization theory. Categorization into equivalence classes yields interchangeable members, not a group entity. Meta-contrast, taken as the mechanism of entity formation, is intractable (2ⁿ subsets: 9.3 hours for 25 people at 1,000 operations a second). Its prototype semantics fails compositionality. The proposed SCT2.0: self-categorization is the categorization of intentional agents; groups are holistic entities triggered by cues to collective intentionality; and relations are propositional, in a language of thought. A theoretical paper; its own evidence is under review. | Read |
| NOTE-1296 | Inter- and transgenerational inheritance of behavioral phenotypes | A review from Mansuy’s laboratory. In rodents, parental trauma, stress, drugs of abuse and in-utero insults pass behavioural phenotypes to offspring, in the MSUS model “up to the third or even the fourth generation”; paternal environmental enrichment passes benefits and can prevent trauma’s transmission. IVF and sperm-RNA injection show germline dependence, and non-coding RNAs are the best candidate carriers. Human descendants of genocide survivors show more psychopathology; the review’s own table calls these intergenerational. How a stimulus reaches the germline, and how effects pass beyond the first generation, “remains unknown”. Germline reprogramming is not mentioned. | Read |
| NOTE-1297 | I Belong, therefore, I Exist: Ingroup Identification, Ingroup Entitativity, and Ingroup Bias | One experiment, 48 Italian students. Writing about one’s own death, against writing about reading a book, raised identification with Italians, perceived entitativity of Italians and in-group bias against Germans; the bias came entirely from rating Italians higher. Identification and entitativity are distinct (r = .59) and each mediated the effect on bias, through their shared variance; the Sobel tests were marginal. The authors propose that a group seen as a real entity lets people project themselves beyond their death, so that even dying for it can serve the self, but they do not separate this from terror management’s worldview defence. | Read |
| NOTE-1298 | The Afterlife (Tanner Lectures I and II) | Scheffler’s 2012 Tanner Lectures. “The afterlife” is the survival of other people after one’s death. Few would be indifferent to the earth’s destruction thirty days after their death, or weigh its goods against its evils. Many projects would lose their point, and in an infertile world, where no one dies early but no one more is born, even enjoyments might. Humanity’s survival matters to us in its own right and as a condition of other things mattering. In that respect it matters more than our own survival or our loved ones’. Scheffler reads this as our dependence on future people, not altruism toward them, and as showing that individual valuing presupposes humanity as an ongoing project. | Read |
| NOTE-1299 | Belonging to a community of European fans? European common in-group identity formation through football fandom | A quota-sampled online survey of football fans in Germany, Spain, Poland and Norway (n = 3,685 analysed). Fans identify with fan communities at three levels, club (mean 6.13/10), nation (5.57) and Europe (5.29). In a two-factor solution the European item loads on its own factor. In OLS, European fan-community identification goes with trust in European fans (b = 0.34), foreign-league viewing, positive views of fans, attachment to Europe, youth and education. It is not associated with critiques of football governance. Cross-sectional; the dependent variable is one item. | Read |
| NOTE-1300 | The Significance, Persistence, Contingency Framework | The value an event E contributes through a feature F of the world is significance × persistence × contingency: value per unit of the time E adds (ΔV/ΔT), how long F lasts (T), and the share of that duration due to E (ΔT/T). Under uncertainty the factors are taken ex ante (ΔEV/ΔET, ET, ΔET/ET), which keeps the product but is not the product of expected factors. An alternative takes significance as V/T and makes contingency the sum of the semi-elasticities of significance, persistence and the probability that F exists. The result estimates the “importance” factor of the ITN framework. It is an accounting device that assumes expected-value maximisation; it says nothing about who is moved by the value it counts. | Read |
| NOTE-1301 | The Minimal Group Paradigm and its maximal impact in research on social categorization | A brief review of the minimal group paradigm. Groups are novel, arbitrary and anonymous, and allocations serve no personal interest. Tajfel’s first studies found fairness strong but in-group favouritism reliable, and maximizing the in-group’s relative advantage sometimes beat maximizing its gain. It replicated with revised matrices. It is criticized as reciprocity, as projection of the positive personal self onto the new group, and as limited to positive resources. When participants could also pay themselves, they kept the most for themselves and still favoured the in-group with the rest. The paradigm now serves mostly to study other effects of mere categorization. | Read |
| NOTE-1302 | The Case for Strong Longtermism | Axiological strong longtermism: in the most important decisions facing agents today, every near-best option is near-best for the far future and delivers much larger benefits there than in the near future. The case runs through a benefit ratio. Bednets save 0.025 lives per 100 in expectation; AI safety beats bednets even on an Earth-only 10^14. A stakes-sensitivity argument carries this to what one ought to do. Discounting would defeat it: a zero pure rate of time preference is “near-essential”. Fanaticism is the weakest point the authors admit. They give an impersonal good as the ground and say nothing about motivation. | Read |
| NOTE-1303 | Enemies with benefits: the dual role of rivalry in shaping sports fans’ identity | Stadium-intercept survey at eight Bundesliga clubs in December 2014 (N = 571 after 164 fans with no named archrival were dropped); SEM. Perceived rivalry intensity lowers fans’ sense of being respected by the rival’s fans (β = −.31). It raises perceived distinctiveness (.27), cohesion (.20) and respect from other clubs’ fans (.09). These positive effects run indirectly, almost entirely through perceived reciprocity of the rivalry (indirect .18–.20), and barely through disidentification with the rival. For respect from other fans the direct path is negative (−.08, ns). Cross-sectional, with a single-item predictor. | Read |
| NOTE-1304 | Intergenerational Justice | The entry argues as well as surveys. Future people’s existence, number and identity depend on our choices, so harm understood as making someone worse off than they were, or would otherwise have been, cannot reach them: the non-identity problem. A threshold notion of harm can: we harm someone by causing her to exist, or to be, below a normatively set level. Read as sufficientarian, in basic needs or capabilities, this grounds future people’s rights, and Rawls’s just savings principle is one version of it. Being weakly person-affecting, it owes merely possible people nothing, and gives no reason to prefer a flourishing future to none. Meyer fills that gap with concerns that are not rights: Scheffler’s afterlife conjecture, and a duty owed to present and past people not to destroy what future-oriented projects depend on. | Read |
| NOTE-1305 | Witnessing and cultural trauma: the role of flashbulb memories in the trauma process | An essay, with no new data, that adds a carrier group to Alexander’s trauma process: ordinary members of a community who learned of an event at a distance. Their flashbulb memories, of where they were when they heard, let them say “I was there” and testify to what it was like. Such memories are specific to the affected community and can mark membership in it; where nearly everyone has one, speaker and audience coincide and the process starts democratically. They are inaccurate in detail but held with high confidence, and that shared confidence makes the witness “authentic”. They pass to children: in Meyler et al. (2020), 89% of children nine or younger at 9/11 could report a parent’s flashbulb memory, and stronger identification as American went with knowing it better. | Read |
| NOTE-1306 | Review of Samuel Scheffler, Death and the Afterlife | Cottingham reviews Scheffler’s book: two 2012 Tanner Lectures and a third paper given at Chicago the year before, four commentaries and replies. He reports the afterlife conjecture and its upshot, that in one respect our own survival matters less to us than humanity’s. The third lecture argues that a life must be bounded, so immortality is no remedy, while confidence in our values needs others to live on. Frankfurt doubts the concern is altruistic; Wolf holds we could and should “snap out of it” and go on. Cottingham regrets that religious reflection on finitude is left out. | Read |
| NOTE-1307 | Multigenerational legacies of trauma: Modeling the what and how of transmission | 422 adult children of Holocaust survivors, recruited on the web through survivor and Jewish organizations, rated their parents’ post-war styles, their own “reparative adaptational impacts” and their family’s history. In a path model, parents’ wartime experiences, chiefly internment, were linked to the children only through the parents’ victim style (stuck in the loss, overprotective, volatile), with indirect effects of .05 to .06. Post-war family milieu weighed more: living in Israel, surviving grandparents, larger families and religious continuity went with milder impacts. Broken generational linkages, rarely thinking of one’s murdered grandparents as one’s own, had the largest total effect (.21) and the only direct one. There was no comparison group, and the child reported every measure. | Read |
| NOTE-1308 | High Risk, Low Reward: A Challenge to the Astronomical Value of Existential Risk Mitigation | On Ord’s simple model, with constant per-century risk r and constant value v per century, cutting this century’s risk by a fraction f is worth fv, whatever r is: halving 20% risk is worth the same as halving 2%. Absolute cuts are worth fv/r, linear and quadratic value growth give fv/r and fv(2 - r)/r^2, and cutting risk in every century gives (f/(1 - f))(v/r). In each, higher risk lowers the value of mitigation. At 20% risk a 10% cut is worth 0.5v to 4.5v. Astronomical value returns only if risk falls soon and stays very low (a time of perils of two centuries and 0.01% afterwards gives 160v). Thorstad finds the arguments for that hypothesis (wisdom, an existential risk Kuznets curve, space settlement) weak. | Read |
| NOTE-1309 | Being one of us: we-identities and self-categorization theory | A we-identity is held as a group member, is at times salient, is endorsed, and varies in affective salience. Self-categorization theory explains we-identities by depersonalization: seeing oneself as an interchangeable exemplar of a prototype. Phenomenologists (Zahavi, Salice) have adopted it for the “we” in general. But close relationships, such as long friendships and partnerships, yield we-identities by mutual individualization, in which each grasps the other as non-substitutable. So depersonalization is not necessary for a we-identity. León sketches a socially extended account, drawing on Husserl and on extended-mind criteria. | Read |
| NOTE-1310 | The Effects of Trauma, with or without PTSD, on the Transgenerational DNA Methylation Alterations in Human Offsprings | A short narrative review of human studies of parental trauma and offspring DNA methylation. Two parent–child studies: Rwandan mothers pregnant during the genocide and their children, with higher NR3C1 methylation and lower cortisol than a group abroad (25 and 25); and Holocaust survivors (32) and offspring (22) against 8 controls and their 9 offspring, with FKBP5 intron 7 methylation higher in survivors and lower in their offspring. Three studies of stress in pregnancy link it to NR3C1 methylation in newborns and adolescents. The authors call the evidence accumulating but preliminary, and use “transgenerational” for any parent-to-child effect. | Read |
| NOTE-1311 | Economics and Identity | Puts identity, a person’s self-image as a member of social categories, into the utility function. Utility falls when one’s own actions break one’s category’s prescriptions (Is) and when others’ actions do (Io); the second can be relieved, at a cost, by acting against the violator. A two-person game gives four equilibria and shows taxes and rhetoric shifting them. Applications: gender-typed jobs and their erosion after the women’s movement; the socially excluded choosing an oppositional identity even with no peer pressure; and the gender asymmetry in housework, where husbands’ share rises to no more than 37% however little they earn. Evidence is illustrative. The authors call identity a nonpecuniary motive and never call it self-interest. | Read |
| NOTE-1313 | Mental Hoop Diaries: Emotional Memories of a College Basketball Game in Rival Fans | Twenty-three male fans, 12 of Duke and 11 of UNC, watched an archived 2001 Duke–UNC game three times in the week before scanning. Under fMRI they saw 64 clips, each ending as a shot was released, and recalled whether it went in (74% correct). The same shot was good for one side and bad for the other, so allegiance alone set its valence; fans’ ratings matched their side 88.9% of the time. Good shots for one’s own team were recalled more accurately and confidently and rated more intense. Intensity, not valence, modulated amygdala, hippocampus, striatum and cortical midline regions. Positive shots added dorsal fronto-parietal and sensorimotor activity. The two fan groups did not differ in accuracy or rated intensity. | Read |
| NOTE-1314 | Astronomical Waste: The Opportunity Cost of Delayed Technological Development | Each second’s delay in settling the Virgo Supercluster loses the potential for about 10^29 lives (10^13 if all must be biological). On a total, undiscounted view that makes delay an enormous loss. But a one-percentage-point cut in existential risk is worth over 10 million years of delay, so the total utilitarian’s priority is safety: “Minimize existential risk!”. On a person-affecting view only people now alive or who will exist count, and extinction is bad for what it does to them. Given a chance that some now alive live to share the cosmic benefits, safety is then very important but must be balanced against speed. The grounding is impersonal on the first view and the present generation’s own good on the second. Nothing is said about motivation. | Read |
| NOTE-1315 | Social identity theory | A textbook chapter. Social identity is the part of the self-concept that comes from group membership “together with the value or emotional significance attached to that membership” (Tajfel 1978). Categorization is always self-relevant, and the motive for a positive social identity drives comparison with out-groups; that identity serves needs for certainty, self-esteem and meaning. Low-status members choose individual mobility, collective action or social creativity by permeability, legitimacy and stability. Identification has cognitive, affective and behavioural components. At work, identification is said to matter more than “selfish concerns” of interdependence. An imagined common in-group raised children’s helping of an immigrant classmate. | Read |
| NOTE-1316 | The impact of place and legacy framing on climate action: A lifespan approach | 988 American adults, aged 18 to 87 and sampled evenly by age, wrote for 5–7 minutes about what they wanted future generations to remember them for (Legacy), about a place they loved and climate change (Place), or how to scramble eggs (Control). Both tasks raised pro-environmental intentions and hypothetical donations, small effects equal across age groups. The Legacy task raised an eight-item Legacy Motivation Scale, which partly mediated its effect. But the Place task raised legacy motivation too, the Legacy task raised love of nature, and with both mediators in one model love of nature carried at least as much of the donation effect. The scale’s items mix wanting to be remembered with self-regard and felt responsibility to future generations. | Read |
| NOTE-1317 | The Precipice Revisited | Ord updates The Precipice’s four largest risks after about five years. Climate risk is down: emissions track between the two lower RCPs, and the IPCC’s likely climate sensitivity narrowed from 1.5–4.5°C to 2.5–4°C, partly by our action and partly by discovery. Nuclear risk is up: the war in Ukraine, New START’s coming expiry, and funding for the field halved. Pandemics and AI are mixed: Covid showed weak institutions and a brief unity, but vaccines came within a year; language models are not inherently agents and have read human values, while big-tech racing is bad and governance has improved. The book’s numbers (climate and nuclear 1 in 1,000, pandemics 1 in 30, AI 1 in 10 per century) have not moved at their rounding. | Read |
| NOTE-1318 | Population and Having Children Now | Narveson’s late restatement of the person-affecting view, after giving up utilitarianism. Creating a person neither benefits nor harms them, since before conception there is no one to compare. But the existence of people with good lives is normally good, and a reason to create them, “contrary, perhaps” to how his 1967 and 1973 papers were read. It matters because parents and the benevolent like it and because more people benefit others. Only harm to actual persons, “alive, breathing, and acting now (or at any rate in their lifetimes)”, can justify coercing procreation; possible people are owed nothing. Not aiding the poor is not harming them. The second half claims, with little evidence, that resources are created and that present and future people do not compete for them. | Read |
| NOTE-1319 | A comparison of minimal group induction procedures | Two experiments (N = 42, 73) with US undergraduates compare four minimal-group inductions: false feedback on painting preference (the classic), imagined assignment, random assignment, and memorizing five names of one group with no categorization. All four gave comparable explicit in-group liking, identification and bonus-money favouritism. Only memorization gave large IAT effects of in-group preference and self-association (d up to 2.16 against the classic); the classic gave none. Implicit and explicit measures correlated weakly. Allocation favouritism tracked explicit identification (r = .37) and was carried mostly by one colour group. | Read |
| NOTE-1320 | Human transgenerational responses to early-life experience: potential impact on development, health and biomedical research | A position paper of the Network in Epigenetic Epidemiology. It defines “transgenerational” broadly: any outcome in offspring of a parent’s exposure before conception or an ancestor’s. In the Överkalix cohorts (about 100 probands each), a paternal grandfather’s good mid-childhood food supply went with higher grandson mortality (rate ratio 1.67) and poor supply with lower (0.65); for paternal grandmothers and granddaughters, 2.13 and 0.72. In ALSPAC, sons of fathers who began smoking before 11 had more body fat from 13. Against multiple testing, the authors cite prior hypotheses and coherence and grant that replication is needed. Against cultural inheritance, they cite the sensitive period in the grandparent’s mid-childhood. On mechanism they stay agnostic. | Read |
| NOTE-1321 | Existential Risk Prevention as Global Priority | An existential risk threatens premature extinction of Earth-originating intelligent life or the permanent and drastic destruction of its potential. Four classes: extinction, permanent stagnation, flawed realisation, subsequent ruination. On an aggregative, time-neutral view Earth alone could hold 10^16 future lives, so a millionth of a percentage point of risk is worth a hundred million lives. Maxipok, a rule of thumb for impersonal moral action, follows. Adams’ shared project of humanity, preference satisfaction and custodial duties concur. Bostrom finds a “deficit of motivation”: the good is pan-generational and public, its beneficiaries cannot pay, and moral sentiment is insensitive to scope. | Read |
| NOTE-1322 | Many Labs 4: Failure to Replicate Mortality Salience Effect With and Without Original Author Involvement | Twenty-one labs at 18 US universities replicated Study 1 of Greenberg et al. (1994), in which writing about one’s own death raised preference for a pro-US over an anti-US essay author (d = 1.34, N = 59). Half the labs used a protocol designed with the original authors, half built their own from the paper. With 17 labs and 1,550 usable participants, the pooled effect was Hedges’ g = 0.07 (95% CI −0.03 to 0.17), with no heterogeneity across labs and no difference between protocols, under each of three preregistered exclusion rules. The expert-advised labs alone reached g = 0.08 to 0.19, none significant. The question of whether expertise aids replication went untested, because there was no effect for it to aid. | Read |
| NOTE-1323 | Alvarez-Melis et al. — Hyperbolic OT hierarchy matching | Two Poincaré embeddings of the same WordNet hierarchy, from different random seeds, differ by more than a hyperbolic isometry: branches move relative to one another and pairwise distances change. Euclidean aligners and hyperbolic OT with an orthogonal map therefore fail (P@10 at most 11% across languages). Registering one space with a hyperbolic neural network trained through a Sinkhorn divergence recovers P@10 of 38–60% across languages and P@1 of 22% when matching a hierarchy to itself. The matching uses the symmetric hyperbolic distance, and nothing in it preserves the direction of entailment. | Read |
| NOTE-1324 | Alvarez-Melis et al. — Structured optimal transport | Replaces the linear cost of discrete optimal transport by the Lovász extension of a submodular set function on assignments, so that the cost of a coupling depends on which assignments are made together. The problem stays convex and is a zero-sum game against cost matrices in the base polytope, solved by saddle-point mirror prox with Sinkhorn and base-polytope projections; it reduces to ordinary OT when the set function is modular. Its own example cost, eq. (12), is not concave, so the cost it defines is not submodular. | Read |
| NOTE-1325 | Flamary et al. — POT | A software paper for POT, an MIT-licensed Python library of optimal transport solvers: exact transport by a C++ solver, entropic transport by Sinkhorn and stabilized variants, Wasserstein barycenters, partial and unbalanced transport, regularized transport, Gromov–Wasserstein, sliced Wasserstein and domain adaptation, with tests covering 92% of lines. It reports no experiments. Fused and partial Gromov–Wasserstein and co-optimal transport, which the record uses POT for, are not in this paper; they came in later releases. | Read |
| NOTE-1327 | Yu et al. — AvAtar active OT alignment | For alignment by entropic optimal transport, AvAtar picks which source objects to send to an oracle, who names each one’s true match. It scores a candidate by the derivative of a proxy utility of the transport plan (how near a permutation, or how consistent with the graphs, the plan is) with respect to supervising each possible match, averaged over matches by the current plan. The derivative is exact, from one singular positive semidefinite linear system solved by conjugate gradients. At a fixed budget of 20% extra labels on top of 20% given, it beats uncertainty baselines by up to 2.8 MRR points and random choice by up to 16, without variances reported. | Read |
| NOTE-1328 | Vayer et al. — Fused Gromov–Wasserstein | FGW compares two attributed graphs with one coupling whose cost mixes, with weight α, a Wasserstein term on node features and a Gromov–Wasserstein term on structure. For α in (0, 1), q = 1 and distance-matrix structures it is a metric that vanishes exactly when a bijection preserves weights, features and structure. As α tends to 0 or 1 it tends to W or GW. On benchmark graph classification it is competitive with graph kernels, but the supplement shows Wasserstein on features alone matching or beating it on several datasets. | Read |
| NOTE-1329 | Hashimoto et al. — Word embeddings as metric recovery | If text were generated by a random walk whose steps depend on distance in a latent Euclidean or Riemannian space, negative log co-occurrence over a window that grows with the vocabulary, less a term for each word, would approach the squared latent distance. GloVe, word2vec and the PMI-SVD method then have the true embedding among their optima, up to isometry and unigram terms, and a negative-binomial regression on the same relation embeds words and manifolds about as well. On real corpora the evidence for a Euclidean semantic space is a correlation of 0.75 between PMI and human similarity ratings and two nearest-neighbour statistics; the authors say the random walk is not a model of language. | Read |
| NOTE-1330 | Chowdhury & Mémoli — Network Gromov–Wasserstein | The Gromov–Wasserstein distance, defined by minimizing the distortion of a coupling, is a pseudometric on all measure networks: any Polish node set with a probability measure and any bounded, possibly asymmetric, edge-weight function. It is zero exactly when the two networks are weakly isomorphic, that is, when both are images of one network that preserves weights and measures. Cheap invariants give a hierarchy of lower bounds, and the third lower bound, a transport problem whose costs are themselves transport problems, reduces to one-dimensional transport in closed form. The bounds are one-sided: networks can agree on every invariant and still be apart. | Read |
| NOTE-1331 | Sarkar, Mukherjee and Sato — Attention as lattice gauge theory | Under per-entity O(d) frame freedom, transports carry invariant information only around cycles, a triangle’s invariants are class functions of its holonomy, and an equivariant edge update is Ψ(H)Tᵢⱼ with Ψ conjugation-equivariant: a sound conditional theorem, standard in lattice gauge theory and synchronization, whose “unique form” is a family. The untrained S4 experiments show composition doing the work and Wilson-loop routing adding 0.6–7.8 points; the 0.99 AUC is a ceiling the data’s construction sets, as the paper itself computes. | Read |
| NOTE-1332 | Bodnar et al. — Neural sheaf diffusion | Bodnar et al. read sheaf diffusion on a graph as a projection onto the harmonic space of a sheaf Laplacian and ask which classes of restriction maps can make that projection linearly separate a node labelling. A symmetric one-dimensional sheaf, which is a weighted graph Laplacian, cannot separate the two sides of a balanced bipartite graph; signed maps separate any two classes; no one-dimensional sheaf separates three; diagonal maps with d ≥ C stalks, and O(d) bundles for C ≤ 2d at d = 2 and 4, separate any number. Every one of these sheaves is built from the labels. Learned from features, such sheaves give competitive node classification on six small heterophilic benchmarks. The claim that the O(d) construction exists only at d = 2 and 4 is wrong: it works at d = 8 too. | Read |
| NOTE-1333 | Alvarez-Melis et al. — OT with global invariances | Optimal transport between two unregistered spaces is posed as a joint minimisation over couplings and one global linear map from a Schatten ℓp ball. Under angle preservation or whitening it reduces to maximising a dual Schatten norm of the transported cross-covariance XΓYᵀ: the nuclear norm for orthogonal maps (p = ∞) and the Frobenius norm for p = 2, which is exactly GW with cosine similarity and squared loss. Alternating SVD and Sinkhorn steps with annealed entropy solve it without adversarial initialisation. On word translation it is level with GW and behind self-learning on nine of ten directions. | Read |
| NOTE-1334 v2 | Zeng et al. — HOT multi-network alignment | Aligns K networks at once by one multi-marginal coupling tensor. The networks are first co-clustered through a fused Gromov–Wasserstein barycenter, then each cluster’s nodes are aligned by multi-marginal fused GW with a cost from anchor-based random-walk embeddings, solved by a KL proximal point method. The joint objective at any tensor is the sum of the pairwise objectives at its marginals, so it bounds the sum of pairwise optima from above. On three-network benchmarks whose true correspondences are consistent by construction, it beats pairwise and multi-network baselines in pairwise and high-order hits; no experiment isolates the joint coupling from the new cost and the clustering. | Read |
| NOTE-1335 | Redko et al. — CO-Optimal Transport | COOT matches two data matrices of different shapes by optimizing two couplings at once, one between rows (samples) and one between columns (features), under a bilinear cost. With equal sizes and uniform weights it is zero exactly when the matrices are equal up to a permutation of rows and a separate permutation of columns, so its plans are determined at best up to the matrix’s joint row–column symmetries; the paper proves no uniqueness. For symmetric matrices it is a lower bound on GW, equal to it for squared Euclidean distance matrices. | Read |
| NOTE-1336 | Alvarez-Melis & Jaakkola — Gromov-Wasserstein word alignment | Unsupervised word translation is cast as a Gromov–Wasserstein problem between the two languages’ intra-language cosine-similarity matrices, solved by entropic projected gradient (each step a Sinkhorn problem), with no anchors. It matches adversarial-plus-refinement methods on related languages trained on comparable corpora at a fraction of the cost, and does markedly worse on English–Russian and English–Finnish. The objective sees only within-space similarities, so it cannot distinguish a correspondence from one composed with a symmetry of either space; the paper does not say so. | Read |
| NOTE-1337 | Søgaard et al. — Limits of unsupervised dictionary induction | The adversarial unsupervised method of Conneau et al. (2018) induces bilingual dictionaries only when the two embedding spaces are alike: it fails for English paired with Estonian or Finnish, for corpora from different domains even within English–Spanish, and for spaces trained by different algorithms. A seed of identically spelled words does as well or better. A spectral dissimilarity of small nearest-neighbour graphs tracks success across eight language pairs (|ρ| = 0.89). The failures are partly optimiser instability (some seeds succeed), and the method tested is adversarial, not GW. | Read |
| NOTE-1338 | Ward & Marco — pragmatic-similarity judgments | The first set of human pragmatic-similarity ratings: 693 pairs of a spoken dialog utterance and a re-enactment of it, made six ways so that similarity varies, rated on a 1–5 slider by 6–9 judges in three four-hour sessions, two English and one Spanish, 5,532 ratings in all. Mean pairwise Pearson correlation between judges was 0.45, 0.72 and 0.66 by session. It rose with experience and fell for pairs that differ in wording (0.80 in Session 2 without them). The 0.45 the record cites is the first session’s single-judge figure. A nine-judge mean at that level has an estimated reliability near 0.88. | Read |
| NOTE-1339 | Srinivasan & Choi — TyDiP | TyDiP gives graded politeness ratings, three crowd annotators per item, for 500 Wikipedia talk-page requests in each of nine languages. Mean pairwise Spearman agreement is 0.46 for target-language items and 0.36 for English items rated by the same bilinguals. Leave-one-out human accuracy on the binary top-and-bottom-quartile set hovers around 90%, about 10 points above an English-trained XLM-R in six languages. But annotators were screened for agreement with that classifier, and the paper’s “across all nine languages” is false for Tamil. | Read |
| NOTE-1340 | Nicholson — The organism as a system (Weiss) | Nicholson reconstructs from Paul Weiss’s writings a non-formal concept of a system: a whole that keeps its configuration while its parts vary and turn over, whose parts are produced and constrained by the network they form, and which therefore cannot be assembled stepwise or recovered from an inventory of parts. He uses it against reductionism, genocentrism, determinism and mechanicism. The critiques rest mostly on conceptual argument, analogy and Weiss’s authority; only the one against determinism leans on cited evidence, and its one formal criterion, that the whole varies far less than the summed variances of its parts, is met by any aggregate whose whole is measured as an average. | Read |
| NOTE-1341 v2 | Guerreiro et al. — xCOMET | xCOMET is a learned metric for machine translation, a 3.5B or 10.7B XLM-R encoder with a sentence-score head and a token-severity head, trained on DA scores and then on MQM error spans with synthetic hallucinations. On WMT22 expert MQM it reaches segment-level Kendall τ of 0.39–0.47 and span F1 of 0.24–0.32, at or above the open metrics and GPT-4 prompting of its time, and it would have won WMT23’s metrics task. Its two heads agree with each other far better than either agrees with human annotators, partly by construction. It flags most injected critical errors and ranks fully detached hallucinations low. | Read |
| NOTE-1342 | Felekis et al. — Causal optimal transport of abstractions | COTA learns a stochastic map from a low-level to a high-level causal model’s state space from samples of paired interventional distributions, given both DAGs and the map between interventions, by solving one entropic optimal-transport problem per intervention with a cost that rewards compatibility with the paired interventions and a term meant to impose do-calculus relations between plans. As written, that term depends only on the plans’ marginals, which the transport constraints fix, so it is constant on the feasible set and its weight acts only by rescaling the other terms. The reported gains come from the compatibility cost when interventions are many; with few, a Hamming cost does better. | Read |
| NOTE-1343 | Peyré et al. — Gromov–Wasserstein averaging | Defines an entropic Gromov–Wasserstein discrepancy between similarity matrices of any size and loss, and their barycenter as a Fréchet mean of user-chosen size and weights. It is computed by alternating Sinkhorn- based coupling updates with a closed-form matrix update that, for square loss, averages the couplings’ realignments of the inputs with the barycenter weights. The algorithm is proved to keep PSD and infinitely divisible kernels in their classes; its convergence at the step size used is observed, not proved, and only stationary points are sought. | Read |
| NOTE-1344 | Osmelak et al. — PETra | PETra is a corpus of about 3,000 English-source sentence pairs from TED-Multi and Europarl, in twelve target languages, in which a translation adds or replaces material to make culture-bound knowledge explicit: unit conversions, entity descriptions and specifications, translator glosses. Candidates come from null alignments filtered to pairs with a named entity, and a BERT classifier trained by active learning on German and Spanish finds the rest. Measurement conversion is the largest category. No inter-annotator agreement is reported, the text points to a single annotator, and three quarters of the pairs were found by the classifier, so the labels are not a validated measure. | Read |
| NOTE-1345 | Singh et al. — VakyArth | VakyArth is 578 items written by four native speakers, one per language, for Hindi, Punjabi, Tamil and Malayalam, over five phenomena and three formats. Five LLMs do better on MCQ than NLI in every model–language pair, and when wrong they lean to the literal reading. COMET tracks one native rater’s pragmatic-adequacy scores at r = 0.81. The translation items are not the MCQ and NLI items: in the release, 1 of 204 translation sources overlaps an inference item. So the finding that translation “does not track” pragmatic understanding compares different items. No agreement between people is reported anywhere. | Read |
| NOTE-1346 | Chu, Zhmoginov and Sandler — CycleGAN as steganographer | A CycleGAN trained to translate aerial photographs to maps and back reconstructs details of the photograph, such as the pattern of dots on a roof, that are absent from the visible map, because it encodes them in a low-amplitude, high-frequency signal in the map. Noise of three 8-bit levels, or JPEG compression, destroys the reconstruction; low-frequency changes do not. Any target photograph can be produced from almost any map by an imperceptible perturbation found by gradient descent, and the perturbation needed shrinks as training proceeds. The cycle-consistency loss is met by a channel the map’s human reader cannot see. | Read |
| NOTE-1347 | Simoes, Dastani and van Ommen — Causal information bottleneck | The causal information bottleneck trades I(X; T), the information a variable abstraction T keeps about X, against Ic(Y | do(T)), the reduction in Y’s entropy when T is set by intervention under a chosen protocol over X. An intervention on T is defined as a mixture of interventions on X, weighted by Bayes inversion of the encoder under a uniform prior, and is identifiable by a backdoor formula. At full weight on control, the optimum is the partition of X by p(y | do(x)), the causal macrovariables of Chalupka et al., which the ordinary bottleneck misses under confounding. Three toy SCMs confirm it; nothing larger is tried. | Read |
| NOTE-1348 | Goguen & Burstall — Institutions | An institution is a category of signatures with a sentence functor, a contravariant model functor and a satisfaction relation per signature, subject to one axiom, the Satisfaction Condition: a translated sentence holds in a model exactly when the original holds in the model’s reduct. From that axiom alone theories and model classes form a Galois connection, theories can be glued by colimits whenever signatures can (Theorem 11), constraints that force standard or free interpretations can be added as sentences without losing this, and an institution morphism with surjective model translation lets a prover for one logic decide entailment for another (Proposition 35). The Satisfaction Condition is a criterion of correct translation relative to a given model translation; it says nothing about where that model translation comes from. | Read |
| NOTE-1349 | Gentner — Structure-mapping | Gentner proposes that an analogy maps the relations of a base domain onto a target and drops the objects’ attributes, and that which relations go across is decided by systematicity: a relation belonging to a system tied together by higher-order relations is more likely to be imported than an isolated one. The rules look only at the form of the representation (arity and order of predicates), which lets literal similarity, analogy, abstraction and mere appearance be told apart by what kinds of predicate overlap. The framework is argued from examples; the empirical support is one study summarized in a paragraph. | Read |
| NOTE-1350 | Sengupta, Tozzi, Cooray, Douglas and Friston — Towards a neuronal gauge theory | An essay proposing that variational free-energy minimization be cast as a gauge theory. The only connection it names is the Levi-Civita connection of the Fisher information metric on the manifold of a belief’s sufficient statistics, so its gauge freedom is reparameterization of the variational family; its claimed payoff is that attention is precision weighting forced by that manifold’s curvature. No gauge group, invariant Lagrangian or compensating field is written down. | Read |
| NOTE-1351 | Flack — Multiple time-scales and the developmental dynamics of social systems | A review of the pigtailed macaque power-structure work. Fight outcomes flip; the peaceful silent bared-teeth signal that encodes a subordination contract almost never does, so the signalling network changes about two orders of magnitude more slowly and predicts fights better than any single fight. Power, read from that network, is a further slow variable. That the animals perceive and use these variables is argued from earlier studies and stated as what “the data suggest”, not shown here. | Read |
| NOTE-1352 | Marsland, Cui and Mehta — The minimum environmental perturbation principle | In niche models whose environmentally mediated interactions are symmetric, which it characterizes as impact vectors of the form q_iα = −a_i b_α ∂g_i/∂R_α, the uninvadable equilibrium minimizes a perturbation d(R0, R) of the environment from its supply point subject to no species having positive growth, with the species’ scaled abundances as KKT multipliers. MacArthur’s minimization principle is its Lagrange dual. d rises with every successful invasion. | Read |
| NOTE-1353 v2 | Guida, Minutola and Presti — Propagation, not aggregation | A conceptual paper with no data. Organizational flexibility is put as a pattern of coordinated, values-consistent action that is retained and spread or absorbed and extinguished, not as the mean of members’ flexibility. Whether a rise in a member’s flexibility propagates is said to depend jointly on that member’s leverage over the consequences colleagues meet and on whether the culture reinforces or penalizes values-consistent action; Bond’s (2018) leader-based route is the high-leverage special case. Five propositions, a factorial design and two measures that do not yet exist are set out. | Read |
| NOTE-1354 v2 | Škorić, de Hoogh and Zannone — Evidence-based subjective logic | Subjective logic’s discounting x ⊗ y multiplies opinions and does not distribute over its evidence-adding consensus ⊕, so trust networks must be put in a canonical form, often by discarding edges, to avoid double-counting. EBSL replaces it with x ⊡ y = g(x)·y, a scalar multiple of y’s evidence, which distributes over ⊕; the recursive, PageRank-like fixed point R = A ⊕ (offdiag R ⊡ A) then handles loops without discarding anything, and on Tribler data it converges in 9–47 iterations. There is no ground truth; robustness to self-promotion, slander and Sybil attacks is left for future work. | Read |
| NOTE-1356 | Castro and Liskov — Practical Byzantine fault tolerance | A state-machine replication protocol that keeps safety with at most ⌊(n − 1)/3⌋ arbitrarily faulty replicas and no timing assumption, needing weak synchrony only for liveness; a three-phase commit within views and a view change that carries prepared requests forward. With MACs in place of signatures, a replicated NFS ran the Andrew benchmark 3% slower than Digital Unix’s NFS on four replicas, with view changes not yet implemented in the measured library. | Read |
| NOTE-1357 | Jasanoff — Technologies of humility | Jasanoff argues that predictive “technologies of hubris” — risk assessment, cost–benefit analysis, modelling — are blind at the edges, pre-empt political debate and cannot take in challenges outside their framing, and that formal participation does not fix this. She proposes “technologies of humility”, institutionalized habits of thought organized around four focal points: framing, vulnerability, distribution and learning — “what is the purpose; who will be hurt; who benefits; and how can we know?” | Read |
| NOTE-1358 v2 | Lynch et al. — RefraMED trial of RO DBT for refractory depression | In a three-centre British trial, 250 adults with chronic or treatment-resistant depression were randomised 162 to RO DBT plus usual care and 88 to usual care. RO DBT was 5.40 HRSD points better at 7 months, at the end of therapy, but 2.15 and 1.69 points at the 12-month primary end-point and at 18 months were not significant; flexibility (AAQ-II) and emotional coping were significantly better at 12 and 18 months, not at 7, and suicidal ideation and social support never differed. All eight possibly related serious adverse reactions were in the RO DBT arm. | Read |
| NOTE-1359 | Jansma and Hoel — Engineering emergence | Extends causal emergence 2.0 from one micro→macro path to the whole lattice of partitions of a Markov chain’s states: a partition’s ∆CP is its CP minus the largest CP of any finer partition, and the partitions with ∆CP > 0 form the “emergent hierarchy”. Shown on 5- and 8-state chains by enumeration and on 40-state preferential-attachment chains by a greedy sampler, where the spread of ∆CP within and across levels peaks near linear attachment; cycles let a single emergent scale be placed at any level. No theorem; the dynamical-consistency filter of CE 2.0 is dropped. | Read |
| NOTE-1360 | Franklin — The Autobiography of Benjamin Franklin | Franklin’s memoir of his life to 1757, written in four sittings from 1771 to 1790 and left unfinished. Its constant subject is how he got others to act with him: by modest, undogmatic speech, by putting his projects forward as “a scheme of a number of friends”, by preparing opinion in print and through the Junto’s satellite clubs, and, in the borrowed-book anecdote of Part Three, by asking an opponent for a favour. He gives that anecdote as proof of an “old maxim” and as a lesson in prudence, not as a claim about how liking forms. | Read |
| NOTE-1361 | International Court of Justice — Chagos advisory opinion | The Court advised, by 13 votes to 1, that the decolonization of Mauritius was not lawfully completed in 1968, because the Chagos Archipelago was detached in 1965 without the free and genuine will of the people of the territory, a colony’s “agreement” given under the administering Power’s authority not counting as one; that the United Kingdom’s continued administration is a continuing wrongful act it must end “as rapidly as possible”; and that resettlement of Chagossians is a human-rights matter left to the General Assembly, not decided by the Court. | Read |
| NOTE-1362 | Soros — Fallibility, reflexivity, and the human uncertainty principle | Soros’s statement of his framework. Participants’ views are fallible, and acting on them changes the situation they are views of; a cognitive function (world to mind) and a manipulative one (mind to world) run at once, so neither has an independent variable. He calls fallibility and reflexivity together the human uncertainty principle, and says fallibility, not reflexivity, is the main source of the Knightian uncertainty in human affairs. A postscript withdraws the sharp line he draws between natural and social science. | Read |
| NOTE-1363 | Fedus, Zoph and Shazeer — Switch Transformers | Routing each token to one expert (top-1, “switch” routing) with a fixed per-expert capacity, a load-balancing auxiliary loss α·N·Σ f_i P_i (α = 10⁻²), router computation in float32 inside bfloat16 training, a tenfold smaller initialization and higher dropout inside experts lets sparse Transformers train stably. At equal FLOPs per token on C4, Switch-Base with 64 experts reaches T5-Base’s quality about 7 times faster in wall-clock time, gains hold on most fine-tuning tasks and all 101 mC4 languages, and a 1.6-trillion-parameter model is trained. The paper reports the gains; it does not study what experts specialize in. | Read |
| NOTE-1364 | Fiss — The forms of justice | Fiss argues that the function of adjudication is to give meaning to public values, not to resolve disputes, so structural reform — a judge restructuring a state bureaucracy that threatens constitutional values, through a continuing injunction — is not a deviant form. Its legitimacy rests on the judge’s process, dialogue and independence, not on consent. Its real problem is the remedy: rights and remedies jointly fix a value’s meaning, but the judge’s need to be effective in a world of recalcitrant actors erodes the independence that legitimates him, and he “will tailor the right to fit the remedy”. | Read |
| NOTE-1365 | Human Rights Watch — That’s When the Nightmare Started | A human-rights report built on interviews with 43 Chagossians in the UK, Mauritius and the Seychelles, 14 other interviews and a documentary record taken largely from UK court judgments. It argues that the expulsion of 1965–73, the continuing bar on return and treatment on racial grounds are three continuing crimes against humanity — deportation or forcible transfer, other inhumane acts, and persecution — committed by the UK, the first jointly with the US, and asks for return, compensation and satisfaction as reparations. | Read |
| NOTE-1366 | Blumenthal, Rocks and Mehta — Phase transition to chaos with nonreciprocal species-resource interactions | In MacArthur’s consumer–resource model with species’ benefits c and impacts e on resources correlated by ρ, the cavity method’s replica-symmetric fixed point loses stability at ρ² = (surviving species)/(non-depleted resources); below ρ simulations do not settle, their largest Lyapunov exponents are positive and the probability of reaching a steady state falls with system size. With ρ = 1 the model has an optimization principle and competitive exclusion keeps the ratio ≤ 1, so the transition never occurs. | Read |
| NOTE-1367 | Chizat and Bach — Global convergence of gradient descent for over-parameterized models using optimal transport | Training a sum of many units by gradient descent is, as the number of units grows, a Wasserstein gradient flow of a convex functional of the measure over unit parameters. A measure is a global minimizer exactly when the first variation F′(µ) is nonnegative everywhere and zero on its support. Under 2-homogeneity or partial 1-homogeneity, and an initialization whose support separates the domain, any limit of the flow is global, because mass in any region where F′ < 0 grows exponentially. The result is conditional on convergence and non-quantitative. | Read |
| NOTE-1368 | Power et al. — What can ecosystems learn? | In a competitive Lotka–Volterra community where individual selection lowers the competitive effect ω_ij of species j on species i at a rate proportional to x_i x_j, and a normalising trade-off holds each row and column sum of ω fixed, interactions change as Hebbian learning does. In simulation (400 species, symmetric ω) the community comes to hold attractors for two past forcing patterns, completes them from fragments and switches with hysteresis. The memory needs the imposed trade-off, and in the long run it degrades. | Read |
| NOTE-1369 | Cooper and West — Division of labour and the evolution of extreme specialization | A kin-selection model of one cooperative trait with two phenotypes that invest q1 and q2 in helping. Division of labour needs accelerating returns to helping (α > 1) but is not guaranteed by it; when it evolves one phenotype is always a pure reproductive (q2 = 0), so a feedback between helper and reproductive specialization drives the extremes. Relatedness does not affect whether division evolves for an essential trait, and favours sterile helpers. The authors infer that division of labour drives major transitions; the model contains no transition. | Read |
| NOTE-1370 | Kolchinsky and Wolpert — Semantic information and autonomous agency | Defines a system’s semantic information about its environment as the least syntactic information (initial mutual information, or transfer entropy over [0, τ]) that an intervention by coarse-graining the environment can leave while keeping the system’s viability at τ unchanged, viability being the negative Shannon entropy of the system’s state. Viability function, system–environment split, τ and initial distribution are the analyst’s choices, which the paper concedes and proposes to fix by maximizing the measures. One five-location food-seeking toy; no theorem beyond 0 ≤ semantic ≤ syntactic. | Read |
| NOTE-1371 | Rose et al. — Zero trust architecture (NIST SP 800-207) | NIST’s abstract definition of zero trust: no implicit trust from network location or ownership, access to each resource granted per session by a policy engine and administrator and enforced at a policy enforcement point, on dynamic policy fed by asset state, identity, behaviour and threat intelligence. Seven tenets, three approaches, four deployment models, five use cases, seven threats and a migration path; its own survey judged the ecosystem not yet mature enough for widespread adoption. | Read |
| NOTE-1372 | Shalizi and Crutchfield — Computational mechanics | For a discrete-valued, discrete-time stationary process whose joint distribution is known, the causal states (classes of pasts with the same distribution over the whole future) are as predictive as the full past, are the minimal and, up to measure zero, the unique such states, and have the least stochastic transitions; their entropy Cµ bounds the excess entropy from above. Minimality holds only for predicting the entire future: for any finite horizon a coarser state set can be as predictive and simpler. The paper proves these; it does not show how to estimate causal states from data. | Read |
| NOTE-1373 | Marquis and Tilcsik — Imprinting: toward a multilevel theory | A review that defines imprinting by three features, a brief sensitive period, the stamp of the environment during it, and persistence despite later environmental change, and separates it from path dependence and cohort effects. It orders the literature in a 4 × 3 table (collectives, organizations, building blocks, individuals; economic and technological, institutional and individual sources) and proposes that entities carry layered imprints from several sensitive periods, including imprints taken secondhand from entities they copy. | Read |
| NOTE-1374 | Friedkin — A formal theory of reflected appraisals in the evolution of power | Friedkin extends the Friedkin–Johnsen influence model across a sequence of issues: each member’s self-weight on the next issue is set to their average total control over the last. In 50 four-person laboratory groups, prior control predicts the next self-weight. In 100,000 simulated random networks, over 98% evolve to one leader whose uninfluenced preference settles every issue through intermediaries. A re-run reproduces this, and shows that the DeGroot–Friedkin version of LIT-1146 does not concentrate power on the same networks. | Read |
| NOTE-1376 v2 | Supreme Court — Noem v. Abrego Garcia | An unsigned order on the government’s application: the District Court’s deadline had lapsed under the administrative stay, its order “properly requires the Government to ‘facilitate’” Abrego Garcia’s release from Salvadoran custody and to handle his case as if he had not been “improperly sent”, and its word “effectuate” was unclear, may exceed the court’s authority, and was to be clarified with deference to the executive in foreign affairs. The government had acknowledged the removal was illegal. | Read |
| NOTE-1377 | Letten, Ke and Fukami — Linking modern coexistence theory and contemporary niche theory | Translating Tilman’s two-consumer, two-resource model into Lotka–Volterra coefficients and then into Chesson’s niche overlap ρ and fitness ratio, the authors find, by worked cases at equilibrium, that shifting the resource supply ratio changes only the fitness ratio (equalizing) except at extremes where essential-resource competitors become limited by the same resource and ρ jumps to 1; that impact-niche overlap moves ρ (stabilizing); and that requirement-niche overlap moves both, without changing whether the species coexist. | Read |
| NOTE-1378 | Carstens and Land — Hyperstition: an introduction | A short interview in which Nick Land defines hyperstition as “a positive feedback circuit including culture as a component”, “the experimental (techno-)science of self-fulfilling prophecies”, whose ideas “function causally to bring about their own reality”. His examples are confidence in markets, cyberspace and Jerusalem’s destiny, and he says that under favourable conditions, “whose exact nature requires further investigation”, hyperstition can “transmute lies into truths”. Most of the interview is occult and apocalyptic, not analytic. | Read |
| NOTE-1379 | Hofbauer and Schreiber — Permanence via invasion graphs | For ecological ODEs whose invasion growth rates have well-defined, nonzero signs on each subcommunity, it defines the invasion graph (edges S → T when every species in T but not S can invade S and every species lost cannot invade T) and proves that when the graph is acyclic, robust permanence holds if, and essentially only if, each species i has a positive invasion growth rate at every −i community. With cycles, signs are not enough. | Read |
| NOTE-1380 | Li, Lin, Duan, Liang and Shroff — Theory on mixture-of-experts in continual learning | In a stylized continual-learning model, overparameterized linear regression tasks drawn from N ground truths, each carrying a feature signal a linear gate can read, a top-1 MoE whose gate is trained on a “locality” loss plus a Switch-style balancing loss sorts its experts into one set per task (or task cluster) within about M/η rounds. If gate training continues, the balancing loss eventually erases the gaps between experts’ gate outputs and routing goes wrong; stopping it once the gaps settle keeps specialization, and noise then spreads load within each set. Forgetting then decays as 1/t, and more experts only lengthen exploration. | Read |
| NOTE-1381 | Halpern and Moses — Knowledge and common knowledge in a distributed environment | Defines distributed, someone-, everyone- and common knowledge for processors in a system of runs, and shows that a guaranteed coordinated attack makes the attack common knowledge (Proposition 4), while over a channel that may lose any message nothing becomes common knowledge that would not be common knowledge with no messages delivered (Theorem 5), so no correct protocol ever attacks (Corollary 6). Temporal imprecision alone, uncertain start times and delivery times, makes common knowledge unattainable (Theorem 8). Weaker fixed-point variants (ε-, eventual and timestamped common knowledge) are attainable in many systems. | Read |
| NOTE-1383 | Medrano, Friston and Zeidman — Linking fast and slow | A review for neuroimagers: multiscale time series are best tested with hierarchical generative models in which each level is a slower timescale, justified by centre-manifold and adiabatic reduction (the slaving principle) and compared by variational free energy; the worked example is adiabatic DCM of NMDA-receptor-antibody mouse LFP (Rosch et al. 2018). It states the slaving principle and the HKB model in a paragraph each, with no equations, and asserts rather than shows that the principle extends to discrete switching models such as HMMs. | Read |
| NOTE-1384 | Cover — Violence and the word | Cover argues that legal interpretation “takes place in a field of pain and death”: a judge’s interpretation is a practical act whose meaning is bound to deeds that others, in roles, carry out on bodies. Because the judge cannot act alone, legal meaning depends on a social organization of violence — secondary rules that tell wardens which paper to obey, and plural courts so that no single mind’s interpretation becomes a deed — and the perpetrator and victim of that violence cannot share its meaning. | Read |
| NOTE-1385 | Holme and Newman — Coevolution of networks and opinions | N agents with G = N/γ possible opinions on a random graph; at each step a random agent either moves one of its edges to a random holder of its own opinion (probability φ) or copies a random neighbour’s opinion (1 − φ). The process always ends in disconnected communities each of one opinion. For k̄ = 4 and γ = 10 a continuous transition at φ_c = 0.458 ± 0.008 separates a giant like-minded community plus small ones (φ < φ_c) from only small communities of mean size about γ (φ > φ_c), with exponents a = 0.61, b = 0.7 and z = 0.61 outside the percolation class. Simulation only. | Read |
| NOTE-1386 | Feldman and Pentland — Reconceptualizing organizational routines | Feldman and Pentland split an organizational routine into an ostensive aspect, the pattern as participants understand and refer to it, and a performative aspect, its particular enactments, and argue that the ostensive guides, accounts for and names performances while performances create, maintain and modify the ostensive, so that variation and selective retention inside one routine make it a source of endogenous change. A theory paper with one worked example, academic hiring, and no data of its own. | Read |
| NOTE-1387 v2 | Hoel — Causal emergence 2.0 | Replaces CE 1.0’s single EI-maximizing macroscale with a path from the microscale up through coarse-grainings of a Markov chain, along which each step’s gain in CP (determinism minus degeneracy, both normalized, uniform interventions per scale) is that scale’s causal contribution; causal emergence is the total gain and “emergent complexity” the entropy of the gains along the path. Only dynamically consistent coarse-grains are admitted. Shown on three hand-built 8-state chains; the multi-path version is left open, and the paper’s claim to capture all macroscale causation is asserted, not proved. | Read |
| NOTE-1388 | Wang, Gao, Zhao, Sun and Dai — Auxiliary-loss-free load balancing for mixture-of-experts | Adds a per-expert bias b_i to the routing scores used only for top-K selection, not for the gate weights, and after each batch moves b_i by u·sign(mean load − load_i), so overloaded experts are selected less. On DeepSeekMoE-style models of 1B and 3B parameters trained on 100B and 200B tokens it gives slightly lower validation perplexity (9.50 vs 9.56; 7.92 vs 7.97) and much lower global load violation (0.04 vs 0.72 and 0.52) than an auxiliary loss with α = 0.001, one run each. Expert Choice routing is excluded because it leaks future tokens. | Read |
| NOTE-1389 | Gioia, Schultz and Corley — Organizational identity, image, and adaptive instability | Gioia, Schultz and Corley argue that organizational identity, usually defined as central, distinctive and enduring, is better seen as fluid: members compare who they think they are with how they think outsiders see them, and the discrepancy pushes them to change either identity or image, so identity shifts while its labels stay. They call the result adaptive instability and argue that it helps organizations change. A conceptual paper with illustrations (Shell’s Brent Spar, IBM, Oticon, British Airways) and no data. | Read |
| NOTE-1390 | Scheppele — Autocratic legalism | Scheppele names a pattern within democratic decline: leaders elected on a mandate to sweep away the old order use constitutional amendment, legislation and appointments to capture courts, election bodies, media and other checks, “with exquisite legal precision”, borrowing tactics from each other (Hungary, Poland, Turkey, Russia, Venezuela, Ecuador). They keep the forms of democracy and law and avoid the mass rights violations people have learned to recognize, so the danger is seen too late; the remedy proposed is civic education in constitutionalism. | Read |
| NOTE-1391 | ECtHR Grand Chamber — El-Masri v. the former Yugoslav Republic of Macedonia | A unanimous Grand Chamber held the respondent State responsible for inhuman and degrading treatment in 23 days’ incommunicado hotel detention, for torture by a CIA team at Skopje Airport carried out with its agents’ acquiescence and help, for handing him to the US despite a real risk of further ill-treatment it knew or ought to have known of, for his whole captivity in Afghanistan under Article 5, and for failing to investigate; the burden of proof shifted to the State once he was shown to have entered its control. | Read |
| NOTE-1392 | DeMarzo, Vayanos and Zwiebel — Persuasion bias, social influence, and unidimensional opinions | Agents average the reports of those they listen to with fixed relative weights, treating every round’s report as new (persuasion bias, a DeGroot model). In a strongly connected network they reach a consensus weighted by the stationary distribution of the listening matrix, so influence comes from network position as well as precision; the consensus is correct only in “balanced” networks, and fully rational agents who know the network reach the correct beliefs in at most N² rounds. Long-run differences of opinion line up along one line given by the second eigenvectors, across every issue. | Read |
| NOTE-1393 | Paluck, Green and Green — The contact hypothesis re-evaluated | The 27 randomized contact studies with outcomes measured at least a day later give a random-effects average of Δ = 0.39 SD, but the effects are heterogeneous (I² = 0.85), shrink with precision (the meta-regression’s intercept is −0.01), are largest for disability, fall to 0.25 for ethnic, racial, religious and immigrant targets, and are 0.016 in the three pre-registered studies. No study tests interracial contact on anyone over 25. | Read |
| NOTE-1394 v2 | Gross and Blasius — Adaptive coevolutionary networks | Reviews models, mostly 1998–2007, in which a network’s topology and its nodes’ states change each other, and names four recurrent outcomes: robust self-organization toward critical states (Bornholdt and Rohlf’s threshold networks reach K = 2), spontaneous “division of labour” into classes of nodes (Ito and Kaneko), complex topologies from local rules, and new system-level dynamics such as bistability and oscillation in an adaptive SIS epidemic. A sketch, not a theory: the mechanisms are argued from examples, and its summary of Holme and Newman inverts the model’s parameter. | Read |
| NOTE-1395 | Mehta, Cui, Wang and Marsland — Constrained optimization as ecological dynamics | Any minimization of f(R) over R ≥ 0 under constraints g_i(R) ≤ 0 has the KKT points of a consumer–resource dynamics as its steady states: variables are resources, each constraint is a species whose abundance is its Lagrange multiplier, and binding constraints are the surviving species. For quadratic programs the dynamics is MacArthur’s model, and the Lagrangian dual is a generalized Lotka–Volterra system. A cavity solution then gives the statistics of random quadratic programs, in agreement with numerics at M = 100. | Read |
| NOTE-1396 | Kalla and Broockman — Reducing exclusionary attitudes through interpersonal conversation | Three pre-registered, placebo-controlled canvassing experiments (6,869 voters reached at the door or by phone). In Experiment 1, a conversation with narratives exchanged non-judgmentally moved an index of immigration attitudes by d = 0.08 pooled over 4.5 months; the same conversation without the narratives moved it by 0.02 (n.s.), and the difference, 0.06, is significant. Transphobia replications give 0.08 (with or without the participants’ own narratives) and 0.04 by phone. | Read |
| NOTE-1397 | Bunin — Ecological communities with Lotka-Volterra dynamics | For generalized Lotka–Volterra dynamics of a community assembled from a pool of S species with random interactions of mean μ/S, variance σ²/S and symmetry γ, the cavity method gives exact large-S results in the phase with a unique uninvadable fixed point: a Gaussian truncated at zero for abundances, the fraction of surviving species, and a loss of stability at σ = √2/(1 + γ) for equal carrying capacities, independent of μ. Beyond it lies a multiple-attractor phase in which the outcome depends on history; that phase is located, not solved, and its history dependence is shown numerically. | Read |
| NOTE-1398 | Johansson, Hall, Sikström and Olsson — Failure to detect mismatches between intention and outcome | In a card-trick experiment, 120 people chose the more attractive of two female faces and were sometimes handed the face they had rejected. Only 13% of the 354 manipulated trials were detected at the time, at most 26% counting every form of later detection, and the detection rate did not depend on how similar the faces were. The reasons given for the rejected face did not differ from reasons given for real choices in length, emotionality, specificity or certainty, and some named features only the rejected face had. The authors call this choice blindness. | Read |
| NOTE-1399 v2 | Zhang et al. — Dynamical reversibility and causal emergence based on SVD | Measures how close a Markov transition matrix is to a permutation by Γ_α = Σσᵢ^α of its singular values, shows log Γ_α − log N ≤ EI ≤ (2/α) log Γ_α, and defines causal emergence without a coarse-graining as the rise in the average singular value when those at or below a threshold ε are dropped. With ε = 0 it is a rank test; with ε > 0 it depends on ε, and any matrix with unequal singular values shows it for some ε. Its SVD-plus-k-means coarse-graining matches EI maximization on Hoel’s Boolean networks, but its claim that the lumping commutes with the dynamics for any grouping (Proposition 5) is false. | Read |
| NOTE-1400 | Krakauer et al. — The information theory of individuality | Splits I(S_n, E_n; S_{n+1}) two ways, into A* = I(S_{n+1}; S_n) plus nC = I(S_{n+1}; E_n | S_n), or I(S_{n+1}; E_n) plus A = I(S_{n+1}; S_n | E_n), and in the 2020 version names A* organismal, A colonial and nC environmentally determined individuality, read through a partial information decomposition left unspecified. Both A* and A can only grow as variables move from environment to system, so they cannot by themselves find a boundary; the 2020 version says a size cost is needed and does not supply one. Illustrated on one two-unit system; no algorithm and no data. | Read |
| NOTE-1401 | Désidéri — Multiple-gradient descent algorithm (MGDA) | Defines Pareto-stationarity (some convex combination of the criteria’s gradients is zero), proves it necessary for Pareto-optimality, and shows that when it fails the minimum-norm element ω of the gradients’ convex hull gives a direction −ω along which every criterion decreases, with (u, ω) ≥ ‖ω‖² for every u in the hull. Steepest descent along −ω, the MGDA, has a subsequence converging to a Pareto-stationary point when the criteria are positive and coercive. The direction depends on how the gradients are scaled; the author calls the right scaling open. | Read |
| NOTE-1402 | Hazen, Griffin, Carothers and Szostak — Functional information and the emergence of biocomplexity | Defines functional information I(E_x) = −log2 F(E_x), F the fraction of all configurations that reach at least degree E_x of a stated function, and illustrates it on letter strings, random Avida genomes and GTP aptamers. Its one empirical observation is that I against E_x is stepped in Avida, which it attributes to distinct classes (“islands”) of solutions. The measure is relative to a function and to a uniform measure on configurations, and says nothing about history or identity. | Read |
| NOTE-1403 | Kleinman, Liu and Redding — International friends and enemies | A country’s real-income elasticity to a partner’s productivity, from a constant-elasticity trade model with input-output links, predicts political alignment with that partner. Instrumented by a counterfactual Chinese productivity shock from the 1980 equilibrium (119 countries, 1980–2010) or by air-versus-sea distance (pairs, 1970–2012), it moves UN voting similarity (0.094 SD per SD in the panel), lowers strategic rivalry, and raises formal alliances. The paper’s own model is strategic: alignment is a costly action a country takes to raise a partner on whom its income depends. | Read |
| NOTE-1404 | Edmondson — Psychological safety and learning behavior in work teams | In 51 work teams at one office-furniture manufacturer, a team-level belief that the team is safe for interpersonal risk taking (psychological safety) predicted members’ and outside observers’ ratings of the team’s learning behavior; team efficacy added little once safety was controlled. Learning behavior predicted observers’ ratings of performance and carried the association of safety with performance, and safety carried the association of context support and leader coaching with learning. All of it is cross-sectional. | Read |
| NOTE-1405 | Pettigrew and Tropp — Meta-analytic tests of three mediators of contact | Meta-analytic mediation tests over 54 studies of contact and prejudice that also measured knowledge of the outgroup (17 samples), intergroup anxiety (60) or empathy and perspective taking (14). All three mediate. Knowledge is much the weakest (Sobel Z = 3.87); anxiety reduction (26.6) and empathy (12.4) are strong, and in nine samples measuring both, anxiety and empathy together account for about half of the contact–prejudice covariance. | Read |
| NOTE-1406 | Revonsuo — Binding and the phenomenal unity of consciousness | Separates stimulus-related binding, neural processing that recovers a stimulus’s unity whether or not anything is conscious, from consciousness-related binding, the construction of phenomenally unified percepts, crediting the split to Smythies (1994). Distinguishes the phenomenal, neural and cognitive levels at which binding is posed, lists five kinds of phenomenal binding with the deficits that dissociate them, and argues from his own EEG result that 40-Hz synchrony accompanies constructing a unified percept, not holding it. | Read |
| NOTE-1407 | Pettigrew and Tropp — A meta-analytic test of intergroup contact theory | Meta-analysis of 515 studies (713 samples, 1,383 tests, 250,089 people, 38 countries, through 2000) of face-to-face intergroup contact and prejudice. The random-effects mean is r ≈ −.21, 94% of samples are negative, experiments give −.34, and the most rigorous samples −.32. Samples structured to meet Allport’s conditions give −.29 against −.20 for the rest, so the conditions help but are not needed; they work as a bundle. One of six publication-bias checks, Vevea and Hedges’s, leaves no significant overall effect. | Read |
| NOTE-1408 | Pettigrew — Intergroup contact theory | Pettigrew reformulates Allport’s contact hypothesis as a longitudinal theory. Contact works through four processes (learning about the outgroup, changed behavior, affective ties, ingroup reappraisal, the last yielding “deprovincialization”). Its effects generalize through a sequence of decategorization, salient categorization and recategorization. A fifth essential condition, friendship potential, joins Allport’s four; other proposed conditions are facilitating. Selection bias is real, but in European survey data the path from outgroup friendship to less prejudice is stronger than the reverse. | Read |
| NOTE-1409 | Merton — The self-fulfilling prophecy | Names the self-fulfilling prophecy, “in the beginning, a false definition of the situation evoking a new behavior which makes the originally false conception come true”, and applies it to American ethnic and racial prejudice. Beside it the essay sets a second route, “moral alchemy”, in which the in-group condemns the out-group whatever it does by renaming the same conduct. It argues that institutional change, not education or good will, breaks the circle. | Read |
| NOTE-1410 | Akkoyunlu, Ekanadham and Huber — Some constraints and tradeoffs in the design of network communications | A design paper on interprocess communication in networks of sequential processes: complete status of a transaction is impossible in an arbitrary distributed facility and, with time-outs, even in a reliable one, and the insertion property forces the system to withhold status. Its Appendix states, as a story of gangsters and a messenger who may be mugged, that no finite exchange over a lossy channel brings two parties to know they agree a message got through, with a shortest-sequence proof. That is the coordinated attack problem in substance, three years before Gray (1978), framed as mutual knowledge of delivery. | Read |
| NOTE-1411 | Seeley et al. — Stop signals provide cross inhibition in honeybee swarms | Nest-site scouts of honeybee swarms deliver stop signals, head-butts with a brief vibration, to scouts dancing for sites other than their own while the swarm is choosing (213 of 237 signals in two two-box swarms), and to all dancers once it has chosen. An ODE model, in the supplement, shows that above a critical rate of such cross inhibition a swarm facing two equal sites breaks deadlock and picks one at random, and picks the better when they differ enough. | Read |
| NOTE-1412 | Nisbett and Wilson — Telling more than we can know | Reviews dissonance, attribution, subliminal-perception, problem-solving and bystander studies, and reports eight small studies of its own, to argue that people have little or no introspective access to the processes by which stimuli affect their judgments. Their reports come from a priori causal theories, which observers given only a description share: in Nisbett and Bellows, subject and observer reports correlated .77 to .99, and both were accurate only for the judgment the culture has rules for. | Read |
| NOTE-1413 v2 | Eberhardt and Lee — Causal emergence: when distortions in a map obscure the territory | Under Hoel’s effective information, with uniform interventions at each level and macro interventions as uniform averages over micro states, the EI-optimal coarse-graining can merge micro states whose effects differ widely, so the macro variable has ambiguous manipulations; and the EI-optimal abstraction of a two-step matrix differs from the square of the one-step abstraction, so abstraction and marginalization do not commute. Both are traced to the maximum-entropy distribution, which the authors call extraneous to the system. The numbers check. | Read |
| NOTE-1414 | Ito and Kaneko — Spontaneous structure formation in a network of chaotic units | In a globally coupled logistic map whose units each renormalize their incoming weights after strengthening those from units in similar states, identical units split, in the desynchronized high-turnover regime, into a persistent core that the others attend to and a periphery the core ignores; the split needs states and weights to act on each other. Simulation only, N = 100, one parameter point in detail. | Read |
| NOTE-1415 | Chalupka, Eberhardt and Perona — Causal feature learning: an overview | A macro cause is a class of micro states with the same P(effect | man(state)); a macro intervention is any manipulation into the class, which is unambiguous by construction. The causal coarsening theorem makes the causal partition a coarsening of the observational one except on a null set, so one experiment per observational class finds it. No distribution over interventions enters the definitions. The example is a one-dimensional toy, and two displayed equations carry slips. | Read |
| NOTE-1416 | Comolatti and Hoel — Causal emergence is widespread across measures of causation | Writes a dozen measures of causal strength as functions of sufficiency and necessity, or of determinism and degeneracy, and finds every one showing causal emergence on a bipartite Markov chain whose macro is a deterministic NOT gate, under three intervention distributions; the system-level EI under the stationary distribution shows none, as data processing requires. The model is hand-built for a deterministic macro, so it is the kind of result THEORY-787’s promote_when says cannot settle it. | Read |
| NOTE-1417 | Abrego Garcia v. Noem — Order granting expedited discovery | On remand, the district court reads “facilitate” as taking the steps available toward Abrego Garcia’s release from Salvadoran custody, measures that against the government’s own past practice of facilitated returns, finds that four days of court-ordered sworn declarations disclosed no step, and orders two weeks of discovery into his custody, what was done, what will be done and who authorizes the detention. It does not decide whether return was possible. | Read |
| NOTE-1418 | Scacco and Warren — Can social contact reduce prejudice and discrimination? | A randomized field experiment with 849 young Christian and Muslim men in Kaduna: sixteen weeks of cooperative computer training in mixed or single-religion classes left stated prejudice and its supposed mediators unchanged, while mixed classes discriminated less than single-religion classes in dictator and destruction games. The control arm shows the contrast is mostly in-group bonding raising discrimination in single-religion classes; the effect toward unfamiliar out-group members holds for Christians only. | Read |
| NOTE-1419 v2 | Lemmer and Wagner — Can we really reduce ethnic prejudice outside the lab? | Contact programmes run outside the laboratory improve self-reported ethnic attitudes by about a quarter of a standard deviation in controlled designs, and the effect is still there one to twelve months later in the few studies that looked. Indirect programmes do as well as direct ones between studies; within them, stories of cross-group friendship give the largest subtype estimate (0.42, k = 8) and online interaction none in the stronger designs. No included study measured behaviour. | Read |
| NOTE-1420 | Chalupka, Perona and Eberhardt — Multi-level cause-effect systems | Defines the fundamental cause and effect of a confounded micro system as the partitions of causes by P(J | man(i)) and of effects by P(j | man(·)), learns both from experimental data, and proves they generically coarsen the observational partitions, so passive data plus one experiment per class find them. It assumes no distribution over interventions. Its claim that the effect partition is the minimal sufficient one fails for proportional, unequal columns. | Read |
| NOTE-1421 | Lynch et al. — RefraMED, the NIHR EME monograph | The full report of RefraMED. Beyond the BJP paper it gives the trial’s mechanism design and its failure: RO DBT participants were also randomised to a therapy room, written feedback and mode of reimbursement, as instruments for sessions attended, alliance and DBT skills, and the instruments were too weak to use. Without them, the decomposition of the 7-month effect is implausible, and the planned analyses of temporal order are not reported. Its adverse-event test, p < 0.01 for eight reactions in the RO DBT arm against none, does not reproduce (about 0.029), and differs from the BJP paper’s 0.004. | Read |
| NOTE-1422 | Serván and Allesina — Tractable models of ecological assembly | For competitive Lotka–Volterra communities with A = D(v)BD(w), B symmetric with positive entries, assembled by rare, low-density, well-separated invasions, MacArthur’s Lyapunov function V orders the feasible sub-communities, so the assembly graph is acyclic and every feasible sub-community can be assembled without extinctions; with the paper’s Theorem 1 this makes sequential and all-at-once assembly reach the same end-points. One end-point when B is positive definite, several when it is not. | Read |
| NOTE-1423 v2 | Kuppens, Van Mechelen, Smits & De Boeck — The appraisal basis of anger | In two recall studies, anger was associated with other accountability and unfairness, and other accountability was specific to anger, but no appraisal (goal obstacle, other accountability, unfairness, control) and no antagonistic action tendency was singly necessary or sufficient for it. Every anger report in study 2 had at least one component. The authors conclude that appraisals and emotions are contingently associated, not linked by necessity, and make no causal claim. All measures are self-reports of recalled situations. | Read |
| NOTE-1424 | Haken, Kelso & Bunz — A theoretical model of phase transitions in human hand movements | A theory paper. It takes relative phase as the order parameter of bimanual rhythmic movement and models the switch from anti-phase to in-phase at a critical frequency with φ̇ = −∂V/∂φ, V = −a cos φ − b cos 2φ, anti-phase being lost when |b| < |a|/4. It derives that equation from two self-sustained oscillators whose coupling must be nonlinear, and shows the switch and hysteresis in one simulation. The data it models are Kelso’s earlier experiments, summarized, and critical fluctuations and slowing are left to future work. | Read |
| NOTE-1425 | Morrison, Madden, Odum, Friedel & Twohig — Altering impulsive decision making | Thirty undergraduates who discounted steeply were randomized to one 60–90 minute acceptance-and-values session or a waitlist. A week later the trained group discounted hypothetical money less (interaction p = .04), while the AAQ-II and distress tolerance did not change relative to control. Pooling pre- and post-training data, discounting (d = .57) and distress tolerance improved and the AAQ-II approached significance. The waitlist group’s own post-training change in discounting was not significant. | Read |
| NOTE-1426 | Han — Model distance and equivalence (EE378C Lecture 4) | The lecture defines Le Cam’s deficiency by decision problems with losses in [0, 1], states that a model is ε-deficient relative to another exactly when a stochastic kernel brings it within ε in total variation uniformly in θ, proves the easy direction in four lines, and sketches the converse for finite Θ by one inf–sup swap whose minimax conditions are not stated. Le Cam’s distance is the larger of the two deficiencies; sufficiency, Poissonization and the regression–white-noise–density equivalences are its examples. | Read |
| NOTE-1427 | Apt — Potential Games (slides) | Apt’s slides define exact, ordinal and generalized ordinal potentials and the finite improvement property, and state, crediting Monderer and Shapley 1996, that a finite game has a generalized ordinal potential if and only if it has the FIP; one direction is proved and the converse sketched by counting improvement sequences. A two-by-two game with the FIP and no ordinal potential shows the equivalence cannot be with ordinal potentials. | Read |
| NOTE-1428 | Maitra — The Nature of Epistemic Injustice | A critical study that reports Fricker’s definitions with the book’s pages: testimonial injustice is a credibility deficit owed to the hearer’s identity prejudice, and epistemic bad luck is not one; hermeneutical injustice is a significant area of social experience obscured from collective understanding by hermeneutical marginalization, which may be systematic or incidental. Maitra argues that a deficit wrongs a speaker only where the hearer owes her a matched judgement, that bad luck and carelessly kept stereotypes can wrong her too, and that both kinds of injustice mix individual and structural prejudice. | Read |
| NOTE-1429 v2 | Abuhamdeh — Investigating the flow experience | A conceptual review finding 24 operationalizations of flow in 42 studies, 17 without enjoyment. It argues flow should be measured as Csikszentmihalyi defined it, a discrete, highly enjoyable state distinct from its conditions, and that plain absorption is task involvement, not inherently enjoyable. It reports, and rejects by argument, the view that flow is emotionless or enjoyed only afterwards. It does not show by data that flow is positive during the episode. | Read |
| NOTE-1431 | Zaibert — Collective Intentions and Collective Intentionality | A critic’s report of Searle’s 1990 paper, with its pages. Searle there calls the irreducibility of collective intentions an intuition, says “I have not demonstrated that no such analysis could ever succeed”, and rejects Tuomela and Miller’s reduction by one counterexample. Of his four analyses of the hollandaise case he favours a by-means-of intention that Zaibert shows has the same form as an individual’s firing a gun by pulling a trigger: a complex individual intention, not a collective one. Zaibert argues that intentions, unlike desires, cannot be irreducibly collective, and leaves collective desires open. | Read |
| NOTE-1433 | Kelso, Scholz & Schöner — Critical fluctuations | As bimanual wrist or finger movement is paced faster, the standard deviation of relative phase grows as the anti-phase pattern nears its switch to in-phase, peaks in the transition (about 85° mean phase, near the 90° of a uniform spread), and falls once in-phase is reached; started in-phase, the same movement shows neither a switch nor that growth. The authors take this as critical fluctuations, a mark of a nonequilibrium phase transition. Critical slowing is predicted, not measured, and the evidence is shown for a few subjects without a test. | Read |
| NOTE-1434 | Metzinger — Why are dreams interesting for philosophers? | Metzinger proposes that minimal phenomenal selfhood reduces to transparent spatiotemporal self-location, because people report a stable self in bodiless dreams and asomatic out-of-body experiences, located at an extensionless point without a body. He predicts that such self-location is necessary and sufficient for a minimal sense of self, and asks whether a phenomenally opaque self-location, experienced as a representation, has ever been observed. The paper is an agenda: its evidence is other people’s prevalence figures, which it calls ambiguous, and it reports no opaque case. | Read |
| NOTE-1436 | Putnam — Diplomacy and domestic politics: the logic of two-level games | Models international negotiation as two linked games: a chief negotiator bargains abroad (Level I) over a deal that must be ratified at home (Level II), so agreement is possible only where the domestic win-sets overlap. Win-set size depends on domestic preferences and coalitions, ratification institutions and the negotiator’s strategy, and its effects are two-edged: a small win-set is a bargaining advantage and a risk of involuntary defection. Synergistic linkage, reverberation and the negotiator’s own veto follow. Nothing in it makes the time horizons of a polity’s parts decide which part holds authority. | Read |
| NOTE-1438 v2 | Thürmer, Scheier & Carver — Coasting and shifting | Two experiments in which false feedback put one of two competing task goals (speed, accuracy) ahead of or behind target. Running ahead on one goal lowered later performance on it and raised performance on the other, so the overshot goal lost its hold to its rival; an if-then plan to ignore one’s feelings removed both effects. It is the closest the record has to a test of Carver’s thesis that positive affect lowers a goal’s priority, with small effects, one-tailed contrasts, and no check that the plan changed affect. | Read |
| NOTE-1439 | Schroeder & Prentice — Exposing pluralistic ignorance | First-year students who heard, in a peer-led discussion, that peers are privately less comfortable with campus drinking than they seem reported drinking less months later than students given a decision-making discussion. Their estimates of peer comfort did not differ by condition: the authors infer that the correction weakened the norm’s force, not its content. Men closed the self–other gap by revising their view of others, not their own attitude, the reverse of the 1993 result this paper restates. | Read |
| NOTE-1441 | Coifman et al. — Diffusion maps (full reading) | With the equations visible, the paper’s diffusion distance is the distance induced by the symmetric kernel ã^(m), D_m² = ã^(m)(x, x) + ã^(m)(y, y) − 2ã^(m)(x, y), with ã’s eigenvalues written λ_i², so that the map x ↦ (λ_i^m φ_i(x)) is an exact isometry for it. The truncation is claimed with a relative error 1 + O(e^{−αm}). Theorem 2.1, the ε → 0 heat-kernel limit of the α = 1 normalization, and the α-family (Eq. 14) are stated without proof; the sampling condition is that each ball of radius √ε hold enough points. Eq. 5 and Eq. 14 give the α = 0 potential opposite signs. | Read |
| NOTE-1442 | Fulford, Johnson, Llabre & Carver — Pushing and coasting | A 21-day experience-sampling study of 24 people (12 with bipolar I disorder in remission) found that progress ahead of expectation on a self-chosen goal was followed by less effort on it (b = −0.34) and progress behind expectation by more (b = −0.25 on the undershoot vector), and that the bipolar group coasted less. It restates Carver 2003’s thesis that positive affect lets a goal take lower priority, but measured neither affect nor any shift of effort to other goals, so it bears on that thesis only through the behaviour it predicts. | Read |
| NOTE-1443 | Mossio & Bich — What makes biological organisation teleological? | Biological organisation is intrinsically teleological because it self-determines, and it self-determines only as self-constraint: closure, a set of mutually dependent constraints that channel a far-from-equilibrium flow at a second level of causation. A cycle of transformations, such as the water cycle, is not closure. Dissipative structures do not realise closure; at most, on a contested reading, they make “a single macroscopic constraint” that acts on its own boundary conditions, and so would be minimally teleological but not organised and without functions. The paper never names differentiation or time scales as a condition: it folds the “division of labour” into closure. | Read |
| NOTE-1444 | Cialdini, Brown, Lewis, Luce & Neuberg — When one into one equals oneness | In three questionnaire studies, students imagined a near stranger, acquaintance, friend or close family member in need and chose how much costly help to give. Closeness raised empathic concern and oneness (the IOS circles plus a “we” item), and both predicted helping; with oneness entered, empathic concern dropped to non-significance in every test, while oneness kept predicting. The authors read empathic concern as an emotional signal of oneness and call the helping “nonaltruistic”, not egoistic. All helping is hypothetical and the case is regression on correlated ratings. | Read |
| NOTE-1445 | Berdini — Rationality as the Normative Dimension of Speech Acts | Berdini rejects Searle’s rule-based account of the deontology of speech acts. Meaning cannot fix which act is performed, so she adopts Bach and Harnish’s inferential model, in which the hearer infers the speaker’s expressed attitude from what is said, mutual beliefs and presumptions. She quotes Bach and Harnish that illocutionary acts at best create mutual beliefs about rights and obligations, which they call a moral question. She proposes, without argument, that the presumption of the interlocutor’s rationality is the basic normativity of communication. | Read |
| NOTE-1446 | Shipman & Marshall — Formality considered harmful | From the authors’ experience with hypermedia, design-rationale, knowledge-based, groupware and software-engineering systems: users resist making structure, content or procedure explicit, and are often right to. Formalisms cost cognitive overhead, demand tacit knowledge be stated, commit people to structure too early, and fit only one person, group or task; “there is always information that falls between the cracks”. Designers should formalize only what the task needs, infer structure from informal material, and support incremental formalization and restructuring as the task is reconceived. Read in the authors’ web version, earlier than the 1999 journal text. | Read |
| NOTE-1447 | Vissio — Reasoning in Life | Vissio reads Canguilhem’s vitalism as an attitude, not a metaphysics: to live is to evaluate a milieu and institute norms. Disease is a change in vital norms that leaves the organism “confined and reduced in its capacity to change these norms”, and normativity is the “ability or capacity to redefine vital norms”. Social norms, Canguilhem argues, are different in kind because no regulatory apparatus integrates a society as one, so there is no social pathology; yet human reason and science answer to a vital exigency. | Read |
| NOTE-1448 | Nord — Translating as a purposeful activity: a prospective approach | Nord states functionalist translation in brief. A text is an offer of information that different receivers take differently, so translation aims at the purpose the target text is to serve for a particular audience under the brief. Phatic, referential, expressive and appellative functions each need conditions in the receiving culture. Where those differ, the translator either adapts the function to work (instrumental) or explains how it worked (documentary). Neither is better in general, and equivalence is often neither required nor desired. | Read |
| NOTE-1449 | Kelso, Scholz & Schöner — Dynamics governs switching | Four people switched on cue between in-phase and anti-phase finger movement. Going from in-phase to anti-phase took about twice as long as the reverse at every frequency tested, with a longer-tailed distribution, significant for each subject. A stochastic HKB equation with the earlier experiments’ parameters plus a term pulling relative phase toward the intended pattern reproduces the asymmetry and the shapes, with one parameter set to the right order of magnitude: the less stable a pattern, the faster it is left. Loss of stability before spontaneous switches is cited, not shown. | Read |
| NOTE-1450 | Orehek, Bessarabova, Chen & Kruglanski — Positive affect as feedback | Positive affect, induced by pictures after students promised to do something for someone close, lowered the goal’s activation and the stated intention to pursue it when competing goals were salient, and raised both when they were not. So positive affect lowers a goal’s priority only under competition; alone, it strengthens the goal. The affect was incidental, not generated by progress, and Experiment 1’s measure is one reaction time per person. | Read |
| NOTE-1451 | Nida — Principles of Correspondence | Nida sets out formal and dynamic equivalence. Formal equivalence matches the message’s form and content and suits gloss translations with notes. Dynamic equivalence follows the principle of equivalent effect: the receptor’s relation to the message should be substantially what the original receptors’ was, as in Phillips’s handshake for the holy kiss. It is “the closest natural equivalent” to the source message, natural to the receptor language, the message’s context and the audience. It must still reflect the source’s meaning and intent, with meaning before style. There is no single right answer. | Read |
| NOTE-1452 | Giroux — Can populations be healthy? | Giroux argues against Canguilhem that health can be a property of populations. His restriction of health to the individual organism rests on normativity, which he locates in organic totalities, and on a Darwinism centred on individuals; both are weakened by later debates on units of selection and individuality. Social epidemiology supplies population-level comparisons, integral variables such as herd immunity, and Rose’s distinction between causes of cases and causes of incidence, which justify a population health that is relatively autonomous but less unified than an organism. The paper also quotes Canguilhem’s definition of health as the capacity to institute new norms. | Read |
| NOTE-1453 | Harnish — Commitments and Speech Acts | Harnish sets the Gricean expressed-attitude theory against normative theories of illocution. On Bach and Harnish, communicative acts are individuated by the attitude the speaker expresses, that is, reflexively intends the hearer to take the utterance as reason to ascribe. Institutional acts are a separate class. Searle’s account of how speech creates commitment is unexplained, and Alston’s rule-subjection analysis fails. Expressing the belief that P and taking responsibility for P may be equivalent, so the normative theory may be the same facts redescribed. Teasing and the audience’s standing are not discussed. | Read |
| NOTE-1455 | Holton — Identification (24.120 lecture XIX) | Lecture notes on Frankfurt’s “Identification and Wholeheartedness”. As reported, identification there is acceptance by decision, not a higher-order desire or an endorsement. Deciding that no further checking is warranted “resounds endlessly” and seems to need the anticipation that reviews will confirm it (pp. 168–169); deciding between conflicting desires makes the loser an “outlaw” (p. 170), with no resonance needed. Holton objects that Frankfurt never analyses the decision, and that deciding cannot guarantee wholeheartedness when pairwise preferences are intransitive. | Read |
| NOTE-1456 | Stockton et al. — Mechanisms of change in ACT | Twelve mediation studies (2006–2015) of ACT against an active treatment. Psychological flexibility mediated mental-health outcomes in four of five, and acceptance was the one process to mediate across kinds of outcome and distinctly for ACT. Defusion and committed action mediated in both treatments. Present-moment contact and values were tested once each and the self as context never. All twelve studies were of moderate quality, and only three showed the mediator changing before the outcome. | Read |
| NOTE-1457 | Fischer — The Frankfurt Cases: The Moral of the Stories | Fischer’s reply to the Dilemma Defense. If indeterminism holds, buffer cases remove every robust alternative; if determinism holds, a case can assume it without assuming it removes alternatives, so that determinism and Black’s device together, and neither alone, remove them. The moral is conditional: if determinism rules out responsibility, it is not by eliminating alternatives. Fischer allows that determinism may still rule it out another way, such as by removing sourcehood, and rejects Widerker’s demand that a Frankfurt case satisfy IRR. | Read |
| NOTE-1458 | Barad — Nature’s Queer Performativity | Barad argues that what classical ontology treats as separate things with fixed properties are phenomena, relations without prior relata, and that an intra-action within a phenomenon enacts an agential cut: “a ‘local’ resolution within the phenomenon of the inherent ontological indeterminacy”, giving agential separability, not absolute separation. The case is made by reading lightning, stingray receptor cells, Pfiesteria and the quantum-eraser experiment as failures of classical identity and causality. It is an essay; the physics is cited and interpreted, not argued from, and the term “apparatus” is used only of the two-slit set-up. | Read |
| NOTE-1459 | Timpe — Source Incompatibilism and Its Alternatives | Against the received split between leeway and source incompatibilism. Mere alternatives cannot meet a control condition, so any acceptable incompatibilism rests on ultimacy; and ultimacy needs indeterminism, which leaves more than one open future, so it entails an alternative-possibilities condition, though perhaps only for non-robust, involuntary alternatives that do no explanatory work. The best source incompatibilism is therefore “wide”, and the taxonomy should go. Timpe counts Pereboom among those who keep an alternatives condition while making the source condition more fundamental. | Read |
| NOTE-1460 | Mitra, Singhal & Buckley — Improving automatic query expansion | Pseudo-relevance feedback expands a short query with terms from its top-ranked documents, and hurts when those documents are off-topic: the authors name the harm query drift, “the alteration of the focus of a search topic caused by improper expansion”. Reranking the top documents before feedback, by hand-made Boolean filters or by an automatic score that rewards matches on uncorrelated query terms, raises average precision over plain expansion on TREC 3–6, by 7–22% for the manual and 6–13% for the automatic method, and cuts the queries that expansion hurts from 64 of 199 to 43 or 50. | Read |
| NOTE-1461 | Mossio, Montévil & Longo — organization as a theoretical principle | Proposes organization, understood as closure of constraints, as one of two theoretical principles for biology, the other being variation (treated in a companion paper). A principle is posited a priori, as physics posits its phase space, and it defines the domain: any system meeting both principles is biological, organisms being one class. The paper restates Montévil and Mossio’s definitions of constraint, dependence and closure, and argues without a model that closure grounds biological stability by regenerating constraints beyond their own time scales, and that it also propagates variation, so a local change can end in a new closure; rocks, flames and tables, it says, cannot do that. | Read |
| NOTE-1463 | Liang, De Los Rios & Busiello — Thermodynamic space of reaction networks | For any open mass-action reaction network at a stationary state, each reaction’s affinity is bounded by the extremal cycle affinities, per use of that reaction, over the elementary flux modes containing it, and each product of concentrations is bounded by the effective equilibrium constants of the extremal pathways that produce it. A fictitious, infinitely slow “chemical probe” reaction extends the bounds to species no reaction connects. The resulting thermodynamic space has zero width at equilibrium. Bistability (Schlögl), chiral symmetry breaking, dissipative self-assembly and pattern contrast all lie inside it, and measured concentrations outside it falsify a proposed topology. | Read |
| NOTE-1464 | Rao & Esposito — Thermodynamics of open chemical reaction networks | Builds the nonequilibrium thermodynamics of open, deterministic, mass-action networks of reversible elementary reactions on top of the rate equations, as stochastic thermodynamics is built on master equations. Chemostatting a species either breaks a conservation law or opens an emergent cycle; a network with no emergent affinity relaxes to a unique equilibrium, and a steady state dissipates the sum of emergent currents times emergent affinities. The minimal chemical work to hold a network away from equilibrium is a relative entropy of concentrations, a nonequilibrium Landauer principle. For complex-balanced networks the dissipation splits into a non-negative steady and a non-negative transient part. | Read |
| NOTE-1465 | Santolin et al. — Freidlin-Wentzell and stochastic thermodynamics | For overdamped diffusions with weak noise and a nonconservative force, the Freidlin–Wentzell quasi-potential is expanded about the detailed-balance free energy, each order integrated along the detailed-balanced relaxation, and the first order saturates the emergent second law. The weak-noise escape rate from an attractor is bracketed below by minus the entropy produced in relaxing into it and above by the entropy produced along the most likely escape path. The bracket closes at detailed balance and widens with the nonconservative force; in a sheared double well it stays usefully narrow for weak shear. | Read |
| NOTE-1466 | Saligrama — information before commitment in safe adaptive control | A safe adaptive controller must stay safe under every model it has not ruled out. Its first action that leaves no safe continuation under an alternative is a commitment, and the evidence for it must be in hand before the action: what that action reveals comes too late. With the information gathered before commitment measured as a KL divergence between stopped records, a data-processing argument bounds any uniformly safe policy’s regret below by the cost of not committing with probability ½e^{−I_pre} − α. So bounded pre-commitment information leaves a fixed fraction of the oracle gap, and a linear gap gives linear regret. Safe recovery at O(√(T log T)) is proved when a safe experiment is repeatable, informative and returns to a common state. | Read |
| NOTE-1467 | Hennick & De Baerdemacker — Almost Bayesian | Models late-training SGD as sub-diffusion on a “porous” loss landscape, with the local learning coefficient as the medium’s fractal dimension and a spectral dimension d_s fitted from displacement, R(t) ∝ t^(d_s/2λ). Where an effective scalar diffusion coefficient D_ξ is constant on a region, the steady state there is exp(−L/D_ξ), which is the Bayesian posterior tempered to an effective sample size 1/D_ξ. That within-region statement is all the derivation gives: how mass is shared between regions, which is where “accessibility” would act, is not derived, and in the one test it is fitted through a length scale. Displacement exponents are measured on MNIST MLPs, TinyStories models and ImageNet convnets. | Read |
| NOTE-1468 | Remlein, Esposito & Avanzini — Open reaction networks emerging in closed ones | Shows that a closed reaction network behaves, to leading order, as an open chemostatted one when two conditions hold together: exchange reactions much faster than the rest (time-scale separation) and reservoir species much more abundant than the rest (abundance separation, a diverging chemical capacity). In that regime the chemical master equation, local detailed balance, entropy production and Gibbs balance of the open network all emerge. The regime lasts from the equilibration of the exchange reactions to a time of order the abundance ratio Ω, after which a driven network relaxes to the closed system’s equilibrium. Chemostats are emergent structures, not external idealisations. | Read |
| NOTE-1469 | Richens, Abel, Bellot & Everitt — general agents contain world models | In a fully observed, finite, communicating, stationary controlled Markov process, a deterministic goal-conditioned policy whose success probability is within a factor 1 − δ of optimal for every composite goal of depth up to n determines every transition probability to within √(2P(1−P)/((n−1)(1−δ))), and the estimate is computed from the policy alone, by asking it to choose between “at most k successes of this transition in n tries” and “more than k”. An optimal myopic policy determines nothing. “Contains a world model” means exactly this: the transition function is recoverable from the input-output map. The authors say it shows “the existence of a world model encoded in the agent’s policy, not its specific use”, and the recovery map runs from the policy, not the activations, so it holds of any implementation of the same map, a lookup table over histories and goals included. | Read |
| NOTE-1470 | Teoh — Multi-token prediction done right | The cross-entropy gradient of a multi-token-prediction head, taken at its hidden state under a shared output head, is exactly a forward-KL self-distillation gradient toward the model’s own position-aligned next-token prediction plus the next-token cross-entropy gradient at the aligned state; a straight-through routing removes the second from the heads and trunk at no cost, and at 167M–1.2B this improves next-token loss, speculative decoding and zero-shot accuracy by small margins in single runs. In the main (DeepSeek-style) experiments the student head sees the same tokens as its teacher, so the decomposition is not an information projection. | Read |
| NOTE-1471 | Wu, Yang & Sun — Self-training: denoising vs. signal forgetting | In overparameterized linear regression, iterating self-training with fresh covariates, noiseless pseudo-labels and minimum-norm students multiplies the estimate by a fresh random orthogonal projection each round. Noise inherited from the first fit decays geometrically; signal along a direction of variance s decays at the slower rate s/(s + τ). Risk is therefore U-shaped when the covariance is anisotropic, monotone when it is isotropic, and tends to the risk of predicting zero. Each student fits its teacher exactly on its own sample while losing the teacher’s function elsewhere. | Read |
| NOTE-1473 | Mandt, Hoffman & Blei — variational analysis of constant SGD | The first version of Mandt, Hoffman and Blei’s argument: constant-rate SGD as an Ornstein–Uhlenbeck process near a non-degenerate optimum, whose Gaussian stationary distribution can be fitted to a Gaussian posterior by choosing the rate, batch size and preconditioner, with SGFS analysed the same way and a variational EM scheme for hyperparameters. Every result reappears, with the same numbers, in the 2017 JMLR paper, which adds momentum, constant-rate SGLD and iterate averaging; this one has nothing the later one lacks. | Read |
| NOTE-1474 | Vellela & Qian — Schlögl model, stochastic and thermodynamic | The Schlögl model A + 2X ⇌ 3X, B ⇌ X, treated by rate equation, chemical master equation and nonequilibrium thermodynamics. Bistability needs the chemostats out of equilibrium; the master equation has one stationary distribution with two peaks, so in the long run which state the system occupies does not depend on where it started; the slow eigenvalue, exponentially small in volume, is the sum of the two escape rates; the more stable state can have the higher or the lower entropy production. The paper’s asymptotic rate formula carries a spurious factor 1/V, so the “breakdown” of asymptotics it reports at small volume is mostly that factor. | Read |
| NOTE-1475 | Mandt, Hoffman & Blei — SGD as approximate Bayesian inference | Constant-rate SGD, modelled near a minimum with positive-definite Hessian A and constant gradient-noise covariance BBᵀ as an Ornstein–Uhlenbeck process, has a Gaussian stationary distribution with covariance solving AΣ + ΣA = (ε/S)BBᵀ. Choosing the rate, batch and preconditioner to minimise KL to the Gaussian posterior gives closed forms, and the preconditioner (2S/εN)(BBᵀ)⁻¹ matches the posterior at sample size N exactly. The paper is about the stationary regime of a regular model in one basin: it sets the search phase aside, and nothing in it relates training time to sample size beyond iterate averaging, whose covariance falls as 1/(examples processed). | Read |
| NOTE-1476 | Dal Cengio, Lecomte & Polettini — Geometry of nonequilibrium reaction networks | Extends the Hill–Schnakenberg cycle analysis from linear networks (graphs) to interacting ones (hypergraphs) by row reduction of the stoichiometric matrix: cycles span its kernel and carry steady currents and non-conservative affinities, cocycles span the orthogonal complement and carry transient currents and conservative forces, with an integrator that recovers chemical potentials. One chemostat cannot drive a network; two can. Suppressing the reactions of a cocycle creates a new conserved quantity. Near equilibrium the relaxation and driven-response Onsager matrices share their spectrum, and the cycle decomposition gives a linear-regime reconstruction of metabolic fluxes that respects Kirchhoff’s laws. | Read |
| NOTE-1477 | Kolathaya & Ames — input-to-state safe control barrier functions | Defines input-to-state safety of a set C = {h ≥ 0}: under a bounded input disturbance d, the larger set C_d = {h + γ(‖d‖∞) ≥ 0} is forward invariant, for a class-K γ. A barrier condition with a disturbance term, ḣ ≥ −α(h) − ι(‖d‖), implies it (Theorem 1). Given an ordinary control barrier function, adding L_g hᵀ to a safeguarding controller, or the constraint term −εL_g h L_g hᵀ in a CLF–CBF quadratic program, yields such a function with ι(‖d‖) = ‖d‖²/(4ε) (Theorem 2). The enlargement is a class-K function of the disturbance bound in barrier units, quadratic in the universal construction; it is not proportional to the bound. | Read |
| NOTE-1478 | Mobahi, Farajtabar & Bartlett — Self-distillation amplifies regularization | For ℓ2-regularized regression in a Hilbert space with a fixed training-error tolerance, refitting to one’s own predictions on the same inputs multiplies the labels’ eigencomponents by d_k/(c_t + d_k), where the multiplier c_t must grow as the labels shrink. Rounds therefore amplify regularization, relatively suppress small-eigenvalue components and collapse the solution to zero after finitely many rounds. A few rounds can help and more hurt, which ResNet and VGG runs on CIFAR echo by fractions of a point. The loss comes from the regularizer, not from any information withheld from the student. | Read |
| NOTE-1479 | Hossain, Kousar & Tourni — Overcoming scaling limits in on-policy self-distillation | On-policy self-distillation from a privileged-context teacher does most of its supervising on failed student trajectories, where the teacher’s advantage depends on the reference the student cannot see; Proposition 1 gives the forward-KL optimum as the context-averaged teacher with the conditional mutual information as irreducible loss. Restricting supervision to verified on-policy trajectories and using the student’s own failed attempt as the teacher’s context keeps the gain over the base model at 3.2–3.8 points from 1.7B to 8B, where standard OPSD’s falls to 0.14, in single runs. The trained objective clips each vocabulary entry and is not a forward KL. | Read |
| NOTE-1480 | Barato & Seifert — thermodynamic uncertainty relation | For counting currents in nonequilibrium steady states of finite Markov jump networks, the total entropy produced over time t times the squared relative uncertainty of the current is at least 2k_BT, whatever t. The letter proves this within linear response and, for unicyclic networks, at any affinity, with the sharper unicyclic bound (A/N) coth(A/2N); for multicyclic networks far from equilibrium it gives numerical evidence on seven networks and states the general case as a conjecture. | Read |
| NOTE-1481 | LaMont & Wiggins — thermodynamics and inference | Takes the evidence as a partition function with sample size N as inverse temperature, and reads off the thermodynamic derivatives. The internal energy is the leave-one-out predictive loss; the heat capacity becomes a “learning capacity” equal to K/2 in a regular model (equipartition) and to Watanabe’s learning coefficient in a singular one, and smaller when prior or discreteness fixes parameters (“freeze-out”). A prior making the Gibbs entropy zero reproduces AIC. The correspondence is formal; nothing in it is a physical current or dissipation. | Read |
| NOTE-1482 | Bencherki — A pre-individual perspective to organizational action | After Simondon, action is pre-individual: it is not an agent’s deed but a difference that contributes to the individuation of persons and organizations at once, and authorship is an outcome. Affect is how a person finds a pre-individual load that only a collective individuation can resolve, and its refusal is felt as disindividuation. An action’s signification is its participation in an individuation. The illustration, a documentary on military spouses, sorts the army’s treatment of the women’s actions into co-individuation, channeling and usurpation. | Read |
| NOTE-1483 | Bencherki & Iliadis — Organization as informational individuation | Proposes Simondon’s informational individuation as the theory of communication that CCO research lacks. Information is a differential of action potential between differently ordered domains; communication is its kin-to-kin propagation, which orders each domain it crosses; meaning is that reordering; organizations and members are coexisting informational levels, not stages. Four propositions and one meeting excerpt; no test, and agency is not theorized. | Read |
| NOTE-1484 | Bencherki, Brummans & Vézy — Agency without agents | A conceptual paper. Agency is redefined, after Massumi and Simondon, as the affective force that governs a transition between individuation processes toward an augmented ability to act. It is expressed in a communicative event in which one process takes up another’s excess action, and it may start a collective transindividuation. Agents are its effects, not its sources. It is illustrated by rereading one meeting from Cooren’s MSF ethnography. The paper gives a vocabulary for redescription, with no criterion that would let an observation count against it. | Read |
| NOTE-1485 | Iliadis — Informational ontology | An exegesis of Simondon as a philosopher of information who extends cybernetics. Information is the resolution of a disparity between two domains of a metastable system, not a signal in a channel; transduction produces “a new informational structure, one that resolves a disparity between fields”. Its evidence is quotation from L’individuation psychique et collective; it proposes, and does not test, an “individuative methodology” for communication research. | Read |
| NOTE-1487 | Wilhoit — Ventriloquism’s methodological scope | A short reply to Cooren (2014). Montréal School CCO’s commitment to interaction makes conversation analysis its method of choice, so ventriloquism carries epistemological and methodological commitments that other communication traditions will not share, and it cannot be the open metamodel Craig (1999) called for. Dialogue is instead coming from CCO studies that use other methods. It says nothing about agents being entified. | Read |
| NOTE-1488 | Massumi and McKim — Of Microperception and Micropolitics | An interview, not an argument with evidence. Affect is the felt transition of a body’s power to affect and be affected toward a diminished or augmented capacitation, offered as a proposition to be regenerated in each use, not a definition to apply. Microshocks prime bodies differentially; affect is reactivated in each event, not transmitted between them; micropolitics modulates collectively felt, unacted-out potential toward a “symbiosis” of contrasting tendencies. | Read |
| NOTE-1489 | Tsoukas & Chia — On organizational becoming | A conceptual paper. It reverses the priority of organization and change. Change is the reweaving of actors’ webs of beliefs and habits as they accommodate new experience. It is driven by the radial structure of categories, whose nonprototypical applications extend them, and by human reflexivity. Organization is both the attempt to stem that change and the pattern that emerges from it. Its illustrations are other researchers’ ethnographies. Its becoming is carried by human agents. | Read |
| NOTE-1490 | Baumgartner & Casini — abductive theory of constitution | Mutual manipulability fails in every case, not some: the surgical interventions it needs cannot exist, and relaxed ones are all fat-handed, so every constitutive model has a pure common-cause model with the same correlations under all manipulations. Unlike causal underdetermination, this survives ideal experimental conditions, because the manipulation itself confounds; there is no crucial experiment for constitution. Their alternative defines constitution by the impossibility of decoupling: a redundancy-free set of parts such that every cause of the phenomenon is a common cause of it and some member, and no expansion of the variable set breaks this. The inference is abductive and only inductively corroborated. | Read |
| NOTE-1491 | Craver & Bechtel — top-down causation without top-down causes | Within levels of mechanisms, talk of top-down and bottom-up causation can be translated into mechanistically mediated effects: intralevel causal chains plus the constitutive relation between a whole and its components. On this account the relation between levels is constitution, not causation. The paper also concedes that the experiments used to find components are symmetrical, share a form with Mill’s methods, and show only prima facie that something is a component rather than a background condition. So they do not by themselves say where a mechanism’s boundary lies. | Read |
| NOTE-1492 | Bechtel & Abrahamsen — dynamic mechanistic explanation | A dynamic mechanistic explanation joins a mechanistic account of parts, operations and organization to a computational model whose variables are properties of those parts and operations. In circadian research the parts came first, from experiment, and six kinds of modelling result follow (C1–C6). In cognitive science the models posit their mechanisms and are checked only by fit to behaviour. That makes them how-possibly accounts, and leaves competing architectures underdetermined. Two of the paper’s cases bear on the record: clamping a variable in a grounded model to test componency (C3), and the open question whether peripheral clocks are self-sustained or damped oscillators driven by the SCN (C6). | Read |
| NOTE-1493 | Baumgartner & Gebharter — fat-handedness | If a mechanism’s macro behaviour supervenes on its constituents’ behaviours and constitution is non-causal, every cause of the macro behaviour is a common cause of it and of some constituent’s. Under Woodward 2003 no top-down intervention can then change a constituent, so mutual manipulability entails that nothing constitutes anything; under Woodward’s relaxed interventions it makes whole and part causally related; with a temporal clause it is consistent but its mutual manipulations are all fat-handed and fit a model with no constitution equally well. Constitution is supported only by the second-order fact that no surgical cause of the whole turns up as the variable set grows. | Read |
| NOTE-1494 | Baumgartner, Casini & Krickel — horizontal surgicality | Upper and lower levels of a mechanism can only be manipulated via common causes, so an interventionist analysis of constitution needs a restricted kind of fat-handed intervention. Counting every common cause whose effects stand in supervenience begs the question; counting every common cause cannot tell constituents from sterile effects or detached parts. An intervention that directly changes at most one behaviour on each lower level, and changes its target and the phenomenon simultaneously, is horizontally surgical. Given that every change in a phenomenon is simultaneously realized on every lower level, that simultaneous changes are not causally related, and that co-occurrence is transitive, one such intervention suffices for constitution. The proof presupposes settled parthood and levels. | Read |
| NOTE-1495 | Metzinger — The myth of cognitive agency | Mind-wandering is a recurring, unnoticed loss of M-autonomy, the veto-centred ability to control one’s own mental processes. Most conscious thought is subpersonal mental behaviour, and a thought becomes the person’s only when integrated into a transparent “epistemic agent model”. The paper states that we lack M-autonomy for about two thirds of conscious life; its own minutes give 52%. | Read |
| NOTE-1496 | Metzinger — The problem of mental action | Mental action, which has no sensory sheet in its loop, is cast as predictive control of effective connectivity aimed at the epistemic value of states in the self-model. Mind-wandering supplies a competition among candidate thoughts that control selects from. Whether the conscious epistemic agent model constitutes the control, represents and enables it, or is a by-product, the data “do not help to decide”, which leaves open what M-autonomy stated as a principle. | Read |
| NOTE-1497 | Metzinger — M-Autonomy | M-autonomy is the capacity for second-order mental action, centred on veto. What mind-wandering loses is not the ability but its representation in the self-model, the “epistemic agent model”, and an ability can be deliberately exercised only when it is so represented. The return of control is represented as self-caused even when an unconscious event caused it. The paper repeats the 2013 estimate of two thirds, which its own minutes do not give. | Read |
| NOTE-1498 | Metzinger — Minimal phenomenal experience | A conceptual paper. It proposes “minimal phenomenal experience”, the phenomenology of pure awareness in meditation, as the entry point for a minimal-model explanation of consciousness. Six phenomenological constraints are drawn from contemplative and Western texts and illustrated by sixteen quoted reports. The hypothesis: pure awareness is a temporally thin, nonegoic model of the organism’s tonic alertness, “an internal model of an epistemic space”. It has representational content, lacks a first-person perspective, time, space and even phenomenal oneness, and cannot itself be remembered. | Read |
| NOTE-1500 | Ryan et al. — We know this much is (meta-analytically) true | A narrative synthesis of 60 meta-analyses bearing on self-determination theory, written by its co-founder and colleagues, not preregistered. It finds the support concentrated in cognitive evaluation, organismic integration and basic needs theory; one or two meta-analyses each for causality orientations and goal contents; none for relationships motivation theory, and none of basic-need frustration. Most pooled effects are cross-sectional correlations with high heterogeneity. Integrated regulation is not separated from identified regulation in the meta-analyses it reports. | Read |
| NOTE-1501 | Vaswani et al. — Attention is all you need | The Transformer: an encoder–decoder built only from multi-head scaled dot-product attention and position-wise feed-forward layers, with sinusoidal position encodings. Attention maps a query and key–value pairs to a weighted sum of the values, the weights set by the query’s compatibility with each key. It reached 28.4 BLEU on WMT 2014 English– German and 41.8 on English–French at a fraction of earlier training cost, and transferred to constituency parsing. | Read |
| NOTE-1502 | Sheldon, Elliot, Kim & Kasser — What is satisfying about satisfying events? | Three studies (N = 315, 352 across the USA and South Korea, 233) asked students for their most satisfying event of the last month, week or semester and rated ten candidate needs within it. Self-esteem, autonomy, competence and relatedness were the most salient in every sample and the strongest correlates of event affect; in simultaneous regressions self-esteem was the largest unique predictor in Studies 1 and 3 (β = .28, .38). The authors concluded “there may be four fundamental psychological needs, not three”, and called treating self-esteem as an outcome “imprudent”. Security emerged in unsatisfying events; money–luxury was last throughout. | Read |
| NOTE-1503 | Ben-Tal, Goryashko, Guslitzer & Nemirovski — Adjustable robust solutions | For an uncertain LP whose variables split into here-and-now ones and adjustable ones chosen after the data are revealed, the Adjustable Robust Counterpart (∀ data ∃ adjustment) can be much less conservative than the usual Robust Counterpart (∃ one solution ∀ data); they coincide under constraint-wise uncertainty. The ARC is usually NP-hard; restricting adjustments to affine functions of the data (AARC) is tractable with fixed recourse. Each variable may have an information basis, a prescribed portion of the data it can depend on; in an inventory example, poorer information bases raise cost and the non-adjustable RC is infeasible. | Read |
| NOTE-1506 | Sánchez-Cañizares — Decision-making through irruption theory | Uses the Haken–Kelso–Bunz potential with parameters switched in time (no landscape, then two wells, then one) as a model of binary decisions, and compares the resulting rise and fall of the across-trial standard deviation of cos φ with trial-to-trial variability of event-related potentials in Sergent et al. 2021, Wolff et al. 2019 and 2021 and Hua et al. 2025, qualitatively only. It reinterprets Froese’s irruption as the onset of a two-attractor landscape and absorption as the passage to one (IAT*), reversing the sign of Froese 2024’s variance hypothesis. The mind’s role is to set the control parameters, “selecting the relevant physical coarse-graining”, which is not derived and is said to be underivable. Re-simulation confirms the trend, but under the stated noise the deviation settles near 0.40, not 0. | Read |
| NOTE-1507 | Slemp et al. — Interpersonal supports for basic needs, a meta-analysis | A psychometric meta-analysis of 881 samples (4,561 effect sizes, N = 443,556), over 70% cross-sectional, almost all recipient-reported. Perceived autonomy, competence and relatedness support each correlate strongly with satisfaction of all three needs (ρ = .44–.62) and negatively with their frustration (ρ = −.20 to −.55), and with autonomous motivation, life satisfaction and positive affect; weakly with performance (ρ = .14–.25). The three supports intercorrelate .67–.71; in a joint model, relatedness support carries relatedness satisfaction and autonomy support adds nothing to it (β = .007). Individualism moderated 2 of 18 relations; heterogeneity was very high (I² mostly above 90%). | Read |
| NOTE-1508 | Jennings — Attention as the Source of a Free Will | A hybrid account of attention: prioritization by a subject that is a collection of fixed, formed and fluid interests, distinguished from filtering by feedback from dorsolateral prefrontal cortex. The subject’s power over its interests is said to be contextually emergent, made possible by a boundary from its context, and visible in phase-amplitude coupling. Attention breaks stalemates between equally weighted interests and forms new ones, which the paper offers as the source of a free will without Kane’s indeterminism. The metaphysics is argued from an analogy with Bénard cells, and the neural evidence does not separate it from the weakly emergent models it rejects. | Read |
| NOTE-1509 | Kermavnar et al. — A systematic map of need-fulfillment scales | A PRISMA review (searched 21 August 2023) finding 31 original self-report scales of need fulfillment in 32 primary studies, 23 of the scales based on self-determination theory, and 89 adaptations. 21 of the 31 measure satisfaction only; one measures frustration only, one thwarting, four satisfaction and frustration. The review finds the field’s terms used interchangeably, frustration items that are negatively worded satisfaction items (the BPNSFS among them, after Murphy et al. 2023), double-barrelled items, and inconsistent response formats. It names no criterion for need-hood and declines to take a side on the two-dimensional model. | Read |
| NOTE-1510 | Levine et al. — Need frustration, negative affect and depressive symptoms | Two cross-lagged panel studies of university students: three waves over the 2018–19 academic year (N = 379) and two waves six weeks apart at the start of the COVID-19 pandemic (N = 235). Need frustration (the nine dissatisfaction items of the BMPN) predicted later depressive symptoms (β = .13 and .17; .18) and later negative affect, while negative affect predicted neither later depression nor, at the first lag, need frustration; depression predicted later need frustration at the first lag of Study 1 (β = .20). Other-reported depression was predicted marginally (β = .14, p = .074). Self-report, single-construct outcome, no random intercepts in the reported models. | Read |
| NOTE-1511 | Klyubin, Polani & Nehaniv — Empowerment (2005) | The first statement of empowerment: the Shannon channel capacity from an agent’s n-step action sequence to its sensor n steps later, max_{p(aⁿ)} I(Aⁿ; S_{t+n}), counted only as far as the agent can perceive. Used as a fitness function in a grid world with a signal source, it evolves sensors that switch from displacement-sensing blobs near the source to bearing-sensing arcs far from it, and actuators that vary more, with empowerment bounded by the sensor’s capacity. | Read |
| NOTE-1512 | Marks, Lindsey & Olah — The Persona Selection Model | A named statement of an existing idea: pre-training teaches a language model a distribution over personas, post-training updates it into a posterior over Assistant personas, runtime context conditions it further, and the Assistant’s traits are a key determiner of behaviour. The evidence is surveyed, not new. Its open question is exhaustiveness, laid out as a spectrum from the “shoggoth” through the “router”, which swaps personas without any persona having the goal, to the “operating system”. | Read |
| NOTE-1513 | Chirkov, Ryan, Kim & Kaplan — Differentiating autonomy from individualism | 559 students in South Korea, Russia, Turkey and the USA rated their reasons (external, introjected, identified, integrated) for engaging in practices typical of horizontal and vertical individualism and collectivism. For every type of practice, the relative autonomy of one’s reasons predicted a well-being composite (β = .24–.29), with no country × autonomy or gender × autonomy interaction. Vertical practices were far less internalized than horizontal ones (mean index 1.60 against 4.68). Cross-sectional self-report; the authors’ definition of autonomy as volition is the paper’s thesis and its measure. | Read |
| NOTE-1514 | Klyubin, Polani & Nehaniv — Keep your options open | Empowerment, n-step channel capacity from actions to a later sensor, set in an interventional causal-network framework and extended to contextual empowerment, capacity with side information, which is never lower than the context-free value. In a cart-pole, greedy empowerment maximization balances the pole with no task given, though the states of highest empowerment are unreachable; it drives a sensor’s layout to switch between niches; and in a Sony AIBO, an evolved two-state context automaton recovers whether a book is present. | Read |
| NOTE-1515 | Patrick et al. — Need fulfillment in relationship functioning | Three correlational studies of romantic relationships, mostly of women students. Perceived fulfillment by the partner of the needs for autonomy, competence and relatedness correlates with satisfaction (r = .72, corrected, N = 1,918), commitment, secure attachment and less defensiveness; relatedness is the strongest unique predictor of relationship outcomes; the partner’s fulfillment adds to one’s own in couples; and autonomous reasons for being in the relationship carry the association with post-disagreement satisfaction in a diary study. The autonomy and competence subscales correlate .96 once corrected. | Read |
| NOTE-1516 | Anastassiou et al. — Ephaptic coupling of cortical neurons | In rat cortical slices with synapses blocked, LFP-sized extracellular fields applied by an electrode moved somatic membrane potential by less than 0.5 mV, undiminished to 100 Hz, and with spiking driven by current they shifted spike timing without changing spike counts. Phase locking was strongest for slow fields (significant from 0.74 mV/mm at 1 Hz) and needed fields nearly ten times larger at 30 Hz. Four nearby neurons were synchronized by one field. The authors read this as a consequence of Kirchhoff’s laws and a threshold model. | Read |
| NOTE-1517 | Voigt — How hard decisions shape our preferences | An Opinion article, not a review: a “tentative, integrative neural process model” of how preferences form during choices between equally liked items. Value is computed (vmPFC), conflict detected (dACC); then, during the choice, how long an item is fixated predicts its choice and its later change in value, with precuneus allocating spatial attention bottom-up to a salient item and dlPFC holding it in working memory; the change lasts only for choices that are remembered (hippocampus). The evidence is correlational, mostly the author’s 2019 study. | Read |
| NOTE-1518 | Kane — Libertarianism | Kane’s compact defence of event-causal libertarianism. Free will needs ultimate responsibility, which needs undetermined self-forming actions somewhere in a life; Frankfurt cases do not reach them. In a self-forming action the will is divided, conflict stirs up chaos that makes the brain sensitive to micro-indeterminacy, and each competing effort meets the indeterminacy as a hindrance from the other, so either outcome is a willed success. Indeterminism lessens control without lessening responsibility; what is needed is macro-control. | Read |
| NOTE-1519 | Blei, Ng & Jordan — Latent Dirichlet allocation | LDA draws one topic mixture θ_d ~ Dir(α) per document and a topic for every word from it, a three-level model (corpus α, β; document θ_d; word z, w), justified by de Finetti’s theorem for exchangeable words. The paper sets it against the mixture of unigrams, which gives each document exactly one topic, and pLSI, which has a mixture per training document but no model for it. Inference is variational (eqs. 6–7); on two corpora LDA has the lowest held-out perplexity of the four models. | Read |
| NOTE-1520 | Niemiec, Ryan & Deci — The path taken | 147 recent graduates, surveyed one and two years after college. Valuing intrinsic or extrinsic aspirations predicted attaining them (β = .51, .67). Attaining intrinsic aspirations went with well-being (β = .77) and against ill-being (β = −.66); attaining extrinsic ones, entered alongside, had no unique relation to well-being (β = .00) and a positive one to ill-being (β = .38). Change in need satisfaction mediated intrinsic attainment’s link to change in well-being. All self-report and correlational; extrinsic attainment’s zero-order correlation with well-being is positive (mean r = .19). | Read |
| NOTE-1521 | Froese — Irruption Theory | Froese proposes Irruption Theory, a libertarian, nonreductive account of how an agent’s motivations “as such” make a difference to behaviour. Three axioms (motivational efficacy, incomplete materiality, underdetermined materiality) and three theses (irruption, scalability, attunement). The difference motivation makes can only show up as increased material underdetermination, measurable as neural entropy. Chaos, 1/f noise and criticality are offered as what scales it up. Irruptions have no direction: they “can loosen the organization of the current behavior but cannot force the formation of the behavior that is to come” (§5.2.3). What makes behaviour adaptive is attunement, chiefly Watson et al.’s self-optimization in Hopfield networks with random resets and Hebbian learning. Conceptual throughout: no model, no data. | Read |
| NOTE-1522 | Ryan, Mims & Koestner — Reward contingency and interpersonal context | A review that sorts the reward studies into task-non-contingent, task-contingent, performance-contingent and competitively contingent rewards, and an experiment (N = 96, n = 16 per cell) in which a $3 performance-contingent reward given with controlling (“should”) feedback left less free-choice play than the same reward given with informational feedback (117 vs 229 s), and both rewarded groups played less than unrewarded groups given the same feedback. Felt pressure was higher under controlling conditions; mediation was not tested. | Read |
| NOTE-1523 | La Guardia et al. — Within-person variation in security of attachment | Three cross-sectional studies of undergraduates find most of the variance in attachment security within persons, across partners, and find relationship-specific satisfaction of autonomy, competence and relatedness predicting relationship-specific security, also without the relatedness items. Relatedness predicts most, then autonomy, then competence. Mean security predicts well-being; variability across partners mostly does not. Need satisfaction and security partly mediate each other’s relation to well-being, and the authors say the direction is undetermined. | Read |
| NOTE-1525 | Kasser & Ryan — Further examining the American dream | Two cross-sectional self-report studies, 100 adults from Rochester households and 192 students. With the overall importance of all aspirations controlled, the relative importance of extrinsic aspirations (money, fame, image) goes with less self-actualization and vitality and more physical symptoms, and intrinsic aspirations (self-acceptance, affiliation, community, health) with the reverse; the two kinds load on separate factors. The paper does not test whether the pattern survives the reasons for pursuing the goals, and says that test would be interesting. | Read |
| NOTE-1526 | Ntoumanis et al. — SDT-informed health interventions, a meta-analysis | 73 experimental studies (58 RCTs, 30,088 participants) of health interventions designed on SDT. At the end of the intervention they raised perceived need support (g = 0.64), autonomy (0.37) and competence (0.31) satisfaction, autonomous motivation (0.30), health behaviour (0.45) and psychological health (0.29); relatedness (0.20), controlled motivation and amotivation did not change. Psychological health’s effect was gone at follow-up (0.14, ns). Effect-size meta-regressions link gains in need support and autonomous motivation to gains in behaviour; mediation was not tested, the number of SDT techniques predicted nothing, and need frustration was not an outcome. | Read |
| NOTE-1527 | Chen et al. — Need satisfaction, frustration and strength across four cultures | Two cross-sectional studies (Belgium and China, N = 683; Belgium, China, USA and Peru, N = 1,051) introduce the 24-item Basic Psychological Need Satisfaction and Frustration Scale (BPNSFS). A six-factor model (satisfaction and frustration of each need) fits better than three factors and is metric-invariant across the four countries; satisfaction relates mainly to life satisfaction and vitality, frustration mainly to depressive symptoms; neither relation differs by country or is moderated by need valuation or need desire. Every satisfaction item is worded positively and every frustration item negatively. | Read |
| NOTE-1528 | Szczepanski et al. — Phase-amplitude coupling and spatial attention | In eight epilepsy patients with subdural grids, broadband high gamma (70–250 Hz) power rose over frontal, parietal and visual cortex while spatial attention was held, and its amplitude was coupled to the phase of a 2–5 Hz rhythm in 123 of 273 electrodes. In 28 of those 123, the coupling’s strength on a trial correlated with faster reaction times (e.g. r(41) = −0.51), for contralateral attention only. The evidence is correlational; “facilitate” in the title is the authors’ reading of it, and the paper reports no intervention. | Read |
| NOTE-1529 | Donoghue, Schaworonkow & Voytek — Methodological considerations for neural oscillations | A methods review with simulations: seven ways field-potential analyses misread oscillations (absent oscillations, shifted peaks, aperiodic 1/f activity, bursts, non-sinusoidal shape, overlapping sources, low SNR), each with a recommendation. Non-sinusoidal waveforms produce significant phase-amplitude coupling with no interaction between rhythms, and aperiodic activity puts power in every band, so neither PAC nor band power is by itself evidence of coupled oscillations. | Read |
| NOTE-1530 | Murphy et al. — The BPNSFS probably does not validly measure need frustration | An argument, with factor analyses of eight samples (N = 3,692), that the BPNSFS’s “frustration” scales are mostly negatively keyed satisfaction items with almost no thwarting content, so the satisfaction–frustration split in the scale is “likely primarily a method artifact caused by different item keying directions”. Factors sharing a keying direction correlate .64–.75; satisfaction and frustration of the same need correlate .17–.38; a higher-order model grouping by keying fits better than one grouping by need. The authors say the question cannot be settled with existing data, because keying and the purported construct are fully confounded. | Read |
| NOTE-1531 | Deci & Ryan — The General Causality Orientations Scale | The scale that founded causality orientations theory: twelve vignettes, each with an autonomy, a control and an impersonal response rated 1–7, summed into three subscales. In 636 students the subscales have α .69–.74 and are nearly independent (A–C r = .03, A–I −.25, C–I .27); retest over two months is .71–.78 (n = 51). Validity is a set of correlations in samples of 42 to 128, mostly as predicted, a few at p < .07, and behaviour is the weakest link. | Read |
| NOTE-1533 | Campbell et al. — Need frustration as a transdiagnostic process | In Belgian adolescents, a cross-sectional study (N = 284; the abstract says 248) and a two-wave study six months apart (N = 608) model need frustration, measured by the twelve BPNSFS frustration items, as the mediator between self-critical perfectionism and depressive and eating disorder symptoms. Cross-sectionally the depression–eating correlation falls from .50 to .42 with perfectionism and to a non-significant .18 with frustration added. In latent change models, correlated change of the two symptoms falls from .43 to .39 and then .24. This is the study LIT-561 cites as showing need frustration “predicted” the symptoms and “largely accounted for their co-occurrence and co-evolution across time”; it is mediation of correlated change between two waves, not temporal precedence. | Read |
| NOTE-1534 | Yang & Abanin — Integrals of motion as slow modes | Under weak local noise an operator decays at a rate set by its size; chaotic dynamics makes generic operators grow, while small-sized integrals of motion do not, so they are the Lindbladian’s slow modes. Exact diagonalization at L ≤ 9 bears this out for Ising and Heisenberg chains and finds approximate conservation laws, including some not put in by hand. The large-L footing is a perturbative argument through a gap of order min(γL, √(v_Bγ)), which the authors say hydrodynamic modes may close. Stronger noise reorders the slow modes in favour of approximate conservation laws. | Read |
| NOTE-1537 | Van Lange and Bergmann — Human cooperation is strong among individuals but fragile between groups | A Perspective, not a systematic review. Cooperation is strong between individuals, above all in dyads, through precise reciprocity, empathy and a partner who cannot be excluded at no cost. It is fragile between groups. Categorization alone yields schema-based mistrust and in-group favouritism by bounded reciprocity, and seeing the out-group favour itself hardens that into distrust. Only negative interdependence and perceived threat turn it into costly competition, aggression and hate. The same processes that build in-group cooperation can fuel intergroup conflict. The remedy proposed is cooperative cross-group dyads, untested. | Read |
| NOTE-1538 | West, Fisher, Gardner and Kiers — Major evolutionary transitions in individuality | A colloquium review, with no new data or model. A transition in individuality is defined by two conditions: mutual dependence, where parts can replicate only within the larger unit, and negligible within-group conflict. It proceeds in two steps, forming a cooperative group and then transforming it, with borders that are not clear. Table 1 shows that each condition occurs without the other. Across transitions, what does the work is an ecological benefit together with how groups form, through clonal bottlenecks, lifetime monogamy or vertical transmission of clonal symbionts. Kin discrimination and the repression of competition played “relatively minor roles”. | Read |