AbstractPhil
·
AI & ML interests
datasets, research papers, experimentation, vision, classification, text encoders, tokenization, llms, diffusion, distillation, and more.
Recent Activity
repliedto their post about 1 hour ago The rotary test cases are in and a solution was found.
https://huggingface.co/blog/AbstractPowered/rotary-addressed-selection
I've coined the term Rotary Addressed Selection, at least until I discover if someone else has made it first.
This rotary can handle an absurd length of context window, though the technical documentation is quite complex. Targeting context window after 1 million was how the addressing corruption was solved.
Yes this is all compacted into a 9m param model. A universe in an atom.
The rotary system involves including a full address for every 4096 context window lookup state. This allows the model to differentiate between a multitude of modular model extensions.
How does that work? Well if there's nothing at the address, then there's no return. Addresses are essentially selectors promoting the cooperative state and it does have some limitations, but the full global rotary supports DIRECT dynamic extension to the model at runtime.
Need only a simple classifier? The selectors know which experts classify and which state they exist in.
Need a full VLM? Load up the experts.
You get the idea.
Query with the address, get the correct addressing. That's how it works. The model learns to handle everything internally, so there is no need for a large structural addressing screening beforehand.
With this development, full mixture of experts with uncertain (absurdly long) context depth can have a consistent context window guarantee. There is bound to be some direct breakdowns and numerics that can't simply reach beyond certain points likely based on hardware or rounding differences, but the system essentially allows full MOE where experts are selectable and the selected experts are a guaranteed addressing.
The upcoming experimentation will fill in the gaps for the test cases, confirm or refute clauses that are established on the rotary, and then training a functional Alhena at the size of the mini-beatrix scale with some tweaks for the changes. posted an update about 2 hours ago The rotary test cases are in and a solution was found.
https://huggingface.co/blog/AbstractPowered/rotary-addressed-selection
I've coined the term Rotary Addressed Selection, at least until I discover if someone else has made it first.
This rotary can handle an absurd length of context window, though the technical documentation is quite complex. Targeting context window after 1 million was how the addressing corruption was solved.
Yes this is all compacted into a 9m param model. A universe in an atom.
The rotary system involves including a full address for every 4096 context window lookup state. This allows the model to differentiate between a multitude of modular model extensions.
How does that work? Well if there's nothing at the address, then there's no return. Addresses are essentially selectors promoting the cooperative state and it does have some limitations, but the full global rotary supports DIRECT dynamic extension to the model at runtime.
Need only a simple classifier? The selectors know which experts classify and which state they exist in.
Need a full VLM? Load up the experts.
You get the idea.
Query with the address, get the correct addressing. That's how it works. The model learns to handle everything internally, so there is no need for a large structural addressing screening beforehand.
With this development, full mixture of experts with uncertain (absurdly long) context depth can have a consistent context window guarantee. There is bound to be some direct breakdowns and numerics that can't simply reach beyond certain points likely based on hardware or rounding differences, but the system essentially allows full MOE where experts are selectable and the selected experts are a guaranteed addressing.
The upcoming experimentation will fill in the gaps for the test cases, confirm or refute clauses that are established on the rotary, and then training a functional Alhena at the size of the mini-beatrix scale with some tweaks for the changes. View all activity Organizations
published an article about 3 hours ago view article Alhena: Building a Rotary That Withstands Selection
AbstractPowered
• view article One Address, Three Systems: The Formulas of AlephLM, AlephLLM and AMOE, and the Measurements That Set Them
AbstractPowered
• view article Scaling Beatrix: A 376-Million-Parameter Byte Model, the Arms That Followed Her Trunk, and the First Sliders in Pictures
AbstractPhil
• published an article about 2 months ago view article Twinning Beatrix: A Full-Splat Byte Model, Its Softmax Control, and What Reaches an Image Generator
view article Raising Beatrix: A Byte-Level Model's Measured Childhood
view article Agreement, Anchors, Addresses: A Week of Geometric Training
view article Geometric Memory FT4 — Distill Against a Consensus, Ship a Rotation
AbstractPhil
• • 1
view article The Loss Manifest: A Field History of Objective Functions, and What a Machine Can Actually Be Asked to Compute
view article Aleph Differentiation, Parts 3 & 3-D: Two Laws, Five Days, One Framework
view article The Aleph Moves Into a Pretrained Trunk: Relays, Registers, and the Two-Regime Dispatch Law
view article The Aleph Under Autoregressive Pressure: Bottleneck Priors, Sign Codes, and the Consumption Law
view article Subject Bucketing: Teaching a Diffusion Model New Prompt Languages Without Forgetting
AbstractPhil
• • 1
view article geolip-aleph-void: The First Relational Geometric Vocabulary Patchwork
view article Reading the Voids: Topological Contribution Signals in Frozen Geometric Codebooks
view article Fused Batched Thin SVD, Part II: Extending the Jacobi Pipeline to N=6 with Configurable Convergence
view article H2 Omega Confirmed, Paradigm Shift: Attempting to Disprove Omega As A Whole
AbstractPhil
• • 1
view article The Polygonal Omega: Trained Sphere-Solvers Are Projective Codebooks
AbstractPhil
• • 1
view article Three Geometric Bands in a Sphere-Normalized Patch Autoencoder