arXiv:2602. 00329v4 Announce Type: replace-cross Abstract: Reliable data attribution is essential for mitigating bias and reducing computational waste in modern machine learning, with the Shapley value serving as the theoretical gold standard.
By Meng Ding, Zeqing Zhang, Di Wang, Lijie Hu
arXiv:2510. 10101v4 Announce Type: replace Abstract: Understanding the interplay between generalization, expressivity, and the geometry of the input space is a central challenge in graph learning.
By Martin Carrasco, Caio F. Deberaldini Netto, Vahan A. Martirosyan, Ehimare Okoyomon, Caterina Graziani
arXiv:2603. 02462v2 Announce Type: replace-cross Abstract: A key challenge in developing unified neural solvers for combinatorial optimization (CO) is the efficient generalization of models from a given set of tasks to new tasks unseen during initial training.
By Semih Cant\"urk, Thomas Sabourin, Frederik Wenkel, Michael Perlmutter, Guy Wolf
arXiv:2602.13106v2 Announce Type: replace-cross
Abstract: In recent years, there has been growing interest in understanding neural architectures' ability to learn to execute discrete algorithms, a li...
By Solveig Wittig, Antonis Vasileiou, Robert R. Nerem, Timo Stoll, Floris Geerts, Yusu Wang, Christopher Morris
The paper demonstrates that tree tensor networks (TTNs) can encode arbitrary read‑once Boolean formulas, yielding polynomial‑size targets that are hard for gradient descent to learn in polynomial time, yet their loss landscapes are conditionally benign: every minimum‑norm local minimum is global. This shows that bad local minima are not the source of learning difficulty in TTNs; instead, high‑order degenerate saddle points caused by rank‑deficiency can impede learning. A case study on the parity function illustrates how TTNs can link landscape geometry to computational hardness.
By Zach Furman, Stephan W\"aldchen, Yangda Bei, Liam Hodgkinson
QuadraSHAP is a method for computing ε-exact Shapley values in product games, where coalition values factor across players. It replaces the exponential coalition sum with a one-dimensional polynomial integral, using Gauss–Legendre quadrature to achieve exact values when ε = 0 and provides a computable error bound for ε > 0. The approach supports weighted sums of product games, enabling baseline and empirical interventional attribution for models such as log-link regression, Cox models, odds-scale classifiers, product-kernel machines, and tree-based models, and achieves logarithmic parallel time with efficient GPU evaluation even for hundreds of thousands of features.
By Majid Mohammadi, Grigory Reznikov, Pavel Sinitcyn, Krikamol Muandet, Siu Lun Chau