default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthias Poloczek
Person information
- affiliation: Amazon, San Francisco, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i15]Hanyang Wang, Juergen Branke, Matthias Poloczek:
Bayesian Optimization with Preference Exploration by Monotonic Neural Network Ensemble. CoRR abs/2501.18792 (2025)- [i14]Leonard Papenmeier, Matthias Poloczek, Luigi Nardi:
Understanding High-Dimensional Bayesian Optimization. CoRR abs/2502.09198 (2025) - 2024
- [i13]Hanyang Wang, Juergen Branke
, Matthias Poloczek:
Respecting the limit:Bayesian optimization with a bound on the optimal value. CoRR abs/2411.04744 (2024) - 2023
- [j8]Yijia Wang, Matthias Poloczek, Daniel R. Jiang:
Dynamic Subgoal-based Exploration via Bayesian Optimization. Trans. Mach. Learn. Res. 2023 (2023) - [c20]Leonard Papenmeier, Luigi Nardi, Matthias Poloczek:
Bounce: Reliable High-Dimensional Bayesian Optimization for Combinatorial and Mixed Spaces. NeurIPS 2023 - [i12]Leonard Papenmeier, Luigi Nardi, Matthias Poloczek:
Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces. CoRR abs/2304.11468 (2023) - [i11]Leonard Papenmeier, Luigi Nardi, Matthias Poloczek:
Bounce: a Reliable Bayesian Optimization Algorithm for Combinatorial and Mixed Spaces. CoRR abs/2307.00618 (2023) - 2022
- [j7]Michael Pearce, Matthias Poloczek, Jürgen Branke:
Bayesian Optimization Allowing for Common Random Numbers. Oper. Res. 70(6): 3457-3472 (2022) - [c19]Federico Peralta, Michael Pearce, Matthias Poloczek, Daniel Gutiérrez-Reina, Sergio Toral, Jürgen Branke:
Multi-objective path planning for environmental monitoring using an autonomous surface vehicle. GECCO Companion 2022: 747-750 - [c18]Leonard Papenmeier, Luigi Nardi, Matthias Poloczek:
Increasing the Scope as You Learn: Adaptive Bayesian Optimization in Nested Subspaces. NeurIPS 2022 - 2021
- [c17]David Eriksson, Matthias Poloczek:
Scalable Constrained Bayesian Optimization. AISTATS 2021: 730-738 - 2020
- [i10]David Eriksson, Matthias Poloczek:
Scalable Constrained Bayesian Optimization. CoRR abs/2002.08526 (2020)
2010 – 2019
- 2019
- [c16]Tianchi Zhao, Ming Li, Matthias Poloczek:
Fast Reconfigurable Antenna State Selection with Hierarchical Thompson Sampling. ICC 2019: 1-6 - [c15]Amin Nayebi, Alexander Munteanu, Matthias Poloczek:
A Framework for Bayesian Optimization in Embedded Subspaces. ICML 2019: 4752-4761 - [c14]David Eriksson, Michael Pearce, Jacob R. Gardner, Ryan Turner, Matthias Poloczek:
Scalable Global Optimization via Local Bayesian Optimization. NeurIPS 2019: 5497-5508 - [c13]Michael Pearce, Matthias Poloczek, Jürgen Branke:
Bayesian Simulation Optimization with Common Random Numbers. WSC 2019: 3492-3503 - [i9]David Eriksson, Michael Pearce, Jacob R. Gardner, Ryan Turner, Matthias Poloczek:
Scalable Global Optimization via Local Bayesian Optimization. CoRR abs/1910.01739 (2019) - [i8]Yijia Wang, Matthias Poloczek, Daniel R. Jiang:
Exploration via Sample-Efficient Subgoal Design. CoRR abs/1910.09143 (2019) - [i7]Michael Pearce, Matthias Poloczek, Jürgen Branke:
Bayesian Optimization Allowing for Common Random Numbers. CoRR abs/1910.09259 (2019) - 2018
- [j6]Bert Besser, Matthias Poloczek:
Erratum to: Greedy Matching: Guarantees and Limitations. Algorithmica 80(1): 410-413 (2018) - [j5]Alice Paul, Matthias Poloczek, David P. Williamson:
Simple Approximation Algorithms for Balanced MAX 2SAT. Algorithmica 80(3): 995-1012 (2018) - [j4]Daniel Freund, Matthias Poloczek, Daniel Reichman:
Contagious sets in dense graphs. Eur. J. Comb. 68: 66-78 (2018) - [c12]Ricardo Baptista, Matthias Poloczek:
Bayesian Optimization of Combinatorial Structures. ICML 2018: 471-480 - [i6]Ricardo Baptista, Matthias Poloczek:
Bayesian Optimization of Combinatorial Structures. CoRR abs/1806.08838 (2018) - 2017
- [j3]Bert Besser, Matthias Poloczek:
Greedy Matching: Guarantees and Limitations. Algorithmica 77(1): 201-234 (2017) - [j2]Matthias Poloczek, David P. Williamson:
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem. ACM J. Exp. Algorithmics 22 (2017) - [j1]Matthias Poloczek, Georg Schnitger, David P. Williamson, Anke van Zuylen:
Greedy Algorithms for the Maximum Satisfiability Problem: Simple Algorithms and Inapproximability Bounds. SIAM J. Comput. 46(3): 1029-1061 (2017) - [c11]Matthias Poloczek, Jialei Wang, Peter I. Frazier:
Multi-Information Source Optimization. NIPS 2017: 4288-4298 - [c10]Jian Wu, Matthias Poloczek, Andrew Gordon Wilson, Peter I. Frazier:
Bayesian Optimization with Gradients. NIPS 2017: 5267-5278 - [c9]Naijia Anna Dong, David J. Eckman, Xueqi Zhao, Shane G. Henderson, Matthias Poloczek:
Empirically comparing the finite-time performance of simulation-optimization algorithms. WSC 2017: 2206-2217 - [i5]Jian Wu, Matthias Poloczek, Andrew Gordon Wilson, Peter I. Frazier:
Bayesian Optimization with Gradients. CoRR abs/1703.04389 (2017) - 2016
- [c8]Alice Paul, Matthias Poloczek, David P. Williamson:
Simple Approximation Algorithms for Balanced MAX 2SAT. LATIN 2016: 659-671 - [c7]Matthias Poloczek, David P. Williamson:
An Experimental Evaluation of Fast Approximation Algorithms for the Maximum Satisfiability Problem. SEA 2016: 246-261 - [c6]Matthias Poloczek, Jialei Wang, Peter I. Frazier:
Warm starting Bayesian optimization. WSC 2016: 770-781 - [i4]Matthias Poloczek, Jialei Wang, Peter I. Frazier:
Warm Starting Bayesian Optimization. CoRR abs/1608.03585 (2016) - 2015
- [c5]Daniel Freund, Matthias Poloczek, Daniel Reichman:
Contagious Sets in Dense Graphs. IWOCA 2015: 185-196 - [i3]Daniel Freund, Matthias Poloczek, Daniel Reichman:
Contagious Sets in Dense Graphs. CoRR abs/1503.00158 (2015) - [i2]Bert Besser, Matthias Poloczek:
Greedy Matching: Guarantees and Limitations. CoRR abs/1505.04198 (2015) - 2014
- [c4]Matthias Poloczek, David P. Williamson, Anke van Zuylen:
On Some Recent Approximation Algorithms for MAX SAT. LATIN 2014: 598-609 - 2013
- [i1]Matthias Poloczek, David P. Williamson, Anke van Zuylen:
On Some Recent MAX SAT Approximation Algorithms. CoRR abs/1308.3405 (2013) - 2012
- [b1]Matthias Poloczek:
Greedy algorithms for max sat and maximum matching: their power and limitations. Goethe University Frankfurt am Main, 2012, pp. 1-165 - [c3]Matthias Poloczek, Mario Szegedy:
Randomized Greedy Algorithms for the Maximum Matching Problem with New Analysis. FOCS 2012: 708-717 - 2011
- [c2]Matthias Poloczek:
Bounds on Greedy Algorithms for MAX SAT. ESA 2011: 37-48 - [c1]Matthias Poloczek, Georg Schnitger:
Randomized Variants of Johnson's Algorithm for MAX SAT. SODA 2011: 656-663
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-13 20:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
