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

3978116155 · Jun 202019922001200920172026
48 results for constraint Lagrangians

Paper doubles Hessian estimates for special Lagrangian equation with constraints.

problem Estimating Hessian for special Lagrangian equation under general phase constraints.
method Doubling argument, Alexandrov-type theorems.
result Established Hessian estimates for special Lagrangian equation.

In this study, it is generalized the concept of Lagrangian mechanics with constraints to complex case. To be beginning, it is considered a Kaehlerian manifold as a velocity-phase space. Then a non-holonomic constraint is given by 1-form on it. If the form is closed, it is found that the constraint is (locally) holonomi…

2009-02-24abs ↗pdf ↗

The jet bundle description of time-dependent mechanics is revisited. The constraint algorithm for singular Lagrangians is discussed and an exhaustive description of the constraint functions is given. By means of auxiliary connections we give a basis of constraint functions in the Lagrangian and Hamiltonian sides. An ad…

2001-05-10abs ↗pdf ↗

The paper explores solving inverse problems for ODEs with and without constraints.

problem Understanding when second order ODEs can represent Lagrangian models with or without constraints.
method Geometric techniques to address the inverse problem for both constrained and unconstrained systems of second order ODEs.
result The constrained case presents more ambiguities and complexities than the unconstrained one.

In recent years, constrained optimization has become increasingly relevant to the machine learning community, with applications including Neyman-Pearson classification, robust optimization, and fair machine learning. A natural approach to constrained optimization is to optimize the Lagrangian, but this is not guarantee…

2018-04-17abs ↗pdf ↗

Geodesic extensions for systems with nonholonomic constraints.

problem Extending equations of motion for systems with nonholonomic constraints.
method Constructing extensions to second-order ODEs, investigating geodesic conditions.
result Conditions for nonholonomic trajectories to be geodesics of a Riemannian metric.

Study uses DRL with Lagrangian relaxation to solve temporal control tasks with STL constraints.

problem Optimal control problems with temporal logic constraints.
method Extended CMDP formulation, Lagrangian relaxation, two-phase constrained DRL algorithm.
result Demonstrated learning performance of the proposed algorithm through simulations.

New methods for efficient exploration under unknown linear constraints in bandits.

problem Optimizing decisions under unknown linear constraints in bandit problems.
method Lagrangian relaxation, computationally efficient extensions of existing methods, constraint-adaptive stopping rule.
result LAGEX achieves asymptotically optimal sample complexity, LATS shows asymptotic optimality up to novel constants.

This paper extends the evolution operator to contact mechanics, linking Lagrangian and Hamiltonian formulations.

problem Translating the evolution operator to contact mechanics for mechanical systems with dissipation.
method Using the evolution operator K to connect Lagrangian and Hamiltonian formalisms in contact mechanics.
result The evolution operator provides a geometric description of evolution equations and relates constraints.

The time evolution operator KK is introduced in the graded context and its main properties are discussed. In particular, the operator KK is used to analize the projectability of constraint functions arising in the Lagrangian formalism for singular Lagrangians.

2001-12-13abs ↗pdf ↗

In this paper, we propose a geometric integrator for nonholonomic mechanical systems. It can be applied to discrete Lagrangian systems specified through a discrete Lagrangian defined on QxQ, where Q is the configuration manifold, and a (generally nonintegrable) distribution in TQ. In the proposed method, a discretizati…

2007-09-10abs ↗pdf ↗

Simplifies neural network models by explicitly enforcing constraints in Cartesian coordinates.

problem Learning dynamics of complex systems efficiently and accurately.
method Embedding systems into Cartesian coordinates and using Lagrange multipliers to enforce constraints.
result Explicitly enforcing constraints leads to a 100x improvement in accuracy and data efficiency.

The paper develops methods for time-varying constrained online convex optimization.

problem Time-varying loss and constraint functions in online convex optimization.
method Model-based augmented Lagrangian methods (MALM) for time-varying and delayed feedback.
result Sublinear regret and constraint violation for both time-varying and delayed feedback scenarios.

In this note we show that the Lagrangian Luttinger surgery preserves the symplectic Kodaira dimension. Some constraints on Lagrangian tori in symplectic four manifolds with non-positive Kodaira dimension are also derived.

2011-08-02abs ↗pdf ↗

Proposes TgNN-LD to improve neural network effectiveness and efficiency.

problem Limits in maintaining tradeoff between data and domain knowledge.
method Converts loss function to constrained form with PDEs, ECs, and EK as constraints, incorporating Lagrangian variables for equitable tradeoff.
result Improves prediction accuracy and conserves resources.

