A Bayesian Approach to Tackling Hard Computational Problems

10 January 2013

Papers citing "A Bayesian Approach to Tackling Hard Computational Problems"

24 / 24 papers shown

Title
From Medprompt to o1: Exploration of Run-Time Strategies for Medical Challenge Problems and Beyond Harsha Nori Naoto Usuyama Nicholas King S. McKinney Xavier Fernandes Sheng Zhang Eric Horvitz LRM LM&MA ELM VLM 55 9 0 06 Nov 2024
Arbitrarily Large Labelled Random Satisfiability Formulas for Machine Learning Training D. Achlioptas Amrit Daswaney Periklis A. Papakonstantinou NAI BDL 15 0 0 21 Nov 2022
What Can Transformers Learn In-Context? A Case Study of Simple Function Classes Shivam Garg Dimitris Tsipras Percy Liang Gregory Valiant 26 449 0 01 Aug 2022
Formalizing Preferences Over Runtime Distributions Devon R. Graham Kevin Leyton-Brown Tim Roughgarden 14 5 0 25 May 2022
Improved Sample Complexity Bounds for Branch-and-Cut Maria-Florina Balcan Siddharth Prasad T. Sandholm Ellen Vitercik 19 13 0 18 Nov 2021
Data-driven Algorithm Design Maria-Florina Balcan 6 2 0 14 Nov 2020
Refined bounds for algorithm configuration: The knife-edge of dual class approximability Maria-Florina Balcan T. Sandholm Ellen Vitercik 6 14 0 21 Jun 2020
How much data is sufficient to learn high-performing algorithms? Generalization guarantees for data-driven algorithm design Maria-Florina Balcan Dan F. DeBlasio Travis Dick Carl Kingsford T. Sandholm Ellen Vitercik 16 33 0 08 Aug 2019
Semi-bandit Optimization in the Dispersed Setting Maria-Florina Balcan Travis Dick W. Pegden 4 20 0 18 Apr 2019
Towards Accountable AI: Hybrid Human-Machine Analyses for Characterizing System Failure Besmira Nushi Ece Kamar Eric Horvitz 4 139 0 19 Sep 2018
$ML + FV = $\heartsuit$? A Survey on the Application of Machine Learning to Formal Verification$ ML + FV = $\heartsuit$ ? A Survey on the Application of Machine Learning to Formal Verification Moussa Amrani L. Lucio Adrien Bibal 28 5 0 10 Jun 2018
The Algorithm Selection Competitions 2015 and 2017 Marius Lindauer Jan N. van Rijn Lars Kotthoff 14 38 0 03 May 2018
A PAC Approach to Application-Specific Algorithm Selection Rishi Gupta Tim Roughgarden 23 116 0 23 Nov 2015
Metareasoning for Planning Under Uncertainty C. H. Lin Andrey Kolobov Ece Kamar Eric Horvitz OffRL LRM 18 34 0 03 May 2015
ParamILS: An Automatic Algorithm Configuration Framework Frank Hutter Thomas Stuetzle Kevin Leyton-Brown T. Stützle 29 1,066 0 15 Jan 2014
Relaxed Survey Propagation for The Weighted Maximum Satisfiability Problem Hai Leong Chieu Wee Sun Lee 28 54 0 15 Jan 2014
Algorithm Runtime Prediction: Methods & Evaluation Frank Hutter Lin Xu Holger H. Hoos Kevin Leyton-Brown 31 418 0 05 Nov 2012
Algorithm Selection for Combinatorial Search Problems: A Survey Lars Kotthoff 34 371 0 30 Oct 2012
SATzilla: Portfolio-based Algorithm Selection for SAT Lin Xu Frank Hutter Holger H. Hoos Kevin Leyton-Brown 53 969 0 31 Oct 2011
Solution-Guided Multi-Point Constructive Search for Job Shop Scheduling J. Christopher Beck 47 65 0 12 Oct 2011
Simple Algorithm Portfolio for SAT Mladen Nikolic Filip Marić Predrag Janičić 33 38 0 01 Jul 2011
Online Search Cost Estimation for SAT Solvers Shai Haim T. Walsh OffRL 60 1 0 29 Jul 2009
Online Estimation of SAT Solving Runtime Shai Haim T. Walsh OffRL 50 18 0 04 Mar 2009
Grammatical Evolution with Restarts for Fast Fractal Generation A. Inselberg Wil M.P. van der Aalst Vivying S. Y. Cheng 58 50 0 12 May 2008