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.
Method measures weight similarity in neural networks using normalization and statistical inference.
ROTS improves sentence similarity by incorporating structural information.
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…
Partial fusion combines neural networks to balance accuracy and efficiency.
We discuss a weighted estimation of correlation and covariance matrices from historical financial data. To this end, we introduce a weighting scheme that accounts for similarity of previous market conditions to the present one. The resulting estimators are less biased and show lower variance than either unweighted or e…
Brain Electroencephalography (EEG) classification is widely applied to analyze cerebral diseases in recent years. Unfortunately, invalid/noisy EEGs degrade the diagnosis performance and most previously developed methods ignore the necessity of EEG selection for classification. To this end, this paper proposes a novel m…
STRAPSim measures ETF portfolio similarity better than existing methods.
The paper develops a decision support system for hierarchical text classification of conference proceedings.
New methods train neural networks without changing weights, achieving similar or higher performance.
ContraSim learns financial headline similarities for market forecasting.
Improves Gower's similarity for mixed-type variables with automatic weighting.
Study evaluates thresholds for removing noise from DNN weights using random matrix theory.
Motivated by advantages of current-mode design, this brief contribution explores the implementation of weight matrices in neuromemristive systems via current-mode memristor crossbar circuits. After deriving theoretical results for the range and distribution of weights in the current-mode design, it is shown that any we…
A new method identifies similar mutual funds using graph learning.
A new kernel measures brain network similarities, improving disease classification.
This paper finds a new way to compress CNN weights, improving on pruning and quantization.
As proteins with similar structures often have similar functions, analysis of protein structures can help predict protein functions and is thus important. We consider the problem of protein structure classification, which computationally classifies the structures of proteins into pre-defined groups. We develop a weight…
Supervised learning has been very successful for automatic segmentation of images from a single scanner. However, several papers report deteriorated performances when using classifiers trained on images from one scanner to segment images from other scanners. We propose a transfer learning classifier that adapts to diff…
Community detection is an important task in network analysis, in which we aim to learn a network partition that groups together vertices with similar community-level connectivity patterns. By finding such groups of vertices with similar structural roles, we extract a compact representation of the network's large-scale …
We show that deep networks can be trained using Hebbian updates yielding similar performance to ordinary back-propagation on challenging image datasets. To overcome the unrealistic symmetry in connections between layers, implicit in back-propagation, the feedback weights are separate from the feedforward weights. The f…
A new image interpolation model using sparse representation and nonlocal linear regression.
Improved SAC with AWMP for better control tasks.
Independent Component Analysis (ICA) - one of the basic tools in data analysis - aims to find a coordinate system in which the components of the data are independent. In this paper we present Multiple-weighted Independent Component Analysis (MWeICA) algorithm, a new ICA method which is based on approximate diagonalizat…
Unified framework for comparing clusterings from information-theoretic and pair-counting perspectives.
Paper generalizes scalar curvature theorem to weighted manifolds.
Study shows how task similarity affects forgetting in teacher-student setup.
A new weighted FDA method improves face recognition accuracy.
We consider a conjecture made by Ge, Wang and Wu regarding weighted Alexandrov-Fenchel inequalities for horospherically convex hypersurfaces in hyperbolic space (a bound, for some physically motivated weight function, of the weighted integral of the mean curvature in terms of the area of the hypersurf…
Optimal weight windows are symmetric rectangles centered at peak.
We propose a new method to model multi-way similarities into hypergraphs for clustering.
Paper proposes a robust LPR method using similarity kernels.
PipeDream-2BW accelerates large model training by 20x with minimal memory usage.
Enhances graph neural networks by considering feature similarities in node aggregation.
Learn dynamics of a system using auxiliary data from similar systems.
Clustering is a separation of data into groups of similar objects. Every group called cluster consists of objects that are similar to one another and dissimilar to objects of other groups. In this paper, the K-Means algorithm is implemented by three distance functions and to identify the optimal distance function for c…
Traditionally, multi-layer neural networks use dot product between the output vector of previous layer and the incoming weight vector as the input to activation function. The result of dot product is unbounded, thus increases the risk of large variance. Large variance of neuron makes the model sensitive to the change o…
Adapts attention to supervised learning for personalized predictions.
Graph matching aims at finding the vertex correspondence between two unlabeled graphs that maximizes the total edge weight correlation. This amounts to solving a computationally intractable quadratic assignment problem. In this paper we propose a new spectral method, GRAph Matching by Pairwise eigen-Alignments (GRAMPA)…
Retrieving the most similar objects in a large-scale database for a given query is a fundamental building block in many application domains, ranging from web searches, visual, cross media, and document retrievals. State-of-the-art approaches have mainly focused on capturing the underlying geometry of the data manifolds…
Since machine learning models have been applied to neuroimaging data, researchers have drawn conclusions from the derived weight maps. In particular, weight maps of classifiers between two conditions are often described as a proxy for the underlying signal differences between the conditions. Recent studies have however…
We introduce a quotient of the affine Temperley-Lieb category that encodes all weight-preserving linear maps between finite-dimensional sl(2)-representations. We study the diagrammatic idempotents that correspond to projections onto extremal weight spaces and find that they satisfy similar properties as Jones-Wenzl pro…
We introduce a financial portfolio optimization framework that allows us to automatically select the relevant assets and estimate their weights by relying on a sorted -Norm penalization, henceforth SLOPE. Our approach is able to group constituents with similar correlation properties, and with the same underlyin…
Rapid overlay of chemical structures (ROCS) is a standard tool for the calculation of 3D shape and chemical ("color") similarity. ROCS uses unweighted sums to combine many aspects of similarity, yielding parameter-free models for virtual screening. In this report, we decompose the ROCS color force field into "color com…
Recently, in the paper "Weight Agnostic Neural Networks" Gaier & Ha utilized architecture search to find networks where the topology completely encodes the knowledge. However, architecture search in topology space is expensive. We use the existing framework of binarized networks to find performant topologies by constra…
Paper develops robust -NN algorithm for few samples.
A new weighted MCC measure improves classifier performance evaluation.
Graph Convolution Network (GCN) has been recognized as one of the most effective graph models for semi-supervised learning, but it extracts merely the first-order or few-order neighborhood information through information propagation, which suffers performance drop-off for deeper structure. Existing approaches that deal…
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…