Scalar Coupling Constant Prediction Using Graph Embedding Local Attention Encoder

• URL: http://arxiv.org/abs/2009.04522v1
• Date: Mon, 7 Sep 2020 02:53:03 GMT
• Title: Scalar Coupling Constant Prediction Using Graph Embedding Local Attention Encoder
• Abstract summary: Scalar coupling constant ( SCC) plays a key role in the analysis of three-dimensional structure of organic matter. To calculate SCC efficiently and accurately, we proposed a graph embedding local self-attention encoder (GELAE) model. We conducted a series of comparison experiments using different structure representations, different attention modules, and different losses. With the graph embedded local self-attention, the mean absolute error (MAE) of the prediction model in the validation set decreases from 0.1603 Hz to 0.1067 Hz.
• Score: 4.853665900411843
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Scalar coupling constant (SCC) plays a key role in the analysis of three-dimensional structure of organic matter, however, the traditional SCC prediction using quantum mechanical calculations is very time-consuming. To calculate SCC efficiently and accurately, we proposed a graph embedding local self-attention encoder (GELAE) model, in which, a novel invariant structure representation of the coupling system in terms of bond length, bond angle and dihedral angle was presented firstly, and then a local self-attention module embedded with the adjacent matrix of a graph was designed to extract effectively the features of coupling systems, finally, with a modified classification loss function, the SCC was predicted. To validate the superiority of the proposed method, we conducted a series of comparison experiments using different structure representations, different attention modules, and different losses. The experimental results demonstrate that, compared to the traditional chemical bond structure representations, the rotation and translation invariant structure representations proposed in this work can improve the SCC prediction accuracy; with the graph embedded local self-attention, the mean absolute error (MAE) of the prediction model in the validation set decreases from 0.1603 Hz to 0.1067 Hz; using the classification based loss function instead of the scaled regression loss, the MAE of the predicted SCC can be decreased to 0.0963 HZ, which is close to the quantum chemistry standard on CHAMPS dataset.

Related papers

• Unified Geometry-Guided ML-FTLE for Tracking Transient Chaos from Scalar Time Series [0.0]
  We propose a geometry-guided machine learning framework that unifies predictive trajectory divergence with macroscopic attractor morphology to track abrupt regime shifts.<n>This equation-free framework provides a highly accurate, noise-resilient diagnostic for monitoring structural transitions in complex non-stationary systems.
  arXiv  Detail & Related papers  (2026-06-05T15:22:57Z)
• Cross-Domain Lossy Compression via Constrained Minimum Entropy Coupling [5.404926467615337]
  We study cross-domain lossy compression through the lens of minimum entropy coupling (MEC) with rate and classification constraints.<n>Motivated by logarithmic-loss distortion, we adopt an information-based objective that maximizes the coupling strength between the source and reconstruction.<n> Experiments on MNIST super-resolution and SVHN denoising show that increasing the available rate improves classification accuracy and yields more informative reconstructions.
  arXiv  Detail & Related papers  (2026-05-11T00:19:11Z)
• Introducing the Correlation Concentration Ratio (CCR): Quantitative Framework for Comparing Quantum Cluster States [0.0]
  The process of generating cluster states with linear, square, and T-shaped topologies has been systematically modeled.<n>The simulation results show that the cluster graph structure is directly reflected in the pattern of quadrature correlations.<n>A metric titled CCR is introduced that quantifies the concentration of effective correlations on the graph edges relative to the total correlations of the system.
  arXiv  Detail & Related papers  (2026-04-25T11:50:43Z)
• FRIGID: Scaling Diffusion-Based Molecular Generation from Mass Spectra at Training and Inference Time [52.735012862324766]
  We present FRIGID, a framework with a novel diffusion language model that generates structures conditioned on mass spectra.<n>We show how forward fragmentation models enable inference-time scaling by identifying spectrum-inconsistent fragments.<n>Further empirical analyses show that FRIGID exhibits log-linear performance scaling with increasing inference-time compute.
  arXiv  Detail & Related papers  (2026-04-17T19:11:18Z)
• Cosine-Normalized Attention for Hyperspectral Image Classification [7.170991480063844]
  Transformer-based methods have improved hyperspectral image classification (HSIC) by modeling long-range spatial-spectral dependencies.<n>This work revisits attention scoring from a geometric perspective and introduces a cosine-normalized attention formulation.<n> Experiments on three benchmark datasets demonstrate that the proposed approach consistently achieves higher performance.
  arXiv  Detail & Related papers  (2026-04-02T08:32:12Z)
