<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Refleqt Labs</title>
    <link>https://reflqt.com/blog/</link>
    <description>Research notes, experiment reports, and technical dispatches from Refleqt Labs.</description>
    <language>en</language>
    <atom:link href="https://reflqt.com/rss.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Block-Diagonal Transformers Win 8 of 17 Downstream Tasks</title>
      <link>https://reflqt.com/blog/bd4-wins-downstream-tasks/</link>
      <guid>https://reflqt.com/blog/bd4-wins-downstream-tasks/</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <description>Across 17 downstream tasks at five seeds each, a block-diagonal FFN beat the dense baseline eight times, tied nine times, and lost zero -- with compositional tasks dominating the win column.</description>
    </item>
    <item>
      <title>The Compositional Advantage: Why Structure Helps Reasoning</title>
      <link>https://reflqt.com/blog/compositional-advantage-structured-ffn/</link>
      <guid>https://reflqt.com/blog/compositional-advantage-structured-ffn/</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <description>The three tasks where a block-diagonal FFN beat the dense baseline by the largest margins are all compositional: Boolean SAT, logical reasoning, and multi-hop QA. Here is why that pattern is not an accident.</description>
    </item>
    <item>
      <title>The EML Paradox: Better Language Model, Worse Symbolic Regression</title>
      <link>https://reflqt.com/blog/eml-paradox-language-vs-symbolic/</link>
      <guid>https://reflqt.com/blog/eml-paradox-language-vs-symbolic/</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <description>An EML hybrid FFN beat BD4 on 125M-scale language modelling and failed to recover sin(x) in all 12 symbolic regression configurations we tested -- a clean demonstration that universality and trainability are different things.</description>
    </item>
    <item>
      <title>What Frozen Probes Reveal About BD4 Representations</title>
      <link>https://reflqt.com/blog/frozen-probes-bd4-representations/</link>
      <guid>https://reflqt.com/blog/frozen-probes-bd4-representations/</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <description>A frozen linear probe reads 3.4x more structure out of a trained BD4 transformer than out of its random-init twin -- and the ratio grows monotonically across every checkpoint we tested.</description>
    </item>
    <item>
      <title>JEPA Meets Group Theory: Perfect Accuracy on S_4 Composition</title>
      <link>https://reflqt.com/blog/jepa-s4-group-composition/</link>
      <guid>https://reflqt.com/blog/jepa-s4-group-composition/</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <description>A JEPA predictor with a dense FFN solved S_4 group composition perfectly across three seeds; the same predictor with a block-diagonal FFN collapsed to random guessing.</description>
    </item>
    <item>
      <title>When Your Results Are Real But Your Sample Size Is Not</title>
      <link>https://reflqt.com/blog/power-analysis-sample-size/</link>
      <guid>https://reflqt.com/blog/power-analysis-sample-size/</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <description>A power analysis of our SES-012 benchmark comparisons found that ten out of ten were underpowered at n=100 with a single seed -- and we are publishing the audit before the results it audits.</description>
    </item>
    <item>
      <title>Structured Transformers in 2026: Where FFN Research Stands</title>
      <link>https://reflqt.com/blog/structured-transformers-landscape-2026/</link>
      <guid>https://reflqt.com/blog/structured-transformers-landscape-2026/</guid>
      <pubDate>Fri, 24 Apr 2026 00:00:00 GMT</pubDate>
      <description>A map of the five live research threads reshaping how we think about the transformer FFN, and a preview of the seven-post series that follows.</description>
    </item>
    <item>
      <title>The Case for Negative Results in ML Research</title>
      <link>https://reflqt.com/blog/case-for-negative-results/</link>
      <guid>https://reflqt.com/blog/case-for-negative-results/</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>Most ML papers report only what worked. But the experiments that failed -- the hypotheses that were wrong, the architectures that underperformed -- carry just as much scientific information. Here is why negative results deserve publication, and how to write them up.</description>
    </item>
    <item>
      <title>Conformal Prediction for Neural Networks: A Practical Introduction</title>
      <link>https://reflqt.com/blog/conformal-prediction-intro/</link>
      <guid>https://reflqt.com/blog/conformal-prediction-intro/</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>Most neural networks output point predictions with no reliability guarantee. Conformal prediction wraps any model in a calibration layer that produces prediction sets with provable finite-sample coverage -- no distributional assumptions required. Here is how it works and how to implement it.</description>
    </item>
    <item>
      <title>What Happens Inside a Transformer FFN Layer? A Visual Guide</title>
      <link>https://reflqt.com/blog/inside-transformer-ffn/</link>
      <guid>https://reflqt.com/blog/inside-transformer-ffn/</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>Step inside a transformer FFN layer and see what actually fires. From neuron activation patterns to the key-value memory hypothesis, this visual walkthrough explains how two matrix multiplications and a nonlinearity encode most of what a language model knows.</description>
    </item>
    <item>
      <title>Representation Theory for Machine Learning Engineers</title>
      <link>https://reflqt.com/blog/representation-theory-for-ml/</link>
      <guid>https://reflqt.com/blog/representation-theory-for-ml/</guid>
      <pubDate>Mon, 20 Apr 2026 00:00:00 GMT</pubDate>
      <description>Representation theory turns abstract group symmetries into concrete matrices you can compute with. This article walks through the core ideas -- from irreducible representations to the Peter-Weyl theorem -- with worked examples using S_3 and S_4, and shows why these structures keep appearing in neural network weight matrices.</description>
    </item>
    <item>
      <title>Block-Diagonal Matrices: Why Sparsity Structure Matters</title>
      <link>https://reflqt.com/blog/block-diagonal-matrices/</link>
      <guid>https://reflqt.com/blog/block-diagonal-matrices/</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>Dense matrices are the default in deep learning, but most of those parameters are redundant. Block-diagonal structure offers a principled middle ground between dense and sparse, with real hardware advantages.</description>
    </item>
    <item>
      <title>Merkle Trees for Neural Network Verification</title>
      <link>https://reflqt.com/blog/merkle-trees-verification/</link>
      <guid>https://reflqt.com/blog/merkle-trees-verification/</guid>
      <pubDate>Sun, 19 Apr 2026 00:00:00 GMT</pubDate>
      <description>Hash trees offer O(log n) membership proofs that can verify neural network outputs without re-running inference. A practical walkthrough of Merkle proofs, SHA-256 construction, and tamper detection for AI systems.</description>
    </item>
    <item>
      <title>Multi-Hop Reasoning in Language Models: What Works and What Doesn&apos;t</title>
      <link>https://reflqt.com/blog/multi-hop-reasoning/</link>
      <guid>https://reflqt.com/blog/multi-hop-reasoning/</guid>
      <pubDate>Sat, 18 Apr 2026 00:00:00 GMT</pubDate>
      <description>Multi-hop reasoning -- answering questions that require chaining multiple facts -- remains one of the hardest open problems in NLP. We survey the benchmarks, the methods, the shortcuts, and the surprising failures that reveal how far we still have to go.</description>
    </item>
    <item>
      <title>Scaling Experiments with Minimal Infrastructure</title>
      <link>https://reflqt.com/blog/scaling-experiments-infrastructure/</link>
      <guid>https://reflqt.com/blog/scaling-experiments-infrastructure/</guid>
      <pubDate>Sat, 18 Apr 2026 00:00:00 GMT</pubDate>
      <description>Running 1000+ experiments does not require a cluster or an ML platform. Seed sweeps, auto-commit, systemd, and disciplined checkpointing can take you surprisingly far with a single machine.</description>
    </item>
    <item>
      <title>Why Feed-Forward Layers Matter More Than You Think</title>
      <link>https://reflqt.com/blog/why-ffn-matters/</link>
      <guid>https://reflqt.com/blog/why-ffn-matters/</guid>
      <pubDate>Sat, 18 Apr 2026 00:00:00 GMT</pubDate>
      <description>Attention gets all the glory, but the FFN sub-layers hold the majority of parameters and do most of the computational heavy lifting. A look at what we actually know about what FFN computes.</description>
    </item>
    <item>
      <title>Equivariant Neural Networks: Beyond Data Augmentation</title>
      <link>https://reflqt.com/blog/equivariant-neural-networks/</link>
      <guid>https://reflqt.com/blog/equivariant-neural-networks/</guid>
      <pubDate>Fri, 17 Apr 2026 00:00:00 GMT</pubDate>
      <description>Data augmentation handles symmetry by brute force. Equivariant neural networks handle it by design, baking group structure directly into weight-sharing patterns. A tour from G-CNNs to SE(3)-Transformers.</description>
    </item>
    <item>
      <title>Statistical Rigor in Small-Scale ML Experiments</title>
      <link>https://reflqt.com/blog/statistical-rigor-small-scale/</link>
      <guid>https://reflqt.com/blog/statistical-rigor-small-scale/</guid>
      <pubDate>Fri, 17 Apr 2026 00:00:00 GMT</pubDate>
      <description>Three random seeds and a mean is not a confidence interval. A practical guide to bootstrap CIs, effect sizes, power analysis, and the statistical mistakes that plague ML papers.</description>
    </item>
    <item>
      <title>Group Theory Meets Machine Learning: An Introduction</title>
      <link>https://reflqt.com/blog/group-theory-meets-ml/</link>
      <guid>https://reflqt.com/blog/group-theory-meets-ml/</guid>
      <pubDate>Wed, 15 Apr 2026 00:00:00 GMT</pubDate>
      <description>Symmetry is one of the most powerful organizing principles in mathematics. A growing body of work shows that encoding symmetry into neural network architectures leads to better generalization, fewer parameters, and more interpretable models.</description>
    </item>
    <item>
      <title>The Grokking Phenomenon: When Neural Networks Suddenly Generalize</title>
      <link>https://reflqt.com/blog/grokking-phenomenon/</link>
      <guid>https://reflqt.com/blog/grokking-phenomenon/</guid>
      <pubDate>Fri, 10 Apr 2026 00:00:00 GMT</pubDate>
      <description>Train a small network on modular arithmetic long past overfitting, and something unexpected happens: validation accuracy suddenly jumps from chance to near-perfect. This is grokking, and it has changed how we think about generalization.</description>
    </item>
    <item>
      <title>Structured Matrices in Neural Networks: A Survey</title>
      <link>https://reflqt.com/blog/structured-matrices-survey/</link>
      <guid>https://reflqt.com/blog/structured-matrices-survey/</guid>
      <pubDate>Sun, 05 Apr 2026 00:00:00 GMT</pubDate>
      <description>Dense matrix multiplications dominate the compute cost of modern neural networks. Structured matrices -- block-diagonal, Monarch, Kronecker, low-rank, and sparse -- offer a path to faster, smaller models without sacrificing accuracy.</description>
    </item>
    <item>
      <title>Towards Verifiable AI: Formal Guarantees for Neural Network Outputs</title>
      <link>https://reflqt.com/blog/towards-verifiable-ai/</link>
      <guid>https://reflqt.com/blog/towards-verifiable-ai/</guid>
      <pubDate>Sat, 28 Mar 2026 00:00:00 GMT</pubDate>
      <description>Neural networks produce impressive outputs, but can we prove they are correct? A survey of formal verification, conformal prediction, and cryptographic proof methods for establishing guarantees on neural network behavior.</description>
    </item>
  </channel>
</rss>
