16 articles tagged with #bayesian-optimization. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce PiEvo, a framework that enables AI scientific agents to autonomously evolve their underlying scientific principles rather than search within fixed hypothesis spaces. The system achieves 29.7-31.1% improvement in solution quality and 83.3% faster convergence by treating scientific discovery as Bayesian optimization over an expanding principle space.
Researchers prove that large language models fundamentally cannot perform causal discovery through standard training methods, establishing this limitation as intrinsic to supervised learning rather than a model-specific flaw. They propose Agentic Causal Bayesian Optimization (A-CBO), which bypasses this constraint by using frozen language models as query oracles within an external optimization loop, achieving superior performance on causal inference benchmarks.
AgentOpt v0.1, a new Python framework, addresses client-side optimization for AI agents by intelligently allocating models, tools, and API budgets across pipeline stages. Using search algorithms like Arm Elimination and Bayesian Optimization, the tool reduces evaluation costs by 24-67% while achieving near-optimal accuracy, with cost differences between model combinations reaching up to 32x at matched performance levels.
Researchers propose PIBO, a Permutation-Invariant Bayesian Optimization approach that leverages Optimal Transport theory to optimize offshore wind farm layouts. The method exploits the symmetry inherent in wind turbine placement problems where order doesn't matter, achieving superior layouts while reducing computation time by approximately 50% compared to standard Bayesian Optimization.
Researchers present graph-coupled causal Bayesian optimization, a method that improves expensive system optimization by sharing information across related interventions through a causal kernel. The approach demonstrates logarithmic information gains and cleanly separates optimization, causal estimation, and intervention selection errors, with strongest performance when direct interventions are unavailable.
Researchers propose a framework for incorporating Large Language Model (LLM) priors into multi-objective Bayesian optimization while maintaining robustness against miscalibrated advice. Using an objective-wise reputation mechanism and counterfactual gating, the approach dynamically adjusts trust in LLM suggestions based on observed performance rather than accepting them blindly, with empirical validation across molecular optimization tasks.
Researchers propose c-TPE, an enhanced Bayesian optimization method that extends the Tree-structured Parzen Estimator to handle inequality constraints in hyperparameter optimization. The method addresses practical real-world limitations like memory and latency constraints while maintaining strong performance, demonstrating superiority over existing approaches across 81 expensive optimization problems.
Researchers have conducted a comprehensive ablation study of Tree-Structured Parzen Estimator (TPE), a widely-used Bayesian optimization method, to clarify the role of each control parameter and improve its empirical performance. The study provides actionable recommendations for parameter tuning in machine learning frameworks like Hyperopt and Optuna, with implementations now available through OptunaHub.
Researchers propose a Bayesian Optimization framework that uses pre-trained Large Language Models to efficiently search for optimal LoRA (Low-Rank Adaptation) hyperparameters by encoding domain knowledge as natural language prompts. The method discovers high-performing configurations in ~30 iterations versus 45,000 combinations, achieving 20% performance improvements while significantly reducing computational costs.
This academic paper advances Bayesian multiobjective optimization by clarifying how preference transformations affect two key performance indicators—hypervolume and R2—used in algorithm design. The research provides exact computational methods and proves that R2 improvement, contrary to prior assumptions, cannot be directly computed as objective-space hypervolume but instead represents volume in scalarization space, enabling new algorithmic implementations.
Researchers introduce Generate-Select-Refine (GSR), a Bayesian optimization framework that dynamically discovers and refines tasks during scientific workflows rather than optimizing fixed objectives. The approach demonstrates superior performance across product development, chemical synthesis, algorithm analysis, and patent repurposing compared to existing LLM-based optimizers.
Researchers propose a novel Ensemble Distributionally Robust Bayesian Optimisation algorithm that addresses context distributional uncertainty in zeroth-order optimization. The method achieves sublinear regret bounds while remaining computationally tractable, improving upon existing state-of-the-art approaches.
Researchers introduce DT-PBO, a tree-based surrogate model for Preferential Bayesian Optimization that prioritizes interpretability over traditional Gaussian Process approaches. The method achieves competitive performance on benchmark functions while providing transparent insights into decision-maker preferences, addressing critical needs in high-stakes domains like healthcare.
Researchers introduce RALP, a novel method that uses chain-of-thought prompts with large language models to improve knowledge graph predictions, outperforming traditional embedding models by over 5% on standard benchmarks while better handling unseen entities, relations, and numerical data.
Researchers introduce EmoMAS, a Bayesian multi-agent framework that enables small language models to perform sophisticated negotiation by treating emotional intelligence as a strategic variable. The system coordinates game-theoretic, reinforcement learning, and psychological agents to optimize negotiation outcomes while maintaining privacy through edge deployment, demonstrating performance comparable to larger models across high-stakes domains.
Researchers developed ToSFiT (Thompson Sampling via Fine-Tuning), a new Bayesian optimization method that uses fine-tuned large language models to improve search efficiency in complex discrete spaces. The approach eliminates computational bottlenecks by directly parameterizing reward probabilities and demonstrates superior performance across diverse applications including protein search and quantum circuit design.
