Matthias Poloczek
Matthias Poloczek
Uber AI
Verifierad e-postadress på
Citeras av
Citeras av
Multi-information source optimization
M Poloczek, J Wang, P Frazier
Advances in Neural Information Processing Systems, 4288-4298, 2017
Bayesian optimization with gradients
J Wu, M Poloczek, AG Wilson, P Frazier
Advances in Neural Information Processing Systems, 5267-5278, 2017
Randomized greedy algorithms for the maximum matching problem with new analysis
M Poloczek, M Szegedy
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 708-717, 2012
Bayesian optimization of combinatorial structures
R Baptista, M Poloczek
Proceedings of the 35th International Conference on Machine Learning 80, 462 …, 2018
Warm starting Bayesian optimization
M Poloczek, J Wang, PI Frazier
2016 Winter Simulation Conference (WSC), 770-781, 2016
Greedy algorithms for the maximum satisfiability problem: Simple algorithms and inapproximability bounds
M Poloczek, G Schnitger, DP Williamson, A Van Zuylen
SIAM Journal on Computing 46 (3), 1029-1061, 2017
Bounds on greedy algorithms for MAX SAT
M Poloczek
European Symposium on Algorithms, 37-48, 2011
Efficient search of compositional space for hybrid organic–inorganic perovskites via Bayesian optimization
HC Herbol, W Hu, P Frazier, P Clancy, M Poloczek
npj Computational Materials 4 (1), 1-7, 2018
Contagious sets in dense graphs
D Freund, M Poloczek, D Reichman
European Journal of Combinatorics 68, 66-78, 2018
Randomized variants of Johnson's algorithm for MAX SAT
M Poloczek, G Schnitger
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete …, 2011
Advances in bayesian optimization with applications in aerospace engineering
R Lam, M Poloczek, P Frazier, KE Willcox
2018 AIAA Non-Deterministic Approaches Conference, 1656, 2018
A framework for Bayesian optimization in embedded subspaces
A Nayebi, A Munteanu, M Poloczek
International Conference on Machine Learning, 4752-4761, 2019
Scalable global optimization via local bayesian optimization
D Eriksson, M Pearce, J Gardner, RD Turner, M Poloczek
Advances in Neural Information Processing Systems, 5496-5507, 2019
Greedy matching: guarantees and limitations
B Besser, M Poloczek
Algorithmica 77 (1), 201-234, 2017
On some recent approximation algorithms for MAX SAT
M Poloczek, DP Williamson, A van Zuylen
Latin American Symposium on Theoretical Informatics, 598-609, 2014
An experimental evaluation of fast approximation algorithms for the maximum satisfiability problem
M Poloczek, DP Williamson
Journal of Experimental Algorithmics (JEA) 22, 1-18, 2017
Empirically comparing the finite-time performance of simulation-optimization algorithms
NA Dong, DJ Eckman, X Zhao, SG Henderson, M Poloczek
Simulation Conference (WSC), 2017 Winter, 2206-2217, 2017
Greedy algorithms for MAX SAT and maximum matching: Their power and limitations
M Poloczek
Bypassing Solid-State Intermediates by Solvent Engineering the Crystallization Pathway in Hybrid Organic–Inorganic Perovskites
AG Ortoll-Bloch, HC Herbol, BA Sorenson, M Poloczek, LA Estroff, ...
Crystal Growth & Design 20 (2), 1162-1171, 2019
Fast reconfigurable antenna state selection with hierarchical thompson sampling
T Zhao, M Li, M Poloczek
ICC 2019-2019 IEEE International Conference on Communications (ICC), 1-6, 2019
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20