Quantum annealing (QA) is a hardware-based heuristic optimization and sampling method applicable to discrete undirected graphical models. While similar to simulated annealing, QA relies on quantum, rather than thermal, effects to explore complex search spaces. For many classes of problems, QA is known to offer computat…
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
The papers math.QA/0403527 and math.QA/0409414 v.1 are now merged together. The final version is available at math.QA/0409414 v.2. To avoid duplication of papers, math.QA/0403527 is now removed.
Paper analyzes biases in video QA datasets, showing models can answer 37-48% questions correctly without multimodal context.
We developed a new quantum annealing (QA) algorithm for Dirichlet process mixture (DPM) models based on the Chinese restaurant process (CRP). QA is a parallelized extension of simulated annealing (SA), i.e., it is a parallel stochastic optimization technique. Existing approaches [Kurihara et al. UAI2009, Sato et al. UA…
Study subjective perception of low light restored images and develop an unsupervised QA model.
EQD model improves domain-specific QA by 0.6% to 10.5%.
FinReflectKG benchmarks financial QA by linking relevant context from a financial KG, improving model performance and efficiency.
Optimizes train schedules and maintenance using CP and QA.
Question-answering (QA) data often encodes essential information in many facets. This paper studies a natural question: Can we get supervision from QA data for other tasks (typically, non-QA ones)? For example, {\em can we use QAMR (Michael et al., 2017) to improve named entity recognition?} We suggest that simply furt…
We consider a novel question answering (QA) task where the machine needs to read from large streaming data (long documents or videos) without knowing when the questions will be given, which is difficult to solve with existing QA methods due to their lack of scalability. To tackle this problem, we propose a novel end-to…
We implement a method for re-ranking top-10 results of a state-of-the-art question answering (QA) system. The goal of our re-ranking approach is to improve the answer selection given the user question and the top-10 candidates. We focus on improving deployed QA systems that do not allow re-training or re-training comes…
Study explores D-Wave QA for RBM training, finds modest benefits but no significant improvements.
Optimal query allocation improves extractive QA efficiency with LLMs.
We prove Tsygan's formality conjecture for Hochschild chains of the algebra of functions on an arbitrary smooth manifold M using the Fedosov resolutions proposed in math.QA/0307212 and the formality quasi-isomorphism for Hochschild chains of R[[y_1, ..., y_d]] proposed in paper math.QA/0010321 by Shoikhet. This result …
The AI2 Reasoning Challenge (ARC), a new benchmark dataset for question answering (QA) has been recently released. ARC only contains natural science questions authored for human exams, which are hard to answer and require advanced logic reasoning. On the ARC Challenge Set, existing state-of-the-art QA systems fail to s…
Benchmark evaluates AI-generated financial QA hallucinations, highlighting system vulnerabilities.
FinanceBench benchmarks LLMs on financial QA, revealing limitations.
In this note, I discuss in some detail the dual version of the ribbon graph decomposition of the moduli spaces of Riemann surfaces with boundary and marked points, which I introduced in math.AG/0402015, and used in math.QA/0412149 to construct open-closed topological conformal field theories. This dual version of the r…
A new framework evaluates LLM calibration in open-ended QA.
Quantum annealing (QA) is a generic method for solving optimization problems using fictitious quantum fluctuation. The current device performing QA involves controlling the transverse field; it is classically simulatable by using the standard technique for mapping the quantum spin systems to the classical ones. In this…
The emergence of structured databases for Question Answering (QA) systems has led to developing methods, in which the problem of learning the correct answer efficiently is based on a linking task between the constituents of the question and the corresponding entries in the database. As a result, parsing the questions i…
This paper has been withdrawn since it is identical to the paper math.QA/0601267. It was posted by mistake.
Extracting relevant information from medical conversations and providing it to doctors and patients might help in addressing doctor burnout and patient forgetfulness. In this paper, we focus on extracting the Medication Regimen (dosage and frequency for medications) discussed in a medical conversation. We frame the pro…
In this paper, we conduct an empirical investigation of neural query graph ranking approaches for the task of complex question answering over knowledge graphs. We experiment with six different ranking models and propose a novel self-attention based slot matching model which exploits the inherent structure of query grap…
Community-based Question Answering (CQA) sites play an important role in addressing health information needs. However, a significant number of posted questions remain unanswered. Automatically answering the posted questions can provide a useful source of information for online health communities. In this study, we deve…
Maximum likelihood estimation (MLE) is one of the most important methods in machine learning, and the expectation-maximization (EM) algorithm is often used to obtain maximum likelihood estimates. However, EM heavily depends on initial configurations and fails to find the global optimum. On the other hand, in the field …
We propose a modified expectation-maximization algorithm by introducing the concept of quantum annealing, which we call the deterministic quantum annealing expectation-maximization (DQAEM) algorithm. The expectation-maximization (EM) algorithm is an established algorithm to compute maximum likelihood estimates and appl…
We describe a new class of learning models called memory networks. Memory networks reason with inference components combined with a long-term memory component; they learn how to use these jointly. The long-term memory can be read and written to, with the goal of using it for prediction. We investigate these models in t…
ForecastQA creates a new QA task for event forecasting from text data.
We disprove the conjecture of M. Khovanov (math.QA/9908171) on the functoriality of his link homology with polynomial coefficients. This is in contrast to the case of integer coefficients, where functoriality was proved in math.GT/0206303 .
Existing machine reading comprehension (MRC) models do not scale effectively to real-world applications like web-level information retrieval and question answering (QA). We argue that this stems from the nature of MRC datasets: most of these are static environments wherein the supporting documents and all necessary inf…
Reduces test set maintenance effort by 80-100%.
Proposes PO-QA framework to optimize portfolios using quantum algorithms.
GenIE extracts structured text with fewer errors and more entities.
Beam search improves UQ in LLMs by reducing duplicates and variance.
QA-Token improves tokenization for noisy data, boosting model performance.
Question classification (QC) is the primary step of the Question Answering (QA) system. Question Classification (QC) system classifies the questions in particular classes so that Question Answering (QA) System can provide correct answers for the questions. Our system categorizes the factoid type questions asked in natu…
The paper proposes a new method to evaluate LLM agent responses using ECDF clustering.
This paper analyzes in details the Batalin-Vilkovisky quantization procedure for BF theories on n-dimensional manifolds and describes a suitable superformalism to deal with the master equation and the search of observables. In particular, generalized Wilson loops for BF theories with additional polynomial B-interaction…
Given an n-term L-infinity algebra L, we construct a Kan simplicial manifold which we think of as the 'Lie n-group' integrating L. This extends work of Getzler math.AT/0404003 . In the case of an ordinary Lie algebra, our construction gives the simplicial classifying space of the corresponding simply connect Lie group.…
New benchmark uncovers hidden biases in LLMs that refuse to answer certain queries.
The Poisson sigma model is a widely studied two-dimensional topological field theory. This note shows that boundary conditions for the Poisson sigma model are related to coisotropic submanifolds (a result announced in [math.QA/0309180]) and that the corresponding reduced phase space is a (possibly singular) dual pair b…
PortBench benchmarks LLMs for PM, revealing their weaknesses in diversification and robustness.
A pretrained LLM and its finetuned version can detect OOD data effectively.
Hallucinations in models are mislinked estimates, not errors.
In this paper, I will show that, if a Lie algebra $\G$ acts on a manifold , any solution of the classical Yang-Baxter equation on $\G$ gives arise to a Poisson tensor on and a torsion-free and flat contravariant connection (with respect to the Poisson tensor). Moreover, if the action is locally free, the matacur…
Mikhail Khovanov in math.QA/9908171 defined, for a diagram of an oriented classical link, a collection of groups numerated by pairs of integers. These groups were constructed as homology groups of certain chain complexes. The Euler characteristics of these complexes are coefficients of the Jones polynomial of the link.…
A D-Wave quantum annealer (QA) having a 2048 qubit lattice, with no missing qubits and couplings, allowed embedding of a complete graph of a Restricted Boltzmann Machine (RBM). A handwritten digit OptDigits data set having 8x7 pixels of visible units was used to train the RBM using a classical Contrastive Divergence. E…