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,341 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920182026
48 results for constraint operator

Adapts Bartnik method to Hilbert manifold structure for vacuum constraint equations.

problem Vacuum constraint equations on compact manifolds of any dimension ≥ 3.
method Adapts Bartnik method to provide Hilbert manifold structure.
result Fibers of scalar curvature and constraint operator are Hilbert submanifolds.

Formula derived for Laplace-Beltrami on Stiefel manifold.

problem Finding Laplace-Beltrami operator on Stiefel manifold.
method Using the general framework of Laplace operators on constraint manifolds, derived the explicit formula in terms of ambient Euclidean coordinates.
result Extended previously known formulas for sphere and special orthogonal group.

Generative classifiers' properties are linked to linear constraints.

problem Understanding the Markov property in generative classifiers.
method Characterization of discrimination functions using linear constraints and a second order finite difference operator.
result Discrimination functions of undirected Markov network classifiers are characterized by sets of linear constraints.

We study the supersymmetric Wilson loop as introduced by Caron-Huot, which attaches to lightlike polygons certain edge and vertex operators, whose shape is determined by supersymmetry constraints. We state explicit formulas for the vertex operators to all orders in the Graßmann expansion, thus filling a gap in the lite…

2012-06-26abs ↗pdf ↗

New classifiers ensure fairness by adjusting a base classifier's operating characteristics.

problem Ensuring fairness in binary classification with multiple group constraints.
method Intervening directly on a base classifier's operating characteristics using group-wise ROC convex hulls and post-processing.
result Methods satisfy multiple fairness constraints (DP, EO, PP) with minimal interventions and near-oracle accuracy.

Gaussian processes with linear constraints ensure function adherence.

problem Ensuring function adherence to known constraints in Gaussian processes.
method Modification of covariance function and explicit incorporation of linear constraints through a transformation operator.
result Guaranteed fulfillment of constraints in predictions and samples.

The paper develops a method for Gaussian Process regression with linear operator constraints.

problem Modeling functions with multiple linear constraints in high-consequence engineering systems.
method Develops a method for constrained Gaussian Process regression using linear operator constraints.
result Derives the exact posterior for a conjugate likelihood under linear operator constraints.

New DAG constraints improve differentiable DAG learning.

problem Recovering DAG structures from observational data is hard due to combinatorial optimization.
method Developed analytic functions to formulate DAG constraints, closed under differentiation, summation, and multiplication.
result Analytic DAG constraints outperform previous methods in various settings.

Modified constraint operator for localized deformation with dominant energy condition.

problem Handling localized deformation with initial data sets under the dominant energy condition.
method Introduced a modified constraint operator to absorb metric changes and established local surjectivity theorem.
result Promoted dominant energy condition to strict inequality through compactly supported variations.

Physics-informed neural networks improve by measuring effective dimensionality of constraints.

problem Task interference in physics-informed neural networks due to shared parameter space.
method Introduce effective dimensionality (deffd_{eff}) as an operator invariant to quantify constraints.
result Effective dimensionality measures unconstrained parameter directions, independent of network architecture.

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 constraints arising from DAG models with latent variables can be naturally represented by means of acyclic directed mixed graphs (ADMGs). Such graphs contain directed and bidirected arrows, and contain no directed cycles. DAGs with latent variables imply independence constraints in the distribution resulting from a…

2012-07-20abs ↗pdf ↗

The paper tackles imbalanced classification under operational constraints, proposing a framework to maximize sensitivity.

problem Detecting minority class observations under severe class imbalance and operational constraints.
method Formal classification framework under capacity constraints, maximizing sensitivity while respecting a user-defined label limit.
result The optimal classifier under capacity constraints is equivalent to the Bayes classifier with reweighted prior probabilities.

Optimal iterative thresholding algorithms improve upon hard and soft thresholding.

problem Optimizing sparsity or rank constraints in optimization problems.
method Developed the notion of relative concavity for thresholding operators, finding a new class of operators that are optimal.
result A new class of thresholding operators, including q\ell_q thresholding and reciprocal thresholding, achieves the strongest convergence guarantee.

Extends compactness theory to variable-coefficient pseudo-differential operators on manifolds.

problem Compensated compactness for pseudodifferential operators on vector bundles.
method Establishes a theorem for weakly convergent sequences of sections under a pseudo-differential operator.
result Quadratic form converges in distributional sense under certain conditions.

Integrates contextual constraints into embedding models for better recommendation quality.

problem Contextual constraints lead to incomplete or low-quality recommendations when applied independently.
method Merges constraint application and retrieval into one operation in the embedding space.
result Significant improvements in predictive performance compared to context-aware and standard models.

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 ↗

A new method solves variational inequality problems with multiple constraints without needing optimal Lagrange multipliers.

problem Solving variational inequality problems with multiple functional constraints efficiently.
method Constrained Gradient Method (CGM) for Minty variational inequality problems.
result The Constrained Gradient Method achieves complexity similar to projection-based methods but with cheaper oracles.

Graph-based framework for provably robust adversarial training.

