CrossBeam learns to search more efficiently in program synthesis.
problem Efficiently searching through vast program spaces.
method Trains a neural model to guide program synthesis, combining previously explored programs.
result CrossBeam explores much smaller portions of the program space compared to state-of-the-art methods.
Novelty search in low-dimensional space improves sample efficiency in exploration tasks.
problem Efficient exploration in complex environments with sparse rewards.
method Combines model-based and model-free objectives to learn a low-dimensional representation. Uses intrinsic novelty rewards based on nearest neighbor distances in this space.
result Our approach achieves more sample-efficient exploration compared to strong baselines on various tasks.
New approach learns walk and trot gaits from simulated quadruped using strategic exploration.
problem Learning symmetric gaits (walk and trot) from high-dimensional action spaces.
method Introduced symmetry properties into initial covariance of Gaussian search distribution for strategic exploration. Used episode-based likelihood ratio policy gradient and relative entropy policy search.
result Significant performance enhancement in learning walk and trot gaits compared to random gaits.
AMEIR automates recommender system design using NAS.
problem Manual feature and architecture engineering in recommender systems.
method Three-stage search space and tailored three-step pipeline.
result AMEIR outperforms manual and complex NAS methods.
Bayesian search optimizes exploration of feasible solutions under expensive constraints.
problem Identifying feasible solutions in computationally expensive constraint spaces.
method Bayesian models with an acquisition function for efficient exploration and exploitation.
result The proposed acquisition function improves the prediction of feasibility.
Improves neural network search in combinatorial spaces of mathematical symbols.
problem Early commitment and initialization bias limit exploration in neural network search.
method Entropy regularization and distribution initialization methods.
result Improves performance, increases sample efficiency, lowers solution complexity.
Bonsai-Net efficiently discovers state-of-the-art models with fewer parameters.
problem Efficiently discovering state-of-the-art neural architectures with minimal computational expense.
method Bonsai-Net uses a modified differential pruner to explore a relaxed search space.
result Bonsai-Net consistently discovers better architectures than random search with fewer parameters.
Novelty search learns attentional layers to quickly explore and guess numbers.
problem Exploring and guessing numbers quickly in structured spaces.
method Attentional neural network layers trained on supervised learning of local sensory-motor contingencies.
result Greedy local policies can quickly explore structured spaces and guess numbers.
New agent learns from previous search spaces to improve NAS efficiency.
problem NAS requires restarting learning from scratch between different search spaces.
method Transformer-based agent for joint training and knowledge transfer.
result Efficient knowledge transfer between search spaces improves NAS performance.
A heuristic method refines search space for Bayesian optimization with low budget.
problem Efficiently optimize objective function with limited evaluation budget.
method Divide search space into promising regions to refine Bayesian optimization.
result Bayesian optimization with proposed method outperforms standard Bayesian optimization.
AgABC improves ABC algorithm by balancing exploration and exploitation.
problem Balancing global and local search abilities in ABC algorithm.
method Divide population into groups and assign different search strategies to members.
result Proposed AgABC algorithm outperforms other algorithms in accuracy and stability.
NPENAS improves neural architecture search efficiency and accuracy.
problem Efficient and accurate neural architecture search (NAS) for minimizing search costs.
method Proposes NPENAS, a neural predictor guided evolutionary algorithm that enhances exploration ability of evolutionary algorithms.
result NPENAS-BO and NPENAS-NP outperform existing NAS algorithms on NASBench-201, NASBench-101, and DARTS.
A new framework scales active search for large datasets.
problem Scaling active search for large, high-dimensional data sets.
method Hierarchical Batch Bandit Search (HBBS) framework.
result HBBS improves performance and scalability for batch search.
ACE improves GFlowNet exploration efficiency by balancing complementary search strategies.
problem Efficient exploration of diverse high-probability regions in GFlowNets.
method Adaptive Complementary Exploration (ACE) trains a separate GFlowNet to search underexplored regions.
result Significantly improves approximation accuracy and diverse state discovery.
Bayesian model-based reinforcement learning is a formally elegant approach to learning optimal behaviour under model uncertainty, trading off exploration and exploitation in an ideal way. Unfortunately, finding the resulting Bayes-optimal policies is notoriously taxing, since the search space becomes enormous. In this …
NAS-Navigator automates neural network architecture search with visual steering.
problem Difficulty in configuring large neural networks efficiently.
method Formulates architecture optimization as graph space exploration, trains all candidate architectures in one-shot.
result Allows analysts to effectively select and guide the search for optimal neural network architectures.
MNMS learns from previous tasks to speed up model search for new tasks.
problem NAS requires extensive manual design and optimization for each new task.
method MNMS uses reinforcement learning to condition model construction on previously successful searches.
result MNMS can conduct simultaneous searches for multiple tasks and transfer knowledge to new tasks.
Guided Evolution improves NAS efficiency and accuracy.
problem NAS methods converge to local minima and are complex.
method G-EA: guided evolutionary approach with initialization evaluation and continuous knowledge extraction.
result G-EA achieves state-of-the-art results in CIFAR-10, CIFAR-100, and ImageNet16-120.
A new algorithm solves sparse reward tasks efficiently in robotics.
problem Sparse or misleading rewards in reinforcement learning.
method Multi-objective model-based policy optimization with three objectives.
result Multi-DEX solves sparse reward scenarios in fewer episodes than existing methods.
DrNAS improves neural architecture search with Dirichlet distribution and progressive learning.
problem Efficiently search for neural architectures with improved generalization and exploration.
method Formulates architecture search as a distribution learning problem using Dirichlet distribution and gradient-based optimization. Introduces a progressive learning scheme to handle large-scale tasks.
result Achieves state-of-the-art results on CIFAR-10 and ImageNet, demonstrating improved generalization and exploration.
Local search improves GFlowNets' ability to generate high-reward samples.
problem GFlowNets struggle with over-exploration in high-reward space.
method Local search focusing on high-reward samples via backtracking and reconstruction.
result Significant performance improvement in biochemical tasks.
Ansor generates high-performance tensor programs for deep learning.
problem Generating high-performance tensor programs for deep learning on various hardware platforms is challenging.
method Ansor uses a hierarchical representation of the search space, sampling programs, and evolutionary search with a learned cost model to find high-performance programs.
result Ansor improves deep neural network execution performance up to 3.8x on Intel CPU, 2.6x on ARM CPU, and 1.7x on NVIDIA GPU.
FiGS searches over a larger space of architectures for efficient mobile models.
problem Designing small, efficient deep networks for mobile devices.
method Differentiable search method using sparse regularization and Logistic-Sigmoid distribution.
result FiGS produces state-of-the-art parameter-efficient models on ImageNet and improves object detection performance.
Addressing the issue of SVMs parameters optimization, this study proposes an efficient memetic algorithm based on Particle Swarm Optimization algorithm (PSO) and Pattern Search (PS). In the proposed memetic algorithm, PSO is responsible for exploration of the search space and the detection of the potential regions with…
Novel method for learning Gaussian graphical models from paired data.
problem Learning Gaussian graphical models for dependent groups.
method Introducing twin order to explore the search space more efficiently.
result The twin order makes the model space a distributive lattice, leading to more efficient model exploration.
Paper improves full-text search engines for fast exact NNS in binary codes.
problem Efficient nearest neighbor search in Hamming space for full-text search engines.
method Revisits and combines three techniques from information retrieval: bit operation, subs-code filtering, and data preprocessing with permutation.
result Significant speed-ups for NNS in binary codes over state-of-the-art term match approach.
Scientific discovery is limited by hypothesis redundancy, and hybrid methods can exploit non-local exploration.
problem Limitation of scientific discovery due to hypothesis redundancy.
method Hybrid discovery systems combining structured local search with LLM-generated non-local proposals.
result Hybrid methods can exploit non-local exploration when three geometric conditions co-occur.
The problem of optimizing unknown costly-to-evaluate functions has been studied for a long time in the context of Bayesian Optimization. Algorithms in this field aim to find the optimizer of the function by asking only a few function evaluations at locations carefully selected based on a posterior model. In this paper,…
Study improves policy search in continuous control by using heavy-tailed distributions.
problem Challenges in continuous space policy search due to non-convexity and myopic-farsighted incentives.
method Introduced heavy-tailed policy parameterizations and analyzed convergence rates and stability.
result Convergence rate to stationarity depends on policy's tail index and exploration tolerance.
Evo-NAS combines neural and evolutionary methods for efficient neural architecture search.
problem Efficiently searching for optimal neural architectures in deep learning.
method Evolutionary-Neural hybrid agents that combine the strengths of neural and evolutionary algorithms.
result Evo-NAS outperforms both neural and evolutionary agents in architecture search for various classification tasks.
PDTS accelerates chemical space exploration using parallel and distributed Thompson sampling.
problem Large chemical space makes brute force searches infeasible; high-throughput screening is needed but current BO methods cannot scale.
method Parallel and distributed Thompson sampling (PDTS) for scalable Bayesian optimization.
result PDTS outperforms other scalable methods in large-scale parallel BO.
Expanding search in ML space for reliable solutions.
problem Finding reliable ML solutions within given constraints.
method Experimentation and synthesis independent of algorithmic innovation.
result Supporting empirical ML requires focusing on data and deployment aspects.
Quality-Diversity algorithms explore multiple high-performing solutions in a search space.
problem Finding multiple high-performing solutions in complex optimization problems.
method Evolutionary computation approach focusing on behavioral space and holistic solution distribution.
result Quality-Diversity algorithms provide a comprehensive view of high-performing solutions in a search space.
Paper optimizes GEMM for deep learning models, improving performance.
problem Limited GEMM optimization in deep learning frameworks restricts performance on different hardware.
method Proposes two novel algorithms: Greedy Best First Search (G-BFS) and Neighborhood Actor Advantage Critic (N-A2C) based on TVM framework.
result Significant performance improvements in GEMM computation time, achieving up to 40% savings.
Scalable NAS by factorizing operators into subspaces.
problem Scaling up NAS search space while avoiding operator competition.
method Factorizing a large set of candidate operators into smaller subspaces.
result Achieved state-of-the-art performance on CIFAR10 and ImageNet.
NASIB adapts NAS to varying computation resources efficiently.
problem Constrained computation resources in enterprise environments.
method Adapts exploration vs. exploitation trade-off and uses Superkernels.
result Searches over a larger space with similar accuracy in less time.
A method to reduce boundary over-exploration in Bayesian optimization.
problem Over-exploration of the boundary in Bayesian optimization.
method Virtual derivative sign observations at the boundary of the search space.
result Consistently reduces the number of evaluations required to optimize the objective.
Algorithm learns to prune search space for repeated computations.
problem Exploit common structure in repeated similar problems.
method Exploit explore-exploit technique for pruning search space.
result Reduces runtime while provably outputting correct solutions.
Optimal regret achieved in stochastic, discrete multi-armed bandits using information-theoretic exploration.
problem Optimal exploration vs. exploitation in stochastic, discrete multi-armed bandits.
method Proposes an information-theoretic strategy based on the value of information criterion, using simulated-annealing-like updates of a parameter.
result Achieves logarithmic optimal regret with respect to the number of episodes.
Greedy AutoAugment improves accuracy with less computation.
problem Finding effective data augmentation policies to cover the search space.
method Greedy approach to reduce the number of trials from exponential to linear growth.
result Greedy AutoAugment increases accuracy by 360 times with fewer resources.
Improves diffusion model performance and efficiency through classical search.
problem Tackles inference-time control in diffusion models.
method Proposes a framework combining local and global search for efficient navigation.
result Significant gains in performance and efficiency across various domains.
Inference Trees adaptively sample to balance exploration and exploitation.
problem Balancing exploration and exploitation in adaptive inference methods.
method Inference Trees use hierarchical partitions and online learning to adaptively sample.
result ITs identify high posterior mass regions and maintain uncertainty estimates.
A new search system helps recall faces with probabilistic methods.
problem Challenging face recall due to large and unstructured search space.
method Probabilistic evolutionary approach using skew-normal distribution.
result Greater granularity, regularized, and realistic results in face recall.
Efficient neural architecture search discovers top-performing models.
problem Finding optimal neural architectures efficiently.
method Hierarchical genetic representation and expressive search space.
result Discovered architectures outperform manually designed models.
Develops an SSBO algorithm for global optimization of expensive models.
problem Global optimization of expensive black-box models.
method Asynchronous hybrid-criterion with interval reduction.
result Improves global search ability and local search efficiency.
This work learns latent representations to speed up exploration in complex environments.
problem Challenging exploration in high-dimensional state and action spaces with sparse rewards.
method Representation learning using prior experience to learn effective latent representations.
result Learned latent representations reduce the dimensionality of the search space for effective exploration.
NEXT learns efficient paths in high dimensions using neural exploration-exploitation trees.
problem Learning efficient path planning in high-dimensional spaces.
method Neural Exploration-Exploitation Trees (NEXT) integrating neural architecture and UCB algorithm.
result NEXT achieves better sample efficiency and outperforms state-of-the-art methods.
New method combines heuristics and search techniques to speed up cooperative planning for autonomous vehicles.
problem Efficient cooperative planning for autonomous vehicles in complex traffic scenarios.
method Combining learned heuristics with Monte Carlo Tree Search (MCTS) to guide search towards promising actions.
result Better solutions at lower computational costs achieved through accelerated planning.