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

1122 · Apr 202019922001200920172026
35 results for Energy-conserving

A new AI optimization method uses energy-conserving dynamics inspired by Born-Infeld theory.

problem Optimization challenges in non-convex loss functions and machine learning tasks.
method Discretization of Born-Infeld dynamics for energy-conserving Hamiltonian optimization.
result The method avoids high local minima and outperforms traditional methods in shallow valleys.

In this short Note we would like to bring into the attention of people working in General Relativity a Schwarzschild like metric found by Professor Cleopatra Mociuţchi in sixties. It was obtained by the A. Sommerfeld reasoning from his treatise "Elektrodynamik" but using instead of the energy conserving law from the cl…

2011-04-20abs ↗pdf ↗

ECD algorithm speeds up non-convex optimization, offering quantum and stochastic enhancements.

problem Non-convex optimization challenges in machine learning.
method Energy Conserving Descent (ECD) algorithm, stochastic ECD dynamics (sECD), quantum ECD Hamiltonian (qECD).
result ECD and its quantum version achieve exponential speedup over gradient descent.

RNN operators solve Newton's equations with large timesteps for molecular dynamics.

problem Solving Newton's equations of motion with large timesteps for molecular dynamics simulations.
method Recurrent Neural Networks (RNN) operators to solve Newton's equations using past trajectory data.
result Significant speedup in molecular dynamics simulations with timesteps up to 4000 times larger.

Novel method combines physics priors for energy-conserving dynamics.

problem Learning long-term dynamics of complex physical systems from noisy data.
method Variational Integrator Graph Networks integrating energy constraint, high-order symplectic integrators, and graph neural networks.
result Improves predictive performance across single and many-body problems.

In this paper, we study the schrodinger equation and wave equation with the Dirichlet boundary condition on a connected finite graph. The explicit expressions for solutions are given and the energy conservations are derived. Applications to the corresponding nonlinear problems are indicated.

2012-07-22abs ↗pdf ↗

We address the problem of constructing numerical integrators for nonholonomic Lagrangian systems that enjoy appropriate discrete versions of the geometric properties of the continuous flow, including the preservation of energy. Building on previous work on time-dependent discrete mechanics, our approach is based on a d…

2002-09-24abs ↗pdf ↗

New framework models non-conservative stochastic processes without energy conservation constraints.

problem Existing Schrödinger Bridge methods are limited by energy-conservation assumptions.
method Introduces non-conservative generalized Schrödinger bridge (NCGSB) based on contact Hamiltonian mechanics.
result Contact Wasserstein geodesic (CWG) provides a broader class of real-world stochastic processes.

New approach relaxes inductive biases of physics-inspired NNs for better performance.

problem Challenges in applying physics-inspired NNs to real-world systems.
method Examined and relaxed inductive biases of Hamiltonian NNs, improving performance on non-conservative systems.
result Improved performance on practical, non-conservative systems by relaxing inductive biases.

One important effect of price shocks in the United States has been increased political attention paid to the structure and performance of oil and natural gas markets, along with some governmental support for energy conservation. This paper describes how price changes helped lead the emergence of a political agenda acco…

2015-02-25abs ↗pdf ↗

Many practical machine learning tasks employ very deep convolutional neural networks. Such large depths pose formidable computational challenges in training and operating the network. It is therefore important to understand how fast the energy contained in the propagated signals (a.k.a. feature maps) decays across laye…

2017-04-12abs ↗pdf ↗

New approach reduces particle simulation complexity to linear time and space.

problem Challenges in learning dynamics from particle interactions, especially N-body problems.
method Transforms fully-connected interaction graphs into hierarchical ones, reducing complexity.
result Linear time and space complexity for large-scale simulations, retaining high accuracy.

The Langevin Markov chain algorithms are widely deployed methods to sample from distributions in challenging high-dimensional and non-convex statistics and machine learning applications. Despite this, current bounds for the Langevin algorithms are slower than those of competing algorithms in many important situations, …

2019-02-22abs ↗pdf ↗

In this paper we study Spin(7){\rm Spin}(7)-instantons on asymptotically conical Spin(7){\rm Spin}(7)-orbifolds (and manifolds) obtained by filling in certain squashed 33-Sasakian 77-manifolds. We construct a 11-parameter family of explicit Spin(7){\rm Spin}(7)-instantons. Taking the parameter to infinity, the family (a) bubbles o…

2019-03-13abs ↗pdf ↗

SSINNs learn Hamiltonian systems from data with interpretable, low-memory models.

problem Learning Hamiltonian dynamical systems from data efficiently and accurately.
method Combines fourth-order symplectic integration with sparse regression for a learned Hamiltonian.
result Outperforms state-of-the-art techniques in system prediction and energy conservation.

Neural networks are increasingly used in complex (data-driven) simulations as surrogates or for accelerating the computation of classical surrogates. In many applications physical constraints, such as mass or energy conservation, must be satisfied to obtain reliable results. However, standard machine learning algorithm…

2019-04-29abs ↗pdf ↗

Introduces GFC for learning complex dynamical systems with geometric constraints.

problem Challenges in accurately modeling and predicting complex dynamical systems with geometric constraints.
method Geometric Contact Flows (GFC) using Riemannian and Contact geometry as inductive biases.
result Ensemble of contactomorphisms adapt the latent contact Hamiltonian model to target dynamics while preserving desirable properties.

Proposes ENOs for learning PDE solutions that conserve energy.

problem Learning dynamics that obey physical laws, especially in super-resolution settings.
method Energy-consistent Neural Operators (ENOs) with a novel penalty function inspired by energy-based theory.
result ENOs outperform existing DNN models in predicting solutions from data, especially in super-resolution settings.

Scattering theory for linearised gravity on Schwarzschild black hole exterior.

problem Constructing a scattering theory for linearised gravity equations on Schwarzschild background.
method Building on previous work, constructing Hilbert space-isomorphisms for finite energy initial data and scattering states.
result Past and future linear memories are related by an antipodal map for Bondi-normalised solutions.

A new ML method predicts long-time-step molecular dynamics, preserving symplectic and time-reversible properties.

problem Limited computational efficiency in long-time-step molecular dynamics simulations.
method Learning data-driven structure-preserving maps to generate long time-step classical dynamics.
result The method eliminates artifacts like lack of energy conservation and loss of equipartition.

Hamiltonian Monte Carlo (HMC) samples efficiently from high-dimensional posterior distributions with proposed parameter draws obtained by iterating on a discretized version of the Hamiltonian dynamics. The iterations make HMC computationally costly, especially in problems with large datasets, since it is necessary to c…

2017-08-02abs ↗pdf ↗

Unconstrained MLIPs outperform constrained ones in accuracy and speed.

problem Improving the efficiency and accuracy of machine-learned interatomic potentials.
method Investigated unconstrained models trained on large datasets compared to physically constrained models.
result Unconstrained MLIPs can be superior in accuracy and speed compared to physically constrained models.

Constrained adaptive filtering algorithms inculding constrained least mean square (CLMS), constrained affine projection (CAP) and constrained recursive least squares (CRLS) have been extensively studied in many applications. Most existing constrained adaptive filtering algorithms are developed under mean square error (…

2016-10-06abs ↗pdf ↗

Researchers found a way to measure energy in black hole perturbations.

problem Lack of positive-definite and conserved energy in black hole stability.
method Dimensional reduction and construction of a positive-definite energy functional.
result Conserved Hamiltonian energy for axially symmetric perturbations of Kerr black holes.