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.

169,042 papers · 148 categories

Trend · papers per month

112224335447 · Jun 202019922001200920172026
48 results for quantum information retrieval

Global stability bounds for matrix frames in phase retrieval problems.

problem Phase retrieval for matrix frames in various applications.
method Computable global stability bounds for the quasi-linear analysis map β, using Whitney stratification of positive semidefinite matrices of low rank.
result Novel conditions for a frame to be generalized phase retrievable.

New proof shows 11 measurements needed for phase retrieval in 4D complex space.

problem Determining the minimal number of intensity measurements for phase retrieval in 4D complex space.
method Leveraged characteristic classes and cohomology groups from differential topology.
result Proved that 11 is the exact minimum number of measurements required for phase retrieval in 4D complex space.

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.

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.

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 ↗

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 ↗

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.

We exhibit a Poisson module restoring a twisted Poincare duality between Poisson homology and cohomology for the polynomial algebra R=C[X_1,...,X_n] endowed with Poisson bracket arising from a uniparametrised quantum affine space. This Poisson module is obtained as the semiclassical limit of the dualising bimodule for …

2006-09-14abs ↗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.

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.

Qwant Research improves clinical case matching and information retrieval.

problem Matching and retrieving relevant clinical cases and discussions.
method Approach based on language models and preprocessings, information extraction system using neural networks and linguistic analysis.
result Very encouraging results in information extraction accuracy.

Improved regret bounds for bandit phase retrieval.

problem Minimizing cumulative and simple regret in a bandit phase retrieval problem.
method Proved minimax cumulative and simple regret bounds using adaptive algorithms.
result Minimax cumulative regret is ildeΘ(dn) ilde{\Theta}(d \sqrt{n}) and minimax simple regret is ildeΘ(d/n) ilde{\Theta}(d / \sqrt{n}).

New cooperative dynamics enhances retrieval performance in neural networks.

problem Understanding emergent computational capabilities in disordered systems.
method Leveraging statistical mechanics, extended neural network architecture for hetero-associative memory.
result Layers trained with less informative datasets develop retrieval regions of the same amplitude, leading to optimal performance.

Quantum machine learning classification depends on mutual informations between state and parameter spaces.

problem Generalization in quantum machine learning models.
method Link between quantum machine learning and quantum hypothesis testing, using mutual informations.
result Quantum classifier accuracy and generalization depend on mutual informations between state and parameter spaces.

Learning an encoding of feature vectors in terms of an over-complete dictionary or a information geometric (Fisher vectors) construct is wide-spread in statistical signal processing and computer vision. In content based information retrieval using deep-learning classifiers, such encodings are learnt on the flattened la…

2017-03-18abs ↗pdf ↗

We show that for any positive integer nn, the maps xCn{x,zi2}i=14nR4nx \in \mathbb{C}^n \mapsto \{\left|\langle x, z_i \rangle \right|^2\}_{i=1}^{4n} \in \mathbb{R}^{4n}, where ziz_i are the columns of four n×nn\times n unitary matrices, are generically injective modulo multiplication by a global phase factor, yielding a family of emb…

2013-06-05abs ↗pdf ↗

Lossy compression of statistical data using quantum annealing.

problem Efficiently compressing statistical floating-point data.
method Representation learning with binary variables, classical optimization of basis vectors, quantum annealing for coefficients, bias correction.
result Quantum annealing shows promising results with 3.5x better compression than neural-network autoencoders.

DeepTrust uses NLP to quickly identify and verify financial anomalies on Twitter.

problem Unreliable information in financial markets leading to unexpected price changes.
method Machine learning for anomaly detection, NLP for information retrieval and reliability assessment.
result DeepTrust outperforms baseline classifiers in identifying financial anomalies.

Adequate evaluation of an information retrieval system to estimate future performance is a crucial task. Area under the ROC curve (AUC) is widely used to evaluate the generalization of a retrieval system. However, the objective function optimized in many retrieval systems is the error rate and not the AUC value. This p…

2015-11-16abs ↗pdf ↗

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%.

Enhances hashing for fast retrieval with correlated bits.

problem Fast retrieval and small memory footprint for large-scale information retrieval.
method Employing Boltzmann machine distribution as variational posterior to model correlations among hash code bits.
result Significant performance gains achieved by effectively modeling correlations among hash code bits.

Near-optimal sample complexity for phase retrieval with generative priors.

problem Phase retrieval with magnitude-only measurements and sparse signals.
method Near-optimal sample complexity with i.i.d. Gaussian measurements and generative models.
result O(k log L) samples suffice for phase retrieval with generative priors.

This work proposes a new quantum neural network model and training algorithm.

problem Classical neural networks are computationally expensive, especially for tasks like image classification.
method Defines quantum neural networks via quantum time evolution and Hamiltonian, proposing a quantum backpropagation algorithm.
result Validated the proposed quantum backpropagation algorithm on the MNIST dataset using a quantum computer simulation.

InfoQGAN uses mutual information to improve QGANs, overcoming mode collapse and feature disentanglement issues.

problem Mode collapse and lack of feature control in QGANs.
method Integrates InfoGAN principles with variational quantum circuit, classical discriminator, and MINE for mutual information optimization.
result InfoQGAN effectively mitigates mode collapse and achieves robust feature disentanglement.

This paper functions as a tutorial for individuals interested to enter the field of information retrieval but wouldn't know where to begin from. It describes two fundamental yet efficient image retrieval techniques, the first being k - nearest neighbors (knn) and the second support vector machines(svm). The goal is to …

2016-08-12abs ↗pdf ↗

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.

Paper introduces RiskEmbed, a finetuned model for financial risk management.

problem Improving retrieval accuracy in financial question-answering systems.
method Curated dataset and finetuned BERT model for financial domain.
result RiskEmbed significantly outperforms general-purpose and financial embedding models.

The probability distribution function (PDF) for prices on financial markets is derived by extremization of Fisher information. It is shown how on that basis the quantum-like description for financial markets arises and different financial market models are mapped by quantum mechanical ones.

2015-04-15abs ↗pdf ↗