Research
On-device research index

arXiv research

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.

168,657 papers · 148 categories

Trend · papers per month

146291437582 · Jun 202019922001200920172026
48 results for ZINC dataset

A new neural network model for molecular graphs that learns efficiently and accurately.

problem Learning on molecular graphs with cycles and complex structures.
method Hierarchical inter-message passing using raw graph and junction tree representations.
result The model outperforms classical GNNs in detecting cycles and is efficient to train.

Discrete structure rules for validating molecular structures are usually limited to fulfillment of the octet rule or similar simple deterministic heuristics. We propose a model, inspired by language modeling from natural language processing, with the ability to learn from a collection of undirected molecular graphs, en…

2019-11-26abs ↗pdf ↗

Advanced GNNs improve molecular generation models.

problem Generating complete graphs with multiple nodes and edges based on labels.
method Replaced standard GNNs with more expressive GNNs in autoregressive and one-shot generation models.
result Advanced GNNs can improve performance of graph generative models, but expressiveness is not a necessity.

MFNs parameterize non-local interactions through matrix equivariant functions, improving graph neural network performance.

problem Challenges in modeling non-local interactions in graphs, such as oversmoothing and oversquashing.
method Matrix Function Neural Networks (MFNs) using resolvent expansions for non-local interactions.
result Achieves state-of-the-art performance in graph benchmarks and captures intricate non-local interactions.

This paper develops a Bayesian procedure for estimation and forecasting of the volatility of multivariate time series. The foundation of this work is the matrix-variate dynamic linear model, for the volatility of which we adopt a multiplicative stochastic evolution, using Wishart and singular multivariate beta distribu…

2008-02-01abs ↗pdf ↗

Enhances graph neural networks with structural message-passing for better generalization.

problem Limited representation power and inability to learn basic graph topological properties.
method Proposes a framework that includes a one-hot encoding of nodes and parametrized message and update functions ensuring permutation equivariance.
result Achieves state-of-the-art results on molecular graph regression on the ZINC dataset.

A new HOM model improves forecasting of Indian base metal prices.

problem Improving accuracy in predicting base metal prices in the Indian market.
method A Higher Order Markovian (HOM) model with varying order based on market delay.
result The HOM model consistently outperforms the standard Markovian model in forecasting.

In the last few years, graph neural networks (GNNs) have become the standard toolkit for analyzing and learning from data on graphs. This emerging field has witnessed an extensive growth of promising techniques that have been applied with success to computer science, mathematics, biology, physics and chemistry. But for…

2020-03-02abs ↗pdf ↗

