Paper presents a robust time-series retrieval method using segmental alignment.
problem Noise and local non-causal perturbations in time-series data.
method Joint segmentation and alignment of sequences using a modified pair-HMM with a new distance metric.
result Improved classification performance and robustness to noise.
Few-shot learning improves time-series forecasting with limited data.
problem Limited data in target tasks degrade forecasting performance.
method A few-shot learning method using recurrent neural networks with attention.
result The model forecasts future values effectively with minimal data.
PSEUDo learns patterns in multivariate time series with locality-sensitive hashing and relevance feedback.
problem Efficient pattern detection in large, multi-track sequential data with high variance and lack of ground truth.
method Query-aware locality-sensitive hashing for feature learning, sub-linear training and inference time.
result PSEUDo achieves sub-linear time efficiency for pattern modeling and comparison of 10,000 multivariate time series.
The process of collecting and organizing sets of observations represents a common theme throughout the history of science. However, despite the ubiquity of scientists measuring, recording, and analyzing the dynamics of different processes, an extensive organization of scientific time-series data and analysis methods ha…
FSNet improves online time series forecasting by balancing fast adaptation and old knowledge.
problem Online time series forecasting challenges in handling abrupt and recurring patterns.
method Inspired by CLS theory, FSNet uses a dynamic balance between fast adaptation and old knowledge retrieval.
result FSNet achieves robustness to both new and recurring patterns through dynamic balancing and associative memory.
kNN-MTS improves MTS forecasting by using nearest neighbor retrieval over a large dataset.
problem Limited ability of current MTS forecasting methods to identify similar patterns and handle sparsely distributed correlations.
method kNN-MTS framework using nearest neighbor retrieval over a large datastore of cached series, with representations from MTS model for similarity search.
result Significant improvement in forecasting performance on real-world datasets.
FinTMMBench benchmarks RAG systems for finance tasks across multiple data types and time periods.
problem Evaluating temporal-aware multi-modal retrieval augmented generation in finance.
method TMMHybridRAG method that converts and integrates data from various modalities and temporal information.
result Demonstrated effectiveness of TMMHybridRAG in diverse financial analysis tasks.
Model predicts Bitcoin's future movements using multimodal pattern matching.
problem Challenges in predicting Bitcoin's volatile future movements.
method Ranking similar past chart patterns given current chart information.
result Improves directional prediction of Bitcoin's future movements.
STanHop predicts multivariate time series with memory-enhanced capabilities.
problem Predicting multivariate time series with memory-enhanced capabilities.
method Sparse Tandem Hopfield Network (STanHop) with two external memory modules.
result STanHop outperforms dense Hopfield models in memory retrieval error.
MSIN model discovers relevant financial news for time series data.
problem Discovering relevant textual stories associated with numerical time series data.
method Joint learning of time series and text data using MSIN model.
result MSIN achieves up to 84.9% and 87.2% in recalling ground truth articles for two stock time series.
FinTradeBench benchmarks LLMs for financial reasoning combining company fundamentals and market signals.
problem Challenges in evaluating financial reasoning models for LLMs.
method Developed a benchmark integrating company fundamentals and trading signals, using a calibration-then-scaling framework.
result Clear performance gap between LLMs, retrieval improves reasoning over textual fundamentals but not trading signals.
Study on neural networks with non-normal interactions reveals unique spectral properties.
problem Understanding episodic memory encoding in the brain.
method Developed a neural network model with non-Hermitian couplings and applied random matrix theory.
result Spectral density of the model is non-uniform and can transition to chaos, providing computational benefits.
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%.
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.
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.
A new framework for personalized ad retrieval in e-commerce search.
problem Difficulty in measuring ads retrieved using multiple signals (e.g. user profiles, clicks).
method Employing historical click data to initialize a hierarchical network representing signals, keys, and ads. Training a model to learn weights of edges and selecting the best edges.
result Framework achieves good performance, improving RPM/CTR.
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.
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.
A framework that edits existing examples to generate structured outputs.
problem Generating complex outputs like code is hard.
method Retrieve a training example, edit it, and use a computationally efficient retrieval model.
result Retrieve-and-edit framework significantly boosts performance on code and card tasks.
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.
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.
New linear spectral estimators improve phase retrieval accuracy.
problem Recovering vectors from magnitude measurements.
method Linear Spectral Estimators (LSPEs) for phase retrieval.
result LSPEs provide accurate initialization vectors and sharp error bounds.
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.
The study examines the retrieval capabilities of RBMs and generalized Hopfield networks under various prior distributions.
problem Characterizing the state of RBMs and Hopfield networks under different prior distributions.
method Equivalence between RBMs and generalized Hopfield networks, analysis of phase transitions, and study of retrieval capabilities.
result The retrieval phase is robust and exists at low load for every pattern distribution.
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.
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.
Survey of large language models in financial prediction and trading.
problem Improving predictability and robustness of financial predictions and trading decisions.
method Task-centered taxonomy, review of empirical evidence, design patterns, benchmarks, and challenges analysis.
result Improved predictability and robustness of financial predictions and trading decisions through large language models.
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.
Volatility of intra-day stock market indices computed at various time horizons exhibits a scaling behaviour that differs from what would be expected from fractional Brownian motion (fBm). We investigate this anomalous scaling by using empirical mode decomposition (EMD), a method which separates time series into a set o…
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.
Tutorial on image retrieval techniques for beginners.
problem Efficient image retrieval methods for beginners.
method k-nearest neighbors and support vector machines.
result Provides a hands-on experience with image retrieval techniques.
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…
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.
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.
Improved text embeddings enhance retrieval from a knowledge base.
problem Efficiently retrieving relevant paragraphs from a large knowledge base.
method Used Stanford Question Answering Dataset (SQuAD) for open-domain question answering. Compared various text-embedding methods and trained deep residual neural models for retrieval.
result Training deep residual neural models for retrieval purposes significantly improves paragraph recall.
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.
Extends phase retrieval methods to handle sensing vector errors.
problem Phase retrieval with errors in sensing vectors.
method Total Least Squares (TLS) framework applied to gradient descent.
result Gradient descent can efficiently solve TLS phase retrieval.
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…
New method finds dependent subspaces of multiple views for better data retrieval.
problem Finding relationships between multiple data views for analysis and prediction.
method Optimizes mappings for each view to maximize cross-view similarity between neighborhoods of data samples.
result The method outperforms alternatives in preserving cross-view neighborhood similarities and detecting local dependencies.
OLS predictions are shown to be similar to attention mechanisms in models.
problem OLS in traditional statistics and econometrics.
method Rewriting OLS as an attention mechanism in a transformed space.
result OLS can be understood as minimizing squared prediction errors via optimal embedding and decoding.
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.
Bayesian models evaluate sentence comprehension, showing direct access model fits data better.
problem Evaluating models of retrieval in sentence comprehension.
method Implemented Bayesian hierarchical models to compare activation-based and direct access models.
result Direct access model fits data better than activation-based model.
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.
Capsule Networks improve clothing retrieval without landmark info.
problem In-shop clothing retrieval performance improvement.
method Triplet-based Capsule Network architecture with SC and RC blocks.
result Triplet Capsule Networks outperform FashionNet and SOTA architectures.
New tensor encodings improve retrieval accuracy in deep learning.
problem Deep learning classifiers flatten feature tensors, losing multi-linear structure.
method Proposes structured tensor factorization schemes for improved retrieval.
result Structured tensor encodings achieve retrieval performance similar to Fisher vectors.