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.
A hybrid K-NN and SVM technique improves classification accuracy.
Novel estimator reduces diffusion model variance.
New graph representation learning network improves scalability and feature integration.
A new adaptive kNN classifier outperforms Random Forests.
A new ensemble method using random projections for kNN classification.
A review of nearest neighbour classifiers, focusing on similarity measures and computational efficiency.
Proposes a new k-NN algorithm to improve classification accuracy by removing noise and pseudo-neighbours.
A new method for sampling on manifolds reduces density estimation errors.
DINOSAUR improves retrieval by accounting for embedding uncertainty in recommender systems.
Paper presents a method to align unpaired samples across different modalities.
In this paper we propose and explore the k-Nearest Neighbour UCB algorithm for multi-armed bandits with covariates. We focus on a setting where the covariates are supported on a metric space of low intrinsic dimension, such as a manifold embedded within a high dimensional ambient feature space. The algorithm is concept…
New algorithm reduces regret in contextual bandits with many near-boundary contexts.
We study the approximate nearest neighbour method for cost-sensitive classification on low-dimensional manifolds embedded within a high-dimensional feature space. We determine the minimax learning rates for distributions on a smooth manifold, in a cost-sensitive setting. This generalises a classic result of Audibert an…
Probabilistic k-nearest neighbour (PKNN) classification has been introduced to improve the performance of original k-nearest neighbour (KNN) classification algorithm by explicitly modelling uncertainty in the classification of each feature vector. However, an issue common to both KNN and PKNN is to select the optimal n…
Adaptive, sparse graphs improve learning performance.
A scalable GPVAE method using local adjacencies to approximate GP inference.
In the machine learning field, dimensionality reduction is an important task. It mitigates the undesired properties of high-dimensional spaces to facilitate classification, compression, and visualization of high-dimensional data. During the last decade, researchers proposed many new (non-linear) techniques for dimensio…
We study algebraic properties of matrices whose rows are mutual neighbours, and are also neigbours of 0 ("neighbour" in the sense of a certain nilpotency condition). The intended application is in synthetic differential geometry. For a square matrix of this kind, the product of the diagonal entries equals the determina…
The three-state agent-based 2D model of financial markets in the version proposed by Giulia Iori in 2002 has been herein extended. We have introduced the increase of herding behaviour by modelling the altering trust of an agent in his nearest neighbours. The trust increases if the neighbour has foreseen the price chang…
Optimizes one-class classification methods for better performance.
Intuitive clustering algorithm balances cluster size and cohesion.
The -nearest neighbour (-NN) classifier is one of the oldest and most important supervised learning algorithms for classifying datasets. Traditionally the Euclidean norm is used as the distance for the -NN classifier. In this thesis we investigate the use of alternative distances for the -NN classifier. We …
A framework for flagging content with limited data.
Validates network bootstraps for uncertainty quantification in network visualisation.
Accurate model selection is a fundamental requirement for statistical analysis. In many real-world applications of graphical modelling, correct model structure identification is the ultimate objective. Standard model validation procedures such as information theoretic scores and cross validation have demonstrated poor …
There is an increasing body of evidence suggesting that exact nearest neighbour search in high-dimensional spaces is affected by the curse of dimensionality at a fundamental level. Does it necessarily mean that the same is true for k nearest neighbours based learning algorithms such as the k-NN classifier? We analyse t…
K-Nearest Neighbours (k-NN) is a popular classification and regression algorithm, yet one of its main limitations is the difficulty in choosing the number of neighbours. We present a Bayesian algorithm to compute the posterior probability distribution for k given a target point within a data-set, efficiently and withou…
PAC-Bayesian bounds improve understanding of K-NN classifier performance.
Study classifies liability insurance policies using machine learning.
Develops a theoretical framework for scalable Gaussian Process regression methods.
Unified framework evaluates different nearest neighbor classification methods.
Extends Mahalanobis distance to Banach spaces for anomaly detection.
A recent proposal of data dependent similarity called Isolation Kernel/Similarity has enabled SVM to produce better classification accuracy. We identify shortcomings of using a tree method to implement Isolation Similarity; and propose a nearest neighbour method instead. We formally prove the characteristic of Isolatio…
We give a simple combinatoric proof of an exponential upper bound on the number of distinct 3-manifolds that can be constructed by successively identifying nearest neighbour pairs of triangles in the boundary of a simplicial 3-ball and show that all closed simplicial manifolds that can be constructed in this manner are…
We developed a convolution neural network (CNN) on semi-regular triangulated meshes whose vertices have 6 neighbours. The key blocks of the proposed CNN, including convolution and down-sampling, are directly defined in a vertex domain. By exploiting the ordering property of semi-regular meshes, the convolution is defin…
The classification of time series data is a well-studied problem with numerous practical applications, such as medical diagnosis and speech recognition. A popular and effective approach is to classify new time series in the same way as their nearest neighbours, whereby proximity is defined using Dynamic Time Warping (D…
EagleEye detects localized density anomalies in multivariate data.
Paper proposes MS-k-NN for improved convergence rate in k-NN classification.
Neural network learns from higher-order connections in molecules.
Technological breakthroughs on smart homes, self-driving cars, health care and robotic assistants, in addition to reinforced law regulations, have critically influenced academic research on explainable machine learning. A sufficient number of researchers have implemented ways to explain indifferently any black box mode…
In this work, we consider the problem of estimating a behaviour policy for use in Off-Policy Policy Evaluation (OPE) when the true behaviour policy is unknown. Via a series of empirical studies, we demonstrate how accurate OPE is strongly dependent on the calibration of estimated behaviour policy models: how precisely …
This paper considers a Bayesian view for estimating a sub-network in a Markov random field. The sub-network corresponds to the Markov blanket of a set of query variables, where the set of potential neighbours here is big. We factorize the posterior such that the Markov blanket is conditionally independent of the networ…
The scheduling of films is a major problem for the movie theatre exhibition business. The problem is two-fold: movie exhibitors ideally would like to schedule films to screens in their various locations to maximize attendance and revenue, but would also like to schedule these films such that neighbouring theatre locati…
Density-based clustering is the task of discovering high-density regions of entities (clusters) that are separated from each other by contiguous regions of low-density. DBSCAN is, arguably, the most popular density-based clustering algorithm. However, its cluster recovery capabilities depend on the combination of the t…
We consider the estimation of two-sample integral functionals, of the type that occur naturally, for example, when the object of interest is a divergence between unknown probability densities. Our first main result is that, in wide generality, a weighted nearest neighbour estimator is efficient, in the sense of achievi…
Optimal prototypes found for challenging pathological geometries.
A robust conformal method for set estimation using non-conformity scores.
A fast method for LOOCV in k-NN regression reduces computation time.