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

Trend · papers per month

1223 · Apr 201719922001200920172026
48 results for similarity-based

Multi-label classification is an important learning problem with many applications. In this work, we propose a principled similarity-based approach for multi-label learning called SML. We also introduce a similarity-based approach for predicting the label set size. The experimental results demonstrate the effectiveness…

2017-10-27abs ↗pdf ↗

Study forecasts monthly electricity demand using pattern similarity-based methods.

problem Forecasting monthly electricity demand accurately.
method Pattern similarity-based forecasting methods (PSFMs) including k-NN, fuzzy, kernel regression, and GRNN.
result Ensemble models outperform individual PSFMs in forecasting accuracy.

SPINEX improves clustering with explainable neighbors, outperforming other methods.

problem Improving clustering performance and explainability.
method Leverages similarity and higher-order interactions for clustering.
result SPINEX outperforms 13 clustering algorithms across various datasets.

The paper uses pattern similarity-based methods for mid-term electricity demand forecasting.

problem Forecasting monthly electricity demand with seasonal patterns.
method Pattern similarity-based machine learning models (nearest neighbor, fuzzy neighborhood, kernel regression, GRNN).
result The proposed models outperform classical and state-of-the-art models in accuracy and simplicity.

SPINEX improves time series forecasting with explainable neighbors.

problem Enhancing time series forecasting accuracy and interpretability.
method Leverages similarity and higher-order temporal interactions across multiple scales.
result SPINEX consistently ranks among top performers in forecasting precision.

SBSS uses similarity to split data for better classifier training.

problem Training better classifiers with realistic performance estimation.
method SBSS uses both input and output space information to split data using similarity functions.
result SBSS outperformed ordinary stratified 10-fold cross-validation in 75% of scenarios.

The development of algorithms for hierarchical clustering has been hampered by a shortage of precise objective functions. To help address this situation, we introduce a simple cost function on hierarchies over a set of points, given pairwise similarities between those points. We show that this criterion behaves sensibl…

2015-10-16abs ↗pdf ↗

We consider the problem of classification using similarity/distance functions over data. Specifically, we propose a framework for defining the goodness of a (dis)similarity function with respect to a given learning task and propose algorithms that have guaranteed generalization properties when working with such good fu…

2011-12-22abs ↗pdf ↗

Beta-SOD detects and corrects noisy object re-identification using cosine similarity and Beta mixtures.

problem Noisy object re-identification in image datasets.
method Reframed Re-ID as a similarity task, using Siamese networks and Beta mixture models.
result Superior performance in noisy conditions compared to state-of-the-art methods.

There is no free lunch, no single learning algorithm that will outperform other algorithms on all data. In practice different approaches are tried and the best algorithm selected. An alternative solution is to build new algorithms on demand by creating a framework that accommodates many algorithms. The best combination…

2018-06-16abs ↗pdf ↗

Recently, researchers have started decomposing deep neural network models according to their semantics or functions. Recent work has shown the effectiveness of decomposed functional blocks for defending adversarial attacks, which add small input perturbation to the input image to fool the DNN models. This work proposes…

2019-04-17abs ↗pdf ↗

As a fundamental problem in many different fields, link prediction aims to estimate the likelihood of an existing link between two nodes based on the observed information. Since this problem is related to many applications ranging from uncovering missing data to predicting the evolution of networks, link prediction has…

2014-09-30abs ↗pdf ↗

Rewiring GNNs to optimize community and feature alignment improves their performance.

problem Improving GNNs' performance by addressing over-squashing and generalization issues.
method Three rewiring strategies: ComMa, FeaSt, and ComFy, targeting community structure, node labels, and their alignment.
result Rewiring strategies enhance GNNs' performance by optimizing label-community alignment.

The performance of most the clustering methods hinges on the used pairwise affinity, which is usually denoted by a similarity matrix. However, the pairwise similarity is notoriously known for its vulnerability of noise contamination or the imbalance in samples or features, and thus hinders accurate clustering. To tackl…

2019-05-10abs ↗pdf ↗

Distance metric learning is a branch of machine learning that aims to learn distances from the data, which enhances the performance of similarity-based algorithms. This tutorial provides a theoretical background and foundations on this topic and a comprehensive experimental analysis of the most-known algorithms. We sta…

2018-12-14abs ↗pdf ↗

Many contemporary statistical learning methods assume a Euclidean feature space. This paper presents a method for defining similarity based on hyperspherical geometry and shows that it often improves the performance of support vector machine compared to other competing similarity measures. Specifically, the idea of usi…

2017-02-05abs ↗pdf ↗

The paper improves experimental design by weighting diversity metrics with quality, leading to more diverse and effective discoveries.

problem Existing experimental design techniques favor exploitation over exploration, leading to local optima and insufficient diversity.
method The paper extends Vendi scores to account for quality and applies them to various experimental design problems.
result Quality-weighted Vendi scores allow for better balance between quality and diversity, resulting in 70%-170% more effective discoveries.

Improves confidence calibration in neural networks by smoothing labels based on class similarity.

problem Improving confidence calibration in deep neural networks for safety-critical applications.
method Proposes a novel label smoothing technique where label values are based on similarities with the reference class, using different similarity measurements.
result Consistently outperforms state-of-the-art calibration techniques on various datasets and network architectures.

Data similarity is a key concept in many data-driven applications. Many algorithms are sensitive to similarity measures. To tackle this fundamental problem, automatically learning of similarity information from data via self-expression has been developed and successfully applied in various models, such as low-rank repr…

2019-03-11abs ↗pdf ↗

A machine learning model improves relative valuation of municipal bonds.

problem Challenges in determining the value or relative value of municipal bonds.
method Proposes a supervised similarity framework using CatBoost algorithm to identify similar bonds based on risk profiles.
result The similarity-based method outperforms rule-based and heuristic-based methods in back-testing.

Similarity-based clustering and semi-supervised learning methods separate the data into clusters or classes according to the pairwise similarity between the data, and the pairwise similarity is crucial for their performance. In this paper, we propose a novel discriminative similarity learning framework which learns dis…

2017-09-05abs ↗pdf ↗

This paper tackles noise in raw datasets to improve representation learning efficiency.

problem Noise in real-world datasets degrades representation learning quality.
method Proposes denoising Cosine-Similarity (dCS) loss to learn robust representations.
result Empirical results show the dCS loss outperforms baseline objective functions.

The paper proposes a method to improve sales forecasts by selecting optimal reference classes.

problem Improving forecasts of sales growth exposed to behavioural bias.
method Finding optimal reference classes for each company based on specific predictors and matching forecast distributions to actual sales.
result The past operating margins are strong predictors for future sales distributions.

Embedding representation learning via neural networks is at the core foundation of modern similarity based search. While much effort has been put in developing algorithms for learning binary hamming code representations for search efficiency, this still requires a linear scan of the entire dataset per each query and tr…

2018-05-15abs ↗pdf ↗