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

2725448161,088 · Jun 202019922001200920172026
48 results for feature 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.

A framework for quantifying uncertainty in feature importance values.

problem Stable interpretation of feature importance values in machine learning models.
method A novel method based on pairwise comparisons of feature importance values to produce confidence intervals for feature ranks.
result The method produces simultaneous confidence intervals for feature ranks, enabling selection of top-k important features.

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.

Study three types of uncertainty quantification for binary classification without distributional assumptions.

problem Uncertainty quantification for binary classification in a distribution-free setting.
method Established theorems connecting calibration, confidence intervals, and prediction sets for score-based classifiers.
result Distribution-free calibration is only possible using scoring functions that partition feature space into countably many sets.

PML-LFC improves PML by estimating label confidence from both feature and label spaces.

problem PML challenges in real-world scenarios where only some labels are relevant.
method PML-LFC estimates label confidence using feature and label space similarities, training a predictor with these values.
result PML-LFC achieves superior performance on synthetic and real-world datasets.

Contrastive regularization improves semi-supervised learning by better propagating confident pseudo-labels.

problem Consistency regularization's limitation in high performance and efficiency.
method Proposes contrastive regularization to update model features, pushing confident labels into unlabeled samples.
result Improves semi-supervised learning tasks with fewer training iterations and robust performance.

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.

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 ↗

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.

Efficient local planning with linear approximations for agents with limited simulator access.

problem Planning with limited simulator access in reinforcement learning.
method Confident Monte Carlo Least Square Policy Iteration (Confident MC-LSPI) and Politex (Confident MC-Politex) algorithms.
result The algorithms can learn the optimal policy with local simulator access, even for linear Q-functions.

New algorithm identifies best arm in semiparametric bandits with near optimal efficiency.

problem Fixed-confidence Best Arm Identification in semiparametric bandits with unknown baseline shift.
method Phase-elimination algorithm based on orthogonalized regression design.
result Nearly optimal high-probability sample-complexity upper bound established.

A new differentiable UCB algorithm for linear bandits learns adaptive confidence bounds.

problem Inability of UCB to strike optimal exploration-exploitation due to confidence bounds.
method Proposes a differentiable linear bandit algorithm and a gradient estimator for learning adaptive confidence bounds.
result Achieves a ildeO(β^dT) ilde{\mathcal{O}}(\hatβ\sqrt{dT}) upper bound of TT-round regret.

Paper proposes sparse classification method for high-dimensional data.

problem Sparse classification in high-dimensional data with positive-confidence samples.
method Developed a novel sparse-penalization framework using L1, SCAD, and MCP penalties for convex and non-convex shrinkage.
result Proved near minimax-optimal sparse recovery rates under Restricted Strong Convexity condition.

Study compares imputation methods' effects on IML confidence intervals.

problem Missing data impacts IML interpretation and confidence intervals.
method Compared single vs multiple imputation methods on IML confidence intervals.
result Multiple imputation provides closer coverage to nominal than single imputation.

Mahalanobis distance detects anomalies well, but not for classification.

problem Detecting anomalies in neural classifier outputs.
method Analyzes Mahalanobis distance-based anomaly detection method, revealing its reliance on information not useful for classification.
result Combining Mahalanobis and ODIN methods improves anomaly detection performance and robustness.

Kernel balancing weights are generalized as KRRR, providing better confidence intervals for treatment effects.

problem Lack of generalization error, correct feature specification, and limited to average effects.
method Interpreting kernel balancing weights as KRRR, relaxing feature specification, and extending Gaussian approximation.
result KRRR provides strong generalization properties and justifies confidence sets for causal functions.

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.

In many applications, an anomaly detection system presents the most anomalous data instance to a human analyst, who then must determine whether the instance is truly of interest (e.g. a threat in a security setting). Unfortunately, most anomaly detectors provide no explanation about why an instance was considered anoma…

2015-02-28abs ↗pdf ↗

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 ↗

The study examines when to trust confidence thresholding in pseudo-labelling regression.

problem Calibrated probabilities from classifiers used for pseudo-labelling need careful handling to avoid bias in downstream regression.
method Developed a diagnostic apparatus to predict and bound the bias induced by confidence thresholding, derived a closed-form expression for the attenuation bias.
result The bias can be predicted from the residual score variance VV^{*}, motivating a structural separation between classifier features and downstream controls.

Optimal algorithms identify non-dominated arms in multi-output linear bandit models.

problem Identifying the Pareto Set in multi-output linear bandit models.
method Design-based algorithms for Pareto Set Identification (PSI) in a structured multi-output linear bandit model.
result Nearly optimal guarantees in both fixed-budget and fixed-confidence settings.

There are two major paradigms of white-box adversarial attacks that attempt to impose input perturbations. The first paradigm, called the fix-perturbation attack, crafts adversarial samples within a given perturbation level. The second paradigm, called the zero-confidence attack, finds the smallest perturbation needed …

2019-10-01abs ↗pdf ↗

ACORE improves hypothesis testing and confidence sets in likelihood-free inference.

problem Constructing hypothesis tests and confidence sets in likelihood-free inference settings.
method Formulates classical LRT as a classification problem, uses machine learning to improve estimates.
result Demonstrates improved accuracy in hypothesis testing and 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 ↗

New algorithm tackles non-stationary reinforcement learning with general function approximation.

problem Understanding non-stationary MDPs with function approximation.
method Dynamic Bellman Eluder (DBE) dimension for complexity, sliding window mechanism, confidence set design.
result Upper bound on dynamic regret for proposed SW-OPEA algorithm.

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.

CNNs overinterpret inputs, leading to high accuracy without meaningful features.

problem High accuracy in image classifiers can mask subtle model failures.
method Batched Gradient SIS method for discovering sufficient input subsets.
result Overinterpretation allows models to make confident predictions with masked input features.

New method calibrates confidence for object detection and segmentation models.

problem Intrinsically miscalibrated confidence estimates in object detection and segmentation models.
method Introduces multivariate confidence calibration for object detection and segmentation, extending ECE.
result Improves calibration, positively impacts segmentation quality.

The paper discusses methods for interval estimation of coefficients in penalized regression models for insurance data.

problem Valid inference on coefficients after feature selection in GLM family for insurance data.
method Proposes methodologies for constructing confidence intervals of coefficients after feature selection in GLM family.
result Valid inference on coefficients after feature selection in GLM family for insurance data.

Improves statistical inference using machine learning predictions with imputed data.

problem Invalid statistical inference due to machine learning prediction errors.
method Bootstrap confidence intervals for nonuniform samples and arbitrary imputed features.
result Valid confidence intervals without assumptions on machine learning model quality.

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