Given a symplectic manifold M, we consider a category with objects finite ordered families of Lagrangian submanifolds of M (subject to certain additional constraints) and with morphisms Lagrangian cobordisms relating them. We construct a functor that maps this category to a variant of the derived Fukaya category of M i…

2013-04-22abs ↗pdf ↗

Develops a new solver for optimizing with stochastic dominance constraints.

problem Optimizing with stochastic dominance constraints is computationally expensive and impractical.
method Introduces Light Stochastic Dominance Solver (light-SD) that uses Lagrangian properties and surrogate approximation.
result The light-SD solver demonstrates superior performance on various problems.

We present a unified approach to constrained implicit Lagrangian and Hamiltonian systems based on the introduced concept of Dirac algebroid. The latter is a certain almost Dirac structure associated with the Courant algebroid on the dual EE^\ast to a vector bundle EE. If this almost Dirac structure is integrable (Dir…

2011-01-13abs ↗pdf ↗

We address the problem of solving convex optimization problems with many convex constraints in a distributed setting. Our approach is based on an extension of the alternating direction method of multipliers (ADMM) that recently gained a lot of attention in the Big Data context. Although it has been invented decades ago…

2016-10-07abs ↗pdf ↗

Study on relativistic nonholonomic mechanics with time-dependent constraints.

problem Formulating classical time-dependent nonholonomic mechanics.
method Invariant formulation using moving frames and Chaplygin systems.
result Hamiltonization of time-dependent constraints achieved.

This paper studies special Lagrangian submanifolds and their deformations.

problem Understanding the deformations of special Lagrangian submanifolds.
method Constructing a family of immersed special Lagrangian submanifolds as branched coverings.
result The existence of nondegenerate Z2\mathbb{Z}_2 harmonic 1-forms is constrained.

Stochastic approach improves neural network training for kinetic simulations.

problem Training neural networks under physical constraints in kinetic fusion simulations.
method Stochastic augmented Lagrangian approach using pyTorch.
result Higher model prediction accuracy achieved compared to fixed penalty method.

Unified Lagrangian-based methods for nonsmooth nonconvex optimization.

problem Minimizing nonsmooth nonconvex functions with constraints.
method Developed a unified framework for Lagrangian-based methods using subgradient updates.
result Global convergence guarantees for the proposed framework under mild conditions.

New algorithm reduces regret and constraint violation in online convex optimization with predictions.

problem Online convex optimization with time-varying constraints and predictions.
method Primal-dual algorithm combining Follow-The-Regularized-Leader with adaptive steps.
result Achieves O(T3β4)\mathcal O(T^{\frac{3-β}{4}}) regret and O(T1+β2)\mathcal O(T^{\frac{1+β}{2}}) constraint violation bounds.

Minimizing a function over an intersection of convex sets is an important task in optimization that is often much more challenging than minimizing it over each individual constraint set. While traditional methods such as Frank-Wolfe (FW) or proximal gradient descent assume access to a linear or quadratic oracle on the …

2018-04-09abs ↗pdf ↗

PDCA algorithm learns policies for RL with constraints using a primal-dual approach.

problem Offline constrained reinforcement learning with general function approximation.
method Primal-Dual-Critic Algorithm (PDCA) using a primal-dual approach.
result PDCA finds a near saddle point of the Lagrangian, nearly optimal for constrained RL.

Clean intersections of Lagrangian knots in 3D are impossible.

problem Prohibiting clean intersections of certain knots in 3D symplectic geometry.
method Symplectic field theory and algebraic constraints on augmentation varieties.
result No Hamiltonian diffeomorphism can cleanly intersect a specific type of knot's conormal bundle.

The paper studies bifurcations in Lagrangian systems and geodesics.

problem Investigating bifurcations in Lagrangian systems with various boundary conditions.
method Using Morse theory and nullity techniques, the paper establishes conditions for bifurcation in three configurations.
result Unified Morse-theoretic framework connecting geometric focal structure and analytic bifurcation behavior.

The Hamilton-Jacobi problem is revisited bearing in mind the consequences arising from a possible bi-Hamiltonian structure. The problem is formulated on the tangent bundle for Lagrangian systems in order to avoid the bias of the existence of a natural symplectic structure on the cotangent bundle. First it is developed …

2006-04-26abs ↗pdf ↗

We derive constraints on Lagrangian embeddings in completions of certain stable symplectic fillings with semisimple symplectic cohomologies. Manifolds with these properties can be constructed by generalizing the boundary connected sum operation to our setting, and are related to certain birational surgeries like blow-d…

2016-05-16abs ↗pdf ↗