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

87173260346 · Jun 202019922001200920172026
48 results for constrained dynamics

Physics-constrained deep learning predicts geophysical dynamics with boundedness.

problem Forecasting geophysical systems with hidden variables and incomplete observations.
method Physics-constrained neural ordinary differential equation (NODE) representations with boundedness constraints.
result The approach generalizes learned dynamics to arbitrary initial conditions.

Proposes r2SGLD for efficient constrained exploration in non-convex learning.

problem Stagnation in high-temperature chains of reSGLD in distribution tails.
method r2SGLD: replica exchange with reflection steps in a bounded domain.
result Reflection steps enhance mixing rates with quadratic improvement in domain diameter.

Proposes a new method for constrained generative modeling using Langevin dynamics.

problem Challenges in satisfying underlying constraints with score-based generative models.
method Uses kinetic Langevin dynamics with specular reflection to model constraints.
result Demonstrates efficient numerical samplers with optimal convergence rates.

New algorithm improves convergence for non-convex problems with boundaries.

problem Optimizing non-convex problems with constraints.
method Reflected Gradient Langevin Dynamics with probabilistic representation.
result Promising convergence rates, faster than existing methods.

PNDEs project neural dynamics onto constraint manifolds, improving accuracy and stability.

problem Learning dynamics from data without violating known constraints.
method Projecting the learned vector field onto the tangent space of the constraint manifold.
result PNDEs outperform existing methods in learning constrained dynamical systems.

Solves VaR-constrained portfolio optimization in markets with stochastic volatility.

problem Optimizing portfolio in markets with stochastic volatility under VaR constraints.
method Dynamic programming approach to Heston's stochastic volatility model.
result Optimal investment strategy linked to unconstrained problem via a vega-neutral derivative.

We show that there exists a natural Tulczyjew triple in the dynamics of objects for which the standard kinematic configuration space TMTM, i.e. the tangent bundle, is replaced with its nn-th exterior power, i.e. the bundle of tangent nn-vectors. In this framework, which is fully covariant, we geometrically derive pha…

2015-09-26abs ↗pdf ↗

MAGI-X learns unknown dynamics from data without numerical integration.

problem Difficult to propose ODEs in closed-form for complex systems.
method MAGI-X uses neural networks within a manifold-constrained Gaussian process framework.
result MAGI-X achieves competitive accuracy in fitting and forecasting with reduced computational time.

Unified framework for constrained diffusion models on nonconvex sets with efficient landing mechanism.

problem Efficiently modeling generative models under nonconvex constraints.
method Unified framework with overdamped and underdamped dynamics, landing mechanism.
result Significantly reduces computational cost while maintaining sample quality.

KCRL learns stable policies for nonlinear systems with formal guarantees.

problem Lack of stabilization guarantees in RL methods for safety-critical systems.
method KCRL uses Krasovskii's Lyapunov functions as a stability constraint and a primal-dual approach to learn stabilizing policies.
result KCRL guarantees learning a stabilizing policy in a finite number of interactions.

New algorithms for sampling in constrained domains without learning rates.

problem Sampling in constrained domains with fairness constraints and post-selection inference.
method Coin betting ideas from convex optimisation and a unifying framework for constrained sampling.
result Our algorithms achieve competitive performance without hyperparameter tuning.

Optimizes portfolios with constraints and stochastic factors, deriving explicit solutions.

problem Optimizing expected utility in an incomplete market with stochastic factors and convex constraints.
method Fundamental duality results and HJB PDE, derived condition for exponential affine solutions.
result Explicit expressions for optimal allocations and Riccati ODE solutions in specific markets.

In this paper, we study a constrained utility maximization problem following the convex duality approach. After formulating the primal and dual problems, we construct the necessary and sufficient conditions for both the primal and dual problems in terms of FBSDEs plus additional conditions. Such formulation then allows…

2016-12-13abs ↗pdf ↗

With the growth of renewable generation (RG) and the development of associated ride through curves serving as operating limits, during disturbances, on violation of these limits, the power system is at risk of losing large amounts of generation. In order to identify preventive control measures that avoid such scenarios…

2019-09-15abs ↗pdf ↗

The paper studies dynamical properties in semigroups modulo ideals.

problem Analyzing shadowing, expansivity, and stability in semigroups with ideals.
method Investigates shadowing, expansivity, and stability properties in uniform transformation semigroups modulo an ideal.
result Establishes that if a semigroup exhibits shadowing and expansivity modulo an ideal, it is also topologically stable modulo that ideal.

New method learns nonlinear projections for reduced-order modeling of complex dynamical systems.

problem Modeling transient dynamics near a manifold in nonlinear systems.
method Constrained autoencoder neural networks with invertible activation functions and biorthogonal weight matrices.
result Demonstrated effectiveness on a vortex shedding model, learning oblique fibers for fast dynamics.

Safe RL in linear systems achieves T\sqrt{T}-regret.

