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

126251377502 · Jun 202019922001200920172026
48 results for LOO prediction

In this paper we consider the problem of Gaussian process classifier (GPC) model selection with different Leave-One-Out (LOO) Cross Validation (CV) based optimization criteria and provide a practical algorithm using LOO predictive distributions with such criteria to select hyperparameters. Apart from the standard avera…

2012-06-26abs ↗pdf ↗

A new method improves robustness and efficiency of Bayesian LOO-CV.

problem Computational expense and unreliability of classical LOO-CV in high-dimensional Bayesian models.
method Proposes a mixture estimator to compute Bayesian LOO-CV criteria with finite asymptotic variance.
result Improved robustness and efficiency in high-dimensional problems.

LOO prediction method improves generalization guarantees for arbitrary datasets.

problem Understanding LOO error guarantees in fully transductive settings for arbitrary datasets.
method Median of Level-Set Aggregation (MLSA) for empirical-risk level sets.
result Multiplicative oracle inequality for LOO error with complexity scaling.

Model inference, such as model comparison, model checking, and model selection, is an important part of model development. Leave-one-out cross-validation (LOO) is a general approach for assessing the generalizability of a model, but unfortunately, LOO does not scale well to large datasets. We propose a combination of u…

2019-04-24abs ↗pdf ↗

A method for non-parametric conditional distribution estimation using CRPS-optimal binning.

problem Non-parametric conditional distribution estimation.
method Partitioning covariate-sorted observations into bins to minimize LOO-CRPS, selecting K by K-fold cross-validation of test CRPS.
result Produces narrower prediction intervals with near-nominal coverage compared to split-conformal competitors.

A reflexion space is generalization of a symmetric space introduced by O. Loos. We generalize locally symmetric spaces to local reflexion spaces in the similar way. We investigate, when local reflexion spaces are equivalently given by a locally flat Cartan connection of certain type.

2012-07-01abs ↗pdf ↗

Statistical machine learning models should be evaluated and validated before putting to work. Conventional k-fold Monte Carlo Cross-Validation (MCCV) procedure uses a pseudo-random sequence to partition instances into k subsets, which usually causes subsampling bias, inflates generalization errors and jeopardizes the r…

2019-07-04abs ↗pdf ↗

Backward Conformal Prediction offers flexible control over prediction set sizes while ensuring coverage guarantees.

problem Providing reliable prediction sets with controlled sizes in applications like medical diagnosis.
method Defines a rule that constrains prediction set sizes based on observed data, adapting coverage levels.
result Maintains computable coverage guarantees while ensuring interpretable, well-controlled prediction set sizes.

New algorithms optimize actions under time-varying constraints without projecting.

problem Optimizing actions under time-varying constraints without projecting.
method Projection-free algorithms using linear optimization oracle.
result Guaranteed ildeO(T3/4) ilde{O}(T^{3/4}) regret and O(T7/8)O(T^{7/8}) constraints violation.

A new KDE model prevents singular solutions and accelerates optimization for probabilistic modeling.

problem Adapting to varying densities in data regions for probabilistic modeling.
method Adaptive KDE model with individual bandwidths, LOO-MLL criterion, and modified EM algorithm.
result The proposed models prevent singular solutions and have promising performance.

We classify homotopes of classical symmetric spaces (studied in Part I of this work). Our classification uses the fibered structure of homotopes: they are fibered as symmetric spaces, with flat fibers, over a non-degenerate base; the base spaces correspond to inner ideals in Jordan pairs. Using that inner ideals in cla…

2010-11-13abs ↗pdf ↗

Hua domain, named after Chinese mathematician Loo-Keng Hua, is defined as a domain in Cn\mathbb{C}^{n} fibered over an irreducible bounded symmetric domain ΩCd  (d<n)Ω\subset \mathbb{C}^{d}\;(d<n) with the fiber over zΩz\in Ω being a (nd)(n-d)-dimensional generalized complex ellipsoid Σ(z)Σ(z). In general, a Hua domain is a nonhom…

2014-11-12abs ↗pdf ↗

This is the pdf -version of the author's Ph.D. thesis (1995, ULB, Belgium). The notion of symeplectic symmertic space is introduced and studied via Lie theoretical and symplectic geoemetrical methods. The first chapter concerns basic poperties, however, an explicit formula for the Loos connection in the symplectic fram…

2007-03-12abs ↗pdf ↗

Deep neural networks obtain state-of-the-art performance on a series of tasks. However, they are easily fooled by adding a small adversarial perturbation to input. The perturbation is often human imperceptible on image data. We observe a significant difference in feature attributions of adversarially crafted examples f…

2019-06-08abs ↗pdf ↗

A Banach symmetric space in the sense of O. Loos is a smooth Banach manifold MM endowed with a multiplication map μ ⁣:M×MMμ\colon M \times M \to M such that each left multiplication map μx:=μ(x,)μ_x := μ(x,\cdot) (with xMx \in M) is an involutive automorphism of (M,μ)(M,μ) with the isolated fixed point xx. We show that morphisms of …

2009-11-11abs ↗pdf ↗

