
Convergence of Gibbs Sampling: Coordinate HitandRun Mixes Fast
The Gibbs Sampler is a general method for sampling highdimensional dist...
read it

Solving Sparse Linear Systems Faster than Matrix Multiplication
Can linear systems be solved faster than matrix multiplication? While th...
read it

Socially Fair kMeans Clustering
We show that the popular kmeans clustering algorithm (Lloyd's heuristic...
read it

Matrix Decompositions and Sparse Graph Regularity
We introduce and study a matrix decomposition that is a common generaliz...
read it

Robustly Clustering a Mixture of Gaussians
We give an efficient algorithm for robustly clustering of a mixture of a...
read it

Strong SelfConcordance and Sampling
Motivated by the Dikin walk, we develop aspects of an interiorpoint the...
read it

HumanUsable Password Schemas: Beyond InformationTheoretic Security
Password users frequently employ passwords that are too simple, or they ...
read it

Fair Dimensionality Reduction and Iterative Rounding for SDPs
We model "fair" dimensionality reduction as an optimization problem. A c...
read it

The Price of Fair PCA: One Extra Dimension
We investigate whether the standard dimensionality reduction technique o...
read it

Smoothed Analysis of Discrete Tensor Decomposition and Assemblies of Neurons
We analyze linear independence of rank one tensors produced by tensor po...
read it

Polynomial Convergence of Gradient Descent for Training OneHiddenLayer Neural Networks
We analyze Gradient Descent applied to learning a bounded target functio...
read it

Usability of Humanly Computable Passwords
Reusing passwords across multiple websites is a common practice that com...
read it

Random Overlapping Communities: Approximating Motif Densities of Large Graphs
A wide variety of complex networks (social, biological, information etc....
read it

On the Complexity of Learning Neural Networks
The stunning empirical successes of neural networks currently lack rigor...
read it

The Complexity of Human Computation: A Concrete Model with an Application to Passwords
What can humans compute in their heads? We are thinking of a variety of ...
read it

Chisquared Amplification: Identifying Hidden Hubs
We consider the following general hidden hubs model: an n × n random mat...
read it

Agnostic Estimation of Mean and Covariance
We consider the problem of estimating the mean and covariance of a distr...
read it

Cortical Computation via Iterative Constructions
We study Boolean functions of an arbitrary number of input variables tha...
read it

Fourier PCA and Robust Tensor Decomposition
Fourier PCA is Principal Component Analysis of a matrix obtained from hi...
read it
Santosh Vempala
is this you? claim profile