Anastasios Kyrillidis
Anastasios Kyrillidis
Assistant Professor, Computer Science Department, Rice University
Verified email at - Homepage
Cited by
Cited by
Multi-way compressed sensing for sparse low-rank tensors
ND Sidiropoulos, A Kyrillidis
IEEE Signal Processing Letters, 1-1, 2012
Dropping convexity for faster semi-definite optimization
S Bhojanapalli, A Kyrillidis, S Sanghavi
Conference on Learning Theory, 530-582, 2016
Non-square matrix sensing without spurious local minima via the Burer-Monteiro approach
D Park, A Kyrillidis, C Caramanis, S Sanghavi
Artificial Intelligence and Statistics, pp. 65-74, 2016
Finding low-rank solutions via non-convex matrix factorization, efficiently and provably
D Park, A Kyrillidis, C Caramanis, S Sanghavi
SIAM Journal on Imaging Sciences 11 (4), 2165–2204, 2018
Composite self-concordant minimization
Q Tran Dinh, A Kyrillidis, V Cevher
Journal of Machine Learning Research 16 (ARTICLE), 371-416, 2015
Matrix recipes for hard thresholding methods
A Kyrillidis, V Cevher
Journal of Mathematical Imaging and Vision, 2012
Sparse projections onto the simplex
A Kyrillidis, S Becker, V Cevher, C Koch
Proceedings of The 30th International Conference on Machine Learning 28, 235–243, 2012
Provable deterministic leverage score sampling
D Papailiopoulos, A Kyrillidis, C Boutsidis
Proceedings of the 20th ACM SIGKDD international conference on Knowledge …, 2014
Recipes on hard thresholding methods
A Kyrillidis, V Cevher
2011 4th IEEE International Workshop on Computational Advances in Multi …, 2011
Combinatorial selection and least absolute shrinkage via the CLASH algorithm
A Kyrillidis, V Cevher
2012 IEEE International Symposium on Information Theory Proceedings, 2216-2220, 2012
Provable compressed sensing quantum state tomography via non-convex methods
A Kyrillidis, A Kalev, D Park, S Bhojanapalli, C Caramanis, S Sanghavi
npj Quantum Information 4 (1), 1-7, 2018
Group-sparse model selection: Hardness and relaxations
L Baldassarre, N Bhan, V Cevher, A Kyrillidis, S Satpathi
IEEE Transactions on Information Theory 62 (11), 6508-6534, 2016
A proximal Newton framework for composite minimization: Graph learning without Cholesky decompositions and matrix inversions
QT Dinh, A Kyrillidis, V Cevher
Proceedings of The 30th International Conference on Machine Learning 28, 271–279, 2013
Matrix alps: Accelerated low rank and sparse matrix reconstruction
A Kyrillidis, V Cevher
2012 IEEE Statistical Signal Processing Workshop (SSP), 185-188, 2012
Randomized low-memory singular value projection
S Becker, V Cevher, A Kyrillidis
10th International Conference on Sampling Theory and Applications (Sampta), 2013
Structured sparsity: Discrete and convex approaches
A Kyrillidis, L Baldassarre, M El Halabi, Q Tran-Dinh, V Cevher
Compressed Sensing and its Applications, 341-387, 2015
An inexact, proximal, path-following algorithm for constrained convex minimization
QT Dinh, A Kyrillidis, V Cevher
SIAM Journal on Optimization, 2013
Improving co-cluster quality with application to product recommendations
M Vlachos, F Fusco, C Mavroforakis, A Kyrillidis, VG Vassiliadis
Proceedings of the 23rd ACM International Conference on Conference on …, 2014
Sparse PCA via Bipartite Matchings
M Asteris, D Papailiopoulos, A Kyrillidis, A Dimakis
Neural Information Processing Systems 2015 28, 1-9, 2015
On quantifying qualitative geospatial data: A probabilistic approach
G Skoumas, D Pfoser, A Kyrillidis
Proceedings of the Second ACM SIGSPATIAL International Workshop on …, 2013
The system can't perform the operation now. Try again later.
Articles 1–20