方法对比
并排查看您选择的方法;存在差异的行会高亮显示。
| 主动学习× | 不确定性量化× | |
|---|---|---|
| 领域≠ | 机器学习 | 仿真 |
| 方法族≠ | Machine learning | Process / pipeline |
| 起源年份≠ | 2009 | Seminal modern form: 2002 |
| 提出者≠ | Burr Settles | Norbert Wiener (polynomial chaos, 1938); extended to Wiener–Askey scheme by Xiu & Karniadakis (2002) |
| 类型≠ | Interactive supervised learning framework | Computational uncertainty analysis framework |
| 开创性文献≠ | Settles, B. (2009). Active learning literature survey. University of Wisconsin-Madison Computer Sciences Technical Report 1648. link ↗ | Xiu, 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 Öğrenme | UQ, polynomial chaos expansion, PCE, Kriging surrogate |
| 相关≠ | 2 | 9 |
| 摘要≠ | 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. | 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数据集 ↗ |
|
|