AINeutralarXiv – CS AI · 3d ago7/10
🧠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.
AIBullisharXiv – CS AI · Apr 107/10
🧠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.
AIBullisharXiv – CS AI · 2d ago6/10
🧠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.
AINeutralarXiv – CS AI · 3d ago5/10
🧠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.
AINeutralarXiv – CS AI · May 116/10
🧠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.
AINeutralarXiv – CS AI · May 116/10
🧠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.
AINeutralarXiv – CS AI · May 116/10
🧠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.
$MKR
AIBullisharXiv – CS AI · Apr 156/10
🧠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.
AIBullisharXiv – CS AI · Apr 106/10
🧠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.
AIBullisharXiv – CS AI · Mar 27/1019
🧠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.
