Search Results for author:
Found 6 papers, 0 papers with code
On the Detection of Mixture Distributions with applications to the Most Biased Coin Problem
As a result, these bounds have surprising implications both for solutions to the most biased coin problem and for anomaly detection when only partial information about the parameters is known.
Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets
We characterize the tradeoff between distortion and sample complexity $m$ in terms of the Gaussian width $\omega(K)$ of the set.
Fast methods for denoising matrix completion formulations, with applications to robust seismic data interpolation
In this paper, we consider matrix completion formulations designed to hit a target data-fitting error level provided by the user, and propose an algorithm called LR-BPDN that is able to exploit factorized formulations to solve the corresponding optimization problem.
Query Complexity of Derivative-Free Optimization
Moreover, if the function evaluations are noisy, then approximating gradients by finite differences is difficult.
Practical Large-Scale Optimization for Max-norm Regularization
The max-norm was proposed as a convex matrix regularizer by Srebro et al (2004) and was shown to be empirically superior to the trace-norm for collaborative filtering problems.
Transduction with Matrix Completion: Three Birds with One Stone
We pose transductive classification as a matrix completion problem.
