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

2685368031,071 · Jun 202019922001200920172026
48 results for metric constrained problems

Solves large-scale metric constrained problems using Project and Forget algorithm.

problem Finding consistent metric representations for large dissimilarity datasets.
method Active set algorithm with Bregman projections, converges to global optimal solution.
result Algorithm efficiently solves metric constrained problems with exponentially many constraints.

Study uses outer metrics for PDE-constrained shape optimization over diffeomorphism group.

problem Optimizing shapes governed by PDEs over the diffeomorphism group.
method Outer metrics on diffeomorphism group, Riemannian steepest descent method.
result Riemannian approach outperforms other metrics in solving PDE-constrained shape optimization problems.

We outline a new approach for solving optimization problems which enforce triangle inequalities on output variables. We refer to this as metric-constrained optimization, and give several examples where problems of this form arise in machine learning applications and theoretical approximation algorithms for graph cluste…

2018-06-05abs ↗pdf ↗

A new method for optimizing non-decomposable metrics with constraints.

problem Optimizing complex machine learning objectives with thresholded constraints.
method Formulate rate-constrained optimization using the Implicit Function theorem and solve with gradient-based methods.
result Demonstrated effectiveness over existing methods on benchmark datasets.

The paper optimizes policies constrained to Schur stabilizing controllers using a Newton-type algorithm.

problem Optimizing policies under linear constraints in control systems.
method Newton-type algorithm on a manifold of Schur stabilizing controllers with a Riemannian metric.
result Local convergence guarantees for the Newton-type algorithm without relying on exponential mapping or retractions.

New method uses constrained transport metric for robust Bayesian inference.

problem Flexible Bayesian models with many uninterpretable parameters.
method Exponentially tilted empirical likelihood with a novel Wasserstein metric, combined with a prior.
result Superior performance compared to state-of-the-art robust Bayesian inference methods.

We derive an interpolation version of constrained matrix Li-Yau-Hamilton estimate on Kähler manifolds. As a result, we first get a constrained matrix Li-Yau-Hamilton estimate for heat equation on a Kähler manifold with fixed Kähler metric. Secondly, we get a corresponding estimate for forward conjugate heat equation on…

2014-07-01abs ↗pdf ↗

In most machine learning applications, classification accuracy is not the primary metric of interest. Binary classifiers which face class imbalance are often evaluated by the FβF_β score, area under the precision-recall curve, Precision at K, and more. The maximization of many of these metrics can be expressed as a con…

2018-02-28abs ↗pdf ↗

We present a general framework for solving a large class of learning problems with non-linear functions of classification rates. This includes problems where one wishes to optimize a non-decomposable performance metric such as the F-measure or G-mean, and constrained training problems where the classifier needs to sati…

2019-09-06abs ↗pdf ↗

Investigates model risk and semi-static hedging for martingale constrained models.

problem Model risk distributionally robust sensitivities for functionals on the Wasserstein space.
method Introduces distributionally robust problem with semi-static hedging strategies.
result Explicit characterizations of model risk optimal semi-static hedging strategies.

Optimal transport with path constraints for distributions of different masses.

problem Comparing distributions with different total masses under path constraints.
method Introduces a model for unbalanced optimal transport with path constraints, proving existence of solutions.
result Existence of solutions to path constrained unbalanced optimal transport for various constraints.

We address the problem of merging graph and feature-space information while learning a metric from structured data. Existing algorithms tackle the problem in an asymmetric way, by either extracting vectorized summaries of the graph structure or adding hard constraints to feature-space algorithms. Following a different …

2020-02-13abs ↗pdf ↗

This paper introduces a geometrically constrained variational problem for the area functional. We consider the area restricted to the langrangian surfaces of a Kaehler surface, or, more generally, a symplectic 4-manifold with suitable metric, and study its critical points and in particular its minimizers. We apply this…

2000-08-28abs ↗pdf ↗

Develops a theory to make learning solutions fair and safe.

problem Ensuring learning solutions are unbiased and safe in critical applications.
method Generates a generalization theory based on PAC learning framework, introduces constrained learning algorithm.
result Proves that constrained learning is as learnable as unconstrained learning, provides practical algorithm.

In this paper we use the relationship between conformal metrics on the sphere and horospherically convex hypersurfaces in the hyperbolic space for giving sufficient conditions on a conformal metric to be radial under some constrain on the eigenvalues of its Schouten tensor. Also, we study conformal metrics on the spher…

2008-08-19abs ↗pdf ↗

We define new Riemannian structures on 7-manifolds by a differential form of mixed degree which is the critical point of a (possibly constrained) variational problem over a fixed cohomology class. The unconstrained critical points generalise the notion of a manifold of holonomy G2G_2, while the constrained ones give ri…

2004-11-29abs ↗pdf ↗

Consistent algorithms for multiclass learning with complex metrics and constraints.

problem Learning with complex performance metrics and constraints.
method General framework for designing consistent algorithms by viewing the problem as an optimization over feasible confusion matrices.
result Rates of convergence to the optimal (feasible) classifier, showing asymptotic consistency.

Optimal transport (OT) distances between probability distributions are parameterized by the ground metric they use between observations. Their relevance for real-life applications strongly hinges on whether that ground metric parameter is suitably chosen. Selecting it adaptively and algorithmically from prior knowledge…

2019-11-08abs ↗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.

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.

The paper explores conditions for Randers metrics to have compatible linear connections.

problem Conditions for Randers metrics to have compatible linear connections.
method Solving constrained optimization problems for tensors.
result Necessary and sufficient conditions for a Randers metric to be a generalized Berwald metric.

We study constrained generalized Killing spinors over the metric cone and cylinder of a (pseudo-)Riemannian manifold, developing a toolkit which can be used to investigate certain problems arising in supersymmetric flux compactifications of supergravity theories. Using geometric algebra techniques, we give conceptually…

2012-12-31abs ↗pdf ↗

New method tackles constrained optimization in multi-fidelity Bayesian optimization.

problem Efficiently identifying feasible regions in constrained optimization problems.
method Proposes CMFBO method with novel acquisition functions.
result Demonstrates effectiveness on synthetic problems and real-world ICF and joint design problems.

We present pairwise fairness metrics for ranking models and regression models that form analogues of statistical fairness notions such as equal opportunity, equal accuracy, and statistical parity. Our pairwise formulation supports both discrete protected groups, and continuous protected attributes. We show that the res…

2019-06-12abs ↗pdf ↗