SMAC

swMATH27215MaRDI QIDQ38933FDOQ38933

Author name not available (Why is that?)

Official website: http://www.cs.ubc.ca/labs/beta/Projects/SMAC/

Source code repository: https://github.com/automl/SMAC3

Cited In (only showing first 100 items - show all)

• Pitfalls and best practices in algorithm configuration
• Hyperband: a novel bandit-based approach to hyperparameter optimization
• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
• SATenstein: automatically building local search SAT solvers from components
• MaxSAT by improved instance-specific algorithm configuration
• Exact stochastic constraint optimisation with applications in network analysis
• Multiobjective Tree-Structured Parzen Estimator
• Synthesis of domain specific CNF encoders for bit-vector solvers
• Algorithm runtime prediction: methods \& evaluation
• Interactive model-based search for global optimization
• ASlib: a benchmark library for algorithm selection
• Revisiting simulated annealing: a component-based analysis
• Portfolio theorem proving and prover runtime prediction for geometry
• Automatic model selection for high-dimensional survival analysis
• Bayesian optimization of pump operations in water distribution systems
• Effect of transformations of numerical parameters in automatic algorithm configuration
• Expected improvement for expensive optimization: a review
• Generating SAT instances with community structure
• On the choice of the low-dimensional domain for global optimization via random embeddings
• Dataset2Vec: learning dataset meta-features
• Gradient-based Regularization Parameter Selection for Problems With Nonsmooth Penalty Functions
• A novel hybrid PSO-based metaheuristic for costly portfolio selection problems
• HEBO: An Empirical Study of Assumptions in Bayesian Optimisation
• Title not available (Why is that?)
• New local search methods for partial MaxSAT
• Real-time solving of computationally hard problems using optimal algorithm portfolios
• Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds
• March_eq
• SAT competition
• OpenML
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
• satUZK
• FeatureIDE
• CoQuiAAS
• AClib
• MLaut
• BOCK
• Nevergrad
• SUNNY
• GPflowOpt
• AutoKeras
• RoBO
• Bayesian optimization with approximate set kernels
• The voice of optimization
• CCLS
• Tuning BARON using derivative-free optimization algorithms
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• Imbalanced regression and extreme value prediction
• On the impact of configuration on abstract argumentation automated reasoning
• Exploring variable neighborhood search for automatic algorithm configuration
• Automated adaptation strategies for stream learning
• ACVIZ
• CAPOPT
• HHBQP
• PyPBLib
• The configurable SAT solver challenge (CSSC)
• Tunability
• Bayesian Optimization with Expensive Integrands
• ML-plan: automated machine learning via hierarchical planning
• \textsc{Alors}: an algorithm recommender system
• Automatic construction of parallel portfolios via algorithm configuration
• Automatically improving the anytime behaviour of optimisation algorithms
• Automatic design of hybrid stochastic local search algorithms for permutation flowshop problems
• A local search framework for industrial test laboratory scheduling
• Bilevel optimization with nonsmooth lower level problems
• Efficient benchmarking of algorithm configurators via model-based surrogates
• Metalearning and algorithm selection: progress, state of the art and introduction to the 2018 special issue
• Scalable Gaussian process-based transfer surrogates for hyperparameter optimization
• Hyperband
• aspeed: solver scheduling via answer set programming
• SpyBug: automated bug detection in the configuration space of SAT solvers
• Betty
• PyDGGA
• Escaping local minima with local derivative-free methods: a numerical investigation
• High-dimensional Bayesian optimization with projections using quantile Gaussian processes
• Automatic model training under restrictive time constraints
• One-shot learning of stochastic differential equations with data adapted kernels
• A hybrid algorithm for the drilling rig routing problem
• OptiLog: a framework for SAT-based systems
• PyDGGA: distributed GGA for automatic configuration
• AutoDiagnosis: automatic data-driven configuration of an automotive fault diagnosis algorithm using noisy two-stage optimization
• Improving variable orderings of approximate decision diagrams using reinforcement learning
• Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF
• The algorithm selection competitions 2015 and 2017
• On black-box optimization in divide-and-conquer SAT solving
• Combining Bayesian optimization and Lipschitz optimization
• Output-Weighted Optimal Sampling for Bayesian Experimental Design and Uncertainty Quantification
• High-dimensional Bayesian optimization using low-dimensional feature spaces
• Benchmark and survey of automated machine learning frameworks
• Automated porosity estimation using CT-scans of extracted core data
• NetPyNE
• Title not available (Why is that?)
• An experimental comparison of algebraic crossover operators for permutation problems
• Why CP portfolio solvers are (under)utilized? Issues and challenges
• IMLI
• Analysis of the Impact of Randomization of Search-Control Parameters in Monte-Carlo Tree Search
• A deep learning model to predict the failure response of steel pipes under pitting corrosion
• Title not available (Why is that?)
• Exact and meta-heuristic approaches for the production leveling problem
• Boosting evolutionary algorithm configuration

This page was built for software: SMAC