KoPA approximates matrices using Kronecker products for better flexibility.
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.
Trend · papers per month
The ROC curve is widely used to assess the quality of prediction/classification/ranking algorithms, and its properties have been extensively studied. The precision-recall (PR) curve has become the de facto replacement for the ROC curve in the presence of imbalance, namely where one class is far more likely than the oth…
We study the triple $(G,π,\prs)$ where is a connected and simply connected Lie group, and $\prs$ are, respectively, a multiplicative Poisson tensor and a left invariant Riemannian metric on such that the necessary conditions, introduced by Hawkins, to the existence of a non commutative deformation (in the d…
Solves a challenging problem in imaging and communication.
Classifies solutions to vacuum weighted Einstein equations on pr-waves.
This work improves understanding of projection robust optimal transport distances.
Proposes MCC-F1 curve for better binary classification evaluation.
The broad set of deep generative models (DGMs) has achieved remarkable advances. However, it is often difficult to incorporate rich structured domain knowledge with the end-to-end DGMs. Posterior regularization (PR) offers a principled framework to impose structured constraints on probabilistic models, but has limited …
PRS improves rejection sampling by learning better proposals.
Geometric analysis of ROC and PR curves for binary classification.
A garland based on a manifold is a finite set of manifolds homeomorphic to with some of them glued together at marked points. Fix a manifold and consider a space $\NN$ of all smooth mappings of garlands based on into . We construct operations and on the bordism groups $\bor_*(\NN)$ …
Let X be a geodesic metric space. Gromov proved that there exists k>0 such that if every sufficiently large triangle T satisfies the Rips condition with constant k times pr(T), where pr(T) is the perimeter T, then X is hyperbolic. We give an elementary proof of this fact, also giving an estimate for k. We also show tha…
In this paper we define a Poincaré-Reidemeister scalar product on the determinant line of the cohomology of any flat vector bundle over a closed orientable odd-dimensional manifold. It is a combinatorial "torsion-type" invariant which refines the PR-metric, introduced earlier by the first author, and contains an additi…
New metrics fail adversarial tests, with some more robust than others.
In this article we revisit the definition of Precision-Recall (PR) curves for generative models proposed by Sajjadi et al. (arXiv:1806.00035). Rather than providing a scalar for generative quality, PR curves distinguish mode-collapse (poor recall) and bad quality (poor precision). We first generalize their formulation …
PR-GNN identifies salient brain regions for ASD biomarkers.
Correction for Error estimates for binomial approximations of game options [math.PR/0607123]
Unified four trade-off curves for assessing generative model proximity.
New method detects inconsistencies in AHP matrices using triadic preference reversals.
The paper tackles performative risk optimization under weak convexity assumptions.
New PSDMF algorithms derived from PR and ARM methods.
DCC separates marginal estimation from dependence modeling for improved classification accuracy.
Optimal spectral initializers impact phase retrieval phase transitions.
Study symplectic embeddings of 4-manifolds using Lefschetz fibrations.
We propose a general technique for improving alternating optimization (AO) of nonconvex functions. Starting from the solution given by AO, we conduct another sequence of searches over subspaces that are both meaningful to the optimization problem at hand and different from those used by AO. To demonstrate the utility o…
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childlparents] depend monotonically on weighted sums of the parents. In large networks where exact probabilistic inference is intractable, we show how to compute upper and lower bounds on many probabilities of intere…
New method detects global factors near BBP phase transition in high-dimensional data.
Assessing the performance of a learned model is a crucial part of machine learning. However, in some domains only positive and unlabeled examples are available, which prohibits the use of most standard evaluation metrics. We propose an approach to estimate any metric based on contingency tables, including ROC and PR cu…
We construct new knot polynomials. Let be the standard solid torus in 3-space and let be its standard projection onto an annulus. Let be the space of all smooth oriented knots in such that the restriction of is an immersion (e.g. regular diagrams of a classical knot in the complement of its meridi…
Study evaluates machine learning methods for large-scale network reliability, revealing ANN's and PR's performance.
The paper analyzes the performance of constant step-size stochastic approximation algorithms.
When sufficient labeled data are available, classical criteria based on Receiver Operating Characteristic (ROC) or Precision-Recall (PR) curves can be used to compare the performance of un-supervised anomaly detection algorithms. However , in many situations, few or no data are labeled. This calls for alternative crite…
Method calculates -invariants for a family of Brieskorn spheres.
A new method avoids saddle points in Newton's method.
Paper analyzes LSA algorithm bias and error bounds with RR extrapolation.
We consider -dimensional linear stochastic approximation algorithms (LSAs) with a constant step-size and the so called Polyak-Ruppert (PR) averaging of iterates. LSAs are widely applied in machine learning and reinforcement learning (RL), where the aim is to compute an appropriate (that is a…
A new method for nonparametric regression using mesh-based solutions.
Recently, deep learning approaches with various network architectures have achieved significant performance improvement over existing iterative reconstruction methods in various imaging problems. However, it is still unclear why these deep learning architectures work for specific inverse problems. To address these issu…
This paper develops an ensemble learning-based linearization approach for power flow, which differs from the network-parameter based direct current (DC) power flow or other extended versions of linearization. As a novel data-driven linearization through data mining, it firstly applies the polynomial regression (PR) as …
Enhances clinical trial predictions by quantifying uncertainty.
Bayesian optimization tackles expensive discrete and mixed parameter spaces.
In the present paper, we prove that a lower bound on the -weighted Ricci curvature is equivalent to a convexity of entropies on the Wasserstein space. Based on such characterization, we provide some interpolation inequalities such as the Pr'ekopa-Leindler inequality, the Borel-Branscamp-Lieb inequality, and the Brun…
In this paper we study the behavior of the scalar curvature of a complete hypersurface immersed with constant mean curvature into a Riemannian space form of constant curvature, deriving a sharp estimate for the infimum of . Our results will be an application of a weak Omori-Yau maximum principle due to Pigola, R…
When there is a family of complex structures on the phase space, parametrized by a set , the prequantum Hilbert spaces produced by geometric quantization, using the half-form correction, also depends on these parameters. This way we obtain a field of Hilbert spaces . We show that this field …
This paper introduces a new method to train normalizing flows using precision-recall divergences.
In many situations, we need to build and deploy separate models in related environments with different data qualities. For example, an environment with strong observation equipments (e.g., intensive care units) often provides high-quality multi-modal data, which are acquired from multiple sensory devices and have rich-…
The paper studies Morse flows on 3-manifold boundaries with fixed points.
Automatic Offline Handwritten Signature Verification has been researched over the last few decades from several perspectives, using insights from graphology, computer vision, signal processing, among others. In spite of the advancements on the field, building classifiers that can separate between genuine signatures and…