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.
DERWENT learns paths for distant transfer learning via deep random walk.
Exploiting the appropriate inductive bias based on the knowledge of data is essential for achieving good performance in statistical machine learning. In practice, however, the domain knowledge of interest often provides information on the relationship of data attributes only distantly, which hinders direct utilization …
Relation extraction aims to extract relational facts from sentences. Previous models mainly rely on manually labeled datasets, seed instances or human-crafted patterns, and distant supervision. However, the human annotation is expensive, while human-crafted patterns suffer from semantic drift and distant supervision sa…
Quaternion neural networks improve distant speech recognition.
NLP tasks are often limited by scarcity of manually annotated data. In social media sentiment analysis and related tasks, researchers have therefore used binarized emoticons and specific hashtags as forms of distant supervision. Our paper shows that by extending the distant supervision to a more diverse set of noisy la…
Survey on negative transfer in machine learning.
Scarcity of labeled data is one of the most frequent problems faced in machine learning. This is particularly true in relation extraction in text mining, where large corpora of texts exists in many application domains, while labeling of text data requires an expert to invest much time to read the documents. Overall, st…
Study on noise models for noisy labels in NLP.
Study equi-affine invariants for convex domains with asymptotes.
Graph-Relational Domain Adaptation (GRDA) adapts domains based on their graph structure.
Geometric approach for unsupervised word embedding alignment.
Paper calculates L-invariant and L*-invariant for complex surface sums.
Despite significant efforts over the last few years to build a robust automatic speech recognition (ASR) system for different acoustic settings, the performance of the current state-of-the-art technologies significantly degrades in noisy reverberant environments. Convolutional Neural Networks (CNNs) have been successfu…
The recent empirical success of unsupervised cross-domain mapping algorithms, between two domains that share common characteristics, is not well-supported by theoretical justifications. This lacuna is especially troubling, given the clear ambiguity in such mappings. We work with adversarial training methods based on IP…
New theorem connects distant points and identical points on manifolds.
Focusing on a small set of proteins that i) fold in a concerted, all-or-none fashion and ii) do not contain knots or slipknots, we show that the Gauss linking integral, the torsion and the number of sequence-distant contacts provide information regarding the folding rate. Our results suggest that the global topology/ge…
Method counters noisy labels by discounting distant samples.
We present a recurrent neural network memory that uses sparse coding to create a combinatoric encoding of sequential inputs. Using several examples, we show that the network can associate distant causes and effects in a discrete stochastic process, predict partially-observable higher-order sequences, and enable a DQN a…
Paper proposes a novel model to improve n-ary cross-sentence relation extraction by addressing noisy data and non-consecutive sentences.
We introduce a novel loss function for training deep learning architectures to perform classification. It consists in minimizing the smoothness of label signals on similarity graphs built at the output of the architecture. Equivalently, it can be seen as maximizing the distances between the network function images of t…
3D RadViz improves 3D data visualization of multidimensional datasets.
A new method improves graph node embeddings by considering both nearby and distant node similarities.
Considering event structure information has proven helpful in text-based stock movement prediction. However, existing works mainly adopt the coarse-grained events, which loses the specific semantic information of diverse event types. In this work, we propose to incorporate the fine-grained events in stock movement pred…
We formulate certain inequalities for the geometric quantities characterizing causal diamonds in curved and Minkowski spacetimes. These inequalities involve the red-shift factor which, as we show explicitly in the spherically symmetric case, is monotonic in the radial direction and it takes its maximal value at the cen…
Traditional machine learning algorithms assume that the training and test data have the same distribution, while this assumption does not necessarily hold in real applications. Domain adaptation methods take into account the deviations in the data distribution. In this work, we study the problem of domain adaptation on…
Spatio-temporal prediction plays an important role in many application areas especially in traffic domain. However, due to complicated spatio-temporal dependency and high non-linear dynamics in road networks, traffic prediction task is still challenging. Existing works either exhibit heavy training cost or fail to accu…
Graph embedding has recently gained momentum in the research community, in particular after the introduction of random walk and neural network based approaches. However, most of the embedding approaches focus on representing the local neighborhood of nodes and fail to capture the global graph structure, i.e. to retain …
TimeVQVAE uses VQ for better time series generation.
Main mathematical applications of Frobenius manifolds are in the theory of Gromov - Witten invariants, in singularity theory, in differential geometry of the orbit spaces of reflection groups and of their extensions, in the hamiltonian theory of integrable hierarchies. The theory of Frobenius manifolds establishes rema…
Paper introduces new loss functions for Siamese networks using FDA.
We present a novel framework to deal with relation extraction tasks in cases where there is complete lack of supervision, either in the form of gold annotations, or relations from a knowledge base. Our approach leverages syntactic parsing and pre-trained word embeddings to extract few but precise relations,which are th…
This article briefly introduced Arthur and Vassilvitshii's work on \textbf{k-means++} algorithm and further generalized the center initialization process. It is found that choosing the most distant sample point from the nearest center as new center can mostly have the same effect as the center initialization process in…
Traditional relation extraction predicts relations within some fixed and finite target schema. Machine learning approaches to this task require either manual annotation or, in the case of distant supervision, existing structured sources of the same schema. The need for existing datasets can be avoided by using a univer…
MPNNs over-squash distant node information, study shows.
New Performer model tackles long-sequence protein modeling.
Action-bisimulation learns long-horizon controllability for reinforcement learning.
Multivariate time series forecasting is an important yet challenging problem in machine learning. Most existing approaches only forecast the series value of one future moment, ignoring the interactions between predictions of future moments with different temporal distance. Such a deficiency probably prevents the model …
New method for embedding large networks without attributes, achieving state-of-the-art performance.
Deep learning algorithms have recently produced state-of-the-art accuracy in many classification tasks, but this success is typically dependent on access to many annotated training examples. For domains without such data, an attractive alternative is to train models with light, or distant supervision. In this paper, we…
Graph clustering is a basic technique in machine learning, and has widespread applications in different domains. While spectral techniques have been successfully applied for clustering undirected graphs, the performance of spectral clustering algorithms for directed graphs (digraphs) is not in general satisfactory: the…
Graph neural networks struggle to propagate long-range information, causing over-squashing.
We consider a left invariant Riemannian metric on SO(3) with two equal eigenvalues. We find the cut locus and the equation for the cut time. We find the diameter of such metric and describe the set of all most distant points from the identity. Also we prove that the cut locus and the cut time converge to the cut locus …
Entity Linking (EL) is the task of automatically identifying entity mentions in a piece of text and resolving them to a corresponding entity in a reference knowledge base like Wikipedia. There is a large number of EL tools available for different types of documents and domains, yet EL remains a challenging task where t…
We introduce a novel approach for parallelizing MCMC inference in models with spatially determined conditional independence relationships, for which existing techniques exploiting graphical model structure are not applicable. Our approach is motivated by a model of seismic events and signals, where events detected in d…
Study predicts climate data at distant locations using machine learning.
Annotation errors can significantly hurt classifier performance, yet datasets are only growing noisier with the increased use of Amazon Mechanical Turk and techniques like distant supervision that automatically generate labels. In this paper, we present a robust extension of logistic regression that incorporates the po…
Models extract relevant EHR snippets to aid radiologists in diagnosis.
New method estimates graph compatibility from sparse labels.