• K-Means as a Radial Basis function Network: a Variational and Gradient-based Equivalence [41.99844472131922]
  This work establishes a rigorous variational and gradient-based equivalence between the classical K-Means algorithm and differentiable Basis Radial Function neural networks.<n>We show that the RBF objective $$-converges to the K-Means solution as the temperature parameter $$ vanishes.<n>We also propose the integration of Ent-max-1.5, which ensures stable convergence while preserving the underlying Voronoi partition structure.
  arXiv  Detail & Related papers  (2026-03-04T21:41:50Z)
• Evaluating Cumulative Spectral Gradient as a Complexity Measure [0.0]
  Cumulative Spectral Gradient (CSG) was proposed as a dataset complexity measure.<n>In this work, we rigorously assess CSG behavior on standard knowledge graph link prediction benchmarks.
  arXiv  Detail & Related papers  (2025-09-02T15:10:25Z)
• ReDiSC: A Reparameterized Masked Diffusion Model for Scalable Node Classification with Structured Predictions [64.17845687013434]
  We propose ReDiSC, a structured diffusion model for structured node classification.<n>We show that ReDiSC achieves superior or highly competitive performance compared to state-of-the-art GNN, label propagation, and diffusion-based baselines.<n> Notably, ReDiSC scales effectively to large-scale datasets on which previous structured diffusion methods fail due to computational constraints.
  arXiv  Detail & Related papers  (2025-07-19T04:46:53Z)
• ZClassifier: Temperature Tuning and Manifold Approximation via KL Divergence on Logit Space [0.0]
  We introduce a novel classification framework, ZClassifier, that replaces conventional deterministic logits with diagonal Gaussian-distributed logits.<n>Our method simultaneously addresses temperature scaling and manifold approximation by minimizing the Kullback-Leibler divergence between the predicted Gaussian distributions and a unit isotropic Gaussian.<n>This uncertainty unifies calibration and latent control in a principled probabilistic manner, enabling a natural interpretation of class confidence and geometric consistency.
  arXiv  Detail & Related papers  (2025-07-14T13:30:40Z)
• Coupled cluster method tailored by quantum selected configuration interaction [0.0]
  We present a hybrid quantum-classical scheme that tailors coupled-cluster (CC) theory with a quantum-selected configuration interaction (QSCI) wave function.<n>QSCI provides a scalable, shot-efficient approach to reconstructing the many-electron state prepared on quantum hardware.
  arXiv  Detail & Related papers  (2025-06-20T11:07:26Z)
• Hyperspectral Anomaly Detection Fused Unified Nonconvex Tensor Ring Factors Regularization [37.478757438237714]
  We present HAD-EUNTRFR, which incorporates an enhanced unified non-spectral framework (TR) regularization factors.<n>Our proposed method outperforms existing state-of-the-art (SOTA) approaches in terms of terms terms terms accuracy.
  arXiv  Detail & Related papers  (2025-05-23T13:31:13Z)
• Robust Confinement State Classification with Uncertainty Quantification through Ensembled Data-Driven Methods [39.27649013012046]
  We develop methods for confinement state classification with uncertainty quantification and model robustness.<n>We focus on off-line analysis for TCV discharges, distinguishing L-mode, H-mode, and an in-between dithering phase (D)<n>A dataset of 302 TCV discharges is fully labeled, and will be publicly released.
  arXiv  Detail & Related papers  (2025-02-24T18:25:22Z)
• Interpretable Recognition of Fused Magnesium Furnace Working Conditions with Deep Convolutional Stochastic Configuration Networks [0.18641315013048293]
  This paper proposes an interpretable working condition recognition method based on deep convolutional configuration networks (DCSCNs) Supervised learning mechanism is employed to generate physically meaningful differential convolution kernels. Joint reward function is constructed based on the recognition accuracy, the interpretable trustworthiness evaluation metrics, and the model parameter quantity.
  arXiv  Detail & Related papers  (2025-01-06T03:17:41Z)
• Simple Fermionic backflow states via a systematically improvable tensor decomposition [0.0]
  We present an effective ansatz for the wave function of correlated electrons that brings closer the fields of machine learning parameterizations and tensor rank decompositions. We consider a CANDECOMP/PARAFAC (CP) tensor factorization of a general backflow transformation in second quantization for a simple, compact and systematically improvable Fermionic state.
  arXiv  Detail & Related papers  (2024-07-16T14:37:20Z)
