Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

208416623831 · Jun 202019922001200920172026
48 results for Predictive Information Criterion

New criterion improves predictive evaluation in weighted inference scenarios.

problem Improving predictive evaluation in scenarios with different likelihoods for estimation and evaluation.
method Developed the posterior covariance information criterion (PCIC) to handle weighted likelihood inference.
result PCIC is asymptotically unbiased for quasi-Bayesian generalization error in weighted inference.

Proposes a new hyperprior and predictive criterion for weakly informative hyperprior in relevance vector machine.

problem Capturing non-homogeneous data structure with limited kernel functions.
method Uses inverse gamma hyperprior with a shape parameter close to zero and a scale parameter not close to zero. Applies multiple kernel method with different widths. Proposes extended predictive information criterion for scale parameter selection.
result Obtains a multiple kernel relevance vector regression model with good predictive accuracy.

We introduce a new criterion to determine the order of an autoregressive model fitted to time series data. It has the benefits of the two well-known model selection techniques, the Akaike information criterion and the Bayesian information criterion. When the data is generated from a finite order autoregression, the Bay…

2015-08-11abs ↗pdf ↗

Paper introduces NICc for fast cluster-based validation of prediction models.

problem Validation of prediction models on clustered data.
method Derived NICc to approximate leave-one-cluster-out deviance for standard regression models.
result NICc provides more accurate model size and variable selection, especially with strong clustering.

ITCA optimizes label combination for ambiguous outcomes in multi-class classification.

problem Ambiguous outcome labels in real-world datasets hinder accurate multi-class classification.
method Information-theoretic classification accuracy (ITCA) and search strategies (greedy, breadth-first) guide label combination.
result ITCA improves prediction accuracy and identifies ambiguous labels across diverse applications.

A new method for automatic gradient tree boosting using information theory.

problem Automatic selection of tree complexity and number in gradient boosting.
method Optimism of greedy leaf splitting procedure modeled as a Cox-Ingersoll-Ross process, leading to an information criterion for model selection.
result The method achieves significant speedups (10-1400) compared to xgboost without sacrificing predictive power.

A method removes treatment-covariate dependence for counterfactual prediction without adversarial training.

problem Counterfactual prediction under assignment bias.
method Information-theoretic approach learning a stochastic representation Z to minimize mutual information with outcomes.
result The method performs favorably in likelihood, counterfactual error, and policy evaluation compared to adversarial baselines.

A framework to compare federated learning algorithms in high-dimensional settings.

problem Comparing the performance of federated learning algorithms in high-dimensional settings.
method Formulating federated learning as a multi-criterion objective and analyzing a linear regression model.
result Federated Averaging with simple client fine-tuning achieves the same asymptotic risk as more intricate approaches and outperforms without personalization.

Bayesian approach scores influential training examples for model predictions.

problem Enhance interpretability and safety of machine learning models.
method Formulate TDA as a Bayesian information-theoretic problem, scoring subsets by information loss.
result Method aligns with classical influence scores while promoting diversity for subsets.

Neural networks have achieved dramatic improvements in recent years and depict the state-of-the-art methods for many real-world tasks nowadays. One drawback is, however, that many of these models are overparameterized, which makes them both computationally and memory intensive. Furthermore, overparameterization can als…

2019-12-10abs ↗pdf ↗

Study shows the corrected Akaike criterion is inadmissible for estimating Kullback-Leibler discrepancy.

problem Inadmissibility of the corrected Akaike information criterion for estimating Kullback-Leibler discrepancy.
method Loss estimation framework to demonstrate inadmissibility and provide improved estimators.
result Improved estimators of Kullback-Leibler discrepancy are provided and perform well in reduced-rank situations.

Complete criterion for VoI in multi-decision influence diagrams established.

problem Analyzing safety and fairness properties of AI systems using influence diagrams.
method Introduced ID homomorphisms and Tree of Systems to prove properties of multi-decision influence diagrams.
result First complete graphical criterion for VoI in influence diagrams with multiple decisions.

SplitWise enhances stepwise regression by adaptively encoding numeric predictors into binary features.

