Cikkek nyilvánosan hozzáférhető megbízással - Christopher LiawTovábbi információ
Valahol hozzáférhető: 11
Nearly-tight VC-dimension and pseudodimension bounds for piecewise linear neural networks
PL Bartlett, N Harvey, C Liaw, A Mehrabian
Journal of Machine Learning Research 20 (63), 1-17, 2019
Megbízások: US National Science Foundation, Australian Research Council, Natural …
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 31, 2018
Megbízások: Natural Sciences and Engineering Research Council of Canada, Canada First …
A simple tool for bounding the deviation of random matrices on geometric sets
C Liaw, A Mehrabian, Y Plan, R Vershynin
Geometric Aspects of Functional Analysis: Israel Seminar (GAFA) 2014–2016 …, 2017
Megbízások: US National Science Foundation, US Department of Defense, Natural Sciences …
Private and polynomial time algorithms for learning gaussians and beyond
H Ashtiani, C Liaw
Conference on Learning Theory, 1075-1076, 2022
Megbízások: Natural Sciences and Engineering Research Council of Canada
Polynomial time and private learning of unbounded gaussian mixture models
J Arbas, H Ashtiani, C Liaw
International Conference on Machine Learning, 1018-1040, 2023
Megbízások: Natural Sciences and Engineering Research Council of Canada
Privately learning mixtures of axis-aligned gaussians
I Aden-Ali, H Ashtiani, C Liaw
Advances in Neural Information Processing Systems 34, 3925-3938, 2021
Megbízások: Natural Sciences and Engineering Research Council of Canada
Improved algorithms for online submodular maximization via first-order regret bounds
N Harvey, C Liaw, T Soma
Advances in Neural Information Processing Systems 33, 123-133, 2020
Megbízások: Natural Sciences and Engineering Research Council of Canada
Mixtures of gaussians are privately learnable with a polynomial number of samples
M Afzali, H Ashtiani, C Liaw
International Conference on Algorithmic Learning Theory, 47-73, 2024
Megbízások: Natural Sciences and Engineering Research Council of Canada
The Vickrey auction with a single duplicate bidder approximates the optimal revenue
H Fu, C Liaw, S Randhawa
Proceedings of the 2019 ACM Conference on Economics and Computation, 419-420, 2019
Megbízások: Natural Sciences and Engineering Research Council of Canada
Tight load balancing via randomized local search
P Berenbrink, P Kling, C Liaw, A Mehrabian
2017 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2017
Megbízások: Natural Sciences and Engineering Research Council of Canada
Rainbow Hamilton cycles and lopsidependency
N Harvey, C Liaw
Discrete Mathematics 340 (6), 1261-1270, 2017
Megbízások: Natural Sciences and Engineering Research Council of Canada
A publikációs és a finanszírozási adatokat számítógépes program határozza meg, automatikusan.