Unverified50% confidenceFactExact time
The L* algorithm was proposed by Dana Angluin in 1987 for inferring a minimal deterministic finite automaton from a black-box system.
1
Sources
50%
Confidence
Long-term
Relevance
9/30/2026
First Seen
Sources
Related Entities
Related Claims
Unverified可微分编程处理不可微离散结构的主要技术路线包括直通估计器、Gumbel-Softmax重参数化和神经网络引导的束搜索60% similarUnverifiedEvolution Strategies are a class of black-box optimization methods that only require the ability to evaluate a fitness function for a given set of parameters, without needing to compute gradients59% similarUnverifiedThe perceptron convergence theorem proves that if the data is linearly separable, the algorithm is guaranteed to find the correct classification hyperplane within a finite number of steps59% similarVerifiedKnowledge distillation was systematized by Hinton et al. in 2015; its core idea is to transfer the dark knowledge of a large model to a small model, using soft probability distributions as supervision signals.57% similarUnverifiedThe differentiability of Monte Carlo PDE solvers stems from the fact that their estimators are themselves smooth functions of the parameters, allowing unbiased gradient estimates to be obtained directly via reparameterization tricks or likelihood ratio methods, without needing to backtrack through the intermediate states of a large-scale linear system.57% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/960990API
curl https://kongchang.com/api/v1/knowledge/claims/960990MCP
get_claim(id=960990)