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

8.3%16.7%25.0%33.3% · Jan 199319922001200920172026
48 results for atomic cycle execution

Proposes a new method for completing swap cycles in decentralized exchanges.

problem Completing swap cycles in decentralized exchanges efficiently and without slippage.
method Introduces an asset matrix formulation to verify and complete CoW cycles using graph traversal and imbalance correction.
result Demonstrates efficient discovery and insertion of synthetic orders for atomic cycle closure.

Paper introduces Cycles Protocol to integrate trade credit into market clearing.

problem Liquidity embedded in trade credit outside formal settlement infrastructures.
method Distributed, multilateral clearing mechanism based on double-entry accounting.
result Cycles Protocol maximizes balance sheet compression without redistributing counterparty risk.

Study local moduli of Sasaki-Einstein metrics on specific polynomial links.

problem Understanding the local moduli of Sasaki-Einstein metrics on links of invertible polynomials.
method Analyzing Sasaki-Einstein metrics on links of invertible polynomials of cycle type and Thom-Sebastiani sums.
result For polynomials of cycle type, local moduli spaces are zero-dimensional. For Thom-Sebastiani sums, dimensions are positive.

Graph generation techniques are increasingly being adopted for drug discovery. Previous graph generation approaches have utilized relatively small molecular building blocks such as atoms or simple cycles, limiting their effectiveness to smaller molecules. Indeed, as we demonstrate, their performance degrades significan…

2020-02-08abs ↗pdf ↗

New smart contract mechanisms evade traditional AML systems by decoupling transaction roles.

problem Current AML systems fail to track economic value migration in composable smart contracts.
method Introduce PEB separation and state-mediated value migration to demonstrate how traditional tracing fails.
result Transfer-layer observation is incomplete and causally ambiguous in composable smart contracts.

This work optimizes DNN inference for energy-harvesting devices by compressing and selectively executing neural network exits.

problem Inference delays and energy inefficiency in energy-harvesting devices.
method Developed a power trace-aware and exit-guided network compression algorithm for multi-exit neural networks.
result Superior accuracy and reduced latency compared to state-of-the-art techniques.

The paper investigates cyclic arbitrage opportunities in decentralized exchanges.

problem Price discrepancies in decentralized exchanges lead to arbitrage opportunities.
method Theoretical framework and analysis of transaction-level data.
result Traders have executed over 292,606 cyclic arbitrages over eleven months, exploiting more than 138 million USD in revenue.

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.

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.

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.

KineticSim: A lightweight, high-performance execution engine for real-time market simulators

problem Simulating financial markets at scale with multi-agent models
method Reusable parallel design pattern: persistent, state-carrying clearing for iterative multi-agent reductions
result Reduces per-step critical-path depth from Theta(L+A) to Theta(log L + ceil(A/L))

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.

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 ↗

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.

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.

Optimizes experiment design for causal structure learning in linear models with cycles.

problem Causal structure learning from combined observational and interventional data in linear non-Gaussian cyclic models.
method Combinatorial characterization of equivalence classes, adaptive stochastic optimization, greedy policy with near-optimal performance guarantee, sampling-based estimator for reward function.
result Optimal experiment design reduces the equivalence class of causal graphs to a single true graph with a small number of interventions.

Generative models have achieved impressive results in many domains including image and text generation. In the natural sciences, generative models have led to rapid progress in automated drug discovery. Many of the current methods focus on either 1-D or 2-D representations of typically small, drug-like molecules. Howev…

2019-09-03abs ↗pdf ↗

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 ↗