SMAC

swMATH27215MaRDI QIDQ38933FDOQ38933

Author name not available (Why is that?)

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

Cited In (95)

• \textit{teaspoon}: solving the curriculum-based course timetabling problems with answer set programming
• Automatic model training under restrictive time constraints
• One-shot learning of stochastic differential equations with data adapted kernels
• 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
• OptiLog: a framework for SAT-based systems
• PyDGGA: distributed GGA for automatic configuration
• Multiobjective Tree-Structured Parzen Estimator
• Algorithm runtime prediction: methods \& evaluation
• Interactive model-based search for global optimization
• SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers
• Optimal observations-based retrieval of topography in 2D shallow water equations using PC-EnKF
• ASlib: a benchmark library for algorithm selection
• Neural Networks and Deep Learning
• Bilevel Optimization with Nonsmooth Lower Level Problems
• 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
• Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers
• 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
• aspeed: Solver scheduling via answer set programming
• 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
• Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
• Bayesian optimization with approximate set kernels
• MODES: model-based optimization on distributed embedded systems
• The voice of optimization
• Tuning BARON using derivative-free optimization algorithms
• Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimization
• Pitfalls and Best Practices in Algorithm Configuration
• CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability
• Imbalanced regression and extreme value prediction
• MultiETSC: automated machine learning for early time series classification
• On the impact of configuration on abstract argumentation automated reasoning
• Exploring variable neighborhood search for automatic algorithm configuration
• Automated adaptation strategies for stream learning
• The configurable SAT solver challenge (CSSC)
• 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
• Solving the general employee scheduling problem
• 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
• 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
• VPint: value propagation-based spatial interpolation
• Sequential Model-Based Parameter Optimization: an Experimental Investigation of Automated and Interactive Approaches
• Escaping local minima with local derivative-free methods: a numerical investigation
• High-dimensional Bayesian optimization with projections using quantile Gaussian processes
• An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems
• A hybrid algorithm for the drilling rig routing problem
• Benchmark and Survey of Automated Machine Learning Frameworks
• Gaussian Process-Based Dimension Reduction for Goal-Oriented Sequential Design
• Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges
• 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
• Automated porosity estimation using CT-scans of extracted core data
• Title not available (Why is that?)
• 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
• Model-based algorithm configuration with adaptive capping and prior distributions
• On the importance of domain model configuration for automated planning engines
• On the impact of the performance metric on efficient algorithm configuration
• A computational study on ant colony optimization for the traveling salesman problem with dynamic demands
• What is the value of the cross-sectional approach to deep reinforcement learning?
• SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers
• Soft computing methods for multiobjective location of garbage accumulation points in smart cities
• Capping methods for the automatic configuration of optimization algorithms
• 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
• The “One-fifth Rule” with Rollbacks for Self-Adjustment of the Population Size in the (1 + (λ,λ)) Genetic Algorithm
• Bayesian Estimation and Optimization for Learning Sequential Regularized Portfolios
• BO-B\&B: a hybrid algorithm based on Bayesian optimization and branch-and-bound for discrete network design problems
• Co-evolution-based parameter learning for remote sensing scene classification
• Reproducible Hyperparameter Optimization

This page was built for software: SMAC