Improves visualization of high-dimensional data by correcting misleading artifacts in neighbor embedding methods.

problem Misleading visual artifacts in t-SNE and UMAP due to lack of data-independent manifold learning interpretations.
method LOO-map framework that extends embedding maps to the entire input space, identifying and correcting map discontinuities.
result Developed point-wise diagnostic scores to detect unreliable embedding points and improve hyperparameter selection.

Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.

problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.

Self-calibrating conformal prediction improves interval efficiency and offers a practical alternative.

problem Improving the reliability and uncertainty quantification of machine learning predictions.
method Combines Venn-Abers calibration and conformal prediction for binary and regression problems.
result Improves interval efficiency through model calibration and offers practical alternatives.

Study uses deep learning to predict asset prices, finds complex target processes lead to meaningless predictions.

problem Complexity of successful price prediction models hinders understanding.
method Deep learning models for high-frequency price prediction, focusing on volatility and directional prediction.
result Inadequately defined target price process renders predictions meaningless.

The paper emphasizes the importance of joint predictions over marginal predictions for decision-making.

problem The need for accurate joint predictions in decision-making problems.
method The paper analyzes combinatorial decision problems, sequential predictions, and multi-armed bandits, introducing an approximate Thompson sampling algorithm and new regret bounds.
result Accurate joint predictions are essential for good performance in decision-making problems.

Behavior modification improves prediction accuracy by nudging user behavior.

problem Improving prediction accuracy using behavior modification techniques.
method Combining prediction and behavior modification with reinforcement learning algorithms.
result Behavior modification can make predictions more certain but may not generalize.

Prediction problems often admit competing models that perform almost equally well. This effect challenges key assumptions in machine learning when competing models assign conflicting predictions. In this paper, we define predictive multiplicity as the ability of a prediction problem to admit competing models with confl…

2019-09-14abs ↗pdf ↗

Proposes feature conformal prediction for broader application in semantic feature spaces.

problem Establishing valid prediction intervals in semantic feature spaces.
method Extends conformal prediction to semantic feature spaces using deep representation learning.
result Feature conformal prediction outperforms regular conformal prediction under mild assumptions.

Acute kidney injury (AKI) commonly occurs in hospitalized patients and can lead to serious medical complications. In order to optimally predict AKI before it develops at any time during a hospital stay, we present a novel framework in which AKI is continually predicted automatically from EHR data over the entire hospit…

2019-02-26abs ↗pdf ↗

AutoCP automates the construction of accurate prediction intervals.

problem Creating valid and accurate prediction intervals for machine learning models.
method AutoML framework that optimizes prediction interval length for better accuracy and less conservatism.
result AutoCP significantly outperforms benchmark algorithms in constructing accurate prediction intervals.

Proposes a method to apply conformal prediction to probabilistic time series forecasting models.

problem Obtaining accurate prediction regions for multi-step time series forecasting with probabilistic models.
method Conformalises conditional normalising flows to generate potentially disjoint prediction regions.
result Improves predictive efficiency in time series forecasting with multimodal distributions.

ICP improves prediction intervals for continuous outcomes at lower computational cost.

problem Systematic bias in point predictions that undermines their use in decision-making.
method Develops Isotonic Conformal Prediction (ICP) framework to decouple calibration from prediction-set construction.
result SICP and TICP procedures match SC-CP coverage at lower computational cost.

Optimizes predictions for specific tasks using parametrized decision analysis.

problem Optimizing predictions for specific decision tasks of interest.
method Designs a class of parametrized actions for Bayesian decision analysis.
result Derives efficient and interpretable solutions for various action parametrizations and loss functions.

This paper discusses a counterpart of conformal prediction for e-values, conformal e-prediction. Conformal e-prediction is conceptually simpler and had been developed in the 1990s as a precursor of conformal prediction. When conformal prediction emerged as result of replacing e-values by p-values, it seemed to have imp…

2020-01-16abs ↗pdf ↗

RFpredInterval package builds prediction intervals for random forests and boosted forests.

problem Quantifying uncertainty in random forest and boosted forest point predictions.
method 16 methods to build prediction intervals with random forests and boosted forests.
result The proposed method outperforms existing methods in building prediction intervals.

FPPI selectively uses predictions to improve inference efficiency.

problem Improving statistical inference with limited labeled data and heterogeneous prediction quality.
method Filtered Prediction-Powered Inference (FPPI) framework.
result FPPI achieves strictly improved asymptotic efficiency compared to existing methods.

COP improves online conformal prediction by incorporating data patterns, leading to tighter prediction sets.

problem Overly conservative prediction sets in online conformal prediction methods when data distribution shifts.
method Conformal Optimistic Prediction (COP) incorporating estimated cumulative distribution function of non-conformity scores.
result COP produces tighter prediction sets with valid coverage guarantees, outperforming other methods.

Most existing examples of full conformal predictive systems, split-conformal predictive systems, and cross-conformal predictive systems impose severe restrictions on the adaptation of predictive distributions to the test object at hand. In this paper we develop split-conformal and cross-conformal predictive systems tha…

2019-02-18abs ↗pdf ↗