Such embeddings induce the so-called maximum mean discrepancy (MMD; [Smola et al., 2007, Gretton et al., 2012]), which quantifies the discrepancy Many estimators for HSIC exist. The classical ones rely on U-statistics or V -statistics [Gretton et al., 2005, Quadrianto et al., 2009, Pfister et al., 2018] and are known to converge at a rate of Lower bounds for the related MMD are known [Tolstikhin et al., 2016], but the existing analysis considers radial kernels and relies on independent Gaussian distributions.

Obtaining human-interpretable explanations of large, general-purpose language models is an urgent goal for AI safety.

Knockoffs are a popular statistical tool for conditional variable selection in high dimension.

To exploit, UCT often selects the same action on successive trials, which can result in it getting stuck in local optima.

While optimization-based methods boast gen-eralizability across modalities and robust performance, learning-based methods promise peak performance, incorporating weak supervision and amortized optimization. However, the exact conditions for either paradigm to perform well over the other are shrouded and not explicitly outlined in the existing literature.

Here the concept of Granger causality is employed to propose a new criterion for unsupervised learning that is appropriate in the case of temporally-dependent source signals. The basic idea is to identify two projections of a multivariate time series such that the Granger causality among the resulting pair of components is maximized.