problem Adversarial robustness of machine learning models.
method Formulates adversarial robustness as loss minimization with a Lipschitz constraint, using graph-based discretization and primal-dual algorithms.
result Establishes a connection between elliptic operators and adversarial learning, and proves fundamental lower bounds on adversarial sensitivity.

Unified framework for robust submodular optimization with various constraints.

problem Robust optimization in machine learning applications.
method Unified framework for minimization and maximization under combinatorial constraints.
result Scalable approximation algorithms for various submodular optimization problems.

Foundation models outperform supervised methods in time series forecasting across various operational regimes.

problem Lack of domain-specific training and ongoing maintenance in supervised learning for time series forecasting.
method Evaluation of foundation models against standard supervised approaches across four operational regimes: periodic, physically constrained, stochastic, and demand forecasting.
result Foundation models are optimal for cold-start or long-tail scenarios and perform well in domains with transferable periodic structures.

On a constraint manifold we give an explicit formula for the Hessian matrix of a cost function that involves the Hessian matrix of a prolonged function and the Hessian matrices of the constraint functions. We give an explicit formula for the case of the orthogonal group O(n){\bf O}(n) by using only Euclidean coordinates …

2014-03-17abs ↗pdf ↗

Develops a first-order interior-point method for solving constrained variational inequalities.

problem Solving constrained variational inequalities with nontrivial constraints.
method ADMM-based interior-point method for constrained VIs (ACVI).
result First-order interior-point method with global convergence guarantees for general cVI problems.

The paper classifies affine hypersurfaces with symplectic structures and constraints on their curvature.

problem Characterizing affine hypersurfaces with symplectic structures and curvature constraints.
method Analyzing hypersurfaces with non-degenerate second fundamental forms and almost symplectic structures.
result The rank of the shape operator is at most one under certain conditions on the almost symplectic form.

Algorithm solves covariant exterior derivative equations in small regions.

problem Solving covariant exterior derivative equations in geometric and algorithmic ways.
method Linear homotopy operator of the Poincare lemma, constraints for parallel transport equations.
result Solves covariant constant and related equations in a geometric and algorithmic way.

Paper presents a method to solve variational inequalities with general constraints without requiring analytic solutions.

problem Solving variational inequalities with general constraints.
method A primal-dual approach using approximate subproblem solutions and warm-starting.
result The method converges with a rate of O(1K)O(\frac{1}{\sqrt{K}}) for LL-Lipschitz and monotone operators.

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 ↗

First order Hamiltonian operators of differential-geometric type were introduced by Dubrovin and Novikov in 1983, and thoroughly investigated by Mokhov. In 2D, they are generated by a pair of compatible flat metrics gg and g~\tilde g which satisfy a set of additional constraints coming from the skew-symmetry condition…

2013-12-02abs ↗pdf ↗

Researchers create a method to join hyperboloidal data sets without violating the shear-free condition.

problem Creating consistent initial data sets for simulations of spacetime.
method Developed a new gluing procedure that maintains the shear-free condition using special Hölder spaces and elliptic operators.
result Successfully constructed hyperboloidal initial data sets that preserve the shear-free condition.

Study optimizes portfolio allocation policies using off-policy data and constraints.

problem Optimizing portfolio allocation policies under constraints using off-policy data.
method Solves a minimax objective with off-policy estimators and online learning to control constraint violations.
result Constructs near-optimal allocation policies for various regimes of operation and constraints.

New algorithm tackles optimization with distributed constraints.

problem Optimization problems with generalized orthogonality constraints in a decentralized setting.
method Introduced a novel algorithm that tracks gradients and Jacobians simultaneously.
result Global convergence with an iteration complexity established.

New framework uses OR to ensure AI systems make safe decisions.

problem Ensuring generative AI systems make safe decisions as they gain autonomy.
method Developed a conceptual framework combining flow-based models and adversarial robustness.
result Increased autonomy requires new OR approaches for feasibility, robustness, and stress testing.

SnareNet adds repair layers to neural networks to ensure outputs meet physical constraints.

problem Unconstrained neural network predictions violate physical or safety requirements.
method SnareNet appends a differentiable repair layer that navigates constraints to produce feasible outputs.
result SnareNet consistently improves objective quality while satisfying constraints more reliably.

Improved online convex optimization with long-term constraints achieving low regret and constraint violations.

problem Online convex optimization with long-term constraints over complicated sets.
method A new simple algorithm achieving O(T)O(\sqrt{T}) regret and O(1)O(1) constraint violations.
result Improved performance with O(T)O(\sqrt{T}) regret and O(1)O(1) constraint violations.

MorphNet automates neural network structure design for resource constraints.

problem Designing efficient neural network structures for resource-limited devices.
method Iteratively shrinks and expands networks using resource-weighted sparsifying regularizers and uniform multiplicative factors.
result Discover novel structures that improve performance while respecting resource constraints.

We establish a sharp extrinsic lower bound for the first eigenvalue of the Dirac operator of an untrapped surface in initial data sets without apparent horizon in terms of the norm of its mean curvature vector. The equality case leads to rigidity results for the constraint equations with spherical boundary as well as u…

2011-10-15abs ↗pdf ↗