pub struct PairRE {
pub entity_emb: Vec<Vec<f32>>,
pub relation_head: Vec<Vec<f32>>,
pub relation_tail: Vec<Vec<f32>>,
pub dim: usize,
}Expand description
PairRE: Handles 1-N, N-1, and N-N relations with paired relation vectors.
Each relation has two vectors r_h (applied to head) and r_t (applied to tail). score = -||h ⊙ r_h - t ⊙ r_t||_2
Fields§
§entity_emb: Vec<Vec<f32>>Entity embeddings: [num_entities][dim]
relation_head: Vec<Vec<f32>>Head-side relation vectors: [num_relations][dim]
relation_tail: Vec<Vec<f32>>Tail-side relation vectors: [num_relations][dim]
dim: usizeEmbedding dimension
Implementations§
Source§impl PairRE
impl PairRE
Sourcepub fn new(num_entities: usize, num_relations: usize, dim: usize) -> Self
pub fn new(num_entities: usize, num_relations: usize, dim: usize) -> Self
Create a new PairRE model with small random initializations.
Sourcepub fn score(&self, head: usize, relation: usize, tail: usize) -> f32
pub fn score(&self, head: usize, relation: usize, tail: usize) -> f32
Compute score = -||h ⊙ rh - t ⊙ rt||_2
Sourcepub fn update(
&mut self,
head: usize,
relation: usize,
tail: usize,
label: f32,
lr: f32,
)
pub fn update( &mut self, head: usize, relation: usize, tail: usize, label: f32, lr: f32, )
SGD-style update step.
Sourcepub fn predict_tail(
&self,
head: usize,
relation: usize,
top_k: usize,
) -> Vec<(usize, f32)>
pub fn predict_tail( &self, head: usize, relation: usize, top_k: usize, ) -> Vec<(usize, f32)>
Predict top-k tail entities for a (head, relation) query.
Sourcepub fn entity_count(&self) -> usize
pub fn entity_count(&self) -> usize
Number of entities
Trait Implementations§
Auto Trait Implementations§
impl Freeze for PairRE
impl RefUnwindSafe for PairRE
impl Send for PairRE
impl Sync for PairRE
impl Unpin for PairRE
impl UnsafeUnpin for PairRE
impl UnwindSafe for PairRE
Blanket Implementations§
Source§impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedExplicit<'a, E> for Twhere
T: 'a,
Source§impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
impl<'a, T, E> AsTaggedImplicit<'a, E> for Twhere
T: 'a,
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
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
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 moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> PolicyExt for Twhere
T: ?Sized,
impl<T> Read<Exclusive, BecauseExclusive> for Twhere
T: ?Sized,
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§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 moreSource§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).Source§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.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.