A PAC Approach to Application-Specific Algorithm Selection
DOI10.1137/15M1050276zbMATH Open1371.68316OpenAlexW2625599877MaRDI QIDQ5269823FDOQ5269823
Authors: Rishi Gupta, Tim Roughgarden 
Publication date: 28 June 2017
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1050276
Recommendations
- A PAC approach to application-specific algorithm selection
- Learning Theory
- Dynamic algorithm selection for Pareto optimal set approximation
- scientific article; zbMATH DE number 5957329
- The use of classification theory for automated selection of algorithms in program packages
- An Algorithmic Theory of the Choice of Techniques
- Algorithm selection on a meta level
- Algorithm selection for combinatorial search problems: a survey
Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Analysis of algorithms and problem complexity (68Q25) General topics in the theory of algorithms (68W01)
Cites Work
- scientific article; zbMATH DE number 4051016 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 1830719 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6276119 (Why is no real title available?)
- (Incremental) priority algorithms
- A Bayesian approach to tackling hard computational problems. (Preliminary report)
- A note on greedy algorithms for the maximum weighted independent set problem
- Algorithm runtime prediction: methods \& evaluation
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- Empirical hardness models, methodology and a case study on combinatorial auctions
- Estimating the Efficiency of Backtrack Programs
- Learning Bounds for Support Vector Machines with Learned Kernels
- Local Search Heuristics for k-Median and Facility Location Problems
- Neural Network Learning
- Prediction, Learning, and Games
- SATzilla: portfolio-based algorithm selection for SAT
- Self-improving algorithms
- Self-improving algorithms for convex hulls
- Self-improving algorithms for coordinate-wise maxima
- Self-improving algorithms for delaunay triangulations
- The weighted majority algorithm
- Truth revelation in approximately efficient combinatorial auctions
Cited In (16)
- Title not available (Why is no real title available?)
- Algorithm portfolio selection as a bandit problem with unbounded losses
- How much data is sufficient to learn high-performing algorithms? generalization guarantees for data-driven algorithm design
- Learning dynamic algorithm portfolios
- Parameter selection of pocket extraction algorithm using interaction interface
- Modeling Decisions for Artificial Intelligence
- Learning-augmented algorithms for online subset sum
- Algorithm survival analysis
- Hybrid regression-classification models for algorithm selection
- Speeding up algorithm selection using average ranking and active testing by introducing runtime
- Data-driven algorithm selection and tuning in optimization and signal processing
- A PAC approach to application-specific algorithm selection
- Discovering optimization algorithms through automated learning
- Title not available (Why is no real title available?)
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- \textsc{Alors}: an algorithm recommender system
Uses Software
This page was built for publication: A PAC Approach to Application-Specific Algorithm Selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269823)
