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

82163245326 · Jun 202019922001200920172026
48 results for Non-conservative systems

We study non-conservative like SODEs admitting explicit Lagrangian descriptions. Such systems are equivalent to the system of Lagrange equations of some Lagrangian LL, including a covariant force field which represents non-conservative forces. We find necessary and sufficient conditions for the existence of a differen…

2017-12-04abs ↗pdf ↗

The paper integrates dissipative and curl forces using geometric methods.

problem Incorporating dissipative forces into curl forces for non-conservative systems.
method Geometric metriplectic approach, Herglotz principle, generalized Euler-Lagrange equation, Galley's method.
result Natural formulations for Lagrangian and Hamiltonian dynamics of non-conservative systems.

Develops Hamilton-Jacobi theory for non-conservative field theories in k-contact geometry.

problem Analyzes non-conservative field theories, especially dissipative systems.
method Introduces evolution k-contact k-vector fields and develops two Hamilton-Jacobi theories.
result Recover ordinary contact Hamilton-Jacobi theory as k=1, and enlarges application range.

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.

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.

New geometric framework for non-conservative field theories with time-dependent terms.

problem Describing non-conservative field theories with explicit space-time dependence.
method Combining k-cosymplectic and k-contact formulations to develop Hamiltonian and Lagrangian formalisms.
result Illustrated with the nonlinear damped wave equation, demonstrating the new formalism's applicability.

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.

Paper introduces a PDE-free method for decomposing forces in any dimension.

problem Analyzing non-conservative forces in arbitrary dimensions.
method Geometric decomposition using homotopy operator and Frobenius theorem.
result Decomposes forces into gradient and antiexact components, characterizing curl forces.

SBMs learn manifold-like structures by mixing samples with a non-conservative field.

problem How SBMs learn data distributions on low-dimensional manifolds.
method Investigating linear approximations and subspaces of local feature vectors during diffusion.
result SBMs mix samples by a non-conservative field within the manifold, maintaining manifold-like structure.

It is known that the probability is not a conserved quantity in the stock market, given the fact that it corresponds to an open system. In this paper we analyze the flow of probability in this system by expressing the ideal Black-Scholes equation in the Hamiltonian form. We then analyze how the non-conservation of prob…

2019-12-20abs ↗pdf ↗

A conservative drifting method improves generative modeling by using KDE gradients, proving convergence rates.

problem Improving generative modeling by addressing non-conservatism issues.
method Proposes a conservative drifting method using kernel density estimator gradients to address non-conservatism.
result Proves finite-particle convergence rates for the conservative method, providing explicit quadrature constants.

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…

2016-08-28abs ↗pdf ↗

Sharp bounds on heat kernel derivatives on incomplete manifolds.

problem Extending bounds on heat kernel derivatives to incomplete Riemannian manifolds.
method Analyzing heat kernels on incomplete Riemannian manifolds with conservative and non-conservative vector fields.
result Sharp bounds on all orders of heat kernel derivatives are established for incomplete manifolds.

Diffusion models' speed-accuracy relations derived from thermodynamics.

problem Understanding the trade-off between model speed and accuracy.
method Connecting diffusion models to thermodynamics and optimal transport.
result Speed-accuracy relations derived, providing insights into optimal learning protocols.

A new algorithm learns from failures to optimize under constraints efficiently.

problem Optimizing under unknown constraints with limited failure tolerance.
method Excursion search controls risk as a function of a failure budget.
result The algorithm achieves lower regret and uses failures budget more efficiently.

The paper extends a learning heuristic to high-dimensional contexts, reducing the risk of unusual actions.

problem Sequential learning problems in high dimensions, especially in dynamic pricing and auctions.
method Introducing a conservative εtε_t-greedy rule that limits the adoption of new actions to a focused set of promising actions.
result Reasonable bounds for cumulative regret and improved regret bound for conservative version compared to non-conservative.

