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 framework for forecasting high-dimensional time-series data using clustering.
We introduce a novel end-to-end approach for learning to cluster in the absence of labeled examples. Our clustering objective is based on optimizing normalized cuts, a criterion which measures both intra-cluster similarity as well as inter-cluster dissimilarity. We define a differentiable loss function equivalent to th…
JojoSCL improves scRNA-seq clustering by reducing intra-cluster dispersion.
In this paper, we propose a deep reinforcement learning (DRL) based mobility load balancing (MLB) algorithm along with a two-layer architecture to solve the large-scale load balancing problem for ultra-dense networks (UDNs). Our contribution is three-fold. First, this work proposes a two-layer architecture to solve the…
PTOPOFL uses topological descriptors to protect privacy in federated learning.
Feature representations from pre-trained deep neural networks have been known to exhibit excellent generalization and utility across a variety of related tasks. Fine-tuning is by far the simplest and most widely used approach that seeks to exploit and adapt these feature representations to novel tasks with limited data…
The study of the critical dynamics in complex systems is always interesting yet challenging. Here, we choose financial market as an example of a complex system, and do a comparative analyses of two stock markets - the S&P 500 (USA) and Nikkei 225 (JPN). Our analyses are based on the evolution of crosscorrelation struct…
We introduce a graph-theoretic approach to extract clusters and hierarchies in complex data-sets in an unsupervised and deterministic manner, without the use of any prior information. This is achieved by building topologically embedded networks containing the subset of most significant links and analyzing the network s…
Proposes a method to cluster tasks for constructive cooperative multi-tasking.
Improved graph clustering with modularity and coarsening for attributes and communities.
Feature selection is an important and challenging task in high dimensional clustering. For example, in genomics, there may only be a small number of genes that are differentially expressed, which are informative to the overall clustering structure. Existing feature selection methods, such as Sparse K-means, rarely tack…
This article investigates the correlation structure of the global crude oil market using the daily returns of 71 oil price time series across the world from 1992 to 2012. We identify from the correlation matrix six clusters of time series exhibiting evident geographical traits, which supports Weiner's (1991) regionaliz…
Preserving the privacy of individuals by protecting their sensitive attributes is an important consideration during microdata release. However, it is equally important to preserve the quality or utility of the data for at least some targeted workloads. We propose a novel framework for privacy preservation based on the …
Graph clustering improved using Boltzmann machine heuristics.
This paper studies clustering of data sequences using the k-medoids algorithm. All the data sequences are assumed to be generated from \emph{unknown} continuous distributions, which form clusters with each cluster containing a composite set of closely located distributions (based on a certain distance metric between di…
DynMSA detects market clusters for better portfolio allocation.
Facial recognition is a key enabling component for emerging Internet of Things (IoT) services such as smart homes or responsive offices. Through the use of deep neural networks, facial recognition has achieved excellent performance. However, this is only possibly when trained with hundreds of images of each user in dif…
Paper proposes SLINK clustering for nonparametric data sequences with improved consistency.
Enhances LDL by integrating distance and directional information for more robust label feature representation.
Q-learning with cSMART data assesses cAI tailoring variables.
Motivated by community detection, we characterise the spectrum of the non-backtracking matrix in the Degree-Corrected Stochastic Block Model. Specifically, we consider a random graph on vertices partitioned into two equal-sized clusters. The vertices have i.i.d. weights with second moment $Φ…
CDL index improves clustering validation for non-convex data.
KCoreMotif clusters large networks efficiently by exploiting k-core decomposition and motifs.
Introduces CHL, a new loss function for continuous similarity learning.
Hierarchical clustering based on pairwise similarities is a common tool used in a broad range of scientific applications. However, in many problems it may be expensive to obtain or compute similarities between the items to be clustered. This paper investigates the hierarchical clustering of N items based on a small sub…
Deconfounds neural network representation similarity metrics to improve consistency and accuracy.
Quantum networks learn task-dependent asymmetric similarity measures.
In this paper, we investigate the similarity transformations in the Minkowski-n space. We study the geometric invariants of non-null curves under the similarity transformations. Besides, we extend the fundamental theorem for a non-null curve according to a similarity motion. We determine all non-null self-similar curve…
Defines a similarity measure for classification distributions.
Proposes neural similarity for CNNs to enhance flexibility and performance.
Automates similarity measure construction from data.
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…
We introduce GSimCNN (Graph Similarity Computation via Convolutional Neural Networks) for predicting the similarity score between two graphs. As the core operation of graph similarity search, pairwise graph similarity computation is a challenging problem due to the NP-hard nature of computing many graph distance/simila…
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…
Modified cosine distance improves similarity performance in data with variance and correlation.
Advocates Tversky's model for image similarity learning.
Method measures weight similarity in neural networks using normalization and statistical inference.
We prove that the only self-similar surfaces of Euclidean 3-space which are foliated by circles are the self-similar surfaces of revolution discovered by S. Angenent and that the only ruled, self-similar surfaces are the cylinders over planar self-similar curves.
Improves confidence calibration in neural networks by smoothing labels based on class similarity.
CatSIM measures image similarity robustly to small changes.
Recently, randomly mapping vectorial data to strings of discrete symbols (i.e., sketches) for fast and space-efficient similarity searches has become popular. Such random mapping is called similarity-preserving hashing and approximates a similarity metric by using the Hamming distance. Although many efficient similarit…
Study uses trajectory embedding to measure place function similarity at fine spatial granularity.
STRAPSim measures ETF portfolio similarity better than existing methods.
This paper proposes novel algorithms for speaker embedding using subjective inter-speaker similarity based on deep neural networks (DNNs). Although conventional DNN-based speaker embedding such as a -vector can be applied to multi-speaker modeling in speech synthesis, it does not correlate with the subjective inter-…
We propose shifted inner-product similarity (SIPS), which is a novel yet very simple extension of the ordinary inner-product similarity (IPS) for neural-network based graph embedding (GE). In contrast to IPS, that is limited to approximating positive-definite (PD) similarities, SIPS goes beyond the limitation by introd…
Exploits class similarity for better machine learning models with confidence labels and projective loss functions.
We propose (WIPS) for neural network-based graph embedding. In addition to the parameters of neural networks, we optimize the weights of the inner product by allowing positive and negative values. Despite its simplicity, WIPS can approximate arbitrary general similarities in…
BiLRP explains deep similarity models by decomposing scores into feature contributions.