ScholarGate
সহকারী

পদ্ধতির তুলনা করুন

নির্বাচিত পদ্ধতিগুলো পাশাপাশি পর্যালোচনা করুন; যে সারিগুলোয় পার্থক্য আছে সেগুলো চিহ্নিত করা হয়।

সক্রিয় শিখন (Active Learning)×Conformal Prediction×অনিশ্চয়তা পরিমাপ (Uncertainty Quantification)×
ক্ষেত্রযন্ত্র শিখনযন্ত্র শিখনঅনুকরণ
পরিবারMachine learningMachine learningProcess / pipeline
উদ্ভবের বছর20092005Seminal modern form: 2002
প্রবর্তকBurr SettlesVovk, Gammerman & ShaferNorbert Wiener (polynomial chaos, 1938); extended to Wiener–Askey scheme by Xiu & Karniadakis (2002)
ধরনInteractive supervised learning frameworkDistribution-free uncertainty quantification frameworkComputational uncertainty analysis framework
মৌলিক উৎসSettles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗Vovk, V., Gammerman, A., & Shafer, G. (2005). Algorithmic Learning in a Random World. Springer. ISBN: 978-0-387-00152-4Xiu, D. & Karniadakis, G.E. (2002). The Wiener-Askey Polynomial Chaos for Stochastic Differential Equations. SIAM Journal on Scientific Computing, 24(2), 619–644. DOI ↗
অপর নামQuery Learning, Optimal Experimental Design (ML context), Pool-Based Active Learning, Aktif ÖğrenmeConformal Inference, Conformal Risk Control, Inductive Conformal Prediction, Uyumsal TahminUQ, polynomial chaos expansion, PCE, Kriging surrogate
সম্পর্কিত229
সারসংক্ষেপActive learning is an iterative machine-learning paradigm in which a learning algorithm selectively queries an oracle — typically a human annotator — for labels on the most informative unlabeled examples. Formalized by Burr Settles in his seminal 2009 literature survey, active learning addresses the practical bottleneck of annotation cost by achieving high model accuracy with far fewer labeled examples than passive supervised learning requires.Conformal Prediction is a distribution-free framework for constructing statistically valid prediction sets (for classification) or prediction intervals (for regression) around the output of any pre-trained machine learning model. Introduced by Vovk, Gammerman, and Shafer in their 2005 monograph, it provides a finite-sample marginal coverage guarantee — the true label falls inside the prediction set with at least 1-alpha probability — without requiring parametric assumptions about the data distribution.Uncertainty Quantification (UQ) is a computational framework for systematically measuring how uncertainty in the inputs of a model propagates into uncertainty in its outputs. Building on Wiener's polynomial chaos theory (1938) and formalised for general stochastic problems by Xiu and Karniadakis (2002), UQ uses two primary strategies: Polynomial Chaos Expansion (PCE), which represents the model output as a series of orthogonal polynomials matched to the input distributions, and Kriging (Gaussian process) surrogates, which replace an expensive simulation with a fast statistical approximation fitted to a small set of carefully chosen runs.
ScholarGateডেটাসেট
  1. v1
  2. 1 উৎস
  3. PUBLISHED
  1. v1
  2. 1 উৎস
  3. PUBLISHED
  1. v1
  2. 2 উৎস
  3. PUBLISHED

অনুসন্ধানে যান স্লাইড ডাউনলোড করুন

ScholarGateপদ্ধতির তুলনা করুন: Active Learning · Conformal Prediction · Uncertainty Quantification. 2026-06-17 তারিখে সংগৃহীত, উৎস: https://scholargate.app/bn/compare