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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for Type I and II errors

We formulate statistical watermarking as hypothesis testing and establish near-optimal bounds.

problem Statistical watermarking in the context of hypothesis testing.
method Formulated as a hypothesis testing problem, using coupling of output tokens and rejection regions.
result Established nearly matching upper and lower bounds on the number of i.i.d. tokens required for small Type I and Type II errors.

Combines cost-sensitive and Neyman-Pearson paradigms for better binary classification.

problem Asymmetric binary classification problems with unequal error severities.
method Develops TUBE-CS algorithm to bridge cost-sensitive and Neyman-Pearson paradigms.
result High-probability control of population type I error.

Despite the great success of deep neural networks, the adversarial attack can cheat some well-trained classifiers by small permutations. In this paper, we propose another type of adversarial attack that can cheat classifiers by significant changes. For example, we can significantly change a face but well-trained neural…

2018-09-03abs ↗pdf ↗

The Neyman-Pearson (NP) paradigm in binary classification seeks classifiers that achieve a minimal type II error while enforcing the prioritized type I error controlled under some user-specified level αα. This paradigm serves naturally in applications such as severe disease diagnosis and spam detection, where people h…

2018-02-07abs ↗pdf ↗

Motivated by problems of anomaly detection, this paper implements the Neyman-Pearson paradigm to deal with asymmetric errors in binary classification with a convex loss. Given a finite collection of classifiers, we combine them and obtain a new classifier that satisfies simultaneously the two following properties with …

2011-02-28abs ↗pdf ↗

SONAR improves outlier detection for streaming data with strong theoretical guarantees.

problem Outlier detection for non-stationary streaming data with high Type I/II errors.
method SONAR is an efficient SGD-based OCSVM solver with strong convex regularization and lifelong learning guarantees.
result SONAR outperforms traditional OCSVM in Type I/II error rates under non-stationary data.

Most existing binary classification methods target on the optimization of the overall classification risk and may fail to serve some real-world applications such as cancer diagnosis, where users are more concerned with the risk of misclassifying one specific class than the other. Neyman-Pearson (NP) paradigm was introd…

2015-08-13abs ↗pdf ↗

FactTest assesses LLM factuality with Type I error control.

problem Lack of rigorous factuality verification for LLMs.
method Formulates factuality testing as hypothesis testing, ensuring Type I and II error control.
result Improves model accuracy by over 40% in abstaining from unknown questions.

Optimal classification rules control error rates in multiclass mixture models.

problem Classifying observations in multiclass mixture models while controlling error rates.
method Finding optimal classification rules by searching an optimal region in the observation space, using Maximum A Posteriori (MAP) rule and heuristic computation.
result The FDR-like optimal rule can be significantly less conservative than thresholded MAP rules.

DP synthetic data may inflate statistical test results, caution advised.

problem Inflated Type I errors in statistical tests on DP-synthetic data.
method Evaluation of Mann-Whitney U test, t-test, chi-squared test, and median test on DP-synthetic data generated from real-world and simulated datasets using various DP-synthetic data generation methods.
result A large portion of evaluation results showed inflated Type I errors, especially at low privacy levels.

DP-SPRT improves privacy in sequential tests with near-optimal error rates.

problem Privacy constraints in sequential probability ratio tests.
method A wrapper for SPRT that uses a private mechanism to determine when to stop based on predefined intervals.
result DP-SPRT achieves near-optimal error rates and privacy guarantees.

Gaussian graphical model is a graphical representation of the dependence structure for a Gaussian random vector. It is recognized as a powerful tool in different applied fields such as bioinformatics, error-control codes, speech language, information retrieval and others. Gaussian graphical model selection is a statist…

2017-01-09abs ↗pdf ↗

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 ↗

Study detects signals in spiked Wigner models using log likelihood ratio.

problem Detecting signals in rank-one spiked Wigner models with non-Gaussian noise.
method Proved asymptotic normality of log likelihood ratio and computed error thresholds.
result Optimal signal-to-noise ratio threshold for reliable detection.

Formula derived for sample complexity in binary hypothesis testing.

problem Determine the minimum number of samples to distinguish between two distributions.
method Developed a formula for sample complexity in both prior-free and Bayesian settings, using Jensen-Shannon and Hellinger divergences.
result Formula characterizes sample complexity for a wide range of error parameters, up to multiplicative constants.

Optimal tests for nonparametric one- and two-sample testing are derived using MMD and KSD.

problem Developing optimal tests for nonparametric one- and two-sample testing.
method Using Sanov's theorem and Maximum Mean Discrepancy (MMD), the optimal error exponents are derived for one-sample tests. For two-sample tests, the quadratic-time Kernel Stein Discrepancy (KSD) is shown to achieve the optimal type-II error exponent.
result Achievement of optimal error exponents for nonparametric one- and two-sample testing in the universal setting.

New method uses CDMs to improve CI testing without distributional assumptions.

problem Testing conditional independence when the conditional distribution is unknown.
method Uses conditional diffusion models (CDMs) to approximate XZX|Z and a classifier-based CMI estimator.
result Proposed method performs better than GAN-based CI tests and controls type I and II errors.

Revises precision-recall curves for generative models.

problem Improves evaluation of generative models by distinguishing mode-collapse and quality issues.
method Generalizes PR curve formulation to arbitrary measures, exposes a bridge to error rates, proposes a new algorithm to approximate precision-recall curves.
result Demonstrates the interest of the new formulation over the original approach on multi-modal datasets.

