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

Trend · papers per month

129259388517 · Jun 202019922001200920172026
48 results for confidence analysis

Research aims to improve confidence intervals for RKHS elements in online learning.

problem Improper confidence intervals lead to suboptimal regret bounds in kernel-based bandit and reinforcement learning.
method Formalizes the open problem of online confidence intervals in RKHS and reviews existing results.
result Identifies the online nature of observation points as the main challenge for tight confidence intervals.

This paper improves GP-UCB by using a shifted exponential distribution for confidence parameters.

problem Theoretical confidence parameter in GP-UCB increases with iterations, leading to large values.
method Introduced IRGP-UCB, a randomized variant of GP-UCB using a shifted exponential distribution for confidence parameters.
result IRGP-UCB achieves sub-linear regret without increasing the confidence parameter.

This paper reviews methods for constructing confidence intervals for error rates in 1:1 matching tasks.

problem Challenges in assessing uncertainty of error rates in matching algorithms, especially when data are dependent and error rates are low.
method Derives and examines statistical properties of methods for constructing confidence intervals for error rates in 1:1 matching tasks.
result Coverage and interval width vary with sample size, error rates, and data dependence.

This study examines how fashion consumption affects self-confidence and buying behavior in Iranian consumers.

problem Understanding the role of self-confidence in fashion buying behavior.
method A questionnaire was used to collect data from 400 consumers in Tehran's clothing market. Structural equations and factor analysis were employed to test the model.
result Interest in fashion, personal taste, utilitarianism, and new products positively impact self-confidence, and self-confidence positively impacts fashion buying behavior.

Improved confidence bounds for linear logistic model with applications to bandits.

problem Improving confidence bounds for linear logistic model.
method Self-concordant analysis of the logistic loss to avoid dependence on worst-case variance.
result Significant improvement in confidence bounds, avoiding dependence on 1/κ1/κ.

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 ↗

We consider using an ensemble of binary classifiers for transductive prediction, when unlabeled test data are known in advance. We derive minimax optimal rules for confidence-rated prediction in this setting. By using PAC-Bayes analysis on these rules, we obtain data-dependent performance guarantees without distributio…

2015-01-15abs ↗pdf ↗

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 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.

Paper improves regret bounds for Gaussian process upper confidence bound in Bayesian optimization.

problem Minimizing regret in Gaussian process bandit optimization.
method Gaussian process upper confidence bound (GP-UCB) algorithm with refined analysis.
result Achieves O(Tln2T)O(\sqrt{T \ln^2 T}) cumulative regret under squared exponential kernel.

Confidence bands for tuning curves improve hyperparameter comparison in NLP.

problem Ambiguity in comparing hyperparameter tuning methods.
method Constructs exact, simultaneous, and distribution-free confidence bands for tuning curves.
result Confidence bands provide a robust basis for comparing methods rigorously.

Develops methods for inference after detecting a change in sequential data.

problem Inference after a detected change in sequential data.
method General framework for constructing confidence sets using only data up to a stopping time.
result First general method for sequential changepoint localization with theoretical guarantees.

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.

The paper identifies the best treatment to maximize NDPO, a key outcome in causal mediation analysis.

problem Identifying the treatment that maximizes the expected natural direct potential outcome (NDPO) in causal mediation analysis.
method Developed a fixed-confidence best-arm identification (BAI) algorithm based on the Track-and-Stop (TaS) framework, using a cutting-set method to solve a semi-infinite optimization problem.
result The proposed algorithm achieves sample-efficient identification with a high-probability correctness guarantee and asymptotic optimality.

New algorithm reduces regret and constraint violation in adversarial CMDP learning.

problem Online learning for episodic stochastically constrained Markov decision processes (CMDPs) with adversarial loss.
method Upper Confidence Primal-Dual Reinforcement Learning (UC-PDL) algorithm.
result Achieves O~(LSAT)\widetilde{\mathcal{O}}(L|\mathcal{S}|\sqrt{|\mathcal{A}|T}) upper bounds of both regret and constraint violation.

