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

Trend · papers per month

15294458 · May 202619922001200920172026
48 results for dipole moment

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.

Paper explores ML for UV spectra, showing transferability in chemical space.

problem Modeling excited states and predicting properties of unseen molecules.
method Adapting charge model for excited states, using SchNarc approach.
result ML models can predict properties of unseen molecules and different excited states.

Rotationally equivariant convolutions improve molecular property prediction.

problem Predicting molecular properties using graph neural networks.
method Ablation study with rotationally equivariant and invariant convolutions on QM9 data set.
result Rotationally equivariant layers decrease test error by an average of 23%.

At critical coupling, the interactions of Ginzburg-Landau vortices are determined by the metric on the moduli space of static solutions. The asymptotic form of the metric for two well separated vortices is shown here to be expressible in terms of a Bessel function. A straightforward extension gives the metric for N vor…

2002-05-30abs ↗pdf ↗

In this work we simulate null geodesics for the Bonnor massive dipole metric by implementing a symbolic-numerical algorithm in Sage and Python. This program is also capable of visualizing in 3D, in principle, the geodesics for any given metric. Geodesics are launched from a common point, collectively forming a cone of …

2015-04-19abs ↗pdf ↗

Paper proposes a novel SVM method for creating survival trees.

problem Creating non-linear survival trees for right-censored data.
method L2-regularized dipole splitting criteria with kernel methods.
result Non-linear splits using polynomial and Gaussian kernels show similar predictive power but often smaller tree sizes.

CycleQSM uses deep learning to accurately map tissue magnetic susceptibility without needing paired data.

problem Accurately mapping magnetic susceptibility values from phase images using QSM.
method Unsupervised deep learning approach using physics-informed cycleGAN.
result The method provides more accurate QSM maps compared to existing deep learning approaches.

Molecular dynamics simulations are an important tool for describing the evolution of a chemical system with time. However, these simulations are inherently held back either by the prohibitive cost of accurate electronic structure theory computations or the limited accuracy of classical empirical force fields. Machine l…

2018-12-18abs ↗pdf ↗

The point of the paper is to show some limitations of geometrical optics in the analysis of subwavelength focusing. We analyze the resolution of the image of a line source radiating in the Maxwell fisheye and the Veselago-Pendry slab lens. The former optical medium is deduced from the stereographic projection of a virt…

2009-12-01abs ↗pdf ↗

A variational equation of the fourth order for the free relativistic top is developed starting from the Dixon's system of equations for the motion of the relativistic dipole. The obtained equation is then cast into the homogeneous space-time Hamiltonian form.

2015-10-21abs ↗pdf ↗

Study on bending energy of surfaces with curvature concentration, deriving new lower bounds.

problem Analyzing the Willmore energy of surfaces with curvature concentration.
method Using isoperimetric inequalities and framed loops, derive new lower bounds for the bending energy.
result Optimal blowup rates of the Willmore energy when curvature is concentrated.

DenSNet learns electron densities for molecular dynamics, enabling accurate spectroscopic predictions.

problem Lack of accurate electronic observables in MLIPs for molecular dynamics.
method DenSNet uses SE(3)-equivariant neural networks to predict electron densities and total energy.
result DenSNet predicts infrared spectra with excellent agreement to experimental data.

