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.
PathNNs improve graph neural networks by distinguishing non-isomorphic graphs.
VEGN uses graph neural networks to predict disease-causing mutations from genetic variants.
Han discusses variants of digital covering maps and their equivalences.
Framework uses machine learning to distinguish major COVID-19 variants.
Counterexample disproves recent Penrose conjecture variant.
The paper evaluates three variants of the Gated Recurrent Unit (GRU) in recurrent neural networks (RNN) by reducing parameters in the update and reset gates. We evaluate the three variant GRU models on MNIST and IMDB datasets and show that these GRU-RNN variant models perform as well as the original GRU RNN model while…
AlphaZero assesses new chess variants for balance and dynamics.
In this paper, we introduce and study various kinds of decomposition complexity. First, we give a characterization of residually finite groups having finite decomposition complexity (FDC). Secondly, we introduce equi-variant straight FDC (sFDC), and prove that a group having equi-variant sFDC if and only if its box spa…
The paper categorizes and analyzes various event-linked perpetual futures contracts.
DNA sequencing to identify genetic variants is becoming increasingly valuable in clinical settings. Assessment of variants in such sequencing data is commonly implemented through Bayesian heuristic algorithms. Machine learning has shown great promise in improving on these variant calls, but the input for these is still…
Fast and cheaper next generation sequencing technologies will generate unprecedentedly massive and highly-dimensional genomic and epigenomic variation data. In the near future, a routine part of medical record will include the sequenced genomes. A fundamental question is how to efficiently extract genomic and epigenomi…
The detection of rare variants is important for understanding the genetic heterogeneity in mixed samples. Recently, next-generation sequencing (NGS) technologies have enabled the identification of single nucleotide variants (SNVs) in mixed samples with high resolution. Yet, the noise inherent in the biological processe…
We construct a variant of Floer homology groups and prove a gluing formula for a variant of Donaldson invariants. As a corollary, the variant of Donaldson invariants is non-trivial for connected sums of 4-manifolds which satisfy a condition for Donaldson invariants. We also show a non-existence result of compact, spin …
Deep models improve GWAS by identifying genetic interactions.
We improve random forest consistency and performance with DMRF, a new variant.
Comparing business process variants using event logs is a common use case in process mining. Existing techniques for process variant analysis detect statistically-significant differences between variants at the level of individual entities (such as process activities) and their relationships (e.g. directly-follows rela…
We introduce a transformer-based GNN model, named UGformer, to learn graph representations. In particular, we present two UGformer variants, wherein the first variant (publicized in September 2019) is to leverage the transformer on a set of sampled neighbors for each input node, while the second (publicized in May 2021…
In numerous applicative contexts, data are too rich and too complex to be represented by numerical vectors. A general approach to extend machine learning and data mining techniques to such data is to really on a dissimilarity or on a kernel that measures how different or similar two objects are. This approach has been …
In this contribution we present an intrinsic description of time-variant Port Hamiltonian systems as they appear in modeling and control theory. This formulation is based on the splitting of the state bundle and the use of appropriate covariant derivatives, which guarantees that the structure of the equations is invari…
Variant of mSSA improves time series prediction error.
We propose two variants of the Smith-Wilson method for practical application in the insurance industry. Our first variant relaxes the Smith-Wilson energy and can be used to incorporate less reliable market data with a certain weight rather than disregarding it completely. This is particularly useful for deriving yield …
A framework for designing and evaluating new GCN variants.
ENN method uses expectile regression for genetic data analysis of complex diseases.
Time-variant value function transfer method for RL.
New Muon and Momo variants improve neural network optimization robustness.
Improved DeepONet variants using Transformer cross-conditioning enhance PDE solution efficiency.
We introduce a smooth variant of the Hopkins-Singer model of differential K-theory. We prove that our model is naturally isomorphic to the Hopkins-Singer model and also to the Tradler-Wilson-Zeinalian model of differential K-theory.
Two new PCA variants improve financial data analysis.
Enhances random forest consistency and introduces DMRF for improved performance.
Structural variants compose the majority of human genetic variation, but are difficult to assess using current genomic sequencing technologies. Optical mapping technologies, which measure the size of chromosomal fragments between labeled markers, offer an alternative approach. As these technologies mature towards becom…
In this paper, we provide an overview of first-order and second-order variants of the gradient descent method that are commonly used in machine learning. We propose a general framework in which 6 of these variants can be interpreted as different instances of the same approach. They are the vanilla gradient descent, the…
Variant of Seiberg-Witten equations for multiple-spinors connects to stability of holomorphic bundles.
New DCD and BDCD methods for K-SVM and K-RR reduce communication costs.
We prove a gluing formula for the families Seiberg-Witten invariants of families of -manifolds obtained by fibrewise connected sum. Our formula expresses the families Seiberg-Witten invariants of such a connected sum family in terms of the ordinary Seiberg-Witten invariants of one of the summands, under certain assu…
Lower bounds for PI on multi-action MDPs are established, showing complexity grows with action count.
We present two new remarkably simple stochastic second-order methods for minimizing the average of a very large number of sufficiently smooth and strongly convex functions. The first is a stochastic variant of Newton's method (SN), and the second is a stochastic variant of cubically regularized Newton's method (SCN). W…
Imagine a large firm with multiple departments that plans a large recruitment. Candidates arrive one-by-one, and for each candidate the firm decides, based on her data (CV, skills, experience, etc), whether to summon her for an interview. The firm wants to recruit the best candidates while minimizing the number of inte…
Adaptive gradient methods have become recently very popular, in particular as they have been shown to be useful in the training of deep neural networks. In this paper we have analyzed RMSProp, originally proposed for the training of deep neural networks, in the context of online convex optimization and show -…
A new k-means variant minimizes pairwise distances within clusters.
We analyze two novel randomized variants of the Frank-Wolfe (FW) or conditional gradient algorithm. While classical FW algorithms require solving a linear minimization problem over the domain at each iteration, the proposed method only requires to solve a linear minimization problem over a small \emph{subset} of the or…
New method uses DNN for genetic variant identification, controlling randomness and improving interpretability.
The emerging field of precision oncology relies on the accurate pinpointing of alterations in the molecular profile of a tumor to provide personalized targeted treatments. Current methodologies in the field commonly include the application of next generation sequencing technologies to a tumor sample, followed by the id…
We study in this paper a variant of Wasserstein barycenter problem, which we refer to as tree-Wasserstein barycenter, by leveraging a specific class of ground metrics, namely tree metrics, for Wasserstein distance. Drawing on the tree structure, we propose an efficient algorithmic approach to solve the tree-Wasserstein…
Paper analyzes and accelerates Langevin Monte Carlo methods using large deviations theory.
Study of graphs from hexagon decompositions of surfaces.
The goal of semi-supervised learning is to improve supervised classifiers by using additional unlabeled training examples. In this work we study a simple self-learning approach to semi-supervised learning applied to the least squares classifier. We show that a soft-label and a hard-label variant of self-learning can be…
The paper proposes a new variant of a decision tree, called an Extreme Learning Tree. It consists of an extremely random tree with non-linear data transformation, and a linear observer that provides predictions based on the leaf index where the data samples fall. The proposed method outperforms linear models on a bench…
New method targets vaccines for new variants using Thompson sampling.