Skip to main content

BlockwisePenalty

Struct BlockwisePenalty 

Source
pub struct BlockwisePenalty {
    pub col_range: Range<usize>,
    pub local: Array2<f64>,
    pub prior_mean: CoefficientPriorMean,
    pub structure_hint: Option<PenaltyStructureHint>,
    pub op: Option<Arc<dyn PenaltyOp>>,
}
Expand description

A penalty matrix stored at its natural block size together with the column range it occupies in the global coefficient vector.

Instead of embedding every penalty into a full p_total × p_total dense matrix filled with zeros, we keep the compact local matrix and reconstruct the global view only when a downstream consumer explicitly requires it.

Fields§

§col_range: Range<usize>

Column range in the global coefficient vector that this penalty covers.

§local: Array2<f64>

The local penalty matrix — dimensions block_p × block_p where block_p = col_range.len().

§prior_mean: CoefficientPriorMean

Optional nonzero centering vector for this coefficient block.

§structure_hint: Option<PenaltyStructureHint>

Optional structural hint so downstream spectral/logdet code can stay block-local or factorized without reverse-engineering the matrix.

§op: Option<Arc<dyn PenaltyOp>>

Optional operator-form handle bit-equivalent to local. Populated when the originating closed-form factory emitted an op-form penalty so exact operator algebra can use matvec instead of materializing the dense block_p × block_p Gram. None for ordinary dense penalties.

Implementations§

Source§

impl BlockwisePenalty

Source

pub fn new(col_range: Range<usize>, local: Array2<f64>) -> Self

Create a new blockwise penalty.

Source

pub fn with_prior_mean(self, prior_mean: CoefficientPriorMean) -> Self

Source

pub fn with_op(self, op: Option<Arc<dyn PenaltyOp>>) -> Self

Attach an op-form penalty handle bit-equivalent to local.

Source

pub fn ridge(col_range: Range<usize>, scale: f64) -> Self

Source

pub fn kronecker( col_range: Range<usize>, local: Array2<f64>, factors: Vec<Array2<f64>>, ) -> Self

Source

pub fn to_global(&self, p_total: usize) -> Array2<f64>

Expand this blockwise penalty into a full p_total × p_total dense matrix (mostly zeros). Use sparingly — the whole point of blockwise storage is to avoid this allocation.

Source

pub fn to_penalty_matrix(&self, total_dim: usize) -> PenaltyMatrix

Convert into a blockwise gam_problem::PenaltyMatrix without expanding to full dimensions.

Source

pub fn block_size(&self) -> usize

The block size of this penalty.

Trait Implementations§

Source§

impl Clone for BlockwisePenalty

Source§

fn clone(&self) -> BlockwisePenalty

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 BlockwisePenalty

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> 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