SASalvador Aguinaga

Salvador Aguinaga

*This is an algorithmically generated author record based on publicly available information.

Salvador Aguinaga has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    Citations and Trust in LLM Generated Responses

    by Yifan Ding, Matthew Facciani, Ellen Joyce, Amrit Poudel, Sanmitra Bhattacharya, Balaji Veeramani, Sal Aguinaga, Tim Weninger

    Question answering systems are rapidly advancing, but their opaque nature may impact user trust. We explored trust through an anti-monitoring framework, where trust is predicted to be correlated with presence of citations and inversely related to checking citations. We tested this hypothesis with a live question-answering experiment that presented text responses generated using a commercial Chatbot along with varying citations (zero, one, or five), both relevant and random, and recorded if participants checked the citations and their self-reported trust in the generated responses. We found a significant increase in trust when citations were present, a result that held true even when the citations were random; we also found a significant decrease in trust when participants checked the citations. These results highlight the importance of citations in enhancing trust in AI-generated content.


  • Open Access

    QuOp: A Quantum Operator Representation for Nodes

    by Andrew Vlasic, Salvador Aguinaga

    We derive an intuitive and novel method to represent nodes in a graph with special unitary operators, or quantum operators, which does not require parameter training and is competitive with classical methods on scoring similarity between nodes. This method opens up future possibilities to apply quantum algorithms for NLP or other applications that need to detect anomalies within a network structure. Specifically, this technique leverages the advantage of quantum computation, representing nodes in higher dimensional Hilbert spaces. To create the representations, the local topology around each node with a predetermined number of hops is calculated and the respective adjacency matrix is used to derive the Hamiltonian. While using the local topology of a node to derive a Hamiltonian is a natural extension of a graph into a quantum circuit, our method differs by not assuming the quantum operators in the representation a priori, but letting the adjacency matrix dictate the representation. As a consequence of this simplicity, the set of adjacency matrices of size $2^n \times 2^n$ generates a sub-vector space of the Lie algebra of the special unitary operators, $\mathfrak{su}(2^n)$. This sub-vector space in turn generates a subgroup of the Lie group of special unitary operators, $\mathrm{SU}(2^n)$. Applications of our quantum embedding method, in comparison with the classical algorithms GloVe (a natural language processing embedding method) and FastRP (a general graph embedding method, display superior performance in measuring similarity between nodes in graph structures.