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

Trend · papers per month

4468921,3371,783 · Jun 202019922001200920172026
48 results for Model Confidence Set

We propose an algorithm combining calibrated prediction and generalization bounds from learning theory to construct confidence sets for deep neural networks with PAC guarantees---i.e., the confidence set for a given input contains the true label with high probability. We demonstrate how our approach can be used to cons…

2019-12-31abs ↗pdf ↗

Improved regret bounds for logistic bandits via novel confidence set construction.

problem Dependencies in parameter space for logistic bandits, especially when SdS \geq d.
method Regret-to-confidence-set conversion (R2CS) to construct convex confidence sets.
result Strict improvement in regret bound w.r.t. SS in logistic bandits.

The paper provides a method to find optimal machine learning model parameters with confidence.

problem Finding optimal machine learning model parameters that generalize well to the entire population.
method Constructs valid confidence sets for the optimal parameter using only training data.
result Valid confidence sets for optimal machine learning model parameters can be generated using bootstrapping techniques.

This paper studies the geometry of minimum-volume confidence sets for multinomial parameters.

problem Determining if minimum-volume confidence sets for multinomial outcomes are disjoint.
method Enumerating and covering the continuous regions of the exact p-value function to study the geometry of minimum-volume confidence sets.
result The geometry of minimum-volume confidence sets for multinomial parameters is studied, providing insights into their structure and properties.

The paper addresses the gap between theoretical and practical confidence set widths in universal inference.

problem Inference procedures can be overly conservative, leading to wider confidence sets than expected.
method The authors identify the source of asymptotic conservativeness and propose a remedy based on studentization and bias correction.
result The proposed method achieves exact asymptotic coverage at the nominal 1α1-α level, even under model misspecification.

A universal framework for constructing confidence sets using sequential likelihood mixing.

problem Constructing reliable confidence sets for realizable likelihood functions.
method Sequential likelihood mixing, integrating Bayesian inference and regret inequalities.
result Establishes fundamental connections and provable coverage guarantees for various inference techniques.

Paper presents methods to create stock price confidence intervals using LSTM models.

problem Creating accurate confidence intervals for LSTM-estimated stock prices.
method Three bootstrap methods for dependent data, optimal block length selection, and benchmark comparison.
result Illustrated through stock price data, different bootstrap strategies provide varying confidence intervals.

Introduces CCR for constructing confidence regions from conformal predictions.

problem Challenges in constructing confidence regions for model parameters.
method Combines conformal prediction intervals for model outputs to establish confidence regions for parameters under minimal assumptions.
result Valid coverage guarantees for finite sample regime, applicable to various model types.

We consider the setting of linear regression in high dimension. We focus on the problem of constructing adaptive and honest confidence sets for the sparse parameter θ, i.e. we want to construct a confidence set for theta that contains theta with high probability, and that is as small as possible. The l_2 diameter of a …

2015-01-19abs ↗pdf ↗

Develops methods for valid and validated confidence sets in multiclass and multilabel prediction.

problem Challenges of typical conformal prediction methods in multiclass and multilabel problems, especially uneven coverage.
method Leverages quantile regression to build methods that always guarantee correct coverage and asymptotically optimal conditional coverage, addressing label interactions with tree-structured classifiers.
result Empirical evaluation suggests more robust coverage of confidence sets.

This paper introduces a new method for uncertainty quantification in prediction models.

problem Quantifying uncertainty in high-stakes applications like medicine and finance.
method Confidence sets for outcome excursions, focusing on identifying subsets of features where outcomes exceed a threshold.
result Theoretical guarantees for the probability that confidence sets contain the true feature subset, both asymptotically and for finite sample sizes.

Spatially weighted conformal prediction improves uncertainty quantification in house price models.

problem Uncertainty quantification in automated valuation models with spatial dependencies.
method Survey and demonstration of various spatially weighted approaches to adjust conformal prediction confidence sets.
result Spatially weighted CP makes confidence sets more consistently calibrated across geographical regions.

New metrics CWSA and CWSA+ improve model evaluation under confidence thresholds.

problem Lack of metrics capturing model reliability under confidence thresholds.
method Introducing CWSA and CWSA+ metrics that reward confident accuracy and penalize overconfident mistakes.
result CWSA and CWSA+ outperform classical metrics in trust-sensitive tests.

Develops statistical confidence sets for multidimensional scaling.

problem Statistical uncertainty in multidimensional scaling of noisy data.
method Formal statistical framework, distributional convergence results, uniform confidence sets, bootstrap procedures.
result Construction of reliable confidence sets for latent configurations in multidimensional scaling.

The paper shows over-confidence in models isn't just due to over-parametrization.

problem Over-confidence in machine learning models, especially in binary classification.
method Theoretical analysis of logistic regression and other binary classification problems.
result Logistic regression is inherently over-confident in certain settings, but over-confidence is not always the case.

Adversarial training yields robust models against a specific threat model, e.g., LL_\infty adversarial examples. Typically robustness does not generalize to previously unseen threat models, e.g., other LpL_p norms, or larger perturbations. Our confidence-calibrated adversarial training (CCAT) tackles this problem by b…

2019-10-14abs ↗pdf ↗

New method uses weak labels to create valid confidence sets for predictions.

problem Lack of labeled data in machine learning models.
method Developed a conformal prediction framework to provide valid predictive confidence sets using weakly labeled data.
result New coverage definition allows for tighter and more informative (but valid) confidence sets.

New method optimizes offline linear bandits using different confidence sets.

