arXiv subjects

Antonio Rago

Publications and source records attributed to Antonio Rago.

At least 55 records · Page 3Linked to original sources

arXiv2024

Probing higher moments of pion parton distribution functions

We present the first numerical investigation of the method proposed in Ref. [1] to utilize gradient flow to obtain precise determinations of higher moments of PDFs from lattice QCD, circumventing power divergent mixing with lower dimensional operators. We apply this method to obtain moments of the isovector PDF of the pion using four Stabilized Wilson Fermion ensembles with $m_π\simeq 411$ MeV and lattice spacings $a \simeq 0.064, 0.077, 0.094$, and $0.12$ fm. We present preliminary results of ratios of three-point functions as a function of flow time, which can be used to extract the ratios $\left\langle x^2 \right\rangle/\left\langle x \right\rangle$ and $\left\langle x^3 \right\rangle/\left\langle x \right\rangle$. We find that a significantly higher precision can be achieved with this method compared to the canonical approach, which requires boosting and cannot reach higher than the $\left\langle x^3 \right\rangle$ moment.

hep-lat↗

arXiv2024

Gradient Flow Renormalisation for Meson Mixing and Lifetimes

Fermionic gradient flow in combination with the short-flow-time expansion provides a computational method where the renormalisation of hadronic matrix elements on the lattice can be simplified to address e.g. the issue that operators with different mass dimension can mix. We demonstrate our gradient flow renormalisation procedure by determining matrix elements of four-quark operators describing neutral meson mixing or meson lifetimes. While meson mixing calculations are well-established on the lattice and serve to validate our procedure, a lattice calculation of matrix elements for heavy meson lifetimes is still outstanding. Preliminary results for mesons formed of a charm and strange quark are presented.

hep-lat↗

arXiv2024

Interval Abstractions for Robust Counterfactual Explanations

Counterfactual Explanations (CEs) have emerged as a major paradigm in explainable AI research, providing recourse recommendations for users affected by the decisions of machine learning models. However, CEs found by existing methods often become invalid when slight changes occur in the parameters of the model they were generated for. The literature lacks a way to provide exhaustive robustness guarantees for CEs under model changes, in that existing methods to improve CEs' robustness are mostly heuristic, and the robustness performances are evaluated empirically using only a limited number of retrained models. To bridge this gap, we propose a novel interval abstraction technique for parametric machine learning models, which allows us to obtain provable robustness guarantees for CEs under a possibly infinite set of plausible model changes $Δ$. Based on this idea, we formalise a robustness notion for CEs, which we call $Δ$-robustness, in both binary and multi-class classification settings. We present procedures to verify $Δ$-robustness based on Mixed Integer Linear Programming, using which we further propose algorithms to generate CEs that are $Δ$-robust. In an extensive empirical study involving neural networks and logistic regression models, we demonstrate the practical applicability of our approach. We discuss two strategies for determining the appropriate hyperparameters in our method, and we quantitatively benchmark CEs generated by eleven methods, highlighting the effectiveness of our algorithms in finding robust CEs.

cs.LG↗

arXiv2024

Argumentation and Machine Learning

This chapter provides an overview of research works that present approaches with some degree of cross-fertilisation between Computational Argumentation and Machine Learning. Our review of the literature identified two broad themes representing the purpose of the interaction between these two areas: argumentation for machine learning and machine learning for argumentation. Across these two themes, we systematically evaluate the spectrum of works across various dimensions, including the type of learning and the form of argumentation framework used. Further, we identify three types of interaction between these two areas: synergistic approaches, where the Argumentation and Machine Learning components are tightly integrated; segmented approaches, where the two are interleaved such that the outputs of one are the inputs of the other; and approximated approaches, where one component shadows the other at a chosen level of detail. We draw conclusions about the suitability of certain forms of Argumentation for supporting certain types of Machine Learning, and vice versa, with clear patterns emerging from the review. Whilst the reviewed works provide inspiration for successfully combining the two fields of research, we also identify and discuss limitations and challenges that ought to be addressed in order to ensure that they remain a fruitful pairing as AI advances.

