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

Trend · papers per month

1.2%2.4%3.6%4.8% · Sep 199619922001200920172026
48 results for atomic fission

A new clustering algorithm fuses heat diffusion and turning angle for robustness.

problem Cluster similar elements in various fields.
method Combines heat diffusion and maximal turning angle for robust fission clustering.
result The SARFC algorithm outperforms other methods in clustering performance.

We analyze a functor from cyclic operads to chain complexes first considered by Getzler and Kapranov and also Markl. This functor is a generalization of the graph homology considered by Kontsevich, which was defined for the three operads Comm, Assoc, and Lie. More specifically we show that these chain complexes have a …

2002-08-12abs ↗pdf ↗

Study of wild mapping class groups and their cabled braids.

problem Understanding the structure of wild mapping class groups and their cabled versions.
method Define and study generalizations of pure g\mathfrak{g}-braid groups, establish product decompositions, and introduce fission trees.
result Obtain cabled versions of braid groups, related to braid operads.

Study of wild mapping class groups on complex reflection groups.

problem Understanding deformations of wild Riemann surfaces.
method Construction of configuration spaces and combinatorial fission forests.
result Sharp parameterisation of admissible deformation classes of wild Riemann surfaces.

A method to split a data point into two parts that individually cannot reconstruct the whole, but together can.

problem Splitting a single data point into two parts such that neither can reconstruct the whole but together can.
method Borrowing ideas from Bayesian inference to achieve a continuous analog of data splitting.
result A method to achieve data fission, enabling post-selection inference in finite samples.

RAD estimates gradients with less memory, faster than small batch sizes.

problem Training deep models with stochastic gradient descent requires exact gradients, but they are not needed.
method Developed a framework for randomized automatic differentiation (RAD) to compute unbiased gradient estimates with reduced memory.
result RAD converges in fewer iterations than using a small batch size for feedforward networks and similar number for recurrent networks.

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.

Study local wild mapping class groups for irregular connections on complex curves.

problem Understanding the moduli spaces of irregular connections on complex curves.
method Using isomonodromic deformations, focusing on reflections cosets, and introducing fission trees.
result Complete classification of local wild mapping class groups for various structure groups.

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.

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.

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.

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 ↗

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.

Graph neural network predicts protonation energies of oxygen atoms in bio-oil molecules.

problem Predicting protonation energies of oxygen atoms in bio-oil molecules for chemical upgrading.
method Site-specific graph neural network approach using iterative local nonlinear embedding.
result Effective prediction of protonation energies of individual oxygen atoms in bio-oil molecules.

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 ↗

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 ↗

Improves molecular activity prediction using graph convolutional neural networks considering graph distances.

problem Predicting molecular activity using graph convolutional neural networks with improved distance representation.
method Proposed three improvements: modified graph distances, distance-dependent weight matrices, and weighted sum conversion.
result The proposed method slightly outperforms the original weave module in compound activity prediction.

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.

Generative models encode and decode 3D crystal structures from a large dataset.

problem Challenges in encoding and decoding 3D crystal structures from large datasets.
method Training two neural networks on a dataset of over 120,000 crystal structures to encode and decode 3D atom positions.
result Ability to generate compressed, continuous latent space representations and decode molecules accurately.

Recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab-initio calculations) and at speeds suitable for molecular dynam- ics simulation. Best performance is achieved when the known physical constraints are encoded in the mac…

2016-12-01abs ↗pdf ↗

MuML models predict molecular dipole moments using atomic partial charges and dipoles.

problem Predicting molecular dipole moments accurately and efficiently.
method Combining atomic partial charges and atomic dipoles within a physically inspired ML model.
result MuML models achieve excellent transferability and accuracy, approaching DFT results at a fraction of the computational cost.

Optimizes basis for density-based atomic representations to enhance compactness and accuracy.

problem Improving the efficiency and accuracy of machine learning models for atomic properties.
method An unsupervised approach to determine the optimal basis set for atom density representations using splines.
result Optimal basis sets that encode structural information more compactly and accurately.

A new graph model HMG and neural network HMGNN improve molecule property predictions.

problem Predicting quantum mechanical properties of molecules with limited consideration of many-body interactions.
method Introducing heterogeneous molecular graphs (HMG) and building HMGNN on neural message passing scheme.
result HMGNN achieves state-of-the-art performance in 9 out of 12 tasks on the QM9 dataset.

This study uses neural networks to solve interpolation problems with sparse, infinitely wide layers.

problem Exact data interpolation using sparse, infinitely wide neural networks.
method Atomic norm framework to derive convex hulls and equivalent convex formulations.
result Simple characterizations of convex hulls for different constraints on network weights and biases.

In signal analysis and synthesis, linear approximation theory considers a linear decomposition of any given signal in a set of atoms, collected into a so-called dictionary. Relevant sparse representations are obtained by relaxing the orthogonality condition of the atoms, yielding overcomplete dictionaries with an exten…

2014-11-01abs ↗pdf ↗

Hydrogen atom confined in an inverted-Gaussian potential, with detailed numerical methods and results.

problem Studying hydrogen atom in a specific potential.
method Three numerical methods: Lagrange-mesh, fourth order finite differences, and finite element method.
result Accurate numerical results for hydrogen atom energies and eigenfunctions, improving previous literature.

A new method predicts electron density accurately from atom-centered models.

problem Predicting electron density accurately from atom-centered models.
method Gradient-based approach to minimize loss function in an optimized sparse feature space.
result Extremely accurate predictions of electron density and total energies.