problem Optimizing offline learning for linear contextual bandits.
method Introduces a family of pessimistic learning rules based on p\ell_p confidence sets.
result The π^\hatπ_\infty rule achieves minimax performance and strictly dominates other predictors.

Novel confidence sets improve linear bandit performance by adapting to unknown noise levels.

problem Adapting to unknown noise levels in sequential decision-making.
method Proposed semi-adaptive and variance-adaptive confidence sets.
result Improved regret bounds and better performance in Bayesian optimization tasks.

The age of big data has produced data sets that are computationally expensive to analyze and store. Algorithmic leveraging proposes that we sample observations from the original data set to generate a representative data set and then perform analysis on the representative data set. In this paper, we present efficient a…

2016-06-05abs ↗pdf ↗

Proposes a method to compute valid lower confidence bounds for multiple models selected based on their performance.

problem Model selection and evaluation in machine learning.
method Interprets model selection as a simultaneous inference problem, uses bootstrap tilting and maxT-type multiplicity correction.
result Yields valid lower confidence bounds that are at least as good as standard approaches and reliably reach nominal coverage probability.

New method HNCI for evaluating treatment effects in network interference.

problem Evaluating the effectiveness of treatments or policies under network interference.
method High-dimensional network causal inference (HNCI) using linear regression with latent homogeneity.
result Valid confidence intervals and sets for average direct treatment effect and neighborhood size.

General predictive models do not provide a measure of confidence in predictions without Bayesian assumptions. A way to circumvent potential restrictions is to use conformal methods for constructing non-parametric confidence regions, that offer guarantees regarding validity. In this paper we provide a detailed descripti…

2016-09-19abs ↗pdf ↗

Paper presents robust confidence sequences for means with known moment bounds and arbitrary corruption.

problem Tackles robustness to outliers and adversarial corruptions in mean estimation.
method Designs new robust exponential supermartingales to create confidence sequences.
result Achieves optimal width and shows smaller margin of error compared to fixed-time robust methods.

A new method uses SVM classification to efficiently compute confidence sets.

problem Computing confidence sets for moment inequalities is computationally intensive.
method Converts confidence set construction into a classification problem using SVM.
result Asymptotically reproduces the test in the confidence set using SVM classification.

Paper improves confidence intervals and variance estimation for deep learning models.

problem Improving confidence intervals and variance estimation in deep learning models.
method Residual-based framework for conditional variance estimation; robust bootstrap procedure for confidence intervals.
result First non-asymptotic bounds for variance estimation using ReLU networks.

We shrink confidence sets for equivalent discrete distributions using permutation equivalence.

problem Building high-probability confidence sets for equivalent discrete distributions.
method Exploiting permutation-equivalence to refine confidence sets.
result Confidence sets shrink at asymptotic rates of O(1/kKnk)O(1/\sqrt{\sum_{k\in \mathcal K} n_k}) and O(1/maxkKnk)O(1/\max_{k\in K} n_{k}).

Develops methods for estimating and providing confidence bands in sparse high-dimensional additive models.

problem Estimating and providing reliable confidence bands for nonparametric components in high-dimensional additive models.
method Integrates sieve estimation into a high-dimensional Z-estimation framework, employing a multiplier bootstrap procedure.
result Constructs uniformly valid confidence bands for the target component f1f_1 in sparse high-dimensional additive models.

New method for linear bandits with unknown sparsity, improving sparse regret bounds.

problem Sparse regret bounds for unknown sparsity and adversarial action sets.
method Combines online to confidence set conversions with randomized model selection over nested confidence sets.
result First sparse regret bounds for unknown sparsity and adversarial action sets.

The paper proposes a method to construct confidence sets using likelihood ratios for sequential decision-making.

problem Constructing valid uncertainty estimates for unknown quantities in sequential decision-making.
method The method uses likelihood ratios to create any-time valid confidence sequences without specialized treatment for each application.
result The proposed confidence sets maintain the prescribed coverage in a model-agnostic manner and their size depends on the choice of estimator sequence.

New attacks can infer model training membership using only label predictions, not confidence.

problem Inferring whether a data point was used to train a machine learning model.
method Evaluate model's predicted labels under perturbations to infer membership.
result Label-only attacks perform as well as confidence-based attacks and break defenses that rely on confidence masking.

This paper presents the R package MCS which implements the Model Confidence Set (MCS) procedure recently developed by Hansen et al. (2011). The Hansen's procedure consists on a sequence of tests which permits to construct a set of 'superior' models, where the null hypothesis of Equal Predictive Ability (EPA) is not rej…

2014-10-30abs ↗pdf ↗

FROB model improves robustness and reliable confidence for few-shot OoD detection.

problem Challenges in few-shot classification and OoD detection due to limited samples and adversarial attacks.
method FROB model combines support boundary generation and few-shot Outlier Exposure (OE) for improved robustness and reliable confidence.
result FROB achieves generalization to unseen OoD and maintains robustness independent of few-shot number.

New method estimates grouping loss in neural networks to improve confidence scores.

problem Improving confidence scores in neural networks to reflect true posterior probabilities.
method Proposed an estimator to approximate the grouping loss.
result Modern neural networks exhibit grouping loss, especially in distribution shifts.

New method identifies diffusion sources on networks with statistical confidence.

problem Identifying sources of diffusion on networks without restrictive assumptions.
method Statistical framework and confidence set inference approach based on hypothesis testing.
result Efficiently produces a small subset of nodes covering the source node with any confidence level.