These results provide exploratory evidence that LLM-assisted rewriting can make some moderate-complexity inputs usable within the evaluated DisCoCat configuration, while highlighting prompt design, filtering, and circuit-aware preprocessing as considerations for more scalable QNLP-based financial sentiment analysis.
Abstract
Quantum natural language processing (QNLP) provides a grammar-aware framework for text modeling, and Distributional Compositional Categorical (DisCoCat) is one of its theoretically grounded formulations. Prior work on financial sentiment analysis has identified practical limitations of DisCoCat, including parser sensitivity, high simulation cost, and difficulty handling longer sentences. We study an LLM-assisted preprocessing workflow that uses controlled rewriting to compress, simplify, or decompose moderate-complexity financial sentiment sentences into parser-compatible, circuit-efficient variants while preserving sentiment-bearing meaning. We compare prompting strategies, language models, and filtering configurations with the low-complexity-only DisCoCat baseline of Stein et al. At the circuit level, the strongest compression variants reduce average qubit and gate counts by more than 70 percent relative to the raw moderate-complexity subset. Across repeated training runs, GPT-4.1-mini with Prompt B achieves the highest observed mean accuracy, $0.550 \pm 0.035$, compared with $0.521 \pm 0.050$ for the baseline. Larger training splits do not necessarily improve downstream performance; across evaluated configurations, training-split size has a moderately negative association with accuracy (Pearson $r=-0.446$). These results provide exploratory evidence that LLM-assisted rewriting can make some moderate-complexity inputs usable within the evaluated DisCoCat configuration, while highlighting prompt design, filtering, and circuit-aware preprocessing as considerations for more scalable QNLP-based financial sentiment analysis.
This work compares Proximal Policy Optimization (PPO), Direct Preference Optimization (DPO), and Odds Ratio Preference Optimization (ORPO) using a novel reward modeling approach based on execution and semantic principles, revealing that while standard PPO suffers from reward sparsity and catastrophic collapse on 7B mod...
Noah Hampp, Katya Mirylenka, Michael R. Glass· Swiss Text Analytics Confere...· 1 citation
Automatic Hindi pregroup assignment is feasible and can reduce reliance on manual annotation in future multilingual QNLP pipelines, and suffix/morphology features improve karaka-token accuracy but not overall performance.
Gautami Sanjay Naik, Krish Bhatia, Mithun Paul Saint-Germain et al.· 0 citations
Text-to-SQL research has concentrated on English, while prior work on Arabic, Japanese, and Vietnamese has largely relied on grammar-constrained parsers or zero-shot prompting, with recent work beginning to explore trained LLM-based alternatives. We investigate whether a unified fine-tuned open-source pipeline can serv...
This study presents a Neural Turing Machine (NTM)-based framework for abstractive text summarization that combines a two-layer Bidirectional Long Short-Term Memory (BiLSTM) controller with an addressable external memory bank and highlights the potential of external-memory architectures as a scalable and stable alternat...
K. Katti, K. Katti, Amanul Islam· Frontiers in Artificial Inte...· 0 citations
This work investigates the structural sensitivity of multilingual LLMs using two linguistically grounded perturbation settings in Hindi and Malayalam and suggests that current multilingual LLMs remain highly sensitive to surface syntactic realization and lack robust compositional invariance under structurally different...
Karthika Nhayakkat, Rajat Verma, Maharaj Brahma et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.