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

68137205273 · Jun 202019922001200920172026
48 results for false non-discovery rate

fcHMRF-LIS controls FDR in neuroimaging data, improving power and scalability.

problem Complex spatial dependencies and high variability in FDR control methods for neuroimaging data.
method fcHMRF-LIS integrates LIS-based testing with fcHMRF to model spatial structures efficiently.
result fcHMRF-LIS achieves accurate FDR control, lower FNR, and higher true positives compared to existing methods.

New methods control false discoveries near the boundary in conformal novelty detection.

problem Over-optimistic assessments near the rejection threshold in conformal novelty detection.
method Support line (SL) correction and alternative procedures to control boundary false discovery rate (bFDR).
result New procedures control the boundary false discovery rate (bFDR) in the conformal setting.

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.

Paper proposes knockoff-based methods to simplify deep neural networks by controlling false discovery rates.

problem High-dimensional deep neural networks with many irrelevant parameters and inputs.
method Knockoff methods combined with regularized neural networks for variable screening.
result Proposed algorithms show satisfactory performance in controlling false discovery rates.

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…

2018-01-15abs ↗pdf ↗

Paper tackles MIAs vulnerability by controlling FDR, providing guarantees on false discoveries.

problem Vulnerability of deep learning models to membership inference attacks (MIAs).
method Designs a novel membership inference attack method that provides FDR guarantees.
result Demonstrates the effectiveness of the method in various settings.

Online anomaly detection in surveillance videos with false alarm rate bounds.

problem Lack of theoretical performance analysis and online decision making in anomaly detection.
method Proposes an online anomaly detection method with asymptotic bounds on false alarm rate.
result Demonstrates effectiveness on publicly available data sets, outperforming state-of-the-art algorithms.

In hypothesis testing, a false discovery occurs when a hypothesis is incorrectly rejected due to noise in the sample. When adaptively testing multiple hypotheses, the probability of a false discovery increases as more tests are performed. Thus the problem of False Discovery Rate (FDR) control is to find a procedure for…

2020-02-27abs ↗pdf ↗

New algorithm for adaptive experimental design in scientific settings.

problem Identifying true positives while controlling false discoveries in adaptive experimental design.
method Provably sample efficient adaptive algorithm for FDR control.
result First provably sample efficient adaptive algorithm for adaptive experimental design.

The paper controls false discovery rate in link prediction using conformal inference.

problem Identifying true edges in a graph while controlling false discoveries.
method Proposes a novel method based on conformal inference to control false discovery rate (FDR) in link prediction.
result Empirically demonstrates FDR control for both simulated and real data.

Estimates target GGM using auxiliary studies with false discovery rate control.

problem Estimating high-dimensional GGMs from related studies.
method Transfer learning with Trans-CLIME and debiased Trans-CLIME estimators.
result Debiased Trans-CLIME estimator provides element-wise asymptotic normality and false discovery rate control.

New method controls false discoveries in online testing with deadlines.

problem Controlling false discoveries in online hypothesis testing with decision deadlines.
method Benjamini-Hochberg-type procedure over a moving window of hypotheses with adaptive threshold parameters.
result Controls false discovery rate at every stage and adaptively chosen stopping times.

Develops robust knockoffs for controlling false discoveries in financial data.

problem Challenges in variable selection with highly correlated data in finance and economics.
method Robustified knockoff framework addressing high dependence and time correlation.
result Identifies new important groups of factors on top of known drivers.

New rules control false discoveries in online anomaly detection for time series data.

problem Controlling false discoveries in anomaly detection for time series data.
method Novel online false discovery rate control (FDRC) rules for time series anomaly detection.
result Ensures high power in detecting anomalies even when the alternative is rare and test statistics are serially dependent.

Finite resources limit false discovery rate control in structured hypothesis spaces.

problem Controlling false discovery rate in hypothesis testing with finite data and structured hypothesis spaces.
method Framework for exact FDR control and adaptive power maximization.
result Exact FDR control and adaptive power maximization.

DeepFDR uses deep learning for better FDR control in neuroimaging data.

problem Spatial dependence among voxel-based tests in neuroimaging data.
method DeepFDR leverages unsupervised deep learning-based image segmentation.
result DeepFDR outperforms existing methods in FDR control and computational efficiency.

Enhances FDR control in variable selection using neural networks.

problem Balancing rigorous error control with statistical power in high-dimensional variable selection.
method Learning-augmented T-Rex Selector framework with a neural network trained on synthetic datasets.
result Achieves superior detection of true variables compared to existing approaches.

We address the problem of non-parametric multiple model comparison: given ll 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…

