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.

169,181 papers · 148 categories

Trend · papers per month

70141211281 · May 202619922001200920182026
48 results for geometry constraints

Optimizes stochastic and online optimization methods based on problem geometry.

problem Optimizing computational and statistical outcomes in stochastic and online optimization problems.
method Characterizes optimal methods based on constraint set and gradient geometry.
result Stochastic and adaptive-gradient methods are optimal for quadratically convex constraint sets.

Geometric constraints help classify hyperbolic polytopes.

problem Classifying reflective anisotropic Lorentzian lattices and cocompact arithmetic hyperbolic reflection groups.
method Established geometric constraints on compact Coxeter polytopes in hyperbolic spaces.
result Geometric constraints are useful for classifying hyperbolic polytopes.

In the present article the geometry of semi-Riemannian manifolds with nonholonomic constraints is studied. These manifolds can be considered as analogues to the sub-Riemannian manifolds, where the positively definite metric is substituted by a nondegenerate metric. To study properties of the exponential map the Christo…

2009-01-11abs ↗pdf ↗

The paper solves the isoperimetric problem in Riemannian optical geometry, proving circles minimize lengths with area constraints.

problem Optical geometry of static spherically symmetric spacetimes.
method Applying isoperimetric problem results to curves in Riemannian optical geometry.
result Length-minimizing curves with area constraints are circles, with implications for photon spheres.

The paper studies hyperbolic three-manifolds and their geometric constraints.

problem Understanding the interaction between hyperbolic geometry and homology cobordism.
method Derived explicit bounds on relative grading and invariants in monopole Floer homology.
result Explicit bounds on numerical invariants and subgroup structure of homology cobordism.

This work investigates implicit bias in multiclass separable data using a novel geometry-aware optimizer.

problem Understanding implicit bias in overparameterized models on multiclass separable data.
method Introduces NucGD, a geometry-aware optimizer enforcing low-rank structures through nuclear norm constraints.
result NucGD enables scalable training and characterizes the impact of stochastic optimization dynamics.

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 ↗

We survey some results on scalar curvature and properties of solutions to the Einstein constraint equations. Topics include an extended discussion of asymptotically flat solutions to the constraint equations, including recent results on the geometry of the center of mass of such solutions. We also review methods to con…

2011-02-24abs ↗pdf ↗

We calculate relations on characteristic classes which are obstructions preventing closed Kähler manifolds from carrying holomorphic Cartan geometries. We apply these relations to give global constraints on the phase spaces of complex analytic determined and underdetermined systems of differential equations.

2007-04-19abs ↗pdf ↗

Geometrically characterizes virtual nonlinear nonholonomic constraints using symplectic methods.

problem Characterizing virtual nonlinear nonholonomic constraints geometrically.
method Geometric characterization using symplectic structures and Chetaev equations.
result A unique control law exists to satisfy virtual constraints, and closed-loop dynamics are projections of uncontrolled dynamics.

In 5D, integrability is linked to curvature constraints of subconformal structures.

problem Dispersionless integrability in 5D partial differential equations.
method Relating integrability to curvature constraints of subconformal structures.
result In 5D, integrability is characterized by the vanishing of a certain curvature of the subconformal structure.

Geometric theory explains substitutability in market outcomes based on production constraints.

problem Understanding substitutability in markets with structured feasible products.
method Modeling the set of feasible products as a compact Riemannian manifold to study intrinsic geometry and its effects on substitutability.
result Intrinsic geometry of the feasible set governs substitutability and market outcomes, with curvature controlling technological substitution elasticity.

Counterexample shows state-constrained optimal control problems can have Young measure gaps.

problem Existence of Young measure gaps in state-constrained optimal control problems.
method Provided a counterexample for smooth controllable systems state-constrained to the unit ball.
result Gap occurs in a regular setting with non-convex Lagrangian density.

We study the spinorial Killing equation of supergravity involving a torsion 3-form $\T$ as well as a flux 4-form $\F$. In dimension seven, we construct explicit families of compact solutions out of 3-Sasakian geometries, nearly parallel $\G_2$-geometries and on the homogeneous Aloff-Wallach space. The constraint $\F \c…

2003-07-28abs ↗pdf ↗

Novel Bayesian framework for Poisson inverse problems using Bregman geometry.

problem Solving Poisson inverse problems with non-Euclidean geometry and positivity constraints.
method Develops a Monte Carlo sampling algorithm that accounts for Bregman geometry, data augmentations, and conditional conjugacy properties.
result Efficient sampling via Gibbs steps and Hessian Riemannian Langevin Monte Carlo (HRLMC) for positivity constraints.

