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,695 papers · 148 categories

Trend · papers per month

5111621 · Jun 202019922001200920172026
48 results for atom skipping

Paper analyzes the free energy of CNNs with skip connections in Bayesian learning.

problem Dependency of CNNs with skip connections on the number of parameters.
method Examines the Bayesian free energy of CNNs with and without skip connections.
result The upper bound of free energy of Bayesian CNN with skip connections does not depend on overparametrization.

Self-supervised skip-tree training improves mathematical reasoning in language models.

problem Improving logical reasoning in language models for formal mathematics.
method Self-supervised language modeling on mathematical formulas, skip-tree task.
result Models trained on skip-tree task outperform standard models in mathematical reasoning tasks.

TabSODA improves imputation of surveys with skips and ordinal data.

problem Handling structural skips and ordinal responses in survey data.
method TabSODA uses an Elucidated Diffusion Model with skip pattern detection and ordinal awareness.
result TabSODA reduces ordinal missing-at-random (MACE) by up to 23.7% and improves categorical accuracy by up to 9%.

The paper proves skip connections help neural networks avoid shallow local minima.

problem Understanding how skip connections affect the loss landscape of deep neural networks.
method Theoretical analysis of the topology of loss landscapes of deep ReLU neural networks with skip connections.
result Skip connections help control the connectedness of sub-level sets, avoiding shallow local minima.

This paper examines how skip connections prevent rank collapse in sequence models.

problem Rank collapse in sequence models, leading to reduced expressivity and training instabilities.
method Analytical and ablation studies of lambda-skip connections in SSMs.
result A sufficient condition to prevent rank collapse across various architectures.

While increasingly deep networks are still in general desired for achieving state-of-the-art performance, for many specific inputs a simpler network might already suffice. Existing works exploited this observation by learning to skip convolutional layers in an input-dependent manner. However, we argue their binary deci…

2020-01-03abs ↗pdf ↗

Boost-and-Skip generates minority samples without guidance, faster and more effectively.

problem Generating minority samples in low-density regions of a data manifold.
method Boost-and-Skip approach with variance-boosted initialization and timestep skipping.
result Boost-and-Skip effectively promotes the emergence of underrepresented minority features.

New insights into GNN optimization reveal skip connections and depth accelerate training.

problem Understanding and optimizing the training of Graph Neural Networks (GNNs).
method Analysis of gradient dynamics in linearized GNNs and empirical validation.
result GNNs are implicitly accelerated by skip connections, more depth, and good label distribution during training.

Unified theory linking atom-centered and message-passing models for molecular properties.

problem Combining atom-centered and message-passing models for accurate molecular property prediction.
method Generalizing ACDC framework to include multi-centered information, providing a complete linear basis for regression.
result Unified understanding of atom-centered and message-passing models, providing a coherent foundation.

This work analyzes how bottleneck layers and skip connections affect linear denoising autoencoders' generalization.

problem Understanding the generalization of linear denoising autoencoders in overparameterized regimes.
method Analyzes two-layer linear denoising autoencoders with a bottleneck layer and skip connection, deriving test risk formulas.
result Bottleneck layers introduce an additional complexity measure, while skip connections can mitigate variance.

The atomic swap protocol allows for the exchange of cryptocurrencies on different blockchains without the need to trust a third-party. However, market participants who desire to hold derivative assets such as options or futures would also benefit from trustless exchange. In this paper I propose the atomic swaption, whi…

2018-07-20abs ↗pdf ↗

New features for quantum calculations learn N-center Hamiltonian matrix elements.

problem Quantum calculations need features for N-center Hamiltonians, not just atom-centered ones.
method Developed fully equivariant N-center features for machine learning.
result Learned matrix elements of N-center Hamiltonians efficiently.

Variational autoencoders learn distributions of high-dimensional data. They model data with a deep latent-variable model and then fit the model by maximizing a lower bound of the log marginal likelihood. VAEs can capture complex distributions, but they can also suffer from an issue known as "latent variable collapse," …

2018-07-12abs ↗pdf ↗

Study compares atom representations in graph neural networks for molecular properties.

