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

5.6%11.1%16.7%22.2% · Apr 199619922001200920172026
48 results for Anisotropic Information Retrieval

SpecGD mitigates misalignment in phase retrieval models with anisotropic inputs.

problem Misalignment during gradient descent in phase retrieval models with anisotropic inputs.
method Spectral gradient descent modifies gradient updates to preserve directional information and remove spike amplification.
result SpecGD removes spike amplification, leading to stable alignment and accelerated noise contraction.

Paper explains how early stopping helps distillation in overparameterized neural networks.

problem Understanding how overparameterized neural networks can improve with early stopping.
method Introducing Anisotropic Information Retrieval (AIR) to justify early stopping in distillation.
result Self-distillation algorithm improves over just early stopping, leading to better generalization.

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.

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.

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.

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.

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 ↗

Paper solves Minkowski problem for anisotropic p-torsional rigidity.

problem Solving the Minkowski problem for anisotropic p-torsional rigidity.
method Using the anisotropic pp-Laplacian equation, presenting sufficient and necessary conditions for existence.
result Presented sufficient and necessary conditions for the existence of a solution.

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.

In this paper, we study the anisotropic Minkowski problem. It is a problem of prescribing the anisotropic Gauss-Kronecker curvature for a closed strongly convex hypersurface in Euclidean space as a function on its anisotropic normals in relative or Minkowski geometry. We first formulate such problem to a Monge-Ampére t…

2012-03-06abs ↗pdf ↗

Motivated by the study of wave fronts in anisotropic media, we propose an incidence geometry of anisotropic spheres in a Finsler-Minkowski space. An anisotropic version of the Laguerre functional is considered. In some circumstances, this functional can be used to determine that two wavefronts observed at distinct time…

2014-03-31abs ↗pdf ↗

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 ↗

We introduce the anisotropic tensor calculus, which is a way of handling with tensors that depend on the direction remaining always in the same class. This means that the derivative of an anisotropic tensor is a tensor of the same type. As an application, we show how to define derivations using anisotropic linear conne…

2016-02-17abs ↗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.

Study anisotropic flow for capillary hypersurfaces, proving new inequalities.

problem Anisotropic capillary hypersurfaces and their properties.
method Anisotropic volume-preserving mean curvature flow, new approach for strictly convex initial hypersurfaces.
result Established new Alexandrov-Fenchel inequalities for strictly convex anisotropic capillary hypersurfaces.

In this note, we give a classification of complete anisotropic isoparametric hypersurfaces, i.e., hypersurfaces with constant anisotropic principal curvatures, in Euclidean spaces, which is in analogue with the classical case for isoparametric hypersurfaces in Euclidean spaces. On the other hand, by an example of local…

2010-08-11abs ↗pdf ↗

Graphs with bounded anisotropic mean curvature are regular almost everywhere.

problem Understanding the regularity of graphs with anisotropic mean curvature.
method Proving regularity for mm-dimensional Lipschitz graphs with anisotropic mean curvature bounded in LpL^p.
result Graphs with bounded anisotropic mean curvature are regular almost everywhere.

We study surfaces with constant anisotropic mean curvature which are invariant under a helicoidal motion. For functionals with axially symmetric Wulff shapes, we generalize the recently developed twizzler representation of Perdomo to the anisotropic case and show how all helicoidal constant anisotropic mean curvature s…

2010-10-07abs ↗pdf ↗

The study finds anisotropic minimal surfaces in 3-manifolds with smooth boundaries.

problem Finding smooth anisotropic minimal surfaces in closed 3-manifolds.
method Min-max construction with elliptic integrands, uniform upper bound for density ratios.
result Obtains a smooth anisotropic minimal surface in a closed 3-manifold.