AIBullisharXiv – CS AI · Jun 117/10
🧠Researchers introduce Certifiable Safe-RLHF (CS-RLHF), a novel approach to align large language models safely by using semantically grounded safety scores and penalty-based optimization instead of traditional reward-cost functions. The method provides provable safety guarantees without requiring expensive dual-variable tuning and demonstrates 5x better efficiency against jailbreak attempts.
AIBullisharXiv – CS AI · Jun 97/10
🧠Researchers have developed a novel framework for autonomously scheduling observations across large satellite constellations using distributed constraint optimization. The work introduces the dynamic multi-satellite constellation observation scheduling problem (DCOSP) and the D-NSS algorithm, which enables satellites to coordinate efficiently with minimal communication overhead—a critical advancement for NASA's FAME mission demonstrating distributed multi-agent AI in space.
AIBullisharXiv – CS AI · Jun 196/10
🧠Researchers introduce RACL, a reasoning-agent control layer that sits above existing optimization algorithms to improve their performance without modifying core constraints. Using vehicle routing as a testbed, RACL demonstrates measurable improvements over baseline policies, with potential applications across metaheuristic optimization problems.
AINeutralarXiv – CS AI · Jun 196/10
🧠Researchers propose HID, a machine learning framework that resolves the long-standing accuracy-versus-diversity trade-off in session-based recommendation systems by using hybrid intent learning and dual constraint losses. The approach identifies and filters session-irrelevant noise in long-tail items, enabling systems to boost both recommendation accuracy and diversity simultaneously rather than sacrificing one for the other.
AINeutralarXiv – CS AI · Jun 116/10
🧠Researchers propose SOCD, an offline reinforcement learning algorithm that learns multi-user scheduling policies from pre-collected data without requiring real-time system interactions. The method combines diffusion models with critic guidance and Lagrangian optimization to handle delay-constrained resource allocation across applications like data centers and live streaming.
AINeutralarXiv – CS AI · Jun 106/10
🧠Researchers propose Bellman-Taylor score decoding, a novel deep reinforcement learning framework designed to handle Markov decision processes with state-dependent action constraints common in operations research. The method decouples policy learning into a Euclidean score space while maintaining feasibility through an action decoder, enabling standard DRL algorithms to optimize complex systems like queueing networks without architectural modifications.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers propose PVPO, a sample-efficient reinforcement learning method that improves LLM-based LEGO assembly generation by addressing PhysHack, a failure mode where structures satisfy physical constraints but lack semantic or geometric coherence. The approach uses selective data training and couples physical feasibility with geometric rewards, achieving better structural alignment while reducing reliance on rejection sampling.
AINeutralarXiv – CS AI · Jun 16/10
🧠Researchers propose a constrained optimization framework for unlearning in diffusion models that balances removing undesirable data while preserving model utility. Using KL divergence and likelihood constraints with primal-dual algorithms, the approach achieves superior performance in concept and data unlearning compared to existing weight-based methods.
AINeutralarXiv – CS AI · May 286/10
🧠Researchers introduce Generative Response Model (GRM), a machine learning approach that optimizes digital advertising bidding by predicting future traffic and cost outcomes rather than making individual bid decisions. The system enforces budget and performance constraints through analytic controllers, demonstrating improved stability and performance over existing auto-bidding methods.
AINeutralarXiv – CS AI · May 286/10
🧠STAB is a specification-driven testing pipeline that generates test cases exposing algorithmic bottlenecks by extracting constraints and injecting adversarial structures from natural language problem specifications. The method improves bottleneck detection rates from 50-57% to 71-73% across major programming languages and LLM implementations.
AINeutralarXiv – CS AI · May 276/10
🧠Researchers introduce Anchor, a task-generation pipeline that addresses 'artifact drift' in AI agent benchmarking by automatically creating consistent instructions, environments, solutions, and verifiers from formal specifications. The team releases ERP-Bench, a 300-task benchmark for enterprise workflows, finding frontier AI models solve only 17.4% of tasks optimally despite meeting explicit constraints 26.1% of the time.
AINeutralarXiv – CS AI · Mar 174/10
🧠Researchers propose a new constraint-based approach to LLM routing that formulates the problem as weighted MaxSAT/MaxSMT optimization, using natural language feedback to create constraints over model attributes. Testing on a 25-model benchmark shows this method can effectively route queries to appropriate LLMs based on user preferences expressed in natural language.