New method learns dynamics from sparse data using geometric constraints.

problem Learning dynamics from sparse, undersampled data.
method Reformulates inference as a stochastic control problem, using geometry-driven path augmentation.
result Accurately recovers stochastic dynamics from extremely undersampled data.

A four-dimensional Walker geometry is a four-dimensional manifold M with a neutral metric g and a parallel distribution of totally null two-planes. This distribution has a natural characterization as a projective spinor field subject to a certain constraint. Spinors therefore provide a natural tool for studying Walker …

2006-12-27abs ↗pdf ↗

Quaternionic differential geometry expands geometric concepts using quaternions.

problem Generalizing geometric concepts to quaternionic constraints.
method Generalizing curves and surfaces, curvature, torsion, differential forms, and directional derivatives to quaternionic constraints.
result Quaternionic formalism provides a suitable language for differential geometry.

New techniques solve Riccati equations on 3D manifolds, finding 4th order metric obstructions.

problem Solving Riccati-type equations with algebraic constraints on 3D Riemannian manifolds.
method Real algebraic geometry techniques, focusing on connection coefficients and Hessian equations.
result Obstruction to solving Riccati equations has order 4 in metric coefficients.

The paper explores how to increase Steklov spectral gaps on manifolds with fixed boundary.

problem Finding ways to increase Steklov spectral gaps on manifolds with fixed boundary.
method Constructing compact manifolds with fixed boundary geometry and applying localized conformal deformations.
result It is possible to make the spectral gap arbitrarily large using localized conformal deformations.

This is the third in a series of papers on the geometry and analysis of singular area minimizing hypersurfaces. We show how to derive obstruction and structure theories for scalar curvature constraints without imposing dimensional or topological restrictions on the underlying manifold. To this end, we use skin structur…

2015-12-27abs ↗pdf ↗

The paper explores geometric relationships in manifolds with curvature constraints, proving new inequalities and rigidity results.

problem Understanding geometric features of manifolds with curvature constraints.
method Comparison theorems and spacetime harmonic functions.
result Partial resolution of Gromov's conjecture and new characterizations of geometries.

CVB relaxes VB's independence constraint to copula, improving clustering accuracy.

problem Improving Bayesian network inference accuracy, especially for correlated networks.
method Copula Variational Bayes (CVB) via information geometry, iteratively projecting to copula constraint space.
result CVB achieves globally optimal approximation for correlated networks, superior to state-of-the-art methods.

New boundary and point constraints for controlling conformal surfaces.

problem Controlling the geometry of surfaces defined by minimizers of conformal variational problems.
method Introducing new boundary conditions, point constraints, and flux constraints to control the metric and conformal scale factor.
result Introduces intuitive controls for exploring a subspace of conformal immersions.

We introduce a variation of the classical Ricci flow equation that modifies the unit volume constraint of that equation to a scalar curvature constraint. The resulting equations are named the Conformal Ricci Flow Equations because of the role that conformal geometry plays in constraining the scalar curvature. These equ…

2003-12-31abs ↗pdf ↗

Method provides solutions to constraint equations for Lorentzian manifolds with lightlike parallel spinors.

problem Solving constraint equations for Lorentzian manifolds with lightlike parallel spinors.
method Constructing solutions using curves in the moduli space of Riemannian metrics.
result Any curve or closed curve in the moduli space of Riemannian metrics on M with a parallel spinor gives rise to a solution of the constraint equations.

In this paper, we propose a simple, versatile model for learning the structure and parameters of multivariate distributions from a data set. Learning a Markov network from a given data set is not a simple problem, because Markov networks rigorously represent Markov properties, and this rigor imposes complex constraints…

2012-06-17abs ↗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.

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.

The paper explores curvature constraints on Kodaira dimension for specific almost Hermitian manifolds.

problem Investigating Riemannian curvature constraints on the Kodaira dimension of compact almost Hermitian manifolds.
method Analyzing compact almost Hermitian manifolds in the Gray-Hervella class and Hermitian manifolds with nonnegative scalar curvature.
result For compact almost Hermitian manifolds with nonnegative scalar curvature, the Kodaira dimension is either -∞ or 0, with specific conditions.

A novel controller for wheeled robots handles joystick inputs for smooth steering.

problem Steering control for differential-drive wheeled robots from indirect joystick inputs.
method Developed a geometric controller based on Darboux frame kinematics.
result Smooth trajectories achieved with safety constraints and no desired states.