Skip to main content

SparseAtomCodes

Struct SparseAtomCodes 

Source
pub struct SparseAtomCodes { /* private fields */ }
Expand description

Storage for the per-row codes of all N observations.

Held column-of-structs rather than struct-of-columns: each row’s (active_mask, weights) lives together because the atom-selection strategies all touch a single row at a time. Cross-row vectorization happens through ndarray views built on demand.

Implementations§

Source§

impl SparseAtomCodes

Source

pub fn empty(n_obs: usize, k_atoms: usize) -> Self

Allocate n_obs empty codes, each sized for k_atoms.

Source

pub fn n_obs(&self) -> usize

Source

pub fn k_atoms(&self) -> usize

Source

pub fn row(&self, n: usize) -> &SparseAtomCode

Source

pub fn row_mut(&mut self, n: usize) -> &mut SparseAtomCode

Source

pub fn iter(&self) -> impl Iterator<Item = &SparseAtomCode>

Source

pub fn iter_mut(&mut self) -> impl Iterator<Item = &mut SparseAtomCode>

Source

pub fn weights_matrix(&self) -> Array2<f64>

Flatten weights into a single (N, K) array, with zeros where the mask is unset. Allocates; intended for diagnostic / post-fit use.

Source

pub fn coactivation(&self, a: usize, b: usize) -> CoactivationStats

Co-activation statistics for one atom pair (a, b) — the #976 code-dependence trigger. Pure popcount ratios over the active masks: P(a|b) = #{rows: a∧b} / #{rows: b} and symmetrically.

Two derived readings drive the structure search:

  • CoactivationStats::dependence (symmetric, the FUSION trigger) — independent atoms with marginal activation rates π_a, π_b co-activate at rate π_a·π_b, so both conditionals stay near the marginals; a shattered curved family re-encoded as several near-duplicate atoms pushes both conditionals toward 1.
  • CoactivationStats::absorption_asymmetry (the ABSORPTION-audit trigger) — an A⇒B hierarchy where sparsity folded B’s content into A shows P(parent|child) ≈ 1 without the converse, so a large asymmetry with one conditional near 1 flags the pair for the within-atom substructure audit (#907 race on the atom’s own code distribution).

These are triggers, not decisions: they rank move proposals deterministically; acceptance is owned by the e-process gates in gam_solve::structure_search.

Source

pub fn weight_codependence(&self, a: usize, b: usize) -> f64

#976 — the AMPLITUDE half of the fusion criterion: the Pearson correlation of the two atoms’ activation WEIGHTS over the rows where both are active. Support co-activation (CoactivationStats::dependence) only says the two atoms fire together; it cannot distinguish a single curved family SHATTERED across two near-duplicate atoms (where moving along the family smoothly trades amplitude between the pair, so their weights are strongly — typically negatively — correlated on the joint support) from two GENUINELY INDEPENDENT atoms that merely happen to co-fire on the same input class (weights uncorrelated). The magnitude |ρ| of this correlation is the interaction-evidence the issue’s fusion trigger pairs with code dependence: high support-overlap AND high |weight_correlation| is the shattering signature (“dependent codes + joint interaction evidence”), whereas high overlap with |ρ|≈0 is two independent features that should NOT be fused.

Returns 0.0 when fewer than two rows are jointly active or when either atom’s weight is constant on the joint support (an undefined correlation is, for the trigger, “no amplitude dependence detected”).

Trait Implementations§

Source§

impl Clone for SparseAtomCodes

Source§

fn clone(&self) -> SparseAtomCodes

Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source. Read more
Source§

impl Debug for SparseAtomCodes

Source§

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter. Read more

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Allocation for T
where T: RefUnwindSafe + Send + Sync,

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> ByRef<T> for T

Source§

fn by_ref(&self) -> &T

Source§

impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
where ST: ?Sized, DT: ?Sized,

Source§

impl<T> CloneToUninit for T
where T: Clone,

Source§

unsafe fn clone_to_uninit(&self, dest: *mut u8)

🔬This is a nightly-only experimental API. (clone_to_uninit)
Performs copy-assignment from self to dest. Read more
Source§

impl<T> DistributionExt for T
where T: ?Sized,

Source§

fn rand<T>(&self, rng: &mut (impl Rng + ?Sized)) -> T
where Self: Distribution<T>,

Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Imply<T> for U
where T: ?Sized, U: ?Sized,

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
Source§

impl<T> Read<Exclusive, BecauseExclusive> for T
where T: ?Sized,

Source§

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more
Source§

fn is_in_subset(&self) -> bool

Checks if self is actually part of its subset T (and can be converted to it).
Source§

fn to_subset_unchecked(&self) -> SS

Use with care! Same as self.to_subset but without any property checks. Always succeeds.
Source§

fn from_subset(element: &SS) -> SP

The inclusion map: converts self to the equivalent element of its superset.
Source§

impl<T> ToOwned for T
where T: Clone,

Source§

type Owned = T

The resulting type after obtaining ownership.
Source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
Source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
Source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.
Source§

impl<V, T> VZip<V> for T
where V: MultiLane<T>,

Source§

fn vzip(self) -> V