Forecasts From Nonrandom Samples
非随机样本下的预测AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要研究选举计票预测,没有宏观经济预测或其他所列领域细分的直接证据。
非随机样本下的预测AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
The 1990s was not the best of decades for electoral polls, with striking errors occurring in, among others, the British, French, and Spanish elections, including election night, when errors are more evident. This article proposes a model for predicting final election outcomes based on the consistency that polling stations show between elections. Using both past and incoming polling station vote proportions, the model produces continuously revised predictions. The method is validated predicting the 1995 Corts Valencianes (Valencia regional parliament) elections and displaying the real-time experience of the 1999 Corts Valencianes election night. The case study is completed by demonstrating the technique's efficacy in three additional elections. The results confirm that the procedure generates quick, highly reliable, and accurate forecasts. In fact, only a few minutes after starting the scrutiny, the proposal permits one to approximate the final results with great precision, even with only a small percentage of votes polled. The great flexibility of the procedure makes it possible to use the method under a wide variety of circumstances and electoral systems. Furthermore, this procedure has additional advantages, including robustness and lower cost, over other methods which can also be implemented during election night with the objective of forecasting final outcomes, like exit polls or quick counts of a meaningful sample of polling stations.
基于广义逆距离权重的GNAR模型改进多元时间序列预测
Many multivariate time series arise on networks where relationships between variables depend on physical or more general distances. Standard vector autoregressive models struggle in such settings due to their quadratic parameter growth, while generalised network autoregressive (GNAR) models offer a parsimonious alternative by explicitly incorporating network structures. Existing GNAR formulations assume fixed weights, typically uniform or reciprocal distances, which may not…
多元Lévy自适应B样条回归
We propose Multivariate Lévy Adaptive B-Spline Regression (MLABS), a Bayesian nonparametric regression model designed to capture nonlinear effects, interactions, and locally varying features of multivariate functions. MLABS represents the regression function as a random sum of low-order tensor-product B-spline basis functions under a finite Lévy random measure prior. The resulting representation adapts to the complexity and local structure of the regression function while…
Joint-event forecasts combine an estimated dependence model with current marginal forecasts. Retaining historical transforms at the marginal fits available when each outcome arrived creates overlapping estimation errors. We derive their joint influence with the terminal estimates in a stable Vine Copula VAR with normal innovation margins and a fixed, correctly specified Gaussian or positive Clayton vine. An intercept identity and the stable VAR filter reduce the historical…
循环重心编码器:预测、模拟及其在时间序列分析中的应用
This dissertation has two parts. In the first part we theoretically develop a framework that extends the optimal transport barycenter problem from independent data with observed covariates to processes whose relevant covariate is their own history. Given a stationary stochastic process, our framework shows there exists an invertible transport map that extracts from it an iid component whose distribution is the barycenter of the conditional distributions of the input process…
协整回归变量:折叠凹惩罚何时超越 LASSO
LASSO is one of the most popular regularization methods for high-dimensional regression models. While cointegration is common in practical applications of predictive regressions with many regressors, the convex penalty of LASSO overly suppresses the coefficients of cointegrated regressors and therefore fails to deliver consistent parameter estimation. We employ folded concave penalties (FCP), including the well-known SCAD and MCP, to address this issue. Using FCP, we…
基于正则化对抗重加权的前验知情可泛化低秩表示学习
Modern learning problems increasingly leverage data from heterogeneous sources to improve robustness and generalizability under distribution shift, often with high-dimensional parameters admitting low-rank structure. Existing group distributionally robust optimization (group-DRO) approaches optimize against adverse source mixtures, but extending this principle to low-rank matrix estimation with a broad class of losses leads to a challenging nonconvex-concave problem for…