Post hoc test for Sharpe ratio improves pairwise comparisons.
problem Improving pairwise comparisons of Sharpe ratios.
method Analogous to Tukey's test, applied after rejecting equal Signal-Noise ratios.
result Maintains nominal type I rate and is moderately powerful.
The paper uses Tukey g-and-h neural networks for non-Gaussian data regression.
problem Regression with non-Gaussian data.
method Training neural networks to predict Tukey g-and-h distribution parameters via negative log-likelihood minimization.
result Efficiency demonstrated in simulated and real-world datasets.
The paper studies randomized approximations of Tukey's depth for log-concave isotropic data.
problem The challenge of approximating Tukey's depth in high dimensions.
method The study examines randomized algorithms for approximating Tukey's depth for log-concave isotropic data.
result Randomized algorithms correctly approximate maximal depth and close to zero depths but not intermediate depths.
Tukey median performance analyzed under TV corruptions.
problem Performance analysis of Tukey median under TV corruptions.
method Analysis of Tukey median and projection algorithm under TV corruptions.
result Breakdown point reduced to 1/4 under TV corruptions, compared to 1/3 under Huber's model.
Study on Tukey depth in machine learning using Hamilton-Jacobi equations.
problem Understanding Tukey depth in machine learning applications.
method Derive necessary conditions for Tukey depth in continuum limit, formulating them as a Hamilton-Jacobi equation.
result Prove existence and uniqueness of viscosity solutions for the derived equation, which bounds Tukey depth.
Machine learning models predict crash rates on narrow lanes.
problem Impact of narrow lanes on arterial road vehicle crashes.
method Applied random forest and least squares boosting machine learning algorithms to crash data.
result Random forest model identified as best for studying narrow lanes' safety impact.
Over the past half-century, the empirical finance community has produced vast literature on the advantages of the equally weighted S\&P 500 portfolio as well as the often overlooked disadvantages of the market capitalization weighted Standard and Poor's (S\&P 500) portfolio (see \cite{Bloom}, \cite{Uppal}, \cite{Jacobs…
This paper discusses different classes of loss models in non-life insurance settings. It then overviews the class Tukey transform loss models that have not yet been widely considered in non-life insurance modelling, but offer opportunities to produce flexible skewness and kurtosis features often required in loss modell…
Develops a new framework for robust regression with EGM.
problem Addressing robust regression with heavy-tailed noise or outliers.
method Empirical gain maximization (EGM) to approximate noise density.
result Unified analysis of robust regression approaches.
In this paper, we explore various statistical techniques for anomaly detection in conjunction with the popular Long Short-Term Memory (LSTM) deep learning model for transportation networks. We obtain the prediction errors from an LSTM model, and then apply three statistical models based on (i) the Gaussian distribution…
Paper explores robust estimators for kernel exponential families using smoothed total variation distances.
problem Outliers can severely impact classical estimators in statistical inference.
method Proposes smoothed total variation (STV) distance as a class of IPMs for robust estimation of kernel exponential families.
result STV-based estimators are robust against distribution contamination for kernel exponential families.
Paper proposes robust geodesic regression for manifold data.
problem Outliers sensitivity in geodesic regression.
method M-type estimators (L1, Huber, Tukey biweight) for robustness.
result L1 estimator superior on high-dimensional manifolds.
Novel power transform unifies various mathematical functions.
problem Normalizing and standardizing datasets.
method Presented a novel power transform.
result Unified various mathematical functions.
We present a new algorithm for the 2D Sliding Window Discrete Fourier Transform (SWDFT). Our algorithm avoids repeating calculations in overlapping windows by storing them in a tree data-structure based on the ideas of the Cooley- Tukey Fast Fourier Transform (FFT). For an N0×N1 array and n0×n1 wi…
Estimates BV functions from noisy data using Voronoi diagrams.
problem Estimating multivariate BV functions from scattered noisy data.
method Form Voronoi diagram, solve optimization problem with discrete TV regularization.
result Voronoigram is minimax rate optimal for BV functions.
The paper proves deep learning can be robust with certain loss functions.
problem The robustness of deep learning models under flawed data.
method Empirical-risk minimization with unbounded, Lipschitz-continuous loss functions.
result These loss functions provide efficient prediction under minimal data assumptions.
Robust feature-weighted jump models for time-dependent clustering
problem Temporal clustering
method Robust feature-weighted jump model
result Accurate recovery of true cluster sequence and feature identification
Donoho's JCGS (in press) paper is a spirited call to action for statisticians, who he points out are losing ground in the field of data science by refusing to accept that data science is its own domain. (Or, at least, a domain that is becoming distinctly defined.) He calls on writings by John Tukey, Bill Cleveland, and…
The study examines how permutation-based optimization performance varies across different function representations.
problem Understanding how the order of function evaluations affects optimization performance.
method Iterative search setting with sampling without replacement, algebraic function recombination, correlation analysis, hierarchical clustering, PCA, ANOVA.
result Algebraically modified benchmarks yield stable re-rankings and coherent clusters of functions and sampling policies, indicating non-additive search effort.
This paper shows how to carry out efficient asymptotic variance reduction when estimating volatility in the presence of stochastic volatility and microstructure noise with the realized kernels (RK) from [Barndorff-Nielsen et al., 2008] and the quasi-maximum likelihood estimator (QMLE) studied in [Xiu, 2010]. To obtain …
Robust estimation under Huber's ε-contamination model has become an important topic in statistics and theoretical computer science. Statistically optimal procedures such as Tukey's median and other estimators based on depth functions are impractical because of their computational intractability. In this paper, we est…
A new depth measure based on optimal control theory captures multi-modal data.
problem Statistical depths for high-dimensional data.
method Eikonal equations and optimal control theory.
result The new depth measure is robust under adversarial models.
Following the seminal idea of Tukey, data depth is a function that measures how close an arbitrary point of the space is located to an implicitly defined center of a data cloud. Having undergone theoretical and computational developments, it is now employed in numerous applications with classification being the most po…
Develops privacy-preserving multivariate median estimation methods.
problem Lack of rigorous privacy guarantees for robust multivariate location estimation.
method Novel finite-sample performance guarantees for differentially private multivariate depth-based medians.
result Sharp performance guarantees for multivariate depth-based medians under differential privacy.
WideBNet learns inverse scattering from wide-band data efficiently and stably.
problem Learning the inverse scattering map from wide-band scattering data.
method Combines butterfly factorization, FFT, and deep learning.
result WideBNet requires fewer training points and has stable training dynamics.
New research extends optimal transport map breakdown properties to general costs.
problem Understanding robustness of optimal transport maps under contamination.
method Analyzing breakdown point of optimal transport maps for general convex costs.
result Breakdown point of optimal transport maps is independent of the cost function.
Estimation of the covariance matrix has attracted a lot of attention of the statistical research community over the years, partially due to important applications such as Principal Component Analysis. However, frequently used empirical covariance estimator (and its modifications) is very sensitive to outliers in the da…
This paper improves robust cluster enumeration for RES data.
problem Challenges in determining optimal clusters in noisy data.
method Generalizes robust Bayesian cluster enumeration for RES mixtures.
result Significant robustness improvement over existing methods.
A new algorithm computes Fourier coefficients for a specified range efficiently.
problem Inefficiency in FFT due to fixed output size for all applications.
method Fast Partial Fourier Transform (PFT) that allows specifying the range of Fourier coefficients to compute.
result PFT achieves significant speedup over state-of-the-art FFT algorithms for small output sizes.
Fast linear transforms are ubiquitous in machine learning, including the discrete Fourier transform, discrete cosine transform, and other structured transformations such as convolutions. All of these transforms can be represented by dense matrix-vector multiplication, yet each has a specialized and highly efficient (su…
New method for risk quantification using quantile processes and measure distortions.
problem Risk quantification and valuation in financial markets.
method Develops a novel stochastic valuation principle based on probability measure distortions induced by quantile processes.
result Introduces a system of subjective probability measures that indexes a stochastic valuation principle susceptible to probability measure distortions.
A new depth measure and median defined on Hadamard manifolds.
problem Statistical depth and median on Hadamard manifolds.
method Horospherical depth and Busemann median defined using renormalized distance functions.
result The Busemann median exists for every Borel probability measure on Hadamard manifolds.
Researchers develop a new spatial process model for non-Gaussian data.
problem Non-Gaussian spatial data with asymmetry and heavy-tailedness.
method Re-parameterized Unified Skew-Normal (SUN) distribution, GSUN process, neural Bayes inference with GATs.
result GSUN process captures non-Gaussian spatial data properties and outperforms conventional models.
We deconstruct the performance of GANs into three components: 1. Formulation: we propose a perturbation view of the population target of GANs. Building on this interpretation, we show that GANs can be viewed as a generalization of the robust statistics framework, and propose a novel GAN architecture, termed as Cascade …
Intricating cardiac complexities are the primary factor associated with healthcare costs and the highest cause of death rate in the world. However, preventive measures like the early detection of cardiac anomalies can prevent severe cardiovascular arrests of varying complexities and can impose a substantial impact on h…
We rigorously prove statistical physics predictions for non-convex GLMs in high dimensions.
problem Analyzing high-dimensional optimization problems in non-convex Generalized Linear Models.
method Developed a systematic framework using the Gaussian Min-Max Theorem and AMP to rigorously prove replica-symmetric formulas.
result Validated statistical physics predictions for non-convex GLMs, aligning with physicist's conjectures.
Active sampling algorithm for linear regression with various norms and improved query complexity.
problem Efficiently querying a few entries of a target vector for near optimal minimizers of linear regression.
method Lewis weight sampling and active sampling algorithms for different p norms. result Optimal query complexity for p∈(0,1), 1<p<2, and 2<p<∞. Many methods for automated software test generation, including some that explicitly use machine learning (and some that use ML more broadly conceived) derive new tests from existing tests (often referred to as seeds). Often, the seed tests from which new tests are derived are manually constructed, or at least simpler t…
A family of maximum mean discrepancy (MMD) kernel two-sample tests is introduced. Members of the test family are called Block-tests or B-tests, since the test statistic is an average over MMDs computed on subsets of the samples. The choice of block size allows control over the tradeoff between test power and computatio…
USP test improves on Pearson's chi-squared and G-test for independence.
problem Deficiencies in Pearson's chi-squared and G-test for independence. method USP test based on U-statistic estimator of population dependence measure. result USP test controls size, handles small cell counts, and detects minimal violations of independence.
E-C2ST uses E-values for high-dimensional data two-sample tests.
problem Statistical testing for high-dimensional data.
method Combines split likelihood ratio tests and predictive independence tests, using E-values for anytime-valid sequential tests.
result E-C2ST achieves enhanced statistical power by partitioning datasets into multiple batches.
This paper provides a comprehensive survey of Machine Learning Testing (ML testing) research. It covers 144 papers on testing properties (e.g., correctness, robustness, and fairness), testing components (e.g., the data, learning program, and framework), testing workflow (e.g., test generation and test evaluation), and …
Cheap permutation tests speed up distribution testing without sacrificing accuracy.
problem Efficiently testing distribution differences and independence.
method Group datapoints into bins and permute only these bins, using stored sufficient statistics.
result Cheap permutation tests maintain the accuracy and optimality of standard tests but are significantly faster.
Paper proposes a chi-square test for distance correlation.
problem Testing distance correlation is computationally expensive.
method Proposes a chi-square test for distance correlation, non-parametric, fast, applicable to various metrics.
result Chi-square test exhibits similar power to permutation test and can be valid and universally consistent for testing independence.
The paper tests properties of multiple distributions with limited samples.
problem Testing properties of multiple distributions with few samples.
method Designing testers for uniformity, identity, and closeness testing under specific conditions.
result Sample optimal testers for uniformity, identity, and closeness testing are provided.
Optimizes two-sample tests for non-Euclidean domains using spectral regularization.
problem Optimizing two-sample tests for non-Euclidean domains.
method Spectral regularization of MMD test to achieve minimax optimality.
result Proposes a spectral regularization method that improves test optimality.
DRIFT uses RL to automate functional software testing efficiently.
problem Efficient and reliable automated software testing.
method DRIFT employs Q-learning with Graph Neural Networks on symbolic UI representations.
result DRIFT can robustly test software functionalities in a fully automated manner.
Robust test for distributions under Hellinger distance, simpler than optimal tests.
problem Testing and estimating distributions robustly under Hellinger distance.
method Simple robust hypothesis test with optimal sample complexity, robust to Hellinger distance perturbations.
result Empirically demonstrated robustness and power of the test on canonical distributions.