#[non_exhaustive]pub enum AdmissionStrategy {
Heuristic,
Rl,
}Expand description
Admission decision strategy.
Heuristic uses the existing multi-factor weighted score with an optional LLM call.
Rl replaces the LLM-based future_utility factor with a trained logistic regression model.
Variants (Non-exhaustive)§
This enum is marked as non-exhaustive
Heuristic
Current A-MAC behavior: weighted heuristics + optional LLM call. Default.
Rl
Learned model: logistic regression trained on recall feedback.
Not yet wired to a runtime scorer (#2416/#5543): no admission code path scores
with a learned model today, so selecting this variant falls back to
AdmissionStrategy::Heuristic scoring. src/bootstrap/mod.rs’s
build_admission_control emits a tracing::warn! at startup when this variant is
selected, so the fallback is operator-visible rather than silent.
The training write path this strategy would need — record_admission_training,
save_rl_weights, load_rl_weights, and cleanup_old_training_data in
zeph_memory::store::admission_training — has no production caller, so even once a
scorer is wired, there is no training data to train it on yet. The rl_min_samples /
rl_retrain_interval_secs fields and the admission_training_data /
admission_rl_weights storage tables remain as scaffolding for that future work.
Trait Implementations§
Source§impl Clone for AdmissionStrategy
impl Clone for AdmissionStrategy
Source§fn clone(&self) -> AdmissionStrategy
fn clone(&self) -> AdmissionStrategy
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
source. Read moreSource§impl Debug for AdmissionStrategy
impl Debug for AdmissionStrategy
Source§impl Default for AdmissionStrategy
impl Default for AdmissionStrategy
Source§fn default() -> AdmissionStrategy
fn default() -> AdmissionStrategy
Source§impl<'de> Deserialize<'de> for AdmissionStrategy
impl<'de> Deserialize<'de> for AdmissionStrategy
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
impl Eq for AdmissionStrategy
Source§impl PartialEq for AdmissionStrategy
impl PartialEq for AdmissionStrategy
Source§impl Serialize for AdmissionStrategy
impl Serialize for AdmissionStrategy
impl StructuralPartialEq for AdmissionStrategy
Auto Trait Implementations§
impl Freeze for AdmissionStrategy
impl RefUnwindSafe for AdmissionStrategy
impl Send for AdmissionStrategy
impl Sync for AdmissionStrategy
impl Unpin for AdmissionStrategy
impl UnsafeUnpin for AdmissionStrategy
impl UnwindSafe for AdmissionStrategy
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
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.