Statistical Inference for Discretely Observed Markov Jump Processes
离散观测马尔可夫跳跃过程的统计推断AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要讨论一般有限状态随机过程推断,未明确宏观时间序列或金融应用,故不强行分类。
离散观测马尔可夫跳跃过程的统计推断AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Summary Likelihood inference for discretely observed Markov jump processes with finite state space is investigated. The existence and uniqueness of the maximum likelihood estimator of the intensity matrix are investigated. This topic is closely related to the imbedding problem for Markov chains. It is demonstrated that the maximum likelihood estimator can be found either by the EM algorithm or by a Markov chain Monte Carlo procedure. When the maximum likelihood estimator does not exist, an estimator can be obtained by using a penalized likelihood function or by the Markov chain Monte Carlo procedure with a suitable prior. The methodology and its implementation are illustrated by examples and simulation studies.
扰动效用模型的 Fenchel–Young 估计量
Perturbed Utility Models (PUMs) represent discrete choice as utility maximization under convex perturbation or regularization, encompassing a broad class of choice models, including Multinomial Logit (MNL) and models that permit zero choice probabilities. Because, for general perturbations, maximum likelihood may be non-convex, and the negative log-likelihood is infinite when a sparse model assigns zero probability to an observed choice, we specialize the Fenchel--Young…
正则非光滑模型的归一化最大似然:测度论基础与几何采样
The Normalized Maximum Likelihood (NML) codelength, or stochastic complexity, represents a principled criterion for universal coding. While recent coarea-based formulations provided a calculation method for smooth models, this framework collapses for the non-smooth estimators ubiquitous in modern machine learning (e.g., Lasso, Sparse SVMs). In this work, we provide a rigorous framework for computing the NML for regular path-differentiable Lipschitz (PDL) estimators. By…
结合协变量与稀疏内在得分的实体排序
This paper addresses the item ranking problem with associated covariates, focusing on scenarios where the preference scores can not be fully explained by covariates, and the remaining intrinsic scores are sparse. Specifically, we extend the pioneering Bradley-Terry-Luce (BTL) model by incorporating covariate information and considering sparse individual intrinsic scores. Our work introduces novel model identification conditions and examines the statistical rates of the…
广义线性模型中多层模型与固定效应方法的比较
We extend prior work comparing linear multilevel models (MLM) and fixed effect (FE) models to the generalized linear model (GLM) setting, where the coefficient on a treatment variable is of primary interest. This leads to three insights. (i) First, as in the linear setting, MLM can be thought of as a regularized form of FE (RegFE). This explains why group-level confounding can greatly bias MLM's treatment coefficient estimates. However, unlike the linear setting, there is…
通过惩罚成对加速失效时间模型选择传染病传播变量
In infectious disease transmission, regression and variable selection for time-to-event outcomes are complicated by transmission-induced dependence that violates standard independence assumptions. Pairwise survival analysis addresses this dependence by modeling contact intervals in ordered pairs, defined as the time from the onset of infectiousness in the pair's first individual to their first infectious contact with the second individual. We propose a penalized pairwise…
核心—边缘网络的惩罚最大似然推断
Likelihood-based network models are often fitted under links' independence and low-order constraints, while empirical networks frequently exhibit systematic higher-order structures such as triangles and wedges, characterizing the observed clustering patterns. Real-world core-periphery networks such as the interbank market or the air transportation system represent key examples, with cores displaying complex and nonlinear features. We formalize Penalized Likelihood with…