Novel representer theorem for metric and preference learning in RKHSs.
problem Metric and preference learning problems in Hilbert spaces.
method Regularization with respect to task structure norm, RKHS representation, and novel algorithm.
result Significant performance improvement over baseline methods in real-world rank inference benchmarks.
Novel framework for uncertainty quantification in metric spaces.
problem Uncertainty quantification in regression models with metric responses.
method Developed algorithms for large datasets, agnostic to predictive models, with asymptotic and non-asymptotic guarantees.
result Asymptotic and non-asymptotic guarantees for special cases, demonstrated in clinical applications.
In this paper we prove that the space of flat metrics (nonpositively curved Euclidean cone metrics) on a closed, oriented surface is marked length spectrally rigid. In other words, two flat metrics assigning the same lengths to all closed curves differ by an isometry isotopic to the identity. The novel proof suggests a…
Recently, metric learning and similarity learning have attracted a large amount of interest. Many models and optimisation algorithms have been proposed. However, there is relatively little work on the generalization analysis of such methods. In this paper, we derive novel generalization bounds of metric and similarity …
AlphaSharpe uses LLMs to improve financial metrics robustness and predictive power.
problem Traditional financial metrics struggle with robustness and generalization in volatile markets.
method Iterative optimization of financial metrics using LLMs, including crossover, mutation, and evaluation.
result AlphaSharpe discovers enhanced risk-return metrics with 3x predictive power and 2x portfolio performance.
Novel metric space magnitude and weighting vectors improve machine learning tasks.
problem Improving machine learning algorithms using novel metric space concepts.
method Metric space magnitude and weighting vectors for better machine learning.
result The weighting vector effectively detects boundaries and improves classic machine learning tasks.
Novel metrics improve machine learning models for ICU patient care.
problem Predicting vital sign trajectories for early detection of adverse events.
method Developed novel performance metrics aligned with clinical contexts, validated on simulated and real datasets, and optimized neural networks using these metrics.
result Neural networks trained with these metrics excel in predicting clinically significant events.
Novel method decorrelates batches of triplets for active metric learning.
problem Correlation among triplets degrades active learning performance.
method Proposes a novel method to decorrelate batches of triplets, balancing informativeness and diversity.
result Method outperforms state-of-the-art in active metric learning.
A large amount of data accommodated in knowledge graphs (KG) is actually metric. For example, the Wikidata KG contains a plenitude of metric facts about geographic entities like cities, chemical compounds or celestial objects. In this paper, we propose a novel approach that transfers orometric (topographic) measures to…
New measures quantify diversity of latent representations using metric space magnitude.
problem Evaluating the diversity of latent representations in machine learning models.
method Developed magnitude-based measures for latent representations, stable under data perturbations.
result Demonstrated superior performance across various domains and tasks.
BeST metric selects best source models for transfer learning.
problem Efficiently selecting top source models for a new target task.
method Quantization-level optimization procedure for similarity measure.
result BeST consistently identifies best source models for target tasks.
A novel criterion selects optimal distance metrics for cell profile analysis.
problem Determining the most accurate distance metric for high-dimensional cell profiles.
method Generalized proposition and corollaries to evaluate and select distance metrics.
result Wasserstein and cosine similarity metrics are optimal for general cases.
Novel algorithm optimizes decision trees for nonlinear metrics.
problem Optimizing decision trees for nonlinear metrics like F1-score.
method Bi-objective optimisation approach to find optimal trees on Pareto frontier.
result The optimal tree for nonlinear metrics lies on the Pareto frontier.
Proposes a method to select fair performance metrics through metric elicitation.
problem Choosing fair performance metrics in multiclass classification with multiple sensitive groups.
method Metric elicitation strategy that requires only relative preference feedback and is robust to noise.
result Elicits group-fair performance metrics for multiclass classification problems.
This paper investigates the theoretical foundations of metric learning, focused on three key questions that are not fully addressed in prior work: 1) we consider learning general low-dimensional (low-rank) metrics as well as sparse metrics; 2) we develop upper and lower (minimax)bounds on the generalization error; 3) w…
The paper proves the existence of singular cscK metrics on smoothable varieties.
problem Existence of singular cscK metrics on smoothable varieties.
method Developing a strong topology of pluripotential theory in families and uniform estimates for cscK metrics.
result Existence of singular cscK metrics on Q-Gorenstein smoothable klt varieties when the Mabuchi functional is coercive. Paper introduces negative margin loss for better few-shot classification accuracy.
problem Improving few-shot classification accuracy with metric learning.
method Introduces negative margin loss and analyzes its impact on feature discriminability.
result Negative margin loss outperforms regular softmax loss on few-shot classification benchmarks.
This thesis formalizes metric selection for machine learning applications.
problem Selecting the right performance metric for machine learning models.
method Metric Elicitation framework using pairwise preference feedback.
result Novel strategies for eliciting various classification metrics robust to noise.
Building an open-domain conversational agent is a challenging problem. Current evaluation methods, mostly post-hoc judgments of static conversation, do not capture conversation quality in a realistic interactive context. In this paper, we investigate interactive human evaluation and provide evidence for its necessity; …
Study on new metrics on para-Kähler-Norden manifolds with conformal deformation.
problem Exploring geometric and harmonic properties of new metrics.
method Conformal deformation of Berger-type metric, analysis of Levi-Civita link, study of curvature varieties, and harmonic maps.
result Detailed examination of curvature varieties and harmonic maps on the manifold.
Paper proposes a novel metric learning algorithm using Riemannian optimization.
problem Optimizing a smooth, convex function in Riemannian space with constraints.
method Developed a primal-dual algorithm with proximal operator for iterative optimization.
result Demonstrated the efficacy of the proposed metric learning algorithm on fund selection.
SAMBA improves safe reinforcement learning with active exploration metrics.
problem Safe reinforcement learning in dynamic systems.
method Combines probabilistic modelling, information theory, and statistics. Uses novel metrics for out-of-sample Gaussian process evaluation.
result Orders of magnitude reduction in samples and violations compared to state-of-the-art methods.
Novel Hodge theory developed for Carrollian bundles, addressing black hole event horizons.
problem Developing Hodge theory on Carrollian bundles with degenerate metrics.
method Constructing Hodge star and Laplacian operators on Carrollian Rimes-bundles. result Hodge--de Rham Laplacian defined on event horizons of Schwarzschild black holes.
A new metric-based principal curve method learns 1D manifolds from spatial data.
problem Learning 1D manifolds from spatial data.
method Metric-based Principal Curve (MPC) approach.
result The method effectively learns the shape of 1D manifolds from synthetic and real datasets.
A new method embeds distributions in a common space for optimal transport comparison.
problem Comparing distributions in different metric spaces.
method Sub-embedding robust Wasserstein (SERW) distance.
result SERW mimics GW distance properties and provides a cost relation.
In machine learning, the choice of a learning algorithm that is suitable for the application domain is critical. The performance metric used to compare different algorithms must also reflect the concerns of users in the application domain under consideration. In this work, we propose a novel probability-based performan…
Relative moduli spaces of periodic monopoles provide novel examples of Asymptotically Locally Flat hyperkahler manifolds. By considering the interactions between well-separated periodic monopoles, we infer the asymptotic behavior of their metrics. When the monopole moduli space is four-dimensional, this construction yi…
New framework for studying eigenvalue functionals of metrics.
problem Understanding critical points of eigenvalue functionals.
method Clarke subdifferential theory to unify previous research.
result Unified understanding of critical metrics and new examples.
In this paper, we present a novel two-stage metric learning algorithm. We first map each learning instance to a probability distribution by computing its similarities to a set of fixed anchor points. Then, we define the distance in the input data space as the Fisher information distance on the associated statistical ma…
GAGA learns a warped metric for geometry-aware data generation and interpolation.
problem Challenges in generating data with meaningful geometry in high-dimensional datasets.
method Combines manifold learning with generative modeling to learn a warped Riemannian metric.
result GAGA improves trajectory inference by 30% in single-cell population-level data.
We propose a novel Riemannian manifold preconditioning approach for the tensor completion problem with rank constraint. A novel Riemannian metric or inner product is proposed that exploits the least-squares structure of the cost function and takes into account the structured symmetry that exists in Tucker decomposition…
EAST aligns neural network classifiers with user-defined evaluation metrics.
problem Mismatch between neural network training and evaluation metrics leads to suboptimal performance.
method EAST uses dynamic thresholding, soft-set confusion matrix, and annealing to align neural network predictions with target evaluation metrics.
result EAST improves alignment between training objectives and evaluation metrics, outperforming existing methods.
Sharp estimates on 2-step nilpotent Lie groups' metrics and cones.
problem Estimating asymptotic metrics in 2-step nilpotent Lie groups.
method Developed a novel technique to perturb rectifiable curves.
result Every 2-step nilpotent Riemannian Lie group is at bounded distance from its asymptotic cone.
New formulation of Schrödinger connections preserves vector lengths in geometry.
problem Preserving vector lengths in non-Euclidean geometries.
method Coordinate-free formulation, differential geometry, torsion, non-metricity.
result Explicit example of non-static Einstein manifold with torsion.
Proposes a novel deep DL approach for inference tasks.
problem Improvements needed in Deep DL methods for inference tasks and denoising.
method Combines DL layers with RNNs to learn a deep transform and metric.
result Outperforms existing DDL and state-of-the-art CNNs in inference applications.
New probabilistic constructions for Kähler-Einstein metrics.
problem Finding Kähler-Einstein metrics on complex algebraic varieties.
method Microcanonical measures and maximum entropy principles.
result Novel characterizations and evolution equations.
Researchers prove existence of a special Einstein metric on a 12-dimensional sphere.
problem Proving the existence of a non-round Einstein metric invariant under a specific group action.
method Numerical analysis techniques were used to produce an approximate Einstein metric, which was then perturbed into a true Einstein metric.
result A novel O(3)imesO(10)-invariant Einstein metric on S12 was successfully constructed. Study connects K3 surfaces to holomorphic metrics, solving complex structure variation.
problem Understanding complex structure variation on K3 surfaces.
method Using Picard-Fuchs equations and lattice polarizations.
result Explicit example of locally conformally flat holomorphic metric.
We derive and study supergravity BPS flow equations for M5 or D3 branes wrapping a Riemann surface. They take the form of novel geometric flows intrinsically defined on the surface. Their dual field-theoretic interpretation suggests the existence of solutions interpolating between an arbitrary metric in the UV and the …
We study the model selection problem in conditional average treatment effect (CATE) prediction. Unlike previous works on this topic, we focus on preserving the rank order of the performance of candidate CATE predictors to enable accurate and stable model selection. To this end, we analyze the model performance ranking …
Paper proposes a robust metric learning algorithm.
problem Robustness of metric learning against adversarial perturbations is insufficient.
method Proposes a novel Mahalanobis distance metric learning algorithm.
result Certifiable robustness improvement over Euclidean distance.
Study on earthquake metric on Teichmüller space, proving properties and new completions.
problem Understanding the earthquake metric on Teichmüller space.
method Proofs of properties, new completions, and interpretation of the metric.
result Coincidence of various completions for the earthquake metric.
We propose a framework for constructing and analyzing multiclass and multioutput classification metrics, i.e., involving multiple, possibly correlated multiclass labels. Our analysis reveals novel insights on the geometry of feasible confusion tensors -- including necessary and sufficient conditions for the equivalence…
We define a novel class of distances between statistical multivariate distributions by modeling an optimal transport problem on their marginals with respect to a ground distance defined on their conditionals. These new distances are metrics whenever the ground distance between the marginals is a metric, generalize both…
Hierarchical graph clustering is a common technique to reveal the multi-scale structure of complex networks. We propose a novel metric for assessing the quality of a hierarchical clustering. This metric reflects the ability to reconstruct the graph from the dendrogram, which encodes the hierarchy. The optimal represent…
Novel coarse extrinsic curvature for Riemannian submanifolds.
problem Understanding extrinsic curvature of submanifolds.
method Derived from Wasserstein 1-distance between probability measures.
result New insights and approximation of mean curvature from data.
Paper proposes a supervised similarity framework for corporate bonds using RF proximities.
problem Challenges in measuring similarity for corporate bonds due to noisy data and lack of ground truth.
method Proposes a supervised similarity framework using Random Forest for corporate bonds, introducing a novel metric to evaluate similarities.
result Random Forest outperforms other methods in evaluating similarities for corporate bonds.
Generatability in metric spaces studied with novel novelty parameters.
problem Understanding generatability in metric spaces with asymmetric novelty parameters.
method Introducing (ε,ε′)-closure dimension to characterize uniform and non-uniform generatability. result Generatability is stable across novelty scales in doubling spaces but can be highly scale-sensitive in general metric spaces.