Research
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,742 papers · 148 categories

Trend · papers per month

0.5%1.0%1.5%1.9% · Dec 201719922001200920172026
48 results for long-distance retrieval

Improves retrieval accuracy for hierarchical documents, especially for distant matches.

problem Limited expressive power of dual encoder models in hierarchical retrieval.
method Proves feasibility of DEs for HR, introduces pretrain-finetune recipe to improve long-distance retrieval.
result Pretrain-finetune boosts recall on long-distance pairs from 19% to 76%.

HighwayGraph models long-distance node relations in GNNs with improved performance.

problem Limited-layer information propagation in GNNs hinders long-distance node relation modeling.
method Proposes two solutions: implicit and explicit modeling of long-distance node relations using shallow GNN architectures and a self-training framework.
result HighwayGraph achieves consistent and significant improvements over four GNNs on three benchmark datasets.

Physics: Similar long-distance properties can mask vastly different short-distance metrics.

problem Classifying homogeneous metrics on group manifolds by long-distance properties.
method Apply universality concept to geometry, focusing on metrics on Lie groups.
result Many metrics on low-dimensional Lie groups have similar long-distance properties despite differing short-distance properties.

We consider the task of detecting regulatory elements in the human genome directly from raw DNA. Past work has focused on small snippets of DNA, making it difficult to model long-distance dependencies that arise from DNA's 3-dimensional conformation. In order to study long-distance dependencies, we develop and release …

2017-10-03abs ↗pdf ↗

Machine learning can help us in solving problems in the context big data analysis and classification, as well as in playing complex games such as Go. But can it also be used to find novel protocols and algorithms for applications such as large-scale quantum communication? Here we show that machine learning can be used …

2019-04-24abs ↗pdf ↗

Distributed securities exchanges may become de facto fragmented if they span geographical regions with asymmetric computer infrastructure. First, we build an economic model of a decentralized exchange with two miner clusters, standing in for compact areas of economic activity (e.g., cities). "Local" miners in the area …

2019-10-24abs ↗pdf ↗

Develops a combinatorial semi-bandit method for electric vehicle charging station selection.

problem Long-distance navigation for BEVs with unknown charging station availability and performance.
method Combinatorial semi-bandit framework, pre-processing road network, Bayesian modeling, Thompson Sampling, BayesUCB, Epsilon-greedy.
result Demonstrates improved navigation performance on long-distance BEV charging station selection.

Summarization of long sequences into a concise statement is a core problem in natural language processing, requiring non-trivial understanding of the input. Based on the promising results of graph neural networks on highly structured data, we develop a framework to extend existing sequence encoders with a graph compone…

2018-11-05abs ↗pdf ↗

This paper improves image retrieval accuracy through novel relevance feedback methods.

problem Improving image retrieval accuracy in Content-Based Image Retrieval (CBIR).
method Novel addition to feature re-weighting and classification techniques, focusing on 0-th iteration improvement.
result Significantly improved retrieval accuracy from relevance feedback.

We propose a new statistical model suitable for machine learning of systems with long distance correlations such as natural languages. The model is based on directed acyclic graph decorated by multi-linear tensor maps in the vertices and vector spaces in the edges, called tensor network. Such tensor networks have been …

2017-10-27abs ↗pdf ↗

Transformer models improve query-document retrieval efficiency and accuracy.

problem Efficiently retrieve relevant documents from large corpora for query matching.
method Designed paragraph-level pre-training tasks to optimize embedding-based Transformer models.
result Transformer models significantly outperform BM-25 and non-Transformer embedding models.

Introduces MPR to measure and optimize representation across intersectional groups in retrieval.

problem Harmful stereotypes, cultural erasure, and social disparities in image search and retrieval.
method Develops MPR metric, practical estimation methods, theoretical guarantees, and optimization algorithms.
result Optimizing MPR yields more proportional representation across multiple intersectional groups, often with minimal retrieval accuracy compromise.

GMC benchmark isolates retrieval in Transformers, revealing max-margin alignment.

problem Understanding how Transformers develop match-and-copy behavior on natural data.
method Introducing Gaussian Match-and-Copy (GMC) as a minimalist benchmark.
result Gradient descent drives parameters to diverge while aligning with max-margin separator.

BERT model improves cross-lingual document retrieval.

problem Improving cross-lingual information retrieval between English queries and foreign documents.
method Introduced a deep relevance matching model based on BERT, trained with weak supervision using CLIR data.
result Model outperforms competitive baseline approaches in retrieving Lithuanian documents against short English queries.

