Machine learning force fields

OT Unke, S Chmiela, HE Sauceda… - Chemical …, 2021 - ACS Publications
In recent years, the use of machine learning (ML) in computational chemistry has enabled
numerous advances previously out of reach due to the computational complexity of …

A survey on graph kernels

NM Kriege, FD Johansson, C Morris - Applied Network Science, 2020 - Springer
Graph kernels have become an established and widely-used technique for solving
classification tasks on graphs. This survey gives a comprehensive overview of techniques …

Image matching from handcrafted to deep features: A survey

J Ma, X Jiang, A Fan, J Jiang, J Yan - International Journal of Computer …, 2021 - Springer
As a fundamental and critical task in various visual applications, image matching can identify
then correspond the same or similar structure/content from two or more images. Over the …

Towards exact molecular dynamics simulations with machine-learned force fields

S Chmiela, HE Sauceda, KR Müller… - Nature …, 2018 - nature.com
Molecular dynamics (MD) simulations employing classical force fields constitute the
cornerstone of contemporary atomistic modeling in chemistry, biology, and materials …

Spectral methods for data science: A statistical perspective

Y Chen, Y Chi, J Fan, C Ma - Foundations and Trends® in …, 2021 - nowpublishers.com
Spectral methods have emerged as a simple yet surprisingly effective approach for
extracting information from massive, noisy and incomplete data. In a nutshell, spectral …

[HTML][HTML] sGDML: Constructing accurate and data efficient molecular force fields using machine learning

S Chmiela, HE Sauceda, I Poltavsky, KR Müller… - Computer Physics …, 2019 - Elsevier
We present an optimized implementation of the recently proposed symmetric gradient
domain machine learning (sGDML) model. The sGDML model is able to faithfully reproduce …

Scalable Gromov-Wasserstein learning for graph partitioning and matching

H Xu, D Luo, L Carin - Advances in neural information …, 2019 - proceedings.neurips.cc
We propose a scalable Gromov-Wasserstein learning (S-GWL) method and establish a
novel and theoretically-supported paradigm for large-scale graph analysis. The proposed …

Neural graph matching network: Learning lawler's quadratic assignment problem with extension to hypergraph and multiple-graph matching

R Wang, J Yan, X Yang - IEEE Transactions on Pattern …, 2021 - ieeexplore.ieee.org
Graph matching involves combinatorial optimization based on edge-to-edge affinity matrix,
which can be generally formulated as Lawler's quadratic assignment problem (QAP). This …

On valid optimal assignment kernels and applications to graph classification

NM Kriege, PL Giscard… - Advances in neural …, 2016 - proceedings.neurips.cc
The success of kernel methods has initiated the design of novel positive semidefinite
functions, in particular for structured data. A leading design paradigm for this is the …

Search and rescue under the forest canopy using multiple UAVs

Y Tian, K Liu, K Ok, L Tran, D Allen… - … Journal of Robotics …, 2020 - journals.sagepub.com
We present a multi-robot system for GPS-denied search and rescue under the forest canopy.
Forests are particularly challenging environments for collaborative exploration and mapping …