pub struct BradleyTerryResult {
pub strengths: HashMap<CandidateId, f64>,
pub covariance: DMatrix<f64>,
pub id_to_index: HashMap<CandidateId, usize>,
pub log_likelihood: f64,
pub iterations: usize,
pub converged: bool,
pub convergence_metric: f64,
}Expand description
Result of Bradley-Terry MLE optimization
§Scale convention
Both optimization paths (Newton-Raphson and MM) report the point estimate
and its uncertainty on the strength scale π = exp(θ):
strengthsholdsπ_i(strictly positive, mean-centered in log-space soΣ log π_i = 0).covarianceisCov(π), i.e. the covariance of the strengths, not of the log-strengths. Newton-Raphson obtains it by the delta method from the sum-to-zero-constrained Fisher information; MM obtains it by bootstrap. Because both are on the same (strength) scale, downstream consumers such asCandidateStats::model_varianceand the active-learning acquisition can use them interchangeably.
Fields§
§strengths: HashMap<CandidateId, f64>Strength parameters π_i = exp(θ_i) (probability scale, log-strengths
sum to zero)
covariance: DMatrix<f64>Covariance of the strengths Cov(π) (delta-method Fisher⁻¹ or bootstrap)
id_to_index: HashMap<CandidateId, usize>Mapping from CandidateId to matrix index
log_likelihood: f64Log-likelihood at solution
iterations: usizeNumber of iterations to convergence
converged: boolDid the algorithm converge?
convergence_metric: f64Final gradient norm (Newton-Raphson) or max parameter change (MM)
Implementations§
Source§impl BradleyTerryResult
impl BradleyTerryResult
Sourcepub fn get_estimate(&self, id: CandidateId) -> Option<FitnessEstimate>
pub fn get_estimate(&self, id: CandidateId) -> Option<FitnessEstimate>
Get fitness estimate for a candidate with uncertainty
Sourcepub fn all_estimates(&self) -> HashMap<CandidateId, FitnessEstimate>
pub fn all_estimates(&self) -> HashMap<CandidateId, FitnessEstimate>
Get all estimates as a map
Sourcepub fn predict_win_probability(
&self,
a: CandidateId,
b: CandidateId,
) -> Option<f64>
pub fn predict_win_probability( &self, a: CandidateId, b: CandidateId, ) -> Option<f64>
Predict probability that candidate a beats candidate b
Trait Implementations§
Source§impl Clone for BradleyTerryResult
impl Clone for BradleyTerryResult
Source§fn clone(&self) -> BradleyTerryResult
fn clone(&self) -> BradleyTerryResult
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl Freeze for BradleyTerryResult
impl RefUnwindSafe for BradleyTerryResult
impl Send for BradleyTerryResult
impl Sync for BradleyTerryResult
impl Unpin for BradleyTerryResult
impl UnsafeUnpin for BradleyTerryResult
impl UnwindSafe for BradleyTerryResult
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
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 moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
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
impl<T> Pointable for T
§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
§fn to_subset(&self) -> Option<SS>
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
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
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
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.