Sharp asymptotics derived for phase retrieval and compressed sensing with random generative priors.

problem Phase retrieval and compressed sensing with random measurement matrices.
method Sharp asymptotics derived for optimal performance and polynomial algorithm for random generative priors.
result Compressed phase retrieval becomes tractable with random generative priors, unlike sparse priors.

Most content-based image retrieval systems consider either one single query, or multiple queries that include the same object or represent the same semantic information. In this paper we consider the content-based image retrieval problem for multiple query images corresponding to different image semantics. We propose a…

2014-02-21abs ↗pdf ↗

For the task of generating complex outputs such as source code, editing existing outputs can be easier than generating complex outputs from scratch. With this motivation, we propose an approach that first retrieves a training example based on the input (e.g., natural language description) and then edits it to the desir…

2018-12-04abs ↗pdf ↗

pLSTM tackles long-range language modeling and computer vision tasks with parallelizable linear source transition mark networks.

problem Challenges of existing recurrent architectures in handling sequences and multi-dimensional data.
method Introduces pLSTM, a parallelizable linear source transition mark network for linear graphs and DAGs, addressing vanishing/exploding activation/gradient issues.
result pLSTM outperforms Transformers in long-range tasks like arrow-pointing extrapolation and image size extrapolation.

HybridRAG combines KGs and vector retrieval for financial document Q&A.

problem Challenges in extracting and interpreting financial text data.
method Integrates Knowledge Graphs and Vector Retrieval Augmented Generation.
result HybridRAG outperforms traditional methods in Q&A systems for financial documents.

This paper improves retrieval for LLMs in financial document Q&A.

problem Suboptimal text chunk retrieval by RAG causes inaccuracies in LLM responses.
method Sophisticated chunking techniques, query expansion, metadata annotations, re-ranking algorithms, and embedding fine-tuning.
result Enhanced retrieval quality improves LLM performance and reliability.

Sharp upper bounds found for solutions of a specific equation on Riemannian manifolds.

problem Finding upper bounds for solutions of a specific equation on Riemannian manifolds.
method Proved sharp upper estimates of weak subsolutions to the Leibenson equation on Riemannian manifolds with non-negative Ricci curvature.
result Improved and proved a conjecture about upper bounds for solutions of the Leibenson equation.

We study the task of retrieving relevant experiments given a query experiment. By experiment, we mean a collection of measurements from a set of `covariates' and the associated `outcomes'. While similar experiments can be retrieved by comparing available `annotations', this approach ignores the valuable information ava…

2014-02-19abs ↗pdf ↗

DINOSAUR improves retrieval by accounting for embedding uncertainty in recommender systems.

problem Retrieval bias towards popular items due to noisy embeddings.
method Samples multiple embeddings per item and queries with sampled embeddings to account for uncertainty.
result Improves coverage of long-tail niche content without sacrificing recall.

Study compares methods for improving document retrieval accuracy.

problem Improving document retrieval accuracy from large corpora.
method Comparison of query expansion, topic models, and active learning.
result Active learning outperforms keyword lists in most settings.

RNNs struggle with in-context retrieval, while Transformers excel.

problem In-context retrieval capability of RNNs.
method Theoretical analysis and experimental techniques (CoT, RAG, Transformer layer).
result Enhancing RNNs with techniques improves their in-context retrieval capability, closing the representation gap with Transformers.

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.

Enhanced Hopfield model boosts memory retrieval capacity.

problem Memory retrieval in modern Hopfield models with limited capacity.
method Introduces a learnable feature map transforming energy function into kernel space, minimizing separation loss for uniform memory distribution.
result Significant reduction in metastable states, enhancing memory capacity and retrieval accuracy.

Phase retrieval refers to the problem of recovering real- or complex-valued vectors from magnitude measurements. The best-known algorithms for this problem are iterative in nature and rely on so-called spectral initializers that provide accurate initialization vectors. We propose a novel class of estimators suitable fo…

2018-06-09abs ↗pdf ↗

We present a case-study demonstrating the usefulness of Bayesian hierarchical mixture modelling for investigating cognitive processes. In sentence comprehension, it is widely assumed that the distance between linguistic co-dependents affects the latency of dependency resolution: the longer the distance, the longer the …

2017-02-02abs ↗pdf ↗

Paper proposes SAN and SN for zero-shot sketch-based image retrieval.

problem Handling unseen classes in sketch-based image retrieval.
method Generative approach using Stacked Adversarial Network (SAN) and Siamese Network (SN).
result Significant improvement in standard and generalized ZSL settings.