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.
New metric learning approach for tree data reduces computation cost.
Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Recent research has demonstrated that metric learning approaches can also be applied to trees, such as m…
Metric learning has the aim to improve classification accuracy by learning a distance measure which brings data points from the same class closer together and pushes data points from different classes further apart. Recent research has demonstrated that metric learning approaches can also be applied to trees, such as m…
Many machine learning models can be attacked with adversarial examples, i.e. inputs close to correctly classified examples that are classified incorrectly. However, most research on adversarial attacks to date is limited to vectorial data, in particular image data. In this contribution, we extend the field by introduci…
Edit distance, also known as Levenshtein distance, is an essential way to compare two strings that proved to be particularly useful in the analysis of genetic sequences and natural language processing. However, edit distance is a discrete function that is known to be hard to optimize. This fact hampers the use of this …
Paper develops a new method to analyze 3D tree-like objects.
RS-Del provides robustness for sequence classifiers against edit distance attacks.
The crucial importance of metrics in machine learning algorithms has led to an increasing interest in optimizing distance and similarity functions, an area of research known as metric learning. When data consist of feature vectors, a large body of work has focused on learning a Mahalanobis distance. Less work has been …
Finding an optimal assignment between two sets of objects is a fundamental problem arising in many applications, including the matching of `bag-of-words' representations in natural language processing and computer vision. Solving the assignment problem typically requires cubic time and its pairwise computation is expen…
We consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit distance for Reeb graphs and prove that it is stable and universal, meaning that it pr…
Causal KL improves on existing metrics for evaluating causal models.
Differentially private data structures for estimating distances between strings.
We present Optimal Completion Distillation (OCD), a training procedure for optimizing sequence to sequence models based on edit distance. OCD is efficient, has no hyper-parameters of its own, and does not require pretraining or joint optimization with conditional log-likelihood. Given a partial sequence generated by th…
A new supervised tree-Wasserstein distance improves document classification.
We propose a new anytime hierarchical clustering method that iteratively transforms an arbitrary initial hierarchy on the configuration of measurements along a sequence of trees we prove for a fixed data set must terminate in a chain of nested partitions that satisfies a natural homogeneity requirement. Each recursive …
A market-maker-based prediction market lets forecasters aggregate information by editing a consensus probability distribution either directly or by trading securities that pay off contingent on an event of interest. Combinatorial prediction markets allow trading on any event that can be specified as a combination of a …
This paper approximates 1-Wasserstein distance using tree-based embedding.
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…
We introduce the problem of learning distributed representations of edits. By combining a "neural editor" with an "edit encoder", our models learn to represent the salient information of an edit and can be used to apply edits to new inputs. We experiment on natural language and source code edit data. Our evaluation yie…
ED-NeRF efficiently edits 3D scenes using latent space NeRF and improved loss functions.
Improves generative models by optimizing rewards and sample editing.
We present a new, efficient method for automatically detecting severe conflicts `edit wars' in Wikipedia and evaluate this method on six different language WPs. We discuss how the number of edits, reverts, the length of discussions, the burstiness of edits and reverts deviate in such pages from those following the gene…
The paper tightens bounds on distances between Reeb graphs.
funcGNN uses graph neural networks to estimate program similarity efficiently.
As the number of contributors to online peer-production systems grows, it becomes increasingly important to predict whether the edits that users make will eventually be beneficial to the project. Existing solutions either rely on a user reputation system or consist of a highly specialized predictor that is tailored to …
Ground-A-Video edits videos without training, preserving intended changes.
A new tree-Wasserstein distance for high-dimensional data with latent feature hierarchy.
Paper fine-tunes LLMs using user edits, unifying preference, supervision, and reward feedback.
Optimal transport (\OT) theory defines a powerful set of tools to compare probability distributions. \OT~suffers however from a few drawbacks, computational and statistical, which have encouraged the proposal of several regularized variants of OT in the recent literature, one of the most notable being the \textit{slice…
Programming languages are emerging as a challenging and interesting domain for machine learning. A core task, which has received significant attention in recent years, is building generative models of source code. However, to our knowledge, previous generative models have always been framed in terms of generating stati…
Neural network for subgraph similarity computation with pruning.
We propose a new generative model of sentences that first samples a prototype sentence from the training corpus and then edits it into a new sentence. Compared to traditional models that generate from scratch either left-to-right or by first sampling a latent sentence vector, our prototype-then-edit model improves perp…
Locally adaptive clustering for tree delineation.
MEGAN models chemical reactions as graph edits, improving synthesis planning.
New method uses coupled SDEs to edit images with high fidelity and consistency.
This study investigates self-supervised learning with Wasserstein distance on tree structures.
The paper proposes a method to infer differentiation trees from RNA velocity data.
A new k-means algorithm using cover trees accelerates clustering.
Paper proposes efficient image inversion and editing using rectified stochastic differential equations.
Tree Mover's Distance measures graph attributes and improves GNN performance.
New method detects watermarks in LLM-generated text with human edits.
A technique to quickly fix mistakes in neural networks.
Method learns hierarchical representations of samples and features simultaneously.
A review of nearest neighbour classifiers, focusing on similarity measures and computational efficiency.
For the task of generating complex outputs such as source code, editing existing outputs can be easier than generating complex outputs from scratch. With this motivation, we propose an approach that first retrieves a training example based on the input (e.g., natural language description) and then edits it to the desir…
Differentiable language model attacks improve adversarial examples for categorical sequence classifiers.
Machine learning experiments show IID assumption is flawed for bathymetry editing.
PhyloVAE learns tree topologies without supervision.