Entity-GCN model answers multi-document questions by reasoning across documents.
problem Answering questions based on multiple documents and cross-document relations.
method Graph Convolutional Networks (GCNs) applied to a graph of mentions and their relations.
result Achieves state-of-the-art results on WikiHop dataset.
SemSentSum uses embeddings to link facts across documents efficiently.
problem Linking facts across documents is challenging due to language variability.
method Develops SemSentSum, a fully data-driven model using universal and domain-specific sentence embeddings to build a semantic relation graph.
result SemSentSum achieves competitive results on multi-document summarization tasks.
MARGE learns to reconstruct text by paraphrasing, achieving strong performance across multiple tasks.
problem Training sequence-to-sequence models with limited supervision.
method Unsupervised multi-lingual multi-document paraphrasing objective.
result Strong zero-shot performance on document translation and various tasks in multiple languages.
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.
problem Question answering biases in video QA datasets can lead to model overfitting and poor generalization.
method Analyzed popular video question answering datasets, conducted ablation studies on biases from annotators and question types.
result Pretrained language models can answer 37-48% questions correctly without multimodal context, far exceeding random guess baseline.
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…
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…
QuASE uses QA data to improve non-QA tasks like NER.
problem Can QA data help other NLP tasks?
method Proposes QuASE framework to learn sentence encodings from QA data.
result QuASE encodings improve downstream tasks like NER.
Study subjective perception of low light restored images and develop an unsupervised QA model.
problem Lack of subjective QA for low light restored images and challenges in collecting human opinion scores.
method Create a dataset, conduct subjective QA study, develop self-supervised contrastive learning technique to extract features.
result Unsupervised NR QA model achieves state-of-the-art performance for low light restored images.
EMR learns to read and remember from streaming data for QA.
problem Scalable QA from streaming data without knowing questions.
method End-to-end deep network model (EMR) with RL agent for memory management.
result EMR achieves significant improvements over existing methods on synthetic and real-world datasets.
EQD model improves domain-specific QA by 0.6% to 10.5%.
problem Challenges in domain-specific quantitative reasoning for LLMs.
method Two-step fine-tuning framework guided by a reward function.
result EQD outperforms state-of-the-art models and prompting strategies.
FinReflectKG benchmarks financial QA by linking relevant context from a financial KG, improving model performance and efficiency.
problem Efficiently retrieving and navigating relevant financial information across diverse sources and years.
method A benchmark built on a temporally indexed financial KG, generating QA pairs via pattern-specific prompts and quality control, evaluating retrieval scenarios.
result KG-guided retrieval yields substantial gains in correctness and token utilization, improving model performance by 24%.
Improved QA system by re-ranking top-10 results using machine learning.
problem Enhance deployed QA systems without re-training.
method Learn similarity function using n-gram features; implement neural sentence embeddings.
result Mean reciprocal rank improves by 9.15%.
Optimizes train schedules and maintenance using CP and QA.
problem Optimizing train schedules and maintenance considering constraints.
method Used Constraint Programming and Quantum Annealing to model and solve the problem.
result Both CP and QA approaches produce comparable results on real quantum computers.
Study explores D-Wave QA for RBM training, finds modest benefits but no significant improvements.
problem Improving RBM training using D-Wave quantum annealing.
method Hybrid sampling approach combining classical and D-Wave QA methods.
result No significant improvements in RBM training using D-Wave QA, but potential for CF mitigation.
Optimal query allocation improves extractive QA efficiency with LLMs.
problem Efficiency and reliability in extractive question answering with LLMs.
method Learning-to-Defer framework that allocates queries to specialized models.
result Enhanced answer reliability with reduced computational overhead.
Paper proposes a reinforcement learning framework for distant supervision of question parsing.
problem Lack of gold annotations for parsing in QA datasets.
method Reinforcement learning framework based on formal queries to learn mentions of entities and relations.
result Significant improvement in entity and relation linking compared to state of the art.
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.
problem Ensuring factual accuracy of AI-generated financial QA outputs.
method Developed a benchmark dataset and evaluated six detection methods under clean and noisy conditions.
result LLM-based judges and embedding methods perform best, but degrade under noisy conditions.
FinanceBench benchmarks LLMs on financial QA, revealing limitations.
problem Evaluating LLMs' performance on financial question answering.
method Developed a comprehensive test suite (FinanceBench) with 10,231 questions, tested 16 models, and manually reviewed answers.
result Existing LLMs have significant limitations for financial QA, especially GPT-4-Turbo.
A new framework evaluates LLM calibration in open-ended QA.
problem Evaluating LLM calibration in open-ended QA settings.
method Sem-ECE framework: sampling answers, grouping by semantic classes, and using frequencies as confidence.
result Sem-ECE estimators are unbiased and Sem2 achieves smaller calibration error. Interactive machine comprehension models learn through seeking relevant information.
problem Existing MRC models struggle with real-world applications due to static datasets.
method Reframe MRC datasets as interactive, partially observable environments.
result Interactive models can seek relevant information through sequential decision making.
Developed a message-passing algorithm for simulating nonstoquastic Hamiltonians in quantum annealing.
problem Challenges in simulating nonstoquastic Hamiltonians in quantum annealing.
method Message-passing algorithm using a time-dependent Hamiltonian.
result Validated the algorithm's performance through comparison to the replica method.
This paper has been withdrawn since it is identical to the paper math.QA/0601267. It was posted by mistake.
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…
Enhances relational reasoning with multi-layer architecture.
problem Limited relational reasoning with shallow architectures.
method Multi-layer relation network architecture.
result Solved all 20 tasks in bAbI 20 QA dataset.
Automated system extracts medication regimens from medical conversations.
problem Extract relevant medication information from medical conversations.
method QA task approach, combined QA and Information Extraction, data augmentation, public embeddings, pretraining.
result Improved accuracy in extracting dosage and frequency from 54.28 and 37.13 to 89.57 and 45.94.
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.
problem Forecasting future events from unstructured text data.
method Formulated a restricted-domain, multiple-choice QA task for event forecasting.
result Best model achieves 60.1% accuracy, lagging behind human performance by about 19%
LSTM network aids intent classification in QA.
problem Classifying intent in question-answering.
method Used LSTM architecture for intent classification.
result Effective and efficient intent classification achieved.
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 .
Paper investigates neural query graph ranking for complex question answering over knowledge graphs.
problem Improving neural models for complex question answering over knowledge graphs.
method Experimented with six ranking models, proposed a self-attention based slot matching model.
result Proposed model outperforms other models on DBpedia QA datasets.
We introduce a method to learn a mixture of submodular "shells" in a large-margin setting. A submodular shell is an abstract submodular function that can be instantiated with a ground set and a set of parameters to produce a submodular function. A mixture of such shells can then also be so instantiated to produce a mor…
Reduces test set maintenance effort by 80-100%.
problem Lack of proper and up-to-date test sets in real-world scenarios.
method Simple technique to reduce labeling effort.
result Significant reduction in test set maintenance effort (80-100%).
Proposes PO-QA framework to optimize portfolios using quantum algorithms.
problem Optimizing investment portfolios with reduced risk and increased gains.
method Develops a scalable quantum framework (PO-QA) to investigate quantum algorithm parameters.
result Identifies efficient quantum circuit configurations for portfolio optimization.
Beam search improves UQ in LLMs by reducing duplicates and variance.
problem Peaked distributions in multinomial sampling lead to duplicates and high variance in uncertainty estimates.
method Employ beam search to generate candidates for consistency-based UQ, providing a theoretical lower bound and empirical evaluation.
result Beam search achieves smaller error than multinomial sampling, leading to state-of-the-art UQ performance.
QA-Token improves tokenization for noisy data, boosting model performance.
problem Tokenization ignores data quality, limiting model effectiveness on noisy corpora.
method QA-Token combines signal quality with vocabulary construction through bilevel optimization and reinforcement learning.
result QA-Token achieves state-of-the-art performance on genomic and financial datasets.
The paper proposes a new method to evaluate LLM agent responses using ECDF clustering.
problem The standard evaluation of LLM agent responses via majority voting obscures response quality and distribution.
method The paper introduces a novel evaluation framework based on ECDF of cosine similarities and clustering of ECDFs using distances and k-medoids algorithm. result ECDF clustering reveals interpretable group structures in LLM responses, offering insights into agent settings.
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…
Hybrid QC system for Bengali questions using smart data balancing.
problem Classifying factoid questions in Bengali.
method Two-stage approach with 1D CNN for coarse classification and SGD for fine classification.
result Effectiveness of smart data balancing technique in improving classification accuracy.
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.…
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…
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among many remarkable properties, DPPs offer tractable algorithms for exact inference, including computing marginal probabilities and sampling; ho…
New benchmark uncovers hidden biases in LLMs that refuse to answer certain queries.
problem Evaluating fairness in LLMs, especially in sensitive applications.
method Silenced Bias Benchmark (SBB) using activation steering to reduce model refusals during QA.
result Exposes hidden unfair preferences in LLMs' latent space, distinguishing direct responses from underlying fairness issues.
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…