<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Sean O'Connor</title>
    <description>The latest articles on DEV Community by Sean O'Connor (@sean_oconnor_4bd481930b6).</description>
    <link>https://dev.to/sean_oconnor_4bd481930b6</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F4105608%2F6093eae3-03b4-43fd-b7cc-82e888094187.jpeg</url>
      <title>DEV Community: Sean O'Connor</title>
      <link>https://dev.to/sean_oconnor_4bd481930b6</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/sean_oconnor_4bd481930b6"/>
    <language>en</language>
    <item>
      <title>Concatenated context selected linear mappings</title>
      <dc:creator>Sean O'Connor</dc:creator>
      <pubDate>Wed, 02 Sep 2026 10:40:53 +0000</pubDate>
      <link>https://dev.to/sean_oconnor_4bd481930b6/concatenated-context-selected-linear-mappings-3h5m</link>
      <guid>https://dev.to/sean_oconnor_4bd481930b6/concatenated-context-selected-linear-mappings-3h5m</guid>
      <description>&lt;p&gt;Imagine a chain of linear mappings each selected by something.&lt;br&gt;
If the same mapping was selected each time that would be boring. Matrices such as A and B can be collapsed together to a single matrix M by matrix multiply, M=AB.&lt;/p&gt;

&lt;p&gt;And M is actually very different from its parents A and B.&lt;/p&gt;

&lt;p&gt;If you select A from a pool of 10 and likewise B you have 100 different possible M's from 20 matrices. They are like rabbits aren't they?&lt;br&gt;
If you have 10 of A and B and C you have 1000 different matrices from 30. &lt;/p&gt;

&lt;p&gt;This is exponentiation of expressiveness with depth similar to a neural network.&lt;/p&gt;

&lt;p&gt;The something that is doing the matrix selection at each layer you can call the context. And that can be liberal in meaning.&lt;/p&gt;

&lt;p&gt;That's nice but what if you now apply pressure from backpropagation on the matrix chain? &lt;br&gt;
For a data channel input x and the co-selected linear mapping (eg A₂B₇C₅...) backpropagation drifts each chosen linear mapping to be an expert for the slice of the training data it sees.&lt;br&gt;
&lt;a href="https://sciencelimelight.blogspot.com/2026/07/concatenated-context-selected-linear.html" rel="noopener noreferrer"&gt;Concatenated Context Selected Linear Mappings&lt;/a&gt;&lt;br&gt;
&lt;a href="https://archive.org/details/changing-viewpoint-from-re-lu-units-to-context-selected-linear-mappings" rel="noopener noreferrer"&gt;ReLU neural networks as CCSML&lt;/a&gt;  &lt;/p&gt;

</description>
      <category>ai</category>
      <category>machinelearning</category>
    </item>
    <item>
      <title>Linear Mapping have a Memory</title>
      <dc:creator>Sean O'Connor</dc:creator>
      <pubDate>Wed, 02 Sep 2026 07:00:52 +0000</pubDate>
      <link>https://dev.to/sean_oconnor_4bd481930b6/linear-mapping-have-a-memory-3ckg</link>
      <guid>https://dev.to/sean_oconnor_4bd481930b6/linear-mapping-have-a-memory-3ckg</guid>
      <description>&lt;p&gt;Linear Mappings Have a Memory&lt;/p&gt;

&lt;p&gt;I've been looking at something surprisingly simple: what happens when a linear mapping is treated explicitly as a linear associative memory.&lt;/p&gt;

&lt;p&gt;One particularly interesting observation is that when a weighted sum is trained beyond capacity, new examples don't simply erase old ones. Instead, the weight vector is continually perturbed, gradually adding noise to previously stored associations. Recent examples are recalled better, but older examples can persist statistically for a surprisingly long time.&lt;/p&gt;

&lt;p&gt;Even more interestingly, below capacity, removing a training example may produce no change whatsoever in the weight vector—until weight decay is introduced. Then the mapping can move to a different, lower-norm solution while preserving the remaining associations.&lt;/p&gt;

&lt;p&gt;These elementary observations have some interesting consequences for initialization, weight decay, SGD dynamics, and ultimately CCSLM, where the local experts can themselves be viewed as factorized associative memories.&lt;/p&gt;

&lt;p&gt;I've written up the technical details and some implications for CCSLM here:&lt;br&gt;
&lt;a href="https://archive.org/details/linear-associative-memory-dynamics-and-ccslm" rel="noopener noreferrer"&gt;Linear Mappings have a Memory&lt;/a&gt;&lt;/p&gt;

</description>
      <category>ai</category>
      <category>machinelearning</category>
    </item>
  </channel>
</rss>
