Learning a classifier with control on the false-positive rate plays a critical role in many machine learning applications. Existing approaches either introduce prior knowledge dependent label cost or tune parameters based on traditional classifiers, which lack consistency in methodology because they do not strictly adh…
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
48 results for “false-positive rate”
Study controls error rates of binary classifiers using hypothesis testing.
problem Traditional binary classifiers have uncontrolled error rates.
method Combines binary classification with statistical hypothesis testing.
result Trained classifiers can be made to meet target error rate thresholds.
Sequential Multivariate Change Detection with Calibrated and Memoryless False Detection Ratesstat.ME
New method calibrates false detection rates in sequential change detection.
problem Challenges in setting time-invariant thresholds for false positives.
method Simulation-based approach to time-varying thresholds.
result Accurately targets desired expected runtime while keeping false positive rate constant.
Data-Driven Estimation of the False Positive Rate of the Bayes Binary Classifier via Soft Labelscs.LG
Paper estimates FPR of Bayes classifier using soft labels.
problem Determining optimal classifier performance.
method Uses soft labels and denoising technique.
result Consistent and unbiased FPR estimator developed.
We address the problem of non-parametric multiple model comparison: given candidate models, decide whether each candidate is as good as the best one(s) or worse than it. We propose two statistical tests, each controlling a different notion of decision errors. The first test, building on the post selection inference…
Representation learning with a transformer by contrastive learning for money laundering detectioncs.LG
Transformer learns representations from time series data for money laundering detection.
problem Detecting money laundering using structured time series data.
method Contrastive learning for representation learning, followed by scoring and thresholding.
result Transformer outperforms rule-based and LSTM methods in detecting money laundering with controlled false positives.
Algorithm detects concept drift and adapts models in streaming data.
problem Concept drift in streaming data renders models inaccurate.
method Adaptive learning algorithm that detects drifts and reacts to them.
result Risk competitive to an algorithm with perfect drift knowledge.
Framework uses human feedback to safely set OOD detection thresholds, reducing false positives.
problem Challenges in setting OOD detection thresholds for safety-critical applications.
method Mathematically grounded framework leveraging expert feedback to dynamically update thresholds.
result Guaranteed to meet FPR constraint while minimizing human feedback, maintaining FPR at most 5%.
A statistical test controls false positives in anomaly localization using diffusion models.
problem Uncertainty and bias in generative models for anomaly localization.
method Selective inference to quantify significance and control false positives.
result The method effectively controls false positive detection rates.
FairCal improves face verification accuracy while making results fairer.
problem Bias in face recognition models disproportionately affects minority groups.
method Post-training approach that builds fairer decision classifiers using pre-trained model features.
result State-of-the-art results with increased accuracy and fairness.
Generating large quantities of quality labeled data in medical imaging is very time consuming and expensive. The performance of supervised algorithms for various tasks on imaging has improved drastically over the years, however the availability of data to train these algorithms have become one of the main bottlenecks f…
Develops a new criterion for subgroup fairness in algorithmic decision support.
problem Identifying fair recommendations in algorithms despite group-level differences.
method IJDI criterion and IJDI-Scan approach to detect and mitigate disparities.
result Identifies significant disparities in recommendations across subpopulations.
A neural network for online NP classification with reduced complexity.
problem Online nonlinear Neyman-Pearson classification.
method Single hidden layer feedforward neural network (SLFN) initialized with random Fourier features (RFFs). Uses stochastic gradient descent for sequential learning.
result Expedited online adaptation and powerful nonlinear Neyman-Pearson modeling.
Proposes cost-sensitive feature selection for SVMs.
problem Asymmetric misclassification costs in feature selection.
method Mathematical optimization-based approach for SVMs.
result Substantial reduction in feature count with desired error rates.
SFS-DA method statistically tests FS reliability under domain adaptation.
problem Feature selection reliability under domain adaptation with limited target data.
method Selective Inference framework to control false positive rate and enhance true positive rate.
result SFS-DA method controls FPR below a pre-specified level (e.g., 0.05) while maximizing true positive rate.
Enhanced attacks quantify machine learning data leakage.
problem Quantifying how much machine learning models reveal about their training data.
method Hypothesis testing framework for membership inference attacks.
result New attacks achieve higher true positive rates with lower false positive rates.
We present a new approach for mitigating unfairness in learned classifiers. In particular, we focus on binary classification tasks over individuals from two populations, where, as our criterion for fairness, we wish to achieve similar false positive rates in both populations, and similar false negative rates in both po…
Simple methods combine statistical tests for out-of-distribution detection.
problem Detecting data points not following the training distribution.
method Combining classical parametric tests (Rao's score test) and a typicality test.
result Combining Fisher's method of test statistics improves out-of-distribution detection accuracy.
The problem of multiple hypothesis testing arises when there are more than one hypothesis to be tested simultaneously for statistical significance. This is a very common situation in many data mining applications. For instance, assessing simultaneously the significance of all frequent itemsets of a single dataset entai…
Paper introduces PTL-SI for statistical inference in TL-HDR, controlling FPR.
problem Quantifying statistical significance in TL-HDR with limited data.
method PTL-SI framework for valid -values in TL-HDR feature selection.
result Valid -values and controlled FPR in TL-HDR feature selection.
AutoYara generates effective Yara rules faster than humans.
problem Developing high-quality Yara rules for malware families is labor-intensive.
method Leverages biclustering on large n-grams to automate Yara rule generation.
result AutoYara reduces analyst workload by 44-86% and matches human performance.
The paper proposes a method to test features selected by SeqFS-DA with controlled FPR.
problem Ensuring reliability of feature selection after domain adaptation in high-dimensional regression.
method Proposes a novel method to test features selected by SeqFS-DA with controlled FPR.
result The proposed method controls FPR below a significance level (e.g., 0.05) and enhances statistical power.
New optimization method improves AUC for binary classification and changepoint detection.
problem Non-convex AUC and sub-optimal points in ROC curves.
method AUM (Area Under Min(FP, FN)) surrogate loss function based on sorting and summing ROC curve points.
result AUM minimization learning algorithm improves AUC and speeds up compared to previous methods.
Automated detection of MS lesions improves to 67% with 7T MRI.
problem Accurate detection of small, scarce cortical lesions in MS patients.
method 3D U-Net with brain tissue segmentation, supervised training on 7T MRI.
result 67% lesion detection rate with 42% false positives.
We present a powerful new loss function and training scheme for learning binary hash functions. In particular, we demonstrate our method by creating for the first time a neural network that outperforms state-of-the-art Haar wavelets and color layout descriptors at the task of automated scene matching. By accurately rel…
Machine learning detects subhalos in lensed images with high accuracy and low false positives.
problem Detecting substructure in strongly lensed images.
method Developed a neural network for image segmentation to locate and mass estimate subhalos.
result The network can detect subhalos with masses and measure the subhalo mass function.
We propose a novel algorithm for learning fair representations that can simultaneously mitigate two notions of disparity among different demographic subgroups in the classification setting. Two key components underpinning the design of our algorithm are balanced error rate and conditional alignment of representations. …
Paper introduces a statistical framework for watermarking LLM-generated text.
problem Detecting LLM-generated text from human-written text with statistical signals.
method Hypothesis testing formulation, pivotal statistic selection, secret key, closed-form expression of false negative rate, minimax optimization.
result Derives optimal detection rules for LLM-generated text, demonstrating higher power than existing methods.
In his seminal work, Schapire (1990) proved that weak classifiers could be improved to achieve arbitrarily high accuracy, but he never implied that a simple majority-vote mechanism could always do the trick. By comparing the asymptotic misclassification error of the majority-vote classifier with the average individual …
In this work, we present a comparison of a shallow and a deep learning architecture for the automated segmentation of white matter lesions in MR images of multiple sclerosis patients. In particular, we train and test both methods on early stage disease patients, to verify their performance in challenging conditions, mo…
New algorithm balances user reward and statistical inference by mixing TS with UR based on difference size.
problem Combining statistical inference with user reward in adaptive experiments.
method TS-PostDiff algorithm that uses UR when differences are small and TS when large.
result TS-PostDiff reduces false positives and increases statistical power for small differences, while maximizing reward for large ones.
New algorithm detects changes in heavy-tailed data streams.
problem Detecting changes in heavy-tailed data streams.
method Clipped Stochastic Gradient Descent (SGD) combined with union bound.
result First algorithm with finite-sample false-positive rate guarantees for heavy-tailed data.
This paper introduces a novel graph-analytic approach for detecting anomalies in network flow data called GraphPrints. Building on foundational network-mining techniques, our method represents time slices of traffic as a graph, then counts graphlets -- small induced subgraphs that describe local topology. By performing…
Paper detects anomalous edges in social networks using edge exchangeability.
problem Detecting anomalous edges in directed social networks.
method Exploits edge exchangeability and uses conformal prediction theory.
result Proposed anomaly detector has a guaranteed upper bound for false positives.
Classifiers trained on data sets possessing an imbalanced class distribution are known to exhibit poor generalisation performance. This is known as the imbalanced learning problem. The problem becomes particularly acute when we consider incremental classifiers operating on imbalanced data streams, especially when the l…
New method quantifies deep kNN anomaly detection significance.
problem Lack of uncertainty quantification in deep kNN AD.
method Selective Inference for anomaly scoring.
result Validates AD reliability with controlled false positives.
Optimizes partial AUC across various FPRs for machine learning models.
problem Lack of scalable algorithms for optimizing partial AUC in a range of FPRs.
method Formulated as a non-smooth DC program, developed an efficient approximated gradient descent method using Moreau envelope smoothing.
result Achieved a complexity of for finding nearly -critical solutions.
Framework for fair classification with noisy protected attributes and provable guarantees.
problem Fair classification with noisy protected attributes.
method Optimization framework for linear and linear-fractional fairness constraints, handling multiple non-binary attributes.
result Provably fair classifier with minimal accuracy loss, even with large noise.
Digital image steganalysis, or the detection of image steganography, has been studied in depth for years and is driven by Advanced Persistent Threat (APT) groups', such as APT37 Reaper, utilization of steganographic techniques to transmit additional malware to perform further post-exploitation activity on a compromised…
MI attacks often mislabel non-training samples, making them impractical.
problem MI attacks mislabel non-training samples, leading to high false positive rate.
method Analyzed new features like distance to decision boundary and gradient norms.
result MI attacks cannot achieve high accuracy and low false positive rate simultaneously.
A new method for optimizing non-decomposable metrics with constraints.
problem Optimizing complex machine learning objectives with thresholded constraints.
method Formulate rate-constrained optimization using the Implicit Function theorem and solve with gradient-based methods.
result Demonstrated effectiveness over existing methods on benchmark datasets.
Environmental acoustic sensing involves the retrieval and processing of audio signals to better understand our surroundings. While large-scale acoustic data make manual analysis infeasible, they provide a suitable playground for machine learning approaches. Most existing machine learning techniques developed for enviro…
We study the interplay between sequential decision making and avoiding discrimination against protected groups, when examples arrive online and do not follow distributional assumptions. We consider the most basic extension of classical online learning: "Given a class of predictors that are individually non-discriminato…
Study proposes a statistical test for Vision Transformer's attention mechanisms.
problem ViT's attention mechanisms may focus on irrelevant regions, leading to unreliable evidence.
method Selective inference framework to quantify statistical significance of attentions as p-values.
result Proposed method enables reliable quantification of false positive detection probability of attentions.
The paper examines how machine learning tools in justice settings can unfairly affect different racial groups.
problem Machine learning tools in justice settings can unfairly affect different racial groups.
method Exploring different ideas of racial equity and their computational trade-offs.
result Computation alone is unlikely to solve the unfairness in machine learning tools for justice settings.
Simple bounds show most cross-sectional predictability findings are likely true.
problem Determining the validity of cross-sectional return predictability findings.
method Developed simple and intuitive bounds on the false discovery rate (FDR).
result Bounds show the FDR is small, indicating most findings are likely true.
New method quantifies reliability of neural network image segmentation.
problem Assessing statistical reliability of neural network-based image segmentation results.
method Selective inference framework to compute exact p-values for DNN-driven hypotheses.
result Proposed method successfully controls false positive rate and provides good results for medical image data.
PatternLocal improves XAI for non-linear models by suppressing suppressor variables.
problem Suppressor variables cause false-positive feature attributions in non-linear models.
method PatternLocal uses locally linear surrogate models and transforms weights into a generative representation.
result PatternLocal reduces false-positive attributions and provides more reliable explanations.