cs.AI↗

arXiv2024

Advancing Interactive Explainable AI via Belief Change Theory

As AI models become ever more complex and intertwined in humans' daily lives, greater levels of interactivity of explainable AI (XAI) methods are needed. In this paper, we propose the use of belief change theory as a formal foundation for operators that model the incorporation of new information, i.e. user feedback in interactive XAI, to logical representations of data-driven classifiers. We argue that this type of formalisation provides a framework and a methodology to develop interactive explanations in a principled manner, providing warranted behaviour and favouring transparency and accountability of such interactions. Concretely, we first define a novel, logic-based formalism to represent explanatory information shared between humans and machines. We then consider real world scenarios for interactive XAI, with different prioritisations of new and existing knowledge, where our formalism may be instantiated. Finally, we analyse a core set of belief change postulates, discussing their suitability for our real world settings and pointing to particular challenges that may require the relaxation or reinterpretation of some of the theoretical assumptions underlying existing operators.

cs.AI↗

arXiv2024

Contestable AI needs Computational Argumentation

AI has become pervasive in recent years, but state-of-the-art approaches predominantly neglect the need for AI systems to be contestable. Instead, contestability is advocated by AI guidelines (e.g. by the OECD) and regulation of automated decision-making (e.g. GDPR). In this position paper we explore how contestability can be achieved computationally in and for AI. We argue that contestable AI requires dynamic (human-machine and/or machine-machine) explainability and decision-making processes, whereby machines can (i) interact with humans and/or other machines to progressively explain their outputs and/or their reasoning as well as assess grounds for contestation provided by these humans and/or other machines, and (ii) revise their decision-making processes to redress any issues successfully raised during contestation. Given that much of the current AI landscape is tailored to static AIs, the need to accommodate contestability will require a radical rethinking, that, we argue, computational argumentation is ideally suited to support.

cs.AI↗

arXiv2024

Heterogeneous Graph Neural Networks with Post-hoc Explanations for Multi-modal and Explainable Land Use Inference

