Hassan Ashtiani
Title
Cited by
Cited by
Year
Clustering with same-cluster queries
H Ashtiani, S Kushagra, S Ben-David
arXiv preprint arXiv:1606.02404, 2016
682016
Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes
H Ashtiani, S Ben-David, N Harvey, C Liaw, A Mehrabian, Y Plan
Advances in Neural Information Processing Systems, 3412-3421, 2018
312018
Graph signature for self-reconfiguration planning of modules with symmetry
M Asadpour, H Ashtiani, A Sproewitz, A Ijspeert
Intelligent Robots and Systems (IROS 2009), IEEE/RSJ International …, 2009
272009
Sample-Efficient Learning of Mixtures
H Ashtiani, S Ben-David, A Mehrabian
AAAI Conference on Artificial Intelligence (AAAI), 2018
152018
A disaster invariant feature for localization
B Soleimani, H Ashtiani, BH Soleimani, H Moradi
Intelligent Robots and Systems (IROS 2010), IEEE/RSJ International …, 2010
152010
Near-optimal sample complexity bounds for robust learning of gaussian mixtures via compression schemes
H Ashtiani, S Ben-David, NJA Harvey, C Liaw, A Mehrabian, Y Plan
Journal of the ACM (JACM) 67 (6), 1-42, 2020
14*2020
Bandit-based local feature subset selection
H Ashtiani, MN Ahmadabadi, BN Araabi
Neurocomputing 138, 371-382, 2014
142014
Online Nearest Neighbor Search in Hamming Space
S Eghbali, H Ashtiani, L Tahvildari
In Data Mining (ICDM), 2017 IEEE International Conference on, 2017
13*2017
Representation learning for clustering: a statistical framework
H Ashtiani, S Ben-David
Conference on Uncertainty in Artificial Intelligence. AUAI Press, 2015, 2015
132015
Disentangled behavioural representations.
A Dezfouli, H Ashtiani, O Ghattas, R Nock, P Dayan, CS Ong
NeurIPS, 2251-2260, 2019
92019
Online nearest neighbor search using hamming weight trees
S Eghbali, H Ashtiani, L Tahvildari
IEEE transactions on pattern analysis and machine intelligence 42 (7), 1729-1740, 2019
72019
A dimension-independent generalization bound for kernel supervised principal component analysis
H Ashtiani, A Ghodsi
Feature Extraction: Modern Questions and Challenges, 19-29, 2015
72015
On the sample complexity of privately learning unbounded high-dimensional Gaussians
I Aden-Ali, H Ashtiani, G Kamath
Algorithmic Learning Theory, 185-216, 2021
32021
Black-box certification and learning under adversarial perturbations
H Ashtiani, V Pathak, R Urner
International Conference on Machine Learning, 388-398, 2020
22020
On the Sample Complexity of Learning Sum-Product Networks
I Aden-Ali, H Ashtiani
International Conference on Artificial Intelligence and Statistics, 4508-4518, 2020
22020
Some techniques in density estimation
H Ashtiani, A Mehrabian
arXiv preprint arXiv:1801.04003, 2018
12018
Bandit-based structure learning for bayesian network classifiers
S Eghbali, MHZ Ashtiani, MN Ahmadabadi, BN Araabi
International Conference on Neural Information Processing, 349-356, 2012
12012
Privately Learning Mixtures of Axis-Aligned Gaussians
I Aden-Ali, H Ashtiani, C Liaw
arXiv preprint arXiv:2106.02162, 2021
2021
A PAC-Theory of Clustering with Advice
H Ashtiani
University of Waterloo, 2018
2018
The system can't perform the operation now. Try again later.
Articles 1–19