We provide a pointwise confidence bound for non-linear least-squares with fixed design.

problem Confidence estimation in non-linear 2\ell^2-regularized least squares.
method Pointwise confidence bound for local minimizers, using weighted norm involving inverse-Hessian.
result The proposed confidence bound scales with the test input's similarity to the training data.

Paper bridges statistical inference for DP-SGD, a privacy-preserving machine learning method.

problem Asymptotic statistical inference for Differentially Private Stochastic Gradient Descent (DP-SGD).
method Established asymptotic properties of SGD under randomized subsampling, extended to DP-SGD, proposed methods for constructing valid confidence intervals.
result Valid confidence intervals for DP-SGD output achieve nominal coverage rates while maintaining privacy.

Discriminatively trained neural classifiers can be trusted, only when the input data comes from the training distribution (in-distribution). Therefore, detecting out-of-distribution (OOD) samples is very important to avoid classification errors. In the context of OOD detection for image classification, one of the recen…

2019-04-27abs ↗pdf ↗

I introduce and analyse an anytime version of the Optimally Confident UCB (OCUCB) algorithm designed for minimising the cumulative regret in finite-armed stochastic bandits with subgaussian noise. The new algorithm is simple, intuitive (in hindsight) and comes with the strongest finite-time regret guarantees for a hori…

2016-03-29abs ↗pdf ↗

The paper tackles confidence calibration for exploratory machine learning problems.

problem Difficulty in curating datasets and confusion about category validity.
method Introduces four new algorithms for category-specific confidence estimation, including kernel density ratios.
result Kernel density ratios provide a novel approach to confidence calibration, especially for exploratory problems.

A new confidence measure improves self-training in biased data.

problem Improving self-training in biased data.
method Proposes a new confidence measure, T-similarity, based on ensemble diversity of linear classifiers.
result Empirically shows the benefit of T-similarity for pseudo-labeling policies on various datasets.

Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions to measure evidence conflict and stability.

problem Modern data analysis lacks mechanisms to show the clarity, conflict, or stability of evidence behind predictions.
method Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions.
result SEF measures conflict and stability, and shows that conflict can improve loss prediction beyond confidence.

Paper develops a BERT-based classifier to reduce pathology report annotation workload.

problem Manual annotation of pathology reports is labor-intensive and time-consuming.
method Developed an automatic text classifier using BERT and introduced a human-centric metric to identify low-confidence cases.
result The model reduces manual annotation workload by 80% to 98%.

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 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.

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.

Paper derives convergence rates and confidence intervals for LSA with Markovian noise.

problem Analyzing convergence rates and constructing confidence intervals for LSA with Markovian noise.
method Derives non-asymptotic Berry-Esseen bounds and multiplier block bootstrap procedure.
result Provides O(n1/4)\mathcal{O}(n^{-1/4}) convergence rates and guarantees consistent inference.

New method for accurate uncertainty estimation in deep learning predictions.

problem Insufficient methods for assessing prediction uncertainty in deep learning.
method Valid non-parametric bootstrap method for deep neural networks.
result Accurate confidence intervals and simultaneous confidence bands for survival data.

Corporate transparency reduces investors' disposition effect by increasing confidence in holding profitable and losing stocks.

problem Irrational disposition effect in investors selling profitable assets too soon and holding onto losing assets for too long.
method Examined the impact of corporate transparency on individual investors' disposition effect.
result Increased corporate transparency significantly reduces the disposition effect.

We design a general framework for answering adaptive statistical queries that focuses on providing explicit confidence intervals along with point estimates. Prior work in this area has either focused on providing tight confidence intervals for specific analyses, or providing general worst-case bounds for point estimate…

2019-06-21abs ↗pdf ↗

GPT-4 assesses its confidence in answering USMLE questions with and without feedback.

problem Understanding AI's performance in healthcare applications, especially in sensitive areas like medical education.
method Used a prompting technique to evaluate GPT-4's confidence scores before and after answering USMLE questions, categorized into with and without feedback.
result Feedback influences relative confidence but doesn't consistently increase or decrease it.