Urban land use inference is a critically important task that aids in city planning and policy-making. Recently, the increased use of sensor and location technologies has facilitated the collection of multi-modal mobility data, offering valuable insights into daily activity patterns. Many studies have adopted advanced data-driven techniques to explore the potential of these multi-modal mobility data in land use inference. However, existing studies often process samples independently, ignoring the spatial correlations among neighbouring objects and heterogeneity among different services. Furthermore, the inherently low interpretability of complex deep learning methods poses a significant barrier in urban planning, where transparency and extrapolability are crucial for making long-term policy decisions. To overcome these challenges, we introduce an explainable framework for inferring land use that synergises heterogeneous graph neural networks (HGNs) with Explainable AI techniques, enhancing both accuracy and explainability. The empirical experiments demonstrate that the proposed HGNs significantly outperform baseline graph neural networks for all six land-use indicators, especially in terms of 'office' and 'sustenance'. As explanations, we consider feature attribution and counterfactual explanations. The analysis of feature attribution explanations shows that the symmetrical nature of the `residence' and 'work' categories predicted by the framework aligns well with the commuter's 'work' and 'recreation' activities in London. The analysis of the counterfactual explanations reveals that variations in node features and types are primarily responsible for the differences observed between the predicted land use distribution and the ideal mixed state. These analyses demonstrate that the proposed HGNs can suitably support urban stakeholders in their urban planning and policy-making.

cs.AI↗

arXiv2024

GPU-accelerated Higher Representations of Wilson Fermions with HiRep

We are improving one of the available lattice software packages HiRep by adding GPU acceleration supporting highly-optimized simulations on both NVIDIA and AMD GPUs. HiRep allows lattice simulations of theories with fermions in higher representations and a variable number of colors in the gauge group. The development is accompanied by an overall software quality improvement in the build system, testing, and documentation, adding features for both CPUs and GPUs. The software is available under https://github.com/claudiopica/HiRep

hep-lat↗

arXiv2024

Provably Robust and Plausible Counterfactual Explanations for Neural Networks via Robust Optimisation

Counterfactual Explanations (CEs) have received increasing interest as a major methodology for explaining neural network classifiers. Usually, CEs for an input-output pair are defined as data points with minimum distance to the input that are classified with a different label than the output. To tackle the established problem that CEs are easily invalidated when model parameters are updated (e.g. retrained), studies have proposed ways to certify the robustness of CEs under model parameter changes bounded by a norm ball. However, existing methods targeting this form of robustness are not sound or complete, and they may generate implausible CEs, i.e., outliers wrt the training dataset. In fact, no existing method simultaneously optimises for closeness and plausibility while preserving robustness guarantees. In this work, we propose Provably RObust and PLAusible Counterfactual Explanations (PROPLACE), a method leveraging on robust optimisation techniques to address the aforementioned limitations in the literature. We formulate an iterative algorithm to compute provably robust CEs and prove its convergence, soundness and completeness. Through a comparative experiment involving six baselines, five of which target robustness, we show that PROPLACE achieves state-of-the-art performances against metrics on three evaluation aspects.

cs.LG↗

arXiv2024

Can Large Language Models perform Relation-based Argument Mining?

Argument mining (AM) is the process of automatically extracting arguments, their components and/or relations amongst arguments and components from text. As the number of platforms supporting online debate increases, the need for AM becomes ever more urgent, especially in support of downstream tasks. Relation-based AM (RbAM) is a form of AM focusing on identifying agreement (support) and disagreement (attack) relations amongst arguments. RbAM is a challenging classification task, with existing methods failing to perform satisfactorily. In this paper, we show that general-purpose Large Language Models (LLMs), appropriately primed and prompted, can significantly outperform the best performing (RoBERTa-based) baseline. Specifically, we experiment with two open-source LLMs (Llama-2 and Mistral) with ten datasets.

cs.CL↗

arXiv2024

Robust Counterfactual Explanations in Machine Learning: A Survey

Counterfactual explanations (CEs) are advocated as being ideally suited to providing algorithmic recourse for subjects affected by the predictions of machine learning models. While CEs can be beneficial to affected individuals, recent work has exposed severe issues related to the robustness of state-of-the-art methods for obtaining CEs. Since a lack of robustness may compromise the validity of CEs, techniques to mitigate this risk are in order. In this survey, we review works in the rapidly growing area of robust CEs and perform an in-depth analysis of the forms of robustness they consider. We also discuss existing solutions and their limitations, providing a solid foundation for future developments.

cs.LG↗

arXiv2024

Recourse under Model Multiplicity via Argumentative Ensembling (Technical Report)

Model Multiplicity (MM) arises when multiple, equally performing machine learning models can be trained to solve the same prediction task. Recent studies show that models obtained under MM may produce inconsistent predictions for the same input. When this occurs, it becomes challenging to provide counterfactual explanations (CEs), a common means for offering recourse recommendations to individuals negatively affected by models' predictions. In this paper, we formalise this problem, which we name recourse-aware ensembling, and identify several desirable properties which methods for solving it should satisfy. We show that existing ensembling methods, naturally extended in different ways to provide CEs, fail to satisfy these properties. We then introduce argumentative ensembling, deploying computational argumentation to guarantee robustness of CEs to MM, while also accommodating customisable user preferences. We show theoretically and experimentally that argumentative ensembling satisfies properties which the existing methods lack, and that the trade-offs are minimal wrt accuracy.

cs.LG↗

arXiv2023

2-flavour $SU(2)$ gauge theory with exponential clover Wilson fermions

Composite Higgs models are a class of models proposed to address the hierarchy and naturalness problems associated with the Standard Model fundamental scalar Higgs. $SU(2)$ with two fundamental flavours is a minimal model for the composite Higgs sector which is not yet ruled out by experimental data. We present lattice results for $SU(2)$ with two fundamental mass degenerate flavours. For the fermion action we use the new exponential clover Wilson fermion action, which offers $O(a)$ improvement. We discuss tuning the $c_{\mathrm{SW}}$ parameter through Schrödinger functional simulations, the scale setting of the ensembles using the Wilson gauge flow, and the low energy spectroscopy of the theory including the masses of the pseudoscalar isotriplet Goldstone bosons and the vector isotriplet.

hep-lat↗

arXiv2023

Progress in generating gauge ensembles with Stabilized Wilson Fermions

The continued generation of $N_f=2+1$ quark flavor gauge configurations using stabilized Wilson fermions by the open lattice initiative (OpenLat) is reported. We present the status of our ongoing production and show updates on increasing statistics at the four lattice spacings $a=0.12, 0.094, 0.077$ and $0.064$ fm. Aside from the $SU(3)$ flavor symmetric point we discuss advancements in going towards physical pion masses. We show preliminary results of the pion decay constants, extending previous results, and discuss further validation observables on the available ensembles.

hep-lat↗

arXiv2023

Exploiting stochastic locality in lattice QCD: hadronic observables and their uncertainties

Because of the mass gap, lattice QCD simulations exhibit stochastic locality: distant regions of the lattice fluctuate independently. There is a long history of exploiting this to increase statistics by obtaining multiple spatially-separated samples from each gauge field; in the extreme case, we arrive at the master-field approach in which a single gauge field is used. Here we develop techniques for studying hadronic observables using position-space correlators, which are more localized, and compare with the standard time-momentum representation. We also adapt methods for estimating the variance of an observable from autocorrelated Monte Carlo samples to the case of correlated spatially-separated samples.

hep-lat↗

arXiv2023

Using Gradient Flow to Renormalise Matrix Elements for Meson Mixing and Lifetimes

Neutral meson mixing and meson lifetimes are theory-side parametrised in terms four-quark operators which can be determined by calculating weak decay matrix elements using lattice Quantum Chromodynamics. While calculations of meson mixing matrix elements are standard, determinations of lifetimes typically suffer from complications in renormalisation procedures because dimension-6 four-quark operators can mix with operators of lower mass dimension and, moreover, quark-line disconnected diagrams contribute. We present work detailing the idea to use fermionic gradient flow to non-perturbatively renormalise matrix elements describing meson mixing or lifetimes, and combining it with a perturbative calculation to match to the $\overline{\rm MS}$ scheme using the shoft-flow-time expansion.

hep-lat↗

arXiv2023

Phase Transitions in Particle Physics -- Results and Perspectives from Lattice Quantum Chromo-Dynamics

Phase transitions in a non-perturbative regime can be studied by ab initio Lattice Field Theory methods. The status and future research directions for LFT investigations of Quantum Chromo-Dynamics under extreme conditions are reviewed, including properties of hadrons and of the hypothesized QCD axion as inferred from QCD topology in different phases. We discuss phase transitions in strong interactions in an extended parameter space, and the possibility of model building for Dark Matter and Electro-Weak Symmetry Breaking. Methodological challenges are addressed as well, including new developments in Artificial Intelligence geared towards the identification of different phases and transitions.

hep-lat↗

arXiv2023

Interactive Explanations by Conflict Resolution via Argumentative Exchanges

As the field of explainable AI (XAI) is maturing, calls for interactive explanations for (the outputs of) AI models are growing, but the state-of-the-art predominantly focuses on static explanations. In this paper, we focus instead on interactive explanations framed as conflict resolution between agents (i.e. AI models and/or humans) by leveraging on computational argumentation. Specifically, we define Argumentative eXchanges (AXs) for dynamically sharing, in multi-agent systems, information harboured in individual agents' quantitative bipolar argumentation frameworks towards resolving conflicts amongst the agents. We then deploy AXs in the XAI setting in which a machine and a human interact about the machine's predictions. We identify and assess several theoretical properties characterising AXs that are suitable for XAI. Finally, we instantiate AXs for XAI by defining various agent behaviours, e.g. capturing counterfactual patterns of reasoning in machines and highlighting the effects of cognitive biases in humans. We show experimentally (in a simulated environment) the comparative advantages of these behaviours in terms of conflict resolution, and show that the strongest argument may not always be the most effective.

cs.AI↗