Visual reranking is effective to improve the performance of the text-based video search. However, existing reranking algorithms can only achieve limited improvement because of the well-known semantic gap between low level visual features and high level semantic concepts. In this paper, we adopt interactive video search…
On-device research index
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.
168,695 papers · 148 categories
Trend · papers per month
18 results for “reranker”
BTZSC benchmarks zero-shot text classification across diverse models.
problem Systematically comparing zero-shot text classification across various models.
method Comprehensive benchmark of 22 datasets, comparing NLI cross-encoders, embedding models, rerankers, and instruction-tuned LLMs.
result Rerankers and instruction-tuned LLMs outperform NLI cross-encoders, with rerankers setting a new state-of-the-art.
The paper applies communication theory to improve language model reranking.
problem Ensuring safety and accuracy in language model outputs.
method Drawing parallels between communication theory and language model reranking, the authors propose a protocol to improve reliability.
result The proposed protocol can achieve asymptotically error-free performance in noisy communication scenarios.
Ricci-Filtration enhances retrieval-augmented generation rerankers for query-answer tasks by using discrete Ricci flow on graphs.
problem Improving retrieval-augmented generation rerankers for query-answer tasks.
method Discrete Ricci flow on graphs to evaluate structural importance of chunks.
result Ricci-Filtration outperforms baseline methods in accuracy, precision, recall, and F1 scores.
The top word list, i.e., the top-M words with highest marginal probability in a given topic, is the standard topic representation in topic models. Most of recent automatical topic labeling algorithms and popular topic quality metrics are based on it. However, we find, empirically, words in this type of top word list ar…
Learning-to-rank techniques have proven to be extremely useful for prioritization problems, where we rank items in order of their estimated probabilities, and dedicate our limited resources to the top-ranked items. This work exposes a serious problem with the state of learning-to-rank algorithms, which is that they are…
Global constraints and reranking have not been used in cognates detection research to date. We propose methods for using global constraints by performing rescoring of the score matrices produced by state of the art cognates detection systems. Using global constraints to perform rescoring is complementary to state of th…
Alteration Detection of Tensor Dependence Structure via Sparsity-Exploited Reranking Algorithmstat.ME
New algorithm detects tensor dependence structure alterations efficiently.
problem Detecting alterations in tensor dependence structures.
method Tensor-normal distributions, decorrelation, centralization, SERA (Sparsity-Exploited Reranking Algorithm).
result The proposed SERA algorithm controls false discovery rates effectively.
Paper develops a model for verifying facts in tables without pre-retrieved evidence.
problem Verification of factual claims in structured data, especially in open-domain settings.
method Joint reranking-and-verification model that fuses evidence documents.
result Model achieves comparable performance to closed-domain state-of-the-art on TabFact dataset.
VERAFI improves financial AI by verifying calculations and compliance.
problem Financial AI systems generate errors and violations during reasoning.
method VERAFI combines dense retrieval, reranking, and automated reasoning policies.
result VERAFI achieves 94.7% factual correctness, 81% relative improvement.
As in many other scientific domains, we face a fundamental problem when using machine learning to identify proteins from mass spectrometry data: large ground truth datasets mapping inputs to correct outputs are extremely difficult to obtain. Instead, we have access to imperfect hand-coded models crafted by domain exper…
IAL uses interactive learning to improve model performance with minimal human feedback.
problem Overfitting and high human interaction cost in training neural networks.
method IAL framework with NAP attention generator and reranking algorithm.
result IAL significantly outperforms baselines with less retraining and human interaction.
Coupled Representation Learning for Domains, Intents and Slots in Spoken Language Understandingcs.CL
Representation learning is an essential problem in a wide range of applications and it is important for performing downstream tasks successfully. In this paper, we propose a new model that learns coupled representations of domains, intents, and slots by taking advantage of their hierarchical dependency in a Spoken Lang…
iPrompt uses LLMs to generate natural-language explanations of data patterns.
problem Finding and explaining patterns in data using natural language.
method Interpretable autoprompting (iPrompt) that generates natural-language explanations based on LLMs.
result iPrompt can accurately find and explain data patterns, improving upon human-written prompts.
HabitatAgent offers a multi-agent system for transparent housing consultation.
problem Opaque reasoning and brittle multi-constraint handling in housing recommendation systems.
method HabitatAgent is a multi-agent architecture with specialized roles for memory, retrieval, generation, and validation.
result HabitatAgent achieves 95% accuracy in real user consultation scenarios, significantly outperforming a strong baseline.
EBR improves NMT by re-ranking samples drawn from MLE-trained models.
problem Discrepancy between MLE and BLEU score in neural machine translation.
method Train an energy-based model to mimic BLEU score, then use it for re-ranking.
result EBR consistently improves NMT performance by +4 BLEU points on IWSLT'14 German-English.
Deep Retrieval learns a retrievable structure for efficient large-scale recommendations.
problem Efficiently retrieving top relevant candidates in large-scale recommendation systems.
method Deep Retrieval learns a retrievable structure directly from user-item interaction data, encoding candidates into a discrete latent space and optimizing a model to maximize accuracy.
result Deep Retrieval achieves almost the same accuracy as brute-force baseline and significantly outperforms ANN baselines in a live production system.
ACFS optimizes spectral risk under decision-dependent uncertainty using adaptive forest sampling.
problem Minimizing spectral risk with decision-dependent uncertainty.
method ACFS integrates Generalised Random Forests, CEM-guided exploration, rank-weighted augmentation, and multi-start refinement.
result ACFS achieves lowest median oracle spectral risk on both benchmarks.