The following pages link to Martin J. Wainwright (Q209971):
Displaying 50 items.
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions (Q447861) (← links)
- On the computational complexity of high-dimensional Bayesian variable selection (Q510680) (← links)
- Optimal prediction for sparse linear models? Lower bounds for coordinate-separable M-estimators (Q521327) (← links)
- Statistical guarantees for the EM algorithm: from population to sample-based analysis (Q524451) (← links)
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling (Q548547) (← links)
- The geometry of hypothesis testing over convex cones: generalized likelihood ratio tests and minimax radii (Q666588) (← links)
- Support recovery without incoherence: a case for nonconvex regularization (Q682289) (← links)
- High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity (Q693741) (← links)
- Fast global convergence of gradient methods for high-dimensional statistical recovery (Q741793) (← links)
- Sampled forms of functional PCA in reproducing kernel Hilbert spaces (Q741794) (← links)
- Approximation properties of certain operator-induced norms on Hilbert spaces (Q765689) (← links)
- High-dimensional analysis of semidefinite relaxations for sparse principal components (Q834367) (← links)
- High-dimensional Ising model selection using \(\ell _{1}\)-regularized logistic regression (Q973867) (← links)
- On surrogate loss functions and \(f\)-divergences (Q1020983) (← links)
- On kernel methods for covariates that are rankings (Q1657968) (← links)
- On concentration for (regularized) empirical risk minimization (Q1688423) (← links)
- High-dimensional covariance estimation by minimizing \(\ell _{1}\)-penalized log-determinant divergence (Q1952214) (← links)
- Singularity, misspecification and the convergence rate of EM (Q1996764) (← links)
- Towards optimal estimation of bivariate isotonic matrices with unknown permutations (Q1996765) (← links)
- Randomized sketches for kernels: fast and optimal nonparametric regression (Q2012925) (← links)
- Improved bounds for discretization of Langevin diffusions: near-optimal rates without convexity (Q2137032) (← links)
- Worst-case versus average-case design for estimation from partial pairwise comparisons (Q2196209) (← links)
- From Gauss to Kolmogorov: localized measures of complexity for ellipses (Q2199701) (← links)
- Function-specific mixing times and concentration away from equilibrium (Q2226692) (← links)
- Active ranking from pairwise comparisons and when parametric assumptions do not help (Q2284367) (← links)
- A unified treatment of multiple testing with prior knowledge using the p-filter (Q2328060) (← links)
- The geometry of kernelized spectral clustering (Q2343965) (← links)
- Support union recovery in high-dimensional multivariate regression (Q2429923) (← links)
- Structure estimation for discrete graphical models: generalized covariance matrices and their inverses (Q2443211) (← links)
- Data association based on optimization in graphical models with application to sensor networks (Q2473188) (← links)
- Divide and conquer kernel ridge regression: a distributed algorithm with minimax optimal rates (Q2788410) (← links)
- Iterative Hessian sketch: fast and accurate solution approximation for constrained least-squares (Q2810850) (← links)
- Estimation from pairwise comparisons: sharp minimax bounds with topology dependence (Q2810857) (← links)
- Message-passing for graph-structured linear programs: proximal methods and rounding schemes (Q2896065) (← links)
- Restricted eigenvalue properties for correlated Gaussian designs (Q2896143) (← links)
- High-dimensional variable selection with sparse random projections: measurement sparsity and statistical efficiency (Q2896148) (← links)
- Randomized smoothing for stochastic optimization (Q2910890) (← links)
- A new look at survey propagation and its generalizations (Q2921781) (← links)
- Belief Propagation for Continuous State Spaces: Stochastic Message-Passing with Quantitative Guarantees (Q2933915) (← links)
- (Q2933949) (← links)
- (Q2933989) (← links)
- Probabilistic Analysis of Linear Programming Decoding (Q2934618) (← links)
- A Practical Scheme and Fast Algorithm to Tune the Lasso With Optimality Guarantees (Q2953663) (← links)
- Newton Sketch: A Near Linear-Time Optimization Algorithm with Linear-Quadratic Convergence (Q2967608) (← links)
- Randomized Sketches of Convex Programs With Sharp Guarantees (Q2977306) (← links)
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations (Q2978646) (← links)
- Stochastic Belief Propagation: A Low-Complexity Alternative to the Sum-Product Algorithm (Q2989296) (← links)
- Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issues (Q2989634) (← links)
- (Q3174022) (← links)
- Graphical Models and Message-Passing Algorithms: Some Introductory Lectures (Q3463611) (← links)
