AIBullisharXiv – CS AI · 4d ago7/10
🧠Researchers introduce LiftQuant, a novel quantization framework enabling continuous bit-width control for Large Language Models by lifting weights into higher-dimensional space and projecting them back via 1-bit lattices. The approach bridges the gap between rigid integer bit-widths and real-world deployment constraints, allowing a 70B LLM to compress to 2.4 bits while maintaining hardware efficiency and outperforming existing 2-bit quantization methods.
AINeutralarXiv – CS AI · 4d ago6/10
🧠ParetoPilot introduces a novel diffusion-based framework for offline multi-objective optimization that eliminates the need for external surrogate models. The method uses an Infer-Perturb-Guide engine to generate Pareto-optimal designs from static datasets, demonstrating superior performance across 51 tasks while preserving data privacy and reducing computational overhead.
AINeutralarXiv – CS AI · 6d ago5/10
🧠Researchers introduce ATOM, a multi-agent framework that treats molecular optimization as tree-structured search where specialized agents coordinate across different pathways rather than enforcing consensus. The method demonstrates improved performance on multi-objective molecular design benchmarks by maintaining diverse trade-offs and exploring multiple promising trajectories simultaneously.
$ATOM
AINeutralarXiv – CS AI · 6d ago6/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 · 6d ago6/10
🧠Researchers present a theoretical framework and practical algorithms for achieving fairness in multi-class machine learning classification tasks, addressing a gap where most bias mitigation techniques focus on binary settings. The work proposes both in-processing and post-processing methods that converge to an optimal accuracy-fairness Pareto frontier, with experimental validation across multiple datasets.
🏢 Meta
AINeutralarXiv – CS AI · 6d ago6/10
🧠Researchers propose a new evaluation framework for certified neural network training methods using Pareto front comparisons to assess the natural-certified accuracy trade-off. By applying automated hyperparameter optimization across methods, they reveal significant undertuning in prior work and establish new performance benchmarks that challenge assumptions about state-of-the-art certified robustness.
🏢 Meta
AIBullisharXiv – CS AI · May 286/10
🧠TCP-MCP introduces a co-evolution framework that simultaneously optimizes AI agent prompts and communication network topologies, achieving state-of-the-art accuracy on multiple benchmarks while reducing token consumption by up to 5.69x compared to existing multi-agent systems. The approach treats prompt design and communication structure as interdependent variables rather than independent parameters, offering a practical methodology for cost-efficient multi-agent AI system design.
AINeutralarXiv – CS AI · Apr 136/10
🧠Researchers introduce CoA-LoRA, a method that dynamically adapts LoRA fine-tuning to different quantization configurations without requiring separate retraining for each setting. The approach uses a configuration-aware model and Pareto-based search to optimize low-rank adjustments across heterogeneous edge devices, achieving comparable performance to traditional methods with zero additional computational cost.
AINeutralarXiv – CS AI · Mar 34/105
🧠Researchers propose MO-MIX, a new deep reinforcement learning approach that addresses multi-objective multi-agent cooperative decision-making problems. The method combines centralized training with decentralized execution and demonstrates superior performance over baseline methods while requiring less computational cost.
