Nika Haghtalab
Title
Cited by
Cited by
Year
Learning optimal commitment to overcome insecurity
A Blum, N Haghtalab, AD Procaccia
Advances in Neural Information Processing Systems, 1826-1834, 2014
582014
Commitment Without Regrets: Online Learning in Stackelberg Security Games
MF Balcan, A Blum, N Haghtalab, AD Procaccia
562015
Efficient learning of linear separators under bounded noise
P Awasthi, MF Balcan, N Haghtalab, R Urner
Conference on Learning Theory, 167-190, 2015
452015
Learning and 1-bit compressed sensing under asymmetric noise
P Awasthi, MF Balcan, N Haghtalab, H Zhang
Conference on Learning Theory, 152-192, 2016
422016
Ignorance is almost bliss: Near-optimal stochastic matching with few queries
A Blum, JP Dickerson, N Haghtalab, AD Procaccia, T Sandholm, ...
Operations research, 2020
402020
Clustering in the Presence of Background Noise
S Ben-David, N Haghtalab
International Conference in Machine Learning (ICML 2014), 2014
272014
Oracle-efficient online learning and auction design
M Dudik, N Haghtalab, H Luo, RE Schapire, V Syrgkanis, JW Vaughan
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS …, 2017
252017
Three strategies to success: Learning adversary models in security games
N Haghtalab, F Fang, TH Nguyen, A Sinha, AD Procaccia, M Tambe
252016
Lazy Defenders Are Almost Optimal Against Diligent Attackers
A Blum, N Haghtalab, AD Procaccia
28th AAAI Conference on Artificial Intelligence, 2014
232014
The provable virtue of laziness in motion planning
N Haghtalab, S Mackenzie, AD Procaccia, O Salzman, SS Srinivasa
Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018
222018
Collaborative PAC learning
A Blum, N Haghtalab, AD Procaccia, M Qiao
Advances in Neural Information Processing Systems, 2392-2401, 2017
192017
-center Clustering under Perturbation Resilience
MF Balcan, N Haghtalab, C White
arXiv preprint arXiv:1505.03924, 2015
15*2015
Opting into optimal matchings
A Blum, I Caragiannis, N Haghtalab, AD Procaccia, EB Procaccia, ...
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
112017
Weighted voting via no-regret learning
N Haghtalab, R Noothigattu, AD Procaccia
Thirty-Second AAAI Conference on Artificial Intelligence, 2018
62018
Robust submodular maximization: Offline and online algorithms
N Anari, N Haghtalab, J Naor, S Pokutta, M Singh, A Torrico
arXiv preprint arXiv:1710.04740, 2017
62017
Efficient PAC learning from the crowd
P Awasthi, A Blum, N Haghtalab, Y Mansour
arXiv preprint arXiv:1703.07432, 2017
62017
The disparate equilibria of algorithmic decision making when individuals invest rationally
LT Liu, A Wilson, N Haghtalab, AT Kalai, C Borgs, J Chayes
Proceedings of the 2020 Conference on Fairness, Accountability, and …, 2020
52020
Online learning with a hint
O Dekel, N Haghtalab, P Jaillet
Advances in Neural Information Processing Systems, 5299-5308, 2017
52017
Structured robust submodular maximization: Offline and online algorithms
N Anari, N Haghtalab, S Pokutta, M Singh, A Torrico
arXiv preprint arXiv:1710.04740, 2017
42017
Learning to play stackelberg security games
A Blum, N Haghtalab, AD Procaccia
Carnegie Mellon University, 2015
42015
The system can't perform the operation now. Try again later.
Articles 1–20