AINeutralarXiv – CS AI · 4d ago5/10
🧠Researchers introduce a joint air traffic flow and capacity management model using Answer Set Programming that simultaneously optimizes aircraft trajectories and sector configurations. The ASP approach outperforms traditional Mixed Integer Programming methods and remains competitive with heuristics, demonstrating potential improvements in balancing flight demand with available airspace capacity.
AINeutralarXiv – CS AI · 4d ago6/10
🧠Researchers propose using random walks on graphs as a testing framework for parallel sampling strategies in masked diffusion models, proving that popular entropy-based sampling methods aren't universally optimal and introducing a new bisection sampler that achieves logarithmic-time sampling with theoretical guarantees.
AINeutralarXiv – CS AI · Jun 95/10
🧠Researchers introduce CFips, a sampling algorithm for efficiently exploring interval patterns under user-defined constraints. The approach preserves exact sampling guarantees while decomposing syntactic constraints into elementary predicates, enabling pattern mining tasks that previously exceeded computational time limits.
AINeutralarXiv – CS AI · Jun 96/10
🧠Researchers present a novel structured pruning framework that uses multi-armed bandit algorithms to remove redundant neurons from deep neural networks. The approach treats each neuron as a bandit arm, testing its importance through temporary masking and loss measurement, then applies various MAB policies (UCB1, Thompson Sampling, etc.) to identify which neurons to prune. Experiments across tabular and deep learning tasks show MAB-based pruning significantly outperforms traditional magnitude-based and greedy pruning methods.
AIBullisharXiv – CS AI · Jun 26/10
🧠Researchers introduce PRAXIS, an algorithm that efficiently computes Rashomon sets—collections of near-optimal machine learning models—achieving orders of magnitude improvements in runtime and memory usage compared to existing methods. The breakthrough enables practitioners to scalably explore model diversity and incorporate domain knowledge into decision-making for interpretable models like decision trees.
AINeutralarXiv – CS AI · May 296/10
🧠Researchers introduce Quotient DAGs, a novel framework for off-policy evaluation that addresses variance issues in importance sampling by recognizing when generation process details are irrelevant to evaluation targets. The method computes exact unordered slate propensities efficiently through Forward-DP, a dynamic programming approach that avoids factorial enumeration, enabling practical evaluation for autoregressive slate recommendation systems.
AINeutralarXiv – CS AI · May 286/10
🧠Researchers introduce a novel predictability-aligned evaluation framework for time series forecasting that separates model performance from data's inherent unpredictability. The framework reveals that complex AI models excel with difficult-to-predict data while linear models perform comparably on more predictable tasks, suggesting current benchmark rankings conflate model capability with task difficulty.
AINeutralarXiv – CS AI · May 115/10
🧠Researchers present CM-Tabu, a composite-move Tabu search algorithm that solves spatial redistricting optimization problems more effectively by expanding the feasible solution space while maintaining district contiguity constraints. The method uses graph analysis to identify minimal unit movements or swaps that preserve connectivity, achieving superior solution quality and computational efficiency compared to traditional approaches.
AINeutralarXiv – CS AI · May 115/10
🧠Researchers present a solution for selecting cost-effective experiments to narrow uncertainty bounds on partially identifiable causal effects from observational data. They formalize this as an NP-hard optimization problem and develop pruning algorithms that eliminate 50-88% of candidate experiments without exhaustive computation, demonstrated on real epidemiological datasets.
