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,657 papers · 148 categories

Trend · papers per month

15314661 · May 202619922001200920172026
48 results for percentile intervals

Proposes a method to create shorter, more accurate prediction intervals.

problem Challenges in achieving both conditional validity and interval efficiency in complex settings.
method Uses a conformal-style calibration method for neural network responses, adjusting to empirical PIT distribution.
result Demonstrates better conditional calibration and shorter intervals than existing methods.

Proposes a framework for partially fair machine learning models.

problem Achieving full fairness across all score ranges compromises predictive performance.
method Formulates model training as constrained optimization with difference-of-convex constraints, solvable by IDCA.
result Demonstrates high predictive performance while enforcing partial fairness in specific percentile intervals.

Evidential clustering is an approach to clustering in which cluster-membership uncertainty is represented by a collection of Dempster-Shafer mass functions forming an evidential partition. In this paper, we propose to construct these mass functions by bootstrapping finite mixture models. In the first step, we compute b…

2019-12-12abs ↗pdf ↗

New algorithms optimize a soft-robust criterion in reinforcement learning, reducing conservatism.

problem Computing robust policies for high-stakes decisions with limited data.
method Soft-robust criterion using risk measures, two algorithms for optimization.
result Our algorithms produce less conservative solutions than existing methods.

Bootstrap method for Markov chains in reinforcement learning.

problem Distributional consistency in finite controlled Markov chains with unknown control policies.
method Model-based bootstrap with novel LLN and CLT for visitation counts and transition increments.
result Asymptotically valid confidence intervals for value and QQ-functions in offline RL.

This note displays an interesting phenomenon for percentiles of independent but non-identical random variables. Let X1,,XnX_1,\cdots,X_n be independent random variables obeying non-identical continuous distributions and X(1)X(n)X^{(1)}\geq \cdots\geq X^{(n)} be the corresponding order statistics. For any p(0,1)p\in(0,1), we investig…

2018-08-24abs ↗pdf ↗

Non-parametric bootstrap improves robust portfolio and trading strategy optimization.

problem Mitigating uncertainty in expected returns and covariances in financial decision-making.
method Non-parametric bootstrap framework for robust optimization without distributional assumptions.
result Improved out-of-sample performance with smoother, more stable results.

We propose a novel non-parametric adaptive anomaly detection algorithm for high dimensional data based on rank-SVM. Data points are first ranked based on scores derived from nearest neighbor graphs on n-point nominal data. We then train a rank-SVM using this ranked data. A test-point is declared as an anomaly at alpha-…

2014-05-02abs ↗pdf ↗

We address the problem of computing reliable policies in reinforcement learning problems with limited data. In particular, we compute policies that achieve good returns with high confidence when deployed. This objective, known as the \emph{percentile criterion}, can be optimized using Robust MDPs~(RMDPs). RMDPs general…

2019-10-23abs ↗pdf ↗

We propose a non-parametric anomaly detection algorithm for high dimensional data. We score each datapoint by its average KK-NN distance, and rank them accordingly. We then train limited complexity models to imitate these scores based on the max-margin learning-to-rank framework. A test-point is declared as an anomaly…

2015-02-06abs ↗pdf ↗

We propose a non-parametric anomaly detection algorithm for high dimensional data. We first rank scores derived from nearest neighbor graphs on nn-point nominal training data. We then train limited complexity models to imitate these scores based on the max-margin learning-to-rank framework. A test-point is declared as…

2016-01-22abs ↗pdf ↗

Locally adaptive interpretable regression improves linear regression's predictability.

problem Linear regression's predictability is limited; it lacks adaptability.
method Locally adaptive interpretable regression (LoAIR) uses neural networks to predict percentile of a Gaussian distribution for regression coefficients.
result LoAIR achieves comparable or better predictive performance than state-of-the-art baselines.

The paper tackles fVaR prediction methods in finance.

problem Predicting future values at risk (fVaR) in finance.
method Various methods including Nested MC-empirical quantile, percentiles from distributions, quantile regressions, and limited inner simulations.
result Improved methods for predicting fVaRs, including those that are computationally efficient.

This paper presents a novel scaling method for unbiased risk estimation.

problem Challenges in risk assessment due to limited data, non-stationarity, and heavy tails.
method Develops a statistical framework for efficient risk scaling, extending beyond the square-root-of-time rule.
result Ensures robust and conservative risk estimation, applicable to small sample settings.

New model predicts financial transaction durations using quantiles.

problem Modeling financial transaction durations using traditional mean duration.
method Proposes a new autoregressive conditional duration model based on log-symmetric distributions reparametrized by quantiles.
result Proposed model allows for modeling different percentiles of financial transaction durations.

In this paper we discuss a general methodology to compute the market risk measure over long time horizons and at extreme percentiles, which are the typical conditions needed for estimating Economic Capital. The proposed approach extends the usual market-risk measure, ie, Value-at-Risk (VaR) at a short-term horizon and …

2014-08-11abs ↗pdf ↗

Hydropower reduces system electricity price and volatility, especially at extreme levels.