problem Capturing nonlinear relationships in regression models without sacrificing interpretability.
method Adaptive encoding of numeric predictors into binary features using shallow decision trees, assessed by AIC or BIC.
result Consistently produces more parsimonious and generalizable models than traditional techniques.

A new method calibrates value predictions in offline RL to improve reliability.

problem Difficulty in long-horizon value prediction in offline reinforcement learning.
method Bellman calibration, a weak reliability criterion, and Iterated Bellman Calibration.
result Finite-sample guarantees show that Bellman calibration error is controlled at nonparametric rates.

A new criterion selects models in overparameterized settings.

problem Model selection for overparameterized models with more parameters than data.
method Establishes Bayesian duality and introduces the Interpolating Information Criterion.
result The Interpolating Information Criterion selects models in overparameterized settings.

A criterion for training-free time-lagged spectral embeddings of multivariate time series

problem Applicability of fixed-length descriptors for multivariate time series
method Using a stationary Gaussian VAR(1) model and cosine similarity to classify descriptors
result D(τ) separates two classes when signals are approximately stationary and cross-channel temporal coupling is present

A new criterion HBIC improves model selection for factor analysis with missing data.

problem Model selection for factor analysis with incomplete data.
method Proposes a novel criterion HBIC that uses actual observed information in the penalty term.
result HBIC is more accurate than BIC when missing data rates are high.

Bayes predictor remains robust to ignorable missingness shifts.

problem Challenges in prediction with missing covariates and shifts in missingness reasons.
method Bayesian approach and different prediction methods.
result Bayes predictor remains unchanged by ignorable shifts, but robust prediction requires disregarding missingness for non-ignorable shifts.

The Kelly Criterion is applied to prediction markets to analyze risk and return.

problem Mean beliefs in prediction markets often differ from actual prices.
method Logarithmic utility and Kullback-Leibler divergence are used to study risk and return adjustments.
result Misjudgment of bias and investment fraction affect portfolio growth rate.

This paper introduces Kernel-based Information Criterion (KIC) for model selection in regression analysis. The novel kernel-based complexity measure in KIC efficiently computes the interdependency between parameters of the model using a variable-wise variance and yields selection of better, more robust regressors. Expe…

2014-08-25abs ↗pdf ↗

We have recently proposed a new information-based approach to model selection, the Frequentist Information Criterion (FIC), that reconciles information-based and frequentist inference. The purpose of this current paper is to provide a simple example of the application of this criterion and a demonstration of the natura…

2015-06-19abs ↗pdf ↗

This paper addresses the problem of active learning of a multi-output Gaussian process (MOGP) model representing multiple types of coexisting correlated environmental phenomena. In contrast to existing works, our active learning problem involves selecting not just the most informative sampling locations to be observed …

2015-11-21abs ↗pdf ↗

Proposes a new criterion for reliable uncertainty estimation in deep neural networks.

problem Inability of existing approaches to provide reliable uncertainty estimates for deep neural networks.
method Develops a density uncertainty layer architecture that satisfies the proposed criterion.
result Density uncertainty layers provide more reliable uncertainty estimates and robust out-of-distribution detection.

Prediction markets can shape political behavior through persistent signals, not just forecast accuracy.

problem The role of prediction markets beyond forecasting.
method Transaction-level evidence from the 2024 U.S. presidential election, Signal Credibility Index (SCI).
result Price signals in prediction markets are more influential due to persistence, breadth of trader types, and cross-platform consensus.

New method identifies wrongly predicted samples for active learning.

problem Identifying important samples for machine learning models.
method A sample selection criterion based on model prediction and its effect on generalization error.
result State-of-the-art results and better rates at identifying wrongly predicted samples.

When the in-sample Sharpe ratio is obtained by optimizing over a k-dimensional parameter space, it is a biased estimator for what can be expected on unseen data (out-of-sample). We derive (1) an unbiased estimator adjusting for both sources of bias: noise fit and estimation error. We then show (2) how to use the adjust…

2016-02-19abs ↗pdf ↗