The paper tackles data misappropriation in LLMs by embedding watermarks and testing for their presence.

problem Detecting data misappropriation in LLMs trained on copyrighted data.
method Embedding watermarks, formulating as hypothesis testing, developing statistical framework, constructing test statistics, determining optimal thresholds, controlling errors, establishing asymptotic optimality.
result The proposed statistical testing framework effectively detects data misappropriation in LLMs.

Efficient tests achieve best error rates in high-dimensional hypothesis testing.

problem Achieving optimal error rates in computationally efficient hypothesis testing.
method Linear spectral statistics and low-degree likelihood ratio analysis.
result An efficient test achieves the best possible error rates among all computationally efficient tests.

Improved generalization bounds for SGD in non-convex learning.

problem Understanding generalization properties of SGD in non-convex settings.
method Introducing Type II perturbed SGD (T2pm-SGD) to analyze generalization error bounds.
result Tighter generalization error bounds for SGD in non-convex learning, especially for sub-Gaussian and bounded loss functions.

This review explores resampling techniques for imbalanced binary classification.

problem Imbalanced classes lead to poor prediction results in classification.
method Classical, cost-sensitive, and Neyman-Pearson paradigms with resampling techniques and classification methods.
result Complex dynamics among resampling techniques, base methods, metrics, and imbalance ratios.

Kernel tests assess equivalence between distributions without assuming specific moments.

problem Traditional goodness-of-fit tests fail to detect meaningful distributional differences.
method Proposes kernel-based tests using kernel Stein discrepancy and Maximum Mean Discrepancy.
result Tests assess the absence of meaningful distributional differences under controlled error rates.

We construct new type II ancient compact solutions to the Yamabe flow. Our solutions are rotationally symmetric and converge, as tt \to -\infty, to a tower of two spheres. Their curvature operator changes sign. We allow two time-dependent parameters in our ansatz. We use perturbation theory, via fixed point arguments,…

2012-09-25abs ↗pdf ↗

We propose a nonparametric sequential test that aims to address two practical problems pertinent to online randomized experiments: (i) how to do a hypothesis test for complex metrics; (ii) how to prevent type 11 error inflation under continuous monitoring. The proposed test does not require knowledge of the underlying…

2016-10-08abs ↗pdf ↗

Paper proposes Gini distance statistics for estimating feature-label dependence.

problem Identifying statistical dependence between features and categorical labels.
method Generalized Gini distance in RKHS for feature-label dependence estimation.
result Gini distance statistics converge faster and have tighter error bounds than distance covariance.

Adapts Neyman-Pearson classification for both source and target distribution shifts.

problem Minimizing errors while controlling both Type-I and Type-II errors under distribution shifts.
method Derives an adaptive procedure that guarantees improved error rates and adapts to uninformative sources.
result Automatic adaptation to uninformative sources avoids negative transfer.

In this paper, we study stability and instability problem for type-II partitioning problem. First, we make a complete classification of stable type-II stationary hypersurfaces in a ball in a space form as totally geodesic nn-balls. Second, for general ambient spaces and convex domains, we give some topological restric…

2019-02-25abs ↗pdf ↗

We consider the weak detection problem in a rank-one spiked Wigner data matrix where the signal-to-noise ratio is small so that reliable detection is impossible. We propose a hypothesis test on the presence of the signal by utilizing the linear spectral statistics of the data matrix. The test is data-driven and does no…

2018-09-28abs ↗pdf ↗

Sharp 2-Wasserstein bounds for DDPMs derived from Föllmer process.

problem Sampling error bounds for DDPMs in 2-Wasserstein distance.
method Lipschitz-type conditions on score function, Föllmer process, and log-concave target distributions.
result Sharp upper bounds for DDPMs in 2-Wasserstein distance, optimal in dimension and steps.

The paper proves rigidity theorems for Type II singularities in Lagrangian flows.

problem Understanding Type II singularities in Lagrangian flows with zero Maslov class.
method Rigidity theorems for blow-up limits of Type II singularities.
result Generalized previous results from 2D to arbitrary dimensions.

Study detects illegal discrimination by employers using correspondence experiments.

problem Detecting illegal discrimination by individual employers based on protected characteristics.
method Correspondence experiments, bounding higher moments of causal effects, decision rules for investigation.
result 85% of jobs contacting both white and black applicants are likely to discriminate.

Type II (ancient) solutions to the Ricci flow on surfaces are not yet classified. It is conjectured that the Rosenau solution and the cigar are the only solutions, modulo scaling. In this paper, we mainly study the backward limit and the circumference at spatial infinity of Type II ancient solutions on noncompact surfa…

2006-11-10abs ↗pdf ↗

The paper develops a method to identify LLM-generated text without training.

problem Identifying LLM-generated text among human-generated content.
method Modeling LLM text as a sequential process and designing zero-shot statistical tests.
result The method can distinguish between text from known LLMs and non-sanctioned models with low false positive rates.

New tests for binary classification regression functions without distribution assumptions.

problem Testing regression functions in binary classification without distributional assumptions.
method Conditional kernel mean embeddings and resampling-based framework.
result Distribution-free hypothesis tests with exact type I error control.

Numerical simulations show stability of Type-II singularities in noncompact hypersurfaces.

problem Stability of Type-II singularities in noncompact hypersurfaces with rotationally-symmetric perturbations.
method Adaptation of the overlap method to include angular dependence.
result MCF of noncompact hypersurfaces with angular dependence behaves similarly to rotationally-symmetric perturbations, developing Type-II or Type-I singularities.