New metrics improve landing algorithms for orthogonality constraints.
problem Optimizing landing algorithms with orthogonality constraints.
method Proposed a family of metrics over full-rank matrices to enhance landing algorithms.
result Natural extension of β-metric improves landing performance.
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.
This paper proposes an active metric learning method for clustering with pairwise constraints.
problem Clustering with pairwise constraints and improving clustering performance.
method Active metric learning method that queries informative instance pairs and updates the learned metric sequentially.
result The proposed method enhances clustering performance and provides a tighter error bound.
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.
A scalable method for deep metric learning using chance constraints.
problem Improving deep metric learning by addressing feasibility issues.
method Relating DML to chance constraints, reformulating as a feasibility problem, and iteratively training proxies.
result The method effectively improves deep metric learning performance across multiple benchmarks.
A new algorithm solves the metric nearness problem efficiently.
problem Finding the nearest distance matrix that satisfies triangle inequalities.
method Delayed constraint generation with semismooth Newton based proximal augmented Lagrangian method (PALM).
result Solves problems with up to 10^8 variables and 10^13 constraints efficiently.
New algorithm clusters data and learns kernels without relaxing constraints.
problem Learning kernels or distance metrics from pairwise constraints without losing generalization.
method Joint clustering and kernel learning without relaxing constraints.
result Outperforms existing approaches on diverse datasets.
Most existing distance metric learning methods assume perfect side information that is usually given in pairwise or triplet constraints. Instead, in many real-world applications, the constraints are derived from side information, such as users' implicit feedbacks and citations among articles. As a result, these constra…
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…
Recent work in distance metric learning has focused on learning transformations of data that best align with provided sets of pairwise similarity and dissimilarity constraints. The learned transformations lead to improved retrieval, classification, and clustering algorithms due to the better adapted distance or similar…
Algorithm identifies intended fairness constraints from expert demonstrations for fair clustering.
problem Fair clustering challenges due to incomplete fairness constraints.
method Algorithm identifies fairness metric from expert demonstrations and generates clusters.
result Algorithm identifies and generates fair clusters from limited expert demonstrations.
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.
The paper studies metrics on hyperkähler manifolds using sub-twistor constraints.
problem Understanding metrics on hyperkähler manifolds with non-holonomic constraints.
method Introducing and analyzing sub-conic metrics, showing they are sub-Finsler.
result Explicit description of Finsler norms for sub-twistor metrics.
We improve Riemannian metrics for constrained systems control.
problem Controlling mechanical systems with configuration constraints.
method Constructing complete Riemannian metrics by modifying incomplete ones.
result A controller can be found to satisfy a design criterion.
A number of machine learning algorithms are using a metric, or a distance, in order to compare individuals. The Euclidean distance is usually employed, but it may be more efficient to learn a parametric distance such as Mahalanobis metric. Learning such a metric is a hot topic since more than ten years now, and a numbe…
Sharp dimension constraints for positive intermediate curvature metrics are established.
problem Proving sharp dimension constraints for metrics with positive intermediate curvature.
method Constructing counterexamples and extending rigidity results.
result Sharp dimension constraints for positive intermediate curvature metrics are established.
We consider the problem of metric learning subject to a set of constraints on relative-distance comparisons between the data items. Such constraints are meant to reflect side-information that is not expressed directly in the feature vectors of the data items. The relative-distance constraints used in this work are part…
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 …
Proposes a method to learn both constraints and objective functions from data.
problem Data-driven inverse optimization for mixed-integer linear programs (MILPs).
method Two-stage approach: first learns constraints, then estimates objective-function weights conditioned on learned constraints.
result Proposes and validates a method for learning both objective functions and constraints from data.
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.
Developing classification algorithms that are fair with respect to sensitive attributes of the data has become an important problem due to the growing deployment of classification algorithms in various social contexts. Several recent works have focused on fairness with respect to a specific metric, modeled the correspo…
Study properties of 3D almost η-Ricci solitons with diagonal metrics.
problem Characterize 3D almost η-Ricci solitons with diagonal metrics.
method Analyzes manifold properties under specific assumptions and constraints.
result Determines potential vector field and constraints on the metric.
In this note we prove an existence result for the Einstein conformal constraint equations for metrics with vanishing Yamabe invariant assuming that the TT-tensor is small in L2.
We show that many machine learning goals, such as improved fairness metrics, can be expressed as constraints on the model's predictions, which we call rate constraints. We study the problem of training non-convex models subject to these rate constraints (or any non-convex and non-differentiable constraints). In the non…
Most of metric learning approaches are dedicated to be applied on data described by feature vectors, with some notable exceptions such as times series, trees or graphs. The objective of this paper is to propose a metric learning algorithm that specifically considers relational data. The proposed approach can take benef…
Paper finds inequalities for eigenvalues of buckling problems on special metric spaces.
problem Eigenvalue inequalities for buckling problems of drifting Laplacian.
method Investigated on bounded domains in complete smooth metric measure spaces (SMMSs) with special functions.
result General inequalities for eigenvalues derived under curvature constraints.
This dissertation uses ILP to learn Bayesian network structures efficiently.
problem Learning the structure of Bayesian networks from data.
method Integer Linear Programming formulation with cluster constraints and cutting planes.
result The approach finds feasible solutions for Bayesian network structures efficiently.
Proves Hölder-type inequality for Lagrangians' distance.
problem Understanding the symplectic geometry of Lagrangians.
method Developed methods from previous works to establish the inequality.
result Established a Hölder-type inequality for the Hausdorff distance between Lagrangians.
Distance metric learning is an important component for many tasks, such as statistical classification and content-based image retrieval. Existing approaches for learning distance metrics from pairwise constraints typically suffer from two major problems. First, most algorithms only offer point estimation of the distanc…
Semi-supervised clustering methods incorporate a limited amount of supervision into the clustering process. Typically, this supervision is provided by the user in the form of pairwise constraints. Existing methods use such constraints in one of the following ways: they adapt their clustering procedure, their similarity…
Recent work in distance metric learning has focused on learning transformations of data that best align with specified pairwise similarity and dissimilarity constraints, often supplied by a human observer. The learned transformations lead to improved retrieval, classification, and clustering algorithms due to the bette…
The extended constraint equations arise as a special case of the conformal constraint equations that are satisfied by an initial data hypersurface Z in an asymptotically simple spacetime satisfying the vacuum conformal Einstein equations developed by H. Friedrich. The extended constraint equations consist of a quasi-…
Establishes a connection between Kähler metrics and vector bundle sections.
problem Finding Kähler metrics in a conformal class.
method One-to-one correspondence between Kähler metrics and parallel sections of a vector bundle with conformally invariant connection.
result Obstructions for a Riemannian metric to be conformal to a Kähler metric.
Generative modelling is often cast as minimizing a similarity measure between a data distribution and a model distribution. Recently, a popular choice for the similarity measure has been the Wasserstein metric, which can be expressed in the Kantorovich duality formulation as the optimum difference of the expected value…
Paper tackles constrained bandit problems with a new learning framework.
problem Optimizing a black-box reward function subject to a black-box constraint function over a continuous space.
method Rectified Pessimistic-Optimistic Learning (RPOL) framework, incorporating optimistic and pessimistic GP bandit learning.
result RPOL achieves sublinear regret and minimal cumulative constraint violation.
We construct low regularity solutions of the vacuum Einstein constraint equations. In particular, on 3-manifolds we obtain solutions with metrics in $H^s\loc$ with s>23. The theory of maximal asymptotically Euclidean solutions of the constraint equations descends completely the low regularity setting. Moreove…
This work optimizes model performance while ensuring fairness through AUC constraints.
problem Ensuring fairness in machine learning models, especially for protected populations.
method Formulates fairness-aware machine learning model training as AUC optimization subject to fairness constraints, solves using stochastic first-order methods.
result Demonstrates effectiveness of the approach on real-world data under different fairness metrics.
Under the assumption of asymptotic relative Chow-stability for polarized algebraic manifolds (M,L), a series of weighted balanced metrics ωm, m≫1, called polybalanced metrics, are obtained from complete linear systems ∣Lm∣ on M. Then the asymptotic behavior of the weights as m→∞ will be stud…
Equations link metrics with tensors, revealing curvature constraints.
problem Understanding curvature properties of geometric structures.
method Formal analogies to Einstein-Maxwell equations, studying Codazzi and conformal Killing equations.
result Constraints on scalar curvature of metrics in solutions.
New metric properties show volume constraints in collapsing spaces.
problem Volume constraints in collapsing spaces.
method Generalization of recent progress in metric geometry involving the volume of balls of radius in a certain range with collapsing at different scales.
result For every Riemannian metric on a manifold of sufficiently small volume, there is a point with volume constraints in the universal cover.
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.
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 on predicting sequences with Gaussian constraints, linking to intrinsic volumes and metric complexity.
problem Predicting sequences almost as well as the best Gaussian distribution with mean in a given subset.
method Expressed minimax regret in terms of intrinsic volumes, established comparison inequality for Wills functional, characterized global covering numbers and local Gaussian widths.
result Sharp estimates on the log-Laplace transform of intrinsic volume sequence for a general nonconvex set.
Study local topological constraints on Berry curvature in spin-orbit coupled Bose-Einstein condensates.
problem Understanding local topological obstructions to flattening Berry curvature in spin-orbit-coupled Bose-Einstein condensates.
method Adapting Pigazzini-Toda lower bound to Kaluza-Klein setting, analyzing harmonic part of torsion 3-form, and using exact pointwise curvature analysis.
result Obstruction kernel vanishes, preventing complete gauging-away of Berry phases even at zero net topological charge.
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.
Study on Kähler metrics with curvature constraints.
problem Existence of constant weighted scalar curvature Kähler metrics.
method Establish Ck-estimates for Kähler potentials. result Extends prior results on classical cscK metrics.
FISAR uses neural networks to optimize safe reinforcement learning with forward-invariant constraints.
problem Safe reinforcement learning with constraints in safety-critical environments.
method Imposing linear constraints on policy parameters' updating dynamics, using a DNN-based optimizer to satisfy these constraints.
result The policy decreases constraint violation and maximizes cumulative reward monotonically.
We study constrained clustering, where constraints guide the clustering process. In existing works, two categories of constraints have been widely explored, namely pairwise and cardinality constraints. Pairwise constraints enforce the cluster labels of two instances to be the same (must-link constraints) or different (…