problem Incorrect attribution of results in molecular property prediction due to varying atom features.
method Evaluated multiple atom representations on free energy, solubility, and metabolic stability predictions.
result Different atom representations can lead to varying predictive performance in graph neural networks.

Neural network learns atomic coordinates from Patterson maps in a simplified case.

problem Training a neural network to infer atomic coordinates from Patterson maps.
method Synthetic data training, centering output maps, removing centrosymmetric inversion, and adding empty space.
result The network can generalize to infer atom positions from Patterson maps not in the training set.

Theory explains why DARTS favors deep architectures over shallow ones.

problem DARTS selects architectures with dominated skip connections, leading to performance degradation.
method Theoretical analysis of operations' effects on network optimization; introduces sparse binary gates and path-depth-wise regularization.
result Theoretical proof that architectures with more skip connections converge faster.

We introduce a novel class of localized atomic environment representations, based upon the Coulomb matrix. By combining these functions with the Gaussian approximation potential approach, we present LC-GAP, a new system for generating atomic potentials through machine learning (ML). Tests on the QM7, QM7b and GDB9 biom…

2016-11-16abs ↗pdf ↗

Generates low-dimensional node vectors for graphs with privacy while preserving structural preferences.

problem Publishing graph node vectors can leak sensitive individual information.
method SE-PrivGEmb, a skip-gram based technique with a unified noise tolerance mechanism and negative sampling probabilities.
result Our method outperforms existing methods in structural equivalence and link prediction tasks.

Non-atomic arbitrage exploits price differences on Ethereum and other blockchains, accounting for over 10% of Ethereum's block value.

problem Price differences on decentralized exchanges and centralized exchanges lead to MEV.
method Analyzed non-atomic arbitrage on Ethereum's largest DEXes, identifying its prevalence and impact.
result More than 10% of Ethereum's block value is attributed to non-atomic arbitrage, involving over $132 billion.

One endeavour of modern physical chemistry is to use bottom-up approaches to design materials and drugs with desired properties. Here we introduce an atomistic structure learning algorithm (ASLA) that utilizes a convolutional neural network to build 2D compounds and layered structures atom by atom. The algorithm takes …

2019-02-27abs ↗pdf ↗

Simplified Bayesian neural networks reduce model complexity and improve interpretability.

problem Over-parameterization and interpretability issues in deep learning models.
method Input-skip Latent Binary Bayesian Neural Networks (LBBNNs) that allow covariates to skip layers or be excluded.
result Significant reduction in model complexity (over 99%) with minimal loss in accuracy and uncertainty.

Distributed model training suffers from communication overheads due to frequent gradient updates transmitted between compute nodes. To mitigate these overheads, several studies propose the use of sparsified stochastic gradients. We argue that these are facets of a general sparsification method that can operate on any p…

2018-06-11abs ↗pdf ↗

This paper explains GCNs using NTKs and improves their performance.

problem GCNs' performance degrades with depth, and skip connections marginally improve it.
method Derive NTKs for GCNs, validate with simulations, propose NTK as a surrogate model.
result Suitable normalisation can prevent drastic performance drop with depth.

In many signal processing applications, the aim is to reconstruct a signal that has a simple representation with respect to a certain basis or frame. Fundamental elements of the basis known as "atoms" allow us to define "atomic norms" that can be used to formulate convex regularizations for the reconstruction problem. …

2014-04-23abs ↗pdf ↗

Proposes an algorithm for infinite-dimensional sparse learning in system identification.

problem System identification without known model structures.
method Atomic norm regularization and greedy algorithm for solving an infinite-dimensional group lasso problem.
result The proposed algorithm outperforms benchmark methods in impulse response fitting and pole location estimation.

In this work, we extend the SchNet architecture by using weighted skip connections to assemble the final representation. This enables us to study the relative importance of each interaction block for property prediction. We demonstrate on both the QM9 and MD17 dataset that their relative weighting depends strongly on t…

2018-10-23abs ↗pdf ↗

A new method learns dynamic graph representations from time-varying data.

problem Learning dynamic graph representations from time-varying data.
method Higher-order skip-gram with negative sampling (HOSGNS) for tensor factorization.
result HOSGNS outperforms state-of-the-art methods in downstream tasks.