AINeutralarXiv – CS AI · Jun 47/10
🧠Researchers introduce R-APS (Reflective Adversarial Pareto Search), a novel method that enhances large language model reasoning for constrained design tasks by decomposing reasoning modes into separate contexts and orchestrating them across multiple timescales. The approach delivers 3.5x tighter robustness guarantees and 46% faster convergence on mechanical design problems without requiring model fine-tuning.
AIBullisharXiv – CS AI · May 297/10
🧠ProtoMedAgent introduces a framework that combines interpretable prototype networks with privacy-aware AI workflows to generate clinically accurate medical reports without the hallucination issues common in standard RAG systems. The approach achieves 91.2% faithfulness in clinical documentation while protecting patient privacy through k-anonymity and ℓ-diversity constraints.
AINeutralarXiv – CS AI · Mar 37/104
🧠Researchers extend the "Selection as Power" framework to dynamic settings, introducing constrained reinforcement learning that maintains bounded decision authority in AI systems. The study demonstrates that governance constraints can prevent AI systems from collapsing into deterministic dominance while still allowing adaptive improvement through controlled parameter updates.
AINeutralarXiv – CS AI · 11h ago6/10
🧠UC-Search is a model-agnostic test-time algorithm that combines time-series forecasting with constrained decision-making under uncertainty. The approach uses beam search and Monte Carlo tree search variants to optimize delayed control decisions while respecting feasibility constraints, demonstrating measurable improvements over existing methods like CEM and MPPI across inventory control and financial forecasting benchmarks.
AINeutralarXiv – CS AI · 11h ago6/10
🧠Researchers developed a constrained reinforcement learning approach for underwater vehicle control that explicitly budgets thruster power consumption, reducing energy use by 14-65% compared to traditional methods without requiring manual tuning for each vehicle or task.
AINeutralarXiv – CS AI · 6d ago6/10
🧠Researchers introduce MAMO, a multi-agent reinforcement learning system that autonomously optimizes reward weight selection for constrained optimization problems in dynamic environments. This addresses a critical limitation in current RL approaches where manual tuning of penalty weights significantly impacts policy performance and constraint adherence.
AINeutralarXiv – CS AI · Jun 116/10
🧠Researchers propose physics-informed generative AI architectures that enforce hard physical constraints by construction rather than post-hoc filtering, using semiconductor manufacturing as a test case. The work surveys emerging techniques including physics-informed diffusion models, PDE-constrained variational approaches, and conservation-law-respecting networks to ensure generated designs, data, and processes are physically valid rather than merely plausible.
AINeutralarXiv – CS AI · Jun 106/10
🧠Researchers introduce OSL-MR, a framework that optimizes memory retention for long-horizon language agents by treating it as a constrained optimization problem rather than local decisions. The approach combines learned evidence valuation with heuristic scoring while respecting real-world observability constraints, demonstrating superior performance over existing methods on benchmark datasets.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers introduce CCHD, a new hallucination detection method for large language models that uses paraphrase consistency constraints to improve factuality checking without expanding training datasets. The approach outperforms existing baselines like FactCG and MiniCheck while adding minimal computational overhead.
AINeutralarXiv – CS AI · Jun 95/10
🧠Researchers introduce Dri-MED, a machine learning algorithm designed to handle multi-armed bandit problems with personalized user preferences, drifting context distributions, and baseline performance constraints. The algorithm achieves improved regret bounds while minimizing constraint violations, demonstrating practical advantages over conservative baseline approaches in experimental settings.
AINeutralarXiv – CS AI · Jun 56/10
🧠Researchers propose MResOpt, a staged residual neural network architecture that solves constrained optimization problems by decomposing constraint satisfaction hierarchically. The method demonstrates improved performance on convex and non-convex optimization benchmarks, with particular applications to power flow problems in electrical grids.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers introduce CG-CMARL, a framework combining coordination graphs with Lagrangian duality to solve constrained multi-agent reinforcement learning problems. The approach decomposes complex joint action spaces into manageable pairwise regions, enabling scalability to larger agent teams while maintaining convergence guarantees and allowing dynamic Pareto front tracing without retraining.
AINeutralarXiv – CS AI · Jun 26/10
🧠Researchers introduce HAMU, a machine unlearning algorithm that removes the influence of specific training data while preserving model performance by quantifying the difficulty of balancing forget quality and retain utility through data similarity metrics. The approach offers theoretical guarantees and practical deployability for non-convex models, addressing a critical privacy and bias concern in machine learning.
AINeutralarXiv – CS AI · Jun 26/10
🧠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.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers introduce Safety-Biased Trust Region Policy Optimisation (SB-TRPO), a reinforcement learning algorithm designed to satisfy strict safety constraints in critical applications while maintaining task performance. The method dynamically balances safety compliance with reward improvement through principled policy updates, with formal guarantees of safety progress.
