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.
New method improves false-/true-positive-rate estimation in fraud detection with noisy labels.
AdaDetectGPT improves text authorship detection with statistical guarantees.
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…
SFS-DA method statistically tests FS reliability under domain adaptation.
Enhanced attacks quantify machine learning data leakage.
New algorithm for adaptive experimental design in scientific settings.
This study benchmarks changepoint detection algorithms on cardiac time series data.
New optimization method improves AUC for binary classification and changepoint detection.
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…
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 …
Simple bounds show most cross-sectional predictability findings are likely true.
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…
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…
Deep learning classifiers are known to be vulnerable to adversarial examples. A recent paper presented at ICML 2019 proposed a statistical test detection method based on the observation that logits of noisy adversarial examples are biased toward the true class. The method is evaluated on CIFAR-10 dataset and is shown t…
New bounds for balanced classification improve understanding of imbalanced datasets.
We study an online classification problem with partial feedback in which individuals arrive one at a time from a fixed but unknown distribution, and must be classified as positive or negative. Our algorithm only observes the true label of an individual if they are given a positive classification. This setting captures …
Paper uses AI to improve medical diagnosis accuracy.
The true probability of a European call option to achieve positive return is investigated under the Black-Scholes model. It is found that the probability is determined by those market factors appearing in the BS formula, besides the growth rate of stock price. Our numerical investigations indicate that the biases of BS…
The study examines how class imbalance affects precision-recall curves.
We consider the problem of detecting out-of-distribution images in neural networks. We propose ODIN, a simple and effective method that does not require any change to a pre-trained neural network. Our method is based on the observation that using temperature scaling and adding small perturbations to the input can separ…
We propose to apply deep transfer learning from computer vision to static malware classification. In the transfer learning scheme, we borrow knowledge from natural images or objects and apply to the target domain of static malware detection. As a result, training time of deep neural networks is accelerated while high c…
Algorithm detects concept drift and adapts models in streaming data.
The performance of many machine learning techniques depends on the choice of an appropriate similarity or distance measure on the input space. Similarity learning (or metric learning) aims at building such a measure from training data so that observations with the same (resp. different) label are as close (resp. far) a…
To estimate a sparse linear model from data with Gaussian noise, consilience from lasso and compressed sensing literatures is that thresholding estimators like lasso and the Dantzig selector have the ability in some situations to identify with high probability part of the significant covariates asymptotically, and are …
New framework reduces strategic manipulation cost for minority groups in fair classification.
To be prepared against cyberattacks, most organizations resort to security information and event management systems to monitor their infrastructures. These systems depend on the timeliness and relevance of the latest updates, patches and threats provided by cyberthreat intelligence feeds. Open source intelligence platf…
Proposes fwelnet to improve prediction using feature information.
Framework uses human feedback to safely set OOD detection thresholds, reducing false positives.
Deep learning model detects and flags artefacts in polarimetric images.
AutoYara generates effective Yara rules faster than humans.
Paper proposes a method to estimate true positive proportion without knowing it.
Local update methods' performance depends on learning rates, affecting convergence rates and alignment with true loss.
A natural way of handling imbalanced data is to attempt to equalise the class frequencies and train the classifier of choice on balanced data. For two-class imbalanced problems, the classification success is typically measured by the geometric mean (GM) of the true positive and true negative rates. Here we prove that G…
We provide a unified framework for modeling LIBOR rates using general semimartingales as driving processes and generic functional forms to describe the evolution of the dynamics. We derive sufficient conditions for the model to be arbitrage-free which are easily verifiable, and for the LIBOR rates to be true martingale…
Nonparametric IPSS selects features with false discovery control.
Study on predicting graph labels at nodes using local averaging and distance estimation.
DSDE improves OoD detection by estimating model library proportions.
We consider the hypothesis testing problem of detecting conditional dependence, with a focus on high-dimensional feature spaces. Our contribution is a new test statistic based on samples from a generative adversarial network designed to approximate directly a conditional distribution that encodes the null hypothesis, i…
We introduce a simple algorithm, True Asymptotic Natural Gradient Optimization (TANGO), that converges to a true natural gradient descent in the limit of small learning rates, without explicit Fisher matrix estimation. For quadratic models the algorithm is also an instance of averaged stochastic gradient, where the par…
As algorithmic prediction systems have become widespread, fears that these systems may inadvertently discriminate against members of underrepresented populations have grown. With the goal of understanding fundamental principles that underpin the growing number of approaches to mitigating algorithmic discrimination, we …
The paper controls false discovery rate in link prediction using conformal inference.
In this paper, we investigate the statistical convergence rate of a Bayesian low-rank tensor estimator. Our problem setting is the regression problem where a tensor structure underlying the data is estimated. This problem setting occurs in many practical applications, such as collaborative filtering, multi-task learnin…
The paper shows how to recover true node positions from a graph or similarity matrix.
Algorithm corrects bias in classification data.
Gradient descent with small initialization solves matrix completion without regularization.
We study convergence rates of variational posterior distributions for nonparametric and high-dimensional inference. We formulate general conditions on prior, likelihood, and variational class that characterize the convergence rates. Under similar "prior mass and testing" conditions considered in the literature, the rat…
We prove a central limit theorem for the components of the largest eigenvectors of the adjacency matrix of a finite-dimensional random dot product graph whose true latent positions are unknown. In particular, we follow the methodology outlined in \citet{sussman2012universally} to construct consistent estimates for the …
We examine geometric properties of a knot J that are unchanged by taking a (p,q)-cable K of J. Specifically, we relate w(K) to w(J), where w(K) is the width of K in the sense of Gabai. We use this information to demonstrate that thin position is a minimal bridge position of J if and only if the same is true for K, and …