Classifiers trained with class-imbalanced data are known to perform poorly on test data of the "minor" classes, of which we have insufficient training data. In this paper, we investigate learning a ConvNet classifier under such a scenario. We found that a ConvNet significantly over-fits the minor classes, which is quit…
Study on error probabilities of machine learning classification techniques using large deviations theory.
problem Performance analysis of machine learning binary classification techniques.
method Large deviations theory applied to Data-Driven Decision Function (D3F) for error probability analysis.
result Classification error probabilities vanish exponentially, with an asymptotic formula providing precise error rate estimates.
The paper analyzes a private likelihood-ratio test for frequency tables under differential privacy constraints.
problem Achieving privacy in statistical data analysis while maintaining statistical utility.
method A rigorous analysis of a private likelihood-ratio (LR) test for goodness-of-fit in frequency tables, considering (ε,δ)-differential privacy. result Characterization of the trade-off between differential privacy parameters (ε,δ) and statistical power of the private LR test. Statistical analysis of financial data most focused on testing the validity of Brownian motion (Bm). Analysis performed on several time series have shown deviation from the Bm hypothesis, that is at the base of the evaluation of many financial derivatives. We inquiry in the behavior of measures of performance based on …
We develop a simple test for deviations from power law tails, which is based on the asymptotic properties of the empirical distribution function. We use this test to answer the question whether great natural disasters, financial crashes or electricity price spikes should be classified as dragon kings or 'only' as black…
New risk class penalizes loss deviations from mean on both sides.
problem Current risks are sensitive to loss tails on the upside and ignore the downside.
method Introduces a bi-directional risk class with flexible tail sensitivity.
result Derives high-probability learning guarantees without gradient clipping.
Method generates plausible financial stress scenarios using large deviations.
problem Misleading risk management by overlooking or overemphasizing implausible scenarios.
method Exploits large-deviations principle to concentrate risk factors near most likely stress configurations.
result Can generate informative stress scenarios even with limited historical data.
New estimate reduces overfitting risk in machine learning models.
problem Error rate on test data may not reflect true population error due to adaptive data analysis practices.
method Introduces Rip van Winkle's Razor, a simple estimate of overfit to test data based on information content.
result Shows non-vacuous estimate of deviation in many modern settings.
Estimates parameters in a deviated Gaussian mixture model.
problem Testing goodness-of-fit between a known function and a mixture of experts.
method Constructs novel Voronoi-based loss functions to estimate parameters.
result Characterizes local convergence rates of parameter estimation more accurately.
Proposes a two-stage method for testing variable interactions with FDR control.
problem Testing pairwise interactions in high-dimensional data with dependence.
method Two-stage testing procedure with FDR control using Cramér type moderate deviation technique.
result The proposed method controls FDR and has comparable or improved statistical power.
The objective function of a matrix factorization model usually aims to minimize the average of a regression error contributed by each element. However, given the existence of stochastic noises, the implicit deviations of sample data from their true values are almost surely diverse, which makes each data point not equal…
The paper analyzes a neural network two-sample test using kernel analysis.
problem Determining if two datasets come from the same distribution.
method Time-analysis on a neural tangent kernel (NTK) two-sample test, extending to realistic neural network dynamics.
result Training times needed to detect deviations are well-separated in null and alternative hypothesis scenarios.
Non-determinism from GPUs dominates ResNet training accuracy variability.
problem Variability in ResNet training accuracy due to GPU non-determinism.
method Analysis of TensorFlow ResNet training on GPUs, comparing fixed seeds vs. different seeds.
result 74% of ResNet model variability is due to GPU non-determinism.
New method tests independence using ROC analysis and bipartite ranking.
problem Testing independence of two random variables with unknown marginals.
method Nonparametric framework based on ROC analysis and bipartite ranking.
result The method detects small departures from independence in high dimensions.
Paper develops robust methods for large-scale testing without tuning parameters.
problem Heavy-tailed data in high-dimensional settings.
method Revisits Hodges-Lehmann estimator for robust inference without tuning parameters.
result Develops confidence intervals and controls false discovery proportion.
The study analyzes how machine learning classifiers' error rates decrease exponentially based on large deviations theory.
problem Understanding the convergence rate of machine learning classifiers' error probabilities.
method Large deviations theory applied to machine learning classification techniques.
result The error probability of ML classifiers converges to zero exponentially, with a rate dependent on the training set size.
This article contains a detailed study, in the toric case, of the test configuration geodesic rays defined by Phong-Sturm. We show that the `Bergman approximations' of Phong-Sturm converge in C^1 to the geodesic ray and that the geodesic ray itself is C^{1,1} and no better. The \kahler metrics associated to the geodesi…
It is common that a trained classification model is applied to the operating data that is deviated from the training data because of noise. This paper demonstrates that an ensemble classifier, Diversified Multiple Tree (DMT), is more robust in classifying noisy data than other widely used ensemble methods. DMT is teste…
KD can lead to student-teacher deviations that improve performance.
problem KD can lead to student-teacher deviations that may outperform the teacher.
method Characterized and explained the nature of student-teacher deviations through experiments and theory.
result KD can lead to improved generalization by exaggerating the implicit bias of gradient descent.
We propose an iterative scheme for feature-based positioning using a new weighted dissimilarity measure with the goal of reducing the impact of large errors among the measured or modeled features. The weights are computed from the location-dependent standard deviations of the features and stored as part of the referenc…
This paper presents new deviation inequalities that are valid uniformly in time under adaptive sampling in a multi-armed bandit model. The deviations are measured using the Kullback-Leibler divergence in a given one-dimensional exponential family, and may take into account several arms at a time. They are obtained by c…
We analyze cross-correlations between price fluctuations of different stocks using methods of random matrix theory (RMT). Using two large databases, we calculate cross-correlation matrices C of returns constructed from (i) 30-min returns of 1000 US stocks for the 2-yr period 1994--95 (ii) 30-min returns of 881 US stock…
Machine learning experiments show IID assumption is flawed for bathymetry editing.
problem Flawed IID assumption in machine learning for bathymetry editing.
method Real-world computer-assisted labeling task, IID assumption analysis.
result Common random split leads to poor performance in machine learning.
Paper robustifies reinforcement learning with risk-averse methods.
problem Making predictions robust to changes in system dynamics or rewards.
method Approximates Robust Reinforcement Learning using Φ-divergence and Risk-Averse formulation. result Classical Reinforcement Learning can be robustified using standard deviation penalization.
Proposes R2LDA for improved LDA classifier performance.
problem Poor performance of LDA classifiers in small to comparable data sizes.
method Doubly regularized LDA with automatic parameter selection.
result Consistent and effective performance in noisy test data.
Paper optimizes change-point detection using learned distributions from training sequences.
problem Optimal change-point detection with unknown pre- and post-change distributions.
method Designs a change-point estimator using training sequences and test sequences.
result Optimal confidence width characterized as a function of undetected error.
KSDAgg combines multiple KSD tests to improve goodness-of-fit testing without splitting data.
problem Improving goodness-of-fit testing without data splitting.
method KSDAgg aggregates multiple KSD tests with different kernels to maximize power.
result KSDAgg achieves the smallest uniform separation rate of the collection, up to a logarithmic term.
New framework embeds generalization in learning dynamics using large deviation theory.
problem Improving generalization and robustness in learning problems.
method Gradient methods from continuous-time perspective with Freidlin-Wentzell theory of large deviations.
result Asymptotic probability estimate for rare events in learning dynamics.
FLOPART solves peak detection by creating accurate train and test set predictions.
problem Correctly detecting peaks in sequential data.
method Dynamic programming changepoint algorithm with zero train label errors.
result FLOPART provides highly accurate predictions on both train and test sets.
New risk class defined based on loss location and deviation.
problem Risk assessment in loss distributions.
method Wrapper around smooth loss functions, M-estimators, stochastic gradient methods.
result Finite-sample stationarity guarantees for stochastic gradient methods.
Agents trained with reinforcement learning deviate from Nash equilibrium in optimal execution game.
problem Deviation of reinforcement learning strategies from Nash equilibrium in optimal execution game.
method Two-player optimal execution game with reinforcement learning algorithms (Double Deep Q-Learning).
result Strategies learned by agents deviate significantly from Nash equilibrium, exhibiting supra-competitive solutions.
New test detects differences in heterogeneous datasets.
problem Detecting differences between two samples with unknown heterogeneity.
method Developed a nonparametric testing procedure that handles latent heterogeneity through a composite null.
result The test accurately detects differences in the presence of unknown heterogeneity.
This study improves audit sampling by using sequential procedures with statistical guarantees.
problem Improving audit efficiency and reliability with statistical methods.
method Formulated as a sequential testing problem, defining null and alternative hypotheses, stopping and decision rules, and exact boundary conditions.
result Exact design yields ex ante control of decision error probabilities, and simulation-based implementation approximates this design.
Paper characterizes monotonic mean-deviation risk measures.
problem Developing consistent risk measures from mean-deviation models.
method Applying a risk-weighting function to the deviation part of a mean-deviation model.
result Characterizes monotonic mean-deviation measures as consistent risk measures.
Stress shocks are often calculated as multiples of the standard deviation of a history set. This paper investigates how many standard deviations are required to guarantee that this shock exceeds any observation within the history set, given the additional constraint of kurtosis. The results of this analysis are then us…
Paper develops new spot regression estimators using candlesticks for asset pricing.
problem Estimation of spot betas in asset pricing and risk management.
method Develops a new estimation and inference framework for spot regressions using high-frequency candlesticks.
result The proposed candlestick-based estimators reduce estimation risk and achieve higher power in hypothesis testing.
Reconstructing observed images from fMRI brain recordings is challenging. Unfortunately, acquiring sufficient "labeled" pairs of {Image, fMRI} (i.e., images with their corresponding fMRI responses) to span the huge space of natural images is prohibitive for many reasons. We present a novel approach which, in addition t…
Like all other knot polynomials, the superpolynomials should be defined in arbitrary representation R of the gauge group in (refined) Chern-Simons theory. However, not a single example is yet known of a superpolynomial beyond symmetric or antisymmetric representations. We consider the expansion of the superpolynomial a…
Anomaly detection for high-dimensional data using large deviations principle.
problem Challenges in anomaly detection for high-dimensional data.
method Large Deviations Anomaly Detection (LAD) algorithm.
result Outperforms state-of-the-art methods on high-dimensional data sets.
We consider the problem of defining the significance of an itemset. We say that the itemset is significant if we are surprised by its frequency when compared to the frequencies of its sub-itemsets. In other words, we estimate the frequency of the itemset from the frequencies of its sub-itemsets and compute the deviatio…
AutoSciDACT detects scientific anomalies in noisy data.
problem Detecting anomalies in large, noisy scientific datasets.
method Contrastive pre-training for low-dimensional data representations, two-sample test using NPLM.
result Strong sensitivity to small anomalies across various scientific domains.
The paper analyzes how a known density function can be deviated by a mixture distribution as more data is collected.
problem Modeling the deviation of a known density function when more data is collected.
method A novel distinguishability notion is used to establish rates of convergence for maximum likelihood estimates of the deviated proportion and latent mixing measure.
result Rates of convergence for the maximum likelihood estimates of the deviated proportion and latent mixing measure are established under the Wasserstein metric.
Suitability filter detects model performance degradation in real-world deployment.
problem Ensuring model reliability in safety-critical domains without access to ground truth labels.
method Uses suitability signals to evaluate classifier performance on unlabeled user data.
result The suitability filter reliably detects performance deviations due to covariate shift.
We propose a methodology for testing linear hypothesis in high-dimensional linear models. The proposed test does not impose any restriction on the size of the model, i.e. model sparsity or the loading vector representing the hypothesis. Providing asymptotically valid methods for testing general linear functions of the …
The reproducing kernel Hilbert space (RKHS) embedding of distributions offers a general and flexible framework for testing problems in arbitrary domains and has attracted considerable amount of attention in recent years. To gain insights into their operating characteristics, we study here the statistical performance of…
CADR estimator improves inference for contextual bandit data.
problem Valid inference on contextual bandit data.
method CADR estimator for policy value, addressing adaptive data collection challenges.
result CADR provides correct coverage of confidence intervals.
Paper revisits pre-validation method, improving hypothesis testing.
problem Improving hypothesis testing in pre-validated models with different feature dimensions.
method Extended problem formulation, analytical distribution, and bootstrap procedure.
result Proposed analytical distribution and bootstrap procedure for pre-validated predictors.
Study optimal ridge regularization for out-of-distribution prediction.
problem Optimal ridge regularization for predicting out-of-distribution data.
method Established conditions for optimal regularization under covariate and regression shifts, proving monotonic risk in data aspect ratio.
result Negative regularization can be optimal under shifts, even with isotropic or underparameterized training features.