The application of machine learning to bioinformatics problems is well established. Less well understood is the application of bioinformatics techniques to machine learning and, in particular, the representation of non-biological data as biosequences. The aim of this paper is to explore the effects of giving amino acid…

2013-02-15abs ↗pdf ↗

Domain adaptation refers to the problem of leveraging labeled data in a source domain to learn an accurate model in a target domain where labels are scarce or unavailable. A recent approach for finding a common representation of the two domains is via domain adversarial training (Ganin & Lempitsky, 2015), which attempt…

2018-02-23abs ↗pdf ↗

SLdisco uses supervised learning to discover causal models from observational data.

problem Estimating causal effects from observational data with limited samples and sparse models.
method Supervised machine learning to map observational data to causal equivalence classes.
result SLdisco is more conservative, less sensitive to sample size, and provides better model inference.

New method for sampling from multivariate distributions using optimal control and quantum mechanics.

problem Sampling from continuous multivariate probability distributions efficiently and accurately.
method Harmonic Path Integral Diffusion (H-PID) framework, formulated as a Stochastic Optimal Control problem.
result Efficient sampling algorithms without neural networks, revealing dynamic phase transitions.

Overview of integrable systems with symmetries, focusing on toric and semitoric systems.

problem Classifying and understanding integrable systems with symmetries.
method Using decorated polygons and controlled bifurcations in one-parameter families of systems.
result Construction of explicit semitoric systems with prescribed invariants.

Learning to control linear systems is statistically hard, especially for underactuated systems.

problem Statistical difficulty of learning to control linear systems, especially underactuated ones.
method Utilized minimax lower bounds and structural assumptions to prove learning complexity can be exponential.
result Learning complexity can be at most exponential with the controllability index of the system.

Discrete-time systems can be characterized by simple flat coordinates and their shifts.

problem Characterizing flatness of discrete-time systems.
method Developed a map from flat coordinates and their shifts to system state and input, fulfilling system equations identically.
result Derived necessary conditions for a system to be flat, without requiring differential geometry methods.

The paper explores when linear system identification is hard or easy, especially for under-actuated systems.

problem Statistical hardness of learning linear systems, especially under-actuated or under-excited systems.
method Using tools from minimax theory and recent statistical tools for finite sample analysis of system identification.
result The controllability index of linear systems affects the sample complexity of identification, making some systems hard to learn.

This paper improves system identification by reducing sample complexity for high-dimensional linear dynamical systems.

problem High sample complexity for learning partially observed linear dynamical systems in high dimensions.
method Introduces an 1\ell_1-regularized estimation method that reduces sample complexity from linear to logarithmic with system dimension.
result Markov parameters can be learned with logarithmic number of samples relative to system dimension, improving sample complexity.

In integrable hydrodynamic systems, coordinates exist where generators and symmetries are simple.

problem Existence of Riemannian invariants for integrable systems of hydrodynamic type.
method Finding coordinates where the generator and all symmetries are diagonal.
result In integrable hydrodynamic systems, there exist coordinates where the generator and all symmetries are diagonal.

This paper studies nonholonomic constraints in Hamiltonian systems, deriving equations and theorems.

problem Analyzing nonholonomic constraints in Hamiltonian systems.
method Deriving distributional RCH systems, geometric constraint conditions, and Hamilton-Jacobi theorems.
result Derives precise geometric constraint conditions and Hamilton-Jacobi theorems for nonholonomic systems.

This paper considers control systems defined on Lie algebroids. After deriving basic controllability tests for general control systems, we specialize our discussion to the class of mechanical control systems on Lie algebroids. This class of systems includes mechanical systems subject to holonomic and nonholonomic const…

2004-02-26abs ↗pdf ↗

Systemic risk refers to the risk that the financial system is susceptible to failures due to the characteristics of the system itself. The tremendous cost of systemic risk requires the design and implementation of tools for the efficient macroprudential regulation of financial institutions. The current paper proposes a…

2015-02-27abs ↗pdf ↗