problem Efficiently learning in safety-constrained online reinforcement learning.
method Study of linear quadratic regulator with safety constraints.
result First safe algorithm with ildeOT(T) ilde{O}_T(\sqrt{T})-regret.

Optimal control problems on Riemannian manifolds are solved by penalizing constraint violations.

problem Optimal control problems with velocity constraints on Riemannian manifolds.
method Penalizing constraint violations and showing convergence to hard-constrained solutions.
result Solutions to soft-constrained problems converge to solutions of hard-constrained problems as penalty parameter increases.

OLLA framework efficiently samples from constrained distributions with nonconvex constraints.

problem Sampling from constrained distributions with nonconvex constraints is challenging.
method Overdamped Langevin with Landing (OLLA) framework that handles both equality and inequality constraints.
result OLLA converges exponentially fast to the constrained target density in W2W_2 distance.

This paper presents a geometric description on Lie algebroids of Lagrangian systems subject to nonholonomic constraints. The Lie algebroid framework provides a natural generalization of classical tangent bundle geometry. We define the notion of nonholonomically constrained system, and characterize regularity conditions…

2005-12-01abs ↗pdf ↗

DGNet solves complex dynamical systems with neural networks and constraints.

problem Real-time accurate solutions for large-scale complex systems.
method Model-constrained discontinuous Galerkin Network (DGNet) for compressible Euler equations.
result DGNet achieves out-of-distribution generalization and improved stability.

Dynamic pricing learns demand model from sparse product networks.

problem Minimizing revenue loss in a large network of products with unknown demand parameters.
method Combines optimism-in-the-face-of-uncertainty and PAC-Bayesian approaches.
result Achieves asymptotically optimal performance in terms of network size and time horizon.

Physics-constrained GP predicts material states under shockwave conditions.

problem Predicting material states under extreme shockwave conditions.
method Physics-constrained Gaussian Process regression with Rankine-Hugoniot constraints.
result Reproduces Hugoniot curves with satisfactory accuracy and uncertainty quantification.

Study proposes adaptive RL for dynamic portfolio optimization.

problem Traditional portfolio optimization models fail to adapt to regime shifts.
method Regime-aware reinforcement learning framework with hybrid observations and constrained reward functions.
result Transformer PPO achieves highest risk-adjusted returns, while LSTM variants offer a good balance.

We consider the problem of realizing tight contact structures on closed orientable three-manifolds. By applying the theorems of Hofer et al., one may deduce tightness from dynamical properties of (Reeb) flows transverse to the contact structure. We detail how two classical constructions, Dehn surgery and branched cover…

1998-12-09abs ↗pdf ↗

New algorithms for constrained online optimization with memory and predictions.

problem Control of constrained dynamical systems and scheduling with reconfiguration budgets.
method Proposed algorithms achieving sublinear regret and constraint violation under time-varying constraints, both with and without predictions.
result First algorithms achieving sublinear regret and constraint violation in constrained online optimization with memory.

We solve the problem of optimal stopping of a Brownian motion subject to the constraint that the stopping time's distribution is a given measure consisting of finitely-many atoms. In particular, we show that this problem can be converted to a finite sequence of state-constrained optimal control problems with additional…

2016-04-11abs ↗pdf ↗

The paper solves multi-period portfolio selection with constraints using a dynamic factor model.

problem Multi-period mean-variance portfolio selection with constraints.
method Dynamic factor model, dynamic programming, piecewise linear feedback policy.
result Optimal portfolio policies determined by two stochastic processes.

Service-induced congestion in memory-constrained LLM serving

problem Service-induced congestion in memory-constrained large language model (LLM) serving
method Developing a discrete-time dynamical model of memory-constrained LLM inference
result The system converges to a unique worst-case limit cycle that is asymptotically stable outside a Lebesgue-measure-zero exact-capture set, with throughput losses as large as 50%.

Develops adiabatic theory for ACW flow on surfaces.

problem Evolution of large closed surfaces under area-constrained Willmore flow.
method Constructs a map on a four-dimensional manifold of barycenters to characterize ACW flow dynamics.
result Explicit four-dimensional effective dynamics of barycenters serves as an asymptotic approximation for ACW flow.

End-to-end framework optimizes constrained trajectories using data-driven methods.

problem Optimizing trajectories under constraints with limited dynamics knowledge.
method Data-driven approach decomposes trajectories into function basis, uses maximum a posteriori for optimization, and incorporates linear constraints.
result Commanding results in aeronautics and sailing route optimization.

The Hawking energy is nonnegative and rigid on area-constrained surfaces in general relativity.

problem The rigidity and positivity of the Hawking energy on specific surfaces in general relativity.
method Evaluation of the Hawking energy on area-constrained critical surfaces under the dominant energy condition.
result The Hawking energy is nonnegative and rigid on area-constrained surfaces, including charged and cosmological constant variants.