The assessment of co-movement among metals is crucial to better understand the behaviors of the metal prices and the interactions with others that affect the changes in prices. In this study, both Wavelet Analysis and VARMA (Vector Autoregressive Moving Average) models are utilized. First, Multiple Wavelet Coherence (M…

2016-02-05abs ↗pdf ↗

Molecule optimization is about generating molecule YY with more desirable properties based on an input molecule XX. The state-of-the-art approaches partition the molecules into a large set of substructures SS and grow the new molecule structure by iteratively predicting which substructure from SS to add. However, s…

2019-11-23abs ↗pdf ↗

We propose a simple auto-encoder framework for molecule generation. The molecular graph is first encoded into a continuous latent representation zz, which is then decoded back to a molecule. The encoding process is easy, but the decoding process remains challenging. In this work, we introduce a simple two-step decodin…

2019-06-08abs ↗pdf ↗

New framework extends graph neural networks by improving expressiveness and space efficiency.

problem Limitations of existing graph neural networks, particularly in expressive power and space complexity.
method Proposed (k,t)(k,t)-FWL+, a flexible and powerful framework that combines (k,t)(k,t)-FWL and kk-FWL+.
result Demonstrated N2^2-FWL, a practical and theoretically sound instance of (k,t)(k,t)-FWL+, achieving record-breaking results on ZINC-Subset.

MusPy is a toolkit for symbolic music generation, providing tools for dataset management and analysis.

problem Facilitating the creation and analysis of symbolic music datasets.
method Development of an open-source Python library (MusPy) with features for dataset management, data I/O, preprocessing, and model evaluation. Demonstrated through statistical analysis and cross-dataset generalizability experiments.
result MusPy's dataset analysis reveals varying degrees of cross-genre representation across different music datasets.

In this paper, we propose a data collaboration analysis method for distributed datasets. The proposed method is a centralized machine learning while training datasets and models remain distributed over some institutions. Recently, data became large and distributed with decreasing costs of data collection. If we can cen…

2019-02-20abs ↗pdf ↗

StyleDiff compares unlabeled datasets using disentangled image spaces.

problem Mismatches between development and real-world datasets lead to inaccurate predictions.
method Uses disentangled image spaces and focuses on attributes to compare datasets.
result Accurately detects and presents differences between datasets.

In this paper, we propose a novel method for generating a synthetic dataset obeying Gaussian distribution. Compared to the commonly used benchmark datasets with unknown distribution, the synthetic dataset has an explicit distribution, i.e., Gaussian distribution. Meanwhile, it has the same characteristics as the benchm…

2019-06-01abs ↗pdf ↗

New framework assesses graph-learning datasets for better evaluation.

problem Insufficient evaluation of graph-learning datasets and methods.
method Introduces Rings framework for dataset ablations and proposes performance separability and mode complementarity measures.
result Demonstrates utility of Rings framework for graph-learning dataset evaluation.

In this paper, we introduce the Fairness GAN, an approach for generating a dataset that is plausibly similar to a given multimedia dataset, but is more fair with respect to protected attributes in allocative decision making. We propose a novel auxiliary classifier GAN that strives for demographic parity or equality of …

2018-05-24abs ↗pdf ↗

MTL method uses unlabeled data with pseudo labels to improve classification with disjoint datasets.

problem Improving classification performance with disjoint labeled datasets using unlabeled data.
method Proposes MTL-SA method to select and augment unlabeled data with confident pseudo labels and close distribution to labeled data.
result Extensive experiments show the effectiveness of MTL-SA method in improving classification performance.

The study examines dataset usage patterns in machine learning research.

problem Lack of attention to dataset dynamics in machine learning research.
method Analysis of dataset usage patterns across machine learning subcommunities and time periods (2015-2020).
result Increasing concentration on fewer and fewer datasets, significant adoption from other tasks, and concentration across the field on datasets introduced by elite institutions.

Method embeds numeric tabular datasets into a shared vector space for similarity and retrieval.

problem Lack of meaningful representation for numeric tabular datasets in large language models.
method Structured exploratory data analysis descriptors, sentence transformer embedding, CCA for cross-dataset alignment.
result Total P@1 score of 0.9 across 15 datasets, robust nearest-neighbor retrieval and cluster structure.

This paper presents the recently published Cerema AWP (Adverse Weather Pedestrian) dataset for various machine learning tasks and its exports in machine learning friendly format. We explain why this dataset can be interesting (mainly because it is a greatly controlled and fully annotated image dataset) and present base…

2018-06-11abs ↗pdf ↗

Dataset distillation is a method for reducing dataset sizes by learning a small number of synthetic samples containing all the information of a large dataset. This has several benefits like speeding up model training, reducing energy consumption, and reducing required storage space. Currently, each synthetic sample is …

2019-10-06abs ↗pdf ↗

New framework transforms labeled datasets for various machine learning tasks.

problem Lack of principled methods to transform labeled datasets.
method Wasserstein gradient flows in probability space for optimization of data-generating distributions.
result Framework can impose constraints, adapt for transfer learning, or re-purpose models.

Elastic co-clustering improves clustering of single-cell genomic data.

problem Improving clustering performance of single-cell genomic datasets.
method Elastic coupled co-clustering in an unsupervised transfer learning framework.
result Our algorithm significantly improves clustering performance over traditional methods.

Combines datasets to improve model fitting with small sample sizes.

problem Improving model performance with limited samples from at least one dataset.
method Proposes a novel framework called Combine datasets based on Imputation (ComImp) and PCA-ComImp for combining datasets with missing data.
result Significant improvement in model accuracy, especially with small datasets and when combined with transfer learning.

An efficient learner is one who reuses what they already know to tackle a new problem. For a machine learner, this means understanding the similarities amongst datasets. In order to do this, one must take seriously the idea of working with datasets, rather than datapoints, as the key objects to model. Towards this goal…

2016-06-07abs ↗pdf ↗

The study improves theoretical understanding of using multiple synthetic datasets for better model accuracy.

problem Lack of theoretical understanding of using multiple synthetic datasets for supervised learning.
method Derive bias-variance decompositions for multiple synthetic datasets settings.
result A simple rule of thumb to select the appropriate number of synthetic datasets.

Dataset pruning is the process of removing sub-optimal tuples from a dataset to improve the learning of a machine learning model. In this paper, we compared the performance of different algorithms, first on an unpruned dataset and then on an iteratively pruned dataset. The goal was to understand whether an algorithm (s…

2019-01-11abs ↗pdf ↗

New dataset for industrial machine malfunction detection with domain shifts.

problem Challenges in detecting anomalies due to domain shifts in industrial sounds.
method Created a dataset with domain shifts for five types of industrial machines.
result Significant performance differences between source and target domains.

A new method distills datasets more efficiently and effectively.

problem Achieving competitive performance on test data with a small synthetic dataset.
method Tackles dataset distillation as a bilevel optimization problem, introduces RaT-BPTT to stabilize gradients and speed up optimization.
result Establishes new state-of-the-art performance across various benchmarks.

Develops efficient algorithm for distilling supervised and offline RL datasets.

problem Creating synthetic datasets for supervised and offline RL models to match training data performance.
method An efficient algorithm based on matching losses without model training, using randomly sampled regressors.
result Synthetic datasets derived with ildeO(d2) ilde{O}(d^2) sampled regressors match MSE loss of bounded linear models on training data.