• Accelerated sparse Kernel Spectral Clustering for large scale data clustering problems [0.27257174044950283]
  An improved version of the sparse multiway kernel spectral clustering (KSC) is presented in this brief. The original algorithm is derived from weighted kernel principal component analysis formulated within the primal-dual least-squares support vector machine (LS-SVM) framework. Sparsity is achieved then by the combination of the incomplete Cholesky decomposition (ICD) based low rank approximation of the kernel matrix with the so called reduced set method.
  arXiv  Detail & Related papers  (2023-10-20T09:51:42Z)
• Regularized Vector Quantization for Tokenized Image Synthesis [126.96880843754066]
  Quantizing images into discrete representations has been a fundamental problem in unified generative modeling. deterministic quantization suffers from severe codebook collapse and misalignment with inference stage while quantization suffers from low codebook utilization and reconstruction objective. This paper presents a regularized vector quantization framework that allows to mitigate perturbed above issues effectively by applying regularization from two perspectives.
  arXiv  Detail & Related papers  (2023-03-11T15:20:54Z)
• Accelerating Quantum Computations of Chemistry Through Regularized Compressed Double Factorization [0.0]
  We propose the regularized compressed double factorization (RC-DF) method to compute compressed representations of molecular Hamiltonians. We find that already for small systems with 12 to 20 qubits, the resulting NISQ measurement scheme reduces the number of measurement bases.
  arXiv  Detail & Related papers  (2022-12-15T16:42:07Z)
• Three-fold way of entanglement dynamics in monitored quantum circuits [68.8204255655161]
  We investigate the measurement-induced entanglement transition in quantum circuits built upon Dyson's three circular ensembles. We obtain insights into the interplay between the local entanglement generation by the gates and the entanglement reduction by the measurements.
  arXiv  Detail & Related papers  (2022-01-28T17:21:15Z)
• Reconcile Prediction Consistency for Balanced Object Detection [10.61438063305309]
  We propose a Harmonic loss to harmonize the optimization of classification branch and localization branch. The Harmonic loss enables these two branches to supervise and promote each other during training. In order to prevent the localization loss from being dominated by outliers during training phase, a Harmonic IoU loss is proposed to harmonize the weight of the localization loss of different IoU-level samples.
  arXiv  Detail & Related papers  (2021-08-24T15:52:11Z)
• Scalable Variational Gaussian Processes via Harmonic Kernel Decomposition [54.07797071198249]
  We introduce a new scalable variational Gaussian process approximation which provides a high fidelity approximation while retaining general applicability. We demonstrate that, on a range of regression and classification problems, our approach can exploit input space symmetries such as translations and reflections. Notably, our approach achieves state-of-the-art results on CIFAR-10 among pure GP models.
  arXiv  Detail & Related papers  (2021-06-10T18:17:57Z)
• An improved spectral clustering method for community detection under the degree-corrected stochastic blockmodel [1.0965065178451106]
  We propose an improved spectral clustering (ISC) approach under the degree corrected block model (SBM) ISC provides a significant improvement on two weak signal networks Simmons and Caltech, with error rates of 121/1137 and 96/590, respectively.
  arXiv  Detail & Related papers  (2020-11-12T13:35:11Z)
• Pruning Redundant Mappings in Transformer Models via Spectral-Normalized Identity Prior [54.629850694790036]
  spectral-normalized identity priors (SNIP) is a structured pruning approach that penalizes an entire residual module in a Transformer model toward an identity mapping. We conduct experiments with BERT on 5 GLUE benchmark tasks to demonstrate that SNIP achieves effective pruning results while maintaining comparable performance.
  arXiv  Detail & Related papers  (2020-10-05T05:40:56Z)
• Calibration of Neural Networks using Splines [51.42640515410253]
  Measuring calibration error amounts to comparing two empirical distributions. We introduce a binning-free calibration measure inspired by the classical Kolmogorov-Smirnov (KS) statistical test. Our method consistently outperforms existing methods on KS error as well as other commonly used calibration measures.
  arXiv  Detail & Related papers  (2020-06-23T07:18:05Z)
• Kullback-Leibler Divergence-Based Fuzzy $C$-Means Clustering Incorporating Morphological Reconstruction and Wavelet Frames for Image Segmentation [152.609322951917]
  We come up with a Kullback-Leibler (KL) divergence-based Fuzzy C-Means (FCM) algorithm by incorporating a tight wavelet frame transform and a morphological reconstruction operation. The proposed algorithm works well and comes with better segmentation performance than other comparative algorithms.
  arXiv  Detail & Related papers  (2020-02-21T05:19:10Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.