Algorithm reconstructs conserved networks from flow data.
problem Network reconstruction from flow data.
method Polynomial time algorithm exploiting graph theoretic properties and learning techniques.
result Exact network reconstruction possible for arborescence networks.
Data symmetries in neural networks can generate conserved quantities.
problem Conservation laws in neural networks
method Using tensorizable networks
result Data augmentation can induce conserved quantities
New neural network enforces mass conservation for better ice flow predictions.
problem Reliably project future sea level rise by improving ice sheet model inputs.
method Proposes divergence-free neural networks (dfNNs) enforcing local mass conservation.
result dfNNs yield more reliable ice flux estimates compared to other models.
Enhances HNNs for conservative systems with noisy data.
problem Modeling conservative systems with neural networks.
method Proposes a deep hidden physics model for continuous-time trajectory estimation.
result Integration scheme works well for HNNs, especially with low sampling rates.
Discover conservation laws from trajectories using a neural network.
problem Finding invariants and conservation laws from large-scale data without prior knowledge.
method ConservNet, a neural network trained with noise-variance loss to discover hidden invariants in grouped multi-dimensional observables.
result Successfully discovers underlying invariants from simulated and real-world systems.
LNNs learn Lagrangians without canonical coordinates, conserving energy and relativity.
problem Neural networks struggle to learn physical symmetries like conservation laws.
method Lagrangian Neural Networks (LNNs) parameterize arbitrary Lagrangians using neural networks.
result LNNs conserve energy and relativity in complex systems.
Framework infers conservation laws from trained neural networks.
problem Building reduced models of complex systems from physical data.
method Derives conservation laws from symmetries of dynamics in trained DNNs using Noether's theorem.
result Consistent results with previous studies for metastable collective motion systems.
MC-LSTM extends LSTM to conserve mass in neural networks.
problem Conservation laws in real-world systems.
method Extending LSTM's inductive bias to conserve mass.
result MC-LSTM sets new state-of-the-art for predicting peak flows.
The network jackknife provides conservative variance estimates for network statistics.
problem Estimating the variance of network statistics.
method Leave-node-out jackknife procedure for network data under the sparse graphon model.
result The network jackknife leads to conservative estimates of the variance for network functionals invariant to node permutation.
Noether's theorem clarifies how symmetries in neural networks influence learning.
problem Understanding how symmetries in neural networks affect learning.
method Systematic study of symmetry interactions with learning algorithms using Noether's theorem.
result Symmetries impose restrictions on the optimization path, leading to conserved quantities.
Unified neural network framework for context-aware Gaussian overbounds in uncertainty propagation.
problem Uncertainty quantification in safety-critical settings requires conservative bounds, but existing methods often fail to compose and are overly conservative.
method Proposes a learning framework that trains neural networks to produce context-aware Gaussian overbounds with provable conservatism.
result The method yields tighter bounds while maintaining conservatism on the enforced grid and in experiments.
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.
Conservative SPDEs emerge from fluctuating SGD dynamics in neural networks.
problem Understanding the convergence of stochastic gradient descent to SPDEs.
method Mean-field analysis and central limit theorem for SPDEs.
result Optimal convergence rates for SPDEs derived from SGD.
Global pairwise network alignment (GPNA) aims to find a one-to-one node mapping between two networks that identifies conserved network regions. GPNA algorithms optimize node conservation (NC) and edge conservation (EC). NC quantifies topological similarity between nodes. Graphlet-based degree vectors (GDVs) are a state…
Simplified kernel ridge regression with a conservation law.
problem Understanding the test risk and generalization of kernel ridge regression.
method Identification of a conservation law that limits KRR's learning ability, leading to simplified expressions for test risk.
result Transparency in test risk expressions through the conserved quantity in the kernel eigenbasis.
HAMBO estimates policy performance by hallucinating worst-case trajectories, providing valid lower bounds.
problem Conservative off-policy evaluation of policies in real-world applications.
method HAMBO hallucinates worst-case trajectories based on learned model uncertainty.
result Valid lower bounds on policy performance, converging to true expected return under regular conditions.
Paper proposes COM-QEL to avoid overoptimistic solutions in offline optimization.
problem Incorrect extrapolation of objective values in unexplored regions.
method Integrates quantum extremal learning with conservative objective models.
result COM-QEL finds higher true objective values compared to QEL.
Symmetry-regularized Neural ODEs improve model stability and interpretability.
problem Improving the stability and physical interpretability of Neural ODEs.
method Integrating Lie symmetries and conservation laws into the loss function.
result Symmetry-regularized Neural ODEs enhance model stability and interpretability.
Analyzes symmetries in neural networks to predict learning dynamics.
problem Understanding the dynamics of neural network parameters during training.
method Unified theoretical framework based on symmetries and conservation laws.
result Symmetries impose geometric constraints on gradients and Hessians, leading to conservation laws.
This paper applies CPI to deep RL, improving stability and performance.
problem Improving stability and performance in deep reinforcement learning.
method Combines Conservative Policy Iteration with deep neural networks and adaptive mixture rates.
result Demonstrates improved stability and performance in deep RL algorithms.
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.
Estimates network structure from node potentials and edge flows under Gaussian injection statistics.
problem Estimating network structure from node potentials and edge flows under Gaussian injection statistics.
method Proposes an ℓ1-regularized maximum likelihood estimator for high-dimensional network structure estimation. result Establishes sufficient conditions for exact sparsity recovery of network structure with high probability.
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.
Theoretical analysis confirms non-conservative algorithms can converge to optimal policies.
problem Theoretical guarantees for non-conservative reinforcement learning algorithms.
method Theoretical analysis of Peng's Q(λ) algorithm. result Peng's Q(λ) converges to an optimal policy under certain conditions. LFlows model fluid densities and velocities using invertible maps that satisfy the continuity equation.
problem Modeling fluid densities and velocities continuously in space and time.
method LFlows are based on invertible maps that satisfy the continuity equation, derived from classical theory of Lagrangian flows for smooth vector fields.
result LFlows show higher predictive accuracy in density modeling tasks compared to competing models in 2D and 3D.
Study finds conserved quantities for two types of curves on conformal sphere.
problem Identifying conserved quantities for specific types of curves on a conformal sphere.
method Used parallel tractor and Lagrangian formalism to compute conserved quantities.
result Found relation between conserved quantities of two curve types.
Study numerical methods for singular FBSDEs with degenerate forward component.
problem Numerical approximation of singular fully coupled FBSDEs with degenerate forward component and non-smooth terminal condition.
method Splitting approach to treat diffusion and transport parts separately.
result The splitting method converges with rate 1/2 under structural condition.
Survey on conservation laws for geometric PDEs.
problem Modeling polyharmonic maps.
method Conservation law approach.
result Overview of conservation laws in geometric PDEs.
GEN generates millions of valid SMILES with high novelty and property conservation.
problem Generating high-quality, de novo molecules in a known chemical space.
method GEN uses bidirectional RNNs with concatenated sub-models to learn and generate SMILES, with online examination to ensure quality.
result GEN can generate SMILES with 95-98% validity, 85-90% novelty, and 95-99% property conservation.
The article discusses conservation laws for polyharmonic maps and their applications.
problem Understanding conservation laws for polyharmonic maps.
method Recalling the stress-energy tensor and showing conservation laws with Killing vector fields.
result Conservation laws for polyharmonic maps and their applications.
Paper presents a reduction-based framework for conservative bandits and RL with improved lower and upper bounds.
problem Conservative bandits and reinforcement learning problems.
method Reduction technique to calculate necessary and sufficient budget from baseline policy.
result Improved lower and upper bounds for various conservative settings.
I consider the existence and structure of conservation laws for the general class of evolutionary scalar second-order differential equations with parabolic symbol. First I calculate the linearized characteristic cohomology for such equations. This provides an auxiliary differential equation satisfied by the conservatio…
Researchers found a geometric duality for systems of conservation laws.
problem Systems of conservation laws and their additional conservation laws.
method Assigning ruled surfaces in projective space and defining dual systems.
result Hamiltonian systems are autodual, and 3-component nondiagonalizable systems are dual to systems with constant characteristic speeds.
Non-trivial conservation law found for a specific system.
problem Conservation law for a specific system with a vanishing characteristic.
method Analyzing overdetermined system with given characteristics.
result Non-trivial conservation law despite vanishing characteristic.
A new method uses physics-informed neural networks to solve reliability analysis problems without simulations.
problem Solving reliability analysis problems without the need for expensive simulations.
method Physics-informed neural networks to learn directly from problem physics.
result Eliminates the need for expensive simulations and achieves highly accurate results.
Many models of market dynamics make use of the idea of conservative wealth exchanges among economic agents. A few years ago an exchange model using extremal dynamics was developed and a very interesting result was obtained: a self-generated minimum wealth or poverty line. On the other hand, the wealth distribution exhi…
This work connects symmetries and conserved quantities in machine learning.
problem Improving machine learning models by learning conserved quantities.
method Using Noether's theorem, learn symmetries and conserved quantities directly from data.
result Correctly identifies conserved quantities and improves model performance.
Proposes a conservative exploration method for RL agents.
problem Guaranteeing performance of exploratory policies in RL.
method Importance sampling for off-policy policy evaluation.
result Derives a regret bound ensuring no conservative constraint violation.
LDDNN learns physical dynamics from data without exact solutions.
problem Learning physical dynamics from data without exact solutions.
method LDDNN topology that learns Lagrangian density from data.
result LDDNN can learn physical dynamics from data.
The conservation laws of the third order quasilinear scalar evolution equations are considered via differential system and characteristic cohomology. We find a subspace of 2 forms in the infinite prolonged space in which every conservation law has a unique representative. The structure of this subspace naturally gives …
Conservation law for weakly harmonic mappings in high dimensions.
problem Conservation law for harmonic mappings in supercritical dimensions.
method Partial extension of Rivière's conservation law with Lorentz integrability condition.
result Conservation law for weakly harmonic mappings in supercritical dimensions.
Given a vector field on a manifold M, we define a globally conserved quantity to be a differential form whose Lie derivative is exact. Integrals of conserved quantities over suitable submanifolds are constant under time evolution, the Kelvin circulation theorem being a well-known special case. More generally, conserved…
We study higher-order conservation laws of the non-linearizable elliptic Poisson equation ∂z∂zˉ∂2u=−f(u) as elements of the characteristic cohomology of the associated exterior differential system. The theory of characteristic cohomology determines a normal form for diffe…
Study improves understanding and performance of FA learning rules in neural networks.
problem Lack of theoretical understanding and limited applications of Feedback Alignment (FA) methods.
method Introduces a unified framework linking synaptic weight changes to implicit regularization, providing convergence conditions and empirical evidence.
result Better alignment can enhance FA performance on complex multi-class tasks.
How, and to what extent, does an interconnected financial system endogenously amplify external shocks? This paper attempts to reconcile some apparently different views emerged after the 2008 crisis regarding the nature and the relevance of contagion in financial networks. We develop a common framework encompassing seve…
New conservation laws found for polyharmonic maps in critical dimension.
problem Existence of conservation laws for polyharmonic maps in critical dimension.
method Small perturbation of Uhlenbeck's gauge fixing matrix.
result Existence of conservation laws for elliptic systems of even order in critical dimension.
New variational principle found for PDEs with symmetries and conservation laws.
problem Finding variational principles for PDEs with symmetries and conservation laws.
method Proving existence of a variational principle for PDEs with symmetries and conservation laws.
result A differential equation with sufficient symmetries and conservation laws leads to a variational functional.
Algorithm learns latent variables for thermodynamically-consistent deep neural networks.
problem Predicting time evolution of large-scale physical systems with thermodynamic consistency.
method Sparse autoencoders and structure-preserving neural networks.
result Method conserves total energy and entropy inequality for both conservative and dissipative systems.