Tootfinder

D-LiFT: Improving LLM-based Decompiler Backend via Code Quality-driven Fine-tuning
Muqi Zou (Jing), Hongyu Cai (Jing), Hongwei Wu (Jing), Zion Leonahenahe Basque (Jing), Arslan Khan (Jing), Berkay Celik (Jing), Dave (Jing), Tian (Fish), Antonio Bianchi (Fish), Ruoyu (Fish), Wang, Dongyan Xu
https://arxiv.org/abs/2506.10125…

D-LiFT: Improving LLM-based Decompiler Backend via Code Quality-driven Fine-tuning
Decompilers, which reconstruct human-readable source code from binary executables, are vital to many security tasks. Yet, despite recent advances, their output often suffers from syntactic and semantic errors and remains difficult to read. Recently, with the advent of large language models (LLMs), researchers began to explore the potential of LLMs to refine decompiler output. Nevertheless, our study of these approaches reveals significant limitations, such as introducing new errors and relying …

GPU-Accelerated Distributed QAOA on Large-scale HPC Ecosystems
Zhihao Xu, Srikar Chundury, Seongmin Kim, Amir Shehata, Xinyi Li, Ang Li, Tengfei Luo, Frank Mueller, In-Saeng Suh
https://arxiv.org/abs/2506.10531

GPU-Accelerated Distributed QAOA on Large-scale HPC Ecosystems
Quantum computing holds great potential to accelerate the process of solving complex combinatorial optimization problems. The Distributed Quantum Approximate Optimization Algorithm (DQAOA) addresses high-dimensional, dense problems using current quantum computing techniques and high-performance computing (HPC) systems. In this work, we improve the scalability and efficiency of DQAOA through advanced problem decomposition and parallel execution using message passing on the Frontier CPU/GPU super…

Wow, this is a first. A site I actually want to see (archive.ph) is using an IP address on the @… DROP list.
(no, I do NOT think that’s a Spamhaus problem. They are doing their job.) https://

Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts
Maolin Che, Yimin Wei, Chong Wu, Hong Yan
https://arxiv.org/abs/2506.04840

Efficient randomized algorithms for the fixed Tucker-rank problem of Tucker decomposition with adaptive shifts
Randomized numerical linear algebra is proved to bridge theoretical advancements to offer scalable solutions for approximating tensor decomposition. This paper introduces fast randomized algorithms for solving the fixed Tucker-rank problem of Tucker decomposition, through the integration of adaptive shifted power iterations. The proposed algorithms enhance randomized variants of truncated high-order singular value decomposition (T-HOSVD) and sequentially T-HOSVD (ST-HOSVD) by incorporating dyna…

Beyond Monoliths: Expert Orchestration for More Capable, Democratic, and Safe Large Language Models
Philip Quirke, Narmeen Oozeer, Chaithanya Bandi, Amir Abdullah, Jason Hoelscher-Obermaier, Jeff M. Phillips, Joshua Greaves, Clement Neo, Fazl Barez, Shriyash Upadhyay
https://arxiv.org/abs/2506.00051

Beyond Monoliths: Expert Orchestration for More Capable, Democratic, and Safe Large Language Models
This position paper argues that the prevailing trajectory toward ever larger, more expensive generalist foundation models controlled by a handful of big companies limits innovation and constrains progress. We challenge this approach by advocating for an "Expert Orchestration" framework as a superior alternative that democratizes LLM advancement. Our proposed framework intelligently selects from thousands of existing models based on query requirements and decomposition, focusing on identifying w…

CORA: Coalitional Rational Advantage Decomposition for Multi-Agent Policy Gradients
Mengda Ji, Genjiu Xu, Liying Wang
https://arxiv.org/abs/2506.04265 http…

CORA: Coalitional Rational Advantage Decomposition for Multi-Agent Policy Gradients
This work focuses on the credit assignment problem in cooperative multi-agent reinforcement learning (MARL). Sharing the global advantage among agents often leads to suboptimal policy updates as it fails to account for the distinct contributions of agents. Although numerous methods consider global or individual contributions for credit assignment, a detailed analysis at the coalition level remains lacking in many approaches. This work analyzes the over-updating problem during multi-agent policy…

Diffusion Tensor MRI and Spherical-Deconvolution-Based Tractography on an Ultra-Low Field Portable MRI System
James Gholam, Phil Schmid, Joshua Ametepe, Alix Plumley, Leandro Beltrachini, Francesco Padormo, Rui Teixeira, Rafael OHalloran, Kaloian Petkov, Klaus Engel, Steven CR Williams, Sean Deoni, Mara Cercignani, Derek K Jones
https://

Diffusion Tensor MRI and Spherical-Deconvolution-Based Tractography on an Ultra-Low Field Portable MRI System
Ultra-low-field (ULF) MRI is emerging as an alternative modality to high-field (HF) MRI due to its lower cost, minimal siting requirements, portability, and enhanced accessibility factors that enable large-scale deployment. Although ULF-MRI exhibits lower signal-to-noise ratio (SNR), advanced imaging and data-driven denoising methods enabled by high-performance computing have made contrasts like diffusion-weighted imaging (DWI) feasible at ULF. This study investigates the potential and limitati…

Maximum volume coordinates for Grassmann interpolation: Lagrange, Hermite, and errors
Rasmus Jensen, Ralf Zimmermann
https://arxiv.org/abs/2506.01574 https…

Maximum volume coordinates for Grassmann interpolation: Lagrange, Hermite, and errors
We present a novel approach to Riemannian interpolation on the Grassmann manifold. Instead of relying on the Riemannian normal coordinates, i.e. the Riemannian exponential and logarithm maps, we approach the interpolation problem with an alternative set of local coordinates and corresponding parameterizations. A special property of these coordinates is that their calculation does not require any matrix decompositions. This is a numerical advantage over Riemann normal coordinates and many other …