problem Impact of hydropower on system electricity price and volatility.
method Robust statistical analysis using multiple linear regression and quantile regression.
result Hydropower reduces system electricity price and volatility, especially at extreme levels.

In this paper, we present iPrescribe, a scalable low-latency architecture for recommending 'next-best-offers' in an online setting. The paper presents the design of iPrescribe and compares its performance for implementations using different real-time streaming technology stacks. iPrescribe uses an ensemble of deep lear…

2019-05-31abs ↗pdf ↗

Machine Learning techniques have become pervasive across a range of different applications, and are now widely used in areas as disparate as recidivism prediction, consumer credit-risk analysis and insurance pricing. The prevalence of machine learning techniques has raised concerns about the potential for learned algor…

2019-05-16abs ↗pdf ↗

We study cross-country GDP losses due to financial crises in terms of frequency (number of loss events per period) and severity (loss per occurrence). We perform the Loss Distribution Approach (LDA) to estimate a multi-country aggregate GDP loss probability density function and the percentiles associated to extreme eve…

2012-01-04abs ↗pdf ↗

Having a regression model, we are interested in finding two-sided intervals that are guaranteed to contain at least a desired proportion of the conditional distribution of the response variable given a specific combination of predictors. We name such intervals predictive intervals. This work presents a new method to fi…

2014-02-24abs ↗pdf ↗

Prediction intervals are a valuable way of quantifying uncertainty in regression problems. Good prediction intervals should be both correct, containing the actual value between the lower and upper bound at least a target percentage of the time; and tight, having a small mean width of the bounds. Many prior techniques f…

2018-06-28abs ↗pdf ↗

New methods for ordinal classification of interval-valued data and functional data.

problem Ordinal classification of interval-valued data and functional data.
method Six ordinal classifiers are proposed, including parametric, binary decomposition, logistic regression, distance-based, k-nearest-neighbor, kernel PCA, and random forest methods.
result Considering ordering and interval-valued information improves the accuracy of ordinal classification.

Proposes a method to create prediction intervals for neural networks using cross-validation.

problem Lack of prediction intervals for neural networks.
method k-fold cross-validation to construct conformal prediction intervals.
result Proposed method produces narrower intervals with similar coverage compared to SC method.

The statistical properties of the return intervals τqτ_q between successive 1-min volatilities of 30 liquid Chinese stocks exceeding a certain threshold qq are carefully studied. The Kolmogorov-Smirnov (KS) test shows that 12 stocks exhibit scaling behaviors in the distributions of τqτ_q for different thresholds qq. …

2008-07-11abs ↗pdf ↗

CONTINA provides adaptive confidence intervals for traffic demand prediction.

problem Uncertainty in future traffic demand predictions and the need for valid confidence intervals.
method Adaptive confidence interval method that adjusts based on deployment errors.
result Valid confidence intervals with shorter lengths and theoretical coverage guarantee.

The paper presents a method for generating well-calibrated prediction intervals using quality-driven deep ensembles.

problem Generating reliable prediction intervals for regression analysis.
method A multi-objective loss function combining quality measures for prediction intervals and point estimates, with a penalty function to ensure semantic integrity and stability.
result The method produces well-calibrated prediction intervals and point estimates, capturing both aleatoric and epistemic uncertainty.

Analyzes biased random walks and corrupted intervals in adversarial settings.

problem Learning thresholds and intervals in adversarial conditions.
method Analyzes biased random walks and corrupted intervals under adversarial design.
result Analyzes the expected behavior of biased random walks and corrupted intervals.

Paper introduces a new method for classifying interval-valued time series.

problem Classification of interval-valued time series.
method Extends point-valued time series imaging methods to interval-valued scenarios using DKD_K-distance and employs deep learning for classification.
result Proposed method achieves superior classification performance compared to existing methods.

Extends Fisher's Discriminant Analysis for interval-valued data.

problem Classifying entities represented by intervals and histograms.
method Adapts Fisher's Discriminant Analysis using Moore's interval arithmetic and Mallows' distance.
result Discriminant directions for interval-valued data are numerically maximized.

Study optimality conditions for interval-valued optimization problems on Riemannian manifolds.

problem Optimizing interval-valued functions on Riemannian manifolds under a total order relation.
method Generalized Hukuhara directional differentiability to derive KKT-type optimality conditions.
result Derives optimality conditions for interval-valued optimization problems on Riemannian manifolds.

This work challenges the assumption that shorter conformal prediction intervals are always better.

problem The conventional evaluation of conformal prediction metrics (coverage and interval length) may not fully capture the quality of predictions.
method The Prejudicial Trick (PT) is introduced, which probabilistically returns either a null interval or a longer one to maintain valid coverage while potentially reducing interval length.
result The Prejudicial Trick can yield deceptively shorter intervals without compromising coverage, but introduces practical vulnerabilities.

We investigate scaling and memory effects in return intervals between price volatilities above a certain threshold qq for the Japanese stock market using daily and intraday data sets. We find that the distribution of return intervals can be approximated by a scaling function that depends only on the ratio between the …

2007-09-11abs ↗pdf ↗