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.
Develops privacy-preserving methods for equivalence testing in healthcare.
problem Protecting patient data in healthcare studies.
method Differential privacy techniques for simulation-based calibration.
result Maintains type-I error control and comparable power to non-private methods.
The paper proposes a new method for comparing logistic regression models across different populations.
problem Comparing logistic regression models across sub-populations can lead to misleading results.
method Develops a cascading set of equivalence tests for logistic regression models, addressing coding, predictions, and overall accuracy.
result Equivalence testing incentivizes accurate inference and avoids perverse incentives from significance tests.
Equivalent tests for SGD batch size selection found.
problem Finding equivalent tests for adaptive batch size selection in SGD.
method Norm and inner product/orthogonality tests equivalence demonstration.
result Norm and inner product/orthogonality tests are equivalent under specific conditions.
Two statistical tasks are shown to have equivalent sample complexity.
problem Determining if a function depends on only a few variables and identifying those variables.
method Proved statistical equivalence of feature selection and junta testing through sample complexity analysis.
result Brute-force algorithm is sample-optimal for both tasks with optimal sample size.
GaussDetect-LiNGAM eliminates Gaussianity tests for causal discovery.
problem Causal direction identification without Gaussianity assumptions.
method Leverages the equivalence between noise Gaussianity and residual independence in reverse regression.
result Gaussianity tests replaced with robust kernel-based independence tests.
New TTP framework fuses control arms while controlling Type-I error.
problem Bias in borrowing control data from previous trials.
method Kernel two-sample testing via MMD and equivalence testing.
result Higher power than standard TTP methods while maintaining error control.
Statistical query algorithms and low-degree tests are nearly equivalent in high-dimensional hypothesis testing.
problem High-dimensional hypothesis testing and information-computation gaps.
method Analysis of statistical query framework and low-degree polynomials.
result Statistical query algorithms and low-degree polynomials are almost equivalent in power under mild conditions.
We find a deterministic equivalent for random feature regression's test error, independent of feature map dimension.
problem Understanding the generalization performance of random feature ridge regression.
method We derive a deterministic equivalent for the test error of RFRR under a concentration property, showing it can be approximated by a closed-form expression dependent on feature map eigenvalues.
result Our approximation guarantee is non-asymptotic, multiplicative, and independent of the feature map dimension, providing a tight result for the smallest number of features achieving optimal minimax error rate.
New method tests causal relationships from data without needing to learn the entire graph.
problem Testing if a causal graph belongs to a specific Markov equivalence class from observational data.
method Established bounds on the number of independence tests required and provided an algorithm that matches these bounds.
result Testing requires exponentially less independence tests compared to learning, especially in graphs with high in-degrees and small clique sizes.
The paper proves a non-asymptotic test error approximation for KRR.
problem Understanding the test error of Kernel Ridge Regression.
method Established a non-asymptotic deterministic approximation for test error of KRR.
result The test error of KRR can be approximated by a closed-form estimate derived from the spectrum of the kernel operator.
A new algorithm for robust causal discovery in small sample sizes.
problem Limited data leads to weak conditional independence tests in causal discovery.
method Proposes a k-PC algorithm that bounds conditioning set size for robust causal discovery. result The k-PC algorithm enables more robust causal discovery in small sample sizes. A nonparametric two-sample test using a parametric integral probability metric
problem Detecting distributional differences between two independent samples
method Propose a new two-sample test statistic based on a newly introduced integral probability metric (IPM)
result Establish theoretical guarantees for the associated two-sample testing procedure
The paper establishes a correspondence for projective bundles over curves using test configurations and extremal metrics.
problem Establishing a correspondence for projective bundles over curves using test configurations and extremal metrics.
method Constructing compatible test configurations and using the generalized Calabi ansatz.
result The relative uniform stability of \( (\mathbb{P}(E),[ω]) \) implies the existence of an extremal metric.
Near-optimal tests and confidence sequences for non-parametric data.
problem Flexible statistical inference and decision-making with non-parametric data.
method Classic delayed-start normal-mixture sequential probability ratio tests with asymptotic guarantees.
result Asymptotically optimal type-I error and expected rejection time guarantees.
Associating genetic markers with a multidimensional phenotype is an important yet challenging problem. In this work, we establish the equivalence between two popular methods: kernel-machine regression (KMR), and kernel distance covariance (KDC). KMR is a semiparametric regression frameworks that models the covariate ef…
We classify the Montesinos links up to mutation and 5-move equivalence, and obtain from this a Jones and Kauffman polynomial test for a Montesinos link.
Characterizes Bayesian networks up to unconditional equivalence.
problem Characterizing Bayesian networks up to unconditional equivalence.
method Transformational characterization via undirected graphs and specified moves.
result Two DAGs are in the same UEC if and only if one can be transformed into the other via a finite sequence of moves.
We consider the problem of comparing probability densities between two groups. A new probabilistic tensor product smoothing spline framework is developed to model the joint density of two variables. Under such a framework, the probability density comparison is equivalent to testing the presence/absence of interactions.…
We provide a unifying framework linking two classes of statistics used in two-sample and independence testing: on the one hand, the energy distances and distance covariances from the statistics literature; on the other, maximum mean discrepancies (MMD), that is, distances between embeddings of distributions to reproduc…
The paper benchmarks OS with RCTs, accounting for right-censoring.
problem Benchmarking observational studies with experimental data under censoring.
method Two cases: independent and dependent censoring. Censoring-doubly-robust signal for CATE.
result Effectiveness of censoring-aware tests verified via experiments and real data.
Graph Neural Networks (GNNs) have achieved much success on graph-structured data. In light of this, there have been increasing interests in studying their expressive power. One line of work studies the capability of GNNs to approximate permutation-invariant functions on graphs, and another focuses on the their power as…
In this work we target the problem of provably computing the equivalence between two programs represented as dataflow graphs. To this end, we formalize the problem of equivalence between two programs as finding a set of semantics-preserving rewrite rules from one into the other, such that after the rewrite the two prog…
We present an extension of the Kolmogorov-Smirnov (KS) two-sample test, which can be more sensitive to differences in the tails. Our test statistic is an integral probability metric (IPM) defined over a higher-order total variation ball, recovering the original KS test as its simplest case. We give an exact representer…
We provide a distribution-free test that can be used to determine whether any two joint distributions p and q are statistically different by inspection of a large enough set of samples. Following recent efforts from Long et al. [1], we rely on joint kernel distribution embedding to extend the kernel two-sample test…
LDP is equivalent to contraction of E_γ-divergence, impacting privacy and utility.
problem Analyzing trade-offs between privacy and utility in estimation problems.
method Equivalence of LDP constraints to contraction coefficients of E_γ-divergence, using f-divergences and estimation-theoretic tools.
result LDP guarantees can be expressed in terms of contraction coefficients of arbitrary f-divergences.
Distance-based tests, also called "energy statistics", are leading methods for two-sample and independence tests from the statistics community. Kernel-based tests, developed from "kernel mean embeddings", are leading methods for two-sample and independence tests from the machine learning community. A fixed-point transf…
The abstract explores connections between reinforcement learning, scaling, and diffusion.
problem Aligning reinforcement learning with human feedback and scaling techniques.
method Clarifying connections between reinforcement learning, scaling, and diffusion.
result Introducing a resampling approach for alignment and reward-directed diffusion models.
Introduces valuative stability for polarised varieties, equivalent to K-stability.
problem Characterizing K-stability for polarised varieties.
method Introduces valuative stability, equivalent to K-stability for test configurations with integral central fibre.
result Equivalence of valuative stability and K-stability for polarised varieties.
Equivalence proven between divisorial stability and quotient log divisorial stability.
problem Equivalence of divisorial stability and log divisorial stability under finite group actions.
method Interpolation technique and equivariant divisorial stability construction.
result Equivariant divisorial stability of a polarized variety is equivalent to log divisorial stability of its quotient.
Chern-Simons theory in the 1/N expansion has been conjectured to be equivalent to a topological string theory. This conjecture predicts a remarkable relationship between knot invariants and Gromov-Witten theory. We review some basic aspects of this relationship, as well as the tests of this conjecture performed over th…
Study compares three performance metrics of Bangladeshi banks.
problem Comparing different performance metrics of commercial banks.
method Empirical framework using MPI, ROA, TSR over 2011-2015.
result Productivity growth was recorded, but profitability and stock performance were negative.
The study proves Gaussian universality of deep random features learning.
problem Understanding the test error in deep random features learning.
method Proving Gaussian universality of test error in ridge regression and arbitrary convex losses.
result Sharp asymptotic formula for test error in ridge regression setting.
Improved machine learning models outperform their simpler counterparts by using imperfect labels.
problem Improving model performance using imperfect labels.
method Random feature ridge regression (RFRR) with a deterministic equivalent for excess test error.
result The student model can outperform the teacher model regardless of the teacher's scaling law, achieving the minimax optimal rate.
Usually one compares the accuracy of two competing classifiers via null hypothesis significance tests (nhst). Yet the nhst tests suffer from important shortcomings, which can be overcome by switching to Bayesian hypothesis testing. We propose a Bayesian hierarchical model which jointly analyzes the cross-validation res…
As a crucial problem in statistics is to decide whether additional variables are needed in a regression model. We propose a new multivariate test to investigate the conditional mean independence of Y given X conditioning on some known effect Z, i.e., E(Y|X, Z) = E(Y|Z). Assuming that E(Y|Z) and Z are linearly related, …
We study the portfolio problem of maximizing the outperformance probability over a random benchmark through dynamic trading with a fixed initial capital. Under a general incomplete market framework, this stochastic control problem can be formulated as a composite pure hypothesis testing problem. We analyze the connecti…
Solves a long-standing problem in Kähler geometry.
problem Existence of constant scalar curvature Kähler metrics on projectivized vector bundles.
method Introduces adiabatic slope stability, a weaker version of K-stability, and uses test configurations from subsheaves.
result Equivalence between adiabatic slope stability and existence of cscK metrics for simple vector bundles.
Deep Neural Networks (DNNs), with its promising performance, are being increasingly used in safety critical applications such as autonomous driving, cancer detection, and secure authentication. With growing importance in deep learning, there is a requirement for a more standardized framework to evaluate and test deep l…
Paper computes stability of Q-Fano spherical varieties using test configurations and Futaki invariants.
problem Stability of Q-Fano spherical varieties.
method Test configurations, Futaki invariants, intersection numbers.
result Equivalence of stability criteria and existence of Kähler-Ricci g-solitons.
For any topological groupoid G and any homomorphism from a locally compact Hausdorff topological group K to G, we construct an associated monodromy group. We prove that Morita equivalent topological groupoids have the same monodromy groups. We show how the monodromy groups can be used to test if a Lie groupoid lacks fa…
SGD reduces test error by decorrelating updates.
problem Improving generalization error in machine learning models.
method Derive a formula for generalization gap change due to SGD updates, compare to GD, and show decorrelation effect.
result SGD implicitly regularizes generalization error by decorrelating updates.
Statistical tests for fairness in admissions data reveal hidden patterns.
problem Simpson's paradox in admissions data hides true gender bias.
method Introduces a new statistical test based on Pearl's instrumental-variable inequalities.
result Statistical tests for fairness coincide with causal notions for the Berkeley admissions case.
This paper unifies two types of statistical methods for estimating treatment effects.
problem Isolating online A/B-tests and off-policy evaluation.
method Establishes formal equivalence between online Difference-in-Means and off-policy Inverse Propensity Scoring methods.
result Standard online methods are mathematically equivalent to off-policy methods with optimal control variates.
Clarifies the confidence interval approach for bioequivalence testing.
problem Ensuring the reliability of bioequivalence testing methods.
method Clarifies the conditions under which a 100(1-2α)% confidence interval yields a size-α test.
result A 100(1-2α)% confidence interval approach for bioequivalence testing yields a size-α test only when the two one-sided tests are 'equal-tailed'.
Local method identifies causal relations in Markov equivalent DAGs.
problem Identifying causal relations when multiple DAGs are Markov equivalent.
method Graphical condition and local criteria for identifying causal paths.
result Local learning algorithm efficiently identifies causal variables.
Unified score and distance-based GoF tests for model adequacy.
problem Difficulty in extending score-based GoF tests to nonparametric alternatives.
method Introducing semiparametric kernelized Stein discrepancy (SKSD) test.
result SKSD test is computationally efficient and universally consistent.
In 2000, Croke and Kleiner showed that a CAT(0) group G can admit more than one boundary. This contrasted with the situation for word hyperbolic groups, where it was well-known that each such group admitted a unique boundary---in a very stong sense. Prior to Croke and Kleiner's discovery, it had been observed by Geoghe…