paper-with-me

홈 › Papers

Information-based inference for singular models and finite sample sizes: A frequentist information criterion

2015-06-19 · Colin H. LaMont, Paul A. Wiggins

In the information-based paradigm of inference, model selection is performed by selecting the candidate model with the best estimated predictive performance. The success of this approach depends on the accuracy of the estimate of the predictive complexity. In the large-sample-size limit of a regular model, the predictive performance is well estimated by the Akaike Information Criterion (AIC). However, this approximation can either significantly under or over-estimating the complexity in a wide range of important applications where models are either non-regular or finite-sample-size corrections are significant. We introduce an improved approximation for the complexity that is used to define a new information criterion: the Frequentist Information Criterion (QIC). QIC extends the applicability of information-based inference to the finite-sample-size regime of regular models and to singular models. We demonstrate the power and the comparative advantage of QIC in a number of example analyses.

📄 PDF Abstract BibTeX arXiv:1506.05855

Code (0)

등록된 구현이 없습니다.

Tasks

Model Selection

Similar Papers 제목 키워드 기반

Learning under Singularity: An Information Criterion improving WBIC and sBIC

2024-02-20 · Lirui Liu, Joe Suzuki

We introduce a novel Information Criterion (IC), termed Learning under Singularity (LS), designed to enhance the functionality of the Widely Applicable Bayes Information Criterion (WBIC) and the Singular Bayesian Informa…

Model Selection

Near-optimal Rank Adaptive Inference of High Dimensional Matrices

2025-10-09 · Frédéric Zheng, Yassir Jedra, Alexandre Proutiere arxiv

We address the problem of estimating a high-dimensional matrix from linear measurements, with a focus on designing optimal rank-adaptive algorithms. These algorithms infer the matrix by estimating its singular values and…

Elimination Geometry

2026-08-18 · Mian Huang, Xueqin Wang arxiv

This monograph develops elimination geometry (EG), a typed, native-loss, audit-oriented framework for studying when locally optimal objects can be realized by a shared deployment rule. Elimination and compression may era…

Micro-foundation using percolation theory of the finite-time singular behavior of the crash hazard rate in a class of rational expectation bubbles

2016-01-28

We present a plausible micro-founded model for the previously postulated power law finite time singular form of the crash hazard rate in the Johansen-Ledoit-Sornette model of rational expectation bubbles. The model is ba…

A Finite Sample Analysis for Quantile Temporal Difference Learning in Distributional Reinforcement Learning

2026-08-27 · Zijie Cheng, Xiang Li, Yang Peng, Zhihua Zhang arxiv

We establish a global finite-sample guarantee for synchronous quantile temporal-difference learning (QTD) in tabular distributional reinforcement learning. The proof separates two stability mechanisms. A global compariso…

Reinforcement Learning