Christopher Kennedy

Follow

Generating author description...

Common Coauthors
Commonly Cited References
Action Title Year Authors # of times referenced
+ PDF Chat A Cheeger Inequality for the Graph Connection Laplacian 2013 Afonso S. Bandeira
Amit Singer
Daniel A. Spielman
3
+ PDF Chat On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations 2005 Anthony Man–Cho So
Jiawei Zhang
Yinyu Ye
3
+ PDF Chat Some metric inequalities in the space of matrices 1955 Ky Fan
Alan J. Hoffman
3
+ Quadratic forms on graphs 2005 Ilan Alon
Konstantin Makarychev
Yury Makarychev
Assaf Naor
3
+ MOMENTS OF WISHART-LAGUERRE AND JACOBI ENSEMBLES OF RANDOM MATRICES: APPLICATION TO THE QUANTUM TRANSPORT PROBLEM IN CHAOTIC CAVITIES 2011 Giacomo Livan
Pierpaolo Vivo
3
+ Angular synchronization by eigenvectors and semidefinite programming 2010 Amit Singer
3
+ Random Matrix Theory and Wireless Communications 2004 Antonia M. Tulino
Sergio VerdĂș
3
+ PDF Chat Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming 1995 Michel X. Goemans
David P. Williamson
3
+ Moment inequalities for sums of random matrices and their applications in optimization 2009 Anthony Man–Cho So
3
+ PDF Chat Introduction to the non-asymptotic analysis of random matrices 2012 Roman Vershynin
3
+ On maximization of quadratic form over intersection of ellipsoids with common center 1999 Arkadi Nemirovski
C. Roos
TamĂĄs Terlaky
3
+ On the singular values of Gaussian random matrices 2001 Jianhong Shen
3
+ Maximizing Quadratic Programs: Extending Grothendieck's Inequality 2004 Moses Charikar
Anthony Wirth
3
+ PDF Chat Efficient rounding for the noncommutative grothendieck inequality 2013 Assaf Naor
Oded Regev
Thomas Vidick
3
+ Closest Unitary, Orthogonal and Hermitian Operators to a Given Operator 1975 Joseph B. Keller
3
+ Sums of random symmetric matrices and quadratic optimization under orthogonality constraints 2006 Arkadi Nemirovski
3
+ On the Rate of Convergence to the Marchenko--Pastur Distribution 2011 Friedrich Götze
Alexandre Tikhomirov
2
+ PDF Chat A Simple Proof of the Restricted Isometry Property for Random Matrices 2008 Richard G. Baraniuk
Mark A. Davenport
Ronald DeVore
Michael B. Wakin
2
+ Block Coordinate Descent Methods for Semidefinite Programming 2011 Zaiwen Wen
Donald Goldfarb
Katya Scheinberg
2
+ PDF Chat Square-root lasso: pivotal recovery of sparse signals via conic programming 2011 Alexandre Belloni
Victor Chernozhukov
Lei Wang
2
+ PDF Chat Grothendieck inequalities for semidefinite programs with rank constraint 2014 Jop Briët
Fernando MĂĄrio de Oliveira Filho
Frank Vallentin
2
+ PDF Chat Some sharp performance bounds for least squares regression with L1 regularization 2009 Tong Zhang
2
+ Random Matrix Methods for Wireless Communications 2011 Romain Couillet
MĂ©rouane Debbah
2
+ PDF Chat High-dimensional generalized linear models and the lasso 2008 Sara A. van de Geer
2
+ PDF Chat Adaptive estimation of a quadratic functional by model selection 2000 BĂ©atrice Laurent
Pascal Massart
2
+ PDF Chat Lasso-type recovery of sparse representations for high-dimensional data 2009 Nicolai Meinshausen
Bin Yu
2
+ Regularization Paths for Generalized Linear Models via Coordinate Descent. 2010 Jerome H. Friedman
Trevor Hastie
Rob Tibshirani
2
+ Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables 1965 D. B. Owen
Milton Abramowitz
Irene A. Stegun
2
+ Prediction error of cross-validated Lasso 2015 Sourav Chatterjee
Jafar Jafarov
2
+ PDF Chat A study of error variance estimation in Lasso regression 2015 Stephen Reid
Robert Tibshirani
Jerome H. Friedman
2
+ Global registration of multiple point clouds using semidefinite programming 2013 Kunal N. Chaudhury
Yuehaw Khoo
Amit Singer
2
+ PDF Chat Minimax Rates of Estimation for High-Dimensional Linear Regression Over $\ell_q$-Balls 2011 Garvesh Raskutti
Martin J. Wainwright
Bin Yu
2
+ Rate Minimaxity of the Lasso and Dantzig Selector for the l q Loss in l r Balls 2010 Fei Ye
Cun‐Hui Zhang
2
+ PDF Chat Grothendieck’s Theorem, past and present 2011 Gilles Pisier
2
+ On sparse reconstruction from Fourier and Gaussian measurements 2007 Mark Rudelson
Roman Vershynin
2
+ A new upper bound for the complex Grothendieck constant 1987 Uffe Haagerup
2
+ PDF Chat The Positive Semidefinite Grothendieck Problem with Rank Constraint 2010 Jop Briët
Fernando MĂĄrio de Oliveira Filho
Frank Vallentin
2
+ Semidefinite relaxation and nonconvex quadratic optimization 1998 Yu. Nesterov
2
+ PDF Chat Simultaneous analysis of Lasso and Dantzig selector 2009 Peter J. Bickel
Ya’acov Ritov
Alexandre B. Tsybakov
2
+ PDF Chat Tight Hardness of the Non-commutative Grothendieck Problem 2015 Jop Briot
Oded Regev
Rishi Saket
2
+ Convex Recovery From Interferometric Measurements 2017 Laurent Demanet
Vincent Jugnon
2
+ Variance estimation in high-dimensional linear models 2014 Lee H. Dicker
2
+ Regression Shrinkage and Selection Via the Lasso 1996 Robert Tibshirani
2
+ PDF Chat On the conditions used to prove oracle results for the Lasso 2009 Sara A. van de Geer
Peter BĂŒhlmann
2
+ PDF Chat Minimax risks for sparse regressions: Ultra-high dimensional phenomenons 2012 Nicolas Verzélen
2
+ Asymmetries in the Acquisition of Numbers and Quantifiers 2006 Felicia Hurewitz
Anna Papafragou
Lila R. Gleitman
Rochel Gelman
1
+ PDF Chat Accessing the unsaid: The role of scalar alternatives in children’s pragmatic inference 2010 David Barner
Neon Brooks
Alan Bale
1
+ PDF Chat Interpreting numerals and scalar items under memory load 2013 Paul Marty
Emmanuel Chemla
Benjamin Spector
1
+ PDF Chat Inference and exact numerical representation in early language development 2009 David Barner
Asaf Bachrach
1
+ K-Theory for Certain C ∗ -Algebras 1981 Joachim Cuntz
1