Optimal One-Pass Nonparametric Estimation Under Memory Constraint
内存约束下最优的单遍非参数估计AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:流式处理描述数据计算方式,摘要未明确时间序列依赖或所列其他领域的研究对象。
内存约束下最优的单遍非参数估计AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
For nonparametric regression in the streaming setting, where data constantly flow in and require real-time analysis, a main challenge is that data are cleared from the computer system once processed due to limited computer memory and storage. We tackle the challenge by proposing a novel one-pass estimator based on penalized orthogonal basis expansions and developing a general framework to study the interplay between statistical efficiency and memory consumption of estimators. We show that, the proposed estimator is statistically optimal under memory constraint, and has asymptotically minimal memory footprints among all one-pass estimators of the same estimation quality. Numerical studies demonstrate that the proposed one-pass estimator is nearly as efficient as its nonstreaming counterpart that has access to all historical data.
异质性高维分位数回归的全局推断
Quantile regression has received considerable attention in high dimensional methodology due to its robustness and ability to accommodate heteroskedasticity. Despite this attention, current inferential methods for high dimensional quantile regression have significant limitations---only testing significance, testing at a single quantile at a time, or assuming homoskedasticity. To generalize the inferences that can be drawn in high dimensional quantile regression, we introduce…
学习光滑参数总体的极小极大速率
We study pointwise estimation of a smooth binomial mixing density and characterize its minimax rates. Assuming that the mixing density is $s$-Hölder smooth, we first consider the homogeneous setting with a common number of binomial trials $t$. We derive matching lower and upper bounds that reveal three regimes depending on the relative sizes of the sample size $n$ and the number of trials $t$. When $t$ is small, the finite number of trials creates an identification barrier…
半监督核岭 Fréchet 回归
Fréchet regression provides a framework for predicting random object-valued responses by minimizing the conditional expected squared distances. We propose semi-supervised kernel ridge Fréchet regression (SS-KRFR) to exploit unlabeled covariates when labeled samples are scarce. The method learns kernel spectral features from both labeled and unlabeled covariates, then utilizes labeled responses to estimate the conditional Fréchet function by kernel ridge regression. We derive…
标量对函数回归中的函数型预测变量选择与平滑系数估计
In the framework of scalar-on-function regression models, in which several functional variables are employed to predict a scalar response, we propose a methodology for selecting relevant functional predictors while simultaneously providing accurate smooth (or, more generally, regular) estimates of the functional coefficients. We suppose that the functional predictors belong to a real separable Hilbert space, while the functional coefficients belong to a specific subspace of…
弹性核岭回归及其语音学应用
Predicting the shapes of entire curves requires accounting for nonlinear geometry and unknown alignments between curves. We develop elastic kernel ridge regression, a nonparametric method for planar curve responses with scalar, multivariate, or functional covariates. Using square-root velocity representations, we formulate penalized conditional Fréchet mean estimation in a shape space invariant to translation, rotation, scaling, and reparametrization. A vector-valued…
高维在线 M 估计中的大规模线性假设检验
With the growing prevalence of streaming data, renewable estimation has become an important tool for updating statistical analyses without retaining historical raw observations. We study estimation and linear hypothesis testing in high-dimensional online M-estimation. Existing renewable procedures based on quadratic approximations can incur first-order approximation errors because the gradient of the unpenalized loss generally does not vanish at a preceding penalized…