Skip to main content

ChebyshevScalarization

Struct ChebyshevScalarization 

Source
pub struct ChebyshevScalarization<M> {
    pub objectives: M,
    pub sharpness: f64,
    pub ideal: Vec<f64>,
    pub weight: Option<Vec<f64>>,
}
Expand description

The Chebyshev (weighted-max) scalarization likelihood with a latent weight vector:

    w ~ Uniform(simplex)
    π_β(x, w) ∝ p(x) · exp(−β · s · max_i  w_i · (f_i(x) − z_i))

where z is the ideal point (a reference component-wise ≤ the objective values of interest, e.g. per-objective minima or a slightly optimistic estimate). Minimizing the weighted Chebyshev norm over x reaches every weakly Pareto-optimal point as w varies over the simplex (Miettinen 1999) — in particular the non-convex front regions where a weighted sum’s interior stationary point is a maximum and all its mass collapses onto the front’s endpoints. Use this when the front may be non-convex; use ParetoScalarization when it is known convex (the weighted sum is smoother).

Fields§

§objectives: M

The multi-objective fitness (objectives minimized).

§sharpness: f64

Sharpness of the scalarized likelihood (see ParetoScalarization).

§ideal: Vec<f64>

The ideal/reference point z (one entry per objective).

§weight: Option<Vec<f64>>

None: the weight is a latent site (subject to the marginal-tilt caveat in the module docs). Some(w): a fixed weight — the posterior concentrates on that weight’s own front point, which is the mode to use for sweeping the front uniformly.

Implementations§

Source§

impl<M> ChebyshevScalarization<M>

Source

pub fn new(objectives: M, sharpness: f64, ideal: Vec<f64>) -> Self

Create a Chebyshev-scalarization likelihood with a latent weight.

Source

pub fn with_weight(self, weight: Vec<f64>) -> Self

Fix the scalarization weight (front-sweeping mode): the posterior targets this weight’s own scalarized optimum — reaching interior points of non-convex fronts that no weighted sum can select.

Trait Implementations§

Source§

impl<M: Clone> Clone for ChebyshevScalarization<M>

Source§

fn clone(&self) -> ChebyshevScalarization<M>

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<G, M> GenomeLikelihood<G> for ChebyshevScalarization<M>
where G: 'static, M: MultiObjectiveFitness<G> + Clone + Send + Sync + 'static,

Source§

fn model(&self, genome: &G, beta: f64) -> Model<()>

The observation program conditioned on genome, at likelihood temperature beta.

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> 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> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

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
§

impl<T> Pointable for T

§

const ALIGN: usize

The alignment of pointer.
§

type Init = T

The type for initializers.
§

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

Initializes a with the given initializer. Read more
§

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

Dereferences the given pointer. Read more
§

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

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

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

impl<T> Same for T

Source§

type Output = T

Should always be Self
§

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

§

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

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

fn is_in_subset(&self) -> bool

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

fn to_subset_unchecked(&self) -> SS

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

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

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

§

fn vzip(self) -> V