We study the Seifert surfaces of a link by relating the embeddings of graphs by using induced graphs. As applications, we prove that every link LL is the boundary of an oriented surface which is obtained from a graph embedding of a complete bipartite graph K2,nK_{2,n}, where all voltage assignments on the edges of $K_{2…

2013-02-15abs ↗pdf ↗

We study a supersymmetry-preserving solution-generating method in heterotic supergravity. In particular, we use this method to construct one-parameter non-Kahler deformations of Calabi-Yau manifolds with a U(1) isometry, in which the complex structure remains invariant. We explain how to obtain corresponding solutions …

2010-10-19abs ↗pdf ↗

We implement machine learning algorithms to nuclear data. These algorithms are purely data driven and generate models that are capable to capture intricate trends. Gradient boosted trees algorithm is employed to generate a trained model from existing nuclear data, which is used for prediction for data of damping parame…

2019-07-23abs ↗pdf ↗

A soap film is actually a thin solid fluid bounded by two surfaces of opposite orientation. It is natural to model the film using one polyhedron for each side. Two problems are to get the polyhedra for both sides to be in the same place without canceling each other out and to model triple junctions without introducing …

2004-01-03abs ↗pdf ↗

In \cite{Boed}, C.-F. Bödigheimer constructed a finite cell-complex $\mf{Par}_{g,n,m}$ and a bijective map $\cH: \mf{Dip}_{g,n,m} \to \mf{Par}_{g,n,m}$ (the Hilbert-uniformization) from the moduli space of dipole functions on Riemann surfaces with nn directions and mm punctures to $\mf{Par}_{g,n,m}$. In \cite{Boed} a…

2006-01-16abs ↗pdf ↗

Fixed angles of convex polygons lead to combinatorially rich polytopes.

problem Understanding the structure of convex polygons with fixed vertex angles.
method Combining combinatorial and geometric approaches, including dual polytopes and Schwarz-Christoffel maps.
result Fixed-angles polytopes are dual to cyclic polytopes under certain conditions.

For a GJR-GARCH specification with a generic innovation distribution we derive analytic expressions for the first four conditional moments of the forward and aggregated returns and variances. Moment for the most commonly used GARCH models are stated as special cases. We also the limits of these moments as the time hori…

2018-08-29abs ↗pdf ↗

This paper identifies and bounds ICE central moments using PO marginal central moments.

problem Identifying and characterizing treatment effect heterogeneity.
method Using only marginal central moments of potential outcomes, the paper identifies and bounds central moments of individual causal effects.
result Identification and bounding of central moments of ICE using marginal moments of POs.

We tackle causal inference under conditional moment restrictions using importance weighting.

problem Challenges in causal inference under conditional moment restrictions, especially in high-dimensional settings.
method Transform conditional moment restrictions to unconditional moment restrictions through importance weighting.
result Successfully estimate nonparametric functions defined under conditional moment restrictions.

A new method for estimating causal parameters from observables reduces the need for finite moment conditions.

problem Estimating causal parameters from observational data with unknown or infinite moment conditions.
method Variational Method of Moments (VMM) for a general class of estimators, including kernel and neural net-based methods.
result VMM estimators are consistent, asymptotically normal, and semiparametrically efficient.

Introduces generalized moment maps for almost Hermitian settings.

problem Extending classical moment map theory to almost Hermitian settings.
method Introduces momentumly closed forms and proves a variant of the Darboux-Weinstein theorem.
result Establishes convexity property and constructs reduction space for generalized moment maps.

Proposes Moment Exchange to use moments in image recognition models, improving generalization.

problem Discarding moments in image recognition models reduces stability and training time.
method Moment Exchange: replaces moments of learned features with another image's moments and interpolates labels.
result Improves generalization of recognition models across multiple datasets.

A new method of moments estimator goes beyond data reweighting.

problem Estimation of moment restrictions and conditional moment restrictions.
method Kernel Method of Moments (KMM) based on maximum mean discrepancy.
result KMM achieves competitive performance on conditional moment restriction tasks.

Moment Pooling reduces latent space dimensions in machine learning models.

problem High-dimensional latent spaces in machine learning models are hard to interpret.
method Moment Pooling extends Deep Sets networks to arbitrary multivariate moments.
result Latent dimensions as small as 1 can achieve similar performance to higher dimensions.

Deformation quantization yields a new moment map on symplectic diffeomorphisms.

problem Formalizing moment maps on diffeomorphism groups of symplectic manifolds.
method Deformation quantization framework applied to extrmDiff0(M) extrm{Diff}_0(M).
result Obtained a deformation of the Donaldson moment map.

The paper derives formulas for moments of a Student t distribution and applies them to quantify LpL_p-quantiles.

problem Understanding the moments and quantiles of a Student t distribution.
method Developed formulas for partial and complete moments, and derived relationships between LpL_p-quantiles.
result For a Student t distribution, the Lnj+1L_{n-j+1}-quantile and LjL_j-quantile coincide at any confidence level.

We propose a method of moments (MoM) algorithm for training large-scale implicit generative models. Moment estimation in this setting encounters two problems: it is often difficult to define the millions of moments needed to learn the model parameters, and it is hard to determine which properties are useful when specif…

2018-06-28abs ↗pdf ↗

Real moment-angle manifolds of combinatorially equivalent simple polytopes are equivariantly diffeomorphic.

problem Uniqueness of smooth structures on real moment-angle manifolds.
method Arguments from calculus applied to results from complex moment-angle manifolds.
result Real moment-angle manifolds of combinatorially equivalent simple polytopes are equivariantly diffeomorphic.

In this paper, we investigate the popular deep learning optimization routine, Adam, from the perspective of statistical moments. While Adam is an adaptive lower-order moment based (of the stochastic gradient) method, we propose an extension namely, HAdam, which uses higher order moments of the stochastic gradient. Our …

2019-10-15abs ↗pdf ↗