Search Results for author:
Found 12 papers, 10 papers with code
Capability-aware Prompt Reformulation Learning for Text-to-Image Generation
Our in-depth analysis of these logs reveals that user prompt reformulation is heavily dependent on the individual user's capability, resulting in significant variance in the quality of reformulation pairs.
Scaling Laws For Dense Retrieval
In this study, we investigate whether the performance of dense retrieval models follows the scaling law as other neural models.
Query Augmentation by Decoding Semantics from Brain Signals
If the quality of the initially retrieved documents is low, then the effectiveness of query augmentation would be limited as well.
Constructing Tree-based Index for Efficient and Effective Dense Retrieval
Unfortunately, while ANN can improve the efficiency of DR models, it usually comes with a significant price on retrieval performance.
Disentangled Modeling of Domain and Relevance for Adaptable Dense Retrieval
By making the REM and DAMs disentangled, DDR enables a flexible training paradigm in which REM is trained with supervision once and DAMs are trained with unsupervised data.
Evaluating Interpolation and Extrapolation Performance of Neural Retrieval Models
For example, representation-based retrieval models perform almost as well as interaction-based retrieval models in terms of interpolation but not extrapolation.
Interpreting Dense Retrieval as Mixture of Topics
Dense Retrieval (DR) reaches state-of-the-art results in first-stage retrieval, but little is known about the mechanisms that contribute to its success.
Learning Discrete Representations via Constrained Clustering for Effective and Efficient Dense Retrieval
However, the efficiency of most existing DR models is limited by the large memory cost of storing dense vectors and the time-consuming nearest neighbor search (NNS) in vector space.
Jointly Optimizing Query Encoder and Product Quantization to Improve Retrieval Performance
Compared with previous DR models that use brute-force search, JPQ almost matches the best retrieval performance with 30x compression on index size.
Optimizing Dense Retrieval Model Training with Hard Negatives
ADORE replaces the widely-adopted static hard negative sampling method with a dynamic one to directly optimize the ranking performance.
Learning To Retrieve: How to Train a Dense Retrieval Model Effectively and Efficiently
Through this process, it teaches the DR model how to retrieve relevant documents from the entire corpus instead of how to rerank a potentially biased sample of documents.
RepBERT: Contextualized Text Embeddings for First-Stage Retrieval
Although exact term match between queries and documents is the dominant method to perform first-stage retrieval, we propose a different approach, called RepBERT, to represent documents and queries with fixed-length contextualized embeddings.
