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

Trend · papers per month

255176101 · Jun 202019922001200920172026
48 results for relevancy

System detects relevant financial news and predictions from unstructured text.

problem Manual extraction of relevant financial information from news is cumbersome and error-prone.
method Topic modeling with LDA, co-reference resolution, multi-paragraph segmentation, and temporal analysis.
result ROUGE-L values for relevant text and predictions/forecasts were 0.662 and 0.982, respectively.

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.

The increasing occurrence of ordinal data, mainly sociodemographic, led to a renewed research interest in ordinal regression, i.e. the prediction of ordered classes. Besides model accuracy, the interpretation of these models itself is of high relevance, and existing approaches therefore enforce e.g. model sparsity. For…

2019-02-20abs ↗pdf ↗

We improve neural network explainability by bypassing batch normalization.

problem Lack of transparency in neural networks.
method Layer-wise Relevance Propagation with a method to include normalization layers.
result Heatmaps are more accurate for convolutional layers with our method.

Methodology to measure lag relevance in time series models.

problem Measuring lag relevance in machine learning models for univariate time series.
method Ghost variables, Shapley values, additive importance measures, auto-relevance and partial auto-relevance functions, one-step forecast.
result Calculated relevance measures successfully demonstrate expected lag structure in almost all cases.

Improves relevancy of black-box anomaly detectors with user feedback.

problem Users often ignore many detected anomalies, requiring a method to identify and prioritize relevant ones.
method Uses user feedback to adjust anomaly selection process based on identified anomaly types.
result Significant improvements in precision and recall over various anomaly detectors.

Recommender systems, medical diagnosis, network security, etc., require on-going learning and decision-making in real time. These -- and many others -- represent perfect examples of the opportunities and difficulties presented by Big Data: the available information often arrives from a variety of sources and has divers…

2015-02-05abs ↗pdf ↗

In this paper, we tackle the problem of explanations in a deep-learning based model for recommendations by leveraging the technique of layer-wise relevance propagation. We use a Deep Convolutional Neural Network to extract relevant features from the input images before identifying similarity between the images in featu…

2018-07-17abs ↗pdf ↗

Dimensional reduction of high dimensional data can be achieved by keeping only the relevant eigenmodes after principal component analysis. However, differentiating relevant eigenmodes from the random noise eigenmodes is problematic. A new method based on the random matrix theory and a statistical goodness-of-fit test i…

2008-12-25abs ↗pdf ↗

Pixel-wise relevance method shows how CNNs classify faces, varying across datasets and tasks.

problem Interpreting black-box CNN face recognition models.
method Layer-wise relevance propagation (LRP) applied to VGG-16 models trained for face recognition.
result Relevance maps are generally stable across random initializations and tasks, but less so across pretraining datasets.

The paper revisits and improves on a Bayesian relevance vector machine method for small sample sizes.

problem Statistical modeling with small sample sizes relative to the number of covariates.
method Introduces a new class of global-local priors and provides theoretical properties.
result Results on posterior consistency and contraction rates are provided.

Proposes UICR to improve novelty in recommendation systems without sacrificing relevance.

problem Balancing relevance and novelty in recommendation systems is challenging, especially for long-tail items.
method Introduces uncertainty modeling in the matching stage and multi-task modeling of model and index uncertainty.
result Improves novelty without sacrificing relevance, as shown by experimental results and online A/B tests.

Sparse GEMINI selects relevant features for clustering without assumptions.

problem Feature selection in clustering with relevant clusters and variables.
method Discriminative clustering model maximizing GEMINI with l1 penalty.
result Sparse GEMINI selects relevant subsets of variables without prior hypotheses.

In many applications, it is desirable to extract only the relevant aspects of data. A principled way to do this is the information bottleneck (IB) method, where one seeks a code that maximizes information about a 'relevance' variable, Y, while constraining the information encoded about the original data, X. Unfortunate…

2016-05-24abs ↗pdf ↗

PRI-VAE learns disentangled representations by optimizing principle-of-relevant-information.

problem Learning disentangled representations under VAE framework remains unknown.
method Proposes PRI-VAE, a novel learning objective to optimize disentanglement.
result Demonstrates effectiveness of PRI-VAE on four benchmark datasets.

This study combines two different learning paradigms, k-nearest neighbor (k-NN) rule, as memory-based learning paradigm and relevance vector machines (RVM), as statistical learning paradigm. This combination is performed in kernel space and is called k-relevance vector (k-RV). The purpose is to improve the performance …

2019-09-18abs ↗pdf ↗

New local MDI variable importances derived from global scores match Shapley values.

problem Local feature relevance in tree-based models.
method Deriving local MDI importance measure from global scores and linking it to Shapley values.
result Local MDI importances have a natural connection with Shapley values.

The relevance of data quantifies learning efficiency.

problem Understanding the statistical nature of high-dimensional, sparse data.
method Defining relevance as information content, and using it to define ideal limits of samples and learning machines.
result Maximally informative samples and optimal learning machines exhibit critical features like power-law frequency distributions and anomalously large susceptibility.

SADCBO optimizes contextual variables by balancing relevance and cost.

problem Optimizing contextual variables with varying costs and unknown relevance.
method Adaptive selection of relevant contextual variables using sensitivity analysis and early stopping.
result Consistent improvement in optimization across various examples.

InteractionNet models noncovalent protein-ligand interactions with GNNs and explains predictions.

problem Modeling noncovalent protein-ligand interactions with graph neural networks.
method InteractionNet uses a GNN architecture with separated covalent and noncovalent convolution layers and layer-wise relevance propagation for explainability.
result InteractionNet successfully predicts noncovalent protein-ligand interactions with chemical relevance.

In machine learning, the choice of a learning algorithm that is suitable for the application domain is critical. The performance metric used to compare different algorithms must also reflect the concerns of users in the application domain under consideration. In this work, we propose a novel probability-based performan…

2013-03-28abs ↗pdf ↗

Human analysts that use anomaly detection systems in practice want to retain the use of simple and explainable global anomaly detectors. In this paper, we propose a novel human-in-the-loop learning algorithm called GLAD (GLocalized Anomaly Detection) that supports global anomaly detectors. GLAD automatically learns the…

2018-10-02abs ↗pdf ↗

Proposes a new hyperprior and predictive criterion for weakly informative hyperprior in relevance vector machine.

problem Capturing non-homogeneous data structure with limited kernel functions.
method Uses inverse gamma hyperprior with a shape parameter close to zero and a scale parameter not close to zero. Applies multiple kernel method with different widths. Proposes extended predictive information criterion for scale parameter selection.
result Obtains a multiple kernel relevance vector regression model with good predictive accuracy.