# A PAC Approach to Application-Specific Algorithm Selection

## Abstract

### Keywords

### MSC codes

## Get full access to this article

View all available purchase options and get full access to this article.

## References

*Self-improving algorithms*, in Proceedings of the Symposium on Discrete Algorithms (SODA), 2006, pp. 261--270.

*Neural Network Learning: Theoretical Foundations*, Cambridge University Press, Cambridge, 1999.

*Local search heuristics for $k$-median and facility location problems*, SIAM J. Comput., 33 (2004), pp. 544--562.

*Random search for hyper-parameter optimization*, J. Mach. Learn. Res., 13 (2012), pp. 281--305.

*(Incremental) priority algorithms*, Algorithmica, 37 (2003), pp. 295--326.

*Convex optimization*, Cambridge University Press, Cambridge, 2004.

*The Budget and Economic Outlook*: 2015 to 2025, U. S. Congressional Budget Office, 2014.

*Prediction, Learning, and Games*, Cambridge University Press, Cambridge, 2006.

*Self-improving algorithms for convex hulls*, in Proceedings of the Symposium on Discrete Algorithms (SODA), 2010, pp. 1546--1565.

*Self-improving algorithms for coordinate-wise maxima*, in Proceedings of the Symposium on Computational Geometry (SoCG), 2012, pp. 277--286.

*Self-improving algorithms for Delaunay triangulations*, in Proceedings of the Symposium on Computational Geometry (SoCG), 2008, pp. 148--155.

*Lectures Notes on Bucket Algorithms*, Birkhäuser, Basel, 1986.

*How to solve it automatically: Selection among problem solving methods*, in Proceedings of the International Conference on Artificial Intelligence Planning Systems, 1998, pp. 128--136.

*Lectures Notes on Algebraic Geometry*, TU Kaiserslautern, 2014.

*Decision theoretic generalizations of the PAC model for neural net and other learning applications*, Inf. Comput., 100 (1992), pp. 78--150.

*A Bayesian approach to tackling hard computational problems*, in Proceedings of the Conference in Uncertainty in Artificial Intelligence (UAI), 2001, pp. 235--244.

*Predicting execution time of computer programs using sparse polynomial regression*, in Proceedings of Advances in Neural Information Processing Systems (NIPS), 2010, pp. 883--891.

*Algorithm runtime prediction: Methods & evaluation*, Artif. Intell., 206 (2014), pp. 79--111.

*Counting zeros of generalized polynomials: Descartesâ€™ rule of signs and Laguerreâ€™s extensions*, Math. Gaz., 90 (2006), pp. 223--234.

*The traveling salesman problem: A case study in local optimization*, in Local Search in Combinatorial Optimization, E. Aarts and J. K. Lenstra, eds., Wiley, New York, 1997, pp. 215--310. Reprinted by Princeton University Press, Princeton, 2003.

*Estimating the efficiency of backtrack programs*, Math. Comput., 29 (1975), pp. 121--136.

*An evaluation of machine learning in algorithm selection for search problems*, AI Commun., 25 (2012), pp. 257--270.

*Truth revelation in approximately efficient combinatorial auctions*, J. ACM, 49 (2002), pp. 577--602.

*Empirical hardness models: Methodology and a case study on combinatorial auctions*, J. ACM, 56 (2009).

*The weighted majority algorithm*, Inf. Comput., 108 (1994), pp. 212--261.

*Using the pseudo-dimension to analyze approximation algorithms for integer programming*, in Proceedings of the International Workshop on Algorithms and Data Structures (WADS), 2001, pp. 26--37.

*Deferred-acceptance auctions and radio spectrum reallocation*, in Proceedings of the Fifteenth ACM Conference on Economics and Computation, Palo Alto, CA, Association for Computing Machinery, 2014, pp. 185--186.

*Learning theory and algorithms for revenue optimization in second price auctions with reserve*, in Proceedings of the International Conference on Machine Learning (ICML), 2014, pp. 262--270.

*The pseudo-dimension of near-optimal auctions*, in Proceedings of Advances in Neural Information Processing Systems, 2015, pp. 136--144.

*A note on greedy algorithms for the maximum weighted independent set problem*, Discrete Appl. Math., 126 (2003), pp. 313--322.

*Smoothed analysis: an attempt to explain the behavior of algorithms in practice*, Commun. ACM, 52 (2009), pp. 76--84.

*Learning bounds for support vector machines with learned kernels*, in Proceedings of the 19th Annual Conference on Learning Theory, 2006, pp. 169--183.

*SATzilla: Portfolio-based algorithm selection for SAT*, J. Artif. Intell. Res., 32 (2008), pp. 565--606.

*Hydra-MIP: Automated algorithm configuration and selection for mixed integer programming*, in Proceedings of the RCRA Workshop on Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI), 2011, pp. 16--30.

*SATzilla*2012:

*Improved algorithm selection based on cost-sensitive classification models*, in Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT), 2012.

## Information & Authors

### Information

#### Published In

#### Copyright

#### History

**Submitted**: 30 November 2015

**Accepted**: 25 January 2017

**Published online**: 13 June 2017

#### Keywords

#### MSC codes

### Authors

#### Funding Information

## Metrics & Citations

### Metrics

### Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

#### Cited By

- Learning a Provably Good Wirelength Model for Analytical Placement2023 International Symposium of Electronics Design Automation (ISEDA) | 8 May 2023
- Learning-augmented algorithms for online subset sumJournal of Global Optimization, Vol. 68 | 13 April 2022
- On Computational Complexity of Transfer Learning Approaches in Facial AnalysisComputational Intelligence in Data Mining | 7 May 2022
- Data-driven algorithm selection and tuning in optimization and signal processingAnnals of Mathematics and Artificial Intelligence, Vol. 89, No. 7 | 12 November 2020
- How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm designProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing | 15 June 2021
- Structured Sparsity of Convolutional Neural Networks via Nonconvex Sparse Group RegularizationFrontiers in Applied Mathematics and Statistics, Vol. 6 | 24 February 2021
- Pandora's Box with Correlations: Learning and Approximation2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS) | 1 Nov 2020
- OFM: An Online Fisher Market for Cloud ComputingIEEE INFOCOM 2019 - IEEE Conference on Computer Communications | 1 Apr 2019
- Beyond worst-case analysisCommunications of the ACM, Vol. 62, No. 3 | 21 February 2019
- Dispersion for Data-Driven Algorithm Design, Online Learning, and Private Optimization2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) | 1 Oct 2018