2019-10-27abs ↗pdf ↗

The paper optimizes A/B tests by balancing lift and cost in large-scale settings.

problem Balancing lift and cost in A/B tests for large-scale experimentation.
method Empirical Bayes approach using a greedy knapsack algorithm to rank experiments based on lift-to-cost ratio, incorporating local false discovery rate (lfdr).
result The proposed method maximizes expected profit while controlling false discovery rate, demonstrating superior performance in large-scale settings.

A new metric, Weighted Regret, unifies FDR and power evaluation in online multiple testing.

problem The asymmetric costs of false positives and false negatives in automated pipelines.
method Introducing Weighted Regret and Decoupled-OMT (DOMT) to unify FDR and power evaluation.
result DOMT achieves an order-optimal sublinear mitigation of threshold depletion in bursty environments.

CatNet controls FDR in LSTM models using SHAP feature importance and Gaussian mirrors.

problem Controlling False Discovery Rate (FDR) in LSTM models with feature selection.
method CatNet uses SHAP values for feature importance and Gaussian Mirror algorithm for FDR control. It introduces a kernel-based independence measure to handle feature correlations.
result CatNet reduces overfitting and improves model interpretability on simulated and real-world data.

Traditional voxel-level multiple testing procedures in neuroimaging, mostly pp-value based, often ignore the spatial correlations among neighboring voxels and thus suffer from substantial loss of power. We extend the local-significance-index based procedure originally developed for the hidden Markov chain models, whic…

2014-04-04abs ↗pdf ↗

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.

Decentralized detection avoids sharing data, controls false discoveries.

problem Global false discovery rate control in decentralized novelty detection.
method Quantized surrogate models for low-precision sharing, preserving exchangeability.
result Quantized composite scores maintain competitive statistical power with reduced communication.

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…

2017-06-30abs ↗pdf ↗

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 findings control FDR for online testing methods under positive dependence.

problem Maintaining FDR control for online testing methods under positive dependence.
method Developed new methods to control FDR for online testing procedures under positive dependence.
result SAFFRON and LORD control FDR under positive dependence, not just conditional superuniformity.

The paper tackles noisy matrix completion by developing new statistics and controlling false discovery rate.

problem Testing multiple linear forms for noisy matrix completion with low-rank structure.
method Introducing new statistics with sharp asymptotics for individual tests, controlling FDR via data splitting and aggregation.
result Valid FDR control can be achieved with guaranteed power under nearly optimal sample size requirements.

Paper proposes a privacy-preserving method to control false discoveries.

problem Protecting individual information in hypothesis tests while controlling false discoveries.
method Differentially private adaptive FDR control method with privacy guarantee.
result The method controls the FDR metric exactly at a user-specified level with privacy.

New method improves false-/true-positive-rate estimation in fraud detection with noisy labels.

problem Estimating FPR/TPR in fraud detection with class-conditional label noise.
method Directly cleaning model's validation data to de-correlate cleaning error with model scores.
result Improves accuracy of FPR/TPR estimates, especially in asymmetric label noise scenarios.

In regression settings where explanatory variables have very low correlations and there are relatively few effects, each of large magnitude, we expect the Lasso to find the important variables with few errors, if any. This paper shows that in a regime of linear sparsity---meaning that the fraction of variables with a n…

2015-11-05abs ↗pdf ↗

New method controls false discoveries in structured hypothesis spaces.

problem Controlling false discoveries in large-scale, interconnected hypothesis spaces.
method Reproducing Kernel Hilbert Space (RKHS) optimization for structured FDR control.
result Unified framework for continuous domains, graphs, and hierarchies.

SI-CLAD improves clustering-based anomaly detection by controlling false positives.

problem Lack of reliability in clustering-based anomaly detection.
method SI-CLAD (Statistical Inference for CLustering-based Anomaly Detection) using Selective Inference framework.
result SI-CLAD rigorously controls false detection probability below a specified significance level.

In the online multiple testing problem, p-values corresponding to different null hypotheses are observed one by one, and the decision of whether or not to reject the current hypothesis must be made immediately, after which the next p-value is observed. Alpha-investing algorithms to control the false discovery rate (FDR…

2017-10-02abs ↗pdf ↗

The paper introduces a method to control false splits in tree-based data aggregation.

problem Identifying the correct subgroups to treat as a single entity in tree-based data.
method Introduces the 'false split rate' and proposes a multiple hypothesis testing algorithm for tree-based aggregation.
result The proposed algorithm controls the false split rate, demonstrating its effectiveness on stock volatility and taxi fare data.