Automated Program Repair of Uncompilable Student Code
Griffin Pitts, Aum Pandya, Darsh Rank, Tirth Bhatt, Muntasir Hoq, Bita Akram
https://arxiv.org/abs/2510.06187 https://
ConstraintLLM: A Neuro-Symbolic Framework for Industrial-Level Constraint Programming
Weichun Shi, Minghao Liu, Wanting Zhang, Langchen Shi, Fuqi Jia, Feifei Ma, Jian Zhang
https://arxiv.org/abs/2510.05774
"Experts say the new policy, which ditches software that automatically captured text messages, opens ample room for both willful and unwitting noncompliance with federal records laws."
To Preserve Records, Homeland Security Now Relies on Officials to Take Screenshots - The New York Times
https://www.nytimes.com/2025/11/06/us/politics/homeland-security-foia.html
Procrustes Problems on Random Matrices
Hajg Jasa, Ronny Bergmann, Christian K\"ummerle, Avanti Athreya, Zachary Lubberts
https://arxiv.org/abs/2510.05182 https://
AUREXA-SE: Audio-Visual Unified Representation Exchange Architecture with Cross-Attention and Squeezeformer for Speech Enhancement
M. Sajid, Deepanshu Gupta, Yash Modi, Sanskriti Jain, Harshith Jai Surya Ganji, A. Rahaman, Harshvardhan Choudhary, Nasir Saleem, Amir Hussain, M. Tanveer
https://arxiv.org/abs/2510.05295
Distributed Platoon Control Under Quantization: Stability Analysis and Privacy Preservation
Kaixiang Zhang, Zhaojian Li, Wei Lin
https://arxiv.org/abs/2510.05959 https://…
A Flexible Programmable Pipeline Parallelism Framework for Efficient DNN Training
Lijuan Jiang, Xingjian Qian, Zhenxiang Ma, Zan Zong, Hengjie Li, Chao Yang, Jidong Zhai
https://arxiv.org/abs/2510.05112
On Dynamic Programming Theory for Leader-Follower Stochastic Games
Jilles Steeve Dibangoye, Thibaut Le Marre, Ocan Sankur, Fran\c{c}ois Schwarzentruber
https://arxiv.org/abs/2512.05667 https://arxiv.org/pdf/2512.05667 https://arxiv.org/html/2512.05667
arXiv:2512.05667v1 Announce Type: new
Abstract: Leader-follower general-sum stochastic games (LF-GSSGs) model sequential decision-making under asymmetric commitment, where a leader commits to a policy and a follower best responds, yielding a strong Stackelberg equilibrium (SSE) with leader-favourable tie-breaking. This paper introduces a dynamic programming (DP) framework that applies Bellman recursion over credible sets-state abstractions formally representing all rational follower best responses under partial leader commitments-to compute SSEs. We first prove that any LF-GSSG admits a lossless reduction to a Markov decision process (MDP) over credible sets. We further establish that synthesising an optimal memoryless deterministic leader policy is NP-hard, motivating the development of {\epsilon}-optimal DP algorithms with provable guarantees on leader exploitability. Experiments on standard mixed-motive benchmarks-including security games, resource allocation, and adversarial planning-demonstrate empirical gains in leader value and runtime scalability over state-of-the-art methods.
toXiv_bot_toot
Massachusetts just awarded 1.3 GW of grid batteries to avoid costly upgrades. Kenya is scaling compressed earth blocks that cool homes with far less cement. CATL and Stellantis are building a 50 GWh battery plant in Spain to supply European EVs.
Real capacity, real progress.
Sign up for the For People And Planet climate solutions digest:
Towards Autonomous Tape Handling for Robotic Wound Redressing
Xiao Liang, Lu Shen, Peihan Zhang, Soofiyan Atar, Florian Richter, Michael Yip
https://arxiv.org/abs/2510.06127 htt…