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

82164245327 · Jun 202019922001200920172026
48 results for relevance weighting

The paper develops a decision support system for hierarchical text classification of conference proceedings.

problem Classifying documents with a fixed hierarchical structure of topics.
method Developed a weighted hierarchical similarity function to calculate topic relevance, using entropy of words to estimate weights.
result The weighted hierarchical similarity function improves ranking accuracy compared to other methods.

HydaLearn dynamically adjusts task weights for better MTL performance.

problem Constant loss weights in MTL lead to poor results due to drifting relevance and varying mini-batch composition.
method HydaLearn uses mini-batch gradients to dynamically adjust task weights.
result HydaLearn improves performance on synthetic and real-world data.

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.

Elliptical Attention improves transformer performance by focusing on contextually relevant features.

problem Transformer models suffer from representation collapse and are vulnerable to contaminated samples.
method Uses Mahalanobis distance to define hyper-ellipsoidal neighborhoods for attention weights.
result Elliptical Attention reduces representation collapse and enhances model robustness.

We design an optimal strategy for investment in a portfolio of assets subject to a multiplicative Brownian motion. The strategy provides the maximal typical long-term growth rate of investor's capital. We determine the optimal fraction of capital that an investor should keep in risky assets as well as weights of differ…

1998-01-23abs ↗pdf ↗

Neural networks with learned biases can approximate any function.

problem Whether neural networks with only learned biases can approximate any continuous function.
method Theoretical and numerical analysis of random weights and learned biases in neural networks.
result Feedforward and recurrent neural networks with random weights can approximate any continuous function and dynamical systems.

Neural network framework for language recognition considers sequence information and improves accuracy.

problem Challenging task of automatic language identification in noisy conditions.
method Proposes a neural network framework with bidirectional LSTM and attention modeling for relevance weighting.
result Significant improvements over conventional methods in noisy conditions and multi-speaker speech.

A common strategy for sparse linear regression is to introduce regularization, which eliminates irrelevant features by letting the corresponding weights be zeros. However, regularization often shrinks the estimator for relevant features, which leads to incorrect feature selection. Motivated by the above-mentioned issue…

2015-09-03abs ↗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.

PAMA learns covariate importance for better matching in observational studies.

problem Poor performance of conventional matching methods when covariates differ in relevance.
method PAMA is a semi-supervised framework that learns covariate importance from paired data and optimizes a weighted quadratic score.
result PAMA outperforms standard methods, particularly in high-dimensional settings and under model misspecification.

We consider the transfer of experience samples (i.e., tuples < s, a, s', r >) in reinforcement learning (RL), collected from a set of source tasks to improve the learning process in a given target task. Most of the related approaches focus on selecting the most relevant source samples for solving the target task, but t…

2018-05-28abs ↗pdf ↗

We introduce a natural extension of the concept of gradient Ricci soliton: the Ricci almost soliton. We provide existence and rigidity results, we deduce a-priori curvature estimates and isolation phenomena, and we investigate some topological properties. A number of differential identities involving the relevant geome…

2010-03-15abs ↗pdf ↗

Data sets for fairness relevant tasks can lack examples or be biased according to a specific label in a sensitive attribute. We demonstrate the usefulness of weight based meta-learning approaches in such situations. For models that can be trained through gradient descent, we demonstrate that there are some parameter co…

2019-11-06abs ↗pdf ↗

Establishes Yau-Tian-Donaldson conjecture for weighted metrics.

problem Constant scalar curvature Kähler metrics on polarized projective manifolds.
method Extends Chi Li's work to weighted case, uses a priori estimates and slope formulas.
result Proves Yau-Tian-Donaldson conjecture for weighted extremal Kähler metrics.

Paper proposes fully Bayesian approach for RVM classification, improving accuracy especially in imbalanced data.

problem Difficulty in conducting RVM classification due to lack of closed-form solution for weight parameter posterior.
method Proposes Generic Bayesian and Fully Bayesian approaches with hierarchical hyperprior structure.
result Improves classification performance, especially in imbalanced data.

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 ↗

Heuristic weighting improves denoising score matching without requiring noise distribution assumptions.

problem Improving denoising score matching without assuming noise distribution.
method Demonstrated heteroskedasticity, derived optimal weighting functions, and provided theoretical and empirical comparisons.
result Heuristical weighting function can achieve lower variance than optimal weighting, facilitating more stable and efficient training.

This paper introduces a method to select and weight pretext tasks for better self-supervised speech representation learning.

problem Combining pretext tasks for better performance in self-supervised speech representation learning.
method Estimating calibrated weights for partial losses corresponding to pretext tasks during self-supervised training.
result Groups of selected and weighted pretext tasks perform better than classic baselines in automatic speech recognition and speaker/emotion recognition.

Unified approach to linear regression using covariance fitting for optimal weights.

problem Finding optimal weights for linear regression models when weights are unknown.
method Covariance fitting SPICE-methodology to obtain data-adaptive weights.
result Tuned versions of known regularized estimators are unified under a common approach.

In this paper we show how techniques coming from stochastic analysis, such as stochastic completeness (in the form of the weak maximum principle at infinity), parabolicity and LpL^p-Liouville type results for the weighted Laplacian associated to the potential may be used to obtain triviality, rigidity results, and scal…

2009-05-18abs ↗pdf ↗

N-BEATS-MOE improves time series forecasting by adapting to series characteristics.

problem Forecasting heterogeneous time series with varying characteristics.
method Mixture-of-Experts layer with dynamic block weighting.
result Consistent improvements across 12 benchmark datasets, especially for heterogeneous series.

Introduces Exponentially Weighted Signature for better path representation.

problem Uniform treatment of historical information in signatures.
method Generalizes EFM signature to bounded linear operators, enabling contextualised temporal weighting.
result EWS is the unique solution to a linear controlled differential equation and generalizes state-space models.

The paper proves a Harnack inequality for heat equations on Finsler metric measure manifolds.

problem Proving a Harnack inequality for positive solutions to heat equations on Finsler metric measure manifolds.
method Volume comparison theorem, weighted Poincaré inequality, local uniform Sobolev inequality, mean value inequalities.
result Derives a Harnack inequality for positive solutions to heat equations.

We present a formulation of the transaction cost analysis (TCA) in the Bayesian framework for the primary purpose of comparing broker algorithms using standardized benchmarks. Our formulation allows effective calculation of the expected value of trading benchmarks with only a finite sample of data relevant to practical…

2019-04-02abs ↗pdf ↗