Adaptive Design and Stochastic Approximation
自适应设计与随机逼近AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究通用自适应实验设计与随机逼近,未涉及明确的因果效应或所列领域模型。
反馈分类问题自适应设计与随机逼近AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
When $y = M(x) + \varepsilon$, where $M$ may be nonlinear, adaptive stochastic approximation schemes for the choice of the levels $x_1, x_2, \cdots$ at which $y_1, y_2, \cdots$ are observed lead to asymptotically efficient estimates of the value $\theta$ of $x$ for which $M(\theta)$ is equal to some desired value. More importantly, these schemes make the "cost" of the observations, defined at the $n$th stage to be $\sum^n_1(x_i - \theta)^2$, to be of the order of $\log n$ instead of $n$, an obvious advantage in many applications. A general asymptotic theory is developed which includes these adaptive designs and the classical stochastic approximation schemes as special cases. Motivated by the cost considerations, some improvements are made in the pairwise sampling stochastic approximation scheme of Venter.