Search Results for author:
Found 15 papers, 9 papers with code
hyppo: A Multivariate Hypothesis Testing Python Package
We introduce hyppo, a unified library for performing multivariate hypothesis testing, including independence, two-sample, and k-sample testing.
Deep Unlearning via Randomized Conditionally Independent Hessians
For models which require no training (k-NN), simply deleting the closest original sample can be effective.
Robust Blind Deconvolution via Mirror Descent
We revisit the Blind Deconvolution problem with a focus on understanding its robustness and convergence properties.
DUAL-GLOW: Conditional Flow-Based Generative Model for Modality Transfer
Motivated by developments in modality transfer in vision, we study the generation of certain types of PET images from MRI data.
Random Forests for Adaptive Nearest Neighbor Estimation of Information-Theoretic Quantities
Information-theoretic quantities, such as conditional entropy and mutual information, are critical data summaries for quantifying uncertainty.
Resource Constrained Neural Network Architecture Search: Will a Submodularity Assumption Help?
In the latter case, the optimization is often non-differentiable and also not very amenable to derivative-free optimization methods.
Scaling Recurrent Models via Orthogonal Approximations in Tensor Trains
Using insights from differential geometry, we adapt the tensor train decomposition to construct networks with significantly fewer parameters, allowing us to train powerful recurrent networks on whole brain image volume sequences.
Stochastic Optimization for Spectral Risk Measures
Spectral risk objectives - also called $L$-risks - allow for learning systems to interpolate between optimizing average-case performance (as in empirical risk minimization) and worst-case performance on a task.
Manifold Oblique Random Forests: Towards Closing the Gap on Convolutional Deep Networks
In particular, Forests dominate other methods in tabular data, that is, when the feature space is unstructured, so that the signal is invariant to a permutation of the feature indices.
Sampling-free Uncertainty Estimation in Gated Recurrent Units with Exponential Families
There has recently been a concerted effort to derive mechanisms in vision and machine learning systems to offer uncertainty estimates of the predictions they make.
Finding Differentially Covarying Needles in a Temporally Evolving Haystack: A Scan Statistics Perspective
Recent results in coupled or temporal graphical models offer schemes for estimating the relationship structure between features when the data come from related (but distinct) longitudinal sources.
Independence Testing for Temporal Data
While many non-parametric and universally consistent dependence measures have recently been proposed, directly applying them to temporal data can inflate the p-value and result in invalid test.
Towards a theory of out-of-distribution learning
This assumption renders these theories inadequate for characterizing 21$^{st}$ century real world data problems, which are typically characterized by evaluation distributions that differ from the training data distributions (referred to as out-of-distribution learning).
Distributionally Robust Optimization with Bias and Variance Reduction
We consider the distributionally robust optimization (DRO) problem with spectral risk-based uncertainty set and $f$-divergence penalty.
A Primal-Dual Algorithm for Faster Distributionally Robust Optimization
We consider the penalized distributionally robust optimization (DRO) problem with a closed, convex uncertainty set, a setting that encompasses the $f$-DRO, Wasserstein-DRO, and spectral/$L$-risk formulations used in practice.
