Approaches to learning Bayesian networks from data typically combine a scoring function with a heuristic search procedure. Given a Bayesian network structure, many of the scoring functions derived in the literature return a score for the entire equivalence class to which the structure belongs. When using such a scoring…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,742 papers · 148 categories
Trend · papers per month
48 results for “Bayesian search”
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.
Bayesian optimization improves multi-start global optimization.
problem Global optimization challenges in real-world applications.
method Bayesian optimization framework to determine local search starting points.
result Bayesian optimization enhances the efficiency of multi-start local searches.
Bayesian optimisation algorithm for unknown search spaces with sub-linear regret.
problem Efficient optimisation of expensive black-box functions in unknown search spaces.
method Expands search space over iterations based on a hyperharmonic series, scales to high dimensions.
result Sub-linear regret growth for both algorithms.
Bayesian approach for policy search in stochastic domains.
problem Policy search in stochastic domains.
method Nested probabilistic programs, Lightweight Metropolis-Hastings (LMH) adaptation.
result Similar quality policies learned with simpler algorithm.
A hybrid model for Bayesian optimization handles mixed variables using MCTS for categorical and GP for continuous.
problem Optimizing functions with mixed variable types (continuous, integer, categorical).
method Merges MCTS for categorical and GP for continuous variables, integrates UCTS search strategy, and dynamically selects kernels.
result Hybrid models outperform traditional methods in Bayesian optimization.
Bayesian optimization tackles unknown search spaces with automatic expansion.
problem Bayesian optimization in unknown search spaces is challenging.
method Proposes a systematic volume expansion strategy to find points close to the objective function maximum without specifying parameters.
result Derives analytic expressions for expansion triggers and sizes, achieving epsilon-accuracy after a finite number of iterations.
Bayesian optimization is an effective method to efficiently optimize unknown objective functions with high evaluation costs. Traditional Bayesian optimization algorithms select one point per iteration for single objective function, whereas in recent years, Bayesian optimization for multi-objective optimization or multi…
Efficiently searches through Gaussian process kernels using symbolic representation and Bayesian optimization.
problem Manual selection of kernels in Gaussian processes is complex and computationally expensive.
method Proposes a novel method using symbolic representation and Bayesian optimization to search through a structured kernel space.
result Empirically shows a computationally more efficient way of searching through a discrete kernel space.
Bayesian optimization with Gaussian processes speeds up searches for stationary points.
problem Accelerating searches for stationary points on potential energy surfaces.
method Unified Bayesian optimization view using Gaussian process regression with derivative observations, inverse-distance kernels, and active learning.
result Surrogates can reduce the number of expensive electronic structure evaluations by an order of magnitude.
Bayesian optimisation tackles high-dimensional categorical and mixed search spaces.
problem Bayesian optimisation on high-dimensional categorical and mixed search spaces is challenging.
method Combining local optimisation with a tailored kernel design.
result Empirically outperforms current baselines in performance and computational costs.
VES-Gamma adapts EI using information-theoretic principles.
problem Optimizing black-box functions using Bayesian optimization.
method Variational Entropy Search (VES) and VES-Gamma algorithm.
result VES-Gamma improves EI by incorporating information-theoretic concepts.
Recently several researchers have investigated techniques for using data to learn Bayesian networks containing compact representations for the conditional probability distributions (CPDs) stored at each node. The majority of this work has concentrated on using decision-tree representations for the CPDs. In addition, re…
Interpretable Neural Architecture Search via Bayesian Optimisation with Weisfeiler-Lehman Kernelscs.LG
Bayesian optimisation with graph kernels improves neural architecture search and provides interpretability.
problem Lack of insight into why architectures perform well and how to improve them.
method Combines Bayesian optimisation with Weisfeiler-Lehman graph kernels for highly data-efficient and interpretable architecture search.
result Demonstrates state-of-the-art performance on closed- and open-domain search spaces.
Bayesian optimization improves Monte-Carlo tree search for better state value estimation.
problem Slow convergence in Monte-Carlo tree search due to averaging in backpropagation.
method Softmax MCTS and Monotone MCTS, using Bayesian optimization with Gaussian process prior.
result Our framework outperforms previous methods in computer Go.
Bayesian optimization offers a flexible framework to optimize an objective function that is expensive to be evaluated. A Bayesian optimizer iteratively queries the function values on its carefully selected points. Subsequently, it makes a sensible recommendation about where the optimum locates based on its accumulated …
High-dimensional near-optimal experiment design for drug discovery via Bayesian sparse samplingcs.LG
Bayesian methods improve drug discovery experiment design.
problem Optimizing drug screening experiments in high-dimensional data.
method Bayesian inference and optimisation with upper confidence bound algorithms, Thompson sampling, and sparse tree search.
result Sparse tree search techniques outperform other methods in drug toxicity screening.
A new framework generates large hierarchical search spaces for neural architectures.
problem Discovering neural architectures from simple blocks is hard.
method Context-free grammars for a unified, scalable search space.
result Efficiently searches over complete architectures, outperforming existing methods.
LES optimizes designs by sampling descent sequences, achieving strong sample efficiency.
problem Optimizing large, complex design spaces is infeasible and unnecessary.
method LES uses Bayesian optimization to target solutions reachable by iterative optimizers.
result LES achieves strong sample efficiency compared to existing 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.
RES improves robustness in Bayesian optimization.
problem Finding robust solutions in Bayesian optimization with adversarial perturbations.
method Robust Entropy Search (RES) acquisition function.
result RES reliably finds robust optima, outperforming state-of-the-art algorithms.
The notion of expense in Bayesian optimisation generally refers to the uniformly expensive cost of function evaluations over the whole search space. However, in some scenarios, the cost of evaluation for black-box objective functions is non-uniform since different inputs from search space may incur different costs for …
Entropy Search (ES) and Predictive Entropy Search (PES) are popular and empirically successful Bayesian Optimization techniques. Both rely on a compelling information-theoretic motivation, and maximize the information gained about the of the unknown function; yet, both are plagued by the expensive computatio…
Bayesian optimization (BO) is an effective method of finding the global optima of black-box functions. Recently BO has been applied to neural architecture search and shows better performance than pure evolutionary strategies. All these methods adopt Gaussian processes (GPs) as surrogate function, with the handcraft sim…
BiDAG R package learns and samples Bayesian network structures efficiently.
problem Efficiently learning and sampling Bayesian network structures.
method Hybrid approach combining PC algorithm, iterative order MCMC, and partition MCMC.
result BiDAG can handle both discrete and continuous data.
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 …
A new method for Bayesian optimization uses Voronoi tessellation candidates to reduce search time.
problem Efficiently optimizing black-box functions with minimal overhead.
method Using Voronoi tessellation candidates for continuous optimization of acquisition functions.
result Significantly improved execution time with no loss in accuracy.
Finding an optimal parameter of a black-box function is important for searching stable material structures and finding optimal neural network structures, and Bayesian optimization algorithms are widely used for the purpose. However, most of existing Bayesian optimization algorithms can only handle vector data and canno…
HMCNAS generates competitive neural architectures without human-defined parameters.
problem Lack of human-defined parameters in Neural Architecture Search.
method Combines Hidden Markov Chains and Bayesian Optimization for autonomous search space generation and competitive model generation.
result HMCNAS generates competitive models in a short time without human-defined parameters.
The search space of Bayesian Network structures is usually defined as Acyclic Directed Graphs (DAGs) and the search is done by local transformations of DAGs. But the space of Bayesian Networks is ordered by DAG Markov model inclusion and it is natural to consider that a good search policy should take this into account.…
JES optimizes expensive functions by considering joint entropy over input and output spaces.
problem Optimizing expensive functions with limited evaluations.
method Joint Entropy Search (JES) considers joint entropy over input and output spaces.
result JES outperforms other information-theoretic methods in Bayesian optimization.
A major challenge in Bayesian Optimization is the boundary issue (Swersky, 2017) where an algorithm spends too many evaluations near the boundary of its search space. In this paper, we propose BOCK, Bayesian Optimization with Cylindrical Kernels, whose basic idea is to transform the ball geometry of the search space us…
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.
GIBBON unifies Bayesian optimization for various problem types.
problem Bayesian optimization across noisy, multi-fidelity, and batch optimisations.
method Novel approximation of information gain for a single framework.
result Significantly lower computational overhead compared to existing approaches.
LLA shows strong performance in Bayesian optimization but has unbounded search space issues.
problem Applying LLA in unbounded search spaces for Bayesian optimization.
method Linearized-Laplace approximation applied to Bayesian optimization problems.
result LLA demonstrates strong performance but also presents unbounded search space challenges.
Bayesian optimization improves policy search in reinforcement learning.
problem Finding optimal policies with high variance estimates from random samples.
method Develops an algorithm combining Bayesian optimization and policy gradients.
result Improves sample complexity and reduces variance in empirical evaluations.
Local PBO methods improve preferential BO in high-dimensional problems.
problem Efficiently optimizing preferential BO in high-dimensional settings.
method Adapting high-dimensional BO techniques to preferential feedback.
result Local PBO methods reduce cumulative regret compared to global baselines.
R package abn fits Bayesian models to observational data.
problem Analyzing complex observational datasets with Bayesian networks.
method Bayesian and information theoretic scoring, exact and greedy search algorithms.
result Effective modeling of mixed data types and prior knowledge integration.
Contextual policy search allows adapting robotic movement primitives to different situations. For instance, a locomotion primitive might be adapted to different terrain inclinations or desired walking speeds. Such an adaptation is often achievable by modifying a small number of hyperparameters. However, learning, when …
This work proposes searching for optimal operation distribution in neural architecture search.
problem Finding optimal neural architecture with specific operations and connections.
method Search for the optimal operation distribution, providing a stochastic and approximate solution.
result Operation distribution holds enough discriminating power to reliably identify a solution and is easier to optimise than traditional encodings.
BOP-Elites uses Bayesian Optimisation for QD search, improving efficiency and insight.
problem Finding diverse high-performing points from an objective function.
method Bayesian Optimisation and Gaussian Processes to model quality and diversity.
result Significantly more sample efficient and better at identifying niche solutions.
BANANAS uses Bayesian optimization with neural predictors to improve neural architecture search.
problem Improving neural architecture search (NAS) performance.
method BANANAS combines Bayesian optimization with neural predictors, focusing on architecture encoding, predictor, uncertainty calibration, acquisition function, and optimization strategy.
result BANANAS achieves state-of-the-art performance on NAS search spaces.
Improves BN graph learning with splines for scalability.
problem Learning accurate BN graph structures from data.
method Score-and-search approach with MARS for CPD modeling.
result Improves BN graph accuracy and scalability.
Raiders of the Lost Architecture: Kernels for Bayesian Optimization in Conditional Parameter Spacesstat.ML
In practical Bayesian optimization, we must often search over structures with differing numbers of parameters. For instance, we may wish to search over neural network architectures with an unknown number of layers. To relate performance data gathered for different architectures, we define a new kernel for conditional p…
BO limits search to lower dimensions with LGPR, improving efficiency and accuracy.
problem High computational costs in BO for high-dimensional optimization.
method Limits search region to lower dimensions and uses LGPR for local Gaussian process regression.
result Search efficiencies improved by about 69% and 40% for Ackley and Rosenbrock functions.
Asynchronous method for hyperparameter and neural architecture search.
problem Efficiently searching for optimal hyperparameters and neural architectures.
method Model-based, asynchronous multi-fidelity method combining Hyperband and Gaussian process-based Bayesian optimization.
result Substantial speed-ups over current state-of-the-art methods on various benchmarks.
Unified framework connects EI and information-theoretic acquisition functions.
problem Distinguish between Expected Improvement and information-theoretic acquisition functions.
method Introduces Variational Entropy Search (VES) to unify EI and information-theoretic approaches.
result EI can be seen as a variational inference approximation of Max-value Entropy Search (MES).
Differentially private hyperparameter tuning improves privacy in machine learning.
problem Hyperparameter tuning leaks private information through selected configurations.
method Local Bayesian optimization using Gaussian Process surrogate for private gradient approximation.
result DP-GIBO converges to locally optimal hyperparameters with polynomial dimensional dependence.