A new deep learning model improves phase retrieval performance.
problem Recovering signals from phaseless measurements.
method Hybrid model-based data-driven deep architecture (Unfolded Phase Retrieval, UPR).
result Significant improvement in phase retrieval performance.
UPR hybrid model improves phase retrieval performance.
problem Recovering signals from phase-less measurements.
method Model-based data-driven deep architecture (UPR).
result UPR shows potential in improving phase retrieval.
Motivation: Public and private repositories of experimental data are growing to sizes that require dedicated methods for finding relevant data. To improve on the state of the art of keyword searches from annotations, methods for content-based retrieval have been proposed. In the context of gene expression experiments, …
New benchmark for non-rigid 3D human shape retrieval.
problem Distinguishing between body shapes of 3D human models.
method Extended benchmark with 145 new models and FAUST dataset.
result Improved comparison of 25 shape retrieval methods.
Combines deep learning and iterative methods for robust phase retrieval.
problem Recovering signals from noisy Fourier intensities.
method Regularization-by-denoising combining iterative phase retrieval and deep learning.
result Outperforms other noise-robust phase retrieval algorithms.
LeanDojo removes barriers to theorem proving with open-source tools and data.
problem Difficulty in reproducing and building on existing theorem proving methods.
method Introduces LeanDojo, an open-source Lean playground with toolkits, data, models, and benchmarks.
result ReProver, an LLM-based prover augmented with retrieval, outperforms non-retrieval baselines and GPT-4.
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 address the problem of retrieving relevant experiments given a query experiment, motivated by the public databases of datasets in molecular biology and other experimental sciences, and the need of scientists to relate to earlier work on the level of actual measurement data. Since experiments are inherently noisy and…
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.
On most sponsored search platforms, advertisers bid on some keywords for their advertisements (ads). Given a search request, ad retrieval module rewrites the query into bidding keywords, and uses these keywords as keys to select Top N ads through inverted indexes. In this way, an ad will not be retrieved even if querie…
The paper introduces subgraph nomination for finding similar subgraphs in networks.
problem Finding similar subgraphs in networks using example subgraphs.
method Formalizes subgraph nomination framework with user-supervised retrieval.
result User-supervised retrieval improves performance in subgraph nomination.
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.
Brain imaging analysis on clinically acquired computed tomography (CT) is essential for the diagnosis, risk prediction of progression, and treatment of the structural phenotypes of traumatic brain injury (TBI). However, in real clinical imaging scenarios, entire body CT images (e.g., neck, abdomen, chest, pelvis) are t…
Exemplar VAEs link generative models with nearest neighbor retrieval and data augmentation.
problem Improving generative model performance and data augmentation effectiveness.
method Exemplar VAEs with Parzen window prior, retrieval augmented training, exemplar leave-one-out, and subsampling.
result Generative data augmentation reduces classification error on MNIST and Fashion MNIST.
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…
Finding relationships between multiple views of data is essential both for exploratory analysis and as pre-processing for predictive tasks. A prominent approach is to apply variants of Canonical Correlation Analysis (CCA), a classical method seeking correlated components between views. The basic CCA is restricted to ma…
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 …
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.
New method uses image registration to recover complex signals from amplitude data.
problem Recovering complex-valued signals from amplitude measurements.
method Indirect registration using LDDMM formalism with exterior calculus.
result Algorithm performs well under various conditions including noise and topology.
Research on interference has provided evidence that the formation of dependencies between non-adjacent words relies on a cue-based retrieval mechanism. Two different models can account for one of the main predictions of interference, i.e., a slowdown at a retrieval site, when several items share a feature associated wi…
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.
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.
Deep learning tackles low-photon nanoscale holographic phase retrieval.
problem Low-photon imaging challenges at nanoscale.
method Dataset-free deep learning framework with physical model integration.
result Significantly improves signal recovery from higher noise levels.
S2M optimizes mining for diverse data subpopulations.
problem Scalability and uniformity in training sets with many labels and diverse data.
method Doubly-stochastic mining (S2M) computes per-example and minibatch losses on hardest labels/examples.
result S2M ensures good performance across all data subpopulations.
Study shows how anisotropic data affects learning dynamics in phase retrieval.
problem Understanding learning dynamics in phase retrieval with anisotropic Gaussian inputs.
method Developed a tractable reduction to reveal a three-phase trajectory and derived scaling laws.
result Found that anisotropy leads to a three-phase trajectory: fast escape, slow convergence, and spectral-tail learning.
New method retrieves most interfered samples for continual learning.
problem Challenges in continual learning with online data streams.
method Controlled sampling of most interfered samples for replay.
result Consistent gains in performance and reduced forgetting.
Topology-based information retrieval improves query accuracy.
problem Query accuracy in databases with complex structures.
method Dilation-invariant comparative measures of persistent homology.
result Topology-based retrieval outperforms standard methods.
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%.
New DNN boosts image retrieval efficiency.
problem Efficient compression of visual descriptors for large-scale image retrieval.
method Unsupervised multi-codebook quantization in a DNN architecture.
result Significantly outperforms existing methods on visual descriptor datasets.
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.
In this paper, we study ordered representations of data in which different dimensions have different degrees of importance. To learn these representations we introduce nested dropout, a procedure for stochastically removing coherent nested sets of hidden units in a neural network. We first present a sequence of theoret…
New model resolves signal ambiguities in ill-posed systems.
problem Signal retrieval from indirect measurements with known models.
method Variational generative model that captures signal distribution.
result Retrieves consistent signals with high fidelity.
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.
We introduce MosAIc, an interactive web app that allows users to find pairs of semantically related artworks that span different cultures, media, and millennia. To create this application, we introduce Conditional Image Retrieval (CIR) which combines visual similarity search with user supplied filters or "conditions". …
Study improves image-caption retrieval by quantifying feature and posterior uncertainty.
problem Improving reliability in image-caption retrieval tasks with deep learning models.
method Quantified feature and posterior uncertainty for model averaging and reliability measure in image-caption retrieval.
result Consistent improvement in retrieval performance with different datasets and architectures.
Generative AI improves stock selection by synthesizing features from diverse data sources.
problem Automating feature discovery in stock market data.
method Used large language models with retrieval-augmented generation and structured prompting to synthesize features from various data sources.
result AI-generated features consistently outperform baselines, with Sharpe improvements ranging from 14% to 91%.
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.
DeepPhaseCut uses neural networks to improve Fourier phase retrieval.
problem Fourier phase retrieval from magnitude data.
method Unsupervised feed-forward neural network with cycleGAN training.
result Outperforms existing methods in Fourier phase retrieval.
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.
Paper tackles phase retrieval with robust gradient descent for noisy data.
problem Recover signals from magnitude measurements with noise and corruption.
method Robust gradient descent applied to Wirtinger Flow algorithm.
result Improves algorithm's robustness to heavy-tailed noise and adversarial corruption.
Hashing, or learning binary embeddings of data, is frequently used in nearest neighbor retrieval. In this paper, we develop learning to rank formulations for hashing, aimed at directly optimizing ranking-based evaluation metrics such as Average Precision (AP) and Normalized Discounted Cumulative Gain (NDCG). We first o…
Financial Wind Tunnel generates versatile market data for model testing.
problem Inconsistent market dynamics across different scales and sources.
method Retrieval-augmented diffusion-based simulator integrating macro and micro patterns.
result Enhanced performance and adaptability of downstream models in complex markets.
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.
A new method, InfoGuide, improves automatic clustering analysis.
problem Lack of automatic clustering analysis frameworks.
method Capturing traces of information gain between clustering retrievals.
result InfoGuide can enable more automatic clustering analysis.
Study on InstaHide's security, linking to phase retrieval problem.
problem Security of InstaHide scheme for private dataset sharing.
method Design of a provable algorithm for private vector recovery.
result Private vectors can be recovered using synthetic vectors and public vectors.
GENRE retrieves entities autoregressively, improving efficiency and accuracy.
problem Retrieving entities from queries efficiently and accurately.
method Autoregressive generation of entity names, reducing memory footprint and improving context encoding.
result Significantly improved performance on entity